| Title | Author(s) [non member] | Editor(s) [non member] | Year | Type |
|---|
| 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452 | Solis-Oba, Roberto | Bilardi, Gianfranco
Italiano, Giuseppe F.
[Pietracaprina, Andrea]
[Pucci, Geppino] | 1998 | Proceedings Article |
| 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25 | [Jünger, Michael]
Mutzel, Petra |  | 1997 | Journal Article |
 | 2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes | Weiskircher, Rene | | 1997 | Thesis - Masters thesis |
| 21st Annual Symposium on Computational Geometry (SCG'05) | | [Mitchell, Joe]
[Rote, Günter]
Kettner, Lutz | 2005 | Proceedings |
| 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | Fountoulakis, Nikolaos
[Panagiotou, Konstantinos] | | 2011 | Journal Article |
| 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | [Cooley, Oliver]
Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk] | | 2008 | Journal Article |
| 7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping | Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter | Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian | 2002 | Proceedings |
| A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30 | [Auletta, Vincenzo]
[Dinitz, Yefim]
Nutov, Zeev
[Parente, Domenico] | | 1999 | Journal Article |
| A 2-Approximation Algorithm for the Directed Multiway Cut Problem
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 548-553 | Zosin, Leonid | | 1997 | Proceedings Article |
| A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30 | [Dinitz, Yefim]
Nutov, Zeev | | 1999 | Journal Article |
| A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309 | Garg, Naveen | | 1996 | Proceedings Article |
| A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926 | Sanders, Peter
Sibeyn, Jop F. | Bode, Arndt
Ludwig, Thomas
Karl, Wolfgang
Wismüller, Roland | 2000 | Proceedings Article |
| A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38 | Sanders, Peter
[Sibeyn, Jop F.] | | 2003 | Journal Article |
| A best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239 | Mehlhorn, Kurt | | 1977 | Journal Article |
| A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | [Calinescu, Gruia]
[Fernandes, Cristina G.]
Finkler, Ulrich
[Karloff, Howard] | | 1996 | Proceedings Article |
| A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | [Calinescu, Gruia]
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | | 1998 | Journal Article |
| A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274 | [Chlebus, Bogdan S.]
Kowalski, Dariusz | [Chaudhuri, Soma]
[Kutten, Shay] | 2004 | Proceedings Article |
| A Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250 | Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John | | 1997 | Proceedings Article |
| A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447 | [Christof, Thomas]
[Jünger, Michael]
[Kececioglu, John]
Mutzel, Petra
[Reinelt, Gerhard] | | 1997 | Journal Article |
| A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92 | Christof, Thomas
[Jünger, Michael]
Kececioglu, John
Mutzel, Petra
[Reinelt, Gerhard] | | 1997 | Proceedings Article |
| A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | [Agrawal, Manindra]
Saha, Chandan
[Saxena, Nitin] | | 2013 | Proceedings Article |
| A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69 | Saha, Chandan
[Saptharishi, Ramprasad]
[Saxena, Nitin] | | 2013 | Electronic Journal Article |
| A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534 | [Rathe, Ulrich]
Sanders, Peter
[Knight, Peter] | | 1999 | Journal Article |
| A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176 | Schirra, Stefan | [Goodrich, Michael T.]
[McGeoch, Catherine C.] | 1999 | Proceedings Article |
| A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307 | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | [Halperin, Dan]
Mehlhorn, Kurt | 2008 | Proceedings Article |
| A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163 | Müller, Michael
Rüb, Christine
[Rülling, Wolfgang] | | 1996 | Journal Article |
| A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289 | [Albrecht, Marc]
Karrenbauer, Andreas
[Xu, Chihao] | | 2008 | Proceedings Article |
| A 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 | Eisenbrand, Friedrich
Funke, Stefan
[Garg, Naveen]
[Könemann, Jochen] | | 2003 | Proceedings Article |
| A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes | Klau, Gunnar W. | | 2002 | Thesis - PhD thesis |
| A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24 | Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter | Shamir, Ron
Miyano, Satoru
Istrail, Sorin
Pevzner, Pavel
Waterman, Michael | 2000 | Proceedings Article |
| A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612 | Althaus, Ernst
[Kohlbacher, Oliver]
[Lenhof, Hans-Peter]
Müller, Peter | | 2002 | Journal Article |
| A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8 | Duan, Ran
Mehlhorn, Kurt | | 2012 | Electronic Journal Article |
| A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139 | Albers, Susanne
[von Stengel, Bernhard]
[Wechner, Ralph] | | 1995 | Journal Article |
| A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | Fleischer, Rudolf
[Jung, Hermann]
Mehlhorn, Kurt | | 1995 | Journal Article |
| A comparison of polynomial evaluation schemes | Schmitt, Susanne
Fousse, Laurent | | 2004 | Report |
| A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261 | Polzin, Tobias
[Vahdati Daneshmand, Siavash] | | 2001 | Journal Article |
| A competitive analysis of the list update problem with lookahead
In: Theoretical Computer Science [197], 95-109 | Albers, Susanne | | 1998 | Journal Article |
| A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron | Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette | | 1993 | Report |
| A 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 | Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette | Dehne, Frank K. H. A.
Sack, Jörg-Rüdiger
Santoro, Nicola
Whitesides, Sue | 1993 | Proceedings Article |
| A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157 | [Pountourakis, Emmanouil]
Vidali, Angelina | [de Berg, Mark]
[Meyer, Ulrich] | 2010 | Proceedings Article |
| A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109 | [Boros, Endre]
Elbassioni, Khaled
Gurvich, Vladimir
[Makino, Kazuhisa]
[Oudalov, Vladimir] | | 2008 | Proceedings Article |
| A 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 | Emeliyanenko, Pavel | [Moreno Maza, Marc]
[Roch, Jean-Louis] | 2010 | Proceedings Article |
| A complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138 | Mehlhorn, Kurt
[Shermer, Thomas C.]
[Yap, Chee] | | 1997 | Proceedings Article |
| A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494 | Hemmer, Michael
[Dupon, Laurent]
[Petitjean, Sylvain]
[Schomer, Elmar] | | 2011 | Journal Article |
| A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186 | Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar | [Möhring, Rolf]
[Raman, Rajeev] | 2002 | Proceedings Article |
| A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304 | Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim | | 1998 | Journal Article |
| A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263 | Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim | | 1997 | Proceedings Article |
| A computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610 | Ajwani, Deepak
[Dementiev, Roman]
Meyer, Ulrich | | 2006 | Proceedings Article |
| A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Bonifaci, Vincenzo
[Marchetti-Spaccamela, Alberto]
[Stiller, Sebastian] | | 2012 | Journal Article |
| A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681 | [Crochemore, Maxime]
Gasieniec, Leszek
[Hariharan, Ramesh]
[Muthukrishnan, S.]
[Rytter, Wojciech] | | 1998 | Journal Article |
| A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254 | [Arikati, Srinivasa Rao]
Mehlhorn, Kurt | | 1999 | Journal Article |
| A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254 | [Rajaraman, Rajmohan]
[Richa, Andrea W.]
Vöcking, Berthold
[Vuppuluri, Gayathri] | | 2001 | Proceedings Article |
| A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | Ganzha, Viktor G.
Mayr, Ernst W.
Vorozhtsov, Evgenii V. | 2005 | Proceedings Article |
| A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90 | Mehlhorn, Kurt
Sagraloff, Michael | | 2011 | Journal Article |
| A deterministic Bitstream Descartes Algorithm | Mehlhorn, Kurt
Sagraloff, Michael | | 2008 | Report |
| A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016 | Christodoulou, George
[Kovács, Annamária] | [Charikar, Moses] | 2010 | Proceedings Article |
| A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | [Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun] | | 2007 | Journal Article |
| A fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272 | Mannila, Heikki
Mehlhorn, Kurt | | 1985 | Journal Article |
| A Fast Root Checking Algorithm | Klein, Christian | | 2004 | Report |
| A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | Díaz, Josep
[Karhumäki, Juhani]
[Lepistö, Arto]
[Sannella, Donald] | 2004 | Proceedings Article |
| A Faster Approximation Algorithm for the Steiner Problem in Graphs | Mehlhorn, Kurt | | 1987 | Report |
| A faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128 | Mehlhorn, Kurt | | 1988 | Journal Article |
| A faster compaction algorithm with automatic jog insertion | Mehlhorn, Kurt
Näher, Stefan | | 1987 | Report |
| A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166 | Mehlhorn, Kurt
Näher, Stefan | | 1990 | Journal Article |
| A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261 | [Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt | [Bugliesi, Michele]
[Preneel, Bart]
[Sassone, Vladimir]
[Wegener, Ingo] | 2006 | Proceedings Article |
| A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | [Böcker, Sebastian]
[Hüffner, Falk]
[Truss, Anke]
Wahlström, Magnus | [Chen, Jianer]
[Fomin, Fedor V.] | 2009 | Proceedings Article |
| A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73 | Miller, Tobias
Zaroliagis, Christos | [Italiano, Giuseppe]
[Orlando, S.] | 1997 | Proceedings Article |
| A Framework for the Verification of Certifying Computations | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | | 2013 | Unpublished/Draft |
| A game on graphs | Mehlhorn, Kurt | | 1975 | Report |
| A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506 | Sagraloff, Michael | | 2010 | Journal Article |
| A General Approach to the Analysis of Controlled Perturbation Algorithms | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | 2008 | Report |
| A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | 2011 | Journal Article |
| A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057 | [Fuhrmann, Artur]
Schömer, Elmar | | 2001 | Proceedings Article |
| A Generalization of Janson inequalities and its application to finding shortest paths
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 795-804 | Subramanian, C. R. | | 1999 | Proceedings Article |
| A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | [Cole, Richard]
Kowalik, Lukasz
[Skrekovski, Riste] | | 2007 | Journal Article |
| A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124 | Banderier, Cyril | | 2000 | Proceedings Article |
| A Generic Algebraic Kernel for Non-linear Geometric Applications | Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael] | | 2010 | Report |
| A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186 | Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael] | [Hurtado, Ferran]
[van Krefeld, Marc] | 2011 | Proceedings Article |
| A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647 | Berberich, Eric
Sagraloff, Michael | | 2009 | Journal Article |
| A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182 | Berberich, Eric
Sagraloff, Michael | [Haines, Eric]
[McGuire, Morgan] | 2008 | Proceedings Article |
| A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | 2007 | Journal Article |
| A Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes | Maue, Jens | | 2006 | Thesis - Masters thesis |
| A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569 | Träff, Jesper Larsson | | 1996 | Journal Article |
| A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | | 2003 | Journal Article |
| A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253 | Mehlhorn, Kurt
Schäfer, Guido | [Meyer auf der Heide, Friedhelm] | 2001 | Proceedings Article |
| A heuristic for solving interior point Methods exactly
Universität des Saarlandes | Naujoks, Rouven | | 2004 | Thesis - Masters thesis |
| A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278 | Althaus, Ernst
[Canzar, Stefan] | [Dress, Andreas]
[Xu, Yinfeng]
[Zhu, Binhai] | 2007 | Proceedings Article |
| A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | Althaus, Ernst
Canzar, Stefan | | 2008 | Journal Article |
| A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | Alt, Helmut
Mehlhorn, Kurt | | 1975 | Journal Article |
| A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195 | [Keßler, Christoph W.]
Träff, Jesper Larsson | | 1996 | Proceedings Article |
| A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | Mehlhorn, Kurt
Näher, S | Kreczmar, Antoni
Mirkowska, Grazyna | 1989 | Proceedings Article |
| A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | Kaufmann, Michael
Mehlhorn, Kurt | | 1988 | Report |
| A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246 | Kaufmann, Michael
Mehlhorn, Kurt | | 1994 | Journal Article |
| A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188 | Solis-Oba, Roberto
[Jansen, Klaus]
[Sviridenko, Maxim] | [Hochbaum, Dorit]
[Jansen, Klaus]
[Rolim, José D. P.]
[Sinclair, Alistair] | 1999 | Proceedings Article |
| A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt | | 1994 | Journal Article |
| A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | 2011 | Unpublished/Draft |
| A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170 | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | | 2007 | Proceedings Article |
| A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | | 2009 | Journal Article |
| A Lower Bound for the Complexity of the Union-Split-Find Problem | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | 1986 | Report |
| A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | Ottmann, Thomas | 1987 | Proceedings Article |
| A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128 | Hagerup, Torben | | 1995 | Journal Article |
| A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt | | 1992 | Journal Article |
| A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | | 1988 | Journal Article |
| A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | | 1991 | Report |
| A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | [Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.] | | 1996 | Journal Article |
| A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Katajainen, Jyrki
Träff, Jesper Larsson | [Bongiovanni, Giancarlo]
[Bovet, Daniel Pierre]
[Di Battista, Guiseppe] | 1997 | Proceedings Article |
| A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | [Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan] | | 2008 | Journal Article |
| A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87 | Angelopoulos, Spyros | | 2008 | Proceedings Article |
| A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | [Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Wahl, Jürgen] | [Morreale, Jay] | 2007 | Proceedings Article |
| A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | [Wang, Lusheng] | 2005 | Proceedings Article |
| A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), | [Günther, Elisabeth]
[Maurer, Olaf]
Megow, Nicole
Wiese, Andreas | | 2013 | Proceedings Article |
| A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88 | [Berg, Marc de]
[Kreveld, Marc van]
Schirra, Stefan | | 1995 | Proceedings Article |
| A New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721 | Paluch, Katarzyna | [Asano, Tetsuo] | 2006 | Proceedings Article |
| A new approximation algorithm for the planar augmentation problem
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 260-269 | Fialko, Sergej
Mutzel, Petra | | 1998 | Proceedings Article |
| A 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 | Jansen, Klaus | [Lucchesi, Cláudio L.]
[Moura, Arnaldo V.] | 1998 | Proceedings Article |
| A New Combinatorial Approach to Parametric Path Analysis | [Althaus, Ernst]
[Altmeyer, Sebastian]
Naujoks, Rouven | [Becker, Bernd]
[Damm, Werner]
[Fränzle, Martin]
[Olderog, Ernst-Rüdiger]
[Podelski, Andreas]
[Wilhelm, Reinhard] | 2010 | Report |
| A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184 | Huddleston, Scott
Mehlhorn, Kurt | | 1982 | Journal Article |
| A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112 | Mehlhorn, Kurt | Noltemeier, Hartmut | 1980 | Proceedings Article |
| A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | [Gnewuch, Michael]
Wahlström, Magnus
Winzen, Carola | | 2012 | Journal Article |
| A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370 | Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco | [Borgefors, G]
[Nystrom, I]
[Sanniti di Baja, G] | 2000 | Proceedings Article |
| A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379 | De Sterck, Hans | | 2012 | Journal Article |
| A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45 | Croitoru, Cosmina
Kötzing, Timo | | 2014 | Proceedings Article |
| A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612 | Jünger, Michael
[Leipert, Sebastian]
Mutzel, Petra | | 1998 | Journal Article |
| A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73 | [Chrobak, Marek]
[Dürr, Christoph]
[Jawor, Wojciech]
Kowalik, Lukasz
[Kurowski, Maciej] | | 2006 | Journal Article |
| A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | [Chan, Ho-Leung]
Megow, Nicole
[Sitters, René]
van Stee, Rob | | 2012 | Journal Article |
| A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277 | Elbassioni, Khaled | | 2008 | Journal Article |
| A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430 | [Kerber, Michael]
Sagraloff, Michael | | 2011 | Journal Article |
| A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693 | Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos | Feitelson, Dror G.
Rudolph, Larry | 1997 | Proceedings Article |
| A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21 | Brodal, Gerth Stølting
Träff, Jesper Larsson
Zaroliagis, Christos | | 1998 | Journal Article |
| A Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731 | Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter | [Brim, Lubos]
[Gruska, Jozef]
[Zlatuska, Jiri] | 1998 | Proceedings Article |
| A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760 | Mehlhorn, Kurt | | 1982 | Journal Article |
| A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141 | Bast, Holger
[Dietzfelbinger, Martin]
Hagerup, Torben | | 1992 | Proceedings Article |
| A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776 | Schmidt, Jens M. | | 2013 | Proceedings Article |
| A Polyhedral Approach to Planar Augmentation and Related Problems
In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507 | Mutzel, Petra | Spirakis, Paul | 1995 | Proceedings Article |
| A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530 | Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin] | | 1998 | Journal Article |
| A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162 | Lenhof, Hans-Peter
Reinert, Knut
[Vingron, Martin] | [Istrail, Sorin]
[Pevzner, Pavel]
[Waterman, Michael] | 1998 | Proceedings Article |
| A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | [Kececioglu, John]
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
[Vingron, Martin] | | 2000 | Journal Article |
| A polyhedral approach to sequence alignment problems
Universität des Saarlandes | Reinert, Knut | | 1999 | Thesis - PhD thesis |
| A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272 | Althaus, Ernst
Fink, Christian | [Cook, William J.]
[Schulz, Andreas S.] | 2002 | Proceedings Article |
| A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24 | [Jünger, Michael]
Lee, E. K.
Mutzel, Petra
[Odenthal, Thomas] | Di Battista, Giuseppe | 1997 | Proceedings Article |
| A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25 | Garg, Naveen
[Vazirani, Vijay V.] | | 1995 | Journal Article |
| A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375 | Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim | | 2000 | Proceedings Article |
| A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33 | [Canzar, Stefan]
Elbassioni, Khaled
Mestre, Julian | | 2010 | Proceedings Article |
| A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665 | Kavitha, Telikepalli
Mehlhorn, Kurt | [Diekert, Volker]
[Durand, Bruno] | 2005 | Proceedings Article |
| A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36 | Beier, Rene
Sibeyn, Jop F. | [Flammini, Michele]
[Nardelli, Enrico]
[Proietti, Guido]
[Spirakis, Paul] | 2000 | Proceedings Article |
| A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690 | Katriel, Irit
Sanders, Peter
[Träff, Jesper Larsson] | [Di Battista, Giuseppe]
[Zwick, Uri] | 2003 | Proceedings Article |
| A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392 | Behle, Markus
[Jünger, Michael]
[Liers, Frauke] | [Demetrescu, Camil] | 2007 | Proceedings Article |
| A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T. | | 1982 | Journal Article |
| A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486 | [Schalekamp, Frans]
[Williamson, David P.]
van Zuylen, Anke | [Rabani, Yuval] | 2012 | Proceedings Article |
| A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354 | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | [Eisenbrand, Friedrich]
[Shepherd, F. Bruce] | 2010 | Proceedings Article |
| A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723 | Chan, T.-H. Hubert
Elbassioni, Khaled | | 2011 | Journal Article |
| A 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 | Elbassioni, Khaled
[Chan, Hubert] | [Charikar, Moses] | 2010 | Proceedings Article |
| A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524 | Elbassioni, Khaled | [Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger] | 2012 | Proceedings Article |
| A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | [Curticapean, Radu]
Künnemann, Marvin | [Bodlaender, Hans L.]
[Italiano, Giuseppe F.] | 2013 | Proceedings Article |
| A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 | Philip, Geevarghese
[Raman, Venkatesh]
[Villanger, Yngve] | [Thilikos, Dimitrios M.] | 2010 | Proceedings Article |
| A Quasi-PTAS for Envy-free Pricing on Line Graphs | Elbassioni, Khaled M.
[Sitters, Rene]
[Zhang, Yan] | | 2007 | Unpublished/Draft |
| A 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 | Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan] | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | 2007 | Proceedings Article |
| A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | | 2001 | Journal Article |
| A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226 | [Cheriyan, Joseph]
Hagerup, Torben | | 1995 | Journal Article |
| A randomized on-line algorithm for the k-server problem on a line | Csaba, Bela
[Lodha, Sachin] | | 2001 | Report |
| A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104 | Csaba, Bela
[Lodha, S.] | | 2006 | Journal Article |
| A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 | Jez, Artur | [Kulikov, Alexander]
[Kuznetsov, Sergei]
[Pevzner, Pavel] | 2014 | Proceedings Article |
| A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51 | [Dietzfelbinger, Martin]
Hagerup, Torben
Katajainen, Jyrki
[Penttonen, Martti] | | 1997 | Journal Article |
| A Remark on the Sign Variation Method for Real Root Isolation | Mehlhorn, Kurt | | 2001 | Unpublished/Draft |
| A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
Neumann, Frank | | 2007 | Proceedings Article |
| A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | Govindarajan, Sathish
[Dietze, Michael C.]
[Agarwal, Pankaj K.]
[Clark, James S.] | | 2008 | Journal Article |
| A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117 | De Sterck, Hans | | 2012 | Journal Article |
| A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | [Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne | | 2009 | Journal Article |
| A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265 | [Burnikel, Christoph]
Funke, Stefan
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne | [Meyer auf der Heide, Friedhelm] | 2001 | Proceedings Article |
| A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Baswana, Surender
[Sen, Sandeep] | | 2007 | Journal Article |
| A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 | [Akbari, Hoda]
[Berenbrink, Petra]
Sauerwald, Thomas | [Kowalski, Darek]
[Panconesi, Alessandro] | 2012 | Proceedings Article |
| A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149 | Fleischer, Rudolf | | 1996 | Journal Article |
| A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360 | Sagraloff, Michael
[Yap, Chee] | [Leykin, Anton] | 2011 | Proceedings Article |
| A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17 | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | | 2007 | Journal Article |
| A 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 | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | 2005 | Proceedings Article |
| A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | [Funke, Stefan]
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | 2006 | Journal Article |
| A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124 | Träff, Jesper Larsson
Zaroliagis, Christos | | 2000 | Journal Article |
| A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194 | Träff, Jesper Larsson
Zaroliagis, Christos | Ferreira, Afonso
[Rolim, José]
[Saad, Youssef]
[Yang, Tao] | 1996 | Proceedings Article |
| A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244 | Schmidt, Jens M. | | 2013 | Journal Article |
| A simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276 | Pettie, Seth
Sanders, Peter | | 2004 | Journal Article |
| A Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
| Sanders, Peter
Pettie, Seth | | 2004 | Report |
| A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 | [Kim, Eun Jung]
[Paul, Christophe]
Philip, Geevarghese | [Fomin, Fedor V.]
[Kaski, Petteri] | 2012 | Proceedings Article |
| A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309 | Mehlhorn, Kurt
Schmidt, Bernd H. | Karpinski, Marek | 1983 | Proceedings Article |
| A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 | [Alberts, David]
[Cattaneo, G]
[Italiano, Giuseppe]
[Nanni, Umberto]
Zaroliagis, Christos | [Battiti, R]
Bertosi, A | 1998 | Proceedings Article |
| A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | | 2000 | Journal Article |
| A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709 | Mehlhorn, Kurt
Burnikel, Christoph
Fleischer, Rudolf
Schirra, Stefan | | 1997 | Proceedings Article |
| A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35 | Crauser, Andreas
Ferragina, Paolo | | 2002 | Journal Article |
| A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | [Caragiannis, Ioannis]
Fishkin, Aleksei V.
[Kaklamanis, Christos]
[Papaioannou, Evi] | | 2007 | Journal Article |
| A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | 2007 | Proceedings Article |
| A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213 | Wahlström, Magnus | [Grohe, Martin]
[Niedermeier, Rolf] | 2008 | Proceedings Article |
| A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401 | Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt | van Leeuwen, Jan
Santoro, Nicola | 1991 | Proceedings Article |
| A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Doerr, Benjamin
[Fouz, Mahmoud] | | 2009 | Journal Article |
| A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193 | [Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob | [Saberi, Amin] | 2010 | Proceedings Article |
| A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | [Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob | | 2013 | Journal Article |
| A 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 | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | [Sanjeev Khanna] | 2013 | Proceedings Article |
| A Virtual Environment for Interactive Assembly Simulation: From Rigid Bodies to Deformable Cables
In: Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI-01): Emergent computing and virtual engineering, 325-332 | [Loock, Achim]
Schömer, Elmar | | 2001 | Proceedings Article |
| A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258 | [Kerber, Michael]
Sagraloff, Michael | | 2012 | Journal Article |
| A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273 | Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A. | | 1987 | Journal Article |
| A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | Harren, Rolf
[Jansen, Klaus]
[Prädel, Lars]
van Stee, Rob | [Dehne, Frank]
[Iacono, John]
[Sack, Jörg-Rüdiger] | 2011 | Proceedings Article |
| Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75 | Harren, Rolf
van Stee, Rob | | 2012 | Journal Article |
| Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013, | Croitoru, Cosmina | | 2013 | Proceedings Article |
| Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), | Wahlström, Magnus | [Portier, Natacha]
[Wilke, Thomas] | 2013 | Electronic Proceedings Article |
| Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), - | Emeliyanenko, Pavel | | 2010 | Poster |
| Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664 | Sanders, Peter | [Wiedermann, J.]
[van Emde Boas, P.]
[Nielsen, Mogens] | 1999 | Proceedings Article |
| Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344 | Arya, Sunil
[Mount, David M.]
[Narayan, Oruttom] | | 1995 | Proceedings Article |
| Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176 | Arya, Sunil
Mount, David M.
[Narayan, Oruttom] | | 1996 | Journal Article |
| ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | Kötzing, Timo
[Molter, Hendrik] | [Coello Coello, Carlos A.]
[Cutello, Vincenzo]
[Deb, Kalyanmoy]
[Forrest, Stephanie]
[Nicosia, Giuseppe]
[Pavone, Mario] | 2012 | Proceedings Article |
| ACO beats EA on a dynamic pseudo-Boolean function
Universität des Saarlandes | Molter, Hendrik | | 2012 | Thesis - Masters thesis |
| Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912 | Gasieniec, Leszek
[Pelc, Andrzej] | | 1996 | Journal Article |
| Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | Doerr, Benjamin
[Goldberg, Leslie Ann] | | 2013 | Journal Article |
| Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Doerr, Benjamin
[Goldberg, Leslie Ann] | [Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter] | 2010 | Proceedings Article |
| Adaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160 | Mestre, Julián | | 2008 | Proceedings Article |
| Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057 | Mestre, Julian | | 2010 | Journal Article |
| Additive 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 | [Horoba, Chrisitian]
Neumann, Frank | | 2009 | Proceedings Article |
| Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | [Baswana, Surender]
[Kavitha, Telikepalli]
Mehlhorn, Kurt
[Pettie, Seth] | | 2011 | Journal Article |
| Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Doerr, Benjamin
Johannsen, Daniel | [Thierens, Dirk] | 2007 | Proceedings Article |
| Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | Kowalik, Lukasz | | 2007 | Journal Article |
| AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 | [Alberts, David]
Gutwenger, Carsten
Mutzel, Petra
[Näher, Stefan] | [Italiano, Giuseppe]
[Orlando, S.] | 1997 | Proceedings Article |
| AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian] | [Whitesides, Sue H.] | 1998 | Proceedings Article |
| Agorithmen der modularen Arithmetik
Universität des Saarlandes | Ashoff, Oliver | | 2000 | Thesis - Masters thesis |
| Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3 | Hemmer, Michael | | 2007 | Manual |
| Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155 | [Mourrain, Bernard]
[Pion, Sylvain]
Schmitt, Susanne
[Técourt, Jean-Pierre]
[Tsigaridas, Elias]
Wolpert, Nicola | [Boissonnat, Jean-Daniel]
[Teillaud, Monique] | 2007 | Part of a Book |
| Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508 | Mehlhorn, Kurt
Näher, Stefan | van Leeuwen, Jan | 1992 | Proceedings Article |
| Algorithm Engineering for Large Data Sets
Universität des Saarlandes | Dementiev, Roman | | 2006 | Thesis - PhD thesis |
| Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23 | [Bader, David]
[Moret, Bernard]
Sanders, Peter | [Fleischer, Rudolf]
[Moret, Bernard]
[Meineche Schmidt, Erik] | 2002 | Part of a Book |
| Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes | Ost, Kirstin | | 1995 | Thesis - Masters thesis |
| Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207 | [Brandenburg, Franz J.]
[Jünger, Michael]
Mutzel, Petra | | 1997 | Journal Article |
| Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes | Croitoru, Cosima | | 2012 | Thesis - Masters thesis |
| Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30 | [Arumugam, S.]
[Chandrasekar, K. Raja]
[Misra, Neeldhara]
Philip, Geevarghese
[Saurabh, Saket] | [Iliopoulos, Costas S.]
[Smyth, William F.] | 2011 | Proceedings Article |
| Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474 | Hermelin, Danny
[Rizzi, Romeo]
[Vialette, Stephane] | [Chao, Kun-Mao]
[Hsu, Tsan-sheng]
[Lee, Der-Tsai] | 2012 | Proceedings Article |
| Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus | | 2010 | Journal Article |
| Algorithmic Game Theory and Networks
Universität des Saarlandes | Pyrga, Evangelia | | 2010 | Thesis - PhD thesis |
| Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | [Brown, Christopher]
El Kahoui, M'hammed
[Novotni, Dominik]
[Weber, Andreas] | | 2006 | Journal Article |
| Algorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359 | Bonifaci, Vincenzo
Chan, Ho-Leung
[Marchetti-Spaccamela, Alberto]
Megow, Nicole | [Charikar, Moses] | 2010 | Proceedings Article |
| Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619 | [Bonifaci, Vincenzo]
[Chan, Ho-Leung]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole | | 2012 | Journal Article |
| Algorithms and Data Structures: The Basic Toolbox | Mehlhorn, Kurt
[Sanders, Peter] | | 2008 | Book |
| Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714 | [Laura, Luigi]
[Leonardi, Stefano]
[Millozzi, Stefano]
Meyer, Ulrich
[Sibeyn, Jop F.] | [Di Battista, Giuseppe]
[Zwick, Uri] | 2003 | Proceedings Article |
| Algorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236 | [Donato, Debora]
[Laura, Luigi]
[Leonardi, Stefano]
[Millozzi, Stefano]
Meyer, Ulrich
[Sibeyn, Jop F.] | | 2006 | Electronic Journal Article |
| Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158 | [Subramanian, C. R.]
[Fürer, Martin]
Veni Madhavan, C. E. | | 1998 | Journal Article |
| Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77 | Subramanian, C. R. | | 2000 | Journal Article |
| Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549 | [Cheriyan, Joseph]
Mehlhorn, Kurt | | 1996 | Journal Article |
| Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510 | Elbassioni, Khaled | | 2009 | Journal Article |
| Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265 | Hariharan, Ramesh
[Kapoor, Sanjiv] | | 1995 | Journal Article |
| Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | 2003 | Proceedings Article |
| Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | 1996 | Journal Article |
| Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | 1996 | Journal Article |
| Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | [Albers, Susanne]
[Radzik, Tomasz] | 2004 | Proceedings Article |
| Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes | Gergov, Jordan | | 2000 | Thesis - PhD thesis |
| Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351 | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Xu, Chihao] | [Camil Demetrescu] | 2007 | Proceedings Article |
| Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518 | [Frederickson, Greg N.]
Solis-Oba, Roberto | | 1998 | Journal Article |
| Algorithms for Memory Hierarchies | | Meyer, Ulrich
Sanders, Peter
[Sibeyn, Jop F.] | 2003 | Book |
| Algorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140 | El Kahoui, M'hammed | [Gutierrez, Jaime] | 2004 | Proceedings Article |
| Algorithms for routing in planar graphs | Becker, Michael
Mehlhorn, Kurt | | 1984 | Report |
| Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176 | Becker, Michael
Mehlhorn, Kurt | | 1986 | Journal Article |
| Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101 | Sanders, Peter | Van Emde Boas, Peter
Pokorný, Jaroslav
Bieliková, Mária
Stuller, Július | 2004 | Proceedings Article |
| Algorithms for the Steiner Problem in Networks
Universität des Saarlandes | Polzin, Tobias | | 2003 | Thesis - PhD thesis |
| Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Kavitha, Telikepalli
Mehlhorn, Kurt | | 2007 | Journal Article |
| Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425 | Althaus, Ernst
[Caprara, Alberto]
[Lenhof, Hans-Peter]
[Reinert, Knut] | | 2006 | Journal Article |
| All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376 | Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos | Thiagarajan, P. S. | 1995 | Proceedings Article |
| All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110 | Arikati, Srinivasa Rao
Chaudhuri, Shiva
Zaroliagis, Christos | | 1998 | Journal Article |
| All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679 | Baswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep] | [Diekert, Volker]
[Durand, Bruno] | 2005 | Proceedings Article |
| All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343 | Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen | | 2002 | Journal Article |
| Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes | Becker, Jörg | | 1996 | Thesis - Masters thesis |
| Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197 | Hagerup, Torben | | 1997 | Journal Article |
| Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33 | Hagerup, Torben | Ferreira, Afonso
Rolim, José
Saad, Youssef
[Yang, Tao] | 1996 | Proceedings Article |
| Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539 | Vöcking, Berthold | | 2001 | Proceedings Article |
| Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231 | Schnorr, C. P.
Subramanian, C. R. | [Luby, Michael]
Rolim, José
[Serna, Maria] | 1998 | Proceedings Article |
| Almost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78 | Eigenwillig, Arno
[Sharma, Vikram]
[Yap, Chee K.] | [Dumas, Jean-Guillaume] | 2006 | Electronic Proceedings Article |
| Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48 | Gawrychowski, Pawel | [Bulatov, Andrei A.]
[Shur, Arseny M.] | 2013 | Proceedings Article |
| Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21 | Hoefer, Martin
[Skopalik, Alexander] | | 2013 | Journal Article |
| Amortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102 | Mehlhorn, Kurt | Ottmann, Thomas | 1998 | Part of a Book |
| An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | [Hert, Susan]
[Hoffmann, Michael]
Kettner, Lutz
[Pion, Sylvain]
[Seel, Michael] | | 2007 | Journal Article |
| An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90 | Hert, Susan
[Hoffmann, Michael]
[Kettner, Lutz]
[Pion, Sylvain]
Seel, Michael | [Brodal, Gerth Stolting]
[Frigioni, Daniele]
[Marchetti-Spaccamela, Alberto] | 2001 | Proceedings Article |
| An Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435 | Elbassioni, Khaled M. | | 2002 | Proceedings Article |
| An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139 | Lenhof, Hans-Peter | [Schomburg, Dietmar]
[Lessel, Uta] | 1995 | Part of a Book |
| An alternative method to crossing minimization on hierarchical graphs
In: Proceedings of the 4th Symposium on Graph Drawing (GD-96), 318-333 | Mutzel, Petra | [North, Stephen] | 1996 | Proceedings Article |
| An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080 | Mutzel, Petra | | 2001 | Journal Article |
| An Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | 1986 | Journal Article |
| An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10 | [Bifet, Albert]
[Castillo, Carlos]
[Chirita, Paul-Elexandru]
Weber, Ingmar | [Davison, Brian] | 2005 | Electronic Proceedings Article |
| An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242 | [Cheriyan, Joseph]
Mehlhorn, Kurt | | 1999 | Journal Article |
| An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387 | Lenhof, Hans-Peter
Smid, Michiel | | 1994 | Proceedings Article |
| An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213 | [Barve, Rakesh D.]
Grove, Edward
[Vitter, Jeffrey Scott] | | 1995 | Proceedings Article |
| An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes | Steurer, David | | 2006 | Thesis - Masters thesis |
| An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906 | Sanders, Peter
Steurer, David | | 2005 | Proceedings Article |
| An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182 | [Comes, Jochen]
Ziegelmann, Mark | Vitter, Jeffrey S.
Zaroliagis, Christos D. | 1999 | Proceedings Article |
| An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | [Bringmann, Karl]
Friedrich, Tobias | | 2010 | Journal Article |
| An efficient algorithm for constructing nearly optimal prefix codes | Mehlhorn, Kurt | | 1978 | Report |
| An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517 | Mehlhorn, Kurt | | 1980 | Journal Article |
| An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | 2003 | Journal Article |
| An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | 2001 | Proceedings Article |
| An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | 2010 | Journal Article |
| An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | [Ribeiro, Celso C.]
[Martins, Simone L.] | 2004 | Proceedings Article |
| An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | 2003 | Proceedings Article |
| An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | 2000 | Journal Article |
| An Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439 | Elbassioni, Khaled M.
[Elmasry, Amr]
[Kamel, Ibrahim] | | 2003 | Proceedings Article |
| An elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292 | El Kahoui, M'hammed | | 2003 | Journal Article |
| An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | [Müller-Hannemann, Matthias]
[Werneck, Renato] | 2011 | Proceedings Article |
| An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | | 2010 | Electronic Journal Article |
| An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | 2004 | Report |
| An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97 | [Schömer, Elmar]
Wolpert, Nicola | | 2006 | Journal Article |
| An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes | Wolpert, Nicola | | 2002 | Thesis - PhD thesis |
| An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210 | Lenhof, Hans-Peter
[Morgenstern, Burkhard]
Reinert, Knut | | 1999 | Journal Article |
| An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106 | Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | [Mitchell, Joe]
[Rote, Günter]
Kettner, Lutz | 2005 | Proceedings Article |
| An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51 | [Klau, Gunnar W.]
Klein, Karsten
[Mutzel, Petra] | [Marks, Joe] | 2001 | Proceedings Article |
| An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532 | Träff, Jesper Larsson | | 1995 | Journal Article |
| An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 | [Frigioni, Daniele]
Miller, Tobias
[Nanni, Umberto]
[Pasqualone, Giulio]
Schäfer, Guido
Zaroliagis, Christos | [Bilardi, Gianfranco]
[Italiano, Giuseppe F.]
[Pietracaprina, Andrea]
[Pucci, Geppino] | 1998 | Proceedings Article |
| An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | [Kosch, Harald]
[Böszörményi, László]
[Hellwagner, Hermann] | 2003 | Proceedings Article |
| An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359 | Brengel, Klaus
Crauser, Andreas
Meyer, Ulrich
[Ferragina, Paolo] | [Vitter, Jeffrey S.]
[Zaroliagis, Christos D.] | 1999 | Proceedings Article |
| An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24 | Crauser, Andreas
Meyer, Ulrich
Brengel, Klaus | | 2001 | Unpublished/Draft |
| An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | Beier, René
[Vöcking, Berthold] | | 2006 | Journal Article |
| An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82 | [Hall, Alex]
[Langkau, Katharina]
Skutella, Martin | [Arora, Sanjeev]
[Jansen, Klaus]
[Rolim, Jose D. P.]
[Sahai, Amit] | 2003 | Proceedings Article |
| An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes | Dorchain, Jörg | | 1996 | Thesis - Masters thesis |
| An implementation of the 2D Algebraic Kernel | Emeliyanenko, Pavel
Kerber, Michael | | 2008 | Report |
| An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154 | Hagerup, Torben
Sanders, Peter
[Träff, Jesper Larsson] | Mehlhorn, Kurt | 1998 | Proceedings Article |
| An improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233 | Bringmann, Karl | | 2012 | Journal Article |
| An improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | van Stee, Rob | [Jansen, Klaus]
[Solis-Oba, Roberto] | 2011 | Proceedings Article |
| An improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74 | van Stee, Rob | | 2012 | Journal Article |
| An improved lower bound on the formula complexity of context-free recognition | Mehlhorn, Kurt | | 1976 | Report |
| An Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524 | Mehlhorn, Kurt | | 1976 | Journal Article |
| An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427 | van Zuylen, Anke | | 2011 | Journal Article |
| An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544 | El Kahoui, M'hammed | | 1996 | Journal Article |
| An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249 | Elbassioni, Khaled M.
[Elmasry, Amr]
[Kamel, Ibrahim] | | 2005 | Journal Article |
| An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | 2003 | Journal Article |
| An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | 2003 | Proceedings Article |
| An Introduction to Analytic Number Theory | Banderier, Cyril | | 1999 | Miscellaneous |
| An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons | Konidaris, G.
Mehlhorn, Kurt
Shell, D.A. | | 2004 | Unpublished/Draft |
| An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267 | Lenhof, Hans-Peter
Smid, Michiel | | 1993 | Journal Article |
| An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363 | Lenhof, Hans-Peter
Smid, Michiel | [Hsu, W.L.]
[Lee, R.C.T.] | 1991 | Proceedings Article |
| An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244 | Ramos, Edgar A. | | 2001 | Journal Article |
| An Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141 | Mustafa, Nabil H.
[Ray, Saurabh] | | 2007 | Proceedings Article |
| An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610 | [Khuller, Samir]
Mestre, Julián | | 2008 | Proceedings Article |
| An 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 | [Cole, Richard]
Hariharan, Ramesh | | 1996 | Proceedings Article |
| An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404 | [Cole, Richard]
[Farach-Colton, Martin]
Hariharan, Ramesh
[Przytycka, Teresa]
[Thorup, Mikkel] | | 2000 | Journal Article |
| An O(n log n) lower bound for the synchronous circuit size of integer multiplication | Mehlhorn, Kurt | | 1976 | Report |
| An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170 | [Cheriyan, Joseph]
Hagerup, Torben
Mehlhorn, Kurt | | 1996 | Journal Article |
| An O(nlogn) Algorithm for Classifying Identical Curves | Ray, Rahul | | 2002 | Miscellaneous |
| An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | [Elmasry, Amr]
Mehlhorn, Kurt
Schmidt, Jens M. | | 2012 | Journal Article |
| An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | Elmasry, Amr
Mehlhorn, Kurt
[Schmidt, Jens M.] | | 2010 | Electronic Journal Article |
| An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | 2008 | Journal Article |
| An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | [Arge, Lars]
[Freivalds, Rusins] | 2006 | Proceedings Article |
| Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes | Feld, Thomas | | 1998 | Thesis - Masters thesis |
| Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes | Bremer, Dirk | | 1995 | Thesis - Masters thesis |
| Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes | Schmitz, Christoph | | 1995 | Thesis - Masters thesis |
| Analyses of Evolutionary Algorithms
Universität des Saarlandes | Happ, Edda | | 2009 | Thesis - PhD thesis |
| Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten] | | 2009 | Journal Article |
| Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | 2009 | Journal Article |
| Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | [Friedrich, Tobias]
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten] | | 2009 | Journal Article |
| Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033 | Sanders, Peter | | 1999 | Journal Article |
| Analysis of Real Algebraic Plane Curves
Universität des Saarlandes | Kerber, Michael | | 2006 | Thesis - Masters thesis |
| Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes | Busch, Philip Johannes | | 2011 | Thesis - Bachelor thesis |
| Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | [Yap, Chee]
Sagraloff, Michael
[Sharma, Vikram] | | 2013 | Unpublished/Draft |
| Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | [Brockhoff, Dimo]
Friedrich, Tobias
Neumann, Frank | [Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola] | 2008 | Proceedings Article |
| Angel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934 | Kutz, Martin
[Pór, Attila] | [Wang, Lusheng] | 2005 | Proceedings Article |
| Animation and Analysis of Distributed Algorithms
Universität des Saarlandes | Koldehofe, Boris | | 1999 | Thesis - Masters thesis |
| Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Kötzing, Timo
[Lehre, Per Kristian]
Neumann, Frank
[Oliveto, Pietro S.] | [Pelikan, Martin]
[Branke, Jürgen] | 2010 | Proceedings Article |
| Ant Colony Optimization and the Minimum Spanning Tree Problem | Neumann, Frank
[Witt, Carsten] | | 2006 | Report |
| Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166 | Neumann, Frank
[Witt, Carsten] | [Maniezzo, Vittorio]
[Battiti, Roberto and]
[Watson, Jean-Paul] | 2008 | Proceedings Article |
| Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413 | Neumann, Frank
[Witt, Carsten] | | 2010 | Journal Article |
| Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24 | Doerr, Benjamin
[Hota, Ashish]
Kötzing, Timo | [Soule, Terence]
[Moore, Jason H.] | 2012 | Proceedings Article |
| Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649 | Manjunath, Madhusudan
[Sharma, Vikram] | | 2011 | Journal Article |
| Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216 | [Brönnimann, Hervé]
[Kettner, Lutz]
Schirra, Stefan
[Veltkamp, Remco] | [Jazayeri, Mehdi]
[Loos, Rüdiger G. K.]
[Musser, David R.] | 2000 | Part of a Book |
| Approximability 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 | Csaba, Bela
Krysta, Piotr
[Karpinski, Marek] | | 2002 | Proceedings Article |
| Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He | [Demetrescu, Camil]
[M. Halldórsson, Magnús] | 2011 | Proceedings Article |
| Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74 | [Brodal, Gerth Stølting]
Gasieniec, Leszek | [Hirschberg, Dan]
[Myers, Gene] | 1996 | Proceedings Article |
| Approximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280 | Baswana, Surender
[Sen, Sandeep] | | 2004 | Proceedings Article |
| Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52 | Kelsen, Pierre
[Mahajan, Sanjeev]
[Ramesh, Hariharan] | Karlsson, Rolf
Lingas, Andrzej | 1996 | Proceedings Article |
| Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251 | Garg, Naveen
[Vazirani, Vijay V.] | | 1996 | Journal Article |
| Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | 1992 | Journal Article |
| Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | 1990 | Proceedings Article |
| Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181 | Arya, Sunil
[Mount, David M.] | | 1995 | Proceedings Article |
| Approximate range searching
In: Computational Geometry [17], 135-152 | Arya, Sunil
[Mount, David M.] | | 2000 | Journal Article |
| Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410 | Chong, Ka Wong
[Lam, Tak Wah] | | 1998 | Journal Article |
| Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten] | | 2010 | Journal Article |
| Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804 | Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten] | [Dirk Thierens] | 2007 | Proceedings Article |
| Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610 | Baumann, Nadine
[Köhler, Ekkehard] | [Fiala, Jiri]
[Koubek, Vaclav]
[Kratochvil, Jan] | 2004 | Proceedings Article |
| Approximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | [Di Battista, Giuseppe]
[Zwick, Uri] | 2003 | Proceedings Article |
| Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin | | 2005 | Journal Article |
| Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81 | Neumann, Frank
[Reichel, Joachim] | [Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola] | 2008 | Proceedings Article |
| Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288 | Krysta, Piotr | | 2003 | Journal Article |
| Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | [Sviridenko, Maxim]
Wiese, Andreas | [Goemans, Michel] | 2013 | Proceedings Article |
| Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián | | 2008 | Proceedings Article |
| Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | [Bringmann, Karl]
[Friedrich, Tobias] | [Ehrgott, Matthias]
[Fonseca, Carlos M.]
[Gandibleux, Xavier]
[Hao, Kin-Kao]
[Sevaux, Marc] | 2009 | Proceedings Article |
| Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | Bringmann, Karl
Friedrich, Tobias | | 2012 | Journal Article |
| Approximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249 | Harren, Rolf | [Bugliesi, M.]
[Preneel, B.]
[Sassone, V.]
[Wegener, I.] | 2006 | Proceedings Article |
| Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Bringmann, Karl
Friedrich, Tobias | | 2010 | Journal Article |
| Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447 | Bringmann, Karl
Friedrich, Tobias | [Hong, Seok-Hee]
[Nagamochi, Hiroshi]
[Fukunaga, Takuro] | 2008 | Proceedings Article |
| Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 | Bringmann, Karl
Friedrich, Tobias
[Neumann, Frank]
[Wagner, Markus] | [Walsh, Toby] | 2011 | Proceedings Article |
| Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84 | Garg, Naveen
[Konjevod, Goran]
[Ravi, R.] | | 2000 | Journal Article |
| Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | | 2008 | Journal Article |
| Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | [Cai, Jin-Yi]
[Cooper, S. Barry]
[Zhu, Hong] | 2007 | Proceedings Article |
| Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247 | Krysta, Piotr
Solis-Oba, Roberto | | 2001 | Journal Article |
| Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 | Krysta, Piotr
Solis-Oba, Roberto | [Asano, T.]
[Imai, H.]
[Lee, D. T.]
[Nakano, S.]
[Tokuyama, T.] | 1999 | Proceedings Article |
| Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes | Krysta, Piotr | | 2001 | Thesis - PhD thesis |
| Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61 | Gergov, Jordan | [Diaz, Josep]
[Serna, Maria] | 1996 | Proceedings Article |
| Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 | Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene | [Caires, Luis]
[Italiano, Giuseppe F.]
[Monteiro, Luís]
[Palamidessi, Catuscia]
[Yung, Moti] | 2005 | Proceedings Article |
| Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360 | Arikati, Srinivasa Rao
[Dessmark, Anders]
[Lingas, Andrzej]
[Marathe, Madhav V.] | [Hirschberg, Dan]
[Myers, Gene] | 1996 | Proceedings Article |
| Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62 | Arikati, Srinivasa Rao
[Dessmark, Anders]
[Lingas, Andrzej]
[Marathe, Madhav V.] | | 2001 | Journal Article |
| Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442 | Krysta, Piotr
Kumar, V. S. Anil | [Ferreira, Afonso]
[Reichel, Horst] | 2001 | Proceedings Article |
| Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472 | Elbassioni, Khaled
[Fouz, Mahmoud]
[Swamy, Chaitanya] | [Saberi, Amin] | 2010 | Proceedings Article |
| Approximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532 | Harren, Rolf | | 2009 | Journal Article |
| Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | Elbassioni, Khaled
[Fishkin, Aleksei V.]
[Sitters, René] | | 2009 | Journal Article |
| Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | [Althaus, Ernst]
[Canzar, Stefan]
Elbassioni, Khaled
[Karrenbauer, Andreas]
[Mestre, Julian] | | 2011 | Journal Article |
| Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275 | Elbassioni, Khaled
[Garg, Naveen]
[Gupta, Divya]
[Kumar, Amit]
[Narula, Vishal]
[Pal, Arindam] | [D'Souza, Deepak]
[Kavitha, Telikepalli]
[Radhakrishnan, Jaikumar] | 2012 | Electronic Proceedings Article |
| Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund | Harren, Rolf | | 2006 | Thesis - other |
| Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325 | Lee, Jae-Ha
[Cheong, Otfried]
[Kwon, Woo-Cheol]
[Shin, Sung-Yong]
[Chwa, Kyung-Yong] | [Paterson, Mike] | 2000 | Proceedings Article |
| Approximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176 | Jez, Artur | [Fischer, Johannes]
[Sanders, Peter] | 2013 | Proceedings Article |
| Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | [Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror] | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | 2007 | Proceedings Article |
| Approximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 | Jez, Artur
[Lohrey, Markus] | [Mayr, Ernst]
[Portier, Natacha] | 2014 | Proceedings Article |
| Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | Bringmann, Karl
[Friedrich, Tobias] | | 2013 | Journal Article |
| Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566 | Kowalik, Lukasz | [Asano, Tetsuo] | 2006 | Proceedings Article |
| Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), | Adamaszek, Anna
Wiese, Andreas | | 2013 | Proceedings Article |
| Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129 | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | | 2012 | Journal Article |
| Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | [Epstein, Leah]
van Stee, Rob | [Kaklamanis, Christos]
[Skutella, Martin] | 2008 | Proceedings Article |
| Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes | Ksinsik, Patric | | 1996 | Thesis - Masters thesis |
| Arbitrary Weight Changes in Dynamic Trees | Mehlhorn, Kurt | | 1978 | Report |
| Arbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211 | Mehlhorn, Kurt | | 1981 | Journal Article |
| ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes | Pouchkarev, Igor | | 2000 | Thesis - Masters thesis |
| ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302 | Hundack, Christoph
Mutzel, Petra
[Pouchkarev, Igor]
[Thome, Stefan] | Di Battista, Giuseppe | 1997 | Proceedings Article |
| Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352 | Mehlhorn, Kurt
Preparata, Franco P. | Monien, Burkhard
Vidal-Naquet, Guy | 1986 | Proceedings Article |
| Area-time optimal division for T=omega((logn)1+epsilon) | Mehlhorn, Kurt
Preparata, Franco P. | | 1985 | Report |
| Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282 | Mehlhorn, Kurt
Preparata, Franco P. | | 1987 | Journal Article |
| Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time | Mehlhorn, Kurt
Preparata, Franco P. | | 1983 | Report |
| Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357 | Mehlhorn, Kurt
Preparata, Franco P. | Paredaens, Jan | 1984 | Proceedings Article |
| Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156 | Mehlhorn, Kurt
Preparata, Franco P. | | 1983 | Journal Article |
| Arithmetik der Transduktoren
Universität des Saarlandes | Oberhauser, Fred | | 1997 | Thesis - Masters thesis |
| Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | 2011 | Electronic Journal Article |
| Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | [Moreno Maza, Marc] | 2011 | Proceedings Article |
| Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | [Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | [Boissonnat, Jean-Daniel]
[Teillaud, Monique] | 2007 | Part of a Book |
| Arrangements of quadrics in 3D: continued work on experimental implementation | Hemmer, Michael
[Limbach, Sebastian] | | 2008 | Report |
| Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Kerber, Michael]
[Setter, Ophir] | | 2010 | Journal Article |
| Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | 2010 | Journal Article |
| Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 | Berberich, Eric
Kerber, Michael | [Petitjean, Sylvain] | 2008 | Proceedings Article |
| Assigning Papers to Referees | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | 2008 | Unpublished/Draft |
| Assigning Papers to Referees
In: Algorithmica [58], 119-136 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | 2010 | Journal Article |
| Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95 | [Kaufmann, Michael]
[Schröder, Heiko]
Sibeyn, Jop F. | | 1995 | Journal Article |
| Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Doerr, Benjamin
[Fouz, Mahmoud] | [Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiri] | 2011 | Proceedings Article |
| Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | Doerr, Benjamin
[Fouz, Mahmoud] | | 2011 | Electronic Journal Article |
| Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148 | Dementiev, Roman
Sanders, Peter | | 2003 | Proceedings Article |
| Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48 | Sanders, Peter | [Aggarwal, Alok]
[Rangan, C. Pandu] | 1999 | Proceedings Article |
| Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | [Fomin, Fedor V.]
[Kaski, Petteri] | 2012 | Proceedings Article |
| Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184 | Sanders, Peter | | 2003 | Journal Article |
| Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98 | Sanders, Peter | [Teng, Shang-Hua] | 2000 | Proceedings Article |
| AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | Fürer, Martin
Mehlhorn, Kurt | | 1989 | Journal Article |
| AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225 | Fürer, Martin
Mehlhorn, Kurt | [Makedon, Fillia]
Mehlhorn, Kurt
[Papatheodorou, Theodore S.]
[Spirakis, Paul G.] | 1986 | Proceedings Article |
| Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502 | [Evans, B.L.]
Schwarz, Christian
[Teich, Jürgen] | | 1995 | Proceedings Article |
| Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes | Kobel, Alexander | | 2008 | Thesis - Bachelor thesis |
| Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608 | Klau, Gunnar W.
Mutzel, Petra | [Jäger, Willi]
[Krebs, Hans-Joachim] | 2003 | Part of a Book |
| Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes | Wissen, Michael | | 1998 | Thesis - Masters thesis |
| Average-Case Analyses of First Fit and Random Fit Bin Packing
In: Random Structures & Algorithms [16], 240 - 259 | Albers, Susanne
[Mitzenmacher, Michael] | | 2000 | Journal Article |
| Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | Ajwani, Deepak
Friedrich, Tobias | | 2010 | Journal Article |
| Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Ajwani, Deepak
Friedrich, Tobias | [Tokuyama, Takeshi] | 2007 | Proceedings Article |
| Average-case complexity of shortest-paths problems
Universität des Saarlandes | Priebe, Volker | | 2001 | Thesis - PhD thesis |
| Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26 | [Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | Rolim, José | 1997 | Proceedings Article |
| Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | [Cooper, Colin]
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker | | 2000 | Journal Article |
| Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134 | Meyer, Ulrich | | 2003 | Journal Article |
| Average case analyses of First-Fit and Random-Fit bin packing
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 290-299 | Albers, Susanne
[Mitzenmacher, Michael] | | 1998 | Proceedings Article |
| Average case analyses of list update algorithms, with applications to data compression
In: Algorithmica [21], 312-329 | Albers, Susanne
[Mitzenmacher, Michael] | | 1998 | Journal Article |
| Average Case Analysis of List Update Algorithms, with Applications to Data Compression
In: Automata, Languages and Programming: 23rd International Colloquium (ICALP'96), 514-525 | Albers, Susanne
[Mitzenmacher, Michael] | Meyer auf der Heide, Friedhelm
Monien, Burkhard | 1996 | Proceedings Article |
| Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471 | [Becchetti, Luca]
[Leonardi, Stefano]
[Marchetti-Spaccamela, Alberto]
Schäfer, Guido
[Vredeveld, Tjark] | | 2003 | Proceedings Article |
| Average Case Parameterized Complexity | Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny | | 2011 | Unpublished/Draft |
| Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758 | Friedrich, Tobias
Hebbinghaus, Nils | | 2011 | Journal Article |
| Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704 | Friedrich, Tobias
Hebbinghaus, Nils | [Hong, Seok-Hee]
[Nagamochi, Hiroshi]
[Fukunaga, Takuro] | 2008 | Proceedings Article |
| Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | [Bárány, Imre]
Doerr, Benjamin | | 2006 | Journal Article |
| BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824 | Kohlbacher, Oliver
Lenhof, Hans-Peter | | 2000 | Journal Article |
| Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124 | [Dubhashi, Devdatt]
[Ranjan, Desh] | | 1998 | Journal Article |
| Balls into Bins Made Faster
In: Algorithms - ESA 2013, | Khosla, Megha | [Bodlaender, Hans L.]
[Italiano, Giuseppe F.] | 2013 | Proceedings Article |
| Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | [Bogdan, Paul]
Sauerwald, Thomas
[Stauffer, Alexandre]
Sun, He | [Sanjeev Khanna] | 2013 | Electronic Proceedings Article |
| Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted | Bringmann, Karl
[Sauerwald, Thomas]
[Stauffer, Alexandre]
Sun, He | | 2014 | Proceedings Article |
| BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344 | Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter | [Vitter, Jeffrey S.]
[Zaroliagis, Christos D.] | 1999 | Proceedings Article |
| Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | Banderier, Cyril
[Flajolet, Philippe] | | 2002 | Journal Article |
| Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael] | [Aceto, Luca]
[Damg{\aa}rd, Ivan]
[Goldberg, Leslie Ann]
[Halldórsson, Magnús M.]
[Ingólfsdóttir, Anna]
[Walukiewicz, Igor] | 2008 | Proceedings Article |
| BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246 | Doerr, Benjamin
Fouz, Mahmoud
[Schmidt, Martin]
Wahlström, Magnus | [Rothlauf, Franz] | 2009 | Proceedings Article |
| Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Gawrychowski, Pawel
[Straszak, Damian] | [Cai, Leizhen]
[Cheng, Siu-Wing]
[Lam, Tak Wah] | 2013 | Proceedings Article |
| Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes | Ebert, Franziska | | 2005 | Thesis - Bachelor thesis |
| Benchmarks on a generic univariate algebraic kernel | Hemmer, Michael
[Limbach, Sebastian] | | 2007 | Report |
| Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680 | [Horoba, Christian]
Neumann, Frank | [Ryan, Conor]
[Keijzer, Maarten] | 2008 | Proceedings Article |
| Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes | Diete, Iris | | 1995 | Thesis - Masters thesis |
| Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes | Immich, Stefan | | 2001 | Thesis - Masters thesis |
| Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes | Son, Jung-Bae | | 1999 | Thesis - Masters thesis |
| Berechnung kürzester Gittervektoren
Univesität des Saarlandes | Backes, Werner | | 1998 | Thesis - Masters thesis |
| Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes | Althaus, Ernst | | 1998 | Thesis - Masters thesis |
| Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes | Dickert, Peter | | 2000 | Thesis - Masters thesis |
| Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540 | Sanders, Peter | [Plehn, Gottfried]
[Deutschmann, Sigrid] | 1999 | Part of a Book |
| Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41 | Mehlhorn, Kurt | Barkhage, H. | 1975 | Proceedings Article |
| Better Bounds for Online Scheduling
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 130-139 | Albers, Susanne | | 1997 | Proceedings Article |
| Better bounds for online scheduling
In: SIAM Journal on Computing [29], 459-473 | Albers, Susanne | | 1999 | Journal Article |
| Better Deterministic Routing on Meshes
In: Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99), 420-425 | Sibeyn, Jop F. | | 1999 | Proceedings Article |
| Better 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 | Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter | Demetrescu, Camil
Sedgewick, Robert
Tamassia, Roberto | 2005 | Proceedings Article |
| Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70 | Burkhardt, Stefan
Kärkkäinen, Juha | | 2003 | Journal Article |
| Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85 | Burkhardt, Stefan
Kärkkäinen, Juha | [Amir, Amihood]
[Landau, Gadi] | 2001 | Proceedings Article |
| Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230 | Sibeyn, Jop F. | | 1997 | Proceedings Article |
| Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes | Rottmann, Klaus-Dieter | | 1996 | Thesis - Masters thesis |
| Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes | Ziegenbein, Kurt | | 1997 | Thesis - Masters thesis |
| Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361 | [Meyerhenke, Henning]
Sauerwald, Thomas | | 2012 | Journal Article |
| Beyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423 | Mnich, Matthias
Philip, Geevarghese
[Saurabh, Saket]
[Suchy, Ondrej] | [D'Souza, Deepak]
[Kavitha, Telikepalli]
[Radhakrishnan, Jaikumar] | 2012 | Electronic Proceedings Article |
| Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88 | [Kaufmann, Michael]
Sibeyn, Jop F.
[Suel, Torsten] | [Spirakis, Paul] | 1995 | Proceedings Article |
| Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272 | [Jansen, Klaus]
Kratsch, Stefan
[Marx, Dániel]
[Schlotter, Ildikó] | [Kaplan, Haim] | 2010 | Proceedings Article |
| Binary Search Trees: Average and Worst Case Behavior | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | | 1976 | Report |
| Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | | 1980 | Journal Article |
| Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert | Neuhold, Erich J. | 1976 | Proceedings Article |
| Bioinformatik
Universität des Saarlandes | Lenhof, Hans-Peter | | 1999 | Thesis - Habilitation thesis |
| Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity | Neumann, Frank
[Witt, Carsten] | | 2010 | Book |
| Birational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71 | El Kahoui, M'hammed | | 2005 | Journal Article |
| Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Doerr, Benjamin
[Lengler, Johannes]
Kötzing, Timo
Winzen, Carola | [Krasnogor, Natalio]
[Lanzi, Pier Luca] | 2011 | Proceedings Article |
| Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | Doerr, Benjamin
Kötzing, Timo
[Lengler, Johannes]
Winzen, Carola | | 2013 | Journal Article |
| Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216 | Doerr, Benjamin
Winzen, Carola | [Hao, Jin-Kao]
[Legrand, Pierrick]
[Collet, Pierre]
[Monmarché, Nicolas]
[Lutton, Evelyne]
[Schoenauer, Marc] | 2012 | Proceedings Article |
| Black-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092 | Doerr, Benjamin | [Soule, Terence]
[Moore, Jason H.] | 2012 | Proceedings Article |
| Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Panagiotou, Konstantinos | [Krattenthaler, Christian]
[Strehl, Volker]
[Kauers, Manuel] | 2009 | Electronic Proceedings Article |
| Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes | Hachenberger, Peter | | 2006 | Thesis - PhD thesis |
| Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | 2003 | Report |
| Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | [Di Battista, Giuseppe]
[Zwick, Uri] | 2003 | Proceedings Article |
| Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | | 2007 | Journal Article |
| Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174 | Hachenberger, Peter
Kettner, Lutz | [Kobbelt, Leif]
[Shapiro, Vadim] | 2005 | Proceedings Article |
| Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283 | Funke, Stefan
Laue, Sören | [Thomas, Wolfgang]
[Weil, Pascal] | 2007 | Proceedings Article |
| Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420 | [Goodrich, Michael T.]
Ramos, Edgar A. | | 1997 | Journal Article |
| Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189 | Mehlhorn, Kurt
Näher, Stefan | | 1990 | Journal Article |
| Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 | [Huang, Chien-Chung]
Kavitha, Telikepalli
[Michail, Dimitrios]
[Nasre, Meghana] | | 2008 | Proceedings Article |
| Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | Huang, Chien-Chung
[Kavitha, Telikepalli]
[Michael, Dimitrios]
[Nasr, Meghana] | | 2011 | Journal Article |
| Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | Doerr, Benjamin
[Gnewuch, Michael]
[Srivastav, Anand] | | 2005 | Journal Article |
| Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | [Batra, Prashant]
Sharma, Vikram | | 2010 | Journal Article |
| Bracket-Languages are Recognizable in Logarithmic Space | Mehlhorn, Kurt | | 1975 | Report |
| Bracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170 | Mehlhorn, Kurt | | 1976 | Journal Article |
| Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes | Kamran Azam, Muhammad | | 2005 | Thesis - Masters thesis |
| Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Ajwani, Deepak
[Meyer, Ulrich]
[Osipov, Vitaly] | [Demetrescu, Camil]
[Goldberg, Andrew V.]
[Johnson, David S.] | 2009 | Part of a Book |
| Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | [Fiat, Amos]
[Sanders, Peter] | 2009 | Proceedings Article |
| Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | [Fiat, Amos]
[Sanders, Peter] | 2009 | Proceedings Article |
| Breaking 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 | Duan, Ran | | 2013 | Proceedings Article |
| Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Doerr, Benjamin
[Goldberg, Leslie Ann]
[Minder, Lorenz]
[Sauerwald, Thomas]
[Scheideler, Christian] | [Lynch, Nancy A.]
[Shvartsman, Alexander A.] | 2010 | Proceedings Article |
| Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | [Keidar, Idit] | 2009 | Proceedings Article |
| Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56 | Hoefer, Martin
Sauerwald, Thomas | | 2013 | Proceedings Article |
| Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | Hoefer, Martin
[Kesselheim, Thomas] | | 2013 | Proceedings Article |
| Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218 | Bringmann, Karl | [Chatterjee, Krishnendu]
[Sgall, Jirí] | 2013 | Proceedings Article |
| Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20 | Gasieniec, Leszek
[Pelc, Andrzej] | | 1997 | Journal Article |
| BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240 | Sibeyn, Jop F.
[Kaufmann, Michael] | Bongiovanni, Giancarlo
Bovet, Daniel Pierre
Di Battista, Guiseppe | 1997 | Proceedings Article |
| Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75 | Meyer, Ulrich | | 2002 | Proceedings Article |
| Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583 | Kesselman, Alexander
[Lotker, Zvi]
[Mansour, Yishay]
[Patt-Shamir, Boaz]
[Schieber, Baruch]
[Sviridenko, Maxim] | | 2004 | Journal Article |
| Cache-Oblivious and Cache-Aware Algorithms | | Lars, Arge
Bender, Michael A.
Demaine, Erik
Leiserson, Charles
Mehlhorn, Kurt | 2005 | Report |
| Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492 | [Brodal, Gerth Stølting]
[Fagerberg, Rolf]
Meyer, Ulrich
[Zeh, Norbert] | [Hagerup, Torben]
[Katajainen, Jyrki] | 2004 | Proceedings Article |
| Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Doerr, Carola
[Gnewuch, Michael]
Wahlström, Magnus | [Chen, W.W.L.]
[Srivastav, A.]
[Travaglini, G.] | 2013 | Part of a Book |
| Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248 | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | Paterson, Michael S. | 1990 | Proceedings Article |
| Can a maximum flow be computed in $o(nm)$ time? | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | | 1990 | Report |
| Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Johannsen, Daniel
Lengler, Johannes | [Pelikan, Martin]
[Branke, Jürgen] | 2010 | Proceedings Article |
| Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 | Bast, Hannah | Albers, Susanne
Alt, Helmut
Näher, Stefan | 2009 | Part of a Book |
| Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | [Correa, Jose R.]
Megow, Nicole
Raman, Rajiv
[Suchan, Karol] | [Cafieri, Sonia]
[Mucherino, Antonio]
[Nannicini, Giacomo]
[Tarissan, Fabien]
[Liberti, Leo] | 2009 | Proceedings Article |
| Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907 | Panagiotou, Konstantinos
[Coja-Oghlan, Amin] | | 2012 | Proceedings Article |
| Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | [Basit, Abdul]
[Mustafa, Nabil H.]
Ray, Saurabh
[Raza, Sarfraz] | | 2010 | Journal Article |
| Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182 | Kowalski, Dariusz
[Pelc, Andrzej] | [Jansen, Klaus]
[Khanna, Sanjeev]
[Rolim, José]
[Ron, Dana] | 2004 | Proceedings Article |
| Certification of Curve Arrangements
Universität des Saarlandes | Wang, Pengming | | 2012 | Thesis - Masters thesis |
| Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | [Suzuki, Masakazu]
[Hong, Hoon]
[Anai, Hirokazu]
[Yap, Chee]
[Sato, Yosuke]
[Yoshida, Hiroshi] | 2009 | Proceedings Article |
| Certified numerical root finding
Universität des Saarlandes | Kobel, Alexander | | 2011 | Thesis - Masters thesis |
| Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797 | Schmidt, Jens M. | [Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew]
[Wattenhofer, Roger] | 2012 | Proceedings Article |
| Certifying 3-Edge-Connectivity | Mehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M. | | 2012 | Unpublished/Draft |
| Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369 | Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M. | | 2013 | Proceedings Article |
| Certifying algorithms
In: Computer Science Review [5], 119-161 | Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | | 2011 | Journal Article |
| Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | McConnella, Ross M.
Mehlhorn, Kurt
[Näher, Stefan]
[Schweitzer, Pascal] | | 2010 | Electronic Journal Article |
| Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167 | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | | 2003 | Proceedings Article |
| Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353 | [Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.] | | 2006 | Journal Article |
| Certifying Algorithms (draft) | Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P. | | 2005 | Unpublished/Draft |
| Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis | | 2003 | Proceedings Article |
| CGAL's Curved Kernel via Analysis | Berberich, Eric
Emeliyanenko, Pavel | | 2008 | Report |
| CGAL package for modular arithmetic operations | Hemmer, Michael | | 2008 | Report |
| CGAL package: Algebraic Foundations | Hemmer, Michael | | 2008 | Report |
| CGAL Reference and User Manuals | [Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette] | | 2001 | Unknown Form: eBookForm |
| Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof | Mehlhorn, Kurt | | 1984 | Report |
| Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221 | Mehlhorn, Kurt
Preparata, Franco P.
Sarrafzadeh, Maji | | 1986 | Journal Article |
| Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526 | [Park, Sang-Min]
Lee, Jae-Ha
[Chwa, Kyung-Yong] | [Lee, D. T.]
[Teng, Shang-Hua] | 2000 | Proceedings Article |
| Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | 2008 | Journal Article |
| Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649 | Hagerup, Torben
[Katajainen, Jyrki]
[Nishimura, Naomi]
[Ragde, Prabhakar] | | 1995 | Proceedings Article |
| Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219 | Ajwani, Deepak
[Malinger, Itay]
[Meyer, Ulrich]
[Toledo, Sivan] | [McGeoch, Catherine] | 2008 | Proceedings Article |
| Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | [Canzar, Stefan]
[El-Kebir, Mohammed]
[Pool, Rene]
Elbassioni, Khaled
[Malde, Alpeshkumar K.]
[Mark, Alan E.]
[Geerke, Daan P.]
[Stougie, Leen]
[Klau, Gunnar W.] | [Chor, Benny] | 2012 | Proceedings Article |
| Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165 | Mehlhorn, Kurt
[Näher, Stefan]
Schilz, Thomas
Schirra, Stefan
Seel, Michael
[Seidel, Raimund]
Uhrig, Christian | | 1996 | Proceedings Article |
| Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104 | Mehlhorn, Kurt
[Näher, Stefan]
Seel, Michael
[Seidel, Raimund]
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian | | 1999 | Journal Article |
| Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902 | Finkler, Ulrich
Mehlhorn, Kurt | | 1999 | Proceedings Article |
| Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150 | Huang, Chien-Chung | | 2010 | Journal Article |
| Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253 | Huang, Chien-Chung | Charikar, Moses | 2010 | Proceedings Article |
| Classroom Examples of Robustness Problems in Geometric Computations | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
[Schirra, Stefan]
[Yap, Chee] | | 2004 | Report |
| Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | 2008 | Journal Article |
| Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | [Albers, Susanne]
[Radzik, Tomasz] | 2004 | Proceedings Article |
| Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 | [Cygan, Marek]
[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus | [Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger] | 2012 | Proceedings Article |
| CNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31 | Mehlhorn, Kurt
Ziegelmann, Mark | Buchsbaum, Adam L.
Snoeyink, Jack | 2001 | Proceedings Article |
| Codes: Unequal Probabilities, Unequal Letter Cost | Altenkamp, Doris
Mehlhorn, Kurt | | 1978 | Report |
| [Replication or Save Conflict] | | | | |
| Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Altenkamp, Doris
Mehlhorn, Kurt | Ausiello, Giorgio
Böhm, Corrado | 1978 | Proceedings Article |
| Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | Altenkamp, Doris
Mehlhorn, Kurt | | 1980 | Journal Article |
| Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva] | [Kao, Ming-Yang]
[Li, Xiang-Yang] | 2007 | Proceedings Article |
| Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330 | [Chlebus, Bogdan S.]
Kowalski, Dariusz
[Shvartsman, Alex] | | 2004 | Proceedings Article |
| Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151 | [Fraigniaud, Pierre]
[Gasieniec, Leszek]
Kowalski, Dariusz
[Pelc, Andrzej] | [Farach-Colton, Martin] | 2004 | Proceedings Article |
| Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes | Warken, Thomas | | 2004 | Thesis - PhD thesis |
| Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52 | Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev | [Karlsson, Rolf]
[Lingas, Andrzej] | 1996 | Proceedings Article |
| Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133 | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Srivastav, Anand] | | 2004 | Journal Article |
| Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158 | [Mütze, Torsten]
[Rast, Thomas]
Spöhel, Reto | [Randall, Dana] | 2011 | Proceedings Article |
| Combinatoire Analytique des chemins et des cartes
Université de Paris 6 | Banderier, Cyril | | 2001 | Thesis - PhD thesis |
| Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | [Gandhi, Rajiv]
Mestre, Julián | | 2009 | Journal Article |
| Combinatorial algorithms for packing and scheduling problems
Universität Karlsruhe | van Stee, Rob | | 2008 | Thesis - Habilitation thesis |
| Combinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes | Reichel, Joachim | | 2006 | Thesis - PhD thesis |
| Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes | Funke, Stefan | | 2001 | Thesis - PhD thesis |
| Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37 | Klau, Gunnar W.
Mutzel, Petra | [Kratochvíl, Jan] | 1999 | Proceedings Article |
| Common Subexpression Search in LEDA_reals | Schmitt, Susanne | | 2003 | Report |
| Common Subexpression Search in LEDA_reals -- a study of the diamond-operator | Schmitt, Susanne | | 2004 | Report |
| Compaction on the Torus | Mehlhorn, Kurt
Rülling, W. | | 1988 | Report |
| Compaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397 | Mehlhorn, Kurt
Rülling, W. | | 1990 | Journal Article |
| Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225 | Mehlhorn, Kurt
Rülling, W. | Reif, John H. | 1988 | Proceedings Article |
| Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168 | Brodal, Gerth Stølting
[Pinotti, M. Cristina] | [Arnborg, Stefan]
[Ivansson, Lars] | 1998 | Proceedings Article |
| Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Doerr, Benjamin
[Jansen, Thomas]
[Klein, Christian] | [Ryan, Conor]
[Keijzer, Maarten] | 2008 | Proceedings Article |
| Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | [Stützle, Thomas]
[Birattari, Mauro]
[Hoss, Holger H.] | 2007 | Proceedings Article |
| Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | | 2009 | Journal Article |
| Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | [Bansal, Nikhil]
Chan, Ho-Leung
[Pruhs, KIrk] | | 2011 | Journal Article |
| Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | Katriel, Irit
Thiel, Sven | | 2005 | Journal Article |
| Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418 | Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | 2004 | Proceedings Article |
| Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644 | [Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar] | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | 2007 | Proceedings Article |
| Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics | Hemmer, Michael
[Dupont, Laurent]
[Petitjean, Sylvain]
[Schömer, Elmar] | | 2008 | Report |
| Complexity Arguments in Algebraic Language Theory | Alt, Helmut
Mehlhorn, Kurt | | 1978 | Report |
| Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225 | Alt, Helmut
Mehlhorn, Kurt | | 1979 | Journal Article |
| Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Elbassioni, Khaled
[Tiwary, Hans Raj] | | 2009 | Proceedings Article |
| Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | Elbassioni, Khaled
[Tiwary, Hans Raj] | | 2012 | Journal Article |
| Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48 | Sitters, Rene | | 2005 | Journal Article |
| Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310 | Sharma, Vikram | | 2008 | Electronic Journal Article |
| Complexity of searching for a black hole | [Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej] | | 2006 | Unpublished/Draft |
| Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Friedrich] | | 2008 | Journal Article |
| Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103 | [Kratsch, Stefan]
Wahlström, Magnus | [Rabani, Yuval] | 2012 | Proceedings Article |
| Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | [Case, John]
Kötzing, Timo | | 2012 | Journal Article |
| Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | Gärtner, Tobias
[Hotz, Günter] | [Ambos-Spies, Klaus]
[Löwe, Benedikt]
[Merkle, Wolfgang] | 2009 | Proceedings Article |
| Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117 | [Bouziane, Driss]
El Kahoui, M'hammed | | 2002 | Journal Article |
| Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94 | Jez, Artur
[Okhotin, Alexander] | | 2014 | Journal Article |
| Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80 | [Durrett, Greg]
[Neumann, Frank]
[O'Reilly, Una-May] | [Beyer, Hans- Georg]
[Langdon, William] | 2011 | Proceedings Article |
| Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120 | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | [Lim, Chee Peng]
[Jain, Lakhmi C.]
[Dehuri, Satchidananda] | 2009 | Part of a Book |
| Computational Geometry: Theory and Implementation
Universität des Saarlandes | Schirra, Stefan | | 1998 | Thesis - Habilitation thesis |
| Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471 | [Vingron, Martin]
Lenhof, Hans-Peter
Mutzel, Petra | Dell'Amico, M.
Maffioli, F.
Martello, S. | 1997 | Part of a Book |
| Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273 | Geismann, Nicola
Hemmer, Michael
Schömer, Elmar | | 2001 | Proceedings Article |
| Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442 | [Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
Thiel, Christian | Thiagarajan, P. S. | 1995 | Proceedings Article |
| Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus | | 1991 | Journal Article |
| Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models | Pettie, Seth
Sanders, Peter | | 2005 | Unpublished/Draft |
| Computing Envelopes of Quadrics | Berberich, Eric
[Meyerovitch, Michal] | | 2007 | Report |
| Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238 | Berberich, Eric
[Meyerovitch, Michal] | | 2007 | Proceedings Article |
| Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | Beier, René
[Czumaj, Artur]
[Krysta, Piotr]
[Vöcking, Berthold] | | 2006 | Journal Article |
| Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748 | Beier, Rene
[Krysta, Piotr]
[Czumaj, Artur]
[Vöcking, Berthold] | | 2004 | Proceedings Article |
| Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | [Klein, Rolf]
Kutz, Martin | [Kaufmann, Michael]
[Wagner, Dorothea] | 2007 | Proceedings Article |
| Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | [Giannopoulos, Panos]
[Klein, Rolf]
Kutz, Martin
[Marx, Daniel] | | 2010 | Journal Article |
| Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | Althaus, Ernst
Canzar, Stefan
[Emmett, Mark]
Karrenbauer, Andreas
[Marshall, Alan]
[Meyer-Bäse, Anke]
[Zhang, Huimin] | | 2008 | Proceedings Article |
| Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171 | Porkolab, Lorant
Khachiyan, Leonid | | 1997 | Proceedings Article |
| Computing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152 | Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich] | [Fourey, Sébastien]
[Herman, Gabor T.]
[Kong, T. Yung] | 2002 | Proceedings Article |
| Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264 | [Smid, Michiel]
Ray, Rahul
[Wendt, Ulrich]
[Lange, Katharina] | | 2004 | Journal Article |
| Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406 | Althaus, Ernst
[Karamanis, Nikiforos]
[Koller, Alexander] | | 2004 | Proceedings Article |
| Computing mimicking networks
In: Algorithmica [26], 31-49 | Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
[Zaroliagis, Christos] | | 2000 | Journal Article |
| Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567 | Chaudhuri, Shiva
[Subrahmanyam, K. V.]
[Wagner, Frank]
Zaroliagis, Christos | [Larsen, Kim G.]
[Skyum, Sven]
[Winskel, Glynn] | 1998 | Proceedings Article |
| Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 | [Babenko, Maxim A.]
[Gawrychowski, Pawel]
[Kociumaka, Tomasz]
[Starikovskaya, Tatiana A.] | [Kulikov, Alexander S.]
[Kuznetsov, Sergei O.]
[Pevzner, Pavel A.] | 2014 | Proceedings Article |
| Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358 | [Han, Xiaofeng]
Kelsen, Pierre
[Ramachandran, Vijaya]
[Tarjan, Robert E.] | | 1995 | Journal Article |
| Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342 | Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin] | | 2011 | Journal Article |
| Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786 | Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin] | [Ryan, Conor]
[Keijzer, Maarten] | 2008 | Proceedings Article |
| Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236 | Doerr, C.
Schmidt, Jens M.
Ramakrishna, G. | | 2013 | Proceedings Article |
| Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | [Harks, Tobias]
Hoefer, Martin
[Klimm, Max]
[Skopalik, Alexander] | | 2013 | Journal Article |
| Computing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14 | Emeliyanenko, Pavel | | 2012 | Electronic Journal Article |
| Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437 | Kutz, Martin | [Amenta, Nina]
[Cheong, Otfried] | 2006 | Proceedings Article |
| Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66 | [Baswana, Surender]
[Biswas, Somenath]
Doerr, Benjamin
[Friedrich, Tobias]
[Kurur, Piyush P.]
Neumann, Frank | [Jansen, Thomas]
[Garibay, Ivan]
[Wiegand, R.Paul]
[Wu, Annie S.] | 2009 | Proceedings Article |
| Computing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181 | Althaus, Ernst
Naujoks, Rouven | | 2006 | Proceedings Article |
| Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | Ramos, Edgar A.
[Amato, Nancy M.]
[Goodrich, Michael T.] | [Amato, Nancy M.]
[Goodrich, Michael T.] | 2000 | Proceedings Article |
| Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes | Fontaine, Marc | | 2003 | Thesis - Masters thesis |
| Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580 | [Follert, Frank]
[Schömer, Elmar]
[Sellen, Jürgen]
Smid, Michiel
[Thiel, Christian] | | 1997 | Journal Article |
| Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468 | [Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan | | 1997 | Proceedings Article |
| Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468 | [Schwerdt, Jörg]
[Smid, Michiel]
Schirra, Stefan | | 1997 | Proceedings Article |
| Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086 | Elmasry, Amr | | 2009 | Journal Article |
| Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357 | Kärkkäinen, Juha | [Penttonen, Martti]
[Meineche Schmidt, Erik] | 2002 | Proceedings Article |
| Computing with algebraic curves in generic position | El Kahoui, M'hammed | | 2008 | Miscellaneous |
| Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | [Ajwani, Deepak]
Elbassioni, Khaled
[Govindarajan, Sathish]
Ray, Saurabh | | 2012 | Journal Article |
| Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh] | [Gibbons, Phillip B.]
[Scheideler, Christian] | 2007 | Proceedings Article |
| Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear) | Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
[Ray, Saurabh] | | 2007 | Proceedings Article |
| Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263 | Elbassioni, Khaled M.
Mustafa, Nabil H. | [Durand, Bruno]
[Thomas, Wolfgang] | 2006 | Proceedings Article |
| Conflict-Free Colorings of Rectangle Ranges for Wireless Networks | Elbassioni, Khaled M.
Mustafa, Nabil H. | | 2005 | Unpublished/Draft |
| Congruence, similarity and symmetries of geometric objects | [Alt, Helmut]
Mehlhorn, Kurt
[Wagener, Hubert]
[Welzl, Emo] | | 1987 | Report |
| Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | | 1988 | Journal Article |
| Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | Giesen, Joachim | | 2008 | Journal Article |
| Connected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38 | Hert, Susan | | 2001 | Proceedings Article |
| Connected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 | [Guibas, Leonidas]
Milosavljevic, Nikola
[Motskin, Arik] | | 2010 | Proceedings Article |
| Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | Schweitzer, Pascal
[Schweitzer, Patrick] | | 2010 | Journal Article |
| Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219 | [Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Codrea, Cosmin] | | 2008 | Journal Article |
| Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239 | [Crochemore, Maxime]
Gasieniec, Leszek
[Rytter, Wojciech] | [Carpentieri, B.]
[De Santis, A.]
[Vaccaro, U.]
[Storer, J. A.] | 1998 | Proceedings Article |
| Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960 | [Crochemore, Maxime]
[Galil, Zvi]
Gasieniec, Leszek
[Park, Kunsoo]
[Rytter, Wojciech] | | 1997 | Journal Article |
| Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | [Anagnostopoulos, Aris]
[Grandoni, Fabrizio]
[Leonardi, Stefano]
Wiese, Andreas | | 2013 | Proceedings Article |
| Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | | 2004 | Proceedings Article |
| Constrained Shortest Paths and Related Problems
Universität des Saarlandes | Ziegelmann, Mark | | 2001 | Thesis - PhD thesis |
| Constraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575 | Mehlhorn, Kurt | [Montanari, Ugo]
[Rolim, José D. P.]
[Welzl, Emo] | 2000 | Proceedings Article |
| Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527 | [Fellows, Michael R.]
Friedrich, Tobias
Hermelin, Danny
[Narodytska, Nina]
[Rosamond, Frances A.] | [Walsh, Toby] | 2011 | Proceedings Article |
| Constraints and Changes
Universität des Saarlandes | Katriel, Irit | | 2004 | Thesis - PhD thesis |
| Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796 | Doerr, Carola
[De Rainville, François-Michel] | | 2013 | Proceedings Article |
| Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66 | Ramos, Edgar A. | | 1997 | Proceedings Article |
| Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding | Doerr, Benjamin
[Gnewuch, Michael] | | 2006 | Report |
| Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312 | Doerr, Benjamin
[Gnewuch, Michael] | [Keller, Alexander]
[Heinrich, Stefan]
[Niederreiter, Harald] | 2008 | Proceedings Article |
| Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208 | Schmidt, Jens M. | | 2012 | Journal Article |
| Constructive Hopf's theorem: or how to untangle closed planar curves | Mehlhorn, Kurt
Yap, Chee-Keng | | 1988 | Report |
| Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423 | Mehlhorn, Kurt
Yap, Chee-Keng | [Lepistö, Timo]
[Salomaa, Arto] | 1988 | Proceedings Article |
| Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621 | Mehlhorn, Kurt
Yap, Chee-Keng | | 1991 | Journal Article |
| Contants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541 | El Kahoui, M'hammed | | 2004 | Journal Article |
| Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | [Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia | [Abramsky, Samson]
[Gavoille, Cyril]
[Kirchner, Claude]
[Meyer auf der Heide, Friedhelm]
[Spirakis, Paul] | 2010 | Proceedings Article |
| Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096 | [Goldberg, Leslie Ann]
[MacKenzie, Philip D.]
[Paterson, Mike]
Srinivasan, Aravind | | 2000 | Journal Article |
| Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Jez, Artur | [Esparza, Javier]
[Fraigniaud, Pierre]
[Husfeldt, Thore]
[Koutsoupia, Elias] | 2014 | Proceedings Article |
| Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | Hemmer, Michael
Limbach, Sebastian
[Schömer, Elmar] | | 2009 | Proceedings Article |
| Continued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes | Limbach, Sebastian | | 2008 | Thesis - Masters thesis |
| Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190 | [Chan, Ho-Leung]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Ting, Hing-Fung] | [Marion, Jean-Yves]
[Schwentick, Thomas] | 2010 | Electronic Proceedings Article |
| Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111 | [Chan, Ho-Leung]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Ting, Hing-Fung] | | 2012 | Journal Article |
| Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535 | Schmidt, Jens M. | | 2013 | Journal Article |
| Contractions, Removals and How to Certify 3-Connectivity in Linear Time | Schmidt, Jens M. | | 2013 | Unpublished/Draft |
| Controlled Perturbation for Delaunay Triangulations | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | 2006 | Report |
| Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | 2005 | Proceedings Article |
| Controlled Perturbation for Voronoi Diagrams
Universität des Saarlandes | Klein, Christian | | 2004 | Thesis - Masters thesis |
| Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40 | Doerr, Benjamin
Klein, Christian | | 2006 | Electronic Journal Article |
| Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464 | Bringmann, Karl
Friedrich, Tobias | | 2012 | Proceedings Article |
| Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Bringmann, Karl
Friedrich, Tobias | [Krasnogor, Natalio]
[Lanzim, Pier Luca] | 2011 | Proceedings Article |
| Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | | 1987 | Proceedings Article |
| Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | [Bannai, Hideo]
Gawrychowski, Pawel
[Inenaga, Shunsuke]
[Takeda, Masayuki] | [Fischer, Johannes]
[Sanders, Peter] | 2013 | Proceedings Article |
| Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451 | Kutz, Martin | | 2005 | Journal Article |
| Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739 | [Chlebus, Bogdan S.]
Kowalski, Dariusz | [Gabow, Harold N.]
[Fagin, Ronald] | 2005 | Proceedings Article |
| Cooperative facility location games
In: Journal of Algorithms [50], 194-214 | [Goemans, Michel X.]
Skutella, Martin | | 2004 | Journal Article |
| Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | Christodoulou, George
[Koutsoupias, Elias]
[Nanavati, Akash] | | 2009 | Journal Article |
| Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint | [Beldiceanu, Nicolas]
[Carlsson, Mats]
Thiel, Sven | | 2002 | Report |
| Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728 | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | | 1983 | Journal Article |
| Cost tradeoffs in graph embeddings, with applications | Hong, Jia-Wei
Mehlhorn, Kurt | | 1982 | Report |
| Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | Even, Shimon
Kariv, Oded | 1981 | Proceedings Article |
| Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110 | [Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack] | [Demetrescu, Camil]
[Tamassia, Roberto]
[Sedgewick, Robert] | 2005 | Proceedings Article |
| Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | [Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack] | | 2006 | Journal Article |
| Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | [Kane, Daniel]
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He | [Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger] | 2012 | Proceedings Article |
| Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | [Alvarez, Victor]
Bringmann, Karl
[Curticapean, Radu]
Ray, Saurabh | [Dey, Tamal K.]
[Whitesides, Sue] | 2012 | Proceedings Article |
| Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | [Cameron, Peter]
Johannsen, Daniel
[Prellberg, Thomas]
Schweitzer, Pascal | | 2008 | Electronic Journal Article |
| Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes | Ray, Saurabh | | 2004 | Thesis - Masters thesis |
| Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | [Alvarez, Victor]
Bringmann, Karl
[Ray, Saurabh]
[Seidel, Raimund] | | 2013 | Proceedings Article |
| Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17 | Kumar, V. S. Anil | | 2001 | Journal Article |
| Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454 | Kumar, V. S. Anil
[Ramesh, Hariharan] | | 1999 | Proceedings Article |
| Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | [Krivelevich, Michael]
Spöhel, Reto | | 2012 | Journal Article |
| Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726 | [Gurvich, Vladimir] | | 1991 | Journal Article |
| Cross-benchmarks of univariate algebraic kernels | [Emiris,Ioannis]
Hemmer, Michael
[Karavelas, Menelaos]
[Limbach, Sebastian]
[Mourrain, Bernard]
[Tsigaridas, Elias]
[Zafeirakopoulos,Zafeirakis] | | 2008 | Report |
| Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243 | [Leonardi, Stefano]
Schäfer, Guido | | 2004 | Proceedings Article |
| Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442 | [Leonardi, Stefano]
Schäfer, Guido | | 2004 | Journal Article |
| Crossing Minimization in Automatic Graph Drawing
Universität des Saarlandes | Ziegler, Thomas | | 2000 | Thesis - PhD thesis |
| Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Doerr, Benjamin
Happ, Edda
Klein, Christian | [Ryan, Conor]
[Keijzer, Maarten] | 2008 | Proceedings Article |
| Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | 2012 | Journal Article |
| Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208 | Schmidt, Jens M.
[Valtr, Pavel] | | 2012 | Proceedings Article |
| Curve Reconstruction and the Traveling Salesman Problem
Universität des Saarlandes | Althaus, Ernst | | 2001 | Thesis - PhD thesis |
| Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429 | [Cheng, Siu-Wing]
Funke, Stefan
[Golin, Mordecai J.]
[Kumar, Piyush]
[Poon, Sheung-Hung]
[Ramos, Edgar A.] | | 2003 | Proceedings Article |
| Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244 | [Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A. | | 2000 | Journal Article |
| Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206 | [Dey, Tamal K.]
Mehlhorn, Kurt
Ramos, Edgar A. | | 1999 | Proceedings Article |
| Cycle Bases in Graphs
Universität des Saarlandes | Jurkiewicz, Tomasz | | 2009 | Thesis - Masters thesis |
| Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | [Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.] | | 2009 | Journal Article |
| Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | [Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | | 2007 | Journal Article |
| Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes | Portz, Sascha | | 1994 | Thesis - Masters thesis |
| Das k-Closest-Pair-Problem
Universität des Saarlandes | von Zülow, Max Henning | | 1994 | Thesis - Masters thesis |
| Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes | Gast, Christoph | | 1997 | Thesis - Masters thesis |
| Das planare Augmentierungsproblem
Universität des Saarlandes | Fialko, Sergej | | 1997 | Thesis - Masters thesis |
| Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245 | [Krick, Christof]
[Meyer auf der Heide, Friedhelm]
[Räcke, Harald]
Vöcking, Berthold
[Westermann, Matthias] | | 2003 | Journal Article |
| Data structures | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | 1989 | Report |
| Data Structures
In: Handbook of Theoretical Computer Science, 301-341 | Mehlhorn, Kurt
Tsakalidis, A. | van Leeuwen, Jan | 1990 | Part of a Book |
| Data structures and algorithms. Volume 1 : Sorting and searching | Mehlhorn, Kurt | Brauer, Wilfried
Rozenberg, Grzegorz
Salomaa, Arto | 1984 | Book |
| Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness | Mehlhorn, Kurt | Brauer, Wilfried
Rozenberg, Grzegorz
Salomaa, Arto | 1984 | Book |
| Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry | Mehlhorn, Kurt | Brauer, Wilfried
Rozenberg, Grzegorz
Salomaa, Arto | 1984 | Book |
| Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | Mehlhorn, Kurt | | 1988 | Book |
| Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | Mehlhorn, Kurt | | 1986 | Book |
| Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | [Han, Xin]
[Lam, Tak-Wah]
Lee, Lap-Kei
[To, Isaac K. K.]
[Wong, Prudence W. H.] | | 2010 | Journal Article |
| Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179 | El Kahoui, M'hammed | | 2000 | Journal Article |
| Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204 | Megow, Nicole
[Möhring, Rolf H.]
[Schulz, Jens] | | 2011 | Journal Article |
| Decision trees: old and new results
In: Information and computation [152], 44-61 | Fleischer, Rudolf | | 1999 | Journal Article |
| Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83 | [Soranzo, Nicola]
Ramezani, Fahimeh
[Iacono, Giovanni]
[Altafini, Claudio] | | 2012 | Journal Article |
| Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | 2011 | Electronic Journal Article |
| Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | 2012 | Journal Article |
| Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | [Hurtado, Ferran]
[van Krefeld, Marc] | 2011 | Proceedings Article |
| Deferred Data Structuring
Universität des Saarlandes | Reinert, Knut | | 1994 | Thesis - Masters thesis |
| Definition of file format for benchmark instances for arrangements of Quadrics | Berberich, Eric
Ebert, Franziska
Kettner, Lutz | | 2006 | Report |
| Definition of the 3D Quadrical Kernel Content | Berberich, Eric
[Hemmer, Michael] | | 2007 | Report |
| Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Amini, Omid
[Peleg, David]
[Pérennes, Stéphane]
[Sau, Ignasi]
[Saurabh, Saket] | [Bampis, Evripidis]
[Skutella, Martin] | 2009 | Proceedings Article |
| Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | Giesen, Joachim | | 2008 | Journal Article |
| Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | [Croitoru, Cosmina]
Kötzing, Timo | [Kersting, Kristian]
[Toussaint, Marc] | 2012 | Proceedings Article |
| Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus | [Müller-Hannemann, Matthias]
[Werneck, Renato] | 2011 | Proceedings Article |
| Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16 | Hariharan, Ramesh
Mahajan, Sanjeev | | 1995 | Proceedings Article |
| Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms
Universität des Saarlandes | Meyer, Ulrich | | 2002 | Thesis - PhD thesis |
| Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes | Finkler, Ulrich | | 1997 | Thesis - PhD thesis |
| Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes | Gutwenger, Carsten | | 1999 | Thesis - Masters thesis |
| Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes | Lauer, Thorsten | | 1998 | Thesis - Masters thesis |
| Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262 | Hoefer, Martin
[Wagner, Lisa] | [Chen, Yiling]
[Immorlica, Nicole] | 2013 | Proceedings Article |
| Design, Implementation and Experimental Study of External Memory BFS Algorithms
Universität des Saarlandes | Ajwani, Deepak | | 2005 | Thesis - Masters thesis |
| Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | [Bodirsky, Manuel]
Kutz, Martin | | 2007 | Journal Article |
| Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | [Iacono, G.]
Ramezani, Fahimeh
[Soranzo, N.]
[Altafani, C.] | | 2010 | Journal Article |
| Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299 | Ramos, Edgar A. | | 2000 | Proceedings Article |
| Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141 | Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S. | | 1997 | Journal Article |
| Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | [Kao, Ming-Yang]
[Leung, Henry C. M.]
Sun, He
[Zhang, Yong] | [Kratchovil, Jan]
[Li, Angsheng]
[Fiala, Jiri]
[Kolman, Petr] | 2010 | Proceedings Article |
| Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197 | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor] | [Raman, Rajeev]
[Sedgewick, Robert]
[Stallmann, Matthias F.] | 2006 | Proceedings Article |
| Deterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena | Friedrich, Tobias | | 2005 | Thesis - Masters thesis |
| Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | 2007 | Journal Article |
| Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | 2008 | Proceedings Article |
| Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | 2010 | Journal Article |
| Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76 | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor] | [Felsner, Stefan] | 2005 | Proceedings Article |
| Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090 | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor] | | 2007 | Journal Article |
| Deterministic Random Walks on the Integers
In: ??? [?], 1-27 | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor] | | 2006 | Miscellaneous |
| Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | Doerr, Benjamin
Friedrich, Tobias | [Asano, Tetsuo] | 2006 | Proceedings Article |
| Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | Doerr, Benjamin
Friedrich, Tobias | | 2009 | Journal Article |
| Deterministic rendezvous in graphs | [Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej] | | 2006 | Unpublished/Draft |
| Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | [Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej] | | 2006 | Journal Article |
| Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36 | Chaudhuri, Shiva
[Radhakrishnan, Jaikumar] | | 1996 | Proceedings Article |
| Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151 | van Zuylen, Anke | | 2011 | Journal Article |
| Deterministic simulation of idealized parallel computers on more realistic ones | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | 1985 | Report |
| Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | Gruska, Jozef
Rovan, Branislav
Wiedermann, Juraj | 1986 | Proceedings Article |
| Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P. | Albrecht, Andreas
Jung, Hermann
Mehlhorn, Kurt | 1987 | Proceedings Article |
| Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | | 1987 | Journal Article |
| Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes | Meyer, Ulrich | | 1995 | Thesis - Masters thesis |
| Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | Friedrich, Tobias
Sauerwald, Thomas
[Stauffer, Alexandre] | [Asano, Takao]
[Nakano, Shin-Ichi]
[Okamoto, Yoshio]
[Watanabe, Osamu] | 2011 | Proceedings Article |
| Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295 | [Cai, Jin-Yi]
[Lu, Pinyan]
Xia, Mingji | | 2013 | Proceedings Article |
| Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes | Humble, Monika | | 1997 | Thesis - Masters thesis |
| Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes | Kasan, Binaman | | 1995 | Thesis - Masters thesis |
| Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes | Jung, Karin | | 1996 | Thesis - Masters thesis |
| Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), | [Clementi, Andrea]
[Crescenzi, Pierluigi]
Doerr, Carola
[Fraigniaud, Pierre]
[Pasquale, Francesco]
[Silvestri, Riccardo] | | 2013 | Proceedings Article |
| Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116 | Bast, Holger | Babaoglu, Ozalp
[Jelasity, Márk]
[Montresor, Alberto]
[van Steen, Maarten]
[van Moorsel, Aad]
[Fetzer, Christof]
[Leonardi, Stefano] | 2004 | Proceedings Article |
| Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613 | Doerr, Benjamin
Happ, Edda | | 2008 | Proceedings Article |
| Direction-Reversing Quasi-Random Rumor Spreading with Restarts | Winzen, Carola | | 2011 | Unpublished/Draft |
| Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926 | Winzen, Carola | | 2013 | Journal Article |
| Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | [Ackermann, Markus]
[Berendt, Bettina]
[Grobelnik, Marko]
[Hotho, Andreas]
[Mladenic, Dunja]
[Semeraro, Giovanni]
[Spiliopoulou, Myra]
[Stumme, Gerd]
[Svatek, Vojtech]
[van Someren, Maarten W.] | 2006 | Proceedings Article |
| Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229 | Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev | Afrati, Foto
Kolaitis, Photokion | 1997 | Proceedings Article |
| Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | Gawrychowski, Pawel
[Manea, Florin]
[Nowotka, Dirk] | [Bonizzoni, Paola]
[Brattka, Vasco]
[Lowe, Benedikt] | 2013 | Proceedings Article |
| Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611 | Cilleruelo, Javier
Hebbinghaus, Nils | | 2009 | Journal Article |
| Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328 | Doerr, Benjamin
Hebbinghaus, Nils | [Felsner, Stefan] | 2005 | Proceedings Article |
| Discrepancy of Sums of two Arithmetic Progressions | Hebbinghaus, Nils | | 2007 | Report |
| Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils | | 2006 | Electronic Journal Article |
| Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322 | [Müller, Tobias]
Perez-Gimenez, Xavier
[Wormald, Nicholas] | | 2011 | Journal Article |
| Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251 | Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu] | [Gibbons, Phillip B.]
[Abdelzaher, Tarek F.]
[Aspnes, James]
[Rao, Ramesh] | 2006 | Proceedings Article |
| Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes | Lennerz, Christian | | 2005 | Thesis - PhD thesis |
| Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | Hermelin, Danny
[Levy, Avivit]
[Weimann, Oren]
[Yuster, Raphael] | [Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiri] | 2011 | Proceedings Article |
| Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25 | Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas | | 1996 | Proceedings Article |
| Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | [Berenbrink, Petra]
[Hoefer, Martin]
Sauerwald, Thomas | [Randall, Dana] | 2011 | Proceedings Article |
| Distribution of spanning regular subgraphs in random graphs | Gao, Pu (Jane) | | 2011 | Unpublished/Draft |
| Distribution of the number of spanning regular subgraphs in random graphs | P. Gao | | 2012 | Unpublished/Draft |
| Distributions of sparse spanning subgraphs in random graphs | P. Gao | | 2012 | Unpublished/Draft |
| Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433 | [Heydrich, Sandy]
van Stee, Rob | [Voecking, Berthold] | 2013 | Proceedings Article |
| Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61 | Heydrich, Sandy
[van Stee, Rob] | | 2015 | Journal Article |
| Dividing connected chores fairly
Universität des Saarlandes | Heydrich, Sandy | | 2012 | Thesis - Bachelor thesis |
| Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | Kerber, Michael | | 2009 | Journal Article |
| Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | [Brockhoff, Dimo]
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart] | [Dirk Thierens] | 2007 | Proceedings Article |
| Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | [Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.] | | 2009 | Electronic Journal Article |
| Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000 | [Cygan, Marek]
Philip, Geevarghese
[Pilipczuk, Marcin]
[Pilipczuk, Micha\l{}]
[Wojtaszczyk, Jakub Onufry] | | 2011 | Journal Article |
| Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | Hermelin, Danny
[Mnich, Matthias]
[van Leeuwen, Erik Jan]
[Woeginger, Gerhard J.] | [Aceto, Luca]
[Henzinger, Monika]
[Sgall, Jiri] | 2011 | Proceedings Article |
| Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112 | [Bringmann, Karl]
[Friedrich, Tobias] | [Jansen, Thomas]
[Garibay, Ivan]
[Paul, Wiegand R.]
[Wu, Annie S.] | 2009 | Proceedings Article |
| Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76 | Bast, Holger
Weber, Ingmar | Nikoletseas, Sotiris | 2005 | Proceedings Article |
| Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136 | [Biedl, Therese]
[Kaufmann, Michael]
Mutzel, Petra | [Hromkovic, J.]
[Sykora, O.] | 1998 | Proceedings Article |
| Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320 | Doerr, Benjamin | [Krasnogor, Natalio]
[Lanzi, Pier Luca] | 2011 | Proceedings Article |
| Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | 2010 | Proceedings Article |
| Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Doerr, Benjamin
[Goldberg, Leslie Ann] | [Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter] | 2010 | Proceedings Article |
| Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | 2002 | Journal Article |
| Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | 2007 | Journal Article |
| Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756 | Megow, Nicole
[Verschae, Jose] | | 2013 | Proceedings Article |
| Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73 | [Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott] | Meyer auf der Heide, Friedhelm | 2001 | Proceedings Article |
| Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463 | [Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott] | | 2005 | Journal Article |
| Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315 | Hagerup, Torben | | 2000 | Journal Article |
| Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302 | Hagerup, Torben | [Degano, Pierpaolo]
[Gorrieri, Roberto]
[Marchetti-Spaccamela, Alberto] | 1997 | Proceedings Article |
| Dynamic Binary Search | Mehlhorn, Kurt | | 1976 | Report |
| Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336 | Mehlhorn, Kurt | Salomaa, Arto
Steinby, Magnus | 1977 | Proceedings Article |
| Dynamic Binary Search
In: SIAM Journal on Computing [8], 175-198 | Mehlhorn, Kurt | | 1979 | Journal Article |
| Dynamic Binary Search Trees : Extended Abstracts | Mehlhorn, Kurt | | 1976 | Report |
| Dynamic data structures
In: Mathematical Centre Tracts [108], 71-96 | Mehlhorn, Kurt | | 1979 | Journal Article |
| Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40 | Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M. | | 1990 | Journal Article |
| Dynamic fractional cascading | Mehlhorn, Kurt
Näher, Stefan | | 1986 | Report |
| Dynamic Fractional Cascading
In: Algorithmica [5], 215-241 | Mehlhorn, Kurt
Näher, Stefan | | 1990 | Journal Article |
| Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199 | Katriel, Irit | [Régin, Jean-Charles]
[Rueher, Michel] | 2004 | Proceedings Article |
| Dynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | Brauer, Wilfried | 1985 | Proceedings Article |
| Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | | 1993 | Journal Article |
| Dynamic Perfect Hashing: Upper and Lower Bounds | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | 1991 | Report |
| Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | 1988 | Proceedings Article |
| Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | [Dietzfelbinger, Martin]
[Karlin, Anna]
Mehlhorn, Kurt
[Meyer Auf Der Heide, Friedhelm]
[Rohnert, Hans]
[Tarjan, Robert E.] | | 1994 | Journal Article |
| Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | Frederickson, Grag
Graham, Ron
Hochbaum, Dorit S.
Johnson, Ellis
Kosaraju, S. Rao
Luby, Michae
Megiddo, Nimrod
Schieber, Baruch
Vaidya, Pravin
Yao, Frances | 1992 | Proceedings Article |
| Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | 1994 | Journal Article |
| Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9 | Smid, Michiel | | 1995 | Journal Article |
| Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191 | Bast, Hannah | | 1998 | Proceedings Article |
| Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes | Hachenberger, Peter | | 1999 | Thesis - Masters thesis |
| Dynamization of geometric data structures | Fries, O.
Mehlhorn, Kurt
Näher, Stefan | | 1985 | Report |
| Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176 | Fries, O.
Mehlhorn, Kurt
Näher, Stefan | | 1985 | Proceedings Article |
| Earliest Arrival Flows with Multiple Sources
Universität des Saarlandes | Rauf, Imran | | 2005 | Thesis - Masters thesis |
| Edge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766 | Doerr, Benjamin
[Johannsen, Daniel] | [Pelikan, Martin]
[Branke, Jürgen] | 2010 | Proceedings Article |
| Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12 | [Cole, Richard]
[Ost, Kirstin]
Schirra, Stefan | | 2001 | Journal Article |
| Editorial
In: Algorithmica [57], 119-120 | Doerr, Benjamin
Neumann, Frank
[Wegener, Ingo] | | 2010 | Journal Article |
| Editorial
In: Computational Geometry [12], 153-154 | Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg | | 1999 | Journal Article |
| Editorial
In: Computational Geometry [17], 1-2 | Mehlhorn, Kurt
[Sack, Jörg-Rüdiger] | | 2000 | Journal Article |
| Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334 | [Jansen, Thomas]
Neumann, Frank | | 2010 | Journal Article |
| Effects of a Modular Filter on Geometric Applications | [Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar] | | 2004 | Report |
| Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288 | Telikepalli, Kavitha | [Pandya, Paritosh]
[Radhakrishnan, Jaikumar] | 2003 | Proceedings Article |
| Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes | Thiel, Sven | | 2004 | Thesis - PhD thesis |
| Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13 | Gupta, Prosenjit
[Janardan, Ravi]
Smid, Michiel | | 1999 | Journal Article |
| Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch | | 2012 | Proceedings Article |
| Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403 | Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech] | [Karlsson, Rolf]
[Lingas, Andrzej] | 1996 | Proceedings Article |
| Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Gidenstam, Anders
[Papatriantafilou, Marina]
[Sundell, Håkan]
[Tsigas, Philippas] | | 2009 | Journal Article |
| Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413 | Krysta, Piotr
[Lorys, Krzysztof] | [Nesetril, Jaroslav] | 1999 | Proceedings Article |
| Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130 | [Duncan, C.A.]
[Goodrich, Michael T.]
Ramos, Edgar A. | | 1997 | Proceedings Article |
| Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | [Bradonjić, Milan]
[Elsässer, Robert]
Friedrich, Tobias
[Sauerwald, Thomas]
[Stauffer, Alexandre] | [Charikar, Moses] | 2010 | Proceedings Article |
| Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328 | Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian | [Lee, Kunwoo]
[Patrikalakis, Nicholas M.] | 2002 | Proceedings Article |
| Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60 | [Schömer, Elmar]
Thiel, Christian | | 1995 | Proceedings Article |
| Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16 | Arikati, Srinivasa Rao
Maheshwari, Anil
Zaroliagis, Christos | | 1997 | Journal Article |
| Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54 | Arya, Sunil
Smid, Michiel | | 1997 | Journal Article |
| Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69 | Lennerz, Christian
Schömer, Elmar | [Hiromasa, Suzuki]
[Ralph, Martin] | 2002 | Proceedings Article |
| Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan | | 1999 | Proceedings Article |
| Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | [Fich, Faith] | 2003 | Proceedings Article |
| Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | 2005 | Journal Article |
| Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | [Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | [van Dyk, David]
[Welling, Max] | 2009 | Electronic Proceedings Article |
| Efficient Index-Based Snippet Generation | Celikik, Marjan
Bast, Holger
Manolache, Gabriel | | 2011 | Unpublished/Draft |
| Efficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes | Weber, Ingmar | | 2007 | Thesis - PhD thesis |
| Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar | [Mário J. Silva]
[Alberto H. F. Laender]
[Ricardo A. Baeza-Yates]
[Deborah L. McGuinness]
[Bj{\o}rn Olstad]
[{\O}ystein Haug Olsen]
[André O. Falc{\~a}o] | 2007 | Proceedings Article |
| Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch
Baumbach, Jan | | 2012 | Journal Article |
| Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490 | Bradford, Phillip Gnassi
[Rawlins, Gregory J.E.]
[Shannon, Greogory E.] | | 1998 | Journal Article |
| Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39 | Pyrga, Evangelia
[Schulz, Frank]
[Wagner, Dorothea]
[Zaroliagis, Christos] | | 2007 | Journal Article |
| Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Emeliyanenko, Pavel | [Dou, Yong]
[Gruber, Ralf]
[Joller, Josef] | 2009 | Proceedings Article |
| Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197 | Gasieniec, Leszek
[Indyk, Piotr] | Chlebus, Bogdan S.
Czaja, Ludwik | 1997 | Proceedings Article |
| Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Jurkiewicz, Tomasz
Danilewski, Piotr | | 2011 | Unpublished/Draft |
| Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | [Kerber, Michael]
Sagraloff, Michael | [Leykin, Anton] | 2011 | Proceedings Article |
| Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | [Fekete, Sándor P.]
[Fiethe, Björn]
[Friedrichs, Stephan]
[Michalik, Harald]
[Orlis, Christos] | | 2014 | Proceedings Article |
| Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 | Bringmann, Karl
[Panagiotou, Konstantinos] | [Czumaj, Artur]
Mehlhorn, Kurt
[Pitts, Andrew M.]
[Wattenhofer, Roger] | 2012 | Proceedings Article |
| Efficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232 | Fatourou, Panagiota
[Spirakis, Paul G.] | | 2000 | Journal Article |
| Effiziente Algorithmen | Mehlhorn, Kurt | | 1977 | Book |
| Effiziente Algorithmen - Tagungsbericht | | Mehlhorn, Kurt
Trajan, Robert E. | 1991 | Proceedings |
| Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes | Schilz, Thomas | | 2000 | Thesis - PhD thesis |
| Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes | Thiel, Christian | | 1996 | Thesis - PhD thesis |
| Effiziente Algorithmen: Ein Beispiel | Mehlhorn, Kurt | | 1978 | Report |
| Effiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89 | Mehlhorn, Kurt | | 1978 | Journal Article |
| Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes | Baraque, Raef | | 2002 | Thesis - Masters thesis |
| Effiziente parallele Algorithmen
Universität des Saarlandes | Sibeyn, Jop F. | | 1999 | Thesis - Habilitation thesis |
| Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes | Emminghaus, Frank | | 1995 | Thesis - Masters thesis |
| Effiziente und Online-Algorithmen
Universität des Saarlandes | Fleischer, Rudolf | | 1999 | Thesis - Habilitation thesis |
| Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes | Klauk, Mathias | | 2004 | Thesis - Masters thesis |
| Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes | Lutter, Stefan | | 1996 | Thesis - Masters thesis |
| Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere
Universität des Saarlandes | Müller, Peter | | 1995 | Thesis - Masters thesis |
| Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes | Rau, Stephan | | 1997 | Thesis - Masters thesis |
| Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes | Wahl, Michaela | | 2000 | Thesis - Masters thesis |
| Ein NP-schweres Plazierungsproblem
Universität des Saarlandes | Schwarzenecker, Erik | | 1995 | Thesis - PhD thesis |
| Ein Parametric Search Toolkit
Universität des Saarlandes | Lambert, Georg | | 2001 | Thesis - Masters thesis |
| Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes | Stormer, Henrik | | 1998 | Thesis - Masters thesis |
| Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes | Sabo, Holger | | 1999 | Thesis - Masters thesis |
| Ein Simulator für Prozessornetzwerke
Universität des Saarlandes | Müller, Matthias | | 1998 | Thesis - Masters thesis |
| Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes | Leinenbach, Stefan | | 1997 | Thesis - Masters thesis |
| Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes | Beier, Rene | | 2000 | Thesis - Masters thesis |
| Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes | Kettner, Björn | | 1998 | Thesis - Masters thesis |
| Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes | Seel, Michael | | 1994 | Thesis - Masters thesis |
| Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes | Kappel, Holger | | 1998 | Thesis - Masters thesis |
| Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes | Boullay, Johannes | | 1996 | Thesis - Masters thesis |
| Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84 | Katriel, Irit
Meyer, Ulrich | Meyer, Ulrich
Sanders, Peter
Sibeyn, Jop F. | 2003 | Part of a Book |
| Elliptic Curves : A Computational Approach | Schmitt, Susanne
[Zimmer, Horst G.] | | 2003 | Book |
| Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | [Cooley, Oliver]
[Fountoulakis, Nikolaos]
[Kühn, Daniela]
[Osthus, Deryk] | | 2009 | Journal Article |
| Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | 2008 | Journal Article |
| Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | 2005 | Proceedings Article |
| Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Beier, Rene
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter] | | 2011 | Journal Article |
| Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | [Friedrichs, Stephan]
[Kulau, Ulf]
[Wolf, Lars] | | 2014 | Proceedings Article |
| Energy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26 | Kesselman, Alexander
Kowalski, Dariusz
[Segal, Michael] | | 2005 | Journal Article |
| Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376 | Beier, Rene
Sanders, Peter
Sivadasan, Naveen | [Widmayer, Peter]
[Triguero, Francisco]
[Morales, Rafael]
[Hennessy, Matthew]
[Eidenbenz, Stephan]
[Conejo, Ricardo] | 2002 | Proceedings Article |
| Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151 | Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter | [Arge, Lars]
[Italiano, Giuseppe F.]
[Sedgewick, Robert] | 2004 | Proceedings Article |
| Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208 | Dementiev, Roman
Sanders, Peter
Schultes, Dominik
[Sibeyn, Jop F.] | [Lévy,Jean-Jacques]
[Mayr, Ernst W.]
[Mitchell, John C.] | 2004 | Proceedings Article |
| Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes | Karrenbauer, Andreas | | 2007 | Thesis - PhD thesis |
| Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | [Jain, Sanjay]
Kötzing, Timo
[Stephan, Frank] | [Bshouty, Nader]
[Stoltz, Gilles]
[Vayatis, Nicolas]
[Zeugmann, Thomas] | 2012 | Proceedings Article |
| Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 | Farzan, Arash
[Gagie, Travis]
[Navarro, Gonzalo] | [Cheong, Otfried]
[Chwa, Kyung-Yong]
[Park, Kunsoo] | 2010 | Proceedings Article |
| Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes | Srivastava, Satanand | | 1996 | Thesis - Masters thesis |
| Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes | Braun, Sebastian | | 2000 | Thesis - Masters thesis |
| Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | 2007 | Journal Article |
| Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | Bienstock, Daniel
Nemhauser, George | 2004 | Proceedings Article |
| Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Elbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh | [Collette, Sebastien] | 2011 | Electronic Proceedings Article |
| Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | [Azar, Yossi]
[Erlebach, Thomas] | 2006 | Proceedings Article |
| Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386 | Lenhof, Hans-Peter
Smid, Michiel | | 1992 | Proceedings Article |
| Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103 | Elmasry, Amr
Manjunath, Madhusudan | Asano, Tetsuo | 2009 | Proceedings Article |
| Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | [Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | [Apostolico, Alberto]
[Hein, Jotun] | 1997 | Proceedings Article |
| Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | [Bhaskar, Umang]
[Fleischer, Lisa]
[Hoy, Darrell]
Huang, Chien-Chung | [Mathieu, Claire] | 2009 | Proceedings Article |
| Ergebnisüberprüfung bei Graphenalgorithmen
Universität des Saarlandes | Metzler, Matthias | | 1997 | Thesis - Masters thesis |
| Error Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93 | Doerr, Benjamin
[Lorenz, Ulf] | | 2006 | Journal Article |
| Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes | Thome, Stefan | | 2000 | Thesis - Masters thesis |
| Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes | Wilhelmi, Harald | | 1995 | Thesis - Masters thesis |
| Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x | Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa | | 2008 | Journal Article |
| ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | [Clarke, Charlie]
[Fuhr, Norbert]
[Kando, Noriko] | 2007 | Proceedings Article |
| Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498 | Arya, Sunil
[Das, Gautam]
[Mount, David M.]
[Salowe, Jeffrey S.]
Smid, Michiel | | 1995 | Proceedings Article |
| Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes | Caroli, Manuel | | 2007 | Thesis - Masters thesis |
| Evaluation of different approaches in 3D curved kernel for arrangements of quadrics | Hemmer, Michael | | 2008 | Report |
| Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | | 2013 | Journal Article |
| Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | 2012 | Unpublished/Draft |
| Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Doerr, Benjamin
[Eremeev, Anton]
[Horoba, Christian]
Neumann, Frank
[Theile, Madeleine] | [Raidl, Günther]
[Rothlauf, Frank] | 2009 | Proceedings Article |
| Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | Doerr, Benjamin
[Eremeev, Anton]
Neumann, Frank
[Theile, Madeleine]
[Thyssen, Christian] | | 2011 | Journal Article |
| Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes | Ingalalli, Vijay | | 2011 | Thesis - Masters thesis |
| Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322 | Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E. | | 1993 | Proceedings Article |
| Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131 | Eigenwillig, Arno
Kerber, Michael | | 2008 | Proceedings Article |
| Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278 | Bringmann, Karl
[Friedrich, Tobias] | [Fomin, Fedor V.]
[Freivalds, Rūsiņš]
[Kwiatkowska, Marta]
[Peleg, David] | 2013 | Proceedings Article |
| Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), - | [Jünger, Michael]
Mutzel, Petra | [Brandenburg, Franz] | 1996 | Proceedings Article |
| Exact Arithmetic using Cascaded Computation
Universität des Saarlandes | Funke, Stefan | | 1997 | Thesis - Masters thesis |
| Exact Arrangement Computation for Cubic Curves
Universität des Saarlandes | Eigenwillig, Arno | | 2003 | Thesis - Masters thesis |
| Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes | Berberich, Eric | | 2004 | Thesis - Masters thesis |
| Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Berberich, Eric
Kerber, Michael | [Haines, Eric]
[McGuire, Morgan] | 2008 | Proceedings Article |
| Exact Computation of Arrangements of Rotated Conics | Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola] | | 2007 | Report |
| Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234 | Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola] | | 2007 | Proceedings Article |
| Exact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz | Hemmer, Michael | | 2008 | Thesis - PhD thesis |
| Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes | Burnikel, Christoph | | 1996 | Thesis - PhD thesis |
| Exact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172 | Mehlhorn, Kurt
Schirra, Stefan | [Alefeld, Götz]
[Rohn, Jiri]
Rump, Siegfried M.
[Yamamoto, Tetsuro] | 2001 | Part of a Book |
| Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | [Teillaud, Monique]
[Welzl, Emo] | 2008 | Proceedings Article |
| Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87 | Mehlhorn, Kurt | [Lipitakis, Elias A.] | 2002 | Proceedings Article |
| Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19 | Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian | | 1995 | Proceedings Article |
| Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | | 2001 | Journal Article |
| Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | | 1998 | Proceedings Article |
| Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496 | [DeSimone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni] | | 1995 | Journal Article |
| Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371 | [De Simone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni] | | 1996 | Journal Article |
| Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes | Pohl, Sebastian | | 2006 | Thesis - Masters thesis |
| Exact Linear Programming
Universität des Saarlandes | Kwappik, Carsten | | 1998 | Thesis - Masters thesis |
| Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | 2012 | Electronic Journal Article |
| Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | 2013 | Journal Article |
| Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73 | Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | 2006 | Journal Article |
| EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola | | 2004 | Report |
| EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola | [Brodal, Gerth S.]
[Leonardi, Stefano] | 2005 | Proceedings Article |
| Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes | Caroli, Manuel | | 2006 | Thesis - Bachelor thesis |
| Exaktes geometrisches Rechnen | Sagraloff, Michael | | 2012 | Miscellaneous |
