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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 7. Library - 4. Category, Keywords

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Author/EditorYearTitleType
Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
2010Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18
Journal Article
Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
2007Attachment IconMechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
Proceedings Article
Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash
2009Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
Journal Article
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
2009A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Journal Article
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
2008A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
Proceedings Article
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
2007A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
Proceedings Article
Christodoulou, George
Kovács, Annamária
2010A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016
Proceedings Article
Christodoulou, George
Kovács, Annamária
Schapira, Michael
2008Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
Christodoulou, George
Kovacs, Annamaria
van Stee, Rob
2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Journal Article
Christodoulou, George
Kovacs, Annamaria
van Stee, Rob
2010A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193
Proceedings Article
Christodoulou, George
Mehlhorn, Kurt
Pyrga, Evangelia
2011Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130
Proceedings Article
Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92
Proceedings Article
Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Journal Article
Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz
2004The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993
Proceedings Article
Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R.
2007The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Journal Article
Cilleruelo, Javier
Hebbinghaus, Nils
2009Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Journal Article
Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Journal Article
Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1992Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Proceedings Article
Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Isopi, Marc
Panconesi, Alessandro
Pasquale, Francesco
Silvestri, Riccardo
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Pasquale, Francesco
Silvestri, Riccardo
2013Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),
Proceedings Article
Cole, Richard
Farach-Colton, Martin
Hariharan, Ramesh
Przytycka, Teresa
Thorup, Mikkel
2000An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
Journal Article
Cole, Richard
Hariharan, Ramesh
1996An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332
Proceedings Article
Cole, Richard
Hariharan, Ramesh
Paterson, Mike
Zwick, Uri
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
Cole, Richard
Kowalik, Lukasz
2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Journal Article
Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Journal Article
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Journal Article
Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker
1997Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26
Proceedings Article
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2010Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
Journal Article
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2008Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
Proceedings Article
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
2007Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Journal Article
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
Journal Article
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
2006Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
Proceedings Article
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor
2006Deterministic Random Walks on the Integers
In: ??? [?], 1-27
Miscellaneous
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor
2005Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
Proceedings Article
Correa, Jose R.
Megow, Nicole
Raman, Rajiv
Suchan, Karol
2009Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
Proceedings Article
Crauser, Andreas2001LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes
Thesis - Doctoral dissertation
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
2001Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Journal Article
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
1999I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Proceedings Article
Crauser, Andreas
Ferragina, Paolo
Mehlhorn, Kurt
Meyer, Ulrich
Ramos, Edgar A.
1998Attachment IconRandomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268
Proceedings Article
Crochemore, Maxime
Galil, Zvi
Gasieniec, Leszek
Park, Kunsoo
Rytter, Wojciech
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
Crochemore, Maxime
Gasieniec, Leszek
Hariharan, Ramesh
Muthukrishnan, S.
Rytter, Wojciech
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Journal Article
Crochemore, Maxime
Gasieniec, Leszek
Rytter, Wojciech
1998Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
Proceedings Article
Croitoru, Cosima2012Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes
Thesis - Master's thesis
Croitoru, Cosmina2013Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013,
Proceedings Article
Croitoru, Cosmina
Kötzing, Timo
2014A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45
Proceedings Article
Croitoru, Cosmina
Kötzing, Timo
2012Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82
Proceedings Article
Csaba, Bela2007On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Journal Article
Csaba, Bela
Krysta, Piotr
Karpinski, Marek
2002Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83
Proceedings Article
Csaba, Bela
Lodha, S.
2006A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104
Journal Article
Curticapean, Radu
Künnemann, Marvin
2013A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360
Proceedings Article
Cygan, Marek
Dell, Holger
Lokshtanov, Daniel
Marx, Daniel
Nederlof, Jesper
Okamoto, Yoshio
Paturi, Ramamohan
Saurabh, Saket
Wahlström, Magnus
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
Cygan, Marek
Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus
2012Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
Czumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
Muthukrishnan, S.
Träff, Jesper Larsson
1997The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Proceedings Article
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold
2002Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
Proceedings Article
Czumaj, Artur
Vöcking, Berthold
2002Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420
Proceedings Article
Czyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej
2006Complexity of searching for a black holeUnpublished/Draft
Czyzowicz, Jurek
Kowalski, Dariusz
Markou, Euripides
Pelc, Andrzej
2005Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
Proceedings Article
Dams, Johannes
Hoefer, Martin
Kesselheim, Thomas
2013Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
Proceedings Article
Das, Gautam
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha
1997Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Proceedings Article
Das, Gautam
Kapoor, Sanjiv
Smid, Michiel
1997On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460
Journal Article
Das, Gautam
Kapoor, Sanjiv
Smid, Michiel
1996On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75
Proceedings Article
Datta, Amitava
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal Article
de Berg, Marc
Schirra, Stefan
2002Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
Proceedings Article
de Berg, Schirra (ed.)2002Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)Proceedings
De Sterck, Hans2012A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379
Journal Article
De Sterck, Hans2012A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117
Journal Article
De Sterck, Hans2012Steepest Descent Preconditioning for Nonlinear GMRES OptimizationUnpublished/Draft
De Sterck, Hans
Henson, Van Emden
Sanders, Geoff
2011Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
De Sterck, Hans
Miller, Killian
Sanders, Geoff
Winlaw, Manda
2011Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
Dedorath, Jürgen
Gergov, Jordan
Hagerup, Torben
1995More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Proceedings Article
Dementiev, Roman2006Algorithm Engineering for Large Data Sets
Universität des Saarlandes
Thesis - Doctoral dissertation
Dementiev, Roman
Kärkkäinen, Juha
Mehnert, Jens
Sanders, Peter
2005Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
Proceedings Article
Dementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data SetsReport
Dementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
Dementiev, Roman
Sanders, Peter
2003Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
Proceedings Article
Deng, Xiaotie
Mahajan, Sanjeev
1997The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
Journal Article
Denny, Markus2003Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451
Proceedings Article
Denny, Markus1994Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes
Thesis - Master's thesis
DeSimone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni
1995Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Journal Article
Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej
2006Deterministic rendezvous in graphsUnpublished/Draft
Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej
2006Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
Journal Article
Deussen, Peter
Mehlhorn, Kurt
1977Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Journal Article
Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A.
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Journal Article
Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A.
1999Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
Proceedings Article
Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis
2003Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
Dickert, Peter2000Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes
Thesis - Master's thesis
Diedrich, Florian
Kehden, Britta
Neumann, Frank
2008Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98
Proceedings Article
Diedrich, Florian
Neumann, Frank
2008Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833
Proceedings Article
Diekert, Volker
Jez, Artur
Plandowski, Wojciech
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
Diete, Iris1995Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes
Thesis - Master's thesis
Dietzfelbinger, Martin
Hagerup, Torben
Katajainen, Jyrki
Penttonen, Martti
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1991Dynamic Perfect Hashing: Upper and Lower BoundsReport
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1988Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
Proceedings Article
Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H.
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
Diks, Krzysztof
Hagerup, Torben
1998More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
Journal Article
Diks, Krzysztof
Hagerup, Torben
1996More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140
Proceedings Article
Ding, Wei2003Geometric Rounding without changing the Topology
Universität des Saarlandes
Thesis - Master's thesis
Dinitz, Yefim
Garg, Naveen
Goemans, Michel X.
1999On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Journal Article
Dinitz, Yefim
Nutov, Zeev
1999A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
Journal Article
Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos
1995Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Proceedings Article
Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos
1995On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
Proceedings Article
Djidjev, Hristo N.
Pantziou, G. E.
Zaroliagis, Christos
2000Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
Journal Article
Dobkin, David P.
Gunopulos, Dimitrios
1996Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132
Proceedings Article
Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex PolyhedronReport
Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
1993Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
Doerr, Benjamin2013Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Journal Article
Doerr, Benjamin2012Black-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092
Proceedings Article
Doerr, Benjamin2011Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320
Proceedings Article
Doerr, Benjamin2009Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111
Part of a Book
Doerr, Benjamin2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Journal Article
Doerr, Benjamin2007Attachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
Journal Article
Doerr, Benjamin2007Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Journal Article
Doerr, Benjamin2007Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Proceedings Article
Doerr, Benjamin2007Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
Journal Article
Doerr, Benjamin2006Attachment IconGenerating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583
Proceedings Article
Doerr, Benjamin2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Journal Article
Doerr, Benjamin2006Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99
Journal Article
Doerr, Benjamin2005Integral Approximation
Christian-Albrechts-Universität zu Kiel
Thesis - Habilitation thesis
Doerr, Benjamin2005Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068
Proceedings Article
Doerr, Benjamin2005Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628
Proceedings Article
Doerr, Benjamin2004Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
Journal Article
Doerr, Benjamin2001Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
Journal Article
Doerr, Benjamin
Doerr, Carola
Ebel, Franziska
2013Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788
Proceedings Article
Doerr, Benjamin
Doerr, Carola
Spöhel, Reto
Thomas, Henning
2013Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Electronic Journal Article
Doerr, Benjamin
Eremeev, Anton
Horoba, Christian
Neumann, Frank
Theile, Madeleine
2009Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
Doerr, Benjamin
Eremeev, Anton
Neumann, Frank
Theile, Madeleine
Thyssen, Christian
2011Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2011Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
2011Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302
Electronic Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2011Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2010Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2009A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
2006Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19
Miscellaneous
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2012Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2012Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2012Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
Journal Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2011Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
2011Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308
Electronic Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Schmidt, Martin
Wahlström, Magnus
2009BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten
2011Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090
Proceedings Article
Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten
2010Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
2009Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
Journal Article
Doerr, Benjamin
Friedrich, Tobias
2006Attachment IconDeterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Journal Article
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2006Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
2005Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas
2011Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Journal Article
Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas
2009Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
2009Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Journal Article
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
2009Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
Proceedings Article
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
2008Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Proceedings Article
Doerr, Benjamin
Gnewuch, Michael
2008Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312
Proceedings Article
Doerr, Benjamin
Gnewuch, Michael
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
Neumann, Frank
2007A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Proceedings Article
Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich
2008Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Journal Article
Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter
2008 Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Journal Article
Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus
2010Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
Journal Article
Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus
2009Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
2013Adaptive Drift Analysis
In: Algorithmica [65], 224-250
Journal Article
Doerr, Benjamin
Goldberg, Leslie Ann
2010Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
2010Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian
2011Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian
2010Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
Doerr, Benjamin
Happ, Edda
2008Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Proceedings Article
Doerr, Benjamin
Happ, Edda
Klein, Christian
2012Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Journal Article
Doerr, Benjamin
Happ, Edda
Klein, Christian
2011Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Journal Article
Doerr, Benjamin
Happ, Edda
Klein, Christian
2007A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Proceedings Article
Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Journal Article
Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
Doerr, Benjamin
Hota, Ashish
Kötzing, Timo
2012Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24
Proceedings Article
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
2013Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Journal Article
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
2009Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
Proceedings Article
Doerr, Benjamin
Jansen, Thomas
2011Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
Journal Article
Doerr, Benjamin
Jansen, Thomas
Klein, Christian
2008Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Proceedings Article
Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
Journal Article
Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
2010Attachment IconEdge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
2007Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Lehre, Per Christian
Wagner, Markus
Winzen, Carola
2011Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Journal Article
Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine
2010More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Schmidt, Martin
2011Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Journal Article
Doerr, Benjamin
Klein, Christian
2006Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40
Electronic Journal Article
Doerr, Benjamin
Klein, Christian
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
Doerr, Benjamin
Klein, Christian
Storch, Tobias
2007Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
Proceedings Article
Doerr, Benjamin
Kodric, Bojana
Voigt, Marco
2013Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Proceedings Article
Doerr, Benjamin
Kötzing, Timo
Winzen, Carola
2011Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
2013How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
2013Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus
2011Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
Proceedings Article
Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus
2010Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201
Proceedings Article
Doerr, Benjamin
Lengler, Johannes
Kötzing, Timo
Winzen, Carola
2011Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988
Proceedings Article
Doerr, Benjamin
Lengler, Johannes
Steurer, Daniel
2006Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
Proceedings Article
Doerr, Benjamin
Lorenz, Ulf
2006Attachment IconError Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
Journal Article
Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola
2012Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Electronic Journal Article
Doerr, Benjamin
Neumann, Frank
2010In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
Journal Article
Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Journal Article
Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Proceedings Article
Doerr, Benjamin
Neumann, Frank
Wegener, Ingo
2010Editorial
In: Algorithmica [57], 119-120
Journal Article
Doerr, Benjamin
Pohl, Sebastian
2012Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324
Proceedings Article
Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
Proceedings Article
Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Proceedings Article
Doerr, Benjamin
Srivastav, Anand
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Journal Article
Doerr, Benjamin
Srivastav, Anand
2001Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
Journal Article
Doerr, Benjamin
Sudholt, Dirk
Witt, Carsten
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
Proceedings Article
Doerr, Benjamin
Theile, Madeleine
2009Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Proceedings Article
Doerr, Benjamin
Wahlström, Magnus
2009Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
Proceedings Article
Doerr, Benjamin
Winzen, Carola
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Journal Article
Doerr, Benjamin
Winzen, Carola
2012Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
Doerr, Benjamin
Winzen, Carola
2012Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
Journal Article
Doerr, Benjamin
Winzen, Carola
2012Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Electronic Journal Article
Doerr, Benjamin
Winzen, Carola
2011Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Electronic Journal Article
Doerr, Carola
De Rainville, François-Michel
2013Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796
Proceedings Article
Doerr, Carola
Gnewuch, Michael
Wahlström, Magnus
2013Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Part of a Book
Doerr, C.
Schmidt, Jens M.
Ramakrishna, G.
2013Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
Donato, Debora
Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F.
2006Attachment IconAlgorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
Electronic Journal Article
Dorchain, Jörg1996An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes
Thesis - Master's thesis
Duan, Ran2013Attachment IconBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
Proceedings Article
Duan, Ran
Mehlhorn, Kurt
2012A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8
Electronic Journal Article
Dubhashi, Devdatt
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Journal Article
Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian
1993Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Proceedings Article
Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
2009How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17
Electronic Journal Article
Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208
Proceedings Article
Duncan, C.A.
Goodrich, Michael T.
Ramos, Edgar A.
1997Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130
Proceedings Article
Durrett, Greg
Neumann, Frank
O'Reilly, Una-May
2011Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80
Proceedings Article
Eades, Peter
Marks, Joe
Mutzel, Petra
North, Stephen
1998Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
Proceedings Article
Eades, Peter
Mutzel, Petra
1998Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26
Part of a Book
Ebert, Franziska2005Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes
Thesis - Bachelor thesis
Edelkamp, Stefan
Meyer, Ulrich
2001Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184
Proceedings Article
Edelsbrunner, Herbert
Ramos, Edgar A.
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Journal Article
Eigensatz, Michael
Giesen, Joachim
Manjunath, Madhusudan
2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
Eigenwillig, Arno2008Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Thesis - Doctoral dissertation
Eigenwillig, Arno2003Attachment IconExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
Thesis - Master's thesis
Eigenwillig, Arno
Kerber, Michael
2008Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
Proceedings Article
Eigenwillig, Arno
Kettner, Lutz
Krandick, Werner
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola
2005Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
2007Attachment IconSnap Rounding of Bézier CurvesReport
Eigenwillig, Arno
Schömer, Elmar
Wolpert, Nicola
2002Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
Eiglsperger, Markus
Fekete, Sandor P.
Klau, Gunnar W.
2001Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
Part of a Book
Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
Eisenbrand, Friedrich
Funke, Stefan
Garg, Naveen
Könemann, Jochen
2003A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522
Proceedings Article
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Journal Article
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
Proceedings Article
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
Proceedings Article
Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao
2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
Proceedings Article
El Kahoui, M'hammed2008Attachment IconComputing with algebraic curves in generic positionMiscellaneous
El Kahoui, M'hammed2008Attachment IconPolynomial parametrization of nonsingular algebraic curvesMiscellaneous
El Kahoui, M'hammed2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
Journal Article
El Kahoui, M'hammed2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
Journal Article
El Kahoui, M'hammed2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
Journal Article
El Kahoui, M'hammed2004Attachment IconAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
Proceedings Article
El Kahoui, M'hammed2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
Journal Article
El Kahoui, M'hammed2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
Journal Article
El Kahoui, M'hammed2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
Journal Article
El Kahoui, M'hammed2002Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
Journal Article
El Kahoui, M'hammed2000Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
Journal Article
El Kahoui, M'hammed
Rakrak, Said
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Journal Article
Elbassioni, Khaled2012A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
Proceedings Article
Elbassioni, Khaled2009Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Journal Article
Elbassioni, Khaled2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Journal Article
Elbassioni, Khaled2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Journal Article
Elbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He
2013Multi-Attribute Profit-Maximizing PricingUnpublished/Draft
Elbassioni, Khaled
Chan, Hubert
2010A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267
Proceedings Article
Elbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim
2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Part of a Book
Elbassioni, Khaled
Elmasry, Amr
Makino, Kazuhisa
2011Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Journal Article
Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René
2009Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Journal Article
Elbassioni, Khaled
Fouad, Mohamed
Bertino, Elisa
2012Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450
Proceedings Article
Elbassioni, Khaled
Fouz, Mahmoud
Swamy, Chaitanya
2010Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472
Proceedings Article
Elbassioni, Khaled
Garg, Naveen
Gupta, Divya
Kumar, Amit
Narula, Vishal
Pal, Arindam
2012Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275
Electronic Proceedings Article
Elbassioni, Khaled
Hagen, Matthias
Rauf, Imran
2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
Elbassioni, Khaled
Jeli´c, Slobodan
Matijevi`c, Domagoj
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Journal Article
Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj
2011Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Journal Article
Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj
2009Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371
Electronic Proceedings Article
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Journal Article
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2009Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Proceedings Article
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
2009Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
2012Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Journal Article
Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
2010Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Proceedings Article
Elbassioni, Khaled
Paluch, Katarzyna
van Zuylen, Anke
2012Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
2009On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
Elbassioni, Khaled
Rauf, Imran
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Journal Article
Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
Elbassioni, Khaled
Sitters, Rene
Zhang, Yan
2007A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
Elbassioni, Khaled
Tiwary, Hans Raj
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Journal Article
Elbassioni, Khaled
Tiwary, Hans Raj
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Journal Article
Elbassioni, Khaled
Tiwary, Hans Raj
2009Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Proceedings Article
Elbassioni, Khaled
Tiwary, Hans Raj
2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Proceedings Article
Elbassioni, Khaled
Tiwary, Hans Raj
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Journal Article
Elbassioni, Khaled M.2006Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Proceedings Article
Elbassioni, Khaled M.2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Journal Article
Elbassioni, Khaled M.2006On the Complexity of Monotone Boolean Duality TestingReport
Elbassioni, Khaled M.2006On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Proceedings Article
Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Journal Article
Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Proceedings Article
Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
Elbassioni, Khaled M.
Fishkin, Aleksei V.
Sitters, Rene
2006On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Proceedings Article
Elbassioni, Khaled M.
Katriel, Irit
2005Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182
Proceedings Article
Elbassioni, Khaled M.
Katriel, Irit
Kutz, Martin
Mahajan, Meena
2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Proceedings Article
Elbassioni, Khaled M.
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj
2009Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
Electronic Journal Article
Elbassioni, Khaled M.
Lotker, Zvi
Seidel, Raimund
2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Journal Article
Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
Elbassioni, Khaled M.
Mustafa, Nabil H.
2006Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Proceedings Article
Elbassioni, Khaled M.
Mustafa, Nabil H.
2005Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksUnpublished/Draft
Elbassioni, Khaled M.
Sitters, Rene
Zhang, Yan
2007Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
Elmasry, Amr2010Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Journal Article
Elmasry, Amr2010The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Journal Article
Elmasry, Amr2009Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Journal Article
Elmasry, Amr
Elbassioni, Khaled M.
2005Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251
Electronic Proceedings Article
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Proceedings Article
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
Elmasry, Amr
Manjunath, Madhusudan
2009Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Proceedings Article
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
2010An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
Elsaesser, Robert
Sauerwald, Thomas
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
Emeliyanenko, Pavel2012Attachment IconComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
Electronic Journal Article
Emeliyanenko, Pavel2012Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
Thesis - Doctoral dissertation
Emeliyanenko, Pavel2011Attachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
Proceedings Article
Emeliyanenko, Pavel2010Attachment IconA complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43
Proceedings Article
Emeliyanenko, Pavel2010Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), -
Poster
Emeliyanenko, Pavel2010Attachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
Emeliyanenko, Pavel2009Attachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Proceedings Article
Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
2009Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconAn implementation of the 2D Algebraic KernelReport
Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationReport
Emeliyanenko, Pavel
Sagraloff, Michael
2012On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
Emminghaus, Frank1995Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes
Thesis - Master's thesis
Epstein, Leah
Jez, Lukasz
Sgall, Jiri
van Stee, Rob
2012Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
Epstein, Leah
Kesselman, Alexander
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Journal Article
Epstein, Leah
Kleiman, Elena
Mestre, Julian
2009Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
Proceedings Article
Epstein, Leah
Kleiman, Elena
van Stee, Rob
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2010Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
Epstein, Leah
Levin, Asaf
Mestre, Julian
Segev, Danny
2010Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
Electronic Proceedings Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2013Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Proceedings Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Journal Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2010Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
Epstein, Leah
van Stee, Rob
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Journal Article
Epstein, Leah
van Stee, Rob
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
Epstein, Leah
van Stee, Rob
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Journal Article
Epstein, Leah
van Stee, Rob
Tamir, Tami
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
Evans, Brian
Schwarz, Christian
Teich, Jürgen
Vainshtein, Alek
Welzl, Emo
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
Evans, B.L.
Schwarz, Christian
Teich, Jürgen
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
1996The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
Farzan, Arash
Gagie, Travis
Navarro, Gonzalo
2010Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Proceedings Article
Farzan, Arash
Munro, J. Ian
2011Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
Journal Article
Feldmann, Matthias2012Stochastic optimization with fitness proportional ant systems

Universität des Saarlandes
Thesis - Bachelor thesis
Feld, Thomas1998Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes
Thesis - Master's thesis
Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
Fellows, Michael R.
Friedrich, Tobias
Hermelin, Danny
Narodytska, Nina
Rosamond, Frances A.
2011Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
Proceedings Article
Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A.
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
Feremans, Corinne
Grigoriev, Alexander
Sitters, Rene
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
Ferragina, Paolo
Gross, Roberto
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Journal Article
Fialko, Sergej1997Das planare Augmentierungsproblem
Universität des Saarlandes
Thesis - Master's thesis
Finkler, Ulrich1997Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes
Thesis - Doctoral dissertation
Finkler, Ulrich
Mehlhorn, Kurt
1999Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902
Proceedings Article
Finkler, Ulrich
Mehlhorn, Kurt
1997Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389
Proceedings Article
Fink, Christian2001Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes
Thesis - Master's thesis
Fleischer, Lisa
Skutella, Martin
2003Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
Proceedings Article
Fleischer, Rudolf1999Effiziente und Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
Fleischer, Rudolf1996A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149
Journal Article
Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
1992Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Journal Article
Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
Fleischer, Rudolf
Wahl, Michaela
2000Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Proceedings Article
Fogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1995Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
Fontaine, Marc2003Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes
Thesis - Master's thesis
Fontet, Mehlhorn (ed.)1984Theoretical aspects of computer science (STACS-84) : [1st] symposiumProceedings
Fotakis, Dimitris
Kontogiannis, Spyros
Koutsoupias, Elias
Mavronicolas, Marios
Spirakis, Paul G.
2002Attachment IconThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
Proceedings Article
Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G.
2002Attachment IconRadiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234
Proceedings Article
Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2003Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
Proceedings Article
Fountoulakis, Nikolaos2007Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356
Journal Article
Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny
2011Average Case Parameterized ComplexityUnpublished/Draft
Fountoulakis, Nikolaos
Huber, Anna
2009Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Journal Article
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Proceedings Article
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2009Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
Proceedings Article
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Proceedings Article
Fountoulakis, Nikolaos
Kang, Ross
McDiarmid, Colin
2010The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
Electronic Journal Article
Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos
2011The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
Proceedings Article
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2009Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Journal Article
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
2008The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2013On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2012Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
20113-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Journal Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2010Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359
Proceedings Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
2010Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573
Proceedings Article
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Sauerwald, Thomas
2012Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660
Proceedings Article
Fountoulakis, Nikolaos
Reed, Bruce
2008The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86
Journal Article
Fountoulakis, Nikolaos
Reed, Bruce
2007Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486
Journal Article
Fouz, Mahmoud2012Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
Thesis - Doctoral dissertation
Fouz, Mahmoud2006Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes
Thesis - Bachelor thesis
Fraigniaud, Pierre
Gasieniec, Leszek
Kowalski, Dariusz
Pelc, Andrzej
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
Frederickson, Greg N.
Solis-Oba, Roberto
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
Journal Article
Fredman, Michael
Khachiyan, Leonid
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
Journal Article
Friedrichs, Stephan
Kulau, Ulf
Wolf, Lars
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
Proceedings Article
Friedrich, Tobias2007Use and Avoidance of Randomness
Universität des Saarlandes
Thesis - Doctoral dissertation
Friedrich, Tobias2005Attachment IconDeterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena
Thesis - Master's thesis
Friedrich, Tobias
Bringmann, Karl
Voss, Thomas
Igel, Christian
2011The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article
Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
2012Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
Journal Article
Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
2010Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Proceedings Article
Friedrich, Tobias
Hebbinghaus, Nils
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Journal Article
Friedrich, Tobias
Hebbinghaus, Nils
2008Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
Proceedings Article
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Journal Article
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Journal Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Journal Article
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2009Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
Friedrich, Tobias
Kroeger, Trent
Neumann, Frank
2012Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10
Electronic Journal Article
Friedrich, Tobias
Neumann, Frank
2010When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Journal Article
Friedrich, Tobias
Neumann, Frank
2008When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
Proceedings Article
Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Journal Article
Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
2010The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
2010The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Electronic Journal Article
Friedrich, Tobias
Sauerwald, Thomas
2009Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
Fries, Markus2001Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Master's thesis
Fries, Markus2000Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes
Thesis - Master's thesis
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Dynamization of geometric data structuresReport
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176
Proceedings Article
Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A.
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Journal Article
Frigioni, Daniele
Miller, Tobias
Nanni, Umberto
Pasqualone, Giulio
Schäfer, Guido
Zaroliagis, Christos
1998An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380
Proceedings Article
Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Journal Article
Fuhrmann, Artur
Schömer, Elmar
2001A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057
Proceedings Article
Funke, Stefan2005Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53
Proceedings Article
Funke, Stefan2001Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes
Thesis - Doctoral dissertation
Funke, Stefan1997Exact Arithmetic using Cascaded Computation
Universität des Saarlandes
Thesis - Master's thesis
Funke, Stefan
Guibas, Leonidas
Nguyen, An
Wang, Yusu
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
Proceedings Article
Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
Journal Article
Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
Journal Article
Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael
2005A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223
Proceedings Article
Funke, Stefan
Klein, Christian
2006Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
Proceedings Article
Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2006Attachment IconControlled Perturbation for Delaunay TriangulationsReport
Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
Proceedings Article
Funke, Stefan
Laue, Soeren
Lotker, Zvi
Naujoks, Rouven
2011Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035
Journal Article
Funke, Stefan
Laue, Sören
2007Attachment IconBounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
Proceedings Article
Funke, Stefan
Laue, Sören
Naujoks, Rouven
2007Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416
Proceedings Article
Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
2008Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295
Proceedings Article
Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi
2006Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14
Miscellaneous
Funke, Stefan
Malamatos, Theocharis
Matijevic, Domagoj
Wolpert, Nicola
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4
Proceedings Article
Funke, Stefan
Malamatos, Theocharis
Ray, Rahul
2004Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105
Proceedings Article
Funke, Stefan
Mehlhorn, Kurt
2000Attachment IconLOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165
Proceedings Article
Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Journal Article
Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan
1999Attachment IconStructural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42
Proceedings Article
Funke, Stefan
Mehlhorn, Kurt
Schmitt, Susanne
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan
2004The LEDA class real number -- extended versionReport
Funke, Stefan
Milosavljevic, Nikola
2007Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252
Proceedings Article
Funke, Stefan
Milosavljevic, Nikola
2007Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967
Proceedings Article
Funke, Stefan
Milosavljevic, Nikola
2005Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367
Proceedings Article
Funke, Stefan
Ramos, Edgar A.
2002Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790
Proceedings Article
Funke, Stefan
Ramos, Edgar A.
2001Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353
Proceedings Article
Fürer, Martin
Mehlhorn, Kurt
1989Attachment IconAT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336
Journal Article
Fürer, Martin
Mehlhorn, Kurt
1986AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225
Proceedings Article
Fürer, Martin
Mehlhorn, Kurt
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
Fürer, Martin
Mehlhorn, Kurt
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
Gagie, Travis
Gawrychowski, Pawel
Kärkkäinen, Juha
Nekrich, Yakov
Puglisi, Simon J.
2014LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
Gagie, Travis
Gawrychowski, Pawel
Nekrich, Yakov
2013Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Proceedings Article
Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
Proceedings Article
Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proceedings Article
Garg, Naveen1996A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309
Proceedings Article
Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Journal Article
Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas
1996Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings Article
Garg, Naveen
Vazirani, Vijay V.
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
Garg, Naveen
Vazirani, Vijay V.
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
Gärtner, Tobias
Hotz, Günter
2009Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Proceedings Article
Gasieniec, Leszek
Indyk, Piotr
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
Proceedings Article
Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
Gasieniec, Leszek
Jansson, Jesper
Lingas, Andrzej
Östlin, Anna
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
Proceedings Article
Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
Gasieniec, Leszek
Kranakis, Evangelos
Krizanc, Danny
Pelc, Andrzej
1996Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403
Proceedings Article
Gasieniec, Leszek
Pelc, Andrzej
1997Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20
Journal Article
Gasieniec, Leszek
Pelc, Andrzej
1996Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912
Journal Article
Gast, Christoph1997Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes
Thesis - Master's thesis
Gawrychowski, Pawel2014Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Journal Article
Gawrychowski, Pawel2013Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Proceedings Article
Gawrychowski, Pawel2012Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Proceedings Article
Gawrychowski, Pawel2012Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
Proceedings Article
Gawrychowski, Pawel2012Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
Electronic Proceedings Article
Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
Gawrychowski, Pawel
Kucherov, Gregory
Nekrich, Yakov
Starikovskaya, Tatiana
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
Gawrychowski, Pawel
Manea, Florin
Mercas, Robert
Nowotka, Dirk
Tiseanu, Catalin
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2014Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349
Proceedings Article
Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
2013Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Proceedings Article
Gawrychowski, Pawel
Mozes, Shay
Weimann, Oren
2014Improved 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
Proceedings Article
Gawrychowski, Pawel
Straszak, Damian
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Proceedings Article
Gawrychowski, Pawel
Uznanski, Przemyslaw
2014Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Proceedings Article
Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
2001Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
Geismann, Nicola
Hemmer, Michael
Schömer, Elmar
2001The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
2005Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166
Journal Article
Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander
2003Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238
Proceedings Article
Gergov, Jordan2000Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes
Thesis - Doctoral dissertation
Gergov, Jordan1996Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61
Proceedings Article
Gergov, Jordan
Meinel, Christoph
1996Mod-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
Journal Article
Giakkoupis, George
Sauerwald, Thomas
2012Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641
Proceedings Article
Giakkoupis, George
Sauerwald, Thomas
Sun, He
Woelfel, Philipp
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
Giannopoulos, Panos
Klein, Rolf
Kutz, Martin
Marx, Daniel
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Journal Article
Giannopoulos, Panos
Knauer, Christian
Wahlström, Magnus
Werner, Daniel
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Håkan
Tsigas, Philippas
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Journal Article
Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Philippas
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Phillipas
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Electronic Journal Article
Giesen, Joachim2008Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Journal Article
Giesen, Joachim2008Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Journal Article
Giesen, Joachim2008The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Journal Article
Giesen, Joachim2007Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Proceedings Article
Giesen, Joachim2007The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
Part of a Book
Giesen, Joachim
Manjunath, Madhusudan
2009Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Electronic Proceedings Article
Giesen, Joachim
Mitsche, Dieter
Schuberth, Eva
2007Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Proceedings Article
Giesen, Joachim
Schuberth, Eva
Simon, Klaus
Zolliker, Peter
Zweifel, Oliver
2007Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410
Journal Article
Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter
20027th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual PrototypingProceedings
Goldberg, Leslie Ann
MacKenzie, Philip D.
Paterson, Mike
Srinivasan, Aravind
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Journal Article
Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1998Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072
Journal Article
Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
Golumbic, Martin Charles
Mintz, Aviad
Rotics, Udi
2006Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477
Journal Article
Goodrich, Michael T.
Ramos, Edgar A.
1997Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420
Journal Article
Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
Gotthilf, Zvi
Hermelin, Danny
Landau, Gad M.
Lewenstein, Moshe
2010Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
Proceedings Article
Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
Grigoriev, Alexander
van Loon, Joyce
Sitters, Rene
Uetz, Marc
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
Grove, Edward1995On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436
Proceedings Article
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott
1995Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
Gugelmann, Luca
Spöhel, Reto
2011On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
Guillaume, Frank1997Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes
Thesis - Master's thesis
Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev
1997Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229
Proceedings Article
Günther, Elisabeth
König, Felix
Megow, Nicole
2010Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181
Proceedings Article
Günther, Elisabeth
Maurer, Olaf
Megow, Nicole
Wiese, Andreas
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
Guo, Zeyu
Sun, He
Zhu, Hong
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Journal Article
Gupta, Arvind
Kaller, Damon
Mahajan, Sanjeev
Shermer, Thomas C.
1996Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
Proceedings Article
Gupta, Arvind
Mahajan, Sanjeev
1997Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63
Journal Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
Journal Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
Journal Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
Journal Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1996Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Journal Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1995Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Journal Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Proceedings Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Journal Article
Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Proceedings Article
Gurvich, Vladimir1991Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726
Journal Article
Gurvich, Vladimir1977On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184
Journal Article
Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1976Binary Search Trees: Average and Worst Case BehaviorReport
Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert
1976Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
Gutwenger, Carsten1999Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes
Thesis - Master's thesis
Gutwenger, Carsten
Mutzel, Petra
1998Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182
Proceedings Article
Hachenberger, Peter2006Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes
Thesis - Doctoral dissertation
Hachenberger, Peter1999Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Thesis - Master's thesis
Hachenberger, Peter
Kettner, Lutz
2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
Proceedings Article
Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
Hagerup, Torben2000Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Journal Article
Hagerup, Torben2000Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Journal Article
Hagerup, Torben1998Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
Proceedings Article
Hagerup, Torben1998Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398
Proceedings Article
Hagerup, Torben1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Journal Article
Hagerup, Torben1997Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Proceedings Article
Hagerup, Torben1996Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
Hagerup, Torben1995A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Journal Article
Hagerup, Torben1995Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Journal Article
Hagerup, Torben1995The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Journal Article
Hagerup, Torben
Katajainen, Jyrki
Nishimura, Naomi
Ragde, Prabhakar
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
Hagerup, Torben
Keller, Jörg
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Journal Article
Hagerup, Torben
Kutylowski, Miroslaw
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Journal Article
Hagerup, Torben
Mehlhorn, Kurt
Munro, I.
1993Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Proceedings Article
Hagerup, Torben
Sanders, Peter
Träff, Jesper Larsson
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
Hajiaghayi, MohammadTaghi
Khandekar, Rohit
Kortsarz, Guy
Mestre, Julian
2010The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
Hall, Alex
Langkau, Katharina
Skutella, Martin
2003An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
Proceedings Article
Hammerschmidt, Frank1999Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Thesis - Master's thesis
Han, Xiaofeng
Kelsen, Pierre
Ramachandran, Vijaya
Tarjan, Robert E.
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
Han, Xin
Lam, Tak-Wah
Lee, Lap-Kei
To, Isaac K. K.
Wong, Prudence W. H.
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
Happ, Edda2009Analyses of Evolutionary Algorithms
Universität des Saarlandes
Thesis - Doctoral dissertation
Hariharan, Ramesh
Kapoor, Sanjiv
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Journal Article
Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev
1996Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Proceedings Article
Hariharan, Ramesh
Mahajan, Sanjeev
1995Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Proceedings Article
Hariharan, Ramesh
Muthukrishnan, S.
1995String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Journal Article
Hariharan, Ramesh
Telikepalli, Kavitha
Mehlhorn, Kurt
2006Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
Proceedings Article
Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
Harren, Rolf2010Two-dimensional packing problems
Universität des Saarlandes
Thesis - Doctoral dissertation
Harren, Rolf2009Attachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Journal Article
Harren, Rolf2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
Harren, Rolf2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
Harren, Rolf2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - Diploma thesis
Harren, Rolf
Jansen, Klaus
Prädel, Lars
van Stee, Rob
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
Harren, Rolf
Kern, Walter
2012Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
Harren, Rolf
van Stee, Rob
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
Hazboun, Jack1999Molekül-Docking-Reaktionen
Universität des Saarlandes
Thesis - Master's thesis
Heinz, Jeffrey
Kasprzik, Anna
Kötzing, Timo
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Journal Article
Helwig, Sabine
Neumann, Frank
Wanka, Rolf
2009Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
Hemmer, Michael2009Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
Hemmer, Michael2007Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
Hemmer, Michael
Dupon, Laurent
Petitjean, Sylvain
Schomer, Elmar
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Pion, Sylvain
Schirra, Stefan
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
Hemmer, Michael
Hülse, Dominik
2007Traits classes for polynomial gcd computation over algebraic extensionsReport
Hemmer, Michael
Kettner, Lutz
Schömer, Elmar
2004Effects of a Modular Filter on Geometric ApplicationsReport
Hemmer, Michael
Limbach, Sebastian
2008Arrangements of quadrics in 3D: continued work on experimental implementationReport
Hemmer, Michael
Limbach, Sebastian
2007Benchmarks on a generic univariate algebraic kernelReport
Hemmer, Michael
Limbach, Sebastian
Schömer, Elmar
2009Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Proceedings Article
Hemmer, Michael
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
Emiris, Ioannis Z.
Karavelas, Menelaos I.
Mourrain, Bernard
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
Henzinger, Monika R.
Leonardi, Stefano
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
Henz, Martin
Müller, Tobias
Thiel, Sven
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
Hermelin, Danny
Huang, Chien-Chung
Kratsch, Stefan
Wahlström, Magnus
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
Hermelin, Danny
Levy, Avivit
Weimann, Oren
Yuster, Raphael
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
Hermelin, Danny
Mestre, Julian
Rawitz, Dror
2012Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan
2012Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan
Woeginger, Gerhard J.
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
Hermelin, Danny
Rawitz, Dror
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
Hermelin, Danny
Rizzi, Romeo
Vialette, Stephane
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
Hermelin, Danny
Wu, Xi
2012Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Proceedings Article
Hertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
Journal Article
Hertel, Stefan
Mehlhorn, Kurt
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Journal Article
Hertel, Stefan
Mehlhorn, Kurt
1983Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Proceedings Article
Hertel, Stefan
Mehlhorn, Kurt
Mäntylä, Martti
Nievergelt, Jurg
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyReport
Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
Hert, Susan
Lumelsky, Vladimir
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Journal Article
Heydrich, Sandy2012Dividing connected chores fairly
Universität des Saarlandes
Thesis - Bachelor thesis
Heydrich, Sandy
van Stee, Rob
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
Heydthausen, Manfred
Mehlhorn, Kurt
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
Proceedings Article
Heydthausen, Manfred
Mehlhorn, Kurt
1976Top down parsing of macro grammars (preliminary report)Report
Hilpert, Peter1996Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Thesis - Master's thesis
Hoefer, Martin2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Journal Article
Hoefer, Martin2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Journal Article
Hoefer, Martin2003Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
Hoefer, Martin
Kesselheim, Thomas
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
Hoefer, Martin
Kesselheim, Thomas
Vöcking, Berthold
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
Hoefer, Martin
Sauerwald, Thomas
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
Hoefer, Martin
Skopalik, Alexander
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
Hoefer, Martin
Skopalik, Alexander
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
Hoefer, Martin
Wagner, Lisa
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
Hoefer, Martin
Wagner, Lisa
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
Hoepman, Jaap-Henk
Papatriantafilou, Marina
Tsigas, Philippas
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
Hoffmann, K
Mehlhorn, Kurt
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proceedings Article
Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1984Sorting Jordan sequences in linear timeReport
Höhn, Wiebke
Jacobs, Tobias
Megow, Nicole
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
Hong, Jia-Wei
Mehlhorn, Kurt
1982Cost tradeoffs in graph embeddings, with applicationsReport
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
Horoba, Chrisitian
Neumann, Frank
2009Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86
Proceedings Article
Horoba, Christian
Neumann, Frank
2008Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
Proceedings Article
Huang, Chien-Chung2012Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Proceedings Article
Huang, Chien-Chung2010Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Journal Article
Huang, Chien-Chung2010Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Proceedings Article
Huang, Chien-Chung
Kavitha, Telikepalli
2011Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Proceedings Article
Huang, Chien-Chung
Kavitha, Telikepalli
2011Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Proceedings Article
Huang, Chien-Chung
Kavitha, Telikepalli
Michael, Dimitrios
Nasr, Meghana
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Journal Article
Huang, Chien-Chung
Kavitha, Telikepalli
Michail, Dimitrios
Nasre, Meghana
2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
Huber, Anna2010Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Thesis - Doctoral dissertation
Huddleston, Scott
Mehlhorn, Kurt
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
Journal Article
Huddleston, S.
Mehlhorn, Kurt
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proceedings Article
Humble, Monika1997Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Master's thesis
Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika
1997Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
Part of a Book
Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
2001Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
2001The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C.
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
Immich, Stefan2001Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes
Thesis - Master's thesis
Ingalalli, Vijay2011Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Thesis - Master's thesis
Irving, Robert W.
Telikepalli, Kavitha
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Journal Article
Issac, Davis2015Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
Jain, Sanjay
Kötzing, Timo
Stephan, Frank
2012Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
Proceedings Article
Janardan, Ravi
Smid, Michiel
1995On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Proceedings Article
Jansen, Klaus1998A New Characterization for Parity Graphs and a Coloring Problem with Costs
In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260
Proceedings Article
Jansen, Klaus1998The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297
Proceedings Article
Jansen, Klaus
Kratsch, Stefan
Marx, Dániel
Schlotter, Ildikó
2010Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272
Proceedings Article
Jansen, Klaus
Porkolab, Lorant
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
Journal Article
Jansen, Klaus
Solis-Oba, Roberto
Sviridenko, Maxim
2000Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
Part of a Book
Jansen, Thomas
Neumann, Frank
2010Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
Journal Article
Johannsen, Daniel2010Attachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
Thesis - Doctoral dissertation
Johannsen, Daniel
Lengler, Johannes
2010Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
Proceedings Article
Johannsen, Daniel
Panagiotou, Konstantinos
2010Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Proceedings Article
Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1998Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
Proceedings Article
Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1997Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
Proceedings Article
Jünger, Michael
Mutzel, Petra
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Journal Article
Jünger, Michael
Mutzel, Petra
1996Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), -
Proceedings Article
Jünger, Michael
Mutzel, Petra
1996Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
Journal Article
Jünger, Michael
Mutzel, Petra
1995The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130
Proceedings Article
Jünger, Michael
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Journal Article
Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1999Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
Jung, Hermann
Mehlhorn, Kurt
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Journal Article
Jung, Hermann
Mehlhorn, Kurt
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesReport
Jung, Karin1996Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes
Thesis - Master's thesis
Jurkiewicz, Tomasz2009Cycle Bases in Graphs
Universität des Saarlandes
Thesis - Master's thesis
Jurkiewicz, Tomasz
Mehlhorn, Kurt
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Proceedings Article
Juurlink, Ben
Mutzel, Petra
1995?
In: Conference on High-Performance Computing, 125-130
Proceedings Article
Juurlink, Ben
Sibeyn, Jop F.
1995Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Proceedings Article
Juurlink, Ben
Sibeyn, Jop F.
Rao, P. Srinivasa
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Journal Article
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1995On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
Kagaris, Dimitrios
Pantziou, Grammati E.
Tragoudas, Spyros
Zaroliagis, Christos
1995Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Proceedings Article
Kaligosi, Kanela2003Length bounded network flows
Universität des Saarlandes
Thesis - Master's thesis
Kaligosi, Kanela
Mehlhorn, Kurt
Munro, J. Ian
Sanders, Peter
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
Kaligosi, Kanela
Sanders, Peter
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
Kamran Azam, Muhammad2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
Thesis - Master's thesis
Kane, Daniel
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
Kao, Ming-Yang
Leung, Henry C. M.
Sun, He
Zhang, Yong
2010Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319
Proceedings Article
Kapoor, Sanjiv1996On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Proceedings Article
Kapoor, Sanjiv
Smid, Michiel
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Journal Article
Kappel, Holger1998Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Thesis - Master's thesis
Kärkkäinen, Juha
Sanders, Peter
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
Karrenbauer, Andreas2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - Doctoral dissertation
Karrenbauer, Andreas2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Thesis - other
Kasan, Binaman1995Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Thesis - Master's thesis
Kasprzik, Anna
Kötzing, Timo
2010String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
Proceedings Article
Katajainen, Jyrki
Träff, Jesper Larsson
1997A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228
Proceedings Article
Katriel, Irit2004Constraints and Changes
Universität des Saarlandes
Thesis - Doctoral dissertation
Katriel, Irit2004Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Proceedings Article
Katriel, Irit2004Attachment IconOn Algorithms for Online Topological Ordering and SortingReport
Katriel, Irit
Bodlaender, Hans L.
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article
Katriel, Irit
Meyer, Ulrich
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
Katriel, Irit
Sanders, Peter
Träff, Jesper Larsson
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
Katriel, Irit
Thiel, Sven
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Journal Article
Katriel, Irit
Thiel, Sven
2003Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451
Proceedings Article
Kaufmann, Michael
Mehlhorn, Kurt
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Journal Article
Kaufmann, Michael
Mehlhorn, Kurt
1989Routing Problems in Grid GraphsReport
Kaufmann, Michael
Mehlhorn, Kurt
1989Routing problems in grid graphsReport
Kaufmann, Michael
Mehlhorn, Kurt
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid GraphsReport
Kaufmann, Michael
Mehlhorn, Kurt
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
Kaufmann, Michael
Mehlhorn, Kurt
1986On Local Routing of Two-Terminal NetsReport
Kaufmann, Michael
Mehlhorn, Kurt
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Journal Article
Kaufmann, Michael
Mehlhorn, Kurt
1984Attachment IconLocal routing of two-terminal nets is easyReport
Kaufmann, Michael
Mehlhorn, Kurt
1984Attachment IconRouting through a generalized switchboxReport
Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F.
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
Kaufmann, Michael
Schröder, Heiko
Sibeyn, Jop F.
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
Kaufmann, Michael
Sibeyn, Jop F.
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
Kaufmann, Michael
Sibeyn, Jop F.
1995Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
Kaufmann, Michael
Sibeyn, Jop F.
Suel, Torsten
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
Kaufmann, Morgan
Mehlhorn, Kurt
1990Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
Part of a Book
Kavitha, Telikepalli2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Proceedings Article
Kavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
Kavitha, Telikepalli
Mehlhorn, Kurt
2005Attachment IconA Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665
Proceedings Article
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Journal Article
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
2007Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
Proceedings Article
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2004Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Proceedings Article
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna E.
2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
Journal Article
Kavitha, Telikepalli
Mestre, Julián
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Journal Article
Kavitha, Telikepalli
Mestre, Julian
2010Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
Electronic Journal Article
Kavitha, Telikepalli
Mestre, Julian
2009Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Proceedings Article
Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Journal Article
Kavitha, Telikepalli
Nasre, Meghana
2008Optimal Popular MatchingsMiscellaneous
Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K.
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
Kavitha, T.
Mestre, Julián
Nasre, M.
2009Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
Proceedings Article
Kavvadias, Dimitris J.
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1996Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
Journal Article
Kayal, Neeraj
Saha, Chandan
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
Kececioglu, John
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
Vingron, Martin
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.)2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
Kelsen, Pierre1996Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Proceedings Article
Kelsen, Pierre
Mahajan, Sanjeev
Ramesh, Hariharan
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Proceedings Article
Kerber, Michael2009Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Thesis - Doctoral dissertation
Kerber, Michael2008Attachment IconOn filter methods in CGAL's 2D curved kernelReport
Kerber, Michael
Sagraloff, Michael
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
Kerber, Michael
Sagraloff, Michael
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Journal Article
Kerber, Michael
Sagraloff, Michael
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Proceedings Article
Kerzmann, Andreas2000Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Thesis - Master's thesis
Kesselman, Alexander
Guez, Dan
Rosen, Adi
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
Kesselman, Alexander
Kogan, Kirill
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Proceedings Article
Kesselman, Alexander
Kowalski, Dariusz
2005Fast 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
Proceedings Article
Kesselman, Alexander
Kowalski, Dariusz
Segal, Michael
2005Attachment 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
Journal Article
Kesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
Kesselman, Alexander
Mansour, Yishay
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Journal Article
Kessler, Harald2002Robust Computation of Visibility Maps
Universität des Saarlandes
Thesis - Master's thesis
Keßler, Christoph W.
Träff, Jesper Larsson
1997Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221
Proceedings Article
Keßler, Christoph W.
Träff, Jesper Larsson
1996A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195
Proceedings Article
Kettner, Björn1998Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Thesis - Master's thesis
Kettner, Lutz2006Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Proceedings Article
Kettner, Lutz2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Electronic Proceedings Article
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Journal Article
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Journal Article
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
2006Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Proceedings Article
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
2005Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article
Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2006Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2008Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Journal Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Journal Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
2007On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Journal Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2007Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Journal Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
2007Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Journal Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
2005A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
2005Generating 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
Proceedings Article
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa
2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Journal Article
Khachiyan, Leonid
Porkolab, Lorant
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Journal Article
Khosla, Megha2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
Khuller, Samir
Malekian, Azarakhsh
Mestre, Julián
2007To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
Proceedings Article
Khuller, Samir
Mestre, Julián
2008An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610
Proceedings Article
Kirousis, Lefteris
Spirakis, Paul G.
Tsigas, Philippas
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
Klär, Gerhard1994Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Thesis - Master's thesis
Klauk, Mathias2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Thesis - Master's thesis
Klau, Gunnar W.2002A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes
Thesis - Doctoral dissertation
Klau, Gunnar W.1998Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenMiscellaneous
Klau, Gunnar W.
Klein, Karsten
Mutzel, Petra
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
Proceedings Article
Klau, Gunnar W.
Mutzel, Petra
2003Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608
Part of a Book
Klau, Gunnar W.
Mutzel, Petra
2000Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350
Proceedings Article
Klein, Christian2004Attachment IconA Fast Root Checking AlgorithmReport
Klein, Christian2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Thesis - Master's thesis
Klein, Karsten2000Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Thesis - Master's thesis
Klein, Rolf
Kutz, Martin
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
Klein, Rolf
Kutz, Martin
2006Attachment IconThe Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272
Proceedings Article
Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Journal Article
Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
1992Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Part of a Book
Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Proceedings Article
Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Report
Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
Kobel, Alexander2011Certified numerical root finding
Universität des Saarlandes
Thesis - Master's thesis
Kobel, Alexander2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
Thesis - Bachelor thesis
Kohlbacher, Oliver
Lenhof, Hans-Peter
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
Journal Article
Koldehofe, Boris1999Animation and Analysis of Distributed Algorithms
Universität des Saarlandes
Thesis - Master's thesis
Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
2000Attachment IconA Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375
Proceedings Article
Kollias, Konstantinos2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Electronic Journal Article
Könemann, Jochen1997Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes
Thesis - Master's thesis
Konidaris, G.
Mehlhorn, Kurt
Shell, D.A.
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsUnpublished/Draft
Kontogiannis, Spyros2002Lower 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
Proceedings Article
Kontogiannis, Spyros
Pantziou, Grammati E.
Spirakis, Paul G.
Yung, Moti
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
Konwar, Kishori
Kowalski, Dariusz
Shvartsman, Alexander
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
Proceedings Article
Kötzing, Timo2011Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Proceedings Article
Kötzing, Timo
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro S.
2010Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400
Proceedings Article
Kötzing, Timo
Molter, Hendrik
2012ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122
Proceedings Article
Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
Kötzing, Timo
Neumann, Frank
Spöhel, Reto
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
Proceedings Article
Kötzing, Timo
Neumann, Frank
Sudholt, Dirk
Wagner, Markus
2011Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218
Proceedings Article
Kötzing, Timo
Sudholt, Dirk
Theile, Madeleine
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
Proceedings Article
Kötzing, Timo
Sutton, Andrew M.
Neumann, Frank
O'Reilly, Una-May
2012The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
Proceedings Article
Kovács, Annamária2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Thesis - Doctoral dissertation
Kovács, Annamária2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
Kovács, Annamária2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Proceedings Article
Kovács, Annamária2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
Kovács, Annamária2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Proceedings Article
Kowalik, Lukasz2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Journal Article
Kowalik, Lukasz2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Journal Article
Kowalik, Lukasz2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
Proceedings Article
Kowalik, Lukasz2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Proceedings Article
Kowalski, Dariusz
Musial, Peter M.
Shvartsman, Alexander
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Proceedings Article
Kowalski, Dariusz
Pelc, Andrzej
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Journal Article
Kowalski, Dariusz
Pelc, Andrzej
2004Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182
Proceedings Article
Kowalski, Dariusz
Pelc, Andrzej
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Proceedings Article
Kowalski, Dariusz
Pelc, Andrzej
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Journal Article
Kowalski, Dariusz
Pelc, Andrzej
2003Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210
Proceedings Article
Kowalski, Dariusz
Shvartsman, Alex
2004Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320
Proceedings Article
Krandick, Werner
Mehlhorn, Kurt
2004New Bounds for the Descartes MethodReport
Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2006Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
Journal Article
Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2003Attachment 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
Proceedings Article
Kratsch, Stefan2010Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
Thesis - Doctoral dissertation
Kratsch, Stefan
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro Simone
2010Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213
Proceedings Article
Kratsch, Stefan
Marx, Dániel
Wahlström, Magnus
2010Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500
Proceedings Article
Kratsch, Stefan
Neumann, Frank
2009Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300
Proceedings Article
Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
Kratsch, Stefan
Schweitzer, Pascal
2010Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92
Proceedings Article
Kratsch, Stefan
Wahlström, Magnus
2012Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103
Proceedings Article
Kratsch, Stefan
Wahlström, Magnus
2012Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
Proceedings Article
Kratsch, Stefan
Wahlström, Magnus
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Proceedings Article
Krick, Christof
Meyer auf der Heide, Friedhelm
Räcke, Harald
Vöcking, Berthold
Westermann, Matthias
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
Krithivasan, Kamala
Rema, Anna
Schirra, Stefan
Vijaykumar, P.I.
1996Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
Kroeske, Jense
Ghandar, Adam
Michalewicz, Zbigniew
Neumann, Frank
2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
Krohmer, Anton2012Finding cliques in scale-free networks
Universität des Saarlandes
Thesis - Master's thesis
Krumke, Sven
van Stee, Rob
Westphal, Stefan
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
Krysta, Piotr2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Journal Article
Krysta, Piotr2001Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes
Thesis - Doctoral dissertation
Krysta, Piotr
Kumar, V. S. Anil
2001Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442
Proceedings Article
Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
2003Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
Proceedings Article
Krysta, Piotr
Solis-Oba, Roberto
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Journal Article
Ksinsik, Patric1996Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes
Thesis - Master's thesis
Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E.
1993Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Proceedings Article
Kuhn, Fabian
Panagiotou, Konstantinos
Spencer, Joel
Steger, Angelika
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
Proceedings Article
Kumar, V. S. Anil2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Journal Article
Kumar, V. S. Anil
Arya, Sunil
Ramesh, Hariharan
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
Kumar, V. S. Anil
Ramesh, Hariharan
1999Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251
Proceedings Article
Kursawe, Klaus1998Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Thesis - Master's thesis
Kutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Journal Article
Kutz, Martin
Pór, Attila
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
Kutz, Martin
Schweitzer, Pascal
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Proceedings Article
Kwappik, Carsten1998Exact Linear Programming
Universität des Saarlandes
Thesis - Master's thesis
Kwek, St.
Mehlhorn, Kurt
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
Journal Article
Lambert, Georg2001Ein Parametric Search Toolkit
Universität des Saarlandes
Thesis - Master's thesis
Lambert, Oliver2000Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes
Thesis - Master's thesis
Lang, Hans-Hermann1994Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes
Thesis - Master's thesis
Larsson, Andreas
Gidenstam, Anders
Ha, Phuong H.
Papatriantafilou, Marina
Tsigas, Philippas
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)2005Cache-Oblivious and Cache-Aware AlgorithmsReport
Lauer, Thorsten1998Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes
Thesis - Master's thesis
Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F.
2003Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
Proceedings Article
Lehnert, Jörg
Schweitzer, Pascal
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
Leinenbach, Stefan1997Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes
Thesis - Master's thesis
Lengauer, Thomas
Mehlhorn, Kurt
1986Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
Part of a Book
Lengauer, Thomas
Mehlhorn, Kurt
1984Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
Journal Article
Lengauer, Thomas
Mehlhorn, Kurt
1984Attachment IconThe HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149
Proceedings Article
Lengauer, Thomas
Mehlhorn, Kurt
1983Four results on the complexity of VLSI computationsReport
Lengauer, Thomas
Mehlhorn, Kurt
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit LayoutsReport
Lengauer, Thomas
Mehlhorn, Kurt
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design SystemReport
Lengauer, Thomas
Mehlhorn, Kurt
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Journal Article
Lenhof, Hans-Peter1999Bioinformatik
Universität des Saarlandes
Thesis - Habilitation thesis
Lenhof, Hans-Peter1997New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191
Proceedings Article
Lenhof, Hans-Peter1997Parallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48
Part of a Book
Lenhof, Hans-Peter1995An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Part of a Book
Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Journal Article
Lenhof, Hans-Peter
Smid, Michiel
1995Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Journal Article
Lenhof, Hans-Peter
Smid, Michiel
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Journal Article
Lenhof, Hans-Peter
Smid, Michiel
1994An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Proceedings Article
Lenhof, Hans-Peter
Smid, Michiel
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Journal Article
Lenhof, Hans-Peter
Smid, Michiel
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Journal Article
Lenhof, Hans-Peter
Smid, Michiel
1992Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Proceedings Article
Lenhof, Hans-Peter
Smid, Michiel
1992Maintaining 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
Proceedings Article
Lenhof, Hans-Peter
Smid, Michiel
1991An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
Lennerz, Christian2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Thesis - Doctoral dissertation
Leonardi, Stefano
Schäfer, Guido
2004Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243
Proceedings Article
Leonardi, Stefano
Schäfer, Guido
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
Lermen, Martin1997Multiple Sequence Alignment
Universität des Saarlandes
Thesis - Master's thesis
Lermen, Martin
Reinert, Knut
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Journal Article
Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard
1989Foundations of Programming LanguagesBook
Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard
1986Grundlagen der ProgrammiersprachenBook
Lokshtanov, Daniel
Saurabh, Saket
Wahlström, Magnus
2012Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
Loock, Achim
Schömer, Elmar
2001A Virtual Environment for Interactive Assembly Simulation: From Rigid Bodies to Deformable Cables
In: Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI-01): Emergent computing and virtual engineering, 325-332
Proceedings Article
Lotker, Zvi
Majumdar, Debapriyo
Narayanaswamy, N.S.
Weber, Ingmar
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
Lutter, Stefan1996Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes
Thesis - Master's thesis
Lüttke-Hüttmann, Dirk2000Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes
Thesis - Master's thesis
Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V.
1997Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Proceedings Article
Mainberger, Markus
Hoffmann, Sebastian
Weickert, Joachim
Tang, Ching Hoo
Johannsen, Daniel
Neumann, Frank
Doerr, Benjamin
2011Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37
Proceedings Article
Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.)1986VLSI algorithms and architectures : Aegean workshop on computingProceedings
Malamatos, Theocharis2008Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Journal Article
Malamatos, Theocharis2005Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194
Electronic Proceedings Article
Manjunath, Madhusudan2008Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes
Thesis - Master's thesis
Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Proceedings Article
Manjunath, Madhusudan
Sharma, Vikram
2011Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
Journal Article
Mannila, Heikki
Mehlhorn, Kurt
1985Attachment IconA fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272
Journal Article
Manss, Christian1997Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes
Thesis - Master's thesis
Margewitsch, Erwin1997Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes
Thesis - Master's thesis
Matijevic, Domagoj2007Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
Thesis - Doctoral dissertation
Maurer, Tanja1997Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes
Thesis - Master's thesis
Mavronicolas, Marios
Papatriantafilou, Marina
Tsigas, Philippas
1997The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
McConnella, Ross M.
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
2010Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
Electronic Journal Article
McGeoch, Catherine
Sanders, Peter
Fleischer, Rudolf
Cohen, Paul R.
Precup, Doina
2002Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
Part of a Book
Megow, Nicole2010Keller oder Dach zuerst
In: Besser als Mathe, 111-116
Part of a Book
Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
2012Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Journal Article
Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
2011Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
Megow, Nicole
Mestre, Julian
2013Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013),
Proceedings Article
Megow, Nicole
Möhring, Rolf H.
Schulz, Jens
2011Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
Journal Article
Megow, Nicole
Skutella, Martin
Verschae, Jose
Wiese, Andreas
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
Megow, Nicole
Verschae, Jose
2013Dual 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
Proceedings Article
Mehlhorn (ed.)1998Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer CongressProceedings
Mehlhorn (ed.)1989Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
Proceedings
Mehlhorn (ed.)1987Workshop über Komplexitätstheorie, Effiziente Algorithmen und DatenstrukturenProceedings
Mehlhorn (ed.)1985Theoretical aspects of computer science (STACS-85) : 2nd annual symposiumProceedings
Mehlhorn, Kurt2010Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Proceedings Article
Mehlhorn, Kurt2007Attachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Proceedings Article
Mehlhorn, Kurt2007Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Proceedings Article
Mehlhorn, Kurt2006Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Proceedings Article
Mehlhorn, Kurt2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
Mehlhorn, Kurt2003Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Proceedings Article
Mehlhorn, Kurt2003Attachment IconThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
Part of a Book
Mehlhorn, Kurt2002Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87
Proceedings Article
Mehlhorn, Kurt2001Attachment IconA Remark on the Sign Variation Method for Real Root IsolationUnpublished/Draft
Mehlhorn, Kurt2001Attachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
Part of a Book
Mehlhorn, Kurt2000Attachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Proceedings Article
Mehlhorn, Kurt1999Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Proceedings Article
Mehlhorn, Kurt1999The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Proceedings Article
Mehlhorn, Kurt1999The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Proceedings Article
Mehlhorn, Kurt1998Attachment IconAmortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102
Part of a Book
Mehlhorn, Kurt1996Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52
Proceedings Article
Mehlhorn, Kurt1996The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Proceedings Article
Mehlhorn, Kurt1995Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
Mehlhorn, Kurt1995Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363
Journal Article
Mehlhorn, Kurt1992Recent Developments in Algorithms for the Maximum Flow Problem (Abstract)
In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404
Proceedings Article
Mehlhorn, Kurt1988Attachment IconA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
Journal Article
Mehlhorn, Kurt1988SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29
Proceedings Article
Mehlhorn, Kurt1987A Faster Approximation Algorithm for the Steiner Problem in GraphsReport
Mehlhorn, Kurt1986Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Journal Article
Mehlhorn, Kurt1984Channel Routing in Knock-Knee Mode: Simplified Algorithms and ProofReport
Mehlhorn, Kurt1984Data structures and algorithms. Volume 1 : Sorting and searchingBook
Mehlhorn, Kurt1984Data structures and algorithms. Volume 2 : Graph algorithms and NP-completenessBook

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