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: 7. Library - 4. Category, Keywords

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
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

Author/EditorYearTitleType
Hide details for (Not Categorized)(Not Categorized)
Abed, Fidaa
Huang, Chien-Chung
2012Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Proceedings Article
Abo-Hasna, Ziad1994Verdrahtung von Kanälen mit Seitenanschlüssen
Universität des Saarlandes
Thesis - Master's thesis
Abraham, David
Cechlárová, Katarina
Manlove, David F.
Mehlhorn, Kurt
2004Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Proceedings Article
Abraham, David
Irving, Robert W.
Mehlhorn, Kurt
Telikepalli, Kavitha
2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Proceedings Article
Abraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article
Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
Adamaszek, Anna
Wiese, Andreas
2013Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
Proceedings Article
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt
2013The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11
Part of a Book
Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Green Larsen, Kasper
Mehlhorn, Kurt
Winzen, Carola
2012The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article
Agarwal, Amit
Agarwal, Tarun
Chopra, Sumit
Feldmann, Anja
Kammenhuber, Nils
Krysta, Piotr
Vöcking, Berthold
2003An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235
Proceedings Article
Agarwal, Pankaj
Arge, Lars
Brodal, Gerth Stølting
Vitter, Jeffrey Scott
1999I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
2012Attachment 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
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2013A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear
Proceedings Article
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2012Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Electronic Journal Article
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Srivastav, Anand
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Journal Article
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke
2012Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article
Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Noa
van Zuylen, Anke
2011Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article
Ajwani, Deepak2005Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes
Thesis - Master's thesis
Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich
2006Attachment IconA computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610
Proceedings Article
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
2012Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
Journal Article
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh
2007Conflict-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
Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh
2007Conflict-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
Ajwani, Deepak
Friedrich, Tobias
2010Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
Journal Article
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
2008An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Journal Article
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
2006Attachment IconAn $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64
Proceedings Article
Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan
2008Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Proceedings Article
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
2009Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Part of a Book
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
2007Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Proceedings Article
Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj
2007On 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
Akbari, Hoda
Berenbrink, Petra
Sauerwald, Thomas
2012A 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
Albers, Susanne1999Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473
Journal Article
Albers, Susanne1999Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
Albers, Susanne1998A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109
Journal Article
Albers, Susanne1998Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Journal Article
Albers, Susanne1997Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139
Proceedings Article
Albers, Susanne1997On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Journal Article
Albers, Susanne1995Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Proceedings Article
Albers, Susanne
Arora, Sanjeev
Khanna, Sanjeev
1999Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Proceedings Article
Albers, Susanne
Charikar, Moses
Mitzenmacher, Michael
1998On delayed information and action in on-line algorithms
In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 71-80
Proceedings Article
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
2000Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Journal Article
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
1998Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462
Proceedings Article
Albers, Susanne
Hagerup, Torben
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Journal Article
Albers, Susanne
Henzinger, Monika R.
1997Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Proceedings Article
Albers, Susanne
Koga, Hisashi
1998New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
Journal Article
Albers, Susanne
Koga, Hisashi
1995Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Proceedings Article
Albers, Susanne
Kursawe, Klaus
1999Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843
Proceedings Article
Albers, Susanne
Kursawe, Klaus
Schuierer, Sven
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article
Albers, Susanne
Mitzenmacher, Michael
2000Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1998Average case analyses of First-Fit and Random-Fit bin packing
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 290-299
Proceedings Article
Albers, Susanne
Mitzenmacher, Michael
1998Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1997Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
Journal Article
Albers, Susanne
Mitzenmacher, Michael
1996Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525
Proceedings Article
Albers, Susanne
von Stengel, Bernhard
Wechner, Ralph
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
Albers, Susanne
Westbrook, Jeffery
1998Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book
Alberts, David
Cattaneo, G
Italiano, Giuseppe
Nanni, Umberto
Zaroliagis, Christos
1998A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article
Albrecht, Jung, Mehlhorn (ed.)1987Parallel algorithms and architectures (WPAA-87) : international workshopProceedings
Albrecht, Jung, Mehlhorn (ed.)1987Parallel algorithms and architectures : International WorkshopProceedings
Albrecht, Marc
Karrenbauer, Andreas
Xu, Chihao
2008A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289
Proceedings Article
Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan
2012Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Journal Article
Alefragis, Panayiotis
Goumopoulos, Christos
Sanders, Peter
Takkula, Tuomo
Wedelin, Dag
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2013A Framework for the Verification of Certifying ComputationsUnpublished/Draft
Alon, Noga
Bradford, Phillip Gnassi
Fleischer, Rudolf
1996Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
Journal Article
Show details for Altenkamp, Doris
Mehlhorn, KurtAltenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter CostReport
Altenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Proceedings Article
Althaus, Ernst2001Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes
Thesis - Doctoral dissertation
Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai
2007Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
Althaus, Ernst
Bockmayr, Alexander
Elf, Matthias
Kasper, Thomas
Jünger, Michael
Mehlhorn, Kurt
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Proceedings Article
Show details for Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, AlexanderAlthaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Journal Article
Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Proceedings Article
Althaus, Ernst
Canzar, Stefan
2008A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
Journal Article
Althaus, Ernst
Canzar, Stefan
2008LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Proceedings Article
Althaus, Ernst
Canzar, Stefan
2007A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278
Proceedings Article
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián
2008Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article
Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin
2008Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Proceedings Article
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
2006Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425
Journal Article
Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut
2002Multiple 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
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
Journal Article
Althaus, Ernst
Duchier, Denys
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
Thiel, Sven
2001An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824
Proceedings Article
Althaus, Ernst
Dumitriu, Daniel
2009Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
Proceedings Article
Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
2004Attachment IconPoint Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933
Proceedings Article
Althaus, Ernst
Fink, Christian
2002A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272
Proceedings Article
Althaus, Ernst
Karamanis, Nikiforos
Koller, Alexander
2004Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Proceedings Article
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
2002A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612
Journal Article
Althaus, Ernst
Kupilas, Joschka
Naujoks, Rouven
2011On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319
Proceedings Article
Althaus, Ernst
Mehlhorn, Kurt
2001Attachment IconTraveling Salesman-Based Curve Reconstruction in Polynomial Time
In: SIAM Journal on Computing [31], 27-66
Journal Article
Althaus, Ernst
Mehlhorn, Kurt
2000TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695
Proceedings Article
Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
2000Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Electronic Proceedings Article
Althaus, Ernst
Naujoks, Rouven
2008Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Proceedings Article
Althaus, Ernst
Naujoks, Rouven
2006Attachment IconComputing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
Proceedings Article
Althaus, Ernst
Polzin, Tobias
Vahdati Daneshmand, Siavash
2003Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Proceedings Article
Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
1991Attachment IconComputing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
Journal Article
Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1990Approximate 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
Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt
1992Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Journal Article
Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
1996Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547
Journal Article
Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail ProbabilitiesReport
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1985Deterministic simulation of idealized parallel computers on more realistic onesReport
Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
Proceedings Article
Alt, Helmut
Mehlhorn, Kurt
1985Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Journal Article
Alt, Helmut
Mehlhorn, Kurt
1979Attachment IconComplexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225
Journal Article
Alt, Helmut
Mehlhorn, Kurt
1978Complexity Arguments in Algebraic Language TheoryReport
Alt, Helmut
Mehlhorn, Kurt
1976Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Proceedings Article
Alt, Helmut
Mehlhorn, Kurt
1975Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
Journal Article
Alt, Helmut
Mehlhorn, Kurt
1975Untere Schranken für den Platzbedarf bei der kontext-freien AnalyseReport
Alt, Helmut
Mehlhorn, Kurt
Munro, J.
1984On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Journal Article
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1984Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Journal Article
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1981Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Proceedings Article
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Journal Article
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1987Attachment IconCongruence, similarity and symmetries of geometric objectsReport
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1987Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Proceedings Article
Alvarez, Victor
Bringmann, Karl
Curticapean, Radu
Ray, Saurabh
2012Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
Proceedings Article
Alvarez, Victor
Bringmann, Karl
Ray, Saurabh
Seidel, Raimund
2013Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
Proceedings Article
Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
Amato, Nancy M.
Goodrich, Michael T.
Ramos, Edgar A.
2000Linear-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
Amini, Omid
Manjunath, Madhusudan
2010Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
Electronic Journal Article
Amini, Omid
Peleg, David
Pérennes, Stéphane
Sau, Ignasi
Saurabh, Saket
2009Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Proceedings Article
Amini, Omid
Pérennes, Stéphane
Sau, Ignasi
2009Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Journal Article
Anagnostopoulos, Aris
Grandoni, Fabrizio
Leonardi, Stefano
Wiese, Andreas
2013Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
Anand, S
Bringmann, Karl
Friedrich, Tobias
Garg, Naveen
Kumar, Amit
2013Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Proceedings Article
Anand, S.
Garg, Naveen
Megow, Nicole
2011Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
Andersson, Arne
Hagerup, Torben
Hastad, Johan
Petersson, Ola
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
Andersson, Arne
Hagerup, Torben
Nilsson, Stefan
Raman, Rajeev
1995Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
Andreou, Maria
Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G.
2002Attachment 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
Angelopoulos, Spyros2010On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12
Proceedings Article
Angelopoulos, Spyros2009Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Proceedings Article
Angelopoulos, Spyros2008A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87
Proceedings Article
Angelopoulos, Spyros
Borodin, Allan
2010Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Journal Article
Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos
2009Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Electronic Journal Article
Angelopoulos, Spyros
Dorrigiv, Reza
Lopez-Ortiz, Alejandro
2008List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410
Proceedings Article
Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
2009Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386
Proceedings Article
Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
Hamel,Angele
2008Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Proceedings Article
Angelopoulos, Spyros
Schweitzer, Pascal
2009Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145
Proceedings Article
Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin
2013Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article
Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José
2013How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73
Proceedings Article
Aranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article
Arge, Lars
Meyer, Ulrich
Toma, Laura
2004External 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
Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
2003On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
Journal Article
Arge, Lars
Meyer, Ulrich
Toma, Laura
Zeh, Norbert
2001On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
Proceedings Article
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
1998All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110
Journal Article
Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos
1995All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376
Proceedings Article
Arikati, Srinivasa Rao
Chen, Danny Z.
Chew, L. Paul
Das, Gautam
Smid, Michiel
Zaroliagis, Christos
1996Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Proceedings Article
Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V.
2001Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62
Journal Article
Arikati, Srinivasa Rao
Dessmark, Anders
Lingas, Andrzej
Marathe, Madhav V.
1996Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360
Proceedings Article
Arikati, Srinivasa Rao
Maheshwari, Anil
1996Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
Journal Article
Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos
1997Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
Journal Article
Arikati, Srinivasa Rao
Mehlhorn, Kurt
1999Attachment IconA correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254
Journal Article
Aronov, Boris
Asano, Tetsuo
Funke, Stefan
2007Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
Proceedings Article
Arya, Sunil
Das, Gautam
Mount, David M.
Salowe, Jeffrey S.
Smid, Michiel
1995Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Proceedings Article
Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
1999On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Journal Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2006On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573
Proceedings Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2006The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20
Proceedings Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
2005Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544
Proceedings Article
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
Arya, Sunil
Mount, David M.
1995Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181
Proceedings Article
Arya, Sunil
Mount, David M.
Narayan, Oruttom
1996Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176
Journal Article
Arya, Sunil
Mount, David M.
Narayan, Oruttom
1995Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344
Proceedings Article
Arya, Sunil
Smid, Michiel
1997Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Journal Article
Asano, Tetsuo
Doerr, Benjamin
2011Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319
Proceedings Article
Ashoff, Oliver2000Agorithmen der modularen Arithmetik
Universität des Saarlandes
Thesis - Master's thesis
Auger, Doerr (ed.)2011Theory of Randomized Search HeuristicsBook
Auletta, Vincenzo
Dinitz, Yefim
Nutov, Zeev
Parente, Domenico
1999A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30
Journal Article
Awerbuch, Baruch
Azar, Yossi
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
1995Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article
Babenko, Maxim A.
Gawrychowski, Pawel
Kociumaka, Tomasz
Starikovskaya, Tatiana A.
2014Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
Proceedings Article
Bachrach, Ran
El-Yaniv, Ran
Reinstädtler, Martin
2002On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
Journal Article
Bacik, Roman
Mahajan, Sanjeev
1995Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575
Proceedings Article
Backes, Werner1998Berechnung kürzester Gittervektoren
Univesität des Saarlandes
Thesis - Master's thesis
Bader, David
Moret, Bernard
Sanders, Peter
2002Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book
Banderier, Cyril2001Combinatoire Analytique des chemins et des cartes
Université de Paris 6
Thesis - Doctoral dissertation
Banderier, Cyril2001Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246
Journal Article
Banderier, Cyril2000A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124
Proceedings Article
Banderier, Cyril2000Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402
Proceedings Article
Banderier, Cyril1999An Introduction to Analytic Number TheoryMiscellaneous
Banderier, Cyril1999On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52
Proceedings Article
Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt
2003Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Proceedings Article
Banderier, Cyril
Bousquet-Mélou, Mireille
Denise, Alain
Flajolet, Philippe
Gardy, Danièle
Gouyou-Beauchamps, Dominique
2002Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Journal Article
Banderier, Cyril
Flajolet, Philippe
2002Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80
Journal Article
Bannai, Hideo
Gawrychowski, Pawel
Inenaga, Shunsuke
Takeda, Masayuki
2013Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
Bansal, Nikhil
Chan, Ho-Leung
2009Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244
Proceedings Article
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk
2011Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Journal Article
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, Kirk
2009Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701
Proceedings Article
Bansal, Nikhil
Gupta, Anupam
Li, Jian
Mestre, Julián
Nagarajan, Viswanath
Rudra, Atri
2010When 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
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
2011Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
2010Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
Bárány, Imre
Doerr, Benjamin
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article
Baraque, Raef2002Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes
Thesis - Master's thesis
Barnes, Greg
Edmonds, Jeff A.
1998Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202
Journal Article
Bartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene
2006On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Journal Article
Barve, Rakesh D.
Grove, Edward
Vitter, Jeffrey Scott
1995An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article
Basit, Abdul
Mustafa, Nabil H.
Ray, Saurabh
Raza, Sarfraz
2010Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Journal Article
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
2001CGAL Reference and User ManualsUnknown Form: eBookForm
Bast, Hannah2009Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367
Part of a Book
Bast, Hannah2002Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178
Proceedings Article
Bast, Hannah1994Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes
Thesis - Master's thesis
Bast, Hannah
Hagerup, Torben
1995Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Journal Article
Bast, Holger2006Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?],
Electronic Journal Article
Bast, Holger2005Attachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
Journal Article
Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar
2007ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
Proceedings Article
Bast, Holger
Dietzfelbinger, Martin
Hagerup, Torben
1992A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141
Proceedings Article
Bast, Holger
Dupret, Georges
Majumdar, Debapriyo
Piwowarski, Benjamin
2006Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Proceedings Article
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
2009Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Part of a Book
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
2006TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,
Electronic Proceedings Article
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Schultes, Dominik
2007In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Proceedings Article
Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik
2007Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Journal Article
Bast, Holger
Hagerup, Torben
1991Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
Proceedings Article
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Electronic Proceedings Article
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Attachment 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
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Journal Article
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Proceedings Article
Bast, Holger
Mortensen, Christian Worm
Weber, Ingmar
2006Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Proceedings Article
Bast, Holger
Weber, Ingmar
2007Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Proceedings Article
Bast, Holger
Weber, Ingmar
2007Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Electronic Proceedings Article
Bast, Holger
Weber, Ingmar
2006Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
Proceedings Article
Bast, Holger
Weber, Ingmar
2006When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Proceedings Article
Bast, Holger
Weber, Ingmar
2005Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
Proceedings Article
Bast, Holger
Weber, Ingmar
2005Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Proceedings Article
Baswana, Surender
Biswas, Somenath
Doerr, Benjamin
Friedrich, Tobias
Kurur, Piyush P.
Neumann, Frank
2009Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
Proceedings Article
Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article
Baswana, Surender
Sen, Sandeep
2007A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563
Journal Article
Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth
2005Attachment IconNew Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681
Proceedings Article
Batra, Prashant
Sharma, Vikram
2010Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
Journal Article
Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
2012Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176
Proceedings Article
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Journal Article
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1992Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
Baus, Andreas2005Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Master's thesis
Baus, Andreas2004Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Thesis - Master's thesis
Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
2003Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
Proceedings Article
Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark
2003Average 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
Becker, Jörg1996Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes
Thesis - Master's thesis
Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
Becker, Michael
Mehlhorn, Kurt
1986Attachment IconAlgorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176
Journal Article
Becker, Michael
Mehlhorn, Kurt
1984Attachment IconAlgorithms for routing in planar graphsReport
Becker, Ruben2012The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes
Thesis - Bachelor thesis
Behle, Markus2007Attachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Proceedings Article
Behle, Markus
Jünger, Michael
Liers, Frauke
2007Attachment IconA Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392
Proceedings Article
Behrens, Christian2000Solid Modeling durch Boolesche Operationen
Universität des Saarlandes
Thesis - Master's thesis
Beier, Rene2004Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes
Thesis - Doctoral dissertation
Beier, Rene2000Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes
Thesis - Master's thesis
Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2011Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Journal Article
Beier, Rene
Krysta, Piotr
Czumaj, Artur
Vöcking, Berthold
2004Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Proceedings Article
Beier, René
Röglin, Heiko
Vöcking, Berthold
2007Attachment 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
Beier, Rene
Sanders, Peter
Sivadasan, Naveen
2002Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
Beier, Rene
Sibeyn, Jop F.
2000A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36
Proceedings Article
Bei, Xiaohui2015Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142
Proceedings Article
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
2003Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152
Electronic Proceedings Article
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Journal Article
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2005GCC-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
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Attachment IconFiltering algorithms for the Same and UsedBy constraintsReport
Ben-Asher, Y.
Schuster, Assaf
Sibeyn, Jop F.
1995Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326
Journal Article
Ben-Zwi, Oren
Hermelin, Danny
Lokshtanov, Daniel
Newman, Ilan
2011Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Journal Article
Berberich, Eric2008Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes
Thesis - Doctoral dissertation
Berberich, Eric2004Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes
Thesis - Master's thesis
Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
2007Exact Computation of Arrangements of Rotated ConicsReport
Berberich, Eric
Ebert, Franziska
Fogel, Efi
Kettner, Lutz
2006Web-site with benchmark instances for planar curve arrangementsReport
Berberich, Eric
Ebert, Franziska
Kettner, Lutz
2006Definition of file format for benchmark instances for arrangements of QuadricsReport
Berberich, 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
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
Berberich, Eric
Eigenwillig, Arno
Fogel, Efi
Halperin, Dan
Hert, Susan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
2003Specification of the traits classes for CGAL arrangements of curvesReport
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Weber, Dennis
Wolpert, Nicola
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Wolpert, Nicola
2005Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Proceedings Article
Berberich, Eric
Emeliyanenko, Pavel
2008CGAL's Curved Kernel via AnalysisReport
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2012Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Electronic Journal Article
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2011Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Electronic Journal Article
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2011Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98
Proceedings Article
Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
2011An 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
Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael
2010An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16
Electronic Journal Article
Berberich, Eric
Fogel, Efi
Halperin, Dan
Kerber, Michael
Setter, Ophir
2010Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2007Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
Berberich, Eric
Fogel, Efi
Meyer, Andreas
2007Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic CurvesReport
Berberich, Eric
Hagen, Matthias
Hiller, Benjamin
Moser, Hannes
2010Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2011Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2011Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
2010Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
Berberich, Eric
Hemmer, Michael
2007Definition of the 3D Quadrical Kernel ContentReport
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
2008Prototype implementation of the algebraic kernelReport
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos I.
Teillaud, Monique
2007Revision of interface specification of algebraic kernelReport
Berberich, Eric
Hemmer, Michael
Kerber, Michael
2011A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article
Berberich, Eric
Hemmer, Michael
Kerber, Michael
2010A Generic Algebraic Kernel for Non-linear Geometric ApplicationsReport
Berberich, Eric
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2005An 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
Berberich, Eric
Kerber, Michael
2008Attachment IconArrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
Proceedings Article
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2008Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
Berberich, Eric
Kettner, Lutz
2007Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common PointReport
Berberich, Eric
Meyerovitch, Michal
2007Computing Envelopes of QuadricsReport
Berenbrink, Petra
Cooper, Colin
Friedetzky, Tom
Friedrich, Tobias
Sauerwald, Thomas
2011Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
Proceedings Article
Berenbrink, Petra
Friedetzky, Tom
Elsaesser, Robert
Nagel, Lars
Sauerwald, Thomas
2011Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
Proceedings Article
Berenbrink, Petra
Hoefer, Martin
Sauerwald, Thomas
2011Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
Berghammer, Rudolf
Friedrich, Tobias
Neumann, Frank
2010Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502
Proceedings Article
Berg, Marc de
Kreveld, Marc van
Schirra, Stefan
1995A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88
Proceedings Article
Berman, Piotr
Krysta, Piotr
2003Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201
Proceedings Article
Berthomé, P.
Duboux, T.
Hagerup, Torben
Newman, I.
Schuster, Assaf
1995Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article
Biedl, Therese
Kaufmann, Michael
Mutzel, Petra
1998Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
Proceedings Article
Bifet, Albert
Castillo, Carlos
Chirita, Paul-Elexandru
Weber, Ingmar
2005An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
Electronic Proceedings Article
Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt
1994Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Journal Article
Birk, Rüdiger1997Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes
Thesis - Master's thesis
Blanchebarbe, Markus1996Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes
Thesis - Master's thesis
Blelloch, Guy E.
Farzan, Arash
2010Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
Proceedings Article
Blum, Norbert
Mehlhorn, Kurt
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Journal Article
Blum, Norbert
Mehlhorn, Kurt
1979Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Proceedings Article
Blum, Norbert
Mehlhorn, Kurt
1978On the Average Number of Rebalancing Operations in Weight-Balanced TreesReport
Böcker, Sebastian
Hüffner, Falk
Truss, Anke
Wahlström, Magnus
2009A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
Bodirsky, Manuel
Kutz, Martin
2007Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
Journal Article
Bodlaender, Hans L.
Deogun, Jitender S.
Jansen, Klaus
Kloks, Ton
Kratsch, Dieter
Müller, Haiko
Tuza, Zsolt
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
Journal Article
Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
Bodlaender, Hans L.
Hagerup, Torben
1998Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
Journal Article
Bodlaender, Hans L.
Hagerup, Torben
1995Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Proceedings Article
Bogdan, Paul
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Electronic Proceedings Article
Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole
2012Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619
Journal Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Megow, Nicole
Wiese, Andreas
2013Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Proceedings Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Wiese, Andreas
2013Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Proceedings Article
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor
2007Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Fouz, Mahmoud
Gurvich, Vladimir
Makino, Kazuhisa
Manthey, Bodo
2011Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2012Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
Unpublished/Draft
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2012On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788
Journal Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2011A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic gamesUnpublished/Draft
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
Journal Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2010On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person GamesUnpublished/Draft
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir
2008A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109
Proceedings Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
2011The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Journal Article
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj
2008Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
Journal Article
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
2010Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
Journal Article
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
2008On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
2004Attachment 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
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2004Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
2003Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2004Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa
2003Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2007Generating Vertices of Polyhedra and Related Monotone Generation ProblemsUnpublished/Draft
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Proceedings Article
Böttcher, Süntje
Doerr, Benjamin
Neumann, Frank
2010Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
Proceedings Article
Boullay, Johannes1996Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes
Thesis - Master's thesis
Bouziane, Driss
El Kahoui, M'hammed
2002Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
Journal Article
Bradford, Phillip Gnassi
Capoyleas, Vasilis
1997Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91
Journal Article
Bradford, Phillip Gnassi
Choppela, Venkatesh
Rawlins, Gregory J.E.
1995Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Proceedings Article
Bradford, Phillip Gnassi
Fleischer, Rudolf
1995Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408
Proceedings Article
Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel
1997More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
Journal Article
Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
2002Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
Journal Article
Bradford, Phillip Gnassi
Golin, Mordecai J.
Larmore, Lawrence L.
Rytter, Wojciech
1998Optimal 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
Bradford, Phillip Gnassi
Rawlins, Gregory J.E.
Shannon, Greogory E.
1998Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Journal Article
Bradford, Phillip Gnassi
Reinert, Knut
1996Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Proceedings Article
Bradonjić, Milan
Elsässer, Robert
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre
2010Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article
Bramer, Andreas2003Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Master's thesis
Brandenburg, Franz J.
Jünger, Michael
Mutzel, Petra
Lengauer, Thomas
1997SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen"
In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67
Proceedings Article
Braun, Sebastian2000Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes
Thesis - Master's thesis
Bremer, Dirk1995Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes
Thesis - Master's thesis
Brengel, Klaus2000Externe Prioritätswarteschlangen
Universität des Saarlandes
Thesis - Master's thesis
Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
Ferragina, Paolo
1999An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359
Proceedings Article
Breslauer, Dany
Jiang, Tao
Jiang, Zhigen
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
Journal Article
Breslauer, Dany
Ramesh, Hariharan
1996Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
Journal Article
Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika
2012Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Journal Article
Bringmann, Karl2013Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218
Proceedings Article
Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
Sliacan, Jakub
2013Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
Proceedings Article
Bringmann, Karl
Engels, Christian
Manthey, Bodo
Raghavendra Rao, B. V.
2013Random 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
Bringmann, Karl
Friedrich, Tobias
2013Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
Journal Article
Bringmann, Karl
Friedrich, Tobias
2013Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2013Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2012Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116
Journal Article
Bringmann, Karl
Friedrich, Tobias
2012Attachment IconConvergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2010An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Journal Article
Bringmann, Karl
Friedrich, Tobias
2010Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Journal Article
Bringmann, Karl
Friedrich, Tobias
2010The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2010Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2009Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2009Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
2008Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447
Proceedings Article
Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
Bringmann, Karl
Green Larsen, Kasper
2013Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
Proceedings Article
Bringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian
2012Attachment IconRemarks on Category-Based Routing in Social NetworksUnpublished/Draft
Bringmann, Karl
Panagiotou, Konstantinos
2012Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
Proceedings Article
Bringmann, Karl
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He
2014Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
Brockenauer, Ralf1997Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes
Thesis - Master's thesis
Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
2009On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article
Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart
2007Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
Brockhoff, Dimo
Friedrich, Tobias
Neumann, Frank
2008Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
Proceedings Article
Brodal, Gerth Stølting1998Finger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549
Proceedings Article
Brodal, Gerth Stølting1997Predecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32
Proceedings Article
Brodal, Gerth Stølting1996Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427
Proceedings Article
Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1996The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15
Proceedings Article
Brodal, Gerth Stølting
Chaudhuri, Shiva
Radhakrishnan, R.
1996The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351
Journal Article
Brodal, Gerth Stølting
Fagerberg, Rolf
Meyer, Ulrich
Zeh, Norbert
2004Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
Proceedings Article
Brodal, Gerth Stølting
Gasieniec, Leszek
1996Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74
Proceedings Article
Brodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin
2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
Brodal, Gerth Stølting
Katajainen, Jyrki
1998Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Proceedings Article
Brodal, Gerth Stølting
Pinotti, M. Cristina
1998Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168
Proceedings Article
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
1998A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21
Journal Article
Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos
1997A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693
Proceedings Article
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
2001Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
Journal Article
Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article
Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2005Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
Proceedings Article
Brown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
Journal Article
Buchberger, Mehlhorn, Näher, Nievergelt (ed.)1994Special issue on “algorithms: implementation, libraries and use”Book
Bundy, David
Hebbinghaus, Nils
Stellmacher, Bernd
2006Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
Journal Article
Burkhardt, Stefan2002Filter Algorithms for Approximate String Matching
Universität des Saarlandes
Thesis - Doctoral dissertation
Burnikel, Christoph1996Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes
Thesis - Doctoral dissertation
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
2009A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
Journal Article
Burnikel, Christoph
Funke, Stefan
Seel, Michael
2001Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
Journal Article
Burnikel, Christoph
Funke, Stefan
Seel, Michael
1998Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Proceedings Article
Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1995Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Proceedings Article
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
1994Attachment 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
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
1994Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article
Busch, Philip Johannes2011Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes
Thesis - Bachelor thesis
Butman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
Butz, Bernd1997Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes
Thesis - Master's thesis
Cai, Jin-Yi
Lu, Pinyan
Xia, Mingji
2013Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
Proceedings Article
Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Journal Article
Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard
1996A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Proceedings Article
Canzar, Stefan
El-Kebir, Mohammed
Pool, Rene
Elbassioni, Khaled
Malde, Alpeshkumar K.
Mark, Alan E.
Geerke, Daan P.
Stougie, Leen
Klau, Gunnar W.
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
Canzar, Stefan
Elbassioni, Khaled
Elmasry, Amr
Raman, Rajiv
2010On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Proceedings Article
Canzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
2011On Tree-Constrained Matchings and GeneralizationsUnpublished/Draft
Canzar, Stefan
Elbassioni, Khaled
Mestre, Julian
2010A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33
Proceedings Article
Canzar, Stefan
Remy, Jan
2006Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article
Canzar,Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
2011On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Journal Article
Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi
2007Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136
Proceedings Article
Caroli, Manuel2007Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes
Thesis - Master's thesis
Caroli, Manuel2006Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes
Thesis - Bachelor thesis
Case, John
Kötzing, Timo
2013Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
Electronic Journal Article
Case, John
Kötzing, Timo
2012Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
Journal Article
Case, John
Kötzing, Timo
2012Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
Journal Article
Case, John
Kötzing, Timo
2011Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
Electronic Proceedings Article
Case, John
Kötzing, Timo
2010Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article
Case, John
Kötzing, Timo
2010Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Proceedings Article
Celikik, Marjan
Bast, Hannah
2009Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
Proceedings Article
Chandran, L. Sunil
Sivadasan, Naveen
2004Attachment IconOn the Hadwiger's Conjecture for Graph ProductsReport
Chang, Kevin
Johnson, Aaron
2008Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Proceedings Article
Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Journal Article
Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk
2009Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264
Electronic Proceedings Article
Chan, Ho-Leung
Edmonds, Jeff
Pruhs, Kirk
2009Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10
Proceedings Article
Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
Journal Article
Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2010Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190
Electronic Proceedings Article
Chan, Ho-Leung
Megow, Nicole
Sitters, René
van Stee, Rob
2012Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
Journal Article
Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2011Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403
Electronic Proceedings Article
Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2010Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35
Proceedings Article
Chan, T-H. Hubert
Dhamdhere, Kedar
Gupta, Anupam
Kleinberg, Jon
Slivkins, Aleksandrs
2009Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Journal Article
Chan, T.-H. Hubert
Elbassioni, Khaled
2011A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723
Journal Article
Chaudhuri, Shiva1996Sensitive functions and approximate problems
In: Information and Computation [126], 161-168
Journal Article
Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Journal Article
Chaudhuri, Shiva
Dubhashi, Devdatt
1997Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56
Journal Article
Chaudhuri, Shiva
Dubhashi, Devdatt
1995Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Proceedings Article
Chaudhuri, Shiva
Garg, Naveen
Ravi, R.
1998The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Journal Article
Chaudhuri, Shiva
Hagerup, Torben
1995Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1997The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Journal Article
Chaudhuri, Shiva
Radhakrishnan, Jaikumar
1996Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36
Proceedings Article
Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos
2000Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
Chaudhuri, Shiva
Subrahmanyam, K. V.
Wagner, Frank
Zaroliagis, Christos
1998Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
Chaudhuri, Shiva
Zaroliagis, Christos
2000Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
Journal Article
Chaudhuri, Shiva
Zaroliagis, Christos
1998Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Journal Article
Chaudhuri, Shiva
Zaroliagis, Christos
1995Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Proceedings Article
Chaudhuri, Shiva
Zaroliagis, Christos
1995Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Proceedings Article
Cheng, Siu-Wing
Funke, Stefan
Golin, Mordecai J.
Kumar, Piyush
Poon, Sheung-Hung
Ramos, Edgar A.
2003Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
Proceedings Article
Chen, Danny Z.
Das, Gautam
Smid, Michiel
1996Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160
Proceedings Article
Chen, Xujin
Doerr, Benjamin
Hu, Xiaodong
Ma, Weidong
van Stee, Rob
Winzen, Carola
2012Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Journal Article
Cheriyan, Joseph
Hagerup, Torben
1995A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
Journal Article
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1996An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170
Journal Article
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248
Proceedings Article
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?Report
Cheriyan, Joseph
Mehlhorn, Kurt
1999Attachment IconAn analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
Journal Article
Cheriyan, Joseph
Mehlhorn, Kurt
1996Attachment IconAlgorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549
Journal Article
Chian, Yi-Feng
Goodrich, Michael T.
Grove, Edward
Tamassia, Roberto
Vengroff, Darren Erik
Vitter, Jeffrey Scott
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
Chin, Francis Y. L.
Guo, Zeyu
Sun, He
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Journal Article
Chlebus, Bogdan S.
Czumaj, Artur
Gasieniec, Leszek
Kowaluk, Miroslaw
Plandowski, Wojciech
1996Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
Proceedings Article
Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F.
1997Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
Proceedings Article
Chlebus, Bogdan S.
Kowalski, Dariusz
2005Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739
Proceedings Article
Chlebus, Bogdan S.
Kowalski, Dariusz
2004A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274
Proceedings Article
Chlebus, Bogdan S.
Kowalski, Dariusz
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Journal Article
Chlebus, Bogdan S.
Kowalski, Dariusz
Shvartsman, Alex
2004Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
Proceedings Article
Chong, Ka Wong1996Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14
Proceedings Article
Chong, Ka Wong
Lam, Tak Wah
1998Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410
Journal Article
Chong, Ka Wong
Lam, Tak Wah
1996Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232
Proceedings Article
Chong, Ka Wong
Ramos, Edgar A.
1998Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Proceedings Article
Christodoulou, George2008Price of Anarchy
In: Encyclopedia of Algorithms, 1-99
Part of a Book
Christodoulou, George
Elbassioni, Khaled
Fouz, Mahmoud
2010Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
Proceedings Article
Christodoulou, George
Gourves, Laurent
Pascual, Fanny
2007Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Proceedings Article
Christodoulou, George
Koutsoupias, Elias
2009Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
Journal Article
Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
2010Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18
Journal Article
Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
2007Attachment IconMechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
Proceedings Article
Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash
2009Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
Journal Article
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
2009A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Journal Article
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
2008A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
Proceedings Article
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
2007A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
Proceedings Article
Christodoulou, George
Kovács, Annamária
2010A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016
Proceedings Article
Christodoulou, George
Kovács, Annamária
Schapira, Michael
2008Bayesian 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
Christodoulou, George
Kovacs, Annamaria
van Stee, Rob
2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Journal Article
Christodoulou, George
Kovacs, Annamaria
van Stee, Rob
2010A 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
Christodoulou, George
Mehlhorn, Kurt
Pyrga, Evangelia
2011Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130
Proceedings Article
Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A 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
Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Journal Article
Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz
2004The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993
Proceedings Article
Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R.
2007The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Journal Article
Cilleruelo, Javier
Hebbinghaus, Nils
2009Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Journal Article
Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Journal Article
Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1992Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Proceedings Article
Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Isopi, Marc
Panconesi, Alessandro
Pasquale, Francesco
Silvestri, Riccardo
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Pasquale, Francesco
Silvestri, Riccardo
2013Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),
Proceedings Article
Cole, Richard
Farach-Colton, Martin
Hariharan, Ramesh
Przytycka, Teresa
Thorup, Mikkel
2000An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
Journal Article
Cole, Richard
Hariharan, Ramesh
1996An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332
Proceedings Article
Cole, Richard
Hariharan, Ramesh
Paterson, Mike
Zwick, Uri
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
Cole, Richard
Kowalik, Lukasz
2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Journal Article
Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Journal Article
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Journal Article
Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker
1997Average-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
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2010Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
Journal Article
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2008Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
Proceedings Article
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2007Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Journal Article
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
Journal Article
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
2006Deterministic 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
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor
2006Deterministic Random Walks on the Integers
In: ??? [?], 1-27
Miscellaneous
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor
2005Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
Proceedings Article
Correa, Jose R.
Megow, Nicole
Raman, Rajiv
Suchan, Karol
2009Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
Proceedings Article
Crauser, Andreas2001LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes
Thesis - Doctoral dissertation
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
2001Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Journal Article
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
1999I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Proceedings Article
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
1998Attachment 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
Crochemore, Maxime
Galil, Zvi
Gasieniec, Leszek
Park, Kunsoo
Rytter, Wojciech
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
Crochemore, Maxime
Gasieniec, Leszek
Hariharan, Ramesh
Muthukrishnan, S.
Rytter, Wojciech
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Journal Article
Crochemore, Maxime
Gasieniec, Leszek
Rytter, Wojciech
1998Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
Proceedings Article
Croitoru, Cosima2012Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes
Thesis - Master's thesis
Croitoru, Cosmina2013Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013,
Proceedings Article
Croitoru, Cosmina
Kötzing, Timo
2014A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45
Proceedings Article
Croitoru, Cosmina
Kötzing, Timo
2012Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82
Proceedings Article
Csaba, Bela2007On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Journal Article
Csaba, Bela
Krysta, Piotr
Karpinski, Marek
2002Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83
Proceedings Article
Csaba, Bela
Lodha, S.
2006A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104
Journal Article
Curticapean, Radu
Künnemann, Marvin
2013A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360
Proceedings Article
Cygan, Marek
Dell, Holger
Lokshtanov, Daniel
Marx, Daniel
Nederlof, Jesper
Okamoto, Yoshio
Paturi, Ramamohan
Saurabh, Saket
Wahlström, Magnus
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
Cygan, Marek
Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus
2012Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
Czumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
Muthukrishnan, S.
Träff, Jesper Larsson
1997The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Proceedings Article
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold
2002Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
Proceedings Article
Czumaj, Artur
Vöcking, Berthold
2002Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420
Proceedings Article
Czyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej
2006Complexity of searching for a black holeUnpublished/Draft
Czyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej
2005Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
Proceedings Article
Dams, Johannes
Hoefer, Martin
Kesselheim, Thomas
2013Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
Proceedings Article
Das, Gautam
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha
1997Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Proceedings Article
Das, Gautam
Kapoor, Sanjiv
Smid, Michiel
1997On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460
Journal Article
Das, Gautam
Kapoor, Sanjiv
Smid, Michiel
1996On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75
Proceedings Article
Datta, Amitava
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal Article
de Berg, Marc
Schirra, Stefan
2002Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
Proceedings Article
de Berg, Schirra (ed.)2002Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)Proceedings
De Sterck, Hans2012A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379
Journal Article
De Sterck, Hans2012A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117
Journal Article
De Sterck, Hans2012Steepest Descent Preconditioning for Nonlinear GMRES OptimizationUnpublished/Draft
De Sterck, Hans
Henson, Van Emden
Sanders, Geoff
2011Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
De Sterck, Hans
Miller, Killian
Sanders, Geoff
Winlaw, Manda
2011Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
Dedorath, Jürgen
Gergov, Jordan
Hagerup, Torben
1995More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Proceedings Article
Dementiev, Roman2006Algorithm Engineering for Large Data Sets
Universität des Saarlandes
Thesis - Doctoral dissertation
Dementiev, Roman
Kärkkäinen, Juha
Mehnert, Jens
Sanders, Peter
2005Attachment 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
Dementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data SetsReport
Dementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
Dementiev, Roman
Sanders, Peter
2003Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
Proceedings Article
Deng, Xiaotie
Mahajan, Sanjeev
1997The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
Journal Article
Denny, Markus2003Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451
Proceedings Article
Denny, Markus1994Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes
Thesis - Master's thesis
DeSimone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni
1995Exact 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
Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej
2006Deterministic rendezvous in graphsUnpublished/Draft
Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej
2006Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
Journal Article
Deussen, Peter
Mehlhorn, Kurt
1977Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Journal Article
Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A.
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Journal Article
Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A.
1999Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
Proceedings Article
Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
2003Attachment 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
Dickert, Peter2000Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes
Thesis - Master's thesis
Diedrich, Florian
Kehden, Britta
Neumann, Frank
2008Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98
Proceedings Article
Diedrich, Florian
Neumann, Frank
2008Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833
Proceedings Article
Diekert, Volker
Jez, Artur
Plandowski, Wojciech
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
Diete, Iris1995Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes
Thesis - Master's thesis
Dietzfelbinger, Martin
Hagerup, Torben
Katajainen, Jyrki
Penttonen, Martti
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1991Dynamic Perfect Hashing: Upper and Lower BoundsReport
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1988Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
Proceedings Article
Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H.
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
Diks, Krzysztof
Hagerup, Torben
1998More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
Journal Article
Diks, Krzysztof
Hagerup, Torben
1996More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140
Proceedings Article
Ding, Wei2003Geometric Rounding without changing the Topology
Universität des Saarlandes
Thesis - Master's thesis
Dinitz, Yefim
Garg, Naveen
Goemans, Michel X.
1999On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Journal Article
Dinitz, Yefim
Nutov, Zeev
1999A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
Journal Article
Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos
1995Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Proceedings Article
Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos
1995On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
Proceedings Article
Djidjev, Hristo N.
Pantziou, G. E.
Zaroliagis, Christos
2000Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
Journal Article
Dobkin, David P.
Gunopulos, Dimitrios
1996Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132
Proceedings Article
Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex PolyhedronReport
Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
1993Attachment 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
Doerr, Benjamin2013Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Journal Article
Doerr, Benjamin2012Black-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092
Proceedings Article
Doerr, Benjamin2011Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320
Proceedings Article
Doerr, Benjamin2009Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111
Part of a Book
Doerr, Benjamin2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Journal Article
Doerr, Benjamin2007Attachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
Journal Article
Doerr, Benjamin2007Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Journal Article
Doerr, Benjamin2007Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Proceedings Article
Doerr, Benjamin2007Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
Journal Article
Doerr, Benjamin2006Attachment IconGenerating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583
Proceedings Article
Doerr, Benjamin2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Journal Article
Doerr, Benjamin2006Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99
Journal Article
Doerr, Benjamin2005Integral Approximation
Christian-Albrechts-Universität zu Kiel
Thesis - Habilitation thesis
Doerr, Benjamin2005Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068
Proceedings Article
Doerr, Benjamin2005Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628
Proceedings Article
Doerr, Benjamin2004Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
Journal Article
Doerr, Benjamin2001Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
Journal Article
Doerr, Benjamin
Doerr, Carola
Ebel, Franziska
2013Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788
Proceedings Article
Doerr, Benjamin
Doerr, Carola
Spöhel, Reto
Thomas, Henning
2013Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Electronic Journal Article
Doerr, Benjamin
Eremeev, Anton
Horoba, Christian
Neumann, Frank
Theile, Madeleine
2009Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
Doerr, Benjamin
Eremeev, Anton
Neumann, Frank
Theile, Madeleine
Thyssen, Christian
2011Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2011Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
2011Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302
Electronic Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2011Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2010Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2009A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2006Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19
Miscellaneous
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2012Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2012Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2012Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2011Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2011Social 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
Doerr, Benjamin
Fouz, Mahmoud
Schmidt, Martin
Wahlström, Magnus
2009BBOB: 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
Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten
2011Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten
2010Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
2009Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
Journal Article
Doerr, Benjamin
Friedrich, Tobias
2006Attachment IconDeterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Journal Article
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2006Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2005Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas
2011Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Journal Article
Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas
2009Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
2009Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Journal Article
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
2009Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
2008Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Proceedings Article
Doerr, Benjamin
Gnewuch, Michael
2008Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312
Proceedings Article
Doerr, Benjamin
Gnewuch, Michael
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
Neumann, Frank
2007A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Proceedings Article
Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich
2008Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Journal Article
Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter
2008 Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Journal Article
Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus
2010Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
Journal Article
Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus
2009Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
2013Adaptive Drift Analysis
In: Algorithmica [65], 224-250
Journal Article
Doerr, Benjamin
Goldberg, Leslie Ann
2010Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
2010Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian
2011Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian
2010Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
Doerr, Benjamin
Happ, Edda
2008Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Proceedings Article
Doerr, Benjamin
Happ, Edda
Klein, Christian
2012Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Journal Article
Doerr, Benjamin
Happ, Edda
Klein, Christian
2011Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Journal Article
Doerr, Benjamin
Happ, Edda
Klein, Christian
2007A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Proceedings Article
Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Journal Article
Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
Doerr, Benjamin
Hota, Ashish
Kötzing, Timo
2012Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24
Proceedings Article
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
2013Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Journal Article
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
2009Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
Proceedings Article
Doerr, Benjamin
Jansen, Thomas
2011Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
Journal Article
Doerr, Benjamin
Jansen, Thomas
Klein, Christian
2008Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Proceedings Article
Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
Journal Article
Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
2010Attachment IconEdge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
2007Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Lehre, Per Christian
Wagner, Markus
Winzen, Carola
2011Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Journal Article
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine
2010More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Schmidt, Martin
2011Attachment 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
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Journal Article
Doerr, Benjamin
Klein, Christian
2006Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40
Electronic Journal Article
Doerr, Benjamin
Klein, Christian
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
Doerr, Benjamin
Klein, Christian
Storch, Tobias
2007Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
Proceedings Article
Doerr, Benjamin
Kodric, Bojana
Voigt, Marco
2013Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Proceedings Article
Doerr, Benjamin
Kötzing, Timo
Winzen, Carola
2011Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
2013How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
2013Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus
2011Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus
2010Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201
Proceedings Article
Doerr, Benjamin
Lengler, Johannes
Kötzing, Timo
Winzen, Carola
2011Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988
Proceedings Article
Doerr, Benjamin
Lengler, Johannes
Steurer, Daniel
2006Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
Proceedings Article
Doerr, Benjamin
Lorenz, Ulf
2006Attachment IconError Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
Journal Article
Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola
2012Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Electronic Journal Article
Doerr, Benjamin
Neumann, Frank
2010In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
Journal Article
Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Journal Article
Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Proceedings Article
Doerr, Benjamin
Neumann, Frank
Wegener, Ingo
2010Editorial
In: Algorithmica [57], 119-120
Journal Article
Doerr, Benjamin
Pohl, Sebastian
2012Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324
Proceedings Article
Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
Proceedings Article
Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Proceedings Article
Doerr, Benjamin
Srivastav, Anand
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Journal Article
Doerr, Benjamin
Srivastav, Anand
2001Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
Journal Article
Doerr, Benjamin
Sudholt, Dirk
Witt, Carsten
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
Proceedings Article
Doerr, Benjamin
Theile, Madeleine
2009Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Proceedings Article
Doerr, Benjamin
Wahlström, Magnus
2009Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
Proceedings Article
Doerr, Benjamin
Winzen, Carola
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Journal Article
Doerr, Benjamin
Winzen, Carola
2012Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
Doerr, Benjamin
Winzen, Carola
2012Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
Journal Article
Doerr, Benjamin
Winzen, Carola
2012Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Electronic Journal Article
Doerr, Benjamin
Winzen, Carola
2011Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Electronic Journal Article
Doerr, Carola
De Rainville, François-Michel
2013Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796
Proceedings Article
Doerr, Carola
Gnewuch, Michael
Wahlström, Magnus
2013Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Part of a Book
Doerr, C.
Schmidt, Jens M.
Ramakrishna, G.
2013Computing 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
Donato, Debora
Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F.
2006Attachment IconAlgorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
Electronic Journal Article
Dorchain, Jörg1996An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes
Thesis - Master's thesis
Duan, Ran2013Attachment IconBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
Proceedings Article
Duan, Ran
Mehlhorn, Kurt
2012A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8
Electronic Journal Article
Dubhashi, Devdatt
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Journal Article
Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian
1993Attachment 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
Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
2009How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17
Electronic Journal Article
Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208
Proceedings Article
Duncan, C.A.
Goodrich, Michael T.
Ramos, Edgar A.
1997Efficient 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
Durrett, Greg
Neumann, Frank
O'Reilly, Una-May
2011Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80
Proceedings Article
Eades, Peter
Marks, Joe
Mutzel, Petra
North, Stephen
1998Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
Proceedings Article
Eades, Peter
Mutzel, Petra
1998Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26
Part of a Book
Ebert, Franziska2005Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes
Thesis - Bachelor thesis
Edelkamp, Stefan
Meyer, Ulrich
2001Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184
Proceedings Article
Edelsbrunner, Herbert
Ramos, Edgar A.
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Journal Article
Eigensatz, Michael
Giesen, Joachim
Manjunath, Madhusudan
2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
Eigenwillig, Arno2008Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Thesis - Doctoral dissertation
Eigenwillig, Arno2003Attachment IconExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
Thesis - Master's thesis
Eigenwillig, Arno
Kerber, Michael
2008Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
Proceedings Article
Eigenwillig, Arno
Kettner, Lutz
Krandick, Werner
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
2005Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
2007Attachment IconSnap Rounding of Bézier CurvesReport
Eigenwillig, Arno
Schömer, Elmar
Wolpert, Nicola
2002Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
Eiglsperger, Markus
Fekete, Sandor P.
Klau, Gunnar W.
2001Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
Part of a Book
Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
Eisenbrand, Friedrich
Funke, Stefan
Garg, Naveen
Könemann, Jochen
2003A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522
Proceedings Article
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Journal Article
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
Proceedings Article
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
Proceedings Article
Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao
2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
Proceedings Article
El Kahoui, M'hammed2008Attachment IconComputing with algebraic curves in generic positionMiscellaneous
El Kahoui, M'hammed2008Attachment IconPolynomial parametrization of nonsingular algebraic curvesMiscellaneous
El Kahoui, M'hammed2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
Journal Article
El Kahoui, M'hammed2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
Journal Article
El Kahoui, M'hammed2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
Journal Article
El Kahoui, M'hammed2004Attachment IconAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
Proceedings Article
El Kahoui, M'hammed2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
Journal Article
El Kahoui, M'hammed2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
Journal Article
El Kahoui, M'hammed2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
Journal Article
El Kahoui, M'hammed2002Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
Journal Article
El Kahoui, M'hammed2000Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
Journal Article
El Kahoui, M'hammed
Rakrak, Said
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Journal Article
Elbassioni, Khaled2012A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
Proceedings Article
Elbassioni, Khaled2009Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Journal Article
Elbassioni, Khaled2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Journal Article
Elbassioni, Khaled2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Journal Article
Elbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He
2013Multi-Attribute Profit-Maximizing PricingUnpublished/Draft
Elbassioni, Khaled
Chan, Hubert
2010A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267
Proceedings Article
Elbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim
2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Part of a Book
Elbassioni, Khaled
Elmasry, Amr
Makino, Kazuhisa
2011Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Journal Article
Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René
2009Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Journal Article
Elbassioni, Khaled
Fouad, Mohamed
Bertino, Elisa
2012Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450
Proceedings Article
Elbassioni, Khaled
Fouz, Mahmoud
Swamy, Chaitanya
2010Approximation 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
Elbassioni, Khaled
Garg, Naveen
Gupta, Divya
Kumar, Amit
Narula, Vishal
Pal, Arindam
2012Approximation 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
Elbassioni, Khaled
Hagen, Matthias
Rauf, Imran
2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
Elbassioni, Khaled
Jeli´c, Slobodan
Matijevi`c, Domagoj
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Journal Article
Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj
2011Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Journal Article
Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj
2009Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371
Electronic Proceedings Article
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Journal Article
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2009Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Proceedings Article
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2009Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
2012Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Journal Article
Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
2010Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Proceedings Article
Elbassioni, Khaled
Paluch, Katarzyna
van Zuylen, Anke
2012Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
2009On 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
Elbassioni, Khaled
Rauf, Imran
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Journal Article
Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
Elbassioni, Khaled
Sitters, Rene
Zhang, Yan
2007A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
Elbassioni, Khaled
Tiwary, Hans Raj
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Journal Article
Elbassioni, Khaled
Tiwary, Hans Raj
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Journal Article
Elbassioni, Khaled
Tiwary, Hans Raj
2009Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Proceedings Article
Elbassioni, Khaled
Tiwary, Hans Raj
2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Proceedings Article
Elbassioni, Khaled
Tiwary, Hans Raj
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Journal Article
Elbassioni, Khaled M.2006Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Proceedings Article
Elbassioni, Khaled M.2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Journal Article
Elbassioni, Khaled M.2006On the Complexity of Monotone Boolean Duality TestingReport
Elbassioni, Khaled M.2006On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Proceedings Article
Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Journal Article
Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Proceedings Article
Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
Elbassioni, Khaled M.
Fishkin, Aleksei V.
Sitters, Rene
2006On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Proceedings Article
Elbassioni, Khaled M.
Katriel, Irit
2005Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182
Proceedings Article
Elbassioni, Khaled M.
Katriel, Irit
Kutz, Martin
Mahajan, Meena
2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Proceedings Article
Elbassioni, Khaled M.
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj
2009Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
Electronic Journal Article
Elbassioni, Khaled M.
Lotker, Zvi
Seidel, Raimund
2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Journal Article
Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
Elbassioni, Khaled M.
Mustafa, Nabil H.
2006Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Proceedings Article
Elbassioni, Khaled M.
Mustafa, Nabil H.
2005Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksUnpublished/Draft
Elbassioni, Khaled M.
Sitters, Rene
Zhang, Yan
2007Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
Elmasry, Amr2010Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Journal Article
Elmasry, Amr2010The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Journal Article
Elmasry, Amr2009Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Journal Article
Elmasry, Amr
Elbassioni, Khaled M.
2005Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251
Electronic Proceedings Article
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Proceedings Article
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
Elmasry, Amr
Manjunath, Madhusudan
2009Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Proceedings Article
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2010An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
Elsaesser, Robert
Sauerwald, Thomas
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
Emeliyanenko, Pavel2012Attachment IconComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
Electronic Journal Article
Emeliyanenko, Pavel2012Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
Thesis - Doctoral dissertation
Emeliyanenko, Pavel2011Attachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
Proceedings Article
Emeliyanenko, Pavel2010Attachment 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
Emeliyanenko, Pavel2010Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), -
Poster
Emeliyanenko, Pavel2010Attachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
Emeliyanenko, Pavel2009Attachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Proceedings Article
Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
2009Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconAn implementation of the 2D Algebraic KernelReport
Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationReport
Emeliyanenko, Pavel
Sagraloff, Michael
2012On 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
Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
Emminghaus, Frank1995Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes
Thesis - Master's thesis
Epstein, Leah
Jez, Lukasz
Sgall, Jiri
van Stee, Rob
2012Attachment 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
Epstein, Leah
Kesselman, Alexander
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Journal Article
Epstein, Leah
Kleiman, Elena
Mestre, Julian
2009Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
Proceedings Article
Epstein, Leah
Kleiman, Elena
van Stee, Rob
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2010Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
Epstein, Leah
Levin, Asaf
Mestre, Julian
Segev, Danny
2010Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
Electronic Proceedings Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2013Attachment 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
Epstein, Leah
Levin, Asaf
van Stee, Rob
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Journal Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2010Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
Epstein, Leah
van Stee, Rob
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Journal Article
Epstein, Leah
van Stee, Rob
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
Epstein, Leah
van Stee, Rob
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Journal Article
Epstein, Leah
van Stee, Rob
Tamir, Tami
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
Evans, Brian
Schwarz, Christian
Teich, Jürgen
Vainshtein, Alek
Welzl, Emo
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
Evans, B.L.
Schwarz, Christian
Teich, Jürgen
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
1996The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
Farzan, Arash
Gagie, Travis
Navarro, Gonzalo
2010Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Proceedings Article
Farzan, Arash
Munro, J. Ian
2011Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
Journal Article
Feldmann, Matthias2012Stochastic optimization with fitness proportional ant systems

Universität des Saarlandes
Thesis - Bachelor thesis
Feld, Thomas1998Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes
Thesis - Master's thesis
Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
Fellows, Michael R.
Friedrich, Tobias
Hermelin, Danny
Narodytska, Nina
Rosamond, Frances A.
2011Constraint 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
Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A.
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
Feremans, Corinne
Grigoriev, Alexander
Sitters, Rene
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
Ferragina, Paolo
Gross, Roberto
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Journal Article
Fialko, Sergej1997Das planare Augmentierungsproblem
Universität des Saarlandes
Thesis - Master's thesis
Finkler, Ulrich1997Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes
Thesis - Doctoral dissertation
Finkler, Ulrich
Mehlhorn, Kurt
1999Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902
Proceedings Article
Finkler, Ulrich
Mehlhorn, Kurt
1997Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389
Proceedings Article
Fink, Christian2001Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes
Thesis - Master's thesis
Fleischer, Lisa
Skutella, Martin
2003Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
Proceedings Article
Fleischer, Rudolf1999Effiziente und Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
Fleischer, Rudolf1996A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149
Journal Article
Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
1992Selected 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
Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Journal Article
Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
Fleischer, Rudolf
Wahl, Michaela
2000Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Proceedings Article
Fogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1995Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
Fontaine, Marc2003Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes
Thesis - Master's thesis
Fontet, Mehlhorn (ed.)1984Theoretical aspects of computer science (STACS-84) : [1st] symposiumProceedings
Fotakis, Dimitris
Kontogiannis, Spyros
Koutsoupias, Elias
Mavronicolas, Marios
Spirakis, Paul G.
2002Attachment IconThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
Proceedings Article
Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G.
2002Attachment IconRadiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234
Proceedings Article
Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2003Attachment 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
Fountoulakis, Nikolaos2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Journal Article
Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny
2011Average Case Parameterized ComplexityUnpublished/Draft
Fountoulakis, Nikolaos
Huber, Anna
2009Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Journal Article
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Proceedings Article
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2009Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
Proceedings Article
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Proceedings Article
Fountoulakis, Nikolaos
Kang, Ross
McDiarmid, Colin
2010The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
Electronic Journal Article
Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos
2011The 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
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Journal Article
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2010Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
Proceedings Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2010Rumor 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
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Sauerwald, Thomas
2012Ultra-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
Fountoulakis, Nikolaos
Reed, Bruce
2008The 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
Fountoulakis, Nikolaos
Reed, Bruce
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
Fouz, Mahmoud2012Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
Thesis - Doctoral dissertation
Fouz, Mahmoud2006Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes
Thesis - Bachelor thesis
Fraigniaud, Pierre
Gasieniec, Leszek
Kowalski, Dariusz
Pelc, Andrzej
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
Frederickson, Greg N.
Solis-Oba, Roberto
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
Journal Article
Fredman, Michael
Khachiyan, Leonid
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
Journal Article
Friedrichs, Stephan
Kulau, Ulf
Wolf, Lars
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
Proceedings Article
Friedrich, Tobias2007Use and Avoidance of Randomness
Universität des Saarlandes
Thesis - Doctoral dissertation
Friedrich, Tobias2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Thesis - Master's thesis
Friedrich, Tobias
Bringmann, Karl
Voss, Thomas
Igel, Christian
2011The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article
Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
2010Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
Friedrich, Tobias
Hebbinghaus, Nils
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Journal Article
Friedrich, Tobias
Hebbinghaus, Nils
2008Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
Proceedings Article
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Journal Article
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Journal Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Journal Article
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2009Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
Friedrich, Tobias
Kroeger, Trent
Neumann, Frank
2012Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
Electronic Journal Article
Friedrich, Tobias
Neumann, Frank
2010When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Journal Article
Friedrich, Tobias
Neumann, Frank
2008When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
Proceedings Article
Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Journal Article
Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
2010The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
2010The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Electronic Journal Article
Friedrich, Tobias
Sauerwald, Thomas
2009Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
Fries, Markus2001Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Master's thesis
Fries, Markus2000Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Master's thesis
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Dynamization of geometric data structuresReport
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176
Proceedings Article
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A.
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Journal Article
Frigioni, Daniele
Miller, Tobias
Nanni, Umberto
Pasqualone, Giulio
Schäfer, Guido
Zaroliagis, Christos
1998An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Journal Article
Fuhrmann, Artur
Schömer, Elmar
2001A 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
Funke, Stefan2005Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53
Proceedings Article
Funke, Stefan2001Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes
Thesis - Doctoral dissertation
Funke, Stefan1997Exact Arithmetic using Cascaded Computation
Universität des Saarlandes
Thesis - Master's thesis
Funke, Stefan
Guibas, Leonidas
Nguyen, An
Wang, Yusu
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Journal Article
Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
Journal Article
Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2005A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223
Proceedings Article
Funke, Stefan
Klein, Christian
2006Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
Proceedings Article
Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2006Attachment IconControlled Perturbation for Delaunay TriangulationsReport
Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Proceedings Article
Funke, Stefan
Laue, Soeren
Lotker, Zvi
Naujoks, Rouven
2011Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035
Journal Article
Funke, Stefan
Laue, Sören
2007Attachment IconBounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
Proceedings Article
Funke, Stefan
Laue, Sören
Naujoks, Rouven
2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
2008Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295
Proceedings Article
Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
Miscellaneous
Funke, Stefan
Malamatos, Theocharis
Matijevic, Domagoj
Wolpert, Nicola
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Proceedings Article
Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding 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
Funke, Stefan
Mehlhorn, Kurt
2000Attachment IconLOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
Proceedings Article
Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Journal Article
Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan
1999Attachment IconStructural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42
Proceedings Article
Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan
2004The LEDA class real number -- extended versionReport
Funke, Stefan
Milosavljevic, Nikola
2007Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
Proceedings Article
Funke, Stefan
Milosavljevic, Nikola
2007Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967
Proceedings Article
Funke, Stefan
Milosavljevic, Nikola
2005Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
Proceedings Article
Funke, Stefan
Ramos, Edgar A.
2002Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
Proceedings Article
Funke, Stefan
Ramos, Edgar A.
2001Reconstructing 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
Fürer, Martin
Mehlhorn, Kurt
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
Journal Article
Fürer, Martin
Mehlhorn, Kurt
1986AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225
Proceedings Article
Fürer, Martin
Mehlhorn, Kurt
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
Fürer, Martin
Mehlhorn, Kurt
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
Gagie, Travis
Gawrychowski, Pawel
Kärkkäinen, Juha
Nekrich, Yakov
Puglisi, Simon J.
2014LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
Gagie, Travis
Gawrychowski, Pawel
Nekrich, Yakov
2013Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Proceedings Article
Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
Proceedings Article
Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proceedings Article
Garg, Naveen1996A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
Proceedings Article
Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Journal Article
Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas
1996Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings Article
Garg, Naveen
Vazirani, Vijay V.
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
Garg, Naveen
Vazirani, Vijay V.
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
Gärtner, Tobias
Hotz, Günter
2009Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Proceedings Article
Gasieniec, Leszek
Indyk, Piotr
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Proceedings Article
Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
Gasieniec, Leszek
Jansson, Jesper
Lingas, Andrzej
Östlin, Anna
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
Proceedings Article
Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
Gasieniec, Leszek
Kranakis, Evangelos
Krizanc, Danny
Pelc, Andrzej
1996Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Proceedings Article
Gasieniec, Leszek
Pelc, Andrzej
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Journal Article
Gasieniec, Leszek
Pelc, Andrzej
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Journal Article
Gast, Christoph1997Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Thesis - Master's thesis
Gawrychowski, Pawel2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Journal Article
Gawrychowski, Pawel2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
Gawrychowski, Pawel2012Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Proceedings Article
Gawrychowski, Pawel2012Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Proceedings Article
Gawrychowski, Pawel2012Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Electronic Proceedings Article
Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
Gawrychowski, Pawel
Kucherov, Gregory
Nekrich, Yakov
Starikovskaya, Tatiana
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
Gawrychowski, Pawel
Manea, Florin
Mercas, Robert
Nowotka, Dirk
Tiseanu, Catalin
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)