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: 2. Titles of all years

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

TitleAuthor(s) [non member]Editor(s) [non member]YearType
Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
[Kavvadias, Dimitris J.]
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
Zaroliagis, Christos
1996Journal Article
Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
[Fellows, Michael R.]
[Hartman, Tzvika]
Hermelin, Danny
[Landau, Gad M.]
[Rosamond, Frances A.]
[Rozenberg, Liat]
2011Journal Article
Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Mehlhorn, Kurt
Waldmann, Uwe
[Wilhelm, Reinhard]
2005Part of a Book
Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
Amini, Omid
[Pérennes, Stéphane]
[Sau, Ignasi]
2009Journal Article
Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
[Giannopoulos, Panos]
[Knauer, Christian]
Wahlström, Magnus
[Werner, Daniel]
2012Journal Article
Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Kumar, V. S. Anil
[Arya, Sunil]
[Ramesh, Hariharan]
[Montanari, Ugo]
[Rolim, José D. P.]
[Welzl, Emo]
2000Proceedings Article
Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Kesselman, Alexander
[Mansour, Yishay]
2004Journal Article
Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
Emeliyanenko, Pavel2012Thesis - PhD thesis
Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351
Meyer, UlrichSakellariou, Rizos
Keane, John
Gurd, John
Freeman, Len
2001Proceedings Article
Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
[Gagie, Travis]
Gawrychowski, Pawel
[Nekrich, Yakov]
2013Proceedings Article
Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213
Doerr, Benjamin
[Fouz, Mahmoud]
2010Journal Article
Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19
Doerr, Benjamin
Fouz, Mahmoud
2006Miscellaneous
Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes
Fouz, Mahmoud2006Thesis - Bachelor thesis
Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292
[Sibeyn, Jop F.]
[Abello, James]
Meyer, Ulrich
2002Proceedings Article
Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes
Maurer, Tanja1997Thesis - Masters thesis
Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Hilpert, Peter1996Thesis - Masters thesis
Attachment IconHidden line elimination for isooriented rectanglesMehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Report
Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Journal Article
Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes
Lang, Hans-Hermann1994Thesis - Masters thesis
Attachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
Emeliyanenko, Pavel[Smari, Waleed W.]
[McIntire, John P.]
2011Proceedings Article
High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
[Sloot, Peter]
[Bubak, Marian]
[Hoekstra, Alfons]
[Hertzberger, Bob]
1999Proceedings Article
Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket]
[Schwentick, Thomas]
[D{\"u}rr, Christoph]
2011Proceedings Article
Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
Funke, Stefan
Klein, Christian
[Amenta, Nina]
[Cheong, Otfried]
2006Proceedings Article
Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
[Rusinov, Momchil]
Schweitzer, Pascal
2010Journal Article
How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Kaligosi, Kanela
[Sanders, Peter]
[Azar, Yossi]
[Erlebach, Thomas]
2006Proceedings Article
How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
Kötzing, Timo
[Sudholt, Dirk]
[Theile, Madeleine]
[Krasnogor, Natalio]
[Lanzi, Pier Luca]
2011Proceedings Article
How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Sanders, Peter
[Solis-Oba, Roberto]
Paterson, Mike2000Proceedings Article
How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Sanders, Peter
[Solis-Oba, Roberto]
2001Journal Article
How 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
[Dumitriu, Daniel]
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola]
2009Electronic Journal Article
How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74
Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola]
2008Proceedings Article
Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo]
[Günter Rudolph]
[Thomas Jansen]
[Simon M. Lucas]
[Carlo Poloni]
[Nicola Beume]
2008Proceedings Article
How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596
Doerr, Benjamin
Künnemann, Marvin
[Blum, Christian]2013Proceedings Article
Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
van Leeuwen, Jan1994Proceedings Article
How 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
[Antoniadis, Antonios]
[Huang, Chien-Chung]
Ott, Sebastian
[Verschae, José]
[Chatterjee, Krishnendu]
[Sgall, Jiri]
2013Proceedings Article
How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
[Grigoriev, Alexander]
[van Loon, Joyce]
Sitters, Rene
[Uetz, Marc]
[Fomin, Fedor V.]2006Proceedings Article
Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Jez, Artur
[Maletti, Andreas]
2013Journal Article
Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
2011Journal Article
Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver]
2007Journal Article
Implementation and Experimental Evaluation of Dynamic Transitive Closure Algorithms
Universität des Saarlandes
Miller, Tobias1998Thesis - Masters thesis
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
[Mörig, Marc]
[Scholz, Sven]
[Tscheuschner, Tobias]
Berberich, Eric
[Müller-Hannemann, Matthias]
[Schirra, Stefan]
2010Part of a Book
Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus
[L'Ecuyer, P.]
[Owen, A. B.]
2009Proceedings Article
Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes
Fries, Markus2001Thesis - Masters thesis
Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes
Fries, Markus2000Thesis - Masters thesis
Implementation of Hammock Decomposition with Application to Shortest Path Problems
Universität des Saarlandes
Mueck, Thomas1998Thesis - Masters thesis
Implementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes
Neumann, Adrian2011Thesis - Masters thesis
Attachment IconImplementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
Mehlhorn, Kurt
Schäfer, Guido
2002Electronic Journal Article
Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Mehlhorn, Kurt
Schäfer, Guido
[Näher, Stefan]
[Wagner, Dorothea]
2000Proceedings Article
Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
Schmitt, Daniel2006Thesis - Bachelor thesis
Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes
Stephan, Anne2000Thesis - Masters thesis
Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
Mehlhorn, Kurt
Michail, Dimitrios
2006Electronic Journal Article
Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
Mehlhorn, Kurt
Michail, Dimitrios
[Nikoletseas, Sotiris]2005Proceedings Article
Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Mehlhorn, Kurt
Michail, Dimitrios
2007Electronic Journal Article
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Harren, Rolf
van Stee, Rob
[Dinur, Irit]
[Jansen, Klaus]
[Naor, Joseph]
[Rolim, José]
2009Proceedings Article
Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
[Djidjev, Hristo N.]
Pantziou, G. E.
Zaroliagis, Christos
2000Journal Article
Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
El Kahoui, M'hammed2001Journal Article
Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Polzin, Tobias
[Vahdati Daneshmand, Siavash]
2001Journal Article
Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Doerr, Benjamin
[Theile, Madeleine]
[Raidl, Günther]
[Rothlauf, Frank]
2009Proceedings Article
Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371
Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj]
[Albers, Susanne]
[Marion, Jean-Yves]
2009Electronic Proceedings Article
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
[Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Noa]
van Zuylen, Anke
[Demetrescu, Camil]
[Halldórsson, Magnús M.]
2011Proceedings Article
Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
[Ailon, Nir]
[Avigdor-Elgrabli, Noa]
[Liberty, Edo]
van Zuylen, Anke
2012Journal Article
Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
[Segal, Michael]
[Nikolaidis, Ioanis]
[Barbeau, Michel]
[Kranakis, Evangelos]
2004Proceedings Article
Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Funke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael]
2007Journal Article
Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Doerr, Benjamin2013Journal Article
Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
[Epstein, Leah]
[Levin, Asaf]
Mestre, Julian
[Segev, Danny]
[Marion, Jean-Yves]
[Schwentick, Thomas]
2010Electronic Proceedings Article
Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julian
[Severdija, Domagoj]
2011Journal Article
Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
Elbassioni, Khaled M.
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj]
2009Electronic Journal Article
Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Doerr, Benjamin
Hebbinghaus, Nils
[Werth, Sören]
2006Journal Article
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257
Angelopoulos, Spyros2007Proceedings Article
Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Chong, Ka Wong
Ramos, Edgar A.
[Bilardi, Gianfranco]
[Italiano, Giuseppe F.]
[Pietracaprina, Andrea]
[Pucci, Geppino]
1998Proceedings Article
Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Kowalik, Lukasz2009Journal Article
Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Kowalik, Lukasz[Fomin, Fedor V.]2006Proceedings Article
Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
[Applegate, David]
[Brodal, Gerth]
2007Proceedings Article
Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Harren, Rolf
[Kern, Walter]
[Solis-Oba, Roberto]
[Persiano, Giuseppe]
2012Proceedings Article
Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
[Baruah, Sanjoy]
Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian]
2010Journal Article
Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Albers, Susanne
Hagerup, Torben
1997Journal Article
Improved randomized on-line algorithms for the list update problem
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 412-419
Albers, Susanne1995Proceedings Article
Improved randomized on-line algorithms for the list update problem
In: SIAM Journal on Computing [27], 682-693
Albers, Susanne1998Journal Article
Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
[Epstein, Leah]
van Stee, Rob
2011Journal Article
Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
Mustafa, Nabil H.
Ray, Saurabh
2010Journal Article
Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
[Maggs, Bruce M.]
Vöcking, Berthold
2000Journal Article
Improved separation bounds for the diamond operatorSchmitt, Susanne2004Report
Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Gawrychowski, Pawel
[Mozes, Shay]
[Weimann, Oren]
[Esparza, Javier]
[Fraigniaud, Pierre]
[Husfeldt, Thore]
[Koutsoupias, Elias]
2014Proceedings Article
Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
Althaus, Ernst
Polzin, Tobias
[Vahdati Daneshmand, Siavash]
[Jansen, Klaus]
[Margraf, Marian]
[Mastrolli, Monaldo]
[Rolim, José D. P.]
2003Proceedings Article
Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130
[Christodoulou, George]
Mehlhorn, Kurt
[Pyrga, Evangelia]
[Demetrescu, Camil]
[Halldórsson, Magnús M.]
2011Proceedings Article
In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
Doerr, Benjamin
Neumann, Frank
2010Journal Article
In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik]
[Applegate, David]
[Brodal, Gerth]
2007Proceedings Article
Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
[Edelsbrunner, Herbert]
Ramos, Edgar A.
1997Journal Article
Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Fotakis, DimitrisAlbers, Susanne
Radzik, Tomasz
2004Proceedings Article
Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94van Leeuwen, Jan
Mehlhorn, Kurt
Reps, Thomas
1994Report
Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Elbassioni, Khaled
Elmasry, Amr
[Kamel, Ibrahim]
2008Part of a Book
Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceGao, Pu (Jane)
[Wormald, Nicholas]
[Su, Yi]
2010Unpublished/Draft
Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Mehlhorn, Kurt
[Seel, Michael]
2003Journal Article
Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für InformatikMehlhorn, Kurt
Snelting, Gregor
2000Proceedings
Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
Funke, Stefan
Rauf, Imran
[Kranakis, Evangelos]
[Opatrny, Jaroslav]
2007Proceedings Article
Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
Parreira, Josiane2003Thesis - Masters thesis
Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
Funke, Stefan
[Milosavljevic, Nikola]
Prasanna, Viktor K.
Iyengar, Sitharama
Spirakis, Paul
Welsh, Matt
2005Proceedings Article
Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
[Teramoto, Sachio]
[Asano, Tetsuo]
[Katoh, Naoki]
Doerr, Benjamin
2006Journal Article
Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
Bast, Holger
Weber, Ingmar
[Adachi, Jun]
[Shan, Wang]
[Vakali, Athena]
2005Proceedings Article
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013),
Megow, Nicole
[Mestre, Julian]
2013Proceedings Article
Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Khachiyan, Leonid
Porkolab, Lorant
2000Journal Article
Integral Approximation
Christian-Albrechts-Universität zu Kiel
Doerr, Benjamin2005Thesis - Habilitation thesis
Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?],
Bast, Holger2006Electronic Journal Article
Interface specification of algebraic kernelBerberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias]
Kettner, Lutz2006Report
Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Hoffmann, K
Mehlhorn, Kurt
1984Journal Article
Attachment IconIntersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542
Mehlhorn, Kurt
Simon, Klaus
Budach, Lothar1985Proceedings Article
Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Ramos, Edgar A.1997Journal Article
Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386
Angelopoulos, Spyros
[Lopez-Ortiz, Alejandro]
2009Proceedings Article
Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
[Brönnimann, Hervé]
Burnikel, Christoph
[Pion, Sylvain]
1998Proceedings Article
Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47
[Brönnimann, Hervé]
Burnikel, Christoph
[Pion, Sylvain]
2001Journal Article
Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282
Meyer, Ulrike
[Wetzel, Susanne]
2006Proceedings Article
Introducing 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
Doerr, Benjamin[Albers, Susanne]
[Alt, Helmut]
[Näher, Stefan]
2009Part of a Book
Attachment IconIntroduction
In: Journal of Symbolic Computation [17], 295-295
Mehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg
1994Journal Article
Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Elmasry, Amr
[Hammad, Abdelrahman]
2008Journal Article
Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549
[Neumann, Dirk]
[Haltner, Elleonore]
[Lehr, Claus-Michael]
Kohlbacher, Oliver
Lenhof, Hans-Peter
1998Proceedings Article
IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
[Voorhees, Ellen M.]
[Buckland, Lori Phillips]
2006Electronic Proceedings Article
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingBast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Report
Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
[Dayal, Umeshwar]
[Whang, Kyu-Young]
[Lomet, David B.]
[Alonso, Gustavo]
[Lohman, Guy M.]
[Kersten, Martin L.]
[Cha, Sang Kyun]
[Kim, Young-Kuk]
2006Proceedings Article
Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Mehlhorn, Kurt
Sagraloff, Michael
2009Proceedings Article
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92
Kratsch, Stefan
Schweitzer, Pascal
[Kaplan, Haim]2010Proceedings Article
Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
Telikepalli, Kavitha
Chandran, Sunil
[Subramanian, C. R.]
[Warnow, Tandy]
[Zhu, Binhai]
2003Proceedings Article
Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Kötzing, Timo[Kivinen, Jyrki]
[Szepesvári, Csaba]
[Ukkonen, Esko]
[Zeugmann, Thomas]
2011Proceedings Article
I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
[Agarwal, Pankaj]
[Arge, Lars]
Brodal, Gerth Stølting
[Vitter, Jeffrey Scott]
1999Proceedings Article
I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445
Meyer, Ulrich
[Zeh, Norbert]
[Di Battista, Giuseppe]
[Zwick, Uri]
2003Proceedings Article
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551
Meyer, Ulrich
[Zeh, Norbert]
[Azar, Yossi]
[Erlebach, Thomas]
2006Proceedings Article
I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
[Abello, James M.]
Vitter, Jeffrey Scott
1999Proceedings Article
Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesWolpert, Nicola2003Report
Attachment IconJacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614
[Agrawal, Manindra]
Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin]
2012Proceedings Article
Keller oder Dach zuerst
In: Besser als Mathe, 111-116
Megow, Nicole[Biermann, Katja]
[Götschel, Martin]
[Lutz-Westphal, Brigitte]
2010Part of a Book
Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
Kratsch, Stefan2010Thesis - PhD thesis
Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes
Lüttke-Hüttmann, Dirk2000Thesis - Masters thesis
Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
[Mehlhorn, Kurt]
Claus, Volker
Thomas, Wolfgang
[Wilhelm, Reinhard]1996Proceedings Article
Attachment IconKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
Mehlhorn, KurtBöhling, Karl-Heinz
Spies, Peter Pau
1979Proceedings Article
Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Hammerschmidt, Frank1999Thesis - Masters thesis
Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132
Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Spaniol, Otto1997Proceedings Article
Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Semeloglou, Anastasios2000Thesis - Masters thesis
Lagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550
Mestre, Julián2008Proceedings Article
Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Journal Article
Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221
[Keßler, Christoph W.]
Träff, Jesper Larsson
1997Proceedings Article
Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
[Knauer, Christian]
[Schlipf, Lena]
Schmidt, Jens M.
[Tiwary, Hans Raj]
2012Journal Article
Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337
Mehlhorn, Kurt
Schmidt, Erik M.
1982Proceedings Article
LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
Althaus, Ernst
Canzar, Stefan
2008Proceedings Article
Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
[Kroeske, Jense]
[Ghandar, Adam]
[Michalewicz, Zbigniew]
Neumann, Frank
[Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola]
2008Proceedings Article
Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
[Heinz, Jeffrey]
[Kasprzik, Anna]
Kötzing, Timo
2012Journal Article
Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
[Case, John]
Kötzing, Timo
2012Journal Article
Attachment IconLEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
Crauser, Andreas
Mehlhorn, Kurt
[Vitter, Jeffrey S.]
[Zaroliagis, Christos D.]
1999Proceedings Article
LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes
Crauser, Andreas2001Thesis - PhD thesis
LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39
Näher, Stefan
Mehlhorn, Kurt
Reuter, Andreas1990Proceedings Article
LEDA : A Platform for Combinatorial and Geometric ComputingMehlhorn, Kurt
Näher, Stefan
1995Report
LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5
Näher, Stefan
Mehlhorn, Kurt
Paterson, Michael S.1990Proceedings Article
LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Mehlhorn, Kurt
Näher, Stefan
Kreczmar, Antoni
Mirkowska, Grazyna
1989Proceedings Article
LEDA: a platform for combinatorial and geometric computingMehlhorn, Kurt
[Näher, Stefan]
1999Book
Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Mehlhorn, Kurt
[Näher, Stefan]
1995Journal Article
Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
[Boros, Endre]
Elbassioni, Khaled
[Makino, Kazuhisa]
2010Journal Article
Length bounded network flows
Universität des Saarlandes
Kaligosi, Kanela2003Thesis - Masters thesis
Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788
Doerr, Benjamin
Doerr, Carola
Ebel, Franziska
2013Proceedings Article
Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
[Jünger, Michael]
[Leipert, Sebastian]
Mutzel, Petra
[Whitesides, Sue H.]1998Proceedings Article
LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Gidenstam, Anders
[Papatriantafilou, Marina]
[Tovar, Eduardo]
[Tsigas, Philippas]
[Fouchal, Hacène]
2007Proceedings Article
Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
[Bein, Wolfgang W.]
Fleischer, Rudolf
[Larmore, Lawrence L.]
2000Journal Article
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
[Jansen, Klaus]
Porkolab, Lorant
2002Journal Article
Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common PointBerberich, Eric
Kettner, Lutz
2007Report
Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212
[Amato, Nancy M.]
[Goodrich, Michael T.]
Ramos, Edgar A.
2000Proceedings Article
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
van Zuylen, Anke2011Journal Article
Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
Ramos, Edgar A.2000Proceedings Article
Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
[Jansen, Klaus]
Solis-Oba, Roberto
[Sviridenko, Maxim]
[Pardalos, Panos M.]2000Part of a Book
List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
Sibeyn, Jop F.[Bougé, Luc]
[Fraigniaud, Pierre]
[Mignotte, Anne]
[Robert, Yves]
1996Proceedings Article
List Ranking on Meshes
In: Acta Informatica [35], 543-566
Sibeyn, Jop F.1998Journal Article
List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410
Angelopoulos, Spyros
[Dorrigiv, Reza]
[Lopez-Ortiz, Alejandro]
2008Proceedings Article
Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
[Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott]
1995Proceedings Article
Load 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
[Ben-Asher, Y.]
[Schuster, Assaf]
Sibeyn, Jop F.
1995Journal Article
Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Hoefer, Martin2013Journal Article
Attachment IconLocal routing of two-terminal nets is easy[Kaufmann, Michael]
[Mehlhorn, Kurt]
1984Report
Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Hoefer, Martin
[Wagner, Lisa]
[Fomin, Fedor]
[Freivalds, Rusins]
[Kwiatkowska, Marta]
[Peleg, David]
2013Proceedings Article
Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes
Birk, Rüdiger1997Thesis - Masters thesis
LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
Funke, Stefan
Mehlhorn, Kurt
2002Journal Article
Attachment IconLOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
Funke, Stefan
Mehlhorn, Kurt
2000Proceedings Article
Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
[Giakkoupis, George]
Sauerwald, Thomas
Sun, He
[Woelfel, Philipp]
[Dürr, Christoph]
[Wilke, Thomas]
2012Electronic Proceedings Article
Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160
[Chen, Danny Z.]
[Das, Gautam]
Smid, Michiel
1996Proceedings Article
Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194
Malamatos, Theocharis2005Electronic Proceedings Article
Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Malamatos, Theocharis2008Journal Article
Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465
Bradford, Phillip Gnassi
Reinert, Knut
[Meyer auf der Heide, Friedhelm]
[Monien, Burkhard]
1996Proceedings Article
Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
[Dietz, Paul]
Mehlhorn, Kurt
[Raman, Rajeev]
Uhrig, Christian
1995Journal Article
Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1993Proceedings Article
Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130
Bradford, Phillip Gnassi
[Choppela, Venkatesh]
[Rawlins, Gregory J.E.]
[Baeza-Yates, Ricardo]
[Goles, Eric]
[Poblete, Patricio V.]
1995Proceedings Article
Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Doerr, Benjamin
Kodric, Bojana
Voigt, Marco
2013Proceedings Article
Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Alt, Helmut
Mehlhorn, Kurt
Michaelson, S.
Milner, R.
1976Proceedings Article
Lower bounds on the efficiency of transforming static data structures into dynamic structuresMehlhorn, Kurt1980Report
Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
Mehlhorn, Kurt1981Journal Article
Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 124-133
Kontogiannis, Spyros2002Proceedings Article
Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Doerr, Benjamin2007Journal Article
LZ77-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
[Gagie, Travis]
Gawrychowski, Pawel
[Kärkkäinen, Juha]
[Nekrich, Yakov]
[Puglisi, Simon J.]
[Parso, Alberto]
[Viola, Alfredo]
2014Proceedings Article
Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Hagerup, Torben
Mehlhorn, Kurt
Munro, I.
Lingas, Andrzej
Karlsson, Rolf
Carlsson, Svante
1993Proceedings Article
Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian
1994Proceedings Article
Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Mehlhorn, Kurt
[Sundar, R.]
Uhrig, Christian
1997Journal Article
Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Katriel, Irit
[Michel, Laurent]
[Van Hentenryck, Pascal]
2005Journal Article
Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398
Lenhof, Hans-Peter
Smid, Michiel
[Nurmi, O.]
[Ukkonen, Esko]
1992Proceedings Article
Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Lenhof, Hans-Peter
Smid, Michiel
1995Journal Article
Makespan minimization in job shops: a polynomial time approximation scheme
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399
Solis-Oba, Roberto
[Jansen, Klaus]
[Sviridenko, Maxim]
1999Proceedings Article
Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Bast, Holger
Weber, Ingmar
[Gronau, Norbert]2007Proceedings Article
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251
Kumar, V. S. Anil
[Ramesh, Hariharan]
1999Proceedings Article
Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
[Diekert, Volker]
[Habib, Michel]
2004Proceedings Article
Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao]
2006Journal Article
Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408
Bradford, Phillip Gnassi
Fleischer, Rudolf
[Staples, John]
[Eades, Peter]
[Katoh, Naoki]
[Moffat, Alistair]
1995Proceedings Article
Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127
[Alon, Noga]
Bradford, Phillip Gnassi
Fleischer, Rudolf
1996Journal Article
Attachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Mehlhorn, Kurt[Dress, Andreas]
[Xu, Yinfeng]
[Zhu, Binhai]
2007Proceedings Article
Attachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
Doerr, Benjamin2007Journal Article
Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068
Doerr, Benjamin2005Proceedings Article
Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Doerr, Benjamin2006Journal Article
Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
[Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F.
1997Journal Article
Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
[Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F.
Feitelson, Dror G.
Rudolph, Larry
1997Proceedings Article
Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
2002Proceedings Article
Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
[Pemmaraju, Sriram V.]
Raman, Rajiv
[Varadarajan, Kasturi]
2011Journal Article
Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
[Kavitha, Telikepalli]
Mestre, Julian
[Dong, Yingfei]
[Du, Ding-Zhu]
[Ibarra, Oscar]
2009Proceedings Article
Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Kavitha, Telikepalli
[Mestre, Julián]
2012Journal Article
Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
[Kavitha, Telikepalli]
Mestre, Julian
2010Electronic Journal Article
Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
[Abramsky, Samson]
[Gavoille, Cyril]
[Kirchner, Claude]
[Meyer auf der Heide, Friedhelm]
[Spirakis, Paul G.]
2010Proceedings Article
Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
2011Journal Article
Max-Weighted-Matching auf allgemeinen Graphen
Universität des Saarlandes
Ziegler, Thomas1995Thesis - Masters thesis
Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
Panagiotou, Konstantinos
[Steger, Angelika]
2010Journal Article
Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Panagiotou, Konstantinos
[Steger, Angelika]
[Matthieu, Claire]2009Proceedings Article
Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
[Epstein, Leah]
van Stee, Rob
[Laber, Eduardo Sany]
[Bornstein, Claudson]
[Noguiera, Loana Tito]
[Faria, Luerbio]
2008Proceedings Article
Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
[Epstein, Leah]
van Stee, Rob
2010Journal Article
Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
[Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob
[Leonardi, Stefano]2009Proceedings Article
Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
[Chen, Xujin]
[Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob
2013Journal Article
Maximum Cardinality Matching
In: Archive of Formal Proofs,
Rizkallah, Christine2011Electronic Journal Article
Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
Althaus, Ernst
Mehlhorn, Kurt
1998Journal Article
Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
[Jünger, Michael]
Mutzel, Petra
1996Journal Article
Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
[Case, John]
Kötzing, Timo
[Schwentick, Thomas]
[Dürr, Christoph]
2011Electronic Proceedings Article
Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18
Christodoulou, George
[Koutsoupias, Elias]
[Kovács, Annamária]
2010Journal Article
Attachment IconMechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
Christodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária
[Arge, Lars]
[Cachin, Christian]
[Jurdzi´nski, Tomasz]
[Tarlecki, Andrzej]
2007Proceedings Article
Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
Christodoulou, George
[Koutsoupias, Elias]
2009Journal Article
Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Giesen, Joachim2007Proceedings Article
Attachment IconMedial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124
[Miklos, Balint]
Giesen, Joachim
[Pauly, Mark]
2007Proceedings Article
Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
[Anand, S.]
[Garg, Naveen]
Megow, Nicole
[Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiří]
2011Proceedings Article
Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeHarren, Rolf2007Book
Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319
[Asano, Tetsuo]
Doerr, Benjamin
2011Proceedings Article
Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
[Case, John]
Kötzing, Timo
2013Electronic Journal Article
Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Doerr, Benjamin
Winzen, Carola
2011Electronic Journal Article
Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
Doerr, Benjamin
Winzen, Carola
2012Journal Article
Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Sanders, PeterMeyer, Ulrich
Sanders, Peter
[Sibeyn, Jop F.]
2003Part of a Book
Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Chan, T-H. Hubert
[Dhamdhere, Kedar]
[Gupta, Anupam]
[Kleinberg, Jon]
[Slivkins, Aleksandrs]
2009Journal Article
Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Gawrychowski, Pawel
[Kucherov, Gregory]
[Nekrich, Yakov]
[Starikovskaya, Tatiana]
[Kurland, Oren]
[Lewenstein, Moshe]
[Porat, Ely]
2013Proceedings Article
Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
[Evans, Brian]
Schwarz, Christian
[Teich, Jürgen]
[Vainshtein, Alek]
[Welzl, Emo]
1995Proceedings Article
Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
[Giesen, Joachim]
Manjunath, Madhusudan
[Agarwal, Pankaj Kumar]
[Alt, Helmut]
[Teillaud, Monique]
2009Electronic Proceedings Article
Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Gasieniec, Leszek
[Kranakis, Evangelos]
[Krizanc, Danny]
[Pelc, Andrzej]
[Penczek, Wojciech]
[Szalas, Andrzej]
1996Proceedings Article
Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen]
2011Journal Article
Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24
Anand, S
Bringmann, Karl
[Friedrich, Tobias]
[Garg, Naveen]
[Kumar, Amit]
[Fomin, Fedor V.]
[Freivalds, Rūsiņš]
[Kwiatkowska, Marta]
[Peleg, David]
2013Proceedings Article
Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986
Albers, Susanne
Garg, Naveen
Leonardi, Stefano
2000Journal Article
Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462
Albers, Susanne
[Garg, Naveen]
[Leonardi, Stefano]
1998Proceedings Article
Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Subramanian, C. R.1999Journal Article
Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Fotakis, Dimitris
[Spirakis, Paul G.]
2002Journal Article
Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
[Fleischer, Lisa]
Skutella, Martin
2003Proceedings Article
Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Mehlhorn, KurtHealy, Patrick
Nikolo, Nikola S.
2005Proceedings Article
Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Mehlhorn, KurtKucera, Ludek
Kucera, Antonín
2007Proceedings Article
Attachment IconMinimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13
Mehlhorn, K.
Michail, D.
2009Electronic Journal Article
Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Michail, Dimitrios2006Thesis - PhD thesis
Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Aspnes, James]
[Scheideler, Christian]
[Arora, Anish]
[Madden, Samuel]
2007Proceedings Article
Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
[Fomin, Fedor V.]
Philip, Geevarghese
[Villanger, Yngve]
[Chakraborty, Supratik]
[Kumar, Amit]
2011Proceedings Article
Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
[Chin, Francis Y. L.]
[Guo, Zeyu]
Sun, He
2011Journal Article
Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
[Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror]
[de Berg, Mark]
[Meyer, Ulrich]
2010Proceedings Article
Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
[Bar-Yehuda, Reuven]
Hermelin, Danny
[Rawitz, Dror]
2011Journal Article
Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk]
2009Journal Article
Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Blum, Norbert
Mehlhorn, Kurt
Weihrauch, Klaus1979Proceedings Article
Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
[Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Marchetti-Spaccamela, Alberto]
[van der Ster, Suzanne]
[Stougie, Leen]
[Demetrescu, Camil]
[Halldórsson, Magnús M.]
2011Proceedings Article
Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282
Gergov, Jordan
[Meinel, Christoph]
1996Journal Article
Modeling 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
Elbassioni, Khaled
[Fouad, Mohamed]
[Bertino, Elisa]
2012Proceedings Article
Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233
[Neumann, Dirk]
Kohlbacher, Oliver
[Haltner, Eleonore]
Lenhof, Hans-Peter
[Lehr, Claus-Michael]
2000Proceedings Article
Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4Hemmer, Michael2009Manual
Attachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Emeliyanenko, Pavel[Hsu, Ching-Hsien]
[Yang, Laurence T.]
[Park, Jong Hyuk]
[Yeo, Sang-Soo]
2010Proceedings Article
Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
[Nor, Igor]
Hermelin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier Sagot, Marie-France]
[Amir, Amihood]
[Parida, Laxmi]
2010Proceedings Article
Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
[Nor, Igor]
Hermlin, Danny
[Charlat, Sylvain]
[Engelstadter, Jan]
[Reuter, Max]
[Duron, Olivier]
[Sagot, Marie-France]
2012Journal Article
Molekül-Docking-Reaktionen
Universität des Saarlandes
Hazboun, Jack1999Thesis - Masters thesis
Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Mehlhorn, Kurt
Galil, Zvi
1976Journal Article
Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319
Mehlhorn, Kurt
Galil, Zvi
Becvár, Jírí1975Proceedings Article
Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes
Denny, Markus1994Thesis - Masters thesis
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine]
[Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter]
2010Proceedings Article
More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Doerr, Benjamin
[Johannsen, Daniel]
Kötzing, Timo
[Neumann, Frank]
[Theile, Madeleine]
2013Journal Article
More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
[Dedorath, Jürgen]
Gergov, Jordan
Hagerup, Torben
[Staples, John]
[Eades, Peter]
[Katoh, Naoki]
[Moffat, Alistair]
1995Proceedings Article
More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400
Bradford, Phillip Gnassi
Fleischer, Rudolf
Smid, Michiel
1997Journal Article
More 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
[Diks, Krzysztof]
Hagerup, Torben
1996Proceedings Article
More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
[Diks, Krzysztof]
Hagerup, Torben
1998Journal Article
More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
[Epstein, Leah]
Imreh, Csanád
[van Stee, Rob]
[Diks, Krzysztof]
[Rytter, Wojciech]
2002Proceedings Article
Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Hert, Susan
Lumelsky, Vladimir
1999Journal Article
Multi-Attribute Profit-Maximizing PricingElbassioni, Khaled
[Chalermsook, Parinya]
[Nanongkai, Danupon]
Sun, He
2013Unpublished/Draft
Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Doerr, Benjamin
[Srivastav, Anand]
2001Journal Article
Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
Doerr, Benjamin2004Journal Article
Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
Doerr, Benjamin
[Srivastav, Anand]
2001Journal Article
Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98
[Diedrich, Florian]
[Kehden, Britta]
Neumann, Frank
[Berghammer, Rudolf]
[Möller, Bernhard]
[Struth, Georg]
2008Proceedings Article
Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
[Hall, Alex]
[Hippler, Steffen]
Skutella, Martin
[Baeten, Jos C.M.]
[Lenstra, Jan Karel]
[Parrow, Joachim]
[Woeginger, Gerhard J.]
2003Proceedings Article
Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Elbassioni, Khaled M.2006Journal Article
Multiconsistency 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
Elbassioni, Khaled M.
Katriel, Irit
[Barták, Roman]
[Milano, Michela]
2005Proceedings Article
Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingDe Sterck, Hans
[Henson, Van Emden]
[Sanders, Geoff]
2011Unpublished/Draft
Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
[Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao]
2009Journal Article
Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
[Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao]
[Azar, Yossi]
[Erlebach, Thomas]
2006Proceedings Article
Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
2008Journal Article
Attachment IconMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
Chang, Kevin2007Proceedings Article
Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Hert, Susan
[Richards, Brad]
[Christensen, Henrik]
[Hager, Greg]
2002Proceedings Article
Multiple Sequence Alignment
Universität des Saarlandes
Lermen, Martin1997Thesis - Masters thesis
Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics
In: Proceedings of the European Conference on Computational Biology (ECCB 2002), S4-S16
Althaus, Ernst
[Caprara, Alberto]
[Lenhof, Hans-Peter]
[Reinert, Knut]
Lengauer, Thomas2002Proceedings Article
Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
[Raidl, Günther]
[Rothlauf, Franz]
2009Proceedings Article
Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Doerr, Benjamin
[Johannsen, Daniel]
Winzen, Carola
2012Journal Article
Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
[Pelikan, Martin]
[Branke, Jürgen]
2010Proceedings Article
Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
[Larsson, Andreas]
Gidenstam, Anders
[Ha, Phuong H.]
[Papatriantafilou, Marina]
[Tsigas, Philippas]
2009Electronic Journal Article
Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine]
2013Journal Article
NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Gidenstam, Anders
[Papatriantafilou, Marina]
[Tsigas, Phillipas]
2009Electronic Journal Article
NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Gidenstam, Anders
[Papatriantafilou, Marina]
[Tsigas, Philippas]
2010Journal Article
Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
[Friedrich, Tobias]
[Sauerwald, Thomas]
2009Proceedings Article
Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Huang, Chien-Chung
[Kavitha, Telikepalli]
2011Proceedings Article
Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Hagedoorn, Michiel[Calvanese, Diego]
[Lenzerini, Maurizio]
[Motwani, Rajeev]
2003Proceedings Article
Attachment IconNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
Mehlhorn, Kurt1975Journal Article
Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Kelsen, PierreKarlsson, Rolf
Lingas, Andrzej
1996Proceedings Article
Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsMehlhorn, Kurt
Michail, Dimitrios
2005Unpublished/Draft
Network 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
Funke, Stefan
[Milosavljevic, Nikola]
2007Proceedings Article
New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
Weiskircher, Rene2002Thesis - PhD thesis
New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
[Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
2011Journal Article
Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
[Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
[Thomas, Wolfgang]
[Weil, Pascal]
2007Proceedings Article
New Bounds for the Descartes Method[Krandick, Werner]
Mehlhorn, Kurt
2004Report
Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
[Krandick, Werner]
Mehlhorn, Kurt
2006Journal Article
Attachment 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
Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth
2005Proceedings Article
New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191
Lenhof, Hans-Peter1997Proceedings Article
New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Pyrga, Evangelia
[Ray, Saurabh]
2008Proceedings Article
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Cole, Richard
Kowalik, Lukasz
2008Journal Article
New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96
Albers, Susanne
[Koga, Hisashi]
1998Journal Article
New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
Wahlström, Magnus[Frid, Anna]
[Morozov, Andrey]
[Rybalchenko, Andrey]
[Wagner, Klaus W.]
2009Proceedings Article
New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Wahlström, Magnus2011Journal Article
New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Kapoor, Sanjiv
Smid, Michiel
1996Journal Article
Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35
[Chan, Sze-Hang]
[Lam, Tak-Wah]
Lee, Lap-Kei
[de Berg, Mark]
[Meyer, Ulrich]
2010Proceedings Article
Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Doerr, Benjamin
[Johannsen, Daniel]
Winzen, Carola
2012Journal Article
Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Doerr, Benjamin2006Journal Article
Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99
Doerr, Benjamin2006Journal Article
Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407
[Beldiceanu, Nicolas]
[Guo, Qi]
Thiel, Sven
[Walsh, Toby]2001Proceedings Article
Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Kesselman, Alexander
[Kogan, Kirill]
2005Proceedings Article
Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Huang, Chien-Chung[Fomin, Fedor V.]
[Kaski, Petteri]
2012Proceedings Article
Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
[Chan, Ho-Leung]
[Edmonds, Jeff]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Marchetti-Spaccamela, Alberto]
[Pruhs, Kirk]
2011Journal Article
Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264
Chan, Ho-Leung
[Edmonds, Jeff]
[Lam, Tak-Wah]
[Lee, Lap-Kei]
[Marchetti-Spaccamela, Alberto]
[Pruhs, Kirk]
[Albers, Susanne]
[Marion, Jean-Yves]
2009Electronic Proceedings Article
Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Kollias, Konstantinos2013Electronic Journal Article
NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
Naujoks, Rouven2008Thesis - PhD thesis
Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Hemmer, Michael
[Hert, Susan]
[Kettner, Lutz]
[Pion, Sylvain]
[Schirra, Stefan]
2007Manual
Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes
Buchheit, Thomas1999Thesis - Masters thesis
Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes
Fink, Christian2001Thesis - Masters thesis
Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Meyer, Ulrich
[Sibeyn, Jop F.]
2002Journal Article
On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
[Djidjev, Hristo N.]
[Pantziou, Grammati E.]
Zaroliagis, Christos
[Mayr, Ernst W.]
[Puech, Claude]
1995Proceedings Article
On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Grove, Edward1995Proceedings Article
On a cone covering problem
In: Computational Geometry [44], 129-134
Elbassioni, Khaled
[Tiwary, Hans Raj]
2011Journal Article
On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Elbassioni, Khaled
[Tiwary, Hans Raj]
2008Proceedings Article
On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Kavitha, Telikepalli2008Proceedings Article
Attachment IconOn Algorithms for Online Topological Ordering and SortingKatriel, Irit2004Report
On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Elbassioni, Khaled M.
[Fishkin, Aleksei V.]
Sitters, Rene
[Asano, Tetsuo]2006Proceedings Article
On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
[Gugelmann, Luca]
Spöhel, Reto
[Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila]
2011Electronic Proceedings Article
On Batcher's Merge Sorts as Parallel Sorting Algorithms
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420
Rüb, Christine[Morvan, Michel]
[Meinel, Christoph]
[Krob, Daniel]
1998Proceedings Article
On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59
[Boros, Endre]
Elbassioni, Khaled
[Makino, Kazuhisa]
2008Proceedings Article
Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Mehlhorn, Kurt
Schmidt, Bernd H.
1986Journal Article
On BF-perfect graphsMehlhorn, Kurt
Schmidt, Bernd H.
1985Report
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj]
[Dehne, Frank]
[Sack, Joerg-Ruediger]
[Zeh, Norbert]
2007Proceedings Article
On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Elbassioni, Khaled
[Tiwary, Hans Raj]
2008Journal Article
On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235
Crauser, Andreas
[Ferragina, Paolo]
[Nesetril, Jaroslav]1999Proceedings Article
Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
1988Proceedings Article
On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark
Noltemeier, Hartmut1988Proceedings Article
Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
1994Proceedings Article
On 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
Albers, Susanne
[Charikar, Moses]
[Mitzenmacher, Michael]
1998Proceedings Article
Attachment IconOn Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
Elbassioni, Khaled M.Alt, Helmut
Ferreira, Afonso
2002Proceedings Article
On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560
[Meyer, Ulrich][Albers, Susanne]
[Weil, Pascal]
[Rochange, Christine]
2008Proceedings Article
On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2010Journal Article
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
2008Journal Article
On Enumerating Minimal Transversals of Geometric HypergraphsElbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh
??Unpublished/Draft
On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
[Höhn, Wiebke]
[Jacobs, Tobias]
Megow, Nicole
2012Journal Article
On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
[Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert]
2003Journal Article
On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
[Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Zeh, Norbert]
Dehne, Frank
Sack, Jörg-Rüdiger
[Tamassia, R.]
2001Proceedings Article
Attachment IconOn filter methods in CGAL's 2D curved kernelKerber, Michael2008Report
Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2001Proceedings Article
On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52
Banderier, Cyril1999Proceedings Article
On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten]
2007Proceedings Article
On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Nutov, Zeev
[Penn, Michael]
2000Journal Article
On Local Routing of Two-Terminal NetsKaufmann, Michael
Mehlhorn, Kurt
1986Report
Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Kaufmann, Michael
Mehlhorn, Kurt
1992Journal Article
On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Kaufmann, Michael
Mehlhorn, Kurt
[Brandenburg, Franz J.]
[Vidal-Naquet, Guy]
[Wirsing, Martin]
1987Proceedings Article
On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Kapoor, SanjivCunningham, William H.
McCormick, Thomas S.
Queyranne, Maurice
1996Proceedings Article
Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Eigenwillig, Arno2007Journal Article
On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2012Journal Article
On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2010Unpublished/Draft
On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30
Mehlhorn, KurtCourcelle , Bruno1984Proceedings Article
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Fu, Bin]
[Du, Ding-Zhu]
2011Proceedings Article
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
2012Journal Article
Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
El Kahoui, M'hammed2002Journal Article
On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
[Cygan, Marek]
[Dell, Holger]
[Lokshtanov, Daniel]
[Marx, Daniel]
[Nederlof, Jesper]
[Okamoto, Yoshio]
[Paturi, Ramamohan]
[Saurabh, Saket]
Wahlström, Magnus
2012Proceedings Article
Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
[Sitters, Rene]
[Mavronicolas, Marios]
[Papadopoulou, Vicky G.]
2009Proceedings Article
Attachment IconOn Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92
[Andreou, Maria]
Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.]
[Diks, Krzysztof]
[Rytter, Wojciech]
2002Proceedings Article
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
Du, Ding-Zhu
Zhang, Guochuan
2013Proceedings Article
On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
Ramos, Edgar A.1999Proceedings Article
On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
[Gurvich, Vladimir]1977Journal Article
On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Bast, Hannah2000Journal Article
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui]
2008Journal Article
On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Telikepalli, Kavitha
[Varadarajan, Kasturi]
[McAllister, Michael]2003Proceedings Article
On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1990Proceedings Article
On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
Polzin, Tobias
[Vahdati Daneshmand, Siavash]
2003Journal Article
On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Katriel, Irit2004Journal Article
On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220
Mehlhorn, Kurt
Priebe, Volker
1997Journal Article
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Mehlhorn, Kurt
Priebe, Volker
[Spirakis, Paul]1995Proceedings Article
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Elbassioni, Khaled
Raman, Rajiv
[Ray, Saurabh]
[Sitters, Rene]
[Matthieu, Claire]2009Proceedings Article
On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
[Canzar, Stefan]
Elbassioni, Khaled
[Elmasry, Amr]
[Raman, Rajiv]
[Cheong, Otfried]
[Chwa, Kyung-Yong]
[Park, Kunsoo]
2010Proceedings Article
On the Average Number of Rebalancing Operations in Weight-Balanced TreesBlum, Norbert
Mehlhorn, Kurt
1978Report
Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Blum, Norbert
Mehlhorn, Kurt
1980Journal Article
On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Rüb, Christine1997Journal Article
On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Rüb, ChristineMayr, Ernst W.
Puech, Claude
1995Proceedings Article
On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Fleischer, Rudolf[Hsu, Wen-Lian]
Kao, Ming-Yang
1998Proceedings Article
On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Csaba, Bela2007Journal Article
Attachment IconOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
Fotakis, Dimitris[Baeten, Jos C.M.]
[Lenstra, Jan Karel]
[Parrow, Joachim]
[Woeginger, Gerhard J.]
2003Proceedings Article
On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246
[Bachrach, Ran]
[El-Yaniv, Ran]
Reinstädtler, Martin
2002Journal Article
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12
Angelopoulos, Spyros[Bampis, Evripidis]
[Jansen, Klaus]
2010Proceedings Article
On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548
Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika
1989Proceedings Article
On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika
1990Journal Article
On 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
[Das, Gautam]
[Kapoor, Sanjiv]
Smid, Michiel
Chandru, V.
Vinay, V.
1997Journal Article
On 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
[Das, Gautam]
[Kapoor, Sanjiv]
Smid, Michiel
[Chandru, V.]
[Vinay, V.]
1996Proceedings Article
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198
[Tiwary, Hans Raj]
Elbassioni, Khaled
2008Proceedings Article
On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
Gasieniec, Leszek
[Jansson, Jesper]
[Lingas, Andrzej]
[Östlin, Anna]
[Jiang, Tao]
[Lee, D. T.]
1997Proceedings Article
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
[Fredman, Michael]
[Khachiyan, Leonid]
1996Journal Article
On the Complexity of Monotone Boolean Duality TestingElbassioni, Khaled M.2006Report
On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Elbassioni, Khaled2008Journal Article
On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Hoefer, Martin
[Skopalik, Alexander]
2013Journal Article
On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Alt, Helmut
Mehlhorn, Kurt
Munro, J.
1984Journal Article
On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Sagraloff, Michael2010Electronic Journal Article
Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Kerber, Michael[Gerdt, Vladimir]
[Mayr, Ernst]
[Vorozhtsov, Evgenii]
2009Proceedings Article
On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Emeliyanenko, Pavel
Sagraloff, Michael
[van der Hoeven, Joris]
[van Hoeij, Mark]
2012Proceedings Article
On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2005Journal Article
On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Elbassioni, Khaled
[Raman, Rajiv]
Ray, Saurabh
[Sitters, René]
2012Journal Article
On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Elbassioni, Khaled M.[Azar, Yossi]
[Erlebach, Thomas]
2006Proceedings Article
On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Lengauer, Thomas
Mehlhorn, Kurt
1981Journal Article
On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
[Akl, Selim G.]
[Dehne, Frank]
[Sack, Jörg-Rüdiger]
[Santoro, Nicola]
1995Proceedings Article
Attachment IconOn the construction of abstract Voronoi diagramsMehlhorn, Kurt
Meiser, Stefan
O'Dunlaing, Colm
1989Report
On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Mehlhorn, Kurt
Meiser, Stefan
O'Dúnlaing, Colm
1991Journal Article
On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239
Mehlhorn, Kurt
Meiser, Stefan
Ó'Dúnlaing, Colm
Choffrut, Christian
Lengauer, Thomas
1990Proceedings Article
On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
Asano, Tetsuo
Ibaraki, Toshihide
Imai, Hiroshi
Nishizeki, Takao
1990Proceedings Article
Attachment IconOn the construction of abstract Voronoi diagrams, II.[Klein, R.]
Mehlhorn, Kurt
[Meiser, Stefan]
1989Report
On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210
Panagiotou, Konstantinos
[Steger, Angelika]
[Randall, Dana]2011Proceedings Article
On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
2000Journal Article
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
2007Journal Article
On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
[Brockhoff, Dimo]
[Friedrich, Tobias]
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart]
2009Journal Article
Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Mehlhorn, Kurt
Mutzel, Petra
1996Journal Article
On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
[Seidel, Raimund]
Wolpert, Nicola
Mitchell, Joseph S. B.
Rote, Günter
2005Proceedings Article
On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
1999Journal Article
Attachment IconOn the Hadwiger's Conjecture for Graph ProductsChandran, L. Sunil
Sivadasan, Naveen
2004Report
On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573
[Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.]
2006Proceedings Article
On the Influence of Lookahead in Competitive Paging Algorithms
In: Algorithmica [18], 283-305
Albers, Susanne1997Journal Article
On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2013Journal Article
On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
[Qian, Jiawei]
[Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke
[Fernández-Baca, David]2012Proceedings Article
On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
Mehlhorn, Kurt
Tsagarakis, M.
1979Journal Article
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
[Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.]
[Raman, Venkatesh]
[Saurabh, Saket]
2010Proceedings Article
On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281
Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola]
[Gudmundsson, Joachim]2008Proceedings Article
On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208
Dumitriu, Daniel
[Funke, Stefan]
Kutz, Martin
[Milosavljevic, Nikola]
[Petitjean, Sylvain]2008Proceedings Article
On 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
[Althaus, Ernst]
Kupilas, Joschka
Naujoks, Rouven
[Ogihara, Mitsunori]
[Tarui, Jun]
2011Proceedings Article
On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
[Bodlaender, Hans L.]
[Feremans, Corinne]
[Grigoriev, Alexander]
[Penninkx, Eelko]
Sitters, Rene
[Wolle, Thomas]
[Erlebach, Thomas]
[Kaklamanis, Christos]
2006Proceedings Article
On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
[Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand]
2007Journal Article
Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
[Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand]
[Erlebach, Thomas]
[Persiano, Pino]
2005Proceedings Article
Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
[Epstein, Leah]
van Stee, Rob
2010Journal Article
On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
[Epstein, Leah]
van Stee, Rob
2011Journal Article
Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
[Epstein, Leah]
van Stee, Rob
[Kaklamanis, Christos]
[Skutella, Martin]
2008Proceedings Article
On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Chaudhuri, Shiva
Dimopoulos, Yannis
Zaroliagis, Christos
1996Journal Article
On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33
[Mütze, Torsten]
Spöhel, Reto
2011Electronic Journal Article
On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
[Mütze, Torsten]
Spöhel, Reto
[Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila]
2011Electronic Proceedings Article
Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
Christodoulou, George
[Chung, Christine]
[Ligett, Katrina]
Pyrga, Evangelia
van Stee, Rob
[Bampis, Evripidis]
[Jansen, Klaus]
2010Proceedings Article
Attachment IconOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
Mehlhorn, Kurt1982Proceedings Article
Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
[Ngo, Hung Q.]2009Proceedings Article
On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
2011Journal Article
On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
[Epstein, Leah]
Kesselman, Alexander
2006Journal Article
On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes
Parreira, Josiane2003Thesis - Masters thesis
On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Doerr, Benjamin
Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten]
[Thierens, Dirk]2007Proceedings Article
On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237
Angelopoulos, Spyros
[Dorrigiv, Reza]
[López-Ortiz, Alejandro]
2007Proceedings Article
On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
[Dinitz, Yefim]
Garg, Naveen
[Goemans, Michel X.]
1999Journal Article
Attachment IconOn the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196
Mehlhorn, Kurt1973Proceedings Article
On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22
Mehlhorn, Kurt1973Report
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
[Kayal, Neeraj]
Saha, Chandan
2011Proceedings Article
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
[Kayal, Neeraj]
Saha, Chandan
2012Journal Article
On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
[Bartal, Yair]
[Leonardi, Stefano]
[Shallom, Gill]
Sitters, Rene
[Diaz, Josep]
[Jansen, Klaus]
[Rolim, José D. P.]
[Zwick, Uri]
2006Proceedings Article
On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
[Janardan, Ravi]
Smid, Michiel
1995Proceedings Article
Attachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Behle, Markus[Dress, Andreas]
[Xu, Yinfeng]
[Zhu, Binhai]
2007Proceedings Article
On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy
[Meyer, Ulrich]2008Proceedings Article
On Tree-Constrained Matchings and Generalizations[Canzar, Stefan]
Elbassioni, Khaled
[Klau, Gunnar W.]
[Mestre, Julian]
2011Unpublished/Draft
On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
[Canzar,Stefan]
Elbassioni, Khaled
[Klau, Gunnar W.]
[Mestre, Julian]
[Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiri]
2011Proceedings Article
One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234
Burkhardt, Stefan
Kärkkäinen, Juha
Apostolico, Alberto
[Takeda, Masayuki]
2002Proceedings Article
Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Jez, Artur[Fomin, Fedor V.]
[Freivalds, Rusins]
[Kwiatkowska, Marta Z.]
[Peleg, David]
2013Proceedings Article
Online-Algorithmen
Universität des Saarlandes
Albers, Susanne1999Thesis - Habilitation thesis
Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Chang, Kevin
[Johnson, Aaron]
2008Proceedings Article
Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
[Fanghänel, Alexander]
[Geulen, Sascha]
Hoefer, Martin
[Vöcking, Berthold]
2013Journal Article
Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266
Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
[Sliacan, Jakub]
[Fomin, Fedor V.]
[Freivalds, Rūsiņš]
[Kwiatkowska, Marta]
[Peleg, David]
2013Proceedings Article
Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
[Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiří]
2011Proceedings Article
Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Megow, Nicole
Mehlhorn, Kurt
[Schweitzer, Pascal]
2012Journal Article
Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
[Krumke, Sven]
van Stee, Rob
[Westphal, Stefan]
[Ravi, S.S.]
[Shukla, Sandeep K.]
2009Part of a Book
Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott]
[Akl, Selim G.]
[Dehne, Frank]
[Sack, Jörg-Rüdiger]
[Santoro, Nicola]
1995Proceedings Article
Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
Angelopoulos, Spyros[Dehne, Frank]
[Gavrilova, Marina]
[Sack, Jörg-Rüdiger]
[Tóth, Csaba D.]
2009Proceedings Article
Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Sivadasan, Naveen2004Thesis - PhD thesis
Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Seiden, Steve S.2000Journal Article
Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
[Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob
[Gupta, Anupam]
[Jansen, Klaus]
[Rolim, José]
[Servedio, Rocco]
2012Proceedings Article
Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Fleischer, Rudolf
Wahl, Michaela
[Paterson, Mike]2000Proceedings Article
Attachment IconOnline Scheduling with Bounded MigrationSivadasan, Naveen
Sanders, Peter
Skutella, Martin
2004Report
Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
[Díaz, Josep]
[Karhumäki, Juhani]
[Lepistö, Arto]
[Sannella, Donald]
2004Proceedings Article
Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
[Sanders, Peter]
Sivadasan, Naveen
[Skutella, Martin]
2009Journal Article
Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Katriel, Irit
[Bodlaender, Hans L.]
2005Proceedings Article
Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
[Epstein, Leah]
[Levin, Asaf]
van Stee, Rob
2008Journal Article
Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319
Klau, Gunnar W.
Mutzel, Petra
[Cornuéjols, Gérard]
[Burkard, Rainer E.]
[Woeginger, Gerhard J.]
1999Proceedings Article
Optimal dynamization of decomposable searching problemsMehlhorn, Kurt
Overmars, Mark H.
1980Report
Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Mehlhorn, Kurt
Overmars, Mark H.
1981Journal Article
Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Lee, Jae-Ha
[Shin, Chan-Su]
[Chwa, Kyung-Yong]
2000Journal Article
Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
[Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.]
[Wong, Ka Chun]
2007Journal Article
Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10
[Böttcher, Süntje]
Doerr, Benjamin
Neumann, Frank
[Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter]
2010Proceedings Article
Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350
Klau, Gunnar W.
Mutzel, Petra
[Du, D.-Z.]
[Eades, P.]
[Estivill-Castro, V.]
[Lin, X.]
[Sharma, A.]
2000Proceedings Article
Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Ferragina, Paolo
[Gross, Roberto]
1998Journal Article
Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44
Breslauer, Dany
Ramesh, Hariharan
1996Journal Article
Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Chaudhuri, Shiva
Zaroliagis, Christos
[Spirakis, Paul]1995Proceedings Article
Optimal Popular MatchingsKavitha, Telikepalli
[Nasre, Meghana]
2008Miscellaneous
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303
Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
2002Journal Article
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54
Bradford, Phillip Gnassi
[Golin, Mordecai J.]
[Larmore, Lawrence L.]
[Rytter, Wojciech]
[Bilardi, Gianfranco]
Italiano, Giuseppe F.
Pietracaprina, Andrea
Pucci, Geppino
1998Proceedings Article
Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Angelopoulos, Spyros
[Lopez-Ortiz, Alejandro]
[Hamel,Angele]
2008Proceedings Article
Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
[Kwek, St.]
Mehlhorn, Kurt
2003Journal Article
Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691
[Aronov, Boris]
[Asano, Tetsuo]
Funke, Stefan
[Tokuyama, Takeshi]2007Proceedings Article
Attachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
Reichel, Joachim2001Thesis - Masters thesis
Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37
[Mainberger, Markus]
[Hoffmann, Sebastian]
[Weickert, Joachim]
Tang, Ching Hoo
[Johannsen, Daniel]
[Neumann, Frank]
Doerr, Benjamin
[Bruckstein, Alfred M.]
[ter Haar Romeny, Bart M.]
[Bronstein, Alexander M.]
[Bronstein, Michael M.]
2011Proceedings Article
Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Hermelin, Danny
[Mestre, Julian]
[Rawitz, Dror]
[Golumbic, Martin Charles]
[Stern, Michal]
[Levy, Avivit]
[Morgenstern, Gila]
2012Proceedings Article
Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
[Butman, Ayelet]
Hermelin, Danny
[Lewenstein, Moshe]
[Rawitz, Dror]
2010Journal Article
Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Hermelin, Danny
[Rawitz, Dror]
2011Journal Article
Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201
Berman, Piotr
Krysta, Piotr
2003Proceedings Article
Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine]
[Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter]
2010Proceedings Article
Optimizing Over All Combinatorial Embeddings of a Planar Graph
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376
Mutzel, Petra
Weiskircher, René
[Cornuéjols, Gérard]
[Burkard, Rainer E.]
[Woeginger, Gerhard J.]
1999Proceedings Article
Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
[Froyland, Gary]
[Koch, Thorsten]
Megow, Nicole
[Duane, Emily]
[Wren, Howard]
2008Journal Article
Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Wagner, Markus
[Veeramachaneni, Kalyan]
[Neumann, Frank]
[O'Reilly, Una-May]
2011Proceedings Article
Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Gawrychowski, Pawel
[Uznanski, Przemyslaw]
[Kulikov, Alexander S.]
[Kuznetsov, Sergei O.]
[Pevzner, Pavel A.]
2014Proceedings Article
Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
[Abramsky, Samson]
[Gavoille, Cyril]
[Kirchner, Claude]
[Meyer auf der Heide, Friedhelm]
[Spirakis, Paul G.]
2010Proceedings Article
Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
[Eiglsperger, Markus]
Fekete, Sandor P.
Klau, Gunnar W.
[Kaufmann, Michael]
[Wagner, Dorothea]
2001Part of a Book
Output-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
Elmasry, Amr
Elbassioni, Khaled M.
2005Electronic Proceedings Article
Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran
[Fiat, Amos]
[Sanders, Peter]
2009Proceedings Article
Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
Bast, Holger
[Mortensen, Christian Worm]
Weber, Ingmar
[Crestani, Fabio]
[Ferragina, Paolo]
[Sanderson, Mark]
2006Proceedings Article
PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
Kötzing, Timo
[Neumann, Frank]
Spöhel, Reto
[Krasnogor, Natalio]
[Lanzi, Pier Luca]
2011Proceedings Article
Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Kesselman, Alexander
[Guez, Dan]
[Rosen, Adi]
2004Proceedings Article
Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Sibeyn, Jop F.
[Grammatikakis, M.D.]
[Hsu, D.F.]
[Kraetzl, M.]
1998Journal Article
Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
van Stee, Rob[Kao, Ming-Yang]2008Part of a Book
Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
2007Journal Article
Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
[Schömer, Elmar]
[Di Battista, Giuseppe]
[Zwick, Uri]
2003Proceedings Article
Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar]
[Spencer, Stephen N.]2005Proceedings Article
Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Karrenbauer, Andreas2004Thesis - other
Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Harren, Rolf
van Stee, Rob
[Gudmundsson, Joachim]2008Proceedings Article
Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158
Albers, Susanne
[Koga, Hisashi]
[Akl, Selim G.]
[Dehne, Frank]
[Sack, Jörg-Rüdiger]
[Santoro, Nicola]
1995Proceedings Article
Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Albers, Susanne
[Arora, Sanjeev]
[Khanna, Sanjeev]
1999Proceedings Article
Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
van Stee, Rob[Kao, Ming-Yang]2008Part of a Book
Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145
Angelopoulos, Spyros
Schweitzer, Pascal
[Mathieu, Claire]2009Proceedings Article
Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
[Epstein, Leah]
van Stee, Rob
[Tamir, Tami]
2009Journal Article
Attachment IconPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
Elmasry, Amr[Matthieu, Claire]2009Proceedings Article
Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Elmasry, Amr2010Journal Article
Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Preetham, A. J.
[Krithivasan, Kamala]
[Rangan, C. Pandu]
Sibeyn, Jop F.
1996Proceedings Article
Parallel algorithms and architectures (WPAA-87) : international workshopAlbrecht, Andreas
Jung, Hermann
Mehlhorn, Kurt
1987Proceedings
Parallel algorithms and architectures : International WorkshopAlbrecht, Andreas
Jung, Hermann
Mehlhorn, Kurt
1987Proceedings
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesJung, Hermann
Mehlhorn, Kurt
1987Report
Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Jung, Hermann
Mehlhorn, Kurt
1988Journal Article
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
[Bodlaender, Hans L.]
Hagerup, Torben
[Fülöp, Zoltán]
[Gecseg, Ferenc]
1995Proceedings Article
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
[Bodlaender, Hans L.]
Hagerup, Torben
1998Journal Article
Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
[Chlebus, Bogdan S.]
[Czumaj, Artur]
Gasieniec, Leszek
[Kowaluk, Miroslaw]
[Plandowski, Wojciech]
[Penczek, Wojciech]
[Szalas, Andrzej]
1996Proceedings Article
Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460
Lambert, Oliver
Sibeyn, Jop F.
[Zheng, S. Q.]1999Proceedings Article
Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
[Alefragis, Panayiotis]
[Goumopoulos, Christos]
Sanders, Peter
[Takkula, Tuomo]
[Wedelin, Dag]
[Pritchard, David]
[Reeve, Jeff]
1998Proceedings Article
Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Proceedings Article
Parallel molecular dynamics simulations for synthetic polymers
Universität des Saarlandes
Müller, Peter1999Thesis - PhD thesis
Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Hagerup, Torben2000Journal Article
Parallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48
Lenhof, Hans-Peter[Plesser, Theo]
[Wittenberg, Peter]
1997Part of a Book
Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Meyer, Ulrich
Sanders, Peter
[Bode, Arndt]
[Ludwig, Thomas]
[Karl, Wolfgang]
[Wismüller, Roland]
2000Proceedings Article
Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes
Potikoglou, Ioannis1999Thesis - Masters thesis
Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes
Margewitsch, Erwin1997Thesis - Masters thesis
Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes
Piskorski, Jakub1994Thesis - Masters thesis
Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes
Lambert, Oliver2000Thesis - Masters thesis
Paralleles List Ranking
Universität des Saarlandes
Seidel, Tillmann1997Thesis - Masters thesis
Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582
Bringmann, Karl
[Friedrich, Tobias]
2013Proceedings Article
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500
Kratsch, Stefan
[Marx, Dániel]
Wahlström, Magnus
[Hlinený, Petr]
[Kucera, Antonín]
2010Proceedings Article
Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Epstein, Leah]
[Ferragina, Paolo]
2012Proceedings Article
Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Hermelin, Danny
[Huang, Chien-Chung]
[Kratsch, Stefan]
Wahlström, Magnus
[Kolman, Petr]
[Kratochvíl, Jan]
2011Proceedings Article
Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
[Epstein, Leah]
[Kleiman, Elena]
Mestre, Julian
[Leonardi, Stefano]2009Proceedings Article
Attachment IconPareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15
Abraham, David
[Cechlárová, Katarina]
[Manlove, David F.]
Mehlhorn, Kurt
[Fleischer, Rudolf]
[Trippen, G.]
2004Proceedings Article
Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
[Abraham, David J.]
[Cechlárová, Katarína]
[Manlove, David]
Mehlhorn, Kurt
[Deng, Xiaotie]
Du, Dingzhu
2005Proceedings Article
Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
Mehlhorn, Kurt1979Journal Article
Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Doerr, Benjamin2007Journal Article
Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1984Journal Article
Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
Gruska, Jozef
Chytil, Michal
1981Proceedings Article
Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
[Helwig, Sabine]
Neumann, Frank
[Wanka, Rolf]
[Bouchachia, Abdelhamid]
[Nedjah, Nadia]
[de Macedo Mourelle, Luiza]
[Pedrycz, Witold]
2009Proceedings Article
Attachment IconPattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
[Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese
[Murlak, Filip]
[Sankowski, Piotr]
2011Proceedings Article
Attachment IconPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
Mehlhorn, KurtBakker de, Jacobus W.
van Leeuwen, Jan
1980Proceedings Article
Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
[Fountoulakis, Nikolaos]2007Journal Article
Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thiel, Sven1999Thesis - Masters thesis
Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish]
2012Journal Article
Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Bonifaci, Vincenzo
Mehlhorn, Kurt
[Varma, Girish]
[Ravani, Yuval]2012Proceedings Article
Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
[Jünger, Michael]
[Leipert, Sebastian]
Mutzel, Petra
Di Battista, Giuseppe1997Proceedings Article
Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402
Banderier, Cyril2000Proceedings Article
Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
Seel, Michael2001Thesis - PhD thesis
Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
Gutwenger, Carsten
Mutzel, Petra
[Whitesides, Sue H.]1998Proceedings Article
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528
Arikati, Srinivasa Rao
[Chen, Danny Z.]
[Chew, L. Paul]
[Das, Gautam]
[Smid, Michiel]
Zaroliagis, Christos
[Diaz, Josep]
[Serna, Maria]
1996Proceedings Article
Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Proceedings Article
Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank
2010Journal Article
Attachment IconPlattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI)
Universität des Saarlandes
Clanget, Ulrich1999Thesis - Masters thesis
Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Doerr, Benjamin
Winzen, Carola
[Dürr, Christoph]
[Wilke, Thomas]
2012Electronic Proceedings Article
Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Doerr, Benjamin
Winzen, Carola
2012Electronic Journal Article
Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
[Doerr, Benjamin]
[Doerr, Carola]
[Spöhel, Reto]
[Thomas, Henning]
2013Electronic Journal Article
Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
Doerr, Benjamin
Spöhel, Reto
[Thomas, Henning]
Winzen, Carola
2013Proceedings Article
Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Doerr, Benjamin
Spöhel, Reto
[Thomas, Henning]
Winzen, Carola
2012Proceedings Article
Attachment 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
Althaus, Ernst
Eisenbrand, Friedrich
Funke, Stefan
Mehlhorn, Kurt
2004Proceedings Article
Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
[Vahrenhold, Jan]2010Electronic Proceedings Article
Polygontriangulierung in Linearzeit
Universität des Saarlandes
Ruppert, Barbara1999Thesis - Masters thesis
Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
[Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi]
[Fleischer, Rudolf]
[Trippen, Gerhard]
2004Proceedings Article
Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
[Aronov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi]
2006Journal Article
Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Elbassioni, Khaled
[Rauf, Imran]
2010Journal Article
Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryElbassioni, Khaled
Rauf, Imran
2010Unpublished/Draft
Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
[Bonifaci, Vincenzo]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
Wiese, Andreas
2013Proceedings Article
Attachment IconPolynomial and abstract subrecursive classes
Cornell University
Mehlhorn, Kurt1974Thesis - PhD thesis
Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14
Mehlhorn, Kurt1974Report
Attachment IconPolynomial and Abstract Subrecursive Classes
In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109
In: Informatik Spektrum, 96-109
Mehlhorn, Kurt1974Proceedings Article
Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
Mehlhorn, Kurt1976Journal Article
Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Kowalski, Dariusz
[Pelc, Andrzej]
[Fleischer, Rudolf]
[Trippen, Gerhard]
2004Proceedings Article
Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612
Kratsch, Stefan[Albers, Susanne]
[Marion, Jean-Yves]
2009Electronic Proceedings Article
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
2012Journal Article
Attachment IconPolynomial parametrization of nonsingular algebraic curvesEl Kahoui, M'hammed2008Miscellaneous
Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
Sanders, Peter
[Egner, Sebastian]
[Tolhuizen, Ludo]
2003Proceedings Article
Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Kovács, Annamária[Caires, Luis]
[Italiano, Giuseppe F.]
[Monteiro, Luís]
[Palamidessi, Catuscia]
[Yung, Moti]
2005Proceedings Article
Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4Hemmer, Michael2009Manual
Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
Abraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha
2005Proceedings Article
Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
[Abraham, David J.]
[Irving, Robert W.]
[Kavitha, Telikepalli]
Mehlhorn, Kurt
2007Journal Article
Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Huang, Chien-Chung
[Kavitha, Telikepalli]
2011Proceedings Article
Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
[Kavitha, T.]
Mestre, Julián
[Nasre, M.]
[Albers, Susanne]
[Marchetti-Spaccamela, Alberto]
[Matias, Yossi]
[Nikoletseas, Sotiris]
[Thomas, Wolfgang]
2009Proceedings Article
Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
[Kavitha, Telikepalli]
Mestre, Julian
[Nasre, Meghana]
2011Journal Article
Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
van Zuylen, Anke
[Schalekamp, Frans]
[Williamson, David P.]
[Adacher, Ludovica]
[Flamini, Marta]
[Leo, Gianmaria]
[Nicosia, Gaia]
[Pacifici, Andrea]
[Piccialli, Veronica]
2011Electronic Proceedings Article
Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52
Mehlhorn, KurtLin, Ming C.
Manocha, Dinesh
1996Proceedings Article
Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
Sibeyn, Jop F.[Gavoille, Cyril]
[Bermond, Jean-Claude]
[Raspaud, André]
1999Proceedings Article
Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi]
2006Miscellaneous
Power 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
[Funke, Stefan]
[Laue, Soeren]
[Lotker, Zvi]
Naujoks, Rouven
2011Journal Article
Power 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
Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi]
[Sotiris E. Nikoletseas]
[Bogdan S. Chlebus]
[David B. Johnson]
[Bhaskar Krishnamachari]
2008Proceedings Article
Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Althaus, Ernst
[Calinescu, Gruia]
[Mandoiu, Ion]
[Prasad, Sushil]
[Tchervenski, Nickolay]
[Zelikovsly, Alexander]
2006Journal Article
[Replication or Save Conflict]
Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
Althaus, Ernst
[Calinescu, Gruia]
[Mandoiu, Ion]
[Prasad, Sushil]
[Tchervenski, Nickolay]
[Zelikovsly, Alexander]
2003Proceedings Article
Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
1999Journal Article
Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Sibeyn, Jop F.
[Guillaume, Frank]
[Seidel, Tillmann]
Bilardi, G.
Ferreira, Afonso
Lüling, R.
Rolim, J.
1997Proceedings Article
Attachment IconPräzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122
Bast, Holger2005Journal Article
Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes
Guillaume, Frank1997Thesis - Masters thesis
Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Schirra, Stefan[van Kreveld, Marc]
[Nievergelt, Jurg]
[Roos, Thomas]
[Widmayer, Peter]
1997Part of a Book
Predecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32
Brodal, Gerth StøltingReischuk, Rudiger
Morvan, Michel
1997Proceedings Article
Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Abed, Fidaa
[Huang, Chien-Chung]
[Epstein, Leah]
[Ferragina, Paolo]
2012Proceedings Article
Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
[Hoogeveen, Han]
Skutella, Martin
[Woeginger, Gerhard J.]
2003Journal Article
Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Chaudhuri, Shiva
Hagerup, Torben
[Mayr, Ernst W.]
[Schmidt, Gunther]
[Tinhofer, Gottfried]
1995Proceedings Article
Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Kratsch, Stefan
Wahlström, Magnus
[Abramsky, Samson]
[Gavoille, Cyril]
[Kirchner, Claude]
[Meyer auf der Heide, Friedhelm]
[Spirakis, Paul G.]
2010Proceedings Article
Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Sanders, Peter[Fleischer, Rudolf]
[Moret, Bernard]
[Meineche Schmidt, Erik]
2002Part of a Book
Price of Anarchy
In: Encyclopedia of Algorithms, 1-99
Christodoulou, George[Kao, Ming-Yang]2008Part of a Book
Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Polzin, Tobias
[Vahdati Daneshmand, Siavash]
[Jansen, Klaus]
[Khuller, Samir]
2000Proceedings Article
Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427
Brodal, Gerth Stølting1996Proceedings Article
Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes
Beier, Rene2004Thesis - PhD thesis
Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Beier, Rene
Vöcking, Berthold
2004Proceedings Article
Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
[Belfrage, Michael]
[Mütze, Torsten]
Spöhel, Reto
2012Journal Article
Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Chaudhuri, Shiva
[Dubhashi, Devdatt]
[Baeza-Yates, Ricardo]
[Goles, Eric]
[Poblete, Patricio V.]
1995Proceedings Article
Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56
Chaudhuri, Shiva
[Dubhashi, Devdatt]
1997Journal Article
Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
Schweitzer, Pascal2009Thesis - PhD thesis
Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
Mehlhorn, Kurt1989Proceedings
Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Mehlhorn, Kurt
Schweitzer, Pascal
[Lee, Der-Tsai]
[Chen, Danny Z.]
[Ying, Shi]
2010Proceedings Article
Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Csaba, Bela2003Journal Article
Prototype implementation of the algebraic kernelBerberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias]
2008Report
Prototype implementation of the algebraic kernelBerberich, Eric
Hemmer, Michael
Kettner, Lutz2006Report
Attachment IconProvably Optimal Scheduling of Similar Tasks
Universität des Saarlandes
Bast, Hannah2000Thesis - PhD thesis
q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Burkhardt, Stefan
Crauser, Andreas
[Ferragina, Paolo]
Lenhof, Hans-Peter
[Rivals, Eric]
[Vingron, Martin]
[Istrail, Sorin]
[Pevzner, Pavel]
[Waterman, Michael]
1999Proceedings Article
Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Klau, Gunnar W.1997Thesis - Masters thesis
Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
[Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin]
2012Electronic Journal Article
Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230
Doerr, Benjamin
[Fouz, Mahmoud]
2011Journal Article
Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
Doerr, Benjamin
Fouz, Mahmoud
[Witt, Carsten]
[Pelikan, Martin]
[Branke, Jürgen]
2010Proceedings Article
Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Friedrich, Tobias
[Gairing, Martin]
[Sauerwald, Thomas]
[Charikar, Moses]2010Proceedings Article
Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Friedrich, Tobias
[Gairing, Martin]
Sauerwald, Thomas
2012Journal Article
Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
2008Proceedings Article
Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
2009Journal Article
Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Fountoulakis, Nikolaos
Huber, Anna
2009Journal Article
Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Doerr, Benjamin
[Friedrich, Tobias]
[Künnemann, Marvin]
[Sauerwald, Thomas]
[Finocchi, Irene]
[Hershberger, John]
2009Proceedings Article
Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Doerr, Benjamin
Friedrich, Tobias
[Künnemann, Marvin]
Sauerwald, Thomas
2011Journal Article
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas]
[Albers, Susanne]
[Marchetti-Spaccamela, Alberto]
[Matias, Yossi]
[Nikoletseas, Sotiris]
[Thomas, Wolfgang]
2009Proceedings Article
Attachment IconQuasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
Doerr, Benjamin
Friedrich, Tobias
2006Journal Article
Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
[Devillers, Olivier]
[Golin, Mordecai J.]
[Kedem, Klara]
Schirra, Stefan
1996Journal Article
Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
[Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos
[El-Rewini, Hesham]
[Shriver, Bruce D.]
1995Proceedings Article
Attachment 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
Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.]
[Kucera, Ludek]2002Proceedings Article
Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Sanders, Peter
Vöcking, Berthold
[Penttonen, Martti]
[Meineche Schmidt, Erik]
2002Proceedings Article
Attachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
Johannsen, Daniel2010Thesis - PhD thesis
Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Beier, René
Vöcking, Berthold
2004Journal Article
Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
Beier, Rene
Vöcking, Berthold
2003Proceedings Article
Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246
Banderier, Cyril2001Journal Article
Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Sanders, Peter1998Journal Article
Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Sanders, Peter1998Journal Article
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230
Bringmann, Karl
[Engels, Christian]
[Manthey, Bodo]
[Raghavendra Rao, B. V.]
[Chatterjee, Krishnendu]
[Sgall, Jirí]
2013Proceedings Article
Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
[Chlebus, Bogdan S.]
Kowalski, Dariusz
2004Journal Article
Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
Mehlhorn, Kurt
Vishkin, Uzi
1984Journal Article
Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
[Golin, Mordecai J.]
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
1998Journal Article
Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439
[Berenbrink, Petra]
[Cooper, Colin]
[Friedetzky, Tom]
Friedrich, Tobias
Sauerwald, Thomas
[Randall, Dana]2011Proceedings Article
Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech]
[Hirschberg, Dan]
[Myers, Gene]
1996Proceedings Article
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Crauser, Andreas
[Ferragina, Paolo]
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
2001Journal Article
Attachment IconRandomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
1998Proceedings Article
Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Baswana, Surender
[Sen, Sandeep]
[Sahni, Sartaj]
[Mehta, Dinesh]
2004Part of a Book
Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
1993Journal Article
Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
Buchmann, J.
Ganzinger, Harald
Paul, Wolfgang J.
1992Part of a Book
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Neumann, Frank
[Wegener, Ingo]
2007Journal Article
Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Sibeyn, Jop F.
[Kaufmann, Michael]
1997Journal Article
Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
[Kaufmann, Michael]
Sibeyn, Jop F.
1997Journal Article
Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
[Panconesi, Alessandro]
Papatriantafilou, Marina
Tsigas, Philippas
[Vitanyi, Paul]
1998Journal Article
Randomized 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
[Caragiannis, Ioannis]
Fishkin, Aleksei V.
[Kaklamanis, Christos]
[Papaioannou, Evi]
[Kratochvíl, Jan]
[Díaz, Josep]
[Fiala , Jiří]
2007Proceedings Article
Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Seiden, Steve S.1999Journal Article
Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Angelopoulos, Spyros
[Borodin, Allan]
2010Journal Article
Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Sanders, Peter1998Journal Article
Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
[Widmayer, Peter]
[Triguero, Francisco]
[Morales, Rafael]
[Hennessy, Matthew]
[Eidenbenz, Stephan]
[Conejo, Ricardo]
2002Proceedings Article
Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
[Adler, Micah]
[Räcke, Harald]
Sivadasan, Naveen
[Sohler, Christian]
Vöcking, Berthold
2003Journal Article
Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Sanders, Peter2002Journal Article
Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Huber, Anna2010Thesis - PhD thesis
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201
Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus
[Festa, Paola]2010Proceedings Article
Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
Doerr, Benjamin
Wahlström, Magnus
[Finocchi, Irene]
[Hershberger, John]
2009Proceedings Article
Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
[Karp, Richard]
[Schindelhauer, Christian]
[Shenker, Scott]
Vöcking, Berthold
2000Proceedings Article
Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
Fouz, Mahmoud2012Thesis - PhD thesis
Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Doerr, Benjamin[Thomas, Wolfgang]
[Weil, Pascal]
2007Proceedings Article
Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
[Irving, Robert W.]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
2006Journal Article
Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Mehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
[Irving, Robert W.]
[Paluch, Katarzyna]
2004Proceedings Article
Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Doerr, Benjamin
Winzen, Carola
2014Journal Article
Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
[Fernau, Henning]
[Fomin, Fedor V.]
[Lokshtanov, Daniel]
[Mnich, Matthias]
Philip, Geevarghese
[Saurabh, Saket]
[Iliopoulos, Costas S.]
[F. Smyth, William]
2011Proceedings Article
Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
[Bodlaender, Hans L.]
[Deogun, Jitender S.]
Jansen, Klaus
[Kloks, Ton]
[Kratsch, Dieter]
[Müller, Haiko]
[Tuza, Zsolt]
1998Journal Article
Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Kohlbacher, Oliver
Lenhof, Hans-Peter
1999Proceedings Article
Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
[Sanders, Peter]
[Singler, Johannes]
van Stee, Rob
2013Journal Article
Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Eigenwillig, Arno2008Thesis - PhD thesis
Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338
Arikati, Srinivasa Rao
Maheshwari, Anil
1996Journal Article
Recent Developments in Algorithms for the Maximum Flow Problem (Abstract)
In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404
Mehlhorn, Kurt[Shyamasundar, Rudrapatna]1992Proceedings Article
Attachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Jez, Artur[Portier, Natacha]
[Wilke, Thomas]
2013Proceedings Article
Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Jez, Artur[Beal, Marie-Pierre]
[Carton, Olivier]
2013Proceedings Article
Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Sanders, Peter2002Journal Article
Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76
Sanders, Peter2001Proceedings Article
Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353
Funke, Stefan
Ramos, Edgar A.
2001Proceedings Article
Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Althaus, Ernst
Naujoks, Rouven
[McGeoch, Catherine C.]2008Proceedings Article
Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
De Sterck, Hans
[Miller, Killian]
[Sanders, Geoff]
[Winlaw, Manda]
2011Journal Article
Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132
Michail, Dimitrios2007Journal Article
Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
Doerr, Benjamin
Winzen, Carola
[Soule, Terence]
[Moore, Jason H.]
2012Proceedings Article
Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Kettner, Lutz[Lumsdaine, Andrew]
[Schupp, Sibylle]
2005Electronic Proceedings Article
Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Kettner, Lutz[Musser, David]
[Siek, Jeremy]
2006Proceedings Article
Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
Doerr, Benjamin
Johannsen, Daniel
2007Proceedings Article
Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
[Bugliesi, Michele]
[Preneel, Bart]
[Sassone, Vladimir]
[Wegener, Ingo]
2006Proceedings Article
Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Mehlhorn, Kurt[Calamoneri, Tiziana]
[Finocchi, Irene]
[Italiano, Giuseppe F.]
2006Proceedings Article
Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Mehlhorn, Kurt[Fukuda, Komei]
[Van der Hoeven, Joris]
[Joswig, Michael]
[Takayama, Nobuki]
2010Proceedings Article
Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2010Proceedings Article
Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Hemmer, Michael2002Thesis - Masters thesis
Attachment IconRemarks on Category-Based Routing in Social NetworksBringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian
2012Unpublished/Draft
Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
[Gavrilova, Marina]
[Gervasi, Osvaldo]
[Kumar, Vipin]
[Tan, C. J.Kenneth]
[Taniar, David]
[Laganà, Antonio]
[Mun, Youngsong]
[Choo, Hyunseung]
2006Proceedings Article
Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
[Kratsch, Stefan]
Wahlström, Magnus
[Roughgarden, Tim]2012Proceedings Article
Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
Mehlhorn, Kurt
Ziegelmann, Mark
[Paterson, Mike]2000Proceedings Article
Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
[Gotthilf, Zvi]
[Hermelin, Danny]
[Landau, Gad M.]
[Lewenstein, Moshe]
2010Proceedings Article
Revision of interface specification of algebraic kernelBerberich, Eric
Hemmer, Michael
[Karavelas, Menelaos I.]
[Teillaud, Monique]
2007Report
Revisiting the COUNTER algorithms for list update
In: Information Processing Letters [64], 155-160
Albers, Susanne
[Mitzenmacher, Michael]
1997Journal Article
Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
[Amini, Omid]
Manjunath, Madhusudan
2010Electronic Journal Article
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143
Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten]
[Dorigo, Marco]
[Birattari, Mauro]
[Blum, Christian]
[Clerc, Maurice]
[Stützle, Thomas]
[Winfield, Alan F. T.]
2008Proceedings Article
Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
[Ryan, Conor]
[Keijzer, Maarten]
2008Proceedings Article
Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
[Dirk Thierens]2007Proceedings Article
Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes
Berberich, Eric2008Thesis - PhD thesis
Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Huddleston, S.
Mehlhorn, Kurt
Deussen, Peter1981Proceedings Article
Robust Computation of Visibility Maps
Universität des Saarlandes
Kessler, Harald2002Thesis - Masters thesis
Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Kontogiannis, Spyros
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
[Yung, Moti]
2000Journal Article
Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes
Butz, Bernd1997Thesis - Masters thesis
Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Schirra, StefanSack, Jörg-Rüdiger
Urrutia, Jorge
2000Part of a Book
Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62
Warken, Thomas
Schömer, Elmar
[Skala, Vaclav]2001Proceedings Article
Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Solis-Oba, Roberto
Frederickson, Greg N.
[Degano, P.]
[Vaccaro, U.]
[Pirillo, G.]
1998Proceedings Article
Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
Breslauer, Dany
[Jiang, Tao]
[Jiang, Zhigen]
1997Journal Article
Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
[Erlebach, Thomas]
[Persiano, Pino]
2005Proceedings Article
Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628
Doerr, Benjamin[Diekert, Volker]
[Durand, Bruno]
2005Proceedings Article
Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
Doerr, Benjamin2007Journal Article
Routing on Meshes with Buses
In: Algorithmica [18], 417-444
[Kaufmann, Michael]
[Raman, Rajeev]
Sibeyn, Jop F.
1997Journal Article
Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
Chlebus, Bogdan S.
Czumaj, Artur
Sibeyn, Jop F.
Lengauer, Christian
Griebl, Martin
Gorlatch, Sergei
1997Proceedings Article
Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Sibeyn, Jop F.1997Journal Article
Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541
Sibeyn, Jop F.[Penczek, Wojciech]
[Szalas, Andrzej]
1996Proceedings Article
Routing Problems in Grid GraphsKaufmann, Michael
Mehlhorn, Kurt
1989Report
Routing problems in grid graphsKaufmann, Michael
Mehlhorn, Kurt
1989Report
Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
Kaufmann, Morgan
Mehlhorn, Kurt
Korte, Bernhard
Lovász, László
Prömel, Hans Jürgen
Schrijver, Alexander
1990Part of a Book
Attachment IconRouting through a generalized switchboxKaufmann, Michael
Mehlhorn, Kurt
1984Report
Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
Mehlhorn, Kurt
Tsakalidis, Athanasios K.
Brauer, Wilfried1985Proceedings Article
Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Kaufmann, Michael
Mehlhorn, Kurt
1986Journal Article
Routing through a RectangleMehlhorn, Kurt
Preparata, F. P.
1983Report
Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Mehlhorn, Kurt
Preparata, F. P.
1986Journal Article
Routing with Finite Speeds of Memory and Network
In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497
Sibeyn, Jop F.Prívara, Igor
Ruzicka, Peter
1997Proceedings Article
Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Sibeyn, Jop F.1999Journal Article
Royal 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
Doerr, Benjamin
Künnemann, Marvin
2013Proceedings Article
Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
[Giakkoupis, George]
Sauerwald, Thomas
[Rabani, Yuval]2012Proceedings Article
Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Sauerwald, Thomas
[Stauffer, Alexandre]
[Randall, Dana]2011Proceedings Article
Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
[Clementi, Andrea]
[Crescenzi, Pierluigi]
Doerr, Carola
[Fraigniaud, Pierre]
[Isopi, Marc]
[Panconesi, Alessandro]
[Pasquale, Francesco]
[Silvestri, Riccardo]
2013Proceedings Article
Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
[Serna, Maria]
[Shaltiel, Ronen]
[Jansen, Klaus]
[Rolim, José]
2010Proceedings Article
Run-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
Doerr, Benjamin
Pohl, Sebastian
[Soule, Terence]
[Moore, Jason H.]
2012Proceedings Article
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank
[Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola]
2008Proceedings Article
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Neumann, Frank
[Witt, Carsten]
2009Journal Article
Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Doerr, Benjamin
[Neumann, Frank]
[Sudholt, Dirk]
[Witt, Carsten]
2011Journal Article
Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
Doerr, Benjamin
Johannsen, Daniel
[Schmidt, Martin]
[Beyer, Hans- Georg]
[Langdon, William]
2011Proceedings Article
Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389
Finkler, Ulrich
Mehlhorn, Kurt
1997Proceedings Article
Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
Sibeyn, Jop F.1995Proceedings Article
Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Sibeyn, Jop F.Lengauer, Christian
Griebl, Martin
Gorlatch, Sergei
1997Proceedings Article
Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Issac, Davis[Xu, Dachuan]
[Du, Donglei]
[Du, Dingzhu]
2015Proceedings Article
Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Johannsen, Daniel2006Thesis - Masters thesis
Attachment IconScalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
[Mokbel, Mohamed F.]
[Aref, Walid G.]
Elbassioni, Khaled M.
[Kamel, Ibrahim]
2004Proceedings Article
Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Mehlhorn, Kurt
Sanders, Peter
2003Journal Article
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181
[Günther, Elisabeth]
[König, Felix]
Megow, Nicole
[Bampis, Evripidis]
[Jansen, Klaus]
2010Proceedings Article
Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
[Rovan, Branislav]
Vojtas, Peter
2003Proceedings Article
Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178
Bast, Hannah[Ferreira, Afonso]
[Alt, Helmut]
2002Proceedings Article
Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403
[Chan, Sze-Hang]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Schwentick, Thomas]
[Dürr, Christoph]
2011Electronic Proceedings Article
Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
[Henzinger, Monika R.]
Leonardi, Stefano
2003Journal Article
Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
[Baruah, Sanjoy]
[Bonifaci, Vincenzo]
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen]
2012Journal Article
Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
[Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen]
[Hlinen{\'y}, Petr]
[Kucera, Anton\'{\i}n]
2010Proceedings Article
Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Christodoulou, George
[Gourves, Laurent]
[Pascual, Fanny]
[Lin, Guohui]2007Proceedings Article
Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM
[Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
2003Proceedings Article
Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
[Moehring, Rolf H.]
Skutella, Martin
[Stork, Frederik]
2004Journal Article
Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
Althaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt
[Möhring, Rolf]
[Raman, Rajeev]
2002Proceedings Article
ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Kutz, Martin
Schweitzer, Pascal
Applegate, David
Brodal, Gerth
2007Proceedings Article
Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Lee, Jae-Ha
[Park, Sang-Min]
[Chwa, Kyung-Yong]
2000Journal Article
Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
[Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej]
Higashino, Teruo2005Proceedings Article
Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Alt, Helmut
Mehlhorn, Kurt
1985Journal Article
Attachment IconSearching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145
Mehlhorn, KurtBecvár, Jirí1979Proceedings Article
Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian
Shyamasundar, Rudrapatna K.1993Proceedings Article
Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)[de Berg, Marc]
Schirra, Stefan
2002Proceedings
Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
Monien, Burkhard
Ottmann, Thomas
1992Part of a Book
Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Albers, Susanne
[Westbrook, Jeffery]
[Fiat, Amos]
[Woeginger, Gerhard J.]
1998Part of a Book
Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
[Berthomé, P.]
[Duboux, T.]
Hagerup, Torben
[Newman, I.]
[Schuster, Assaf]
[Spirakis, Paul]1995Proceedings Article
Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
[Hoepman, Jaap-Henk]
Papatriantafilou, Marina
Tsigas, Philippas
[Hélary, Jean-Michel]
[Raynal, Michel]
1995Proceedings Article
Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Papatriantafilou, Marina
Tsigas, Philippas
1997Journal Article
Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
[Czumaj, Artur]
Krysta, Piotr
Vöcking, Berthold
2002Proceedings Article
Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575
[Bacik, Roman]
Mahajan, Sanjeev
[Du, Ding-Zhu]
[Li, Ming]
1995Proceedings Article
Sensitive functions and approximate problems
In: Information and Computation [126], 161-168
Chaudhuri, Shiva1996Journal Article
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
Pettie, SethDeng, Xiaotie
Du, Dingzhu
2005Proceedings Article
Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes
Manss, Christian1997Thesis - Masters thesis
Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes
Brockenauer, Ralf1997Thesis - Masters thesis
Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
[Lotker, Zvi]
Majumdar, Debapriyo
[Narayanaswamy, N.S.]
Weber, Ingmar
[Chen, Danny Z.]
[Lee, D. T.]
2006Proceedings Article
Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Lenhof, Hans-Peter
Smid, Michiel
1995Journal Article
Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502
[Berghammer, Rudolf]
Friedrich, Tobias
Neumann, Frank
[Pelikan, Martin]
[Branke, Jürgen]
2010Proceedings Article
SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29
Mehlhorn, KurtValk, Rüdiger1988Proceedings Article
Shape Distributions and Protein Similarity
In: GCB, 1-10
Canzar, Stefan
[Remy, Jan]
2006Proceedings Article
Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090
Doerr, Benjamin
[Fouz, Mahmoud]
[Witt, Carsten]
[Krasnogor, Natalio]
[Lanzi, Pier Luca]
2011Proceedings Article
Shattering extremal systems
Universität des Saarlandes
Moran, Shay2012Thesis - Masters thesis
Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Chaudhuri, Shiva
Zaroliagis, Christos
[Fülöp, Zoltán]
[Gecseg, Ferenc]
1995Proceedings Article
Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Chaudhuri, Shiva
Zaroliagis, Christos
1998Journal Article
Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
Chaudhuri, Shiva
Zaroliagis, Christos
2000Journal Article
Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
Pyrga, Evangelia2005Thesis - Masters thesis
Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
van Stee, Rob2012Journal Article
Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
van Stee, Rob2012Journal Article
SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
van Stee, Rob2013Journal Article
Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Gawrychowski, Pawel[Kärkkäinen, Juha]
[Stoye, Jens]
2012Proceedings Article
Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Gawrychowski, Pawel2014Journal Article
Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola
2012Electronic Journal Article
Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
Zaroliagis, Christos1997Journal Article
Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
[Kirousis, Lefteris]
Spirakis, Paul G.
Tsigas, Philippas
1996Journal Article
Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Kärkkäinen, Juha
Sanders, Peter
[Baeten, Jos C.M.]
[Lenstra, Jan Karel]
[Parrow, Joachim]
[Woeginger, Gerhard J.]
2003Proceedings Article
Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218
Kötzing, Timo
[Neumann, Frank]
[Sudholt, Dirk]
[Wagner, Markus]
[Beyer, Hans- Georg]
[Langdon, William]
2011Proceedings Article
Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Golin, Mordecai J.
[Raman, Rajeev]
Schwarz, Christian
Smid, Michiel
1995Journal Article
Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
van Zuylen, Anke[Solis-Oba, Roberto]
[Persiano, Pino]
2012Proceedings Article
Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
Hagerup, Torben[Larsen, Kim G.]
[Skyum, Sven]
1998Proceedings Article
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Elbassioni, Khaled
[Paluch, Katarzyna]
van Zuylen, Anke
[Dürr, Christoph]
[Wilke, Thomas]
2012Electronic Proceedings Article
Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
2000Journal Article
Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
[Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
[Sloot, Peter]
[Bubak, Marian]
[Hoekstra, Alfons]
[Hertzberger, Bob]
1999Proceedings Article
Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290
Meyer, Ulrich
Sibeyn, Jop F.
[Breitenecker, F.]
[Husinsky, I.]
1995Proceedings Article
Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1992Journal Article
Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Elbassioni, Khaled M.
[Katriel, Irit]
Kutz, Martin
[Mahajan, Meena]
[Deng, Xiaotie]
Du, Dingzhu
2005Proceedings Article
Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
[Kutz, Martin]
Elbassioni, Khaled
[Katriel, Irit]
[Mahajan, Meena]
2008Journal Article
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 797-806
Meyer, Ulrich2001Proceedings Article
SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Sanders, Peter
[Reussner, Ralf]
[Prechelt, Lutz]
[Müller, Matthias]
Alexandrov, Vassil
Dongarra, Jack
1998Proceedings Article
Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
[Dams, Johannes]
Hoefer, Martin
[Kesselheim, Thomas]
[Afek, Yehuda]2013Proceedings Article
Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Chan, T.-H. Hubert
[Gupta, Anupam]
2009Journal Article
Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
Funke, Stefan
Ramos, Edgar A.
2002Proceedings Article
Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
[Albers, Susanne]
[Marchetti-Spaccamela, Alberto]
[Matias, Yossi]
[Nikoletseas, Sotiris]
[Thomas, Wolfgang]
2009Proceedings Article
Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
2010Electronic Journal Article
Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan]
2011Journal Article
Attachment IconSmoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207
Banderier, Cyril
Beier, Rene
Mehlhorn, Kurt
[Rovan, Branislav]
[Vojtas, Peter]
2003Proceedings Article
Attachment IconSnap Rounding of Bézier CurvesEigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola]
2007Report
Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Eigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola]
2007Proceedings Article
Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30
Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias
2011Proceedings Article
Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308
Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias
[Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila]
2011Electronic Proceedings Article
Solid Modeling durch Boolesche Operationen
Universität des Saarlandes
Behrens, Christian2000Thesis - Masters thesis
Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
[Case, John]
Kötzing, Timo
[Hutter, Marcus]
[Stephan, Frank]
[Vovk, Vladimir]
[Zeugmann, Thomas]
2010Proceedings Article
Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
[Kaufmann, Michael]
Sibeyn, Jop F.
[Hájek, Petr]
[Wiedermann, Jiri]
1995Proceedings Article
Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath]
[Fiat, Amos]
[Sanders, Peter]
2009Proceedings Article
Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Sibeyn, Jop F.2000Journal Article
Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299
Sibeyn, Jop F.[Arnborg, Stefan]
[Ivansson, Lars]
1998Proceedings Article
Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451
Denny, Markus[Brunet, Pere]
[Fellner, Dieter W.]
2003Proceedings Article
Solving large Sparse Linear Systems exactly
Universität des Saarlandes
Weber, Dennis2006Thesis - Masters thesis
Solving 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
Bei, Xiaohui[Halldórsson, Magnús M.]
[Iwama, Kazuo]
[Kobayashi, Naoki]
[Speckmann, Bettina]
2015Proceedings Article
Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Johannsen, Daniel
[Razgon, Igor]
Wahlström, Magnus
[Kullmann, Oliver]2009Proceedings Article
Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
Ramos, Edgar A.2001Journal Article
Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V.
Ramesh, S.
Sivakumar, G.
1997Proceedings Article
Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Elbassioni, Khaled
[Hagen, Matthias]
Rauf, Imran
2008Proceedings Article
Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
[Sridharan, K]
Subramanian, C. R.
[Sudha, N]
1998Journal Article
Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
Mehlhorn, Kurt1979Journal Article
Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380
Mehlhorn, KurtBecvár, Jirí1979Proceedings Article
Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398
Hagerup, Torben[Morvan, Michel]
[Meinel, Christoph]
[Krob, Daniel]
1998Proceedings Article
Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
[Andersson, Arne]
Hagerup, Torben
[Nilsson, Stefan]
[Raman, Rajeev]
1995Proceedings Article
Sorting Jordan sequences in linear timeHoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1984Report
Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1985Proceedings Article
Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1986Journal Article
Sorting Presorted FilesMehlhorn, Kurt1978Report
Attachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
Mehlhorn, KurtWeihrauch, Klaus1979Proceedings Article
Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544
[Arya, Sunil]
Malamatos, Theocharis
Mount, David M.
2005Proceedings Article
Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Fotakis, Dimitris
[Pagh, Rasmus]
Sanders, Peter
[Spirakis, Paul G.]
Alt, Helmut
Habib, Michel
2003Proceedings Article
Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
[Fotakis, Dimitris]
[Pagh, Rasmus]
Sanders, Peter
Spirakis, Paul G.
2005Journal Article
Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
Hertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg
1984Journal Article
Attachment IconSpace sweep solves intersection of two convex polyhedra elegantly[Hertel, Stefan]
[Mehlhorn, Kurt]
[Mäntylä, Martti]
[Nievergelt, Jurg]
1984Report
Special issue on “algorithms: implementation, libraries and use”Buchberger, Bruno
Mehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg
1994Book
Specification of the traits classes for CGAL arrangements of curvesBerberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
2003Report
Speed 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
Chan, Ho-Leung
[Edmonds, Jeff]
[Pruhs, Kirk]
2009Proceedings Article
Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
[Pruhs, Kirk]
van Stee, Rob
[Uthaisombut, Patchrawat]
2008Journal Article
Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701
[Bansal, Nikhil]
Chan, Ho-Leung
[Pruhs, Kirk]
[Mathieu, Claire]2009Proceedings Article
Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2007Journal Article
Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
[Runarsson, Thomas Ph.]
[Beyer, Hans G.]
[Burke, Edmund]
[Merelo-Guervós, Juan J.]
[Whitley, L. Darrell]
[Yao, Xin]
2006Proceedings Article
Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Bringmann, Karl
[Friedrich, Tobias]
[Igel, Christian]
[Voß, Thomas]
2013Journal Article
SPP 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
[Brandenburg, Franz J.]
[Jünger, Michael]
Mutzel, Petra
[Lengauer, Thomas]
Jarke, Matthias
Pasedach, Klaus
Pohl, Klaus
1997Proceedings Article
Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
Sauerwald, Thomas
[Scheideler, Christian]
2011Proceedings Article
Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Bonifaci, Vincenzo
[Harks, Tobias]
[Schäfer, Guido]
2010Journal Article
Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
[Datta, Amitava]
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
1995Journal Article
Steepest Descent Preconditioning for Nonlinear GMRES OptimizationDe Sterck, Hans2012Unpublished/Draft
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158
[Boros, Endre]
Elbassioni, Khaled
[Fouz, Mahmoud]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Manthey, Bodo]
[Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiri]
2011Proceedings Article
Stochastic optimization with fitness proportional ant systems

