Data Structures for Mergeable
Trees
Joint work with Haim Kaplan, Nira Shafrir, Robert E. Tarjan and Renato Werneck
Linear-Time Pointer-Machine Algorithms for Path-Evaluation Problems on Trees
and Graphs
Joint work with Adam L.
Buchsbaum, Haim Kaplan, Ann Rogers, Robert E. Tarjan and Jeffery R. Westbrook
Linear-Time
Algorithms for Independent Branchings and Directed st-Numberings
Joint work with
Robert E. Tarjan
Shortest Path Feasibility Algorithms: An Experimental Evaluation
Boris V. Cherkassky,
Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan and Renato F. Werneck
10th Workshop on Algorithm Engineering and Experiments (ALENEX
2008).
To appear.
Dynamic Matchings in Convex Bipartite Graphs
Gerth S. Brodal, Loukas Georgiadis, Kristoffer A. Hansen and Irit Katriel
In Proceedings of the 32nd International Symposium on Mathematical Fundations
of Computer Science (MFCS 2007),
Lecture Notes in Computer Science, volume 4708, pages 406-417, Springer-Verlag,
2007.
© Springer-Verlag.
Improved Dynamic
Planar Point Location
Lars Arge, Gerth S. Brodal and Loukas Georgiadis
In Proceedings of the
47th IEEE Symposium on Foundations of Computer Science (FOCS 2006), pages
305-314.
© IEEE.
Design of Data Structures for Mergeable Trees
Loukas Georgiadis, Robert E.
Tarjan and Renato F. Werneck
In Proceedings of the 17th
ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pages
394-403, 2006.
© SIAM.
Dominator Tree Verification
and Vertex-Disjoint Paths
Loukas Georgiadis and Robert
E. Tarjan
In Proceedings of the 16th
ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pages
433-442, 2005.
© SIAM.
Finding Dominators in Practice
Loukas Georgiadis, Renato F.
Werneck, Robert E. Tarjan, Spyridon Triantafyllis and
In Proceedings of the 12th
Annual European Symposium on Algorithms (ESA 2004),
Lecture Notes in Computer
Science, volume 3221, pages 677-688, Springer-Verlag, 2004.
© Springer-Verlag.
Finding Dominators Revisited
Loukas Georgiadis and Robert
E. Tarjan
In Proceedings of the 15th
ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pages 862-871, 2004.
© SIAM.
An O(nlogn) Version of the Averbakh-Berman Algorithm
for the Robust Median of a Tree
Gerth S. Brodal, Loukas
Georgiadis, and Irit Katriel
Operations Research Letters. To appear.
Finding Dominators in
Practice
Loukas Georgiadis, Robert E.
Tarjan and Renato F. Werneck
Journal of Graph Algorithms and Applications (JGAA), volume 10, issue 1,
pages 69-94.
Special Issue on Selected Papers from Engineering and Applications Track
of ESA 2004.
Available
on-line from JGAA
PhD Thesis
Linear-Time
Algorithms for Dominators and Related Problems,
Princeton
Department of Computer Science TR-737-05