default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark H. Overmars
Person information
- affiliation: Utrecht University, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2013
[b4]Arjan Egges, Jeroen Fokker, Mark H. Overmars:
Learning C# by Programming Games. Springer 2013, ISBN 978-3-642-36579-9, pp. I-XXII, 1-443- 2012
- [j114]Anka Gajentaan, Mark H. Overmars:
On a class of O(n2) problems in computational geometry. Comput. Geom. 45(4): 140-152 (2012) - [j113]Ioannis Karamouzas, Mark H. Overmars:
Simulating and Evaluating the Local Behavior of Small Pedestrian Groups. IEEE Trans. Vis. Comput. Graph. 18(3): 394-406 (2012) - 2011
- [j112]Greg Aloupis, Prosenjit Bose
, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing Signed Permutations of Polygons. Int. J. Comput. Geom. Appl. 21(1): 87-100 (2011) - [c114]Thomas Geijtenbeek, Nicolas Pronost, Arjan Egges, Mark H. Overmars:
Interactive Character Animation using Simulated Physics. Eurographics (State of the Art Reports) 2011: 127-149 - 2010
- [j111]Herwin van Welbergen, Ben J. H. van Basten, Arjan Egges, Zsófia Ruttkay, Mark H. Overmars:
Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. Comput. Graph. Forum 29(8): 2530-2554 (2010) - [c113]Ioannis Karamouzas, Mark H. Overmars:
A Velocity-Based Approach for Simulating Human Collision Avoidance. IVA 2010: 180-186 - [c112]Ioannis Karamouzas, Mark H. Overmars:
Simulating Human Collision Avoidance Using a Velocity-Based Approach. VRIPHYS 2010: 125-134 - [c111]Ioannis Karamouzas, Mark H. Overmars:
Simulating the local behaviour of small pedestrian groups. VRST 2010: 183-190
2000 – 2009
- 2009
- [j110]Arjan Egges, Arno Kamphuis, Mark H. Overmars:
Guest editors' introduction: Special issue on gaming. Comput. Animat. Virtual Worlds 20(5-6) (2009) - [c110]Herwin van Welbergen, Ben J. H. van Basten, Arjan Egges, Zsófia Ruttkay, Mark H. Overmars:
Real Time Animation of Virtual Humans: A Trade-off Between Naturalness and Control. Eurographics (State of the Art Reports) 2009: 45-72 - [c109]Ioannis Karamouzas, Roland Geraerts, Mark H. Overmars:
Indicative routes for path planning and crowd simulation. FDG 2009: 113-120 - [c108]Ioannis Karamouzas, Jiri Bakker, Mark H. Overmars:
Density constraints for crowd simulation. ICE-GIC 2009: 160-168 - [c107]Ioannis Karamouzas, Peter Heil, Pascal van Beek, Mark H. Overmars:
A Predictive Collision Avoidance Model for Pedestrian Simulation. MIG 2009: 41-52 - [e3]Arjan Egges, Roland Geraerts, Mark H. Overmars:
Motion in Games, Second International Workshop, MIG 2009, Zeist, The Netherlands, November 21-24, 2009. Proceedings. Lecture Notes in Computer Science 5884, Springer 2009, ISBN 978-3-642-10346-9 [contents] - 2008
- [b3]Mark de Berg, Otfried Cheong, Marc J. van Kreveld, Mark H. Overmars:
Computational geometry: algorithms and applications, 3rd Edition. Springer 2008, ISBN 9783540779735, pp. I-XII, 1-386 - [j109]Jur P. van den Berg, Mark H. Overmars:
Planning Time-Minimal Safe Paths Amidst Unpredictably Moving Obstacles. Int. J. Robotics Res. 27(11-12): 1274-1294 (2008) - [j108]Erik D. Demaine, Jeff Erickson, Danny Krizanc, Henk Meijer, Pat Morin, Mark H. Overmars, Sue Whitesides:
Realizing partitions respecting full and partial order information. J. Discrete Algorithms 6(1): 51-58 (2008) - [j107]Ioannis Karamouzas, Mark H. Overmars:
Adding variation to path planning. Comput. Animat. Virtual Worlds 19(3-4): 283-293 (2008) - [c106]Mark H. Overmars, Ioannis Karamouzas, Roland Geraerts:
Flexible Path Planning Using Corridor Maps. ESA 2008: 1-12 - [c105]Roland Geraerts, Arno Kamphuis, Ioannis Karamouzas, Mark H. Overmars:
Using the Corridor Map Method for Path Planning for a Large Number of Characters. MIG 2008: 11-22 - [e2]Arjan Egges, Arno Kamphuis, Mark H. Overmars:
Motion in Games, First International Workshop, MIG 2008, Utrecht, The Netherlands, June 14-17, 2008. Revised Papers. Lecture Notes in Computer Science 5277, Springer 2008, ISBN 978-3-540-89219-9 [contents] - 2007
- [j106]Mark de Berg, Dan Halperin, Mark H. Overmars:
An intersection-sensitive algorithm for snap rounding. Comput. Geom. 36(3): 159-165 (2007) - [j105]Jae-Sook Cheong, A. Frank van der Stappen, Kenneth Y. Goldberg, Mark H. Overmars, Elon Rimon:
Immobilizing Hinged Polygons. Int. J. Comput. Geom. Appl. 17(1): 45-70 (2007) - [j104]Roland Geraerts, Mark H. Overmars:
Creating High-quality Paths for Motion Planning. Int. J. Robotics Res. 26(8): 845-863 (2007) - [j103]Roland Geraerts, Mark H. Overmars:
The corridor map method: a general framework for real-time high-quality path planning. Comput. Animat. Virtual Worlds 18(2): 107-119 (2007) - [j102]Roland Geraerts, Mark H. Overmars:
Reachability-based analysis for Probabilistic Roadmap planners. Robotics Auton. Syst. 55(11): 824-836 (2007) - [j101]Dennis Nieuwenhuisen, Arno Kamphuis, Mark H. Overmars:
High quality navigation in computer games. Sci. Comput. Program. 67(1): 91-104 (2007) - [j100]Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars:
Pushing a Disk Using Compliance. IEEE Trans. Robotics 23(3): 431-442 (2007) - [c104]Roland Geraerts, Mark H. Overmars:
The Corridor Map Method: Real-Time High-Quality Path Planning. ICRA 2007: 1023-1028 - [c103]Dennis Nieuwenhuisen, Jur P. van den Berg, Mark H. Overmars:
Efficient path planning in changing environments. IROS 2007: 3295-3301 - [c102]Jur P. van den Berg, Mark H. Overmars:
Kinodynamic motion planning on roadmaps in dynamic environments. IROS 2007: 4253-4258 - 2006
- [b2]Jacob Habgood, Mark H. Overmars:
The game maker's apprentice - game development for beginners. Apress 2006, ISBN 978-1-59059-615-9, pp. I-XX, 1-311 - [j99]Roland Geraerts, Mark H. Overmars:
Sampling and node adding in probabilistic roadmap planners. Robotics Auton. Syst. 54(2): 165-173 (2006) - [j98]Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir:
Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36(3): 815-834 (2006) - [c101]Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars:
Pushing using Compliance. ICRA 2006: 2010-2016 - [c100]Roland Geraerts, Mark H. Overmars:
Creating High-quality Roadmaps for Motion Planning in Virtual Environments. IROS 2006: 4355-4361 - [c99]Mark H. Overmars:
Scientific challenges ingame technology. VRST 2006: 1 - [c98]Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars:
An Effective Framework for Path Planning Amidst Movable Obstacles. WAFR 2006: 87-102 - [c97]Jur P. van den Berg, Mark H. Overmars:
Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles. WAFR 2006: 103-118 - [i7]Jur P. van den Berg, Mark H. Overmars:
Computing Shortest Safe Path amidst Growing Discs in the Plane. Robot Navigation 2006 - 2005
- [j97]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides:
Separating Point Sets in Polygonal Environments. Int. J. Comput. Geom. Appl. 15(4): 403-420 (2005) - [j96]Michael A. Erdmann, David Hsu, Mark H. Overmars, A. Frank van der Stappen:
Editorial: Special Issue on WAFR 2004. Int. J. Robotics Res. 24(11): 881-882 (2005) - [j95]Jur P. van den Berg, Mark H. Overmars:
Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. Int. J. Robotics Res. 24(12): 1055-1071 (2005) - [j94]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with neighborhoods of varying size. J. Algorithms 57(1): 22-36 (2005) - [j93]Jur P. van den Berg, Mark H. Overmars:
Roadmap-based motion planning in dynamic environments. IEEE Trans. Robotics 21(5): 885-897 (2005) - [c96]Roland Geraerts, Mark H. Overmars:
Reachability Analysis of Sampling Based Planners. ICRA 2005: 404-410 - [c95]Jur P. van den Berg, Mark H. Overmars:
Prioritized motion planning for multiple robots. IROS 2005: 430-435 - [c94]Roland Geraerts, Mark H. Overmars:
On improving the clearance for robots in high-dimensional configuration spaces. IROS 2005: 679-684 - [c93]Dennis Nieuwenhuisen, A. Frank van der Stappen, Mark H. Overmars:
Path planning for pushing a disk using compliance. IROS 2005: 714-720 - [c92]Jur P. van den Berg, Dennis Nieuwenhuisen, Leonard Jaillet, Mark H. Overmars:
Creating robust roadmaps for motion planning in changing environments. IROS 2005: 1053-1059 - [e1]Michael A. Erdmann, Mark H. Overmars, David Hsu, A. Frank van der Stappen:
Algorithmic Foundations of Robotics VI, Selected Contributions of the Sixth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2004, July 11-13, 2004, Zeist, the Netherlands. Springer Tracts in Advanced Robotics 17, Springer 2005, ISBN 978-3-540-25728-8 [contents] - 2004
- [j92]Mark H. Overmars:
Teaching Computer Science through Game Design. Computer 37(4): 81-83 (2004) - [c91]Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides:
Separating point sets in polygonal environments. SCG 2004: 10-16 - [c90]Dennis Nieuwenhuisen, Mark H. Overmars:
Useful Cycles in Probabilistic Roadmap Graphs. ICRA 2004: 446-452 - [c89]Jur P. van den Berg, Mark H. Overmars:
Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap Planners. ICRA 2004: 453-460 - [c88]Roland Geraerts, Mark H. Overmars:
Clearance based Path Optimization for Motion Planning. ICRA 2004: 2386-2392 - [c87]Arno Kamphuis, Mark H. Overmars:
Motion Planning for Coherent Groups of Entities. ICRA 2004: 3815-3822 - [c86]Dennis Nieuwenhuisen, Mark H. Overmars:
Motion Planning for Camera Movements. ICRA 2004: 3870-3876 - [c85]Jur P. van den Berg, Mark H. Overmars:
Roadmap-based motion planning in dynamic environments. IROS 2004: 1598-1605 - [c84]Arno Kamphuis, Mark H. Overmars:
Finding paths for coherent groups using clearance. Symposium on Computer Animation 2004: 19-28 - [c83]Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir:
Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. SODA 2004: 516-525 - [c82]Onno C. Goemans, Mark H. Overmars:
Automatic Generation of Camera Motion to Track a Moving Guide. WAFR 2004: 187-202 - 2003
- [j91]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with low query complexity. Comput. Geom. 24(3): 179-195 (2003) - [j90]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding scenes against invasive hypercubes. Comput. Geom. 26(2): 99-117 (2003) - [j89]Michael A. Soss, Jeff Erickson, Mark H. Overmars:
Preprocessing chains for fast dihedral rotations is hard or even impossible. Comput. Geom. 26(3): 235-246 (2003) - [j88]Mark H. Overmars:
Finding Sets of Points without Empty Convex 6-Gons. Discret. Comput. Geom. 29(1): 153-158 (2003) - 2002
- [j87]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Orienting polyhedral parts by pushing. Comput. Geom. 21(1-2): 21-38 (2002) - [j86]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and motion planning. Comput. Geom. 23(1): 53-68 (2002) - [j85]Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold:
Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002) - [j84]Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning Polygons. Discret. Comput. Geom. 28(2): 231-253 (2002) - [c81]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint:
Computing signed permutations of polygons. CCCG 2002: 68-71 - [c80]Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen:
TSP with Neighborhoods of Varying Size. ESA 2002: 187-199 - [c79]Mark H. Overmars:
Recent Developments in Motion Planning. International Conference on Computational Science (3) 2002: 3-13 - [c78]Jae-Sook Cheong, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Fixturing Hinged Polygons. ICRA 2002: 876-881 - [c77]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Sensorless Orientation of 3D Polyhedral Parts. ICRA 2002: 2016-2021 - [c76]Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions. ISAAC 2002: 369-380 - [c75]Mark H. Overmars:
Algorithms for Motion and Navigation in Virtual Environments and Games. WAFR 2002: 1-6 - [c74]Roland Geraerts, Mark H. Overmars:
A Comparative Study of Probabilistic Roadmap Planners. WAFR 2002: 43-58 - [i6]Michael A. Soss, Jeff Erickson, Mark H. Overmars:
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible. CoRR cs.CG/0204042 (2002) - 2001
- [j83]Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint:
Reconfiguring convex polygons. Comput. Geom. 20(1-2): 85-95 (2001) - [j82]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in Three Dimensions. Discret. Comput. Geom. 26(3): 269-281 (2001) - [j81]Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Trap Design for Vibratory Bowl Feeders. Int. J. Robotics Res. 20(11): 891-908 (2001) - [j80]Mike Tao Zhang, Kenneth Y. Goldberg, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars:
Pin design for part feeding. Robotica 19(6): 695-702 (2001) - [c73]Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Orienting Parts by Inside-out Pulling. ICRA 2001: 1053-1058 - [c72]Danielle Sent, Mark H. Overmars:
Motion Planning in Environments with Dangerzones. ICRA 2001: 1488-1493 - [c71]Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold:
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS 2001: 122-134 - 2000
- [j79]A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars:
Computing Immobilizing Grasps of Polygonal Parts. Int. J. Robotics Res. 19(5): 467-479 (2000) - [c70]Oswin Aichholzer, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Mark H. Overmars, Michael A. Soss, Godfried T. Toussaint:
Reconfiguring Convex Polygons. CCCG 2000 - [c69]A. Frank van der Stappen, Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars:
Geometry and Part Feeding. Sensor Based Intelligent Robots 2000: 259-281 - [c68]Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp:
A New Visibility Partition for Affine Pattern Matching. DGCI 2000: 358-370 - [c67]Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Mark H. Overmars:
On R-trees with Low Stabbing Number. ESA 2000: 167-178 - [c66]Mike Tao Zhang, Gordon Smith, Robert-Paul Berretty, Mark H. Overmars, Kenneth Y. Goldberg:
The Toppling Graph: Designing Pin Sequences for Part Feeding. ICRA 2000: 139-146 - [i5]Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp:
A Robust Affine Invariant Similarity Measure Based on Visibility. EuroCG 2000: 112-116 - [i4]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Orienting Polyhedral Parts by Pushing. EuroCG 2000: 136-139 - [i3]Oswin Aichholzer, Carmen Cortés, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Henk Meijer, Mark H. Overmars, Belén Palop, Suneeta Ramaswami, Godfried T. Toussaint:
Flipturning polygons. CoRR cs.CG/0008010 (2000)
1990 – 1999
- 1999
- [c65]Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Geometric Algorithms for Trap Design. SCG 1999: 95-104 - [c64]Valérie Boor, Mark H. Overmars, A. Frank van der Stappen:
The Gaussian Sampling Strategy for Probabilistic Roadmap Planners. ICRA 1999: 1018-1023 - [c63]A. Frank van der Stappen, Chantal Wentink, Mark H. Overmars:
Computing Form-Closure Configurations. ICRA 1999: 1837-1842 - [c62]Robert-Paul Berretty, Kenneth Y. Goldberg, Lawrence Cheung, Mark H. Overmars, Gordon Smith, A. Frank van der Stappen:
Trap Design for Vibratory Bowl Feeders. ICRA 1999: 2558-2563 - [c61]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867 - [i2]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9910009 (1999) - 1998
- [j78]Johan W. H. Tangelder, Joris S. M. Vergeest, Mark H. Overmars:
Interference-free NC machining using spatial planning and Minkowski operations. Comput. Aided Des. 30(4): 277-286 (1998) - [j77]Robert-Paul Berretty, Kenneth Y. Goldberg, Mark H. Overmars, A. Frank van der Stappen:
Computing fence designs for orienting parts. Comput. Geom. 10(4): 249-262 (1998) - [j76]Dan Halperin, Mark H. Overmars:
Spheres, molecules, and hidden surface removal. Comput. Geom. 11(2): 83-102 (1998) - [j75]Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Dynamic motion planning in low obstacle density environments. Comput. Geom. 11(3-4): 157-173 (1998) - [j74]A. Frank van der Stappen, Mark H. Overmars, Mark de Berg, Jules Vleugels:
Motion Planning in Environments with Low Obstacle Density. Discret. Comput. Geom. 20(4): 561-587 (1998) - [j73]Jules Vleugels, Mark H. Overmars:
Approximating Voronoi Diagrams of Convex Sites in any Dimension. Int. J. Comput. Geom. Appl. 8(2): 201-222 (1998) - [j72]Mark de Berg, Henk Meijer, Mark H. Overmars, Gordon T. Wilfong:
Computing the Angularity Tolerance. Int. J. Comput. Geom. Appl. 8(4): 467-482 (1998) - [j71]Sepanta Sekhavat, Petr Svestka, Jean-Paul Laumond, Mark H. Overmars:
Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems. Int. J. Robotics Res. 17(8): 840-857 (1998) - [j70]Petr Svestka, Mark H. Overmars:
Coordinated path planning for multiple robots. Robotics Auton. Syst. 23(3): 125-152 (1998) - [c60]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides:
Unfolding some classes of orthogonal polyhedra. CCCG 1998 - [c59]Mark H. Overmars:
Geometric Algorithms for Robotic Manipulation. ICALP 1998: 116-117 - [c58]Mark de Berg, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Models and Motion Planning. SWAT 1998: 83-94 - [c57]Mark de Berg, Haggai David, Matthew J. Katz, Mark H. Overmars, A. Frank van der Stappen, Jules Vleugels:
Guarding Scenes against Invasive Hypercubes. WAE 1998: 110-120 - [i1]Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides:
Locked and Unlocked Polygonal Chains in 3D. CoRR cs.CG/9811019 (1998) - 1997
- [j69]Mark H. Overmars, Nicola Santoro:
Improved Bounds for Electing a Leader in a Synchronous Ring. Algorithmica 18(2): 246-262 (1997) - [j68]Boudewijn Asberg, Gregoria Blanco, Prosenjit Bose,