Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 1. by Individual - 1. by Names

Login to this database


 

Viewing:

1. Author,Editor - 1. by Individual - 1. by Names
Next Page
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
#YearAuthor(s) [non member]TitleType
1
Hide details for Qadeer, Shaz (ed.)Qadeer, Shaz (ed.)
2011[Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
1
Hide details for Qian, JiaweiQian, Jiawei
2012[Qian, Jiawei]
[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
1
Hide details for Queyranne, Maurice (ed.)Queyranne, Maurice (ed.)
1996Kapoor, SanjivOn minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Proceedings Article
5
Hide details for Rabani, Yuval (ed.)Rabani, Yuval (ed.)
2012[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
2012[Kratsch, Stefan]
Wahlström, Magnus
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103
Proceedings Article
2012[Giakkoupis, George]
Sauerwald, Thomas
Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
2012Fountoulakis, Nikolaos
[Panagiotou, Konstantinos]
[Sauerwald, Thomas]
Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Proceedings Article
2012Hermelin, Danny
[Wu, Xi]
Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Proceedings Article
3
Hide details for Radhakrishnan, JaikumarRadhakrishnan, Jaikumar
1997Chaudhuri, Shiva
[Radhakrishnan, Jaikumar]
The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Journal Article
1996Chaudhuri, Shiva
[Radhakrishnan, Jaikumar]
Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36
Proceedings Article
1996Brodal, Gerth Stølting
Chaudhuri, Shiva
[Radhakrishnan, Jaikumar]
The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
Proceedings Article
3
Hide details for Radhakrishnan, Jaikumar (ed.)Radhakrishnan, Jaikumar (ed.)
2012Elbassioni, Khaled
[Garg, Naveen]
[Gupta, Divya]
[Kumar, Amit]
[Narula, Vishal]
[Pal, Arindam]
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275
Electronic Proceedings Article
2012Mnich, Matthias
Philip, Geevarghese
[Saurabh, Saket]
[Suchy, Ondrej]
Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
2003Telikepalli, KavithaEfficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288
Proceedings Article
1
Hide details for Radhakrishnan, R.Radhakrishnan, R.
1996Brodal, Gerth Stølting
Chaudhuri, Shiva
[Radhakrishnan, R.]
The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Journal Article
1
Hide details for Radhakrishna, Jaikumar (ed.)Radhakrishna, Jaikumar (ed.)
2012[Lokshtanov, Daniel]
[Saurabh, Saket]
Wahlström, Magnus
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
5
Hide details for Radzik, Tomasz (ed.)Radzik, Tomasz (ed.)
2004[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
Attachment IconAlgorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133
Proceedings Article
2004Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
2004Martens, Maren
Skutella, Martin
Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
2004Fotakis, DimitrisAttachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Proceedings Article
2004Sanders, PeterSuper Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
3
Hide details for Räcke, HaraldRäcke, Harald
2003[Krick, Christof]
[Meyer auf der Heide, Friedhelm]
[Räcke, Harald]
Vöcking, Berthold
[Westermann, Matthias]
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
2003[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
2002[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
1
Hide details for Ragde, PrabhakarRagde, Prabhakar
1995Hagerup, Torben
[Katajainen, Jyrki]
[Nishimura, Naomi]
[Ragde, Prabhakar]
Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
1
Hide details for Raghavendra Rao, B. V.Raghavendra Rao, B. V.
2013Bringmann, Karl
[Engels, Christian]
[Manthey, Bodo]
[Raghavendra Rao, B. V.]
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
Proceedings Article
1
Hide details for Rahman, Md. Saidur (ed.)Rahman, Md. Saidur (ed.)
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
1
Hide details for Raidl, Günther R. (ed.)Raidl, Günther R. (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
5
Hide details for Raidl, Günther (ed.)Raidl, Günther (ed.)
2009Doerr, Benjamin
[Eremeev, Anton]
[Horoba, Christian]
Neumann, Frank
[Theile, Madeleine]
Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
2009Kratsch, Stefan
Neumann, Frank
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300
Proceedings Article
2009Doerr, Benjamin
[Theile, Madeleine]
Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Proceedings Article
2009Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
2009Neumann, Frank
[Oliveto, Pietro Simone]
[Witt, Carsten]
Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Proceedings Article
1
Hide details for Rajaraman, RajmohanRajaraman, Rajmohan
2001[Rajaraman, Rajmohan]
[Richa, Andrea W.]
Vöcking, Berthold
[Vuppuluri, Gayathri]
A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
1
Hide details for Rakrak, SaidRakrak, Said
2007El Kahoui, M'hammed
[Rakrak, Said]
Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Journal Article
1
Hide details for Ralph, Martin (ed.)Ralph, Martin (ed.)
2002Lennerz, Christian
Schömer, Elmar
Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
1
Hide details for Ramachandran, VijayaRamachandran, Vijaya
1995[Han, Xiaofeng]
Kelsen, Pierre
[Ramachandran, Vijaya]
[Tarjan, Robert E.]
Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
1
Hide details for Ramakrishna, G.Ramakrishna, G.
2013Doerr, C.
Schmidt, Jens M.
Ramakrishna, G.
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
1
Hide details for Ramanujam, R. (ed.)Ramanujam, R. (ed.)
1999Mehlhorn, KurtThe Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Proceedings Article
1
Hide details for Ramanujan, M. S.Ramanujan, M. S.
2010[Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.]
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
6
Hide details for Raman, RajeevRaman, Rajeev
1998[Golin, Mordecai J.]
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
1997[Kaufmann, Michael]
[Raman, Rajeev]
Sibeyn, Jop F.
Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
1995[Dietz, Paul]
Mehlhorn, Kurt
[Raman, Rajeev]
Uhrig, Christian
Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
1995Golin, Mordecai J.
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1995[Andersson, Arne]
Hagerup, Torben
[Nilsson, Stefan]
[Raman, Rajeev]
Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
1993Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
6
Hide details for Raman, Rajeev (ed.)Raman, Rajeev (ed.)
2006[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor]
Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
Proceedings Article
2002Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
2002Polzin, Tobias
[Vahdati Daneshmand, Siavash]
Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
Proceedings Article
2002Mehlhorn, Kurt
Meyer, Ulrich
Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
Proceedings Article
2002Althaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt
Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Proceedings Article
2002[Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo]
Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
6
Hide details for Raman, RajivRaman, Rajiv
2012Elbassioni, Khaled
[Raman, Rajiv]
Ray, Saurabh
[Sitters, René]
On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
2011[Pemmaraju, Sriram V.]
Raman, Rajiv
[Varadarajan, Kasturi]
Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Journal Article
2010[Canzar, Stefan]
Elbassioni, Khaled
[Elmasry, Amr]
[Raman, Rajiv]
On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Proceedings Article
2009[Correa, Jose R.]
Megow, Nicole
Raman, Rajiv
[Suchan, Karol]
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
Proceedings Article
2009Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
[Sitters, Rene]
Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
2009Elbassioni, Khaled
Raman, Rajiv
[Ray, Saurabh]
[Sitters, Rene]
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
8
Hide details for Raman, VenkateshRaman, Venkatesh
2012[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
2012[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
2012Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Journal Article
2011[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Proceedings Article
2010Philip, Geevarghese
[Raman, Venkatesh]
[Villanger, Yngve]
Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
2009Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Proceedings Article
3
Hide details for Raman, Venkatesh (ed.)Raman, Venkatesh (ed.)
2013[Afshani, Peyman]
[Agrawal, Manindra]
Doerr, Benjamin
Doerr, Carola
[Larsen, Kasper Green]
Mehlhorn, Kurt
The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
2010[Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.]
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
1999Mehlhorn, KurtThe Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Proceedings Article
5
Hide details for Ramesh, HariharanRamesh, Hariharan
2000Kumar, V. S. Anil
[Arya, Sunil]
[Ramesh, Hariharan]
Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
1999Kumar, V. S. Anil
[Ramesh, Hariharan]
Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Proceedings Article
1999Kumar, V. S. Anil
[Ramesh, Hariharan]
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251
Proceedings Article
1996Kelsen, Pierre
[Mahajan, Sanjeev]
[Ramesh, Hariharan]
Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Proceedings Article
1996Breslauer, Dany
Ramesh, Hariharan
Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
Journal Article
1
Hide details for Ramesh, S. (ed.)Ramesh, S. (ed.)
1997Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V.
Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Proceedings Article
3
Hide details for Ramezani, FahimehRamezani, Fahimeh
2013Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
2012[Soranzo, Nicola]
Ramezani, Fahimeh
[Iacono, Giovanni]
[Altafini, Claudio]
Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
2010[Iacono, G.]
Ramezani, Fahimeh
[Soranzo, N.]
[Altafani, C.]
Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
25
Hide details for Ramos, Edgar A.Ramos, Edgar A.
2005Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin
Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Journal Article
2003[Cheng, Siu-Wing]
Funke, Stefan
[Golin, Mordecai J.]
[Kumar, Piyush]
[Poon, Sheung-Hung]
[Ramos, Edgar A.]
Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
Proceedings Article
2002Funke, Stefan
Ramos, Edgar A.
Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
Proceedings Article
2001Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.]
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
Journal Article
2001Ramos, Edgar A.An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
Journal Article
2001Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Journal Article
2001Funke, Stefan
Ramos, Edgar A.
Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353
Proceedings Article
2001Ramos, Edgar A.Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
Journal Article
2001Dey, Tamal K.
Funke, Stefan
Ramos, Edgar A.
Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132
Electronic Proceedings Article
2000Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.]
Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Proceedings Article
2000[Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A.
Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Journal Article
2000Ramos, Edgar A.Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299
Proceedings Article
2000[Amato, Nancy M.]
[Goodrich, Michael T.]
Ramos, Edgar A.
Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212
Proceedings Article
2000Ramos, Edgar A.Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
Proceedings Article
1999[Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A.
Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
Proceedings Article
1999Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Proceedings Article
1999Ramos, Edgar A.On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
Proceedings Article
1998Chong, Ka Wong
Ramos, Edgar A.
Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Proceedings Article
1998Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
Attachment IconRandomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268
Proceedings Article
1997[Goodrich, Michael T.]
Ramos, Edgar A.
Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Journal Article
1997Ramos, Edgar A.Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
Proceedings Article
1997[Duncan, C.A.]
[Goodrich, Michael T.]
Ramos, Edgar A.
Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130
Proceedings Article
1997[Edelsbrunner, Herbert]
Ramos, Edgar A.
Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Journal Article
1997Ramos, Edgar A.Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Journal Article
1997Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V.
Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Proceedings Article
6
Hide details for Randall, Dana (ed.)Randall, Dana (ed.)
2011[Mütze, Torsten]
[Rast, Thomas]
Spöhel, Reto
Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Proceedings Article
2011[Berenbrink, Petra]
[Hoefer, Martin]
Sauerwald, Thomas
Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
2011Panagiotou, Konstantinos
[Steger, Angelika]
On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210
Proceedings Article
2011[Berenbrink, Petra]
[Cooper, Colin]
[Friedetzky, Tom]
Friedrich, Tobias
Sauerwald, Thomas
Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article
2011Sauerwald, Thomas
[Stauffer, Alexandre]
Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
2011Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos
The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
Proceedings Article
1
Hide details for Rangan, C. PanduRangan, C. Pandu
1996Preetham, A. J.
[Krithivasan, Kamala]
[Rangan, C. Pandu]
Sibeyn, Jop F.
Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Proceedings Article
3
Hide details for Rangan, C. Pandu (ed.)Rangan, C. Pandu (ed.)
1999Sanders, PeterAsynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
1999Mehlhorn, KurtThe Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Proceedings Article
1999Mehlhorn, KurtThe Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Proceedings Article
2
Hide details for Ranjan, DeshRanjan, Desh
1998[Dubhashi, Devdatt]
[Ranjan, Desh]
Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
1993Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian
Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Proceedings Article
2
Hide details for Rao, P. SrinivasaRao, P. Srinivasa
1998Sibeyn, Jop F.
[Juurlink, Ben]
Rao, P. Srinivasa
Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Journal Article
1996[Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa]
Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
1
Hide details for Rao, Ramesh (ed.)Rao, Ramesh (ed.)
2006Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu]
Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
1
Hide details for Rao, S. SrinivasaRao, S. Srinivasa
2003Kärkkäinen, Juha
[Rao, S. Srinivasa]
Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
1
Hide details for Rappaport, David (ed.)Rappaport, David (ed.)
2006Funke, Stefan
[Malamatos, Theocharis]
[Matijevic, Domagoj]
Wolpert, Nicola
Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
2
Hide details for Rasch, RonaldRasch, Ronald
2001Mehlhorn, Kurt
[Meiser, Stefan]
[Rasch, Ronald]
Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Journal Article
1994Rasch, RonaldFurthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Raspaud, André (ed.)Raspaud, André (ed.)
1999Sibeyn, Jop F.Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
Proceedings Article
1
Hide details for Rast, ThomasRast, Thomas
2011[Mütze, Torsten]
[Rast, Thomas]
Spöhel, Reto
Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Proceedings Article
1
Hide details for Rathe, UlrichRathe, Ulrich
1999[Rathe, Ulrich]
Sanders, Peter
[Knight, Peter]
A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
2
Hide details for Rauch, MonikaRauch, Monika
1990Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika
On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Journal Article
1989Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika
On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548
Proceedings Article
10
Hide details for Rauf, ImranRauf, Imran
??Elbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh
On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
2011Elbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh
Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
2011Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Journal Article
2010Elbassioni, Khaled
[Rauf, Imran]
Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Journal Article
2010Elbassioni, Khaled
Rauf, Imran
Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
2009Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Proceedings Article
2009Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
2008Elbassioni, Khaled
[Hagen, Matthias]
Rauf, Imran
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
2007Funke, Stefan
Rauf, Imran
Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
Proceedings Article
2005Rauf, ImranAttachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rau, StephanRau, Stephan
1997Rau, StephanEin experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ravani, Yuval (ed.)Ravani, Yuval (ed.)
2012Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish]
Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
2
Hide details for Ravi, R.Ravi, R.
2000Garg, Naveen
[Konjevod, Goran]
[Ravi, R.]
Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
1998Chaudhuri, Shiva
Garg, Naveen
[Ravi, R.]
The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Journal Article
1
Hide details for Ravi, S.S. (ed.)Ravi, S.S. (ed.)
2009[Krumke, Sven]
van Stee, Rob
[Westphal, Stefan]
Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
6
Hide details for Rawitz, DrorRawitz, Dror
2012Hermelin, Danny
[Mestre, Julian]
[Rawitz, Dror]
Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
2011[Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror]
Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article
2011Hermelin, Danny
[Rawitz, Dror]
Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
2010[Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror]
Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
2010[Butman, Ayelet]
Hermelin, Danny
[Lewenstein, Moshe]
[Rawitz, Dror]
Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
2007[Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror]
Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
1
Hide details for Rawitz, Dror (ed.)Rawitz, Dror (ed.)
2012Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias]
Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173
Proceedings Article
2
Hide details for Rawlins, Gregory J.E.Rawlins, Gregory J.E.
1998Bradford, Phillip Gnassi
[Rawlins, Gregory J.E.]
[Shannon, Greogory E.]
Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Journal Article
1995Bradford, Phillip Gnassi
[Choppela, Venkatesh]
[Rawlins, Gregory J.E.]
Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Proceedings Article
1
Hide details for Raynal, Michel (ed.)Raynal, Michel (ed.)
1995[Hoepman, Jaap-Henk]
Papatriantafilou, Marina
Tsigas, Philippas
Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
9
Hide details for Ray, RahulRay, Rahul
2004[Smid, Michiel]
Ray, Rahul
[Wendt, Ulrich]
[Lange, Katharina]
Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
2004Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Proceedings Article
2004Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105
Proceedings Article
2004Ray, RahulGeometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
Thesis - PhD thesis
2002Ray, RahulAn O(nlogn) Algorithm for Classifying Identical CurvesMiscellaneous
2002Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich]
Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
2002[Wendt, Ulrich]
[Lange, Katharina]
[Smid, Michiel]
Ray, Rahul
[Tönnies, Klaus-Dietz]
Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Journal Article
2002[Agarwal, Pankaj]
[Hagerup, Torben]
Ray, Rahul
[Sharir, Micha]
[Smid, Michiel]
[Welzl, Emo]
Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
2001[Wendt, Ulrich]
[Lange, Katharina]
Ray, Rahul
[Smid, Michiel]
Surface Topography Quantification using Computational GeometryMiscellaneous
18
Hide details for Ray, SaurabhRay, Saurabh
??Elbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh
On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
2013[Alvarez, Victor]
Bringmann, Karl
[Ray, Saurabh]
[Seidel, Raimund]
Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
Proceedings Article
2012[Ajwani, Deepak]
Elbassioni, Khaled
[Govindarajan, Sathish]
Ray, Saurabh
Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article
2012[Alvarez, Victor]
Bringmann, Karl
[Curticapean, Radu]
Ray, Saurabh
Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article
2012Elbassioni, Khaled
[Raman, Rajiv]
Ray, Saurabh
[Sitters, René]
On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
2011Elbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh
Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
2010[Basit, Abdul]
[Mustafa, Nabil H.]
Ray, Saurabh
[Raza, Sarfraz]
Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article
2010Mehlhorn, Kurt
Ray, Saurabh
Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Journal Article
2010Mustafa, Nabil H.
Ray, Saurabh
Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
Journal Article
2009Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
[Sitters, Rene]
Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
2009Elbassioni, Khaled
Raman, Rajiv
[Ray, Saurabh]
[Sitters, Rene]
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
2008Pyrga, Evangelia
[Ray, Saurabh]
New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Proceedings Article
2007Mustafa, Nabil H.
[Ray, Saurabh]
Attachment IconAn Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141
Proceedings Article
2007Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh]
Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
2007Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
[Ray, Saurabh]
Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Proceedings Article
2007Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj]
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
2007[Ray, Saurabh]
Mustafa, Nabil H.
Attachment IconWeak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244
Proceedings Article
2004Ray, SaurabhCounting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Raza, SarfrazRaza, Sarfraz
2010[Basit, Abdul]
[Mustafa, Nabil H.]
Ray, Saurabh
[Raza, Sarfraz]
Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article
1
Hide details for Razgon, IgorRazgon, Igor
2009Johannsen, Daniel
[Razgon, Igor]
Wahlström, Magnus
Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Proceedings Article
2
Hide details for Reed, BruceReed, Bruce
2008Fountoulakis, Nikolaos
[Reed, Bruce]
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Journal Article
2007Fountoulakis, Nikolaos
[Reed, Bruce]
Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
2
Hide details for Reeve, Jeff (ed.)Reeve, Jeff (ed.)
1998Meyer, Ulrich
Sibeyn, Jop F.
Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Proceedings Article
1998[Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
2
Hide details for Régin, Jean-Charles (ed.)Régin, Jean-Charles (ed.)
2004Katriel, IritDynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Proceedings Article
2004[Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven
Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article
2
Hide details for Reichel, Horst (ed.)Reichel, Horst (ed.)
2001Krysta, Piotr
Kumar, V. S. Anil
Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442
Proceedings Article
1995[Djidjev, Hristo N.]
[Pantziou, Grammati E.]
Zaroliagis, Christos
Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Proceedings Article
11
Hide details for Reichel, JoachimReichel, Joachim
2011Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin]
Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Journal Article
2008Neumann, Frank
[Reichel, Joachim]
Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Proceedings Article
2008Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin]
Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Proceedings Article
2007Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
2006Reichel, JoachimAttachment IconCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
Thesis - PhD thesis
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
2005Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
[Schömer, Elmar]
Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
2002Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
2001Reichel, JoachimAttachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Reichel, Joachim (ed.)Reichel, Joachim (ed.)
2002Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
1
Hide details for Reif, John H. (ed.)Reif, John H. (ed.)
1988Mehlhorn, Kurt
Rülling, W.
Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
4
Hide details for Reinelt, GerhardReinelt, Gerhard
1997[Christof, Thomas]
[Jünger, Michael]
[Kececioglu, John]
Mutzel, Petra
[Reinelt, Gerhard]
A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
1997Christof, Thomas
[Jünger, Michael]
Kececioglu, John
Mutzel, Petra
[Reinelt, Gerhard]
A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92
Proceedings Article
1996[De Simone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni]
Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
1995[DeSimone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni]
Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Journal Article
11
Hide details for Reinert, KnutReinert, Knut
2006Althaus, Ernst
[Caprara, Alberto]
[Lenhof, Hans-Peter]
[Reinert, Knut]
Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Journal Article
2002Althaus, Ernst
[Caprara, Alberto]
[Lenhof, Hans-Peter]
[Reinert, Knut]
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16
Proceedings Article
2000[Kececioglu, John]
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
[Vingron, Martin]
Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
2000[Lermen, Martin]
Reinert, Knut
The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Journal Article
1999Reinert, KnutA polyhedral approach to sequence alignment problems
Universität des Saarlandes
Thesis - PhD thesis
1999Lenhof, Hans-Peter
[Morgenstern, Burkhard]
Reinert, Knut
An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Journal Article
1998Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin]
A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
1998Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin]
A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
1997Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John
Attachment IconA Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250
Proceedings Article
1996Bradford, Phillip Gnassi
Reinert, Knut
Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Proceedings Article
1994Reinert, KnutDeferred Data Structuring
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Reinhard, KlausReinhard, Klaus
2002[Niedermeier, Rolf]
[Reinhard, Klaus]
Sanders, Peter
Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Journal Article
2
Hide details for Reinstädtler, MartinReinstädtler, Martin
2002[Bachrach, Ran]
[El-Yaniv, Ran]
Reinstädtler, Martin
On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
Journal Article
1998Reinstädtler, MartinVerlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Reischuk, Rudiger (ed.)Reischuk, Rudiger (ed.)
1997Brodal, Gerth StøltingPredecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32
Proceedings Article
1
Hide details for Rema, AnnaRema, Anna
1996[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
1
Hide details for Remy, JanRemy, Jan
2006Canzar, Stefan
[Remy, Jan]
Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article
1
Hide details for Reps, Thomas (ed.)Reps, Thomas (ed.)
1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94Report
1
Hide details for Reussner, RalfReussner, Ralf
1998Sanders, Peter
[Reussner, Ralf]
[Prechelt, Lutz]
[Müller, Matthias]
SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
1
Hide details for Reuter, Andreas (ed.)Reuter, Andreas (ed.)
1990Näher, Stefan
Mehlhorn, Kurt
LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39
Proceedings Article
2
Hide details for Reuter, MaxReuter, Max
2012[Nor, Igor]
Hermlin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier]
[Sagot, Marie-France]
Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
2010[Nor, Igor]
Hermelin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier Sagot, Marie-France]
Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Proceedings Article
1
Hide details for Ribeiro, Celso C. (ed.)Ribeiro, Celso C. (ed.)
2004[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article
1
Hide details for Ricardo A. Baeza-Yates (ed.)Ricardo A. Baeza-Yates (ed.)
2007Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar
Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article
1
Hide details for Richards, BradRichards, Brad
2002Hert, Susan
[Richards, Brad]
Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
1
Hide details for Richa, Andrea W.Richa, Andrea W.
2001[Rajaraman, Rajmohan]
[Richa, Andrea W.]
Vöcking, Berthold
[Vuppuluri, Gayathri]
A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
1
Hide details for Rieger, H.Rieger, H.
2009[Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.]
Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
1
Hide details for Rieger, JoachimRieger, Joachim
1995Rieger, JoachimGeneric Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Journal Article
2
Hide details for Rinaldi, GiovanniRinaldi, Giovanni
1996[De Simone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni]
Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
1995[DeSimone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni]
Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Journal Article
1
Hide details for Rivals, EricRivals, Eric
1999Burkhardt, Stefan
Crauser, Andreas
[Ferragina, Paolo]
Lenhof, Hans-Peter
[Rivals, Eric]
[Vingron, Martin]
q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article
4
Hide details for Rizkallah, ChristineRizkallah, Christine
2013[Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine
A Framework for the Verification of Certifying ComputationsUnpublished/Draft
2011Rizkallah, ChristineAttachment IconGlivenko and Kuroda for Simple Type TheoryUnpublished/Draft
2011Rizkallah, ChristineMaximum Cardinality Matching
In: Archive of Formal Proofs,
Electronic Journal Article
2011[Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
3
Hide details for Rizzi, RomeoRizzi, Romeo
2012Hermelin, Danny
[Rizzi, Romeo]
[Vialette, Stephane]
Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
2009[Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo]
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009[Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo]
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article
1
Hide details for Rizzi, R.Rizzi, R.
2009[Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.]
Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
2
Hide details for Robert, Yves (ed.)Robert, Yves (ed.)
1996Sibeyn, Jop F.List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
Proceedings Article
1996[Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa]
Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
1
Hide details for Rochange, Christine (ed.)Rochange, Christine (ed.)
2008[Meyer, Ulrich]On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560
Proceedings Article
1
Hide details for Roch, Jean-Louis (ed.)Roch, Jean-Louis (ed.)
2010Emeliyanenko, PavelAttachment IconA complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43
Proceedings Article
3
Hide details for Röglin, HeikoRöglin, Heiko
2012Kötzing, Timo
[Neumann, Frank]
[Röglin, Heiko]
[Witt, Carsten]
Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
2007Beier, René
[Röglin, Heiko]
[Vöcking, Berthold]
Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article
1
Hide details for Röhrig, HeinRöhrig, Hein
1998Röhrig, HeinTree Decomposition: A Feasibility Study
Universität des Saarlandes
Thesis - Masters thesis
4
Hide details for Rohnert, HansRohnert, Hans
1994[Dietzfelbinger, Martin]
[Karlin, Anna]
Mehlhorn, Kurt
[Meyer Auf Der Heide, Friedhelm]
[Rohnert, Hans]
[Tarjan, Robert E.]
Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
1992Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1991Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
Dynamic Perfect Hashing: Upper and Lower BoundsReport
1988Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
Proceedings Article
2
Hide details for Rohnert, H.Rohnert, H.
1988Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H.
Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
1982Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
1
Hide details for Rohn, Jiri (ed.)Rohn, Jiri (ed.)
2001Mehlhorn, Kurt
Schirra, Stefan
Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
8
Hide details for Rolim, José D. P. (ed.)Rolim, José D. P. (ed.)
2006[Bartal, Yair]
[Leonardi, Stefano]
[Shallom, Gill]
Sitters, Rene
On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
2003[Hall, Alex]
[Langkau, Katharina]
Skutella, Martin
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
2003Hoefer, MartinExperimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
2003Althaus, Ernst
Polzin, Tobias
[Vahdati Daneshmand, Siavash]
Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Proceedings Article
2003Mehlhorn, KurtAttachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Proceedings Article
2000Mehlhorn, KurtAttachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Proceedings Article
2000Kumar, V. S. Anil
[Arya, Sunil]
[Ramesh, Hariharan]
Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
1999Solis-Oba, Roberto
[Jansen, Klaus]
[Sviridenko, Maxim]
A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188
Proceedings Article
9
Hide details for Rolim, José (ed.)Rolim, José (ed.)
2012[Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob
Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
2010Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
Proceedings Article
2010[Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian
The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
2009Harren, Rolf
van Stee, Rob
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Proceedings Article
2004Kowalski, Dariusz
[Pelc, Andrzej]
Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
Proceedings Article
1998Schnorr, C. P.
Subramanian, C. R.
Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231
Proceedings Article
1997[Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker
Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26
Proceedings Article
1996Träff, Jesper Larsson
Zaroliagis, Christos
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
1996Hagerup, TorbenAllocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
1
Hide details for Rolim, J. (ed.)Rolim, J. (ed.)
1997Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
1
Hide details for Ronchi Della Rocca, Simonetta (ed.)Ronchi Della Rocca, Simonetta (ed.)
1989Mehlhorn, Kurt
[Paul, Wolfgang J.]
Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
Proceedings Article
1
Hide details for Ron, Dana (ed.)Ron, Dana (ed.)
2004Kowalski, Dariusz
[Pelc, Andrzej]
Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
Proceedings Article
1
Hide details for Roos, Thomas (ed.)Roos, Thomas (ed.)
1997Schirra, StefanPrecision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
1
Hide details for Rosamond, Fraces A.Rosamond, Fraces A.
2012[Fellows, Michael R.]
Hermelin, Danny
[Rosamond, Fraces A.]
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
2
Hide details for Rosamond, Frances A.Rosamond, Frances A.
2011[Fellows, Michael R.]
Friedrich, Tobias
Hermelin, Danny
[Narodytska, Nina]
[Rosamond, Frances A.]
Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
Proceedings Article
2011[Fellows, Michael R.]
[Hartman, Tzvika]
Hermelin, Danny
[Landau, Gad M.]
[Rosamond, Frances A.]
[Rozenberg, Liat]
Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
2
Hide details for Rosenberg, Arnold L.Rosenberg, Arnold L.
1983Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
1981Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
3
Hide details for Rosenstiehl, PierreRosenstiehl, Pierre
1986Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1985Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proceedings Article
1984Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
Sorting Jordan sequences in linear timeReport
1
Hide details for Rosen, AdiRosen, Adi
2004Kesselman, Alexander
[Guez, Dan]
[Rosen, Adi]
Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
1
Hide details for Rossignac, JarekRossignac, Jarek
2003Kettner, Lutz
[Rossignac, Jarek]
[Snoeyink, Jack]
The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
Journal Article
2
Hide details for Rossi, Francesca (ed.)Rossi, Francesca (ed.)
2005[Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven
GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11
Proceedings Article
2003Katriel, Irit
Thiel, Sven
Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451
Proceedings Article
2
Hide details for Rote, GünterRote, Günter
1992Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1990Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
3
Hide details for Rote, Günter (ed.)Rote, Günter (ed.)
200521st Annual Symposium on Computational Geometry (SCG'05)Proceedings
2005Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
Proceedings Article
2005[Seidel, Raimund]
Wolpert, Nicola
On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
Proceedings Article
2
Hide details for Rothlauf, Frank (ed.)Rothlauf, Frank (ed.)
2009Doerr, Benjamin
[Eremeev, Anton]
[Horoba, Christian]
Neumann, Frank
[Theile, Madeleine]
Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
2009Doerr, Benjamin
[Theile, Madeleine]
Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Proceedings Article
4
Hide details for Rothlauf, Franz (ed.)Rothlauf, Franz (ed.)
2009Doerr, Benjamin
Fouz, Mahmoud
[Schmidt, Martin]
Wahlström, Magnus
BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
Proceedings Article
2009Kratsch, Stefan
Neumann, Frank
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300
Proceedings Article
2009Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
2009Neumann, Frank
[Oliveto, Pietro Simone]
[Witt, Carsten]
Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Proceedings Article
1
Hide details for Rotics, UdiRotics, Udi
2006[Golumbic, Martin Charles]
[Mintz, Aviad]
[Rotics, Udi]
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
1
Hide details for Rottmann, Klaus-DieterRottmann, Klaus-Dieter
1996Rottmann, Klaus-DieterBewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Roughgarden, Tim (ed.)Roughgarden, Tim (ed.)
2012[Kratsch, Stefan]
Wahlström, Magnus
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
Proceedings Article
2012Sauerwald, Thomas
Sun, He
Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Proceedings Article
3
Hide details for Rovan, Branislav (ed.)Rovan, Branislav (ed.)
2003Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
2003Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt
Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article
1986Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
3
Hide details for Rozenberg, Grzegorz (ed.)Rozenberg, Grzegorz (ed.)
1984Mehlhorn, KurtData structures and algorithms. Volume 1 : Sorting and searchingBook
1984Mehlhorn, KurtData structures and algorithms. Volume 2 : Graph algorithms and NP-completenessBook
1984Mehlhorn, KurtData structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryBook
1
Hide details for Rozenberg, LiatRozenberg, Liat
2011[Fellows, Michael R.]
[Hartman, Tzvika]
Hermelin, Danny
[Landau, Gad M.]
[Rosamond, Frances A.]
[Rozenberg, Liat]
Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
2
Hide details for Rudolf, GaborRudolf, Gabor
2008[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui]
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
2007[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Rudolf, Gabor]
Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
11
Hide details for Rudolph, Günter (ed.)Rudolph, Günter (ed.)
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Proceedings Article
2010Kratsch, Stefan
[Lehre, Per Kristian]
[Neumann, Frank]
[Oliveto, Pietro Simone]
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
Proceedings Article
2010Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine]
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Proceedings Article
2010[Böttcher, Süntje]
Doerr, Benjamin
Neumann, Frank
Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
Proceedings Article
2010Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine]
Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
2010[Bringmann, Karl]
Friedrich, Tobias
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
Proceedings Article
2008[Brockhoff, Dimo]
Friedrich, Tobias
Neumann, Frank
Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
Proceedings Article
2008Neumann, Frank
[Reichel, Joachim]
Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Proceedings Article
2008[Kroeske, Jense]
[Ghandar, Adam]
[Michalewicz, Zbigniew]
Neumann, Frank
Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
2008Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
3
Hide details for Rudolph, Larry (ed.)Rudolph, Larry (ed.)
1997Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693
Proceedings Article
1997[Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F.
Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
1997[Mavronicolas, Marios]
Papatriantafilou, Marina
Tsigas, Philippas
The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
1
Hide details for Rudra, AtriRudra, Atri
2010Bansal, Nikhil
[Gupta, Anupam]
[Li, Jian]
Mestre, Julián
[Nagarajan, Viswanath]
[Rudra, Atri]
When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229
Proceedings Article
8
Hide details for Rüb, ChristineRüb, Christine
2000[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Journal Article
1999[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
1998Rüb, ChristineOn Batcher's Merge Sorts as Parallel Sorting Algorithms
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420
Proceedings Article
1997[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
1997Rüb, ChristineOn the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Journal Article
1997[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
1996Müller, Michael
Rüb, Christine
[Rülling, Wolfgang]
A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Journal Article
1995Rüb, ChristineOn the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Proceedings Article
2
Hide details for Rueher, Michel (ed.)Rueher, Michel (ed.)
2004Katriel, IritDynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Proceedings Article
2004[Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven
Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article
3
Hide details for Rülling, WolfgangRülling, Wolfgang
1996Müller, Michael
Rüb, Christine
[Rülling, Wolfgang]
A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Journal Article
1988Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
Proceedings Article
1988Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark
On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proceedings Article
3
Hide details for Rülling, W.Rülling, W.
1990Mehlhorn, Kurt
Rülling, W.
Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
Journal Article
1988Mehlhorn, Kurt
Rülling, W.
Compaction on the TorusReport
1988Mehlhorn, Kurt
Rülling, W.
Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
1
Hide details for Rump, Siegfried M. (ed.)Rump, Siegfried M. (ed.)
2001Mehlhorn, Kurt
Schirra, Stefan
Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
1
Hide details for Runarsson, Thomas Ph. (ed.)Runarsson, Thomas Ph. (ed.)
2006Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
1
Hide details for Ruppert, BarbaraRuppert, Barbara
1999Ruppert, BarbaraPolygontriangulierung in Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rusinov, MomchilRusinov, Momchil
2010[Rusinov, Momchil]
Schweitzer, Pascal
Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Journal Article
1
Hide details for Ruzicka, Peter (ed.)Ruzicka, Peter (ed.)
1997Sibeyn, Jop F.Routing with Finite Speeds of Memory and Network
In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497
Proceedings Article
5
Hide details for Ryan, Conor (ed.)Ryan, Conor (ed.)
2008[Horoba, Christian]
Neumann, Frank
Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
Proceedings Article
2008Doerr, Benjamin
[Jansen, Thomas]
[Klein, Christian]
Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Proceedings Article
2008Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin]
Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Proceedings Article
2008Doerr, Benjamin
Happ, Edda
Klein, Christian
Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
2008Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
1
Hide details for Rybalchenko, Andrey (ed.)Rybalchenko, Andrey (ed.)
2009Wahlström, MagnusNew Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
Proceedings Article
6
Hide details for Rytter, WojciechRytter, Wojciech
1998[Crochemore, Maxime]
Gasieniec, Leszek
[Hariharan, Ramesh]
[Muthukrishnan, S.]
[Rytter, Wojciech]
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Journal Article
1998[Crochemore, Maxime]
Gasieniec, Leszek
[Rytter, Wojciech]
Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
Proceedings Article
1998Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
[Rytter, Wojciech]
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54
Proceedings Article
1997[Crochemore, Maxime]
[Galil, Zvi]
Gasieniec, Leszek
[Park, Kunsoo]
[Rytter, Wojciech]
Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
1996Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech]
Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
1996Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech]
Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
2
Hide details for Rytter, Wojciech (ed.)Rytter, Wojciech (ed.)
2002[Epstein, Leah]
Imreh, Csanád
[van Stee, Rob]
More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
Proceedings Article
2002[Andreou, Maria]
Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.]
Attachment IconOn Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92
Proceedings Article
2
Hide details for Saad, Youssef (ed.)Saad, Youssef (ed.)
1996Träff, Jesper Larsson
Zaroliagis, Christos
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
1996Hagerup, TorbenAllocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
3
Hide details for Saberi, Amin (ed.)Saberi, Amin (ed.)
2010[Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob
A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193
Proceedings Article
2010Elbassioni, Khaled
[Fouz, Mahmoud]
[Swamy, Chaitanya]
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472
Proceedings Article
2010[Christodoulou, George]
Elbassioni, Khaled
[Fouz, Mahmoud]
Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
Proceedings Article
1
Hide details for Sablonnière, Paul (ed.)Sablonnière, Paul (ed.)
2000Mehlhorn, Kurt
Schirra, Stefan
Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
1
Hide details for Sabo, HolgerSabo, Holger
1999Sabo, HolgerEin schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Sack, Jörg-RüdigerSack, Jörg-Rüdiger
2000Mehlhorn, Kurt
[Sack, Jörg-Rüdiger]
Editorial
In: Computational Geometry [17], 1-2
Journal Article
1999Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
Editorial
In: Computational Geometry [12], 153-154
Journal Article
12
Hide details for Sack, Jörg-Rüdiger (ed.)Sack, Jörg-Rüdiger (ed.)
2011Harren, Rolf
[Jansen, Klaus]
[Prädel, Lars]
van Stee, Rob
Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
2009Angelopoulos, SpyrosOnline Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Proceedings Article
2007Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj]
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
2005[Mortensen, Christian Worm]
Pettie, Seth
The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
Proceedings Article
2001[Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert]
On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
Proceedings Article
2000Schirra, StefanRobustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
1996[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
1995Mehlhorn, KurtExperiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
1995[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1995Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott]
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1995Albers, Susanne
[Koga, Hisashi]
Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
1993Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
1
Hide details for Sagot, Marie-FranceSagot, Marie-France
2012[Nor, Igor]
Hermlin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier]
[Sagot, Marie-France]
Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
32
Hide details for Sagraloff, MichaelSagraloff, Michael
2013[Yap, Chee]
Sagraloff, Michael
[Sharma, Vikram]
Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
2013Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article
2013Kobel, Alexander
Sagraloff, Michael
Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
2013Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
2012[Kerber, Michael]
Sagraloff, Michael
A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
2012Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Electronic Journal Article
2012Sagraloff, MichaelExaktes geometrisches RechnenMiscellaneous
2012Emeliyanenko, Pavel
Sagraloff, Michael
On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
2012Sagraloff, MichaelWhen Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304
Proceedings Article
2011Mehlhorn, Kurt
Sagraloff, Michael
A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Journal Article
2011Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
2011[Kerber, Michael]
Sagraloff, Michael
A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Journal Article
2011Sagraloff, Michael
[Yap, Chee]
A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360
Proceedings Article
2011Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47
Proceedings Article
2011Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Electronic Journal Article
2011Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
Proceedings Article
2011[Kerber, Michael]
Sagraloff, Michael
Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Proceedings Article
2011Sagraloff, MichaelWhen Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
Electronic Journal Article
2010Sagraloff, MichaelA General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Journal Article
2010Berberich, Eric
Kerber, Michael
Sagraloff, Michael
An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Journal Article
2010Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
Electronic Journal Article
2010Sagraloff, MichaelOn the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Electronic Journal Article
2009Berberich, Eric
Sagraloff, Michael
A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal Article
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
2009Mehlhorn, Kurt
Sagraloff, Michael
Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Proceedings Article
2009Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
2008Mehlhorn, Kurt
Sagraloff, Michael
A deterministic Bitstream Descartes AlgorithmReport
2008Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
2008Berberich, Eric
Sagraloff, Michael
Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
2008Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
2008Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
2006Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Proceedings Article
1
Hide details for Sahai, Amit (ed.)Sahai, Amit (ed.)
2003[Hall, Alex]
[Langkau, Katharina]
Skutella, Martin
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
6
Hide details for Saha, ChandanSaha, Chandan
2013[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
2013Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
2012[Kayal, Neeraj]
Saha, Chandan
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
2011[Kayal, Neeraj]
Saha, Chandan
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
1
Hide details for Sahin, Erol (ed.)Sahin, Erol (ed.)
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
3
Hide details for Sahni, Sartaj (ed.)Sahni, Sartaj (ed.)
2010Friedrich, Tobias
[Sauerwald, Thomas]
The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
2010[Fernau, Henning]
[Fomin, Fedor V.]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
2004Baswana, Surender
[Sen, Sandeep]
Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book
1
Hide details for Sakellariou, Rizos (ed.)Sakellariou, Rizos (ed.)
2001Meyer, UlrichHeaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351
Proceedings Article
4
Hide details for Sali, Attila (ed.)Sali, Attila (ed.)
2011Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning]
Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Electronic Proceedings Article
2011[Gugelmann, Luca]
Spöhel, Reto
On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
2011[Mütze, Torsten]
Spöhel, Reto
On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
Electronic Proceedings Article
2011Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias
Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308
Electronic Proceedings Article
5
Hide details for Salomaa, Arto (ed.)Salomaa, Arto (ed.)
1988Mehlhorn, Kurt
Yap, Chee-Keng
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
1984Mehlhorn, KurtData structures and algorithms. Volume 1 : Sorting and searchingBook
1984Mehlhorn, KurtData structures and algorithms. Volume 2 : Graph algorithms and NP-completenessBook
1984Mehlhorn, KurtData structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryBook
1977Mehlhorn, KurtDynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
Proceedings Article
1
Hide details for Salowe, Jeffrey S.Salowe, Jeffrey S.
1995Arya, Sunil
[Das, Gautam]
[Mount, David M.]
[Salowe, Jeffrey S.]
Smid, Michiel
Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article
1
Hide details for Saluja, SanjeevSaluja, Sanjeev
1997Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev
Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
1
Hide details for Sanderson, Mark (ed.)Sanderson, Mark (ed.)
2006Bast, Holger
[Mortensen, Christian Worm]
Weber, Ingmar
Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article
2
Hide details for Sanders, GeoffSanders, Geoff
2011De Sterck, Hans
[Henson, Van Emden]
[Sanders, Geoff]
Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
2011De Sterck, Hans
[Miller, Killian]
[Sanders, Geoff]
[Winlaw, Manda]
Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
74
Hide details for Sanders, PeterSanders, Peter
2013[Sanders, Peter]
[Singler, Johannes]
van Stee, Rob
Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
2011Beier, Rene
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Journal Article
2009[Sanders, Peter]
Sivadasan, Naveen
[Skutella, Martin]
Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
2008Mehlhorn, Kurt
[Sanders, Peter]
Algorithms and Data Structures: The Basic ToolboxBook
2007Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik]
Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
2007Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik]
In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article
2006Maue, Jens
[Sanders, Peter]
Matijevic, Domagoj
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
2006Kaligosi, Kanela
[Sanders, Peter]
How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
2005Sanders, Peter
Steurer, David
An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906
Proceedings Article
2005Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter
Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
Proceedings Article
2005Pettie, Seth
Sanders, Peter
Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsUnpublished/Draft
2005[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
2005[Fotakis, Dimitris]
[Pagh, Rasmus]
Sanders, Peter
Spirakis, Paul G.
Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
2005[Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter]
STXXL: Standard Template Library for XXL Data SetsReport
2005[Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter]
STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
2005Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter]
Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
2004Pettie, Seth
Sanders, Peter
Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
2004Sanders, Peter
Pettie, Seth
Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Report
2004Sanders, PeterAlgorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101
Proceedings Article
2004Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Proceedings Article
2004Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter
Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
2004Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.]
Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
2004Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
Attachment IconOnline Scheduling with Bounded MigrationReport
2004Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
2004Sanders, PeterSuper Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
2003Sanders, Peter
[Sibeyn, Jop F.]
A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
2003Katriel, Irit
Sanders, Peter
[Träff, Jesper Larsson]
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
2003Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
Proceedings Article
2003Dementiev, Roman
Sanders, Peter
Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
Proceedings Article
2003Sanders, PeterAsynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Journal Article
2003Sanders, PeterMemory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
2003Sanders, Peter
[Egner, Sebastian]
[Tolhuizen, Ludo]
Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
Proceedings Article
2003Mehlhorn, Kurt
Sanders, Peter
Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Journal Article
2003Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
2003Kärkkäinen, Juha
Sanders, Peter
Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
2003Fotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.]
Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Proceedings Article
2003Sanders, Peter
Vöcking, Berthold
Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
2003Meyer, Ulrich
Sanders, Peter
$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Journal Article
2002[Bader, David]
[Moret, Bernard]
Sanders, Peter
Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book
2002Beier, Rene
Sanders, Peter
Sivadasan, Naveen
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
2002Sanders, Peter
[Vollmar, R.]
[Worsch, T.]
Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
2002Sanders, PeterPresenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Part of a Book
2002Sanders, Peter
Vöcking, Berthold
Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Proceedings Article
2002Sanders, PeterRandomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Journal Article
2002Sanders, PeterReconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Journal Article
2002Sanders, Peter
[Träff, Jesper Larsson]
The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
Proceedings Article
2002[Niedermeier, Rolf]
[Reinhard, Klaus]
Sanders, Peter
Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Journal Article
2002[McGeoch, Catherine]
Sanders, Peter
[Fleischer, Rudolf]
[Cohen, Paul R.]
[Precup, Doina]
Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
Part of a Book
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001Sanders, Peter
[Solis-Oba, Roberto]
How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
2001Sanders, PeterReconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76
Proceedings Article
2001[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
2000Sanders, Peter
Sibeyn, Jop F.
A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
2000Sanders, PeterAsynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
2000Sanders, Peter
[Egner, Sebastian]
[Korst, Jan]
Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
2000Sanders, PeterFast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
2000Sanders, Peter
[Solis-Oba, Roberto]
How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
2000Meyer, Ulrich
Sanders, Peter
Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
1999[Rathe, Ulrich]
Sanders, Peter
[Knight, Peter]
A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
1999Sanders, PeterAccessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
1999Sanders, PeterAnalysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
1999Sanders, PeterAsynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
1999Sanders, PeterBerechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
Part of a Book
1999Sanders, PeterFast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
1999Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1998Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
1998Hagerup, Torben
Sanders, Peter
[Träff, Jesper Larsson]
An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
1998[Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
1998Sanders, PeterRandom Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Journal Article
1998Sanders, PeterRandom Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Journal Article
1998Sanders, PeterRandomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Journal Article
1998Sanders, Peter
[Reussner, Ralf]
[Prechelt, Lutz]
[Müller, Matthias]
SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
1998Sanders, PeterTree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Proceedings Article
1998Meyer, Ulrich
Sanders, Peter
$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
10
Hide details for Sanders, Peter (ed.)Sanders, Peter (ed.)
2013Jez, ArturAttachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
2013[Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki]
Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
2009[Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo]
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009[Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo]
Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article
2009Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
2009Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Proceedings Article
2003Algorithms for Memory HierarchiesBook
2003Katriel, Irit
Meyer, Ulrich
Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
2003Kärkkäinen, Juha
[Rao, S. Srinivasa]
Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
2003Sanders, PeterMemory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
2
Hide details for Sanjeev Khanna (ed.)Sanjeev Khanna (ed.)
2013[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Proceedings Article
2013[Bogdan, Paul]
Sauerwald, Thomas
[Stauffer, Alexandre]
Sun, He
Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
2
Hide details for Sankowski, Piotr (ed.)Sankowski, Piotr (ed.)
2011[Berenbrink, Petra]
[Friedetzky, Tom]
[Elsaesser, Robert]
[Nagel, Lars]
Sauerwald, Thomas
Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article
2011[Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese
Attachment IconPattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
Proceedings Article
3
Hide details for Sannella, Donald (ed.)Sannella, Donald (ed.)
2004Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
2004[Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
Proceedings Article
2004Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
1
Hide details for Sanniti di Baja, G (ed.)Sanniti di Baja, G (ed.)
2000Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
7
Hide details for Santoro, Nicola (ed.)Santoro, Nicola (ed.)
1999Fleischer, RudolfFUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
1995Mehlhorn, KurtExperiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
1995[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1995Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott]
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
1995Albers, Susanne
[Koga, Hisashi]
Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
1993Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
1991Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
2
Hide details for Saptharishi, RamprasadSaptharishi, Ramprasad
2013Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
1
Hide details for Sarrafzadeh, MajiSarrafzadeh, Maji
1986Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji
Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Journal Article
2
Hide details for Sassone, Vladimir (ed.)Sassone, Vladimir (ed.)
2006[Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
2006Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Proceedings Article
1
Hide details for Sassone, V. (ed.)Sassone, V. (ed.)
2006Harren, RolfAttachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
2
Hide details for Sastry, Kumara (ed.)Sastry, Kumara (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Sato, Yosuke (ed.)Sato, Yosuke (ed.)
2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
33
Hide details for Sauerwald, ThomasSauerwald, Thomas
2014Bringmann, Karl
[Sauerwald, Thomas]
[Stauffer, Alexandre]
Sun, He
Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
2013[Bogdan, Paul]
Sauerwald, Thomas
[Stauffer, Alexandre]
Sun, He
Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
2013Hoefer, Martin
Sauerwald, Thomas
Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2013Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas
Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
2012[Akbari, Hoda]
[Berenbrink, Petra]
Sauerwald, Thomas
A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280
Proceedings Article
2012[Meyerhenke, Henning]
Sauerwald, Thomas
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
Journal Article
2012[Kane, Daniel]
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He
Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
2012[Giakkoupis, George]
Sauerwald, Thomas
Sun, He
[Woelfel, Philipp]
Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
2012Friedrich, Tobias
[Gairing, Martin]
Sauerwald, Thomas
Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
2012[Giakkoupis, George]
Sauerwald, Thomas
Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
2012Sauerwald, Thomas
Sun, He
Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Proceedings Article
2012Fountoulakis, Nikolaos
[Panagiotou, Konstantinos]
[Sauerwald, Thomas]
Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Proceedings Article
2011Friedrich, Tobias
Sauerwald, Thomas
[Stauffer, Alexandre]
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
2011[Berenbrink, Petra]
[Hoefer, Martin]
Sauerwald, Thomas
Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
2011[Berenbrink, Petra]
[Friedetzky, Tom]
[Elsaesser, Robert]
[Nagel, Lars]
Sauerwald, Thomas
Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article
2011Doerr, Benjamin
Friedrich, Tobias
[Künnemann, Marvin]
Sauerwald, Thomas
Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Journal Article
2011[Berenbrink, Petra]
[Cooper, Colin]
[Friedetzky, Tom]
Friedrich, Tobias
Sauerwald, Thomas
Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article
2011Sauerwald, Thomas
[Stauffer, Alexandre]
Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
2011Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
2011Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
Sauerwald, Thomas
[Scheideler, Christian]
Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
2011[Elsaesser, Robert]
Sauerwald, Thomas
Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian]
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
2010[Bradonjić, Milan]
[Elsässer, Robert]
Friedrich, Tobias
[Sauerwald, Thomas]
[Stauffer, Alexandre]
Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article
2010Friedrich, Tobias
[Gairing, Martin]
[Sauerwald, Thomas]
Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
2010Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
2010Friedrich, Tobias
[Sauerwald, Thomas]
The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
2010Friedrich, Tobias
Sauerwald, Thomas
The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Electronic Journal Article
2009[Friedrich, Tobias]
[Sauerwald, Thomas]
Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
Proceedings Article
2009Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Journal Article
2009Doerr, Benjamin
[Friedrich, Tobias]
[Künnemann, Marvin]
[Sauerwald, Thomas]
Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Proceedings Article
2009Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
Proceedings Article
2009Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
2008Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Proceedings Article
13
Hide details for Saurabh, SaketSaurabh, Saket
2012Mnich, Matthias
Philip, Geevarghese
[Saurabh, Saket]
[Suchy, Ondrej]
Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
2012[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
2012[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
2012[Cygan, Marek]
[Dell, Holger]
[Lokshtanov, Daniel]
[Marx, Daniel]
[Nederlof, Jesper]
[Okamoto, Yoshio]
[Paturi, Ramamohan]
[Saurabh, Saket]
Wahlström, Magnus
On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
2012[Lokshtanov, Daniel]
[Saurabh, Saket]
Wahlström, Magnus
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
2011[Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
2011[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
Proceedings Article
2011[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Proceedings Article
2011[Fernau, Henning]
[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Mnich, Matthias]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
2010[Fernau, Henning]
[Fomin, Fedor V.]
Philip, Geevarghese
[Saurabh, Saket]
Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
2010[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
2009Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket]
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
1
Hide details for Saurabh, Saket (ed.)Saurabh, Saket (ed.)
2010[Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.]
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
2
Hide details for Sau, IgnasiSau, Ignasi
2009Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket]
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
2009Amini, Omid
[Pérennes, Stéphane]
[Sau, Ignasi]
Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article
4
Hide details for Saxena, NitinSaxena, Nitin
2013[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
2013Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
Proceedings Article
2012[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
1
Hide details for Sayama, Hiroki (ed.)Sayama, Hiroki (ed.)
2010Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten]
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
16
Hide details for Schäfer, GuidoSchäfer, Guido
2010Bonifaci, Vincenzo
[Harks, Tobias]
[Schäfer, Guido]
Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
2006Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Journal Article
2004[Leonardi, Stefano]
Schäfer, Guido
Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243
Proceedings Article
2004[Leonardi, Stefano]
Schäfer, Guido
Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
2004Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article
2004Schäfer, Guido
Sivadasan, Naveen
Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
2004Schäfer, GuidoWorst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
2003Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
Journal Article
2003[Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
[Vredeveld, Tjark]
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
Proceedings Article
2003[Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article
2002Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen
Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
Journal Article
2002Mehlhorn, Kurt
Schäfer, Guido
Attachment IconImplementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
Electronic Journal Article
2001Mehlhorn, Kurt
Schäfer, Guido
A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253
Proceedings Article
2000Mehlhorn, Kurt
Schäfer, Guido
Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
2000Schäfer, GuidoWeighted Matchings in General Graphs
Universität des Saarlandes
Thesis - Masters thesis
1998[Frigioni, Daniele]
Miller, Tobias
[Nanni, Umberto]
[Pasqualone, Giulio]
Schäfer, Guido
Zaroliagis, Christos
An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
7
Hide details for Schaefer, Robert (ed.)Schaefer, Robert (ed.)
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Proceedings Article
2010Kratsch, Stefan
[Lehre, Per Kristian]
[Neumann, Frank]
[Oliveto, Pietro Simone]
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
Proceedings Article
2010Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine]
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Proceedings Article
2010[Böttcher, Süntje]
Doerr, Benjamin
Neumann, Frank
Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
Proceedings Article
2010Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine]
Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
2010[Bringmann, Karl]
Friedrich, Tobias
Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
Proceedings Article
3
Hide details for Schalekamp, FransSchalekamp, Frans
2012[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
2012[Qian, Jiawei]
[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
2011van Zuylen, Anke
[Schalekamp, Frans]
[Williamson, David P.]
Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
1
Hide details for Schanne, ThomasSchanne, Thomas
2001Schanne, ThomasVisualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schapira, MichaelSchapira, Michael
2008Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael]
Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
2
Hide details for Scharbrodt, M.Scharbrodt, M.
1998[Jünger, Michael]
Mutzel, Petra
[Odenthal, Thomas]
[Scharbrodt, M.]
The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
1998Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Journal Article
1
Hide details for Schehr, GregorySchehr, Gregory
2009[Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.]
Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
2
Hide details for Scheideler, ChristianScheideler, Christian
2011Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
Sauerwald, Thomas
[Scheideler, Christian]
Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
2010Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian]
Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
2
Hide details for Scheideler, Christian (ed.)Scheideler, Christian (ed.)
2007Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh]
Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Proceedings Article
2007Funke, Stefan
Laue, Sören
Naujoks, Rouven
Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
3
Hide details for Schenkel, RalfSchenkel, Ralf
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
Proceedings Article
1
Hide details for Schieber, BaruchSchieber, Baruch
2004Kesselman, Alexander
[Lotker, Zvi]
[Mansour, Yishay]
[Patt-Shamir, Boaz]
[Schieber, Baruch]
[Sviridenko, Maxim]
Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
2
Hide details for Schieber, Baruch (ed.)Schieber, Baruch (ed.)
1992Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1992Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
3
Hide details for Schilz, ThomasSchilz, Thomas
2000Schilz, ThomasEffiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Thesis - PhD thesis
1999Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1996Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
3
Hide details for Schindelhauer, ChristianSchindelhauer, Christian
2007Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
2005Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
2000[Karp, Richard]
[Schindelhauer, Christian]
[Shenker, Scott]
Vöcking, Berthold
Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
1
Hide details for Schindelhauer, Christian (ed.)Schindelhauer, Christian (ed.)
2005Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter]
Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
40
Hide details for Schirra, StefanSchirra, Stefan
2009[Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
2008Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
2007Hemmer, Michael
[Hert, Susan]
[Kettner, Lutz]
[Pion, Sylvain]
[Schirra, Stefan]
Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2006Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
2004Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
[Schirra, Stefan]
[Yap, Chee]
Classroom Examples of Robustness Problems in Geometric ComputationsReport
2004Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
2004Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan]
The LEDA class real number -- extended versionReport
2002[de Berg, Marc]
Schirra, Stefan
Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
Proceedings Article
2001[Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2001[Cole, Richard]
[Ost, Kirstin]
Schirra, Stefan
Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
2001Mehlhorn, Kurt
Schirra, Stefan
Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
2000Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
Journal Article
2000[Brönnimann, Hervé]
[Kettner, Lutz]
Schirra, Stefan
[Veltkamp, Remco]
Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216
Part of a Book
2000Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Electronic Proceedings Article
2000Mehlhorn, Kurt
Schirra, Stefan
Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
2000[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
2000Schirra, StefanRobustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
1999Schirra, StefanA Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176
Proceedings Article
1999Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1999Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Proceedings Article
1998Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1998Schirra, StefanComputational Geometry: Theory and Implementation
Universität des Saarlandes
Thesis - Habilitation thesis
1998[de Berg, Marc]
[van Kreveld, Marc]
Schirra, Stefan
Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
Journal Article
1997Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
1997Mehlhorn, Kurt
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan
A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709
Proceedings Article
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
1997[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
1997Schirra, StefanPrecision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
1996Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1996[Devillers, Olivier]
[Golin, Mordecai J.]
[Kedem, Klara]
Schirra, Stefan
Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
1996[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
1996[Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.]
Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
1995[Berg, Marc de]
[Kreveld, Marc van]
Schirra, Stefan
A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
Proceedings Article
1995Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian
Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Proceedings Article
1994Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Proceedings Article
1994Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article
1992Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
1992Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1990Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289
Proceedings Article
4
Hide details for Schirra, Stefan (ed.)Schirra, Stefan (ed.)
2010Berberich, Eric
[Hagen, Matthias]
[Hiller, Benjamin]
[Moser, Hannes]
Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
2010[Mörig, Marc]
[Scholz, Sven]
[Tscheuschner, Tobias]
Berberich, Eric
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
2002[de Berg, Marc]
Schirra, Stefan
Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
Proceedings Article
2002Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)Proceedings
1
Hide details for Schlipf, LenaSchlipf, Lena
2012[Knauer, Christian]
[Schlipf, Lena]
Schmidt, Jens M.
[Tiwary, Hans Raj]
Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
1
Hide details for Schlotter, IldikóSchlotter, Ildikó
2010[Jansen, Klaus]
Kratsch, Stefan
[Marx, Dániel]
[Schlotter, Ildikó]
Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272
Proceedings Article
3
Hide details for Schmidt, Bernd H.Schmidt, Bernd H.
1986Mehlhorn, Kurt
Schmidt, Bernd H.
Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Journal Article
1985Mehlhorn, Kurt
Schmidt, Bernd H.
On BF-perfect graphsReport
1983Mehlhorn, Kurt
Schmidt, Bernd H.
A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309
Proceedings Article
1
Hide details for Schmidt, ChristianeSchmidt, Christiane
2013[Fekete, Sándor P.]
[Friedrichs, Stephan]
[Kröller, Alexander]
[Schmidt, Christiane]
Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
1
Hide details for Schmidt, Erik M.Schmidt, Erik M.
1982Mehlhorn, Kurt
Schmidt, Erik M.
Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337
Proceedings Article
1
Hide details for Schmidt, Gunther (ed.)Schmidt, Gunther (ed.)
1995Chaudhuri, Shiva
Hagerup, Torben
Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
14
Hide details for Schmidt, Jens M.Schmidt, Jens M.
2013Schmidt, Jens M.A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Proceedings Article
2013Schmidt, Jens M.A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Journal Article
2013Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M.
Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
2013Doerr, C.
Schmidt, Jens M.
Ramakrishna, G.
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
2013Schmidt, Jens M.Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Journal Article
2013Schmidt, Jens M.Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/Draft
2013Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
2012[Elmasry, Amr]
Mehlhorn, Kurt
Schmidt, Jens M.
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
2012Schmidt, Jens M.Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Proceedings Article
2012Mehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M.
Attachment IconCertifying 3-Edge-ConnectivityUnpublished/Draft
2012Schmidt, Jens M.Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Journal Article
2012Schmidt, Jens M.
[Valtr, Pavel]
Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Proceedings Article
2012[Knauer, Christian]
[Schlipf, Lena]
Schmidt, Jens M.
[Tiwary, Hans Raj]
Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
2010Elmasry, Amr
Mehlhorn, Kurt
[Schmidt, Jens M.]
An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
2
Hide details for Schmidt, MartinSchmidt, Martin
2011Doerr, Benjamin
Johannsen, Daniel
[Schmidt, Martin]
Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
Proceedings Article
2009Doerr, Benjamin
Fouz, Mahmoud
[Schmidt, Martin]
Wahlström, Magnus
BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
Proceedings Article
1
Hide details for Schmitt, DanielSchmitt, Daniel
2006Schmitt, DanielImplementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
Thesis - Bachelor thesis
16
Hide details for Schmitt, SusanneSchmitt, Susanne
2009[Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
2007[Mourrain, Bernard]
[Pion, Sylvain]
Schmitt, Susanne
[Técourt, Jean-Pierre]
[Tsigaridas, Elias]
Wolpert, Nicola
Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
Part of a Book
2006Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Attachment IconControlled Perturbation for Delaunay TriangulationsReport
2005Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
2005Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Proceedings Article
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
2005Schmitt, SusanneAttachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
2004Schmitt, Susanne
Fousse, Laurent
Attachment IconA comparison of polynomial evaluation schemesReport
2004Schmitt, SusanneCommon Subexpression Search in LEDA_reals -- a study of the diamond-operatorReport
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2004Schmitt, SusanneImproved separation bounds for the diamond operatorReport
2004Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan]
The LEDA class real number -- extended versionReport
2003Schmitt, SusanneCommon Subexpression Search in LEDA_realsReport
2003Schmitt, Susanne
[Zimmer, Horst G.]
Elliptic Curves : A Computational ApproachBook
2003Schmitt, SusanneThe Diamond Operator for Real Algebraic NumbersReport
2001[Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne
Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
1
Hide details for Schmitz, ChristophSchmitz, Christoph
1995Schmitz, ChristophAnalyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Schneider, WolfgangSchneider, Wolfgang
1980Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
1976Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Binary Search Trees: Average and Worst Case BehaviorReport
1976Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert
Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
1
Hide details for Schnorr, C. P.Schnorr, C. P.
1998Schnorr, C. P.
Subramanian, C. R.
Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231
Proceedings Article
28
Hide details for Schömer, ElmarSchömer, Elmar
2009Hemmer, Michael
Limbach, Sebastian
[Schömer, Elmar]
Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Proceedings Article
2008Hemmer, Michael
[Dupont, Laurent]
[Petitjean, Sylvain]
[Schömer, Elmar]
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
2007[Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar]
Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
2007Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
2007Althaus, Ernst
[Baumann, Tobias]
[Schömer, Elmar]
[Werth, Kai]
Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
2006[Schömer, Elmar]
Wolpert, Nicola
An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
2006Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
2005Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106
Proceedings Article
2005Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
2005Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
2004Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola
Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
2004[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Effects of a Modular Filter on Geometric ApplicationsReport
2004Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
2003Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
[Schömer, Elmar]
Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
2002Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
2002Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
2002Lennerz, Christian
Schömer, Elmar
Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
2002Eigenwillig, Arno
[Schömer, Elmar]
Wolpert, Nicola
Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
2001[Fuhrmann, Artur]
Schömer, Elmar
A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057
Proceedings Article
2001[Loock, Achim]
Schömer, Elmar
A Virtual Environment for Interactive Assembly Simulation: From Rigid Bodies to Deformable Cables
In: Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI-01): Emergent computing and virtual engineering, 325-332
Proceedings Article
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
2001Warken, Thomas
Schömer, Elmar
Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62
Proceedings Article
2001Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
1997[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
[Thiel, Christian]
Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
1995[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
Thiel, Christian
Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
1995[Schömer, Elmar]
Thiel, Christian
Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Proceedings Article
1
Hide details for Schömer, Elmar (ed.)Schömer, Elmar (ed.)
2002Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
1
Hide details for Schoenauer, Marc (ed.)Schoenauer, Marc (ed.)
2012Doerr, Benjamin
Winzen, Carola
Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
3
Hide details for Schönherr, SvenSchönherr, Sven
2001[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
CGAL Reference and User ManualsUnknown Form: eBookForm
2000[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
1996[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
1
Hide details for Scholz, SvenScholz, Sven
2010[Mörig, Marc]
[Scholz, Sven]
[Tscheuschner, Tobias]
Berberich, Eric
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
1
Hide details for Schomburg, Dietmar (ed.)Schomburg, Dietmar (ed.)
1995Lenhof, Hans-PeterAn Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Part of a Book
1
Hide details for Schomer, ElmarSchomer, Elmar
2011Hemmer, Michael
[Dupon, Laurent]
[Petitjean, Sylvain]
[Schomer, Elmar]
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
1
Hide details for Schreiber, FalkSchreiber, Falk
1999[Brandenburg, Franz J.]
[Schreiber, Falk]
[Jünger, Michael]
[Marks, Joe]
Mutzel, Petra
Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
Proceedings Article
1
Hide details for Schrijver, Alexander (ed.)Schrijver, Alexander (ed.)
1990Kaufmann, Morgan
Mehlhorn, Kurt
Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
Part of a Book
1
Hide details for Schröder, BiancaSchröder, Bianca
1998Schröder, BiancaUpper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schröder, HeikoSchröder, Heiko
1995[Kaufmann, Michael]
[Schröder, Heiko]
Sibeyn, Jop F.
Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
Next Page