Universität des Saarlandes
Feldmann, Matthias2012Thesis - Bachelor thesis
Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
Pyrga, Evangelia
[Chung, Christine]
[Mavronicolas, Marios]
[Papadopoulou, Vicky G.]
2009Proceedings Article
Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Hoefer, Martin2013Journal Article
Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
[Kaplan, Haim]2010Proceedings Article
String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
[Kasprzik, Anna]
Kötzing, Timo
[Martin-Vide, Carlos]
[Fernau, Henning]
[Dediu, Adrian Horia]
2010Proceedings Article
String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Hariharan, Ramesh
[Muthukrishnan, S.]
1995Journal Article
Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
[Dong, Yingfei]
[Du, Ding-Zhu]
[Ibarra, Oscar]
2009Proceedings Article
Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Doerr, Benjamin
[Huber, Anna]
[Levavi, Ariel]
2013Journal Article
Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
[Case, John]
Kötzing, Timo
[Kalai, Adam Tauman]
[Mohri, Mehryar]
2010Proceedings Article
Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna]
[Diekert, Volker]
[Habib, Michel]
2004Proceedings Article
Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
[Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna E.]
2007Journal Article
Attachment IconStructural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42
Funke, Stefan
Mehlhorn, Kurt
[Näher, Stefan]
1999Proceedings Article
Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan
2005Journal Article
Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
El Kahoui, M'hammed
[Rakrak, Said]
2007Journal Article
STXXL: Standard Template Library for XXL Data Sets[Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter]
2005Report
STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
[Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter]
[Brodal, Gerth Stølting]
[Leonardi, Stefano]
2005Proceedings Article
Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
[Lokshtanov, Daniel]
[Saurabh, Saket]
Wahlström, Magnus
[D'Souza, Deepak]
[Kavitha, Telikepalli]
[Radhakrishna, Jaikumar]
2012Electronic Proceedings Article
Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
El Kahoui, M'hammed2004Journal Article
Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
Farzan, Arash
[Munro, J. Ian]
2011Journal Article
Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
[Blelloch, Guy E.]
Farzan, Arash
[Amir, Amihood]
[Parida, Laxmi]
2010Proceedings Article
Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
Bringmann, Karl
[Green Larsen, Kasper]
2013Proceedings Article
Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Kovács, Annamária[Diekert, Volker]
[Habib, Michel]
2004Proceedings Article
Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Sanders, PeterAlbers, Susanne
Radzik, Tomasz
2004Proceedings Article
Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132
Dey, Tamal K.
Funke, Stefan
Ramos, Edgar A.
2001Electronic Proceedings Article
Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
[Wendt, Ulrich]
[Lange, Katharina]
[Smid, Michiel]
Ray, Rahul
[Tönnies, Klaus-Dietz]
2002Journal Article
Surface Topography Quantification using Computational Geometry[Wendt, Ulrich]
[Lange, Katharina]
Ray, Rahul
[Smid, Michiel]
2001Miscellaneous
Sweep 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
[Beldiceanu, Nicolas]
[Carlsson, Mats]
Thiel, Sven
2003Electronic Proceedings Article
Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsBerberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
2007Report
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Wein, Ron]
2007Proceedings Article
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron]
[Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo]
2007Proceedings Article
Sweeping Arrangements of Cubic Segments Exactly and EfficientlyEigenwillig, Arno
[Schömer, Elmar]
Wolpert, Nicola
2002Report
Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Baus, Andreas2005Thesis - Masters thesis
Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes
Baus, Andreas2004Thesis - Masters thesis
Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10
Vöcking, Berthold2001Proceedings Article
Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
[Kuhn, Fabian]
Panagiotou, Konstantinos
[Spencer, Joel]
[Steger, Angelika]
[Charikar, Moses]2010Proceedings Article
Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Sanders, Peter
Vöcking, Berthold
2003Journal Article
Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
1993Journal Article
Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo
Frederickson, Grag
Graham, Ron
Hochbaum, Dorit S.
Johnson, Ellis
Kosaraju, S. Rao
Luby, Michae
Megiddo, Nimrod
Schieber, Baruch
Vaidya, Pravin
Yao, Frances
1992Proceedings Article
Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Mehlhorn, KurtVitter, Jeffrey S.
Zaroliagis, Christos D.
1999Proceedings Article
Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk]
Mayr, Ernst W.
[Portier, Natacha]
2014Proceedings Article
Attachment IconThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
Mehlhorn, KurtLoeckx, Jacques1974Proceedings Article
The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Czumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
[Muthukrishnan, S.]
Träff, Jesper Larsson
[Italiano, Giuseppe]
[Orlando, S.]
1997Proceedings Article
The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Bast, Hannah
Hert, Susan
Bremner, David2000Proceedings Article
The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes
Becker, Ruben2012Thesis - Bachelor thesis
The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
[Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven]
[Lin, Ming C.]
[Manocha, Dinesh]
[Lin, Ming C.]
1996Proceedings Article
The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
[Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian
[Serna, Maria]
[Shaltiel, Ronen]
[Jansen, Klaus]
[Rolim, José]
2010Proceedings Article
The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
[Lehnert, Jörg]
Schweitzer, Pascal
2007Journal Article
The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Giesen, Joachim[A. Gustafsson]
[A. Herrmann]
[F. Huber]
2007Part of a Book
Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
Bast, Holger
Weber, Ingmar
Weikum, Gerhard2007Electronic Proceedings Article
The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Jez, Artur2014Journal Article
Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
[Fekete, Sandor P.]
Skutella, Martin
[Woeginger, Gerhard J.]
2003Journal Article
The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
[Mortensen, Christian Worm]
Pettie, Seth
Dehne, Frank
López-Ortiz, Alejandro
Sack, Jörg-Rüdiger
2005Proceedings Article
The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Chaudhuri, Shiva
[Radhakrishnan, Jaikumar]
1997Journal Article
The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
Mutzel, Petra
Ziegler, Thomas
[Kratochvil, Jan]2000Proceedings Article
The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134
Mutzel, Petra
Ziegler, Thomas
[Kall, Peter]
[Lüthi, Hans-Jakob]
1999Proceedings Article
The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
2001Proceedings Article
The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Jurkiewicz, Tomasz
Mehlhorn, Kurt
2013Proceedings Article
The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
[Deng, Xiaotie]
Mahajan, Sanjeev
1997Journal Article
The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Friedrich, Tobias
[Sauerwald, Thomas]
[Thai, My T.]
[Sahni, Sartaj]
2010Proceedings Article
The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Friedrich, Tobias
Sauerwald, Thomas
2010Electronic Journal Article
Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
[Fernau, Henning]
[Fomin, Fedor V.]
Philip, Geevarghese
[Saurabh, Saket]
[Thai, My T.]
[Sahni, Sartaj]
2010Proceedings Article
The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
Panagiotou, Konstantinos2009Journal Article
Attachment IconThe Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272
[Klein, Rolf]
Kutz, Martin
2006Proceedings Article
Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Schmitt, SusanneGanzha, Viktor G.
[Mayr, Ernst W.]
[Vorozhtsov, Evgenii V.]
2005Proceedings Article
The Diamond Operator for Real Algebraic NumbersSchmitt, Susanne2003Report
Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen]
2011Journal Article
The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20
[Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.]
[Amenta, Nina]
[Cheong, Otfried]
2006Proceedings Article
Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Lodaya, Kamal]
[Mahajan, Meena]
2010Proceedings Article
Attachment IconThe Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64
[Bredereck, Robert]
[Nichterlein, Andr{\'e}]
[Niedermeier, Rolf]
Philip, Geevarghese
[Owe, Olaf]
[Steffen, Martin]
[Telle, Jan Arne]
2011Proceedings Article
The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Mehlhorn, KurtAggarwal, Alok
Rangan, C. Pandu
1999Proceedings Article
The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Mehlhorn, KurtRangan, C. Pandu
Raman, Venkatesh
Ramanujam, R.
1999Proceedings Article
The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Fountoulakis, Nikolaos
[Reed, Bruce]
2008Journal Article
The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
Sanders, Peter
[Träff, Jesper Larsson]
[Monien, Burkhard]
[Feldman, Rainer]
2002Proceedings Article
The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Giesen, Joachim2008Journal Article
The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
[Dubhashi, Devdatt]
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
Zaroliagis, Christos
1995Journal Article
The general two-server problem
In: Journal of the ACM [53], 437-458
Sitters, Rene
[Stougie, Leen]
2006Journal Article
The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
[Feremans, Corinne]
[Grigoriev, Alexander]
Sitters, Rene
2006Journal Article
The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Vidali, Angelina[Leonardi, Stefano]2009Proceedings Article
Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit LayoutsLengauer, Thomas
Mehlhorn, Kurt
1983Report
Attachment IconThe HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149
Lengauer, Thomas
Mehlhorn, Kurt
Penfield, Paul1984Proceedings Article
The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
[Mavronicolas, Marios]
Papatriantafilou, Marina
Tsigas, Philippas
Feitelson, Dror G.
Rudolph, Larry
1997Proceedings Article
Attachment IconThe Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
Mehlhorn, Kurt
Näher, Stefan
[Pehrson, Bjoern]
[Simon, Imre]
1994Proceedings Article
Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
Doerr, Benjamin
[Lengler, Johannes]
[Steurer, Daniel]
[Asano, Tetsuo]2006Proceedings Article
The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
[Konwar, Kishori]
Kowalski, Dariusz
[Shvartsman, Alexander]
2004Proceedings Article
Attachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
Philip, Geevarghese2011Thesis - PhD thesis
The LEDA class real number -- extended versionFunke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
[Burnikel, Christoph]
[Fleischer, Rudolf]
[Schirra, Stefan]
2004Report
The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Mayr, Heinrich C.1996Proceedings Article
The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
Degano, Pierpaolo
Gorrieri, Roberto
Marchetti-Spaccamela, Alberto
1997Proceedings Article
The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Mehlhorn, KurtHoule, Michael E.
Eades, Peter
1996Proceedings Article
Attachment IconThe Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789
[Bundy, David]
Hebbinghaus, Nils
[Stellmacher, Bernd]
2006Journal Article
The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Friedrich, Tobias
[Bringmann, Karl]
[Voss, Thomas]
[Igel, Christian]
[Beyer, Hans- Georg]
[Langdon, William]
2011Proceedings Article
The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Elmasry, Amr2010Journal Article
The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki]
[Boldi, Paolo]
[Gargano, Luisa]
2010Proceedings Article
The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
Kötzing, Timo
[Sutton, Andrew M.]
[Neumann, Frank]
[O'Reilly, Una-May]
[Soule, Terence]
[Moore, Jason H.]
2012Proceedings Article
The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518
[Bringmann, Karl]
Friedrich, Tobias
2010Proceedings Article
The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos
[Randall, Dana]2011Proceedings Article
The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297
Jansen, Klaus[Morvan, Michel]
[Meinel, Christoph]
[Krob, Daniel]
1998Proceedings Article

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