( en | de | ru )

 

Disambiguation of "Tarjan, Robert Endre"

Author of the publication

copydeleteadd this publication to your clipboard
Faster Algorithms for the Shortest Path Problem

, , , and . J. ACM, 37 (2): 213-223 (April 1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Endre Komlos

Endre Palatinus

Endre Mészáros

Endre Bangerter

Endre Hagenthurn

 

Other publications of authors with the same name

Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping, , and . FOCS, page 780-791. IEEE Computer Society, (1994)Dominator Certification and Independent Spanning Trees: An Experimental Study., , , and . SEA, volume 7933 of Lecture Notes in Computer Science, page 284-295. Springer, (2013)Deletion Without Rebalancing in Balanced Binary Trees., and . SODA, page 1490-1499. SIAM, (2010)Sorting Jordan sequences in linear time., , , and . SCG, page 196-203. ACM, (1985)Deadline scheduling for animation rendering., , , , , , , , , and . SIGMETRICS, page 384-385. ACM, (2005)Algorithmic Aspects of Vertex Elimination, and . STOC, page 245-254. ACM, (1975)Confluently Persistent Deques via Data Structural Bootstrapping., and . SODA, page 155-164. ACM/SIAM, (1993)Computing Minimal Spanning Subgraphs in Linear Time., , , and . SODA, page 146-156. ACM/SIAM, (1992)Minimum Cost Flows in Graphs with Unit Capacities., , , and . STACS, volume 30 of LIPIcs, page 406-419. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Self-adjusting top trees., and . SODA, page 813-822. SIAM, (2005)