Revision as of 18:01, 23 December 2024 edit Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,108 edits ce ← Previous edit		Revision as of 14:09, 27 April 2025 edit undo Citation bot (talk \| contribs) Bots 5,865,525 edits Add: isbn, volume, series. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox \| #UCB_webform_linked 71/492 Next edit →
Line 163: \| pages = 79:1–79:20 \| title = Analysis of Smooth Heaps and Slim Heaps \| series = Leibniz International Proceedings in Informatics (LIPIcs) \| year = 2021\| doi-access = free▼ \| year = 2021\| volume = 198 ▲ ~~\| year = 2021~~\| doi-access = free \| isbn = 978-3-95977-195-5 }} *{{citation\|title=The maximum capacity route problem\|first=T. C.\|last=Hu\|author-link=T. C. Hu\|journal=Operations Research\|volume=9\|issue=6\|year=1961\|pages=898–900\|jstor=167055\|doi=10.1287/opre.9.6.898\|doi-access=free}}

Cartesian tree: Difference between revisions