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
Cache-Oblivious and Cache-Aware AlgorithmsLars, Arge
Bender, Michael A.
Demaine, Erik
Leiserson, Charles
Mehlhorn, Kurt
2005Report
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492
[Brodal, Gerth Stølting]
[Fagerberg, Rolf]
Meyer, Ulrich
[Zeh, Norbert]
[Hagerup, Torben]
[Katajainen, Jyrki]
2004Proceedings Article
Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Doerr, Carola
[Gnewuch, Michael]
Wahlström, Magnus
[Chen, W.W.L.]
[Srivastav, A.]
[Travaglini, G.]
2013Part of a Book
Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248
Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
Paterson, Michael S.1990Proceedings Article
Attachment IconCan a maximum flow be computed in $o(nm)$ time?Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Report
Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
Johannsen, Daniel
Lengler, Johannes
[Pelikan, Martin]
[Branke, Jürgen]
2010Proceedings Article
Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367
Bast, HannahAlbers, Susanne
Alt, Helmut
Näher, Stefan
2009Part of a Book
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
[Correa, Jose R.]
Megow, Nicole
Raman, Rajiv
[Suchan, Karol]
[Cafieri, Sonia]
[Mucherino, Antonio]
[Nannicini, Giacomo]
[Tarissan, Fabien]
[Liberti, Leo]
2009Proceedings Article
Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907
Panagiotou, Konstantinos
[Coja-Oghlan, Amin]
2012Proceedings Article
Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
[Basit, Abdul]
[Mustafa, Nabil H.]
Ray, Saurabh
[Raza, Sarfraz]
2010Journal Article
Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
Kowalski, Dariusz
[Pelc, Andrzej]
[Jansen, Klaus]
[Khanna, Sanjeev]
[Rolim, José]
[Ron, Dana]
2004Proceedings Article
Certification of Curve Arrangements
Universität des Saarlandes
Wang, Pengming2012Thesis - Masters thesis
Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
[Suzuki, Masakazu]
[Hong, Hoon]
[Anai, Hirokazu]
[Yap, Chee]
[Sato, Yosuke]
[Yoshida, Hiroshi]
2009Proceedings Article
Certified numerical root finding
Universität des Saarlandes
Kobel, Alexander2011Thesis - Masters thesis
Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Schmidt, Jens M.[Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew]
[Wattenhofer, Roger]
2012Proceedings Article
Attachment IconCertifying 3-Edge-ConnectivityMehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M.
2012Unpublished/Draft
Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M.
2013Proceedings Article
Certifying algorithms
In: Computer Science Review [5], 119-161
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
2011Journal Article
Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
McConnella, Ross M.
Mehlhorn, Kurt
[Näher, Stefan]
[Schweitzer, Pascal]
2010Electronic Journal Article
Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2003Proceedings Article
Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
[Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.]
2006Journal Article
Certifying Algorithms (draft)Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P.
2005Unpublished/Draft
Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
2003Proceedings Article
CGAL's Curved Kernel via AnalysisBerberich, Eric
Emeliyanenko, Pavel
2008Report
CGAL package for modular arithmetic operationsHemmer, Michael2008Report
CGAL package: Algebraic FoundationsHemmer, Michael2008Report
CGAL Reference and User Manuals[Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette]
2001Unknown Form: eBookForm
Channel Routing in Knock-Knee Mode: Simplified Algorithms and ProofMehlhorn, Kurt1984Report
Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji
1986Journal Article
Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526
[Park, Sang-Min]
Lee, Jae-Ha
[Chwa, Kyung-Yong]
[Lee, D. T.]
[Teng, Shang-Hua]
2000Proceedings Article
Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj]
2008Journal Article
Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Hagerup, Torben
[Katajainen, Jyrki]
[Nishimura, Naomi]
[Ragde, Prabhakar]
1995Proceedings Article
Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Ajwani, Deepak
[Malinger, Itay]
[Meyer, Ulrich]
[Toledo, Sivan]
[McGeoch, Catherine]2008Proceedings Article
Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
[Canzar, Stefan]
[El-Kebir, Mohammed]
[Pool, Rene]
Elbassioni, Khaled
[Malde, Alpeshkumar K.]
[Mark, Alan E.]
[Geerke, Daan P.]
[Stougie, Leen]
[Klau, Gunnar W.]
[Chor, Benny]2012Proceedings Article
Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian
1996Proceedings Article
Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
1999Journal Article
Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902
Finkler, Ulrich
Mehlhorn, Kurt
1999Proceedings Article
Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Huang, Chien-Chung2010Journal Article
Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Huang, Chien-ChungCharikar, Moses2010Proceedings Article
Classroom Examples of Robustness Problems in Geometric ComputationsKettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
[Schirra, Stefan]
[Yap, Chee]
2004Report
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
2008Journal Article
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee]
[Albers, Susanne]
[Radzik, Tomasz]
2004Proceedings Article
Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
[Cygan, Marek]
[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus
[Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger]
2012Proceedings Article
Attachment IconCNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31
Mehlhorn, Kurt
Ziegelmann, Mark
Buchsbaum, Adam L.
Snoeyink, Jack
2001Proceedings Article
Codes: Unequal Probabilities, Unequal Letter CostAltenkamp, Doris
Mehlhorn, Kurt
1978Report
[Replication or Save Conflict]
Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Altenkamp, Doris
Mehlhorn, Kurt
Ausiello, Giorgio
Böhm, Corrado
1978Proceedings Article
Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Altenkamp, Doris
Mehlhorn, Kurt
1980Journal Article
Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva]
[Kao, Ming-Yang]
[Li, Xiang-Yang]
2007Proceedings Article
Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
[Chlebus, Bogdan S.]
Kowalski, Dariusz
[Shvartsman, Alex]
2004Proceedings Article
Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
[Fraigniaud, Pierre]
[Gasieniec, Leszek]
Kowalski, Dariusz
[Pelc, Andrzej]
[Farach-Colton, Martin]2004Proceedings Article
Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
Warken, Thomas2004Thesis - PhD thesis
Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev
[Karlsson, Rolf]
[Lingas, Andrzej]
1996Proceedings Article
Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
[Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Srivastav, Anand]
2004Journal Article
Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
[Mütze, Torsten]
[Rast, Thomas]
Spöhel, Reto
[Randall, Dana]2011Proceedings Article
Combinatoire Analytique des chemins et des cartes
Université de Paris 6
Banderier, Cyril2001Thesis - PhD thesis
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
[Gandhi, Rajiv]
Mestre, Julián
2009Journal Article
Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
van Stee, Rob2008Thesis - Habilitation thesis
Attachment IconCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
Reichel, Joachim2006Thesis - PhD thesis
Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes
Funke, Stefan2001Thesis - PhD thesis
Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Klau, Gunnar W.
Mutzel, Petra
[Kratochvíl, Jan]1999Proceedings Article
Common Subexpression Search in LEDA_realsSchmitt, Susanne2003Report
Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorSchmitt, Susanne2004Report
Compaction on the TorusMehlhorn, Kurt
Rülling, W.
1988Report
Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
Mehlhorn, Kurt
Rülling, W.
1990Journal Article
Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Mehlhorn, Kurt
Rülling, W.
Reif, John H.1988Proceedings Article
Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168
Brodal, Gerth Stølting
[Pinotti, M. Cristina]
[Arnborg, Stefan]
[Ivansson, Lars]
1998Proceedings Article
Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Doerr, Benjamin
[Jansen, Thomas]
[Klein, Christian]
[Ryan, Conor]
[Keijzer, Maarten]
2008Proceedings Article
Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten]
[Stützle, Thomas]
[Birattari, Mauro]
[Hoss, Holger H.]
2007Proceedings Article
Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2009Journal Article
Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
[Bansal, Nikhil]
Chan, Ho-Leung
[Pruhs, KIrk]
2011Journal Article
Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Katriel, Irit
Thiel, Sven
2005Journal Article
Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
2004Proceedings Article
Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
[Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar]
[Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo]
2007Proceedings Article
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsHemmer, Michael
[Dupont, Laurent]
[Petitjean, Sylvain]
[Schömer, Elmar]
2008Report
Complexity Arguments in Algebraic Language TheoryAlt, Helmut
Mehlhorn, Kurt
1978Report
Attachment IconComplexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225
Alt, Helmut
Mehlhorn, Kurt
1979Journal Article
Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Elbassioni, Khaled
[Tiwary, Hans Raj]
2009Proceedings Article
Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Elbassioni, Khaled
[Tiwary, Hans Raj]
2012Journal Article
Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Sitters, Rene2005Journal Article
Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Sharma, Vikram2008Electronic Journal Article
Complexity of searching for a black hole[Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej]
2006Unpublished/Draft
Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Friedrich]
2008Journal Article
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103
[Kratsch, Stefan]
Wahlström, Magnus
[Rabani, Yuval]2012Proceedings Article
Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
[Case, John]
Kötzing, Timo
2012Journal Article
Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Gärtner, Tobias
[Hotz, Günter]
[Ambos-Spies, Klaus]
[Löwe, Benedikt]
[Merkle, Wolfgang]
2009Proceedings Article
Attachment IconComputation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117
[Bouziane, Driss]
El Kahoui, M'hammed
2002Journal Article
Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Jez, Artur
[Okhotin, Alexander]
2014Journal Article
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80
[Durrett, Greg]
[Neumann, Frank]
[O'Reilly, Una-May]
[Beyer, Hans- Georg]
[Langdon, William]
2011Proceedings Article
Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120
Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten]
[Lim, Chee Peng]
[Jain, Lakhmi C.]
[Dehuri, Satchidananda]
2009Part of a Book
Computational Geometry: Theory and Implementation
Universität des Saarlandes
Schirra, Stefan1998Thesis - Habilitation thesis
Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
[Vingron, Martin]
Lenhof, Hans-Peter
Mutzel, Petra
Dell'Amico, M.
Maffioli, F.
Martello, S.
1997Part of a Book
Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
2001Proceedings Article
Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
Thiel, Christian
Thiagarajan, P. S.1995Proceedings Article
Attachment IconComputing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240
Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
1991Journal Article
Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsPettie, Seth
Sanders, Peter
2005Unpublished/Draft
Computing Envelopes of QuadricsBerberich, Eric
[Meyerovitch, Michal]
2007Report
Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Berberich, Eric
[Meyerovitch, Michal]
2007Proceedings Article
Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Beier, René
[Czumaj, Artur]
[Krysta, Piotr]
[Vöcking, Berthold]
2006Journal Article
Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Beier, Rene
[Krysta, Piotr]
[Czumaj, Artur]
[Vöcking, Berthold]
2004Proceedings Article
Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
[Klein, Rolf]
Kutz, Martin
[Kaufmann, Michael]
[Wagner, Dorothea]
2007Proceedings Article
Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
[Giannopoulos, Panos]
[Klein, Rolf]
Kutz, Martin
[Marx, Daniel]
2010Journal Article
Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277
Althaus, Ernst
Canzar, Stefan
[Emmett, Mark]
Karrenbauer, Andreas
[Marshall, Alan]
[Meyer-Bäse, Anke]
[Zhang, Huimin]
2008Proceedings Article
Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171
Porkolab, Lorant
Khachiyan, Leonid
1997Proceedings Article
Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich]
[Fourey, Sébastien]
[Herman, Gabor T.]
[Kong, T. Yung]
2002Proceedings Article
Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
[Smid, Michiel]
Ray, Rahul
[Wendt, Ulrich]
[Lange, Katharina]
2004Journal Article
Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
Althaus, Ernst
[Karamanis, Nikiforos]
[Koller, Alexander]
2004Proceedings Article
Computing mimicking networks
In: Algorithmica [26], 31-49
Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
[Zaroliagis, Christos]
2000Journal Article
Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
Zaroliagis, Christos
[Larsen, Kim G.]
[Skyum, Sven]
[Winskel, Glynn]
1998Proceedings Article
Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
[Babenko, Maxim A.]
[Gawrychowski, Pawel]
[Kociumaka, Tomasz]
[Starikovskaya, Tatiana A.]
[Kulikov, Alexander S.]
[Kuznetsov, Sergei O.]
[Pevzner, Pavel A.]
2014Proceedings Article
Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
[Han, Xiaofeng]
Kelsen, Pierre
[Ramachandran, Vijaya]
[Tarjan, Robert E.]
1995Journal Article
Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin]
2011Journal Article
Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin]
[Ryan, Conor]
[Keijzer, Maarten]
2008Proceedings Article
Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Doerr, C.
Schmidt, Jens M.
Ramakrishna, G.
2013Proceedings Article
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
[Harks, Tobias]
Hoefer, Martin
[Klimm, Max]
[Skopalik, Alexander]
2013Journal Article
Attachment IconComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
Emeliyanenko, Pavel2012Electronic Journal Article
Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437
Kutz, Martin[Amenta, Nina]
[Cheong, Otfried]
2006Proceedings Article
Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66
[Baswana, Surender]
[Biswas, Somenath]
Doerr, Benjamin
[Friedrich, Tobias]
[Kurur, Piyush P.]
Neumann, Frank
[Jansen, Thomas]
[Garibay, Ivan]
[Wiegand, R.Paul]
[Wu, Annie S.]
2009Proceedings Article
Attachment IconComputing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
Althaus, Ernst
Naujoks, Rouven
2006Proceedings Article
Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.]
[Amato, Nancy M.]
[Goodrich, Michael T.]
2000Proceedings Article
Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes
Fontaine, Marc2003Thesis - Masters thesis
Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
[Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
[Thiel, Christian]
1997Journal Article
Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
1997Proceedings Article
Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
[Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan
1997Proceedings Article
Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Elmasry, Amr2009Journal Article
Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Kärkkäinen, Juha[Penttonen, Martti]
[Meineche Schmidt, Erik]
2002Proceedings Article
Attachment IconComputing with algebraic curves in generic positionEl Kahoui, M'hammed2008Miscellaneous
Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52
[Ajwani, Deepak]
Elbassioni, Khaled
[Govindarajan, Sathish]
Ray, Saurabh
2012Journal Article
Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187
Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh]
[Gibbons, Phillip B.]
[Scheideler, Christian]
2007Proceedings Article
Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear)
Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
[Ray, Saurabh]
2007Proceedings Article
Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Elbassioni, Khaled M.
Mustafa, Nabil H.
[Durand, Bruno]
[Thomas, Wolfgang]
2006Proceedings Article
Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksElbassioni, Khaled M.
Mustafa, Nabil H.
2005Unpublished/Draft
Attachment IconCongruence, similarity and symmetries of geometric objects[Alt, Helmut]
Mehlhorn, Kurt
[Wagener, Hubert]
[Welzl, Emo]
1987Report
Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1988Journal Article
Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Giesen, Joachim2008Journal Article
Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Hert, Susan2001Proceedings Article
Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
[Guibas, Leonidas]
Milosavljevic, Nikola
[Motskin, Arik]
2010Proceedings Article
Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Schweitzer, Pascal
[Schweitzer, Patrick]
2010Journal Article
Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
[Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Codrea, Cosmin]
2008Journal Article
Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
[Crochemore, Maxime]
Gasieniec, Leszek
[Rytter, Wojciech]
[Carpentieri, B.]
[De Santis, A.]
[Vaccaro, U.]
[Storer, J. A.]
1998Proceedings Article
Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
[Crochemore, Maxime]
[Galil, Zvi]
Gasieniec, Leszek
[Park, Kunsoo]
[Rytter, Wojciech]
1997Journal Article
Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
[Anagnostopoulos, Aris]
[Grandoni, Fabrizio]
[Leonardi, Stefano]
Wiese, Andreas
2013Proceedings Article
Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2004Proceedings Article
Constrained Shortest Paths and Related Problems
Universität des Saarlandes
Ziegelmann, Mark2001Thesis - PhD thesis
Attachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Mehlhorn, Kurt[Montanari, Ugo]
[Rolim, José D. P.]
[Welzl, Emo]
2000Proceedings Article
Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
[Fellows, Michael R.]
Friedrich, Tobias
Hermelin, Danny
[Narodytska, Nina]
[Rosamond, Frances A.]
[Walsh, Toby]2011Proceedings Article
Constraints and Changes
Universität des Saarlandes
Katriel, Irit2004Thesis - PhD thesis
Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796
Doerr, Carola
[De Rainville, François-Michel]
2013Proceedings Article
Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
Ramos, Edgar A.1997Proceedings Article
Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingDoerr, Benjamin
[Gnewuch, Michael]
2006Report
Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312
Doerr, Benjamin
[Gnewuch, Michael]
[Keller, Alexander]
[Heinrich, Stefan]
[Niederreiter, Harald]
2008Proceedings Article
Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Schmidt, Jens M.2012Journal Article
Constructive Hopf's theorem: or how to untangle closed planar curvesMehlhorn, Kurt
Yap, Chee-Keng
1988Report
Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Mehlhorn, Kurt
Yap, Chee-Keng
[Lepistö, Timo]
[Salomaa, Arto]
1988Proceedings Article
Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Mehlhorn, Kurt
Yap, Chee-Keng
1991Journal Article
Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
El Kahoui, M'hammed2004Journal Article
Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
[Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia
[Abramsky, Samson]
[Gavoille, Cyril]
[Kirchner, Claude]
[Meyer auf der Heide, Friedhelm]
[Spirakis, Paul]
2010Proceedings Article
Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
[Goldberg, Leslie Ann]
[MacKenzie, Philip D.]
[Paterson, Mike]
Srinivasan, Aravind
2000Journal Article
Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Jez, Artur[Esparza, Javier]
[Fraigniaud, Pierre]
[Husfeldt, Thore]
[Koutsoupia, Elias]
2014Proceedings Article
Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Hemmer, Michael
Limbach, Sebastian
[Schömer, Elmar]
2009Proceedings Article
Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Limbach, Sebastian2008Thesis - Masters thesis
Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190
[Chan, Ho-Leung]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Ting, Hing-Fung]
[Marion, Jean-Yves]
[Schwentick, Thomas]
2010Electronic Proceedings Article
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
[Chan, Ho-Leung]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Ting, Hing-Fung]
2012Journal Article
Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Schmidt, Jens M.2013Journal Article
Contractions, Removals and How to Certify 3-Connectivity in Linear TimeSchmidt, Jens M.2013Unpublished/Draft
Attachment IconControlled Perturbation for Delaunay TriangulationsFunke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2006Report
Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2005Proceedings Article
Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Klein, Christian2004Thesis - Masters thesis
Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40
Doerr, Benjamin
Klein, Christian
2006Electronic Journal Article
Attachment IconConvergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464
Bringmann, Karl
Friedrich, Tobias
2012Proceedings Article
Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752
Bringmann, Karl
Friedrich, Tobias
[Krasnogor, Natalio]
[Lanzim, Pier Luca]
2011Proceedings Article
Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo
1987Proceedings Article
Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
[Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki]
[Fischer, Johannes]
[Sanders, Peter]
2013Proceedings Article
Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Kutz, Martin2005Journal Article
Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739
[Chlebus, Bogdan S.]
Kowalski, Dariusz
[Gabow, Harold N.]
[Fagin, Ronald]
2005Proceedings Article
Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
[Goemans, Michel X.]
Skutella, Martin
2004Journal Article
Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
Christodoulou, George
[Koutsoupias, Elias]
[Nanavati, Akash]
2009Journal Article
Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint[Beldiceanu, Nicolas]
[Carlsson, Mats]
Thiel, Sven
2002Report
Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Journal Article
Cost tradeoffs in graph embeddings, with applicationsHong, Jia-Wei
Mehlhorn, Kurt
1982Report
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
Even, Shimon
Kariv, Oded
1981Proceedings Article
Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110
[Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack]
[Demetrescu, Camil]
[Tamassia, Roberto]
[Sedgewick, Robert]
2005Proceedings Article
Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
[Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack]
2006Journal Article
Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
[Kane, Daniel]
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He
[Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger]
2012Proceedings Article
Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
[Alvarez, Victor]
Bringmann, Karl
[Curticapean, Radu]
Ray, Saurabh
[Dey, Tamal K.]
[Whitesides, Sue]
2012Proceedings Article
Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
[Cameron, Peter]
Johannsen, Daniel
[Prellberg, Thomas]
Schweitzer, Pascal
2008Electronic Journal Article
Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
Ray, Saurabh2004Thesis - Masters thesis
Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
[Alvarez, Victor]
Bringmann, Karl
[Ray, Saurabh]
[Seidel, Raimund]
2013Proceedings Article
Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Kumar, V. S. Anil2001Journal Article
Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Kumar, V. S. Anil
[Ramesh, Hariharan]
1999Proceedings Article
Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
[Krivelevich, Michael]
Spöhel, Reto
2012Journal Article
Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
[Gurvich, Vladimir]1991Journal Article
Cross-benchmarks of univariate algebraic kernels[Emiris,Ioannis]
Hemmer, Michael
[Karavelas, Menelaos]
[Limbach, Sebastian]
[Mourrain, Bernard]
[Tsigaridas, Elias]
[Zafeirakopoulos,Zafeirakis]
2008Report
Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243
[Leonardi, Stefano]
Schäfer, Guido
2004Proceedings Article
Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
[Leonardi, Stefano]
Schäfer, Guido
2004Journal Article
Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes
Ziegler, Thomas2000Thesis - PhD thesis
Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Doerr, Benjamin
Happ, Edda
Klein, Christian
[Ryan, Conor]
[Keijzer, Maarten]
2008Proceedings Article
Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Doerr, Benjamin
Happ, Edda
Klein, Christian
2012Journal Article
Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Schmidt, Jens M.
[Valtr, Pavel]
2012Proceedings Article
Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes
Althaus, Ernst2001Thesis - PhD thesis
Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
[Cheng, Siu-Wing]
Funke, Stefan
[Golin, Mordecai J.]
[Kumar, Piyush]
[Poon, Sheung-Hung]
[Ramos, Edgar A.]
2003Proceedings Article
Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
[Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A.
2000Journal Article
Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
[Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A.
1999Proceedings Article
Cycle Bases in Graphs
Universität des Saarlandes
Jurkiewicz, Tomasz2009Thesis - Masters thesis
Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
[Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.]
2009Journal Article
Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
[Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
2007Journal Article
Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes
Portz, Sascha1994Thesis - Masters thesis
Das k-Closest-Pair-Problem
Universität des Saarlandes
von Zülow, Max Henning1994Thesis - Masters thesis
Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Gast, Christoph1997Thesis - Masters thesis
Das planare Augmentierungsproblem
Universität des Saarlandes
Fialko, Sergej1997Thesis - Masters thesis
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
[Krick, Christof]
[Meyer auf der Heide, Friedhelm]
[Räcke, Harald]
Vöcking, Berthold
[Westermann, Matthias]
2003Journal Article
Attachment IconData structuresMehlhorn, Kurt
Tsakalidis, Athanasios K.
1989Report
Data Structures
In: Handbook of Theoretical Computer Science, 301-341
Mehlhorn, Kurt
Tsakalidis, A.
van Leeuwen, Jan1990Part of a Book
Data structures and algorithms. Volume 1 : Sorting and searchingMehlhorn, KurtBrauer, Wilfried
Rozenberg, Grzegorz
Salomaa, Arto
1984Book
Data structures and algorithms. Volume 2 : Graph algorithms and NP-completenessMehlhorn, KurtBrauer, Wilfried
Rozenberg, Grzegorz
Salomaa, Arto
1984Book
Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryMehlhorn, KurtBrauer, Wilfried
Rozenberg, Grzegorz
Salomaa, Arto
1984Book
Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenMehlhorn, Kurt1988Book
Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenMehlhorn, Kurt1986Book
Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
[Han, Xin]
[Lam, Tak-Wah]
Lee, Lap-Kei
[To, Isaac K. K.]
[Wong, Prudence W. H.]
2010Journal Article
Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
El Kahoui, M'hammed2000Journal Article
Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
Megow, Nicole
[Möhring, Rolf H.]
[Schulz, Jens]
2011Journal Article
Decision trees: old and new results
In: Information and computation [152], 44-61
Fleischer, Rudolf1999Journal Article
Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
[Soranzo, Nicola]
Ramezani, Fahimeh
[Iacono, Giovanni]
[Altafini, Claudio]
2012Journal Article
Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
2011Electronic Journal Article
Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
2012Journal Article
Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza]
[Hurtado, Ferran]
[van Krefeld, Marc]
2011Proceedings Article
Deferred Data Structuring
Universität des Saarlandes
Reinert, Knut1994Thesis - Masters thesis
Definition of file format for benchmark instances for arrangements of QuadricsBerberich, Eric
Ebert, Franziska
Kettner, Lutz
2006Report
Definition of the 3D Quadrical Kernel ContentBerberich, Eric
[Hemmer, Michael]
2007Report
Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42
Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket]
[Bampis, Evripidis]
[Skutella, Martin]
2009Proceedings Article
Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Giesen, Joachim2008Journal Article
Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82
[Croitoru, Cosmina]
Kötzing, Timo
[Kersting, Kristian]
[Toussaint, Marc]
2012Proceedings Article
Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus
[Müller-Hannemann, Matthias]
[Werneck, Renato]
2011Proceedings Article
Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Hariharan, Ramesh
Mahajan, Sanjeev
1995Proceedings Article
Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms
Universität des Saarlandes
Meyer, Ulrich2002Thesis - PhD thesis
Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes
Finkler, Ulrich1997Thesis - PhD thesis
Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes
Gutwenger, Carsten1999Thesis - Masters thesis
Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes
Lauer, Thorsten1998Thesis - Masters thesis
Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Hoefer, Martin
[Wagner, Lisa]
[Chen, Yiling]
[Immorlica, Nicole]
2013Proceedings Article
Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes
Ajwani, Deepak2005Thesis - Masters thesis
Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
[Bodirsky, Manuel]
Kutz, Martin
2007Journal Article
Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
[Iacono, G.]
Ramezani, Fahimeh
[Soranzo, N.]
[Altafani, C.]
2010Journal Article
Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299
Ramos, Edgar A.2000Proceedings Article
Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S.
1997Journal Article
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319
[Kao, Ming-Yang]
[Leung, Henry C. M.]
Sun, He
[Zhang, Yong]
[Kratchovil, Jan]
[Li, Angsheng]
[Fiala, Jiri]
[Kolman, Petr]
2010Proceedings Article
Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor]
[Raman, Rajeev]
[Sedgewick, Robert]
[Stallmann, Matthias F.]
2006Proceedings Article
Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Friedrich, Tobias2005Thesis - Masters thesis
Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
[Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel]
2007Journal Article
Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
[Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel]
2008Proceedings Article
Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
[Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel]
2010Journal Article
Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor]
[Felsner, Stefan]2005Proceedings Article
Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor]
2007Journal Article
Deterministic Random Walks on the Integers
In: ??? [?], 1-27
[Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor]
2006Miscellaneous
Attachment IconDeterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483
Doerr, Benjamin
Friedrich, Tobias
[Asano, Tetsuo]2006Proceedings Article
Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
Doerr, Benjamin
Friedrich, Tobias
2009Journal Article
Deterministic rendezvous in graphs[Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej]
2006Unpublished/Draft
Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
[Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej]
2006Journal Article
Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36
Chaudhuri, Shiva
[Radhakrishnan, Jaikumar]
1996Proceedings Article
Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
van Zuylen, Anke2011Journal Article
Deterministic simulation of idealized parallel computers on more realistic onesAlt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1985Report
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
Gruska, Jozef
Rovan, Branislav
Wiedermann, Juraj
1986Proceedings Article
Attachment IconDeterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15
Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P.
Albrecht, Andreas
Jung, Hermann
Mehlhorn, Kurt
1987Proceedings Article
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Journal Article
Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Meyer, Ulrich1995Thesis - Masters thesis
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Friedrich, Tobias
Sauerwald, Thomas
[Stauffer, Alexandre]
[Asano, Takao]
[Nakano, Shin-Ichi]
[Okamoto, Yoshio]
[Watanabe, Osamu]
2011Proceedings Article
Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
[Cai, Jin-Yi]
[Lu, Pinyan]
Xia, Mingji
2013Proceedings Article
Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Humble, Monika1997Thesis - Masters thesis
Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Kasan, Binaman1995Thesis - Masters thesis
Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes
Jung, Karin1996Thesis - Masters thesis
Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),
[Clementi, Andrea]
[Crescenzi, Pierluigi]
Doerr, Carola
[Fraigniaud, Pierre]
[Pasquale, Francesco]
[Silvestri, Riccardo]
2013Proceedings Article
Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116
Bast, HolgerBabaoglu, Ozalp
[Jelasity, Márk]
[Montresor, Alberto]
[van Steen, Maarten]
[van Moorsel, Aad]
[Fetzer, Christof]
[Leonardi, Stefano]
2004Proceedings Article
Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Doerr, Benjamin
Happ, Edda
2008Proceedings Article
Direction-Reversing Quasi-Random Rumor Spreading with RestartsWinzen, Carola2011Unpublished/Draft
Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Winzen, Carola2013Journal Article
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120
Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin]
[Ackermann, Markus]
[Berendt, Bettina]
[Grobelnik, Marko]
[Hotho, Andreas]
[Mladenic, Dunja]
[Semeraro, Giovanni]
[Spiliopoulou, Myra]
[Stumme, Gerd]
[Svatek, Vojtech]
[van Someren, Maarten W.]
2006Proceedings Article
Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev
Afrati, Foto
Kolaitis, Photokion
1997Proceedings Article
Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk]
[Bonizzoni, Paola]
[Brattka, Vasco]
[Lowe, Benedikt]
2013Proceedings Article
Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Cilleruelo, Javier
Hebbinghaus, Nils
2009Journal Article
Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
Doerr, Benjamin
Hebbinghaus, Nils
[Felsner, Stefan]2005Proceedings Article
Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsHebbinghaus, Nils2007Report
Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
2006Electronic Journal Article
Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
[Müller, Tobias]
Perez-Gimenez, Xavier
[Wormald, Nicholas]
2011Journal Article
Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu]
[Gibbons, Phillip B.]
[Abdelzaher, Tarek F.]
[Aspnes, James]
[Rao, Ramesh]
2006Proceedings Article
Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Lennerz, Christian2005Thesis - PhD thesis
Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael]
[Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiri]
2011Proceedings Article
Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas
1996Proceedings Article
Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
[Berenbrink, Petra]
[Hoefer, Martin]
Sauerwald, Thomas
[Randall, Dana]2011Proceedings Article
Distribution of spanning regular subgraphs in random graphsGao, Pu (Jane)2011Unpublished/Draft
Distribution of the number of spanning regular subgraphs in random graphsP. Gao2012Unpublished/Draft
Distributions of sparse spanning subgraphs in random graphsP. Gao2012Unpublished/Draft
Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
[Heydrich, Sandy]
van Stee, Rob
[Voecking, Berthold]2013Proceedings Article
Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Heydrich, Sandy
[van Stee, Rob]
2015Journal Article
Dividing connected chores fairly
Universität des Saarlandes
Heydrich, Sandy2012Thesis - Bachelor thesis
Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Kerber, Michael2009Journal Article
Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
[Brockhoff, Dimo]
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart]
[Dirk Thierens]2007Proceedings Article
Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
[Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.]
2009Electronic Journal Article
Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
[Cygan, Marek]
Philip, Geevarghese
[Pilipczuk, Marcin]
[Pilipczuk, Micha\l{}]
[Wojtaszczyk, Jakub Onufry]
2011Journal Article
Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.]
[Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiri]
2011Proceedings Article
Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112
[Bringmann, Karl]
[Friedrich, Tobias]
[Jansen, Thomas]
[Garibay, Ivan]
[Paul, Wiegand R.]
[Wu, Annie S.]
2009Proceedings Article
Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
Bast, Holger
Weber, Ingmar
Nikoletseas, Sotiris2005Proceedings Article
Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
[Biedl, Therese]
[Kaufmann, Michael]
Mutzel, Petra
[Hromkovic, J.]
[Sykora, O.]
1998Proceedings Article
Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320
Doerr, Benjamin[Krasnogor, Natalio]
[Lanzi, Pier Luca]
2011Proceedings Article
Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2010Proceedings Article
Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Doerr, Benjamin
[Goldberg, Leslie Ann]
[Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter]
2010Proceedings Article
Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2002Journal Article
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2007Journal Article
Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756
Megow, Nicole
[Verschae, Jose]
2013Proceedings Article
Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
Meyer auf der Heide, Friedhelm2001Proceedings Article
Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
[Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott]
2005Journal Article
Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Hagerup, Torben2000Journal Article
Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Hagerup, Torben[Degano, Pierpaolo]
[Gorrieri, Roberto]
[Marchetti-Spaccamela, Alberto]
1997Proceedings Article
Dynamic Binary SearchMehlhorn, Kurt1976Report
Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
Mehlhorn, KurtSalomaa, Arto
Steinby, Magnus
1977Proceedings Article
Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Mehlhorn, Kurt1979Journal Article
Dynamic Binary Search Trees : Extended AbstractsMehlhorn, Kurt1976Report
Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
Mehlhorn, Kurt1979Journal Article
Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M.
1990Journal Article
Dynamic fractional cascadingMehlhorn, Kurt
Näher, Stefan
1986Report
Attachment IconDynamic Fractional Cascading
In: Algorithmica [5], 215-241
Mehlhorn, Kurt
Näher, Stefan
1990Journal Article
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Katriel, Irit[Régin, Jean-Charles]
[Rueher, Michel]
2004Proceedings Article
Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
Mehlhorn, Kurt
Tsakalidis, Athanasios K.
Brauer, Wilfried1985Proceedings Article
Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Mehlhorn, Kurt
Tsakalidis, Athanasios K.
1993Journal Article
Dynamic Perfect Hashing: Upper and Lower BoundsDietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1991Report
Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1988Proceedings Article
Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
[Dietzfelbinger, Martin]
[Karlin, Anna]
Mehlhorn, Kurt
[Meyer Auf Der Heide, Friedhelm]
[Rohnert, Hans]
[Tarjan, Robert E.]
1994Journal Article
Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
Frederickson, Grag
Graham, Ron
Hochbaum, Dorit S.
Johnson, Ellis
Kosaraju, S. Rao
Luby, Michae
Megiddo, Nimrod
Schieber, Baruch
Vaidya, Pravin
Yao, Frances
1992Proceedings Article
Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1994Journal Article
Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Smid, Michiel1995Journal Article
Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191
Bast, Hannah1998Proceedings Article
Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Hachenberger, Peter1999Thesis - Masters thesis
Dynamization of geometric data structuresFries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Report
Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Proceedings Article
Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Rauf, Imran2005Thesis - Masters thesis
Attachment IconEdge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
Doerr, Benjamin
[Johannsen, Daniel]
[Pelikan, Martin]
[Branke, Jürgen]
2010Proceedings Article
Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
[Cole, Richard]
[Ost, Kirstin]
Schirra, Stefan
2001Journal Article
Editorial
In: Algorithmica [57], 119-120
Doerr, Benjamin
Neumann, Frank
[Wegener, Ingo]
2010Journal Article
Editorial
In: Computational Geometry [12], 153-154
Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
1999Journal Article
Editorial
In: Computational Geometry [17], 1-2
Mehlhorn, Kurt
[Sack, Jörg-Rüdiger]
2000Journal Article
Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
[Jansen, Thomas]
Neumann, Frank
2010Journal Article
Effects of a Modular Filter on Geometric Applications[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
2004Report
Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288
Telikepalli, Kavitha[Pandya, Paritosh]
[Radhakrishnan, Jaikumar]
2003Proceedings Article
Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
Thiel, Sven2004Thesis - PhD thesis
Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
1999Journal Article
Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176
Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch
2012Proceedings Article
Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech]
[Karlsson, Rolf]
[Lingas, Andrzej]
1996Proceedings Article
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Gidenstam, Anders
[Papatriantafilou, Marina]
[Sundell, Håkan]
[Tsigas, Philippas]
2009Journal Article
Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
Krysta, Piotr
[Lorys, Krzysztof]
[Nesetril, Jaroslav]1999Proceedings Article
Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130
[Duncan, C.A.]
[Goodrich, Michael T.]
Ramos, Edgar A.
1997Proceedings Article
Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
[Bradonjić, Milan]
[Elsässer, Robert]
Friedrich, Tobias
[Sauerwald, Thomas]
[Stauffer, Alexandre]
[Charikar, Moses]2010Proceedings Article
Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
[Lee, Kunwoo]
[Patrikalakis, Nicholas M.]
2002Proceedings Article
Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
[Schömer, Elmar]
Thiel, Christian
1995Proceedings Article
Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16
Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos
1997Journal Article
Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54
Arya, Sunil
Smid, Michiel
1997Journal Article
Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Lennerz, Christian
Schömer, Elmar
[Hiromasa, Suzuki]
[Ralph, Martin]
2002Proceedings Article
Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
1999Proceedings Article
Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
[Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander]
[Fich, Faith]2003Proceedings Article
Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
[Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander]
2005Journal Article
Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
[Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.]
[van Dyk, David]
[Welling, Max]
2009Electronic Proceedings Article
Attachment IconEfficient Index-Based Snippet GenerationCelikik, Marjan
Bast, Holger
Manolache, Gabriel
2011Unpublished/Draft
Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
Weber, Ingmar2007Thesis - PhD thesis
Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar
[Mário J. Silva]
[Alberto H. F. Laender]
[Ricardo A. Baeza-Yates]
[Deborah L. McGuinness]
[Bj{\o}rn Olstad]
[{\O}ystein Haug Olsen]
[André O. Falc{\~a}o]
2007Proceedings Article
Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764
Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch
Baumbach, Jan
2012Journal Article
Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490
Bradford, Phillip Gnassi
[Rawlins, Gregory J.E.]
[Shannon, Greogory E.]
1998Journal Article
Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Pyrga, Evangelia
[Schulz, Frank]
[Wagner, Dorothea]
[Zaroliagis, Christos]
2007Journal Article
Attachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Emeliyanenko, Pavel[Dou, Yong]
[Gruber, Ralf]
[Joller, Josef]
2009Proceedings Article
Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Gasieniec, Leszek
[Indyk, Piotr]
Chlebus, Bogdan S.
Czaja, Ludwik
1997Proceedings Article
Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Jurkiewicz, Tomasz
Danilewski, Piotr
2011Unpublished/Draft
Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
[Kerber, Michael]
Sagraloff, Michael
[Leykin, Anton]2011Proceedings Article
Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
[Fekete, Sándor P.]
[Fiethe, Björn]
[Friedrichs, Stephan]
[Michalik, Harald]
[Orlis, Christos]
2014Proceedings Article
Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
Bringmann, Karl
[Panagiotou, Konstantinos]
[Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger]
2012Proceedings Article
Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Fatourou, Panagiota
[Spirakis, Paul G.]
2000Journal Article
Effiziente AlgorithmenMehlhorn, Kurt1977Book
Effiziente Algorithmen - TagungsberichtMehlhorn, Kurt
Trajan, Robert E.
1991Proceedings
Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Schilz, Thomas2000Thesis - PhD thesis
Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes
Thiel, Christian1996Thesis - PhD thesis
Effiziente Algorithmen: Ein BeispielMehlhorn, Kurt1978Report
Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
Mehlhorn, Kurt1978Journal Article
Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes
Baraque, Raef2002Thesis - Masters thesis
Effiziente parallele Algorithmen
Universität des Saarlandes
Sibeyn, Jop F.1999Thesis - Habilitation thesis
Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes
Emminghaus, Frank1995Thesis - Masters thesis
Effiziente und Online-Algorithmen
Universität des Saarlandes
Fleischer, Rudolf1999Thesis - Habilitation thesis
Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Klauk, Mathias2004Thesis - Masters thesis
Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes
Lutter, Stefan1996Thesis - Masters thesis
Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere
Universität des Saarlandes
Müller, Peter1995Thesis - Masters thesis
Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes
Rau, Stephan1997Thesis - Masters thesis
Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes
Wahl, Michaela2000Thesis - Masters thesis
Ein NP-schweres Plazierungsproblem
Universität des Saarlandes
Schwarzenecker, Erik1995Thesis - PhD thesis
Ein Parametric Search Toolkit
Universität des Saarlandes
Lambert, Georg2001Thesis - Masters thesis
Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes
Stormer, Henrik1998Thesis - Masters thesis
Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Sabo, Holger1999Thesis - Masters thesis
Ein Simulator für Prozessornetzwerke
Universität des Saarlandes
Müller, Matthias1998Thesis - Masters thesis
Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes
Leinenbach, Stefan1997Thesis - Masters thesis
Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes
Beier, Rene2000Thesis - Masters thesis
Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Kettner, Björn1998Thesis - Masters thesis
Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Seel, Michael1994Thesis - Masters thesis
Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Kappel, Holger1998Thesis - Masters thesis
Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes
Boullay, Johannes1996Thesis - Masters thesis
Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Katriel, Irit
Meyer, Ulrich
Meyer, Ulrich
Sanders, Peter
Sibeyn, Jop F.
2003Part of a Book
Elliptic Curves : A Computational ApproachSchmitt, Susanne
[Zimmer, Horst G.]
2003Book
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
[Cooley, Oliver]
[Fountoulakis, Nikolaos]
[Kühn, Daniela]
[Osthus, Deryk]
2009Journal Article
Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2008Journal Article
Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2005Proceedings Article
Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Beier, Rene
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
2011Journal Article
Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
[Friedrichs, Stephan]
[Kulau, Ulf]
[Wolf, Lars]
2014Proceedings Article
Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
Kesselman, Alexander
Kowalski, Dariusz
[Segal, Michael]
2005Journal Article
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Beier, Rene
Sanders, Peter
Sivadasan, Naveen
[Widmayer, Peter]
[Triguero, Francisco]
[Morales, Rafael]
[Hennessy, Matthew]
[Eidenbenz, Stephan]
[Conejo, Ricardo]
2002Proceedings Article
Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter
[Arge, Lars]
[Italiano, Giuseppe F.]
[Sedgewick, Robert]
2004Proceedings Article
Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.]
[Lévy,Jean-Jacques]
[Mayr, Ernst W.]
[Mitchell, John C.]
2004Proceedings Article
Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Karrenbauer, Andreas2007Thesis - PhD thesis
Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
[Jain, Sanjay]
Kötzing, Timo
[Stephan, Frank]
[Bshouty, Nader]
[Stoltz, Gilles]
[Vayatis, Nicolas]
[Zeugmann, Thomas]
2012Proceedings Article
Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Farzan, Arash
[Gagie, Travis]
[Navarro, Gonzalo]
[Cheong, Otfried]
[Chwa, Kyung-Yong]
[Park, Kunsoo]
2010Proceedings Article
Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes
Srivastava, Satanand1996Thesis - Masters thesis
Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes
Braun, Sebastian2000Thesis - Masters thesis
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2007Journal Article
Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
Bienstock, Daniel
Nemhauser, George
2004Proceedings Article
Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Elbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh
[Collette, Sebastien]2011Electronic Proceedings Article
Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Azar, Yossi]
[Erlebach, Thomas]
2006Proceedings Article
Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Lenhof, Hans-Peter
Smid, Michiel
1992Proceedings Article
Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Elmasry, Amr
Manjunath, Madhusudan
Asano, Tetsuo2009Proceedings Article
Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
[Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha
[Apostolico, Alberto]
[Hein, Jotun]
1997Proceedings Article
Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
[Bhaskar, Umang]
[Fleischer, Lisa]
[Hoy, Darrell]
Huang, Chien-Chung
[Mathieu, Claire]2009Proceedings Article
Ergebnisüberprüfung bei Graphenalgorithmen
Universität des Saarlandes
Metzler, Matthias1997Thesis - Masters thesis
Attachment IconError Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
Doerr, Benjamin
[Lorenz, Ulf]
2006Journal Article
Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes
Thome, Stefan2000Thesis - Masters thesis
Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Wilhelmi, Harald1995Thesis - Masters thesis
Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x
Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa
2008Journal Article
ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar
[Clarke, Charlie]
[Fuhr, Norbert]
[Kando, Noriko]
2007Proceedings Article
Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498
Arya, Sunil
[Das, Gautam]
[Mount, David M.]
[Salowe, Jeffrey S.]
Smid, Michiel
1995Proceedings Article
Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes
Caroli, Manuel2007Thesis - Masters thesis
Evaluation of different approaches in 3D curved kernel for arrangements of quadricsHemmer, Michael2008Report
Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2013Journal Article
Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2012Unpublished/Draft
Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Doerr, Benjamin
[Eremeev, Anton]
[Horoba, Christian]
Neumann, Frank
[Theile, Madeleine]
[Raidl, Günther]
[Rothlauf, Frank]
2009Proceedings Article
Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Doerr, Benjamin
[Eremeev, Anton]
Neumann, Frank
[Theile, Madeleine]
[Thyssen, Christian]
2011Journal Article
Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Ingalalli, Vijay2011Thesis - Masters thesis
Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E.
1993Proceedings Article
Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
Eigenwillig, Arno
Kerber, Michael
2008Proceedings Article
Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278
Bringmann, Karl
[Friedrich, Tobias]
[Fomin, Fedor V.]
[Freivalds, Rūsiņš]
[Kwiatkowska, Marta]
[Peleg, David]
2013Proceedings Article
Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), -
[Jünger, Michael]
Mutzel, Petra
[Brandenburg, Franz]1996Proceedings Article
Exact Arithmetic using Cascaded Computation
Universität des Saarlandes
Funke, Stefan1997Thesis - Masters thesis
Attachment IconExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
Eigenwillig, Arno2003Thesis - Masters thesis
Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes
Berberich, Eric2004Thesis - Masters thesis
Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Berberich, Eric
Kerber, Michael
[Haines, Eric]
[McGuire, Morgan]
2008Proceedings Article
Exact Computation of Arrangements of Rotated ConicsBerberich, Eric
Caroli, Manuel
[Wolpert, Nicola]
2007Report
Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola]
2007Proceedings Article
Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Hemmer, Michael2008Thesis - PhD thesis
Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes
Burnikel, Christoph1996Thesis - PhD thesis
Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Mehlhorn, Kurt
Schirra, Stefan
[Alefeld, Götz]
[Rohn, Jiri]
Rump, Siegfried M.
[Yamamoto, Tetsuro]
2001Part of a Book
Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
[Teillaud, Monique]
[Welzl, Emo]
2008Proceedings Article
Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87
Mehlhorn, Kurt[Lipitakis, Elias A.]2002Proceedings Article
Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian
1995Proceedings Article
Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266
Burnikel, Christoph
Funke, Stefan
Seel, Michael
2001Journal Article
Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183
Burnikel, Christoph
Funke, Stefan
Seel, Michael
1998Proceedings Article
Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
[DeSimone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni]
1995Journal Article
Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
[De Simone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni]
1996Journal Article
Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes
Pohl, Sebastian2006Thesis - Masters thesis
Exact Linear Programming
Universität des Saarlandes
Kwappik, Carsten1998Thesis - Masters thesis
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2012Electronic Journal Article
Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2013Journal Article
Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola
2006Journal Article
EXACUS: Efficient and Exact Algorithms for Curves and SurfacesBerberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola
2004Report
Attachment IconEXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166
Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola
[Brodal, Gerth S.]
[Leonardi, Stefano]
2005Proceedings Article
Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes
Caroli, Manuel2006Thesis - Bachelor thesis
Exaktes geometrisches RechnenSagraloff, Michael2012Miscellaneous
Exaktes Lösen von Linearen Programmen
Universität des Saarlandes
Schulte, Ralph2001Thesis - Masters thesis
Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
Neumann, Frank2008Journal Article
Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Mehlhorn, Kurt[Akl, Selim G.]
[Dehne, Frank]
[Sack, Jörg-Rüdiger]
[Santoro, Nicola]
1995Proceedings Article
Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173
Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias]
[Even, Guy]
[Rawitz, Dror]
2012Proceedings Article
Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Hoefer, Martin[Jansen, Klaus]
[Margraf, Marian]
[Mastrolli, Monaldo]
[Rolim, José D. P.]
2003Proceedings Article
Attachment IconExperimental evaluation and cross-benchmarking of univariate real solvers[Emiris, Ioannis Z.]
Hemmer, Michael
[Karavelas, Menelaos]
[Mourrain, Bernard]
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
2008Report
Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Hemmer, Michael
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
[Emiris, Ioannis Z.]
[Karavelas, Menelaos I.]
[Mourrain, Bernard]
2009Proceedings Article
Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Berberich, Eric
[Hagen, Matthias]
[Hiller, Benjamin]
[Moser, Hannes]
[Müller-Hannemann, Matthias]
[Schirra, Stefan]
2010Part of a Book
Attachment IconExperiments on curve reconstruction
In: Proceedings of 2nd Workshop on Algorithm Engineering and Experiments (ALENEX-00), 103-114
Althaus, Ernst
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
2000Electronic Proceedings Article
Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Kowalski, Dariusz
[Musial, Peter M.]
[Shvartsman, Alexander]
2005Proceedings Article
Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Kursawe, Klaus1998Thesis - Masters thesis
Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Albers, Susanne
[Henzinger, Monika R.]
1997Proceedings Article
Exploring unknown environments with obstacles
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 842-843
Albers, Susanne
Kursawe, Klaus
1999Proceedings Article
Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
[Albers, Susanne]
Kursawe, Klaus
[Schuierer, Sven]
2002Journal Article
Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning]
2013Journal Article
Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning]
[Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila]
2011Electronic Proceedings Article
Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
Polzin, Tobias
[Vahdati Daneshmand, Siavash]
[Möhring, Rolf]
[Raman, Rajeev]
2002Proceedings Article
Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
2003Journal Article
Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
Mehlhorn, Kurt
Meyer, Ulrich
[Möhring, Rolf]
[Raman, Rajeev]
2002Proceedings Article
External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
[Chian, Yi-Feng]
[Goodrich, Michael T.]
Grove, Edward
[Tamassia, Roberto]
[Vengroff, Darren Erik]
[Vitter, Jeffrey Scott]
1995Proceedings Article
External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr
Apostolico, Alberto
Hein, Jotun
1997Proceedings Article
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
[Arge, Lars]
Meyer, Ulrich
[Toma, Laura]
[Diaz, Josep]
[Karhumäki, Juhani]
[Lepistö, Arto]
[Sannella, Donald]
2004Proceedings Article
External Memory BFS on Undirected Graphs with Bounded Degree
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 87-88
Meyer, Ulrich2001Proceedings Article
External Memory Suffix Array Construction
Universität des Saarlandes
Mehnert, Jens2004Thesis - Masters thesis
External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
Sibeyn, Jop F.[Meinel, Christoph]
[Tison, Sophie]
1999Proceedings Article
Externe Prioritätswarteschlangen
Universität des Saarlandes
Brengel, Klaus2000Thesis - Masters thesis
Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika
Bellobás, Béla
Thomason, Andrew
1997Part of a Book
Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
[Brightwell, Graham]
Panagiotou, Konstantinos
[Steger, Angelika]
2012Journal Article
Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
[Fekete, Sándor P.]
[Friedrichs, Stephan]
[Kröller, Alexander]
[Schmidt, Christiane]
[Du, Ding-Zhu]
[Zhang, Guochuan]
2013Proceedings Article
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
[Golumbic, Martin Charles]
[Mintz, Aviad]
[Rotics, Udi]
2006Journal Article
Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
1996Journal Article
Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
[Djidjev, Hristo N.]
[Pantziou, Grammati E.]
Zaroliagis, Christos
[Reichel, Horst]1995Proceedings Article
Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Kovács, Annamária2007Thesis - PhD thesis
Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
[Althaus, Ernst]
[Dumitriu, Daniel]
[Vahrenhold, Jan]2009Proceedings Article
Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Eigenwillig, Arno
Kerber, Michael
[Wolpert, Nicola]
[Brown, Christopher W.]2007Proceedings Article
Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Schultes, Dominik2005Thesis - Masters thesis
Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
Bast, Holger
Hagerup, Torben
1991Proceedings Article
Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Kobel, Alexander
Sagraloff, Michael
2013Electronic Journal Article
Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451
Katriel, Irit
Thiel, Sven
[Rossi, Francesca]2003Proceedings Article
Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes
Könemann, Jochen1997Thesis - Masters thesis
Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Sanders, Peter
[Egner, Sebastian]
[Korst, Jan]
2000Proceedings Article
Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Hagerup, Torben1995Journal Article
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124
Kesselman, Alexander
Kowalski, Dariusz
2005Proceedings Article
Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
Celikik, Marjan
Bast, Holger
[Shin, Dongwan]2009Proceedings Article
Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Hagerup, Torben
[Kutylowski, Miroslaw]
1997Journal Article
Attachment IconFast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69
Burkhardt, Stefan
Kärkkäinen, Juha
Baeza-Yates, R.
Chávez, E.
Crochemore, M.
2003Proceedings Article
Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Kovács, Annamária[Brodal, Gerth S.]
[Leonardi, Stefano]
2005Proceedings Article
Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Hagerup, Torben
[Keller, Jörg]
1995Journal Article
Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes
Bast, Hannah1994Thesis - Masters thesis
Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Bast, Hannah
Hagerup, Torben
1995Journal Article
Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Sanders, Peter2000Electronic Journal Article
Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Sanders, Peter[Goodrich, Michael T.]
McGeoch, Catherine C.
1999Proceedings Article
Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik]
2007Journal Article
Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
[Juurlink, Ben]
Sibeyn, Jop F.
1995Proceedings Article
Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
Celikik, Marjan
Bast, Hannah
[Karlgren, Jussi]
[Tarhio, Jorma]
[Hyyrö, Heikki]
2009Proceedings Article
Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Hertel, Stefan
Mehlhorn, Kurt
Karpinski, Marek1983Proceedings Article
Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Hertel, Stefan
Mehlhorn, Kurt
1985Journal Article
Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Gawrychowski, Pawel[Calderón-Benavides, Liliana]
[González-Caro, Cristina N.]
[Chávez, Edgar]
[Ziviani, Nivio]
2012Proceedings Article
Attachment IconFaster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319
Mehlhorn, Kurt
Thiel, Sven
[Dechter, Rina]2000Proceedings Article
Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Mehlhorn, Kurt
Ray, Saurabh
2010Journal Article
Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
[Brodal, Gerth Stølting]
Kaligosi, Kanela
[Katriel, Irit]
Kutz, Martin
[Moshe, Lewenstein]
[Gabriel, Valiente]
2006Proceedings Article
Faster Algorithms for the Shortest Path ProblemAhuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Report
Faster Algorithms for the Shortest Path ProblemAhuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Report
Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1990Journal Article
Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
[Lehre, Per Christian]
Wagner, Markus
Winzen, Carola
[Beyer, Hans- Georg]
[Langdon, William]
2011Proceedings Article
Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83
[Berenbrink, Petra]
[Friedetzky, Tom]
[Elsaesser, Robert]
[Nagel, Lars]
Sauerwald, Thomas
[Murlak, Filip]
[Sankowski, Piotr]
2011Proceedings Article
Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Mehlhorn, Kurt
[Kavitha, T.]
[Hariharan, R.]
2008Journal Article
Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
Doerr, Benjamin
Klein, Christian
[Storch, Tobias]
2007Proceedings Article
Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Fountoulakis, Nikolaos
[Reed, Bruce]
2007Journal Article
Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas
Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam2013Proceedings Article
Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
[Bonifaci, Vincenzo]
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian]
Wiese, Andreas
2013Proceedings Article
Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
2012Journal Article
Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[de Berg, Mark]
[Meyer, Ulrich]
2010Proceedings Article
Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Sanders, Peter
[Vollmar, R.]
[Worsch, T.]
2002Journal Article
Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Weinand, Caroline2005Thesis - Masters thesis
Filter Algorithms for Approximate String Matching
Universität des Saarlandes
Burkhardt, Stefan2002Thesis - PhD thesis
Attachment IconFiltering algorithms for the Same and UsedBy constraintsBeldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Report
Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
[Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven
2007Journal Article
Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
[Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven
[Régin, Jean-Charles]
[Rueher, Michel]
2004Proceedings Article
Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Elbassioni, Khaled M.[Correa, José R.]
[Hevia, Alejandro]
[Kiwi, Marcos A.]
2006Proceedings Article
Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
[Diekert, Volker]
Jez, Artur
[Plandowski, Wojciech]
[Hirsch, Edward]
[Kuznetsov, Sergei]
[Pin, Jean-Eric]
[Vereshchagin, Nikolai]
2014Proceedings Article
Finding cliques in scale-free networks
Universität des Saarlandes
Krohmer, Anton2012Thesis - Masters thesis
Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14
Chong, Ka Wong1996Proceedings Article
Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Proceedings Article
Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105
Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Proceedings Article
Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Gawrychowski, Pawel
[Manea, Florin]
[Mercas, Robert]
[Nowotka, Dirk]
[Tiseanu, Catalin]
[Portier, Natacha]
[Wilke, Thomas]
2013Proceedings Article
Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Elbassioni, Khaled
Elmasry, Amr
[Makino, Kazuhisa]
2011Journal Article
Finger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549
Brodal, Gerth Stølting1998Proceedings Article
Attachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
Philip, Geevarghese2008Thesis - Masters thesis
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300
Kratsch, Stefan
Neumann, Frank
[Raidl, Günther]
[Rothlauf, Franz]
2009Proceedings Article
Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus
[Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger]
2012Proceedings Article
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
Kratsch, Stefan
[Lehre, Per Kristian]
[Neumann, Frank]
[Oliveto, Pietro Simone]
[Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter]
2010Proceedings Article
Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Thorup, Mikkel2000Journal Article
Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Martens, Maren
Skutella, Martin
[Albers, Susanne]
Radzik, Tomasz
2004Proceedings Article
Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Klein, Karsten2000Thesis - Masters thesis
Foundations of Programming LanguagesLoeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard
1989Book
Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1993Journal Article
Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
Finkel, Alain
Jantzen, Matthias
1992Proceedings Article
Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
Lengauer, Thomas
Mehlhorn, Kurt
1984Journal Article
Four results on the complexity of VLSI computationsLengauer, Thomas
Mehlhorn, Kurt
1983Report
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
2012Journal Article
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
[Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath]
[Rahman, Md. Saidur]
[Fujita, Satoshi]
2010Proceedings Article
Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
[Anshelevich, Elliot]
[Bhardwaj, Onkar]
Hoefer, Martin
[Bodlaender, Hans]
[Italiano, Giuseppe]
2013Proceedings Article
Attachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
Mehlhorn, KurtWilhelm, Reinhard2001Part of a Book
From Algorithms to Working Programs on the Use of Program Checking in LEDA
In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, 81-88
Mehlhorn, Kurt
Näher, Stefan
Mehlhorn, Kurt1998Proceedings Article
Attachment IconFrom Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93
Mehlhorn, Kurt
Näher, Stefan
[Brim, Lubos]
[Gruska, Jozef]
Zlatuska, Jirí
1998Proceedings Article
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming
2013Electronic Journal Article
Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Kärkkäinen, Juha
[Rao, S. Srinivasa]
Meyer, Ulrich
Sanders, Peter
[Sibeyn, Jop F.]
2003Part of a Book
FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Fleischer, Rudolf[Lodi, Elena]
[Pagli, Linda]
[Santoro, Nicola]
1999Proceedings Article
Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer CongressMehlhorn, Kurt1998Proceedings
Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel
1995Journal Article
Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Mehlhorn, Kurt
[Meiser, Stefan]
[Rasch, Ronald]
2001Journal Article
Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Rasch, Ronald1994Thesis - PhD thesis
GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11
[Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven
[Faltings, Boi]
[Petcu, Adrian]
[Fages, Francois]
[Rossi, Francesca]
2005Proceedings Article
GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation[Thierens, Dirk]
[Beyer, Hans-Georg]
[Bongard, Joshua]
[Branke, Juergen]
[Clark, John]
[Cliff, Dave]
[Congdon, Clare]
[Deb, Kalyanmoy]
Doerr, Benjamin
[Kovacs, Tim]
[Kumar, Sanjeev]
[Miller, Julian]
[Moore, Jason]
Neumann, Frank
[Pelikan, Martin]
[Poli, Ricardo]
[Sastry, Kumara]
[Stanley, Ken]
[Stützle, Thomas]
[Watson, Richard]
[Wegener, Ingo]
2007Proceedings
GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation[Keizer, Marten]
[Antoniol, Giulio]
[Congdon, Clare]
[Deb, Kalyanmoy]
Doerr, Benjamin
[Hansen, Nikolaus]
[Holmes, John]
[Hornby, Gergory]
[Howard, Daniel]
[Kennedy, John]
[Kumar, Sanjeev]
[Lobo, Ferdinando]
[Miller, Julian]
[Moore, Jason]
Neumann, Frank
[Pelikan, Martin]
[Pollack, Jordan]
[Sastry, Kumara]
[Stanley, Ken]
[Stoica, Adrian]
[Talbi, El Ghazli]
[Wegener, Ingo]
2008Proceedings
GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.[Raidl, Günther R.]
[Alba, Enrique]
[Bacardit, Jaume]
[Beyer, Hans-Georg]
[Birattari, Mauro]
[Blum, Christian]
[Bosman, Peter A.N.]
[Congdon, Clare B.]
[Corne, David W.]
[Cotta, Carlos]
[Di Penta, Massimiliano]
Doerr, Benjamin
[Drechsle, Rolf]
[Ebner, Marc]
[Grahl, Jörn]
[Jansen, Thomas]
[Knowles, Joshua D.]
[Lenaerts, Tom]
[Middendorf, Martin]
[Miller, Julian F.]
[O'Neill, Michael]
[Poli, Riccardo]
[Squillero, Giovanni]
[Stanley, Kenneth O.]
[Stützle, Thomas]
[van Hemert, Jano]
2009Proceedings
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
2008Journal Article
Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567
[Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Jedrzejowicz, Joanna]
[Szepietowski, Andrzej]
2005Proceedings Article
Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
2008Journal Article
Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
2006Proceedings Article
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Deng, Xiaotie]
[Du, Ding-Zhu]
2005Proceedings Article
Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
[Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2008Journal Article
Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
[Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
2002Electronic Journal Article
[Replication or Save Conflict]
Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55
Banderier, Cyril
[Bousquet-Mélou, Mireille]
[Denise, Alain]
[Flajolet, Philippe]
[Gardy, Danièle]
[Gouyou-Beauchamps, Dominique]
2002Journal Article
Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Farach-Colton, Martin]2004Proceedings Article
Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Rudolf, Gabor]
[Lin, Guohui]2007Proceedings Article
Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa]
[Fiala, Jirí]
[Koubek, Václav]
[Kratochvíl, Jan]
2004Proceedings Article
Attachment IconGenerating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583
Doerr, Benjamin[Durand, Bruno]
[Thomas, Wolfgang]
2006Proceedings Article
Generating Vertices of Polyhedra and Related Monotone Generation Problems[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa]
2007Unpublished/Draft
Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Rieger, Joachim1995Journal Article
Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Hemmer, Michael
[Hülse, Dominik]
2009Proceedings Article
Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Kerber, Michael2009Thesis - PhD thesis
Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
Ray, Rahul2004Thesis - PhD thesis
Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
[Petitjean, Sylvain]2008Proceedings Article
Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Mehlhorn, Kurt
Schirra, Stefan
[Laurent, Pierre-Jean]
[Sablonnière, Paul]
[Schumaker, Larry L.]
2000Proceedings Article
Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
Matijevic, Domagoj2007Thesis - PhD thesis
Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132
[Dobkin, David P.]
Gunopulos, Dimitrios
[Lin, Ming C.]
[Manocha, Dinesh]
1996Proceedings Article
Geometric Rounding without changing the Topology
Universität des Saarlandes
Ding, Wei2003Thesis - Masters thesis
Attachment IconGlivenko and Kuroda for Simple Type TheoryRizkallah, Christine2011Unpublished/Draft
Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
[Henz, Martin]
[Müller, Tobias]
Thiel, Sven
2004Journal Article
Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Maue, Jens
[Sanders, Peter]
Matijevic, Domagoj
[Alvarez, Carme]
[Serna, Maria J.]
2006Proceedings Article
Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Meyer, Ulrich
Sibeyn, Jop F.
[Pritchard, David]
[Reeve, Jeff]
1998Proceedings Article
Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Sibeyn, Jop F.
[Juurlink, Ben]
Rao, P. Srinivasa
1998Journal Article
Granularity of parallel memoriesMehlhorn, Kurt
Vishkin, Uzi
1983Report
Attachment IconGraph-based Conservative Surface Reconstruction
Universität des Saarlandes
Dumitriu, Daniel2007Thesis - Masters thesis
Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26
[Eades, Peter]
Mutzel, Petra
Atallah, Mikhail J.1998Part of a Book
Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26
Mutzel, Petra
[Eades, Peter]
[Atallah, Mikhail J.]1999Part of a Book
Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
[Eades, Peter]
[Marks, Joe]
Mutzel, Petra
[North, Stephen]
[Whitesides, Sue H.]1998Proceedings Article
Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
[Brandenburg, Franz J.]
[Schreiber, Falk]
[Jünger, Michael]
[Marks, Joe]
Mutzel, Petra
Kratochvíl, Jan1999Proceedings Article
Graph Iterators: Decoupling Graph Structures from Algorithms
Universität des Saarlandes
Nissen, Marco1998Thesis - Masters thesis
Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
[Guo, Zeyu]
Sun, He
[Zhu, Hong]
2011Journal Article
Grundlagen der ProgrammiersprachenLoeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard
1986Book
Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA
Universität des Saarlandes
Neukirch, Markus1994Thesis - Masters thesis
Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
Funke, Stefan
[Milosavljevic, Nikola]
2007Proceedings Article
Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Elbassioni, Khaled
[Matijevic, Domagoj]
[Severdija, Domagoj]
[Vahrenhold, Jan]2010Proceedings Article
Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Elbassioni, Khaled
[Matijevic, Domagoj]
[Severdija, Domagoj]
2012Journal Article
Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363
Mehlhorn, Kurt1995Journal Article
Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
[de Berg, Marc]
Schirra, Stefan
[de Berg, Marc]
Schirra, Stefan
2002Proceedings Article
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

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