( en | de | ru )

 

Disambiguation of "Tarjan, Robert Endre"

Author of the publication

copydeleteadd this publication to your clipboard
Algorithmic Aspects of Vertex Elimination on Graphs.

, , and . SIAM J. Comput., 5 (2): 266-283 (1976)

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

Correction: Space Bounds for a Game on Graphs., , and . Math. Syst. Theory, (1977)see: Mathematical Systems Theory 10: 239-251 (1977).Randomized parallel algorithms for trapezoidal diagrams., , and . Int. J. Comput. Geom. Appl., 2 (2): 117-133 (1992)Amortized Analysis of Algorithms for Set Union with Backtracking., and . SIAM J. Comput., 18 (1): 1-11 (1989)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)Short Encodings of Evolving Structures., , and . SIAM J. Discret. Math., 5 (3): 428-450 (1992)Parallelism in multigrid methods: How much is too much?, and . Int. J. Parallel Program., 24 (5): 397-432 (1996)Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344., and . Theor. Comput. Sci., 4 (1): 123 (1977)Server Allocation Algorithms for Tiered Systems., , , , , and . Algorithmica, 48 (2): 129-146 (2007)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)