| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| DamsHK2013 | Dams, Johannes
Hoefer, Martin
Kesselheim, Thomas | 2013 | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | Proceedings Article |
| Das-et-al97 | Das, Gautam
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | 1997 | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article |
| Das-Kapoor-Smid96 | Das, Gautam
Kapoor, Sanjiv
Smid, Michiel | 1996 | | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75 | Proceedings Article |
| Das-Kapoor-Smid97 | Das, Gautam
Kapoor, Sanjiv
Smid, Michiel | 1997 | | On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460 | Journal Article |
| DBLP:conf/gi/NaherM90 | Näher, Stefan
Mehlhorn, Kurt | 1990 | | LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39 | Proceedings Article |
| DBLP:conf/stacs/Meyer08 | Meyer, Ulrich | 2008 | | On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560 | Proceedings Article |
| DBLP:journals/corr/abs-1304-8069 | Kobel, Alexander
Sagraloff, Michael | 2013 | | Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17 | Electronic Journal Article |
| DCFS2010 | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | 2010 | | Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | Journal Article |
| DDJMRR96 | De Simone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni | 1996 | | Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371 | Journal Article |
| deBerg-vanKreveld-Schirra1998 | de Berg, Marc
van Kreveld, Marc
Schirra, Stefan | 1998 | | Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257 | Journal Article |
| deBerg-vanKreveld-Schirra95 | Berg, Marc de
Kreveld, Marc van
Schirra, Stefan | 1995 | | A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88 | Proceedings Article |
| deBergSchirra2002 | de Berg, Schirra (ed.) | 2002 | | Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00) | Proceedings |
| deBergSchirraSoCG2002 | de Berg, Marc
Schirra, Stefan | 2002 | | Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2 | Proceedings Article |
| Dedo-Gergov-Hagerup95 | Dedorath, Jürgen
Gergov, Jordan
Hagerup, Torben | 1995 | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | Proceedings Article |
| Dementiev2004SearchTree | Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter | 2004 | | 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 | Proceedings Article |
| DeMeRa1999 | Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A. | 1999 | | Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206 | Proceedings Article |
| DemSan03 | Dementiev, Roman
Sanders, Peter | 2003 | | Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148 | Proceedings Article |
| Deng-Mahajan97 | Deng, Xiaotie
Mahajan, Sanjeev | 1997 | | The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802 | Journal Article |
| Denny03 | Denny, Markus | 2003 | | Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451 | Proceedings Article |
| Denny94 | Denny, Markus | 1994 | | Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
| DeSterckDescent | De Sterck, Hans | 2012 | | Steepest Descent Preconditioning for Nonlinear GMRES Optimization | Unpublished/Draft |
| DeSterckNGMRES | De Sterck, Hans | 2012 | | A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379 | Journal Article |
| DeSterckSVD | De Sterck, Hans | 2012 | | A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117 | Journal Article |
| DF2006 | Doerr, Benjamin
Friedrich, Tobias | 2006 |  | Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | Proceedings Article |
| DF2009 | Doerr, Benjamin
Friedrich, Tobias | 2009 | | Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | Journal Article |
| DF2010b | Doerr, Benjamin
Fouz, Mahmoud | 2011 | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | Journal Article |
| DFF11 | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2011 | | Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308 | Electronic Proceedings Article |
| DFKM08 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2008 | | How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74 | Proceedings Article |
| DFKM2008b | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2008 | | On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | Proceedings Article |
| DFKM2009 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2009 | | How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17 | Electronic Journal Article |
| dfkmsssw2003 | Dhiflaoui, Marcel
Funke, Stefan
Kwappik, Carsten
Mehlhorn, Kurt
Seel, Michael
Schömer, Elmar
Schulte, Ralph
Weber, Dennis | 2003 | | 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 | Proceedings Article |
| DFKO05 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | 2005 | | Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 | Proceedings Article |
| DFKO06 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | 2006 | | Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 | Proceedings Article |
| DFKP | Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej | 2006 | | Deterministic rendezvous in graphs | Unpublished/Draft |
| DFKP2006 | Dessmark, Anders
Fraigniaud, Pierre
Kowalski, Dariusz
Pelc, Andrzej | 2006 | | Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | Journal Article |
| DFKS09 | Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas | 2009 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | Proceedings Article |
| DFR2001 | Dey, Tamal K.
Funke, Stefan
Ramos, Edgar A. | 2001 | | Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132 | Electronic Proceedings Article |
| DG2010a | Doerr, Benjamin
Goldberg, Leslie Ann | 2010 | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Proceedings Article |
| DG2010b | Doerr, Benjamin
Goldberg, Leslie Ann | 2010 | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Proceedings Article |
| DGW10 | Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus | 2010 | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | Journal Article |
| DHL2009 | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | 2009 | | Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821 | Proceedings Article |
| DHS2011 | De Sterck, Hans
Henson, Van Emden
Sanders, Geoff | 2011 | | Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking | Unpublished/Draft |
| Dickert2000 | Dickert, Peter | 2000 | | Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes | Thesis - Masters thesis |
| DiedrichHarrenJansenThoeleThomas2008 | Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning | 2008 | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | Journal Article |
| DieKehNeu2008 | Diedrich, Florian
Kehden, Britta
Neumann, Frank | 2008 | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article |
| DieNeuCEC2008 | Diedrich, Florian
Neumann, Frank | 2008 | | Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 | Proceedings Article |
| Diete95 | Diete, Iris | 1995 | | Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes | Thesis - Masters thesis |
| DigHalf2003 | Doerr, Benjamin | 2006 | | Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99 | Journal Article |
| Diks-Hagerup96 | Diks, Krzysztof
Hagerup, Torben | 1996 | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140 | Proceedings Article |
| DiksHagerup1998 | Diks, Krzysztof
Hagerup, Torben | 1998 | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29 | Journal Article |
| Dimitrios2007 | Michail, Dimitrios | 2007 | | Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132 | Journal Article |
| DinitzGargGoemans1999 | Dinitz, Yefim
Garg, Naveen
Goemans, Michel X. | 1999 | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | Journal Article |
| DinitzZeev1999 | Dinitz, Yefim
Nutov, Zeev | 1999 | | A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30 | Journal Article |
| Dipl03/Ding | Ding, Wei | 2003 | | Geometric Rounding without changing the Topology
Universität des Saarlandes | Thesis - Masters thesis |
| Dipl03/Eigenwillig | Eigenwillig, Arno | 2003 | | Exact Arrangement Computation for Cubic Curves
Universität des Saarlandes | Thesis - Masters thesis |
| Dipl03/Fontaine | Fontaine, Marc | 2003 | | Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes | Thesis - Masters thesis |
| Dipl04/Berberich | Berberich, Eric | 2004 | | Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes | Thesis - Masters thesis |
| DiplPohl06 | Pohl, Sebastian | 2006 | | Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes | Thesis - Masters thesis |
| DiplWeber06 | Weber, Dennis | 2006 | | Solving large Sparse Linear Systems exactly
Universität des Saarlandes | Thesis - Masters thesis |
| Diss06Dementiev | Dementiev, Roman | 2006 | | Algorithm Engineering for Large Data Sets
Universität des Saarlandes | Thesis - PhD thesis |
| Diss06Hach | Hachenberger, Peter | 2006 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes | Thesis - PhD thesis |
| DissReichel06 | Reichel, Joachim | 2006 | | Combinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes | Thesis - PhD thesis |
| Djidjev-Pantziou-Zaro-1-95 | Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos | 1995 | | On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204 | Proceedings Article |
| Djidjev-Pantziou-Zaro-2-95 | Djidjev, Hristo N.
Pantziou, Grammati E.
Zaroliagis, Christos | 1995 | | Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200 | Proceedings Article |
| DjidjevPantziouZaroliagis2000 | Djidjev, Hristo N.
Pantziou, G. E.
Zaroliagis, Christos | 2000 | | Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389 | Journal Article |
| DK2012 | Duan, Ran
Mehlhorn, Kurt | 2012 | | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8 | Electronic Journal Article |
| DKMS05 | Dementiev, Roman
Kärkkäinen, Juha
Mehnert, Jens
Sanders, Peter | 2005 | | 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 | Proceedings Article |
| DKW2011 | Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus | 2011 | | Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | Proceedings Article |
| DLMNOPSW2012 | Cygan, Marek
Dell, Holger
Lokshtanov, Daniel
Marx, Daniel
Nederlof, Jesper
Okamoto, Yoshio
Paturi, Ramamohan
Saurabh, Saket
Wahlström, Magnus | 2012 | | On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 | Proceedings Article |
| DMSW2010 | De Sterck, Hans
Miller, Killian
Sanders, Geoff
Winlaw, Manda | 2011 | | Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671 | Journal Article |
| Dobkin-Gunopulos96 | Dobkin, David P.
Gunopulos, Dimitrios | 1996 | | Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132 | Proceedings Article |
| Doe-Joh-Koe-Neu-The:c:10:APSPCrossover | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine | 2010 | | More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193 | Proceedings Article |
| Doerr11 | Doerr, Benjamin | 2011 | | Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320 | Proceedings Article |
| Doerr12GECCO | Doerr, Benjamin | 2012 | | 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 | Proceedings Article |
| Doerr2005 | Doerr, Benjamin | 2005 | | Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068 | Proceedings Article |
| Doerr2005EurocombPropp | Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gabor | 2005 | | 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 | Proceedings Article |
| Doerr2005gitter | Doerr, Benjamin
Gnewuch, Michael
Srivastav, Anand | 2005 | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | Journal Article |
| Doerr2005Habil | Doerr, Benjamin | 2005 | | Integral Approximation
Christian-Albrechts-Universität zu Kiel | Thesis - Habilitation thesis |
| Doerr2005minload | Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand | 2005 | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article |
| Doerr2006gametrees | Doerr, Benjamin
Lorenz, Ulf | 2006 | | Error Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93 | Journal Article |
| Doerr2007-CECa | Doerr, Benjamin
Happ, Edda
Klein, Christian | 2007 | | A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895 | Proceedings Article |
| Doerr2007-CECb | Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
Neumann, Frank | 2007 | | A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | Proceedings Article |
| Doerr2007-ENDMa | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | 2007 | | Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | Journal Article |
| Doerr2007-ENDMb | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | 2007 | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | Journal Article |
| Doerr2007GeccoProc | Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.) | 2007 | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings |
| Doerr2007nitin | Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand | 2007 | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article |
| Doerr2007partial | Doerr, Benjamin | 2007 | | Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363 | Journal Article |
| Doerr2008-SODA | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | 2008 | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | Proceedings Article |
| Doerr2008-SODAb | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | 2008 | | Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | Proceedings Article |
| Doerr2008GeccoProc | Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.) | 2008 | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings |
| Doerr2009 | Doerr, Benjamin | 2009 | | Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111 | Part of a Book |
| Doerr2011 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Lehre, Per Christian
Wagner, Markus
Winzen, Carola | 2011 | | Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172 | Proceedings Article |
| Doerr2012x | Doerr, Benjamin
Doerr, Carola
Spöhel, Reto
Thomas, Henning | 2013 | | Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22 | Electronic Journal Article |
| Doerr2013AppAlg | Doerr, Benjamin | 2013 | | Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749 | Journal Article |
| Doerr2013CECemo | Doerr, Benjamin
Kodric, Bojana
Voigt, Marco | 2013 | | Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439 | Proceedings Article |
| Doerr2013z | Doerr, C.
Schmidt, Jens M.
Ramakrishna, G. | 2013 | | 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 | Proceedings Article |
| DoerrA11CCCG | Asano, Tetsuo
Doerr, Benjamin | 2011 | | Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | Proceedings Article |
| DoerrANALCO06 | Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor | 2006 | | 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 | Proceedings Article |
| DoerrDE13 | Doerr, Benjamin
Doerr, Carola
Ebel, Franziska | 2013 | | Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788 | Proceedings Article |
| DoerrDR2013 | Doerr, Carola
De Rainville, François-Michel | 2013 | | Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796 | Proceedings Article |
| DoerrENTT11 | Doerr, Benjamin
Eremeev, Anton
Neumann, Frank
Theile, Madeleine
Thyssen, Christian | 2011 | | Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | Journal Article |
| Doerretal2010b | Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian | 2010 | | Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Proceedings Article |
| DoerretalGECCO2009 | Doerr, Benjamin
Eremeev, Anton
Horoba, Christian
Neumann, Frank
Theile, Madeleine | 2009 | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Proceedings Article |
| DoerrF12 | Doerr, Benjamin
Fouz, Mahmoud | 2011 | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | Electronic Journal Article |
| DoerrFF12CACM | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2012 | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | Journal Article |
| DoerrFF12MedAlg | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2012 | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | Proceedings Article |
| DoerrFF12SWAT | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | 2012 | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article |
| DoerrFKS12 | Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas | 2011 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | Journal Article |
| DoerrFouz2006 | Doerr, Benjamin
Fouz, Mahmoud | 2006 | | Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19 | Miscellaneous |
| doerrfouz2009 | Doerr, Benjamin
Fouz, Mahmoud | 2009 | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Journal Article |
| DoerrFouz2010 | Doerr, Benjamin
Fouz, Mahmoud | 2010 | | Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | Journal Article |
| DoerrFouzSchmidtWahlstroem2009 | Doerr, Benjamin
Fouz, Mahmoud
Schmidt, Martin
Wahlström, Magnus | 2009 | | 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 | Proceedings Article |
| DoerrFriedrichSauerwald09 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | 2009 | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | Proceedings Article |
| doerrfriedrichsauerwald2009 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | 2009 | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | Journal Article |
| DoerrFW11 | Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten | 2011 | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | Proceedings Article |
| DoerrFW2010 | Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten | 2010 | | Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | Proceedings Article |
| DoerrG13algo | Doerr, Benjamin
Goldberg, Leslie Ann | 2013 | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | Journal Article |
| DoerrGKP08 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | Journal Article |
| DoerrGMSS11 | Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian | 2011 | | Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158 | Proceedings Article |
| DoerrGnewuch2008 | Doerr, Benjamin
Gnewuch, Michael | 2008 | | 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 | Proceedings Article |
| DoerrGnewuchKritzerPillichshammer2008 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | Journal Article |
| DoerrGW2009 | Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus | 2009 | | Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338 | Proceedings Article |
| DoerrHapp2008 | Doerr, Benjamin
Happ, Edda | 2008 | | Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613 | Proceedings Article |
| DoerrHK11 | Doerr, Benjamin
Happ, Edda
Klein, Christian | 2011 | | Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691 | Journal Article |
| DoerrHK2012GECCO | Doerr, Benjamin
Hota, Ashish
Kötzing, Timo | 2012 | | Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24 | Proceedings Article |
| DoerrHK2012TCS | Doerr, Benjamin
Happ, Edda
Klein, Christian | 2012 | | Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | Journal Article |
| DoerrHL13 | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | 2013 | | Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793 | Journal Article |
| DoerrJ11 | Doerr, Benjamin
Jansen, Thomas | 2011 | | Theory of Evolutionary Computation
In: Algorithmica [59], 299-300 | Journal Article |
| DoerrJ2010 | Doerr, Benjamin
Johannsen, Daniel | 2010 | | 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 | Proceedings Article |
| DoerrJansenKlein2008 | Doerr, Benjamin
Jansen, Thomas
Klein, Christian | 2008 | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article |
| DoerrJKNT13 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine | 2013 | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article |
| DoerrJohannsen07a | Doerr, Benjamin
Johannsen, Daniel | 2007 | | Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Proceedings Article |
| DoerrJohannsen2007b | Doerr, Benjamin
Johannsen, Daniel | 2007 | | Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507 | Proceedings Article |
| DoerrJohannsenTang2008a | Doerr, Benjamin
Johannsen, Daniel
Tang, Ching Hoo | 2008 | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article |
| DoerrJSWZ10 | Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine | 2010 | | Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | Proceedings Article |
| DoerrJSWZ13EvCo | Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine | 2013 | | Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27 | Journal Article |
| DoerrJW10a | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2010 | | Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article |
| DoerrJW10b | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2010 | | Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Proceedings Article |
| DoerrJW12 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2012 | | Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86 | Journal Article |
| DoerrJW12Multi | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | 2012 | | Multiplicative Drift Analysis
In: Algorithmica [64], 673-697 | Journal Article |
| DoerrK2013a | Doerr, Benjamin
Künnemann, Marvin | 2013 | | Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431 | Proceedings Article |
| DoerrK2013b | Doerr, Benjamin
Künnemann, Marvin | 2013 | | How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596 | Proceedings Article |
| DoerrKLW13 | Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola | 2013 | | Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | Journal Article |
| DoerrKuennemann2010 | Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus | 2010 | | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | Proceedings Article |
| DoerrKW11 | Doerr, Benjamin
Kötzing, Timo
Winzen, Carola | 2011 | | Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article |
| DoerrLKW11 | Doerr, Benjamin
Lengler, Johannes
Kötzing, Timo
Winzen, Carola | 2011 | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article |
| DoerrM11 | Doerr, Benjamin
Fouz, Mahmoud | 2011 | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article |
| DoerrMJ11 | Doerr, Benjamin
Johannsen, Daniel
Schmidt, Martin | 2011 | | Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126 | Proceedings Article |
| DoerrMMW2012arxiv | Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola | 2012 | | Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18 | Electronic Journal Article |
| DoerrNeumann | Doerr, Benjamin
Neumann, Frank | 2010 | | In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542 | Journal Article |
| DoerrNeumannWegener2010 | Doerr, Benjamin
Neumann, Frank
Wegener, Ingo | 2010 | | Editorial
In: Algorithmica [57], 119-120 | Journal Article |
| DoerrNSW11 | Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten | 2011 | | Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644 | Journal Article |
| DoerrP12GECCO | Doerr, Benjamin
Pohl, Sebastian | 2012 | | Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324 | Proceedings Article |
| DoerrSTACS2005 | Doerr, Benjamin | 2005 | | Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628 | Proceedings Article |
| DoerrStacs2006 | Doerr, Benjamin | 2006 | | Generating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583 | Proceedings Article |
| DoerrSTW12 | Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola | 2012 | | Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | Proceedings Article |
| DoerrSTW13 | Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola | 2013 | | Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | Proceedings Article |
| DoerrSW2013FOGA | Doerr, Benjamin
Sudholt, Dirk
Witt, Carsten | 2013 | | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63 | Proceedings Article |
| DoerrTCS2007 | Doerr, Benjamin | 2007 | | Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483 | Journal Article |
| DoerrTheileGECCO2009 | Doerr, Benjamin
Theile, Madeleine | 2009 | | Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254 | Proceedings Article |
| DoerrTusnady | Doerr, Benjamin | 2007 | | Matrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995 | Journal Article |
| DoerrW10 | Doerr, Benjamin
Winzen, Carola | 2011 | | Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28 | Proceedings Article |
| DoerrW11ECCC | Doerr, Benjamin
Winzen, Carola | 2011 | | Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7 | Electronic Journal Article |
| DoerrW12 | Doerr, Benjamin
Winzen, Carola | 2012 | | Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34 | Journal Article |
| DoerrW12EA | Doerr, Benjamin
Winzen, Carola | 2012 | | Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216 | Proceedings Article |
| DoerrW12GECCO | Doerr, Benjamin
Winzen, Carola | 2012 | | Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316 | Proceedings Article |
| DoerrW12Ranking | Doerr, Benjamin
Winzen, Carola | 2014 | | Ranking-Based Black-Box Complexity
In: Algorithmica [?], ? | Journal Article |
| DoerrW12STACS | Doerr, Benjamin
Winzen, Carola | 2012 | | Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452 | Electronic Proceedings Article |
| DoerrW12ToCS | Doerr, Benjamin
Winzen, Carola | 2012 | | Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27 | Electronic Journal Article |
| Donato-etal-Web-07 | Donato, Debora
Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F. | 2006 | | Algorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236 | Electronic Journal Article |
| Dorchain96 | Dorchain, Jörg | 1996 | | An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes | Thesis - Masters thesis |
| DSSS04 | Dementiev, Roman
Sanders, Peter
Schultes, Dominik
Sibeyn, Jop F. | 2004 | | Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208 | Proceedings Article |
| Duan2013 | Duan, Ran | 2013 | | 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 | Proceedings Article |
| DubhashiRanjan98 | Dubhashi, Devdatt
Ranjan, Desh | 1998 | | Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124 | Journal Article |
| Dumitriu2007 | Dumitriu, Daniel | 2007 | | Graph-based Conservative Surface Reconstruction
Universität des Saarlandes | Thesis - Masters thesis |
| Dumitriu2008a | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | 2008 | | On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208 | Proceedings Article |
| Duncan-Goodrich-Ramos97 | Duncan, C.A.
Goodrich, Michael T.
Ramos, Edgar A. | 1997 | | Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130 | Proceedings Article |
| DW09 | Doerr, Benjamin
Wahlström, Magnus | 2009 | | Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174 | Proceedings Article |
| DynamicGraphRumor | Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Pasquale, Francesco
Silvestri, Riccardo | 2013 | | Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), | Proceedings Article |
| EadesMutzel1998 | Eades, Peter
Mutzel, Petra | 1998 | | Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26 | Part of a Book |
| EadesMutzel1999 | Mutzel, Petra
Eades, Peter | 1999 | | Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26 | Part of a Book |
| EadMarksMutzelNorth1998 | Eades, Peter
Marks, Joe
Mutzel, Petra
North, Stephen | 1998 | | Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435 | Proceedings Article |
| EBS_09 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | 2009 | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article |
| ecg:beh-eeeac-04 | Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
Schömer, Elmar
Weber, Dennis
Wolpert, Nicola | 2004 | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Report |
| ecg:fhw-stcca-03 | Berberich, Eric
Eigenwillig, Arno
Fogel, Efi
Halperin, Dan
Hert, Susan
Kettner, Lutz
Teillaud, Monique
Wein, Ron | 2003 | | Specification of the traits classes for CGAL arrangements of curves | Report |
| ecg:ghh-boscd-03 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report |
| ecg:hks-emfga-04 | Hemmer, Michael
Kettner, Lutz
Schömer, Elmar | 2004 | | Effects of a Modular Filter on Geometric Applications | Report |
| ecg:kmp-cerpg-03 | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations | Report |
| EdelkampMeyer2001 | Edelkamp, Stefan
Meyer, Ulrich | 2001 | | Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184 | Proceedings Article |
| Edelsbrunner-Ramos97 | Edelsbrunner, Herbert
Ramos, Edgar A. | 1997 | | Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306 | Journal Article |
| efgk2003 | Eisenbrand, Friedrich
Funke, Stefan
Garg, Naveen
Könemann, Jochen | 2003 | | 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 | Proceedings Article |
| EFK00 | Eiglsperger, Markus
Fekete, Sandor P.
Klau, Gunnar W. | 2001 | | Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171 | Part of a Book |
| EFKM2005 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | 2005 | | Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | Proceedings Article |
| EFKM2008 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | 2008 | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article |
| eigenwillig-phd-08 | Eigenwillig, Arno | 2008 | | Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes | Thesis - PhD thesis |
| Eigenwillig2004a | Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola | 2004 | | Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418 | Proceedings Article |
| Eigenwillig2005 | Eigenwillig, Arno
Kettner, Lutz
Krandick, Werner
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | 2005 | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Proceedings Article |
| Eigenwillig2006a | Eigenwillig, Arno
Sharma, Vikram
Yap, Chee K. | 2006 | | 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 | Electronic Proceedings Article |
| Eigenwillig2007a | Eigenwillig, Arno | 2007 | | On Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230 | Journal Article |
| Eigenwillig2007b | Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola | 2007 | | Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167 | Proceedings Article |
| EisenbrandIJCGA2007 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar | 2007 | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article |
| ek-eae2aoaac-08 | Eigenwillig, Arno
Kerber, Michael | 2008 | | Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131 | Proceedings Article |
| ek-vaepaa-08 | Emeliyanenko, Pavel
Kerber, Michael | 2008 | | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings Article |
| eksw-eecaccc-06 | Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola | 2006 | | Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73 | Journal Article |
| EKSX2006 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao | 2006 | | Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755 | Proceedings Article |
| EKSX2008 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao | 2009 | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | Journal Article |
| ekw-fast-2007 | Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola | 2007 | | Fast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158 | Proceedings Article |
| EKX2007 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao | 2007 | | Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351 | Proceedings Article |
| Elbassioni2000 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2000 | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | Journal Article |
| Elbassioni2001 | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa | 2001 | | On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103 | Proceedings Article |
| Elbassioni2002a | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa | 2002 | | Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | Journal Article |
| Elbassioni2002b | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2002 | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | Proceedings Article |
| Elbassioni2002bz | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2002 | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | Electronic Journal Article |
| [Replication or Save Conflict] |  | | | | |
| Elbassioni2002d | Elbassioni, Khaled M. | 2002 | | An Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435 | Proceedings Article |
| Elbassioni2003a | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2003 | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | Journal Article |
| Elbassioni2003b | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2003 | | Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14 | Journal Article |
| Elbassioni2003c | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2003 | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | Proceedings Article |
| Elbassioni2003d | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa | 2003 | | An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555 | Proceedings Article |
| Elbassioni2003dz | Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim | 2003 | | An Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439 | Proceedings Article |
| Elbassioni2003e | Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir | 2003 | | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567 | Proceedings Article |
| Elbassioni2004 | Elbassioni, Khaled M. | 2002 | | On Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153 | Proceedings Article |
| Elbassioni2004a | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2004 | | An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | Proceedings Article |
| Elbassioni2004b | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid
Makino, Kazuhisa | 2004 | | Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309 | Proceedings Article |
| Elbassioni2004d | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2004 | | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | Proceedings Article |
| Elbassioni2004e | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Khachiyan, Leonid | 2004 | | Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162 | Proceedings Article |
| Elbassioni2004f | Mokbel, Mohamed F.
Aref, Walid G.
Elbassioni, Khaled M.
Kamel, Ibrahim | 2004 | | Scalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509 | Proceedings Article |
| Elbassioni2004g | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir | 2004 | | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133 | Proceedings Article |
| Elbassioni2005a | Elbassioni, Khaled M.
Mustafa, Nabil H. | 2005 | | Conflict-Free Colorings of Rectangle Ranges for Wireless Networks | Unpublished/Draft |
| Elbassioni2005d | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir | 2005 | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | Proceedings Article |
| Elbassioni2005e | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir | 2005 | | Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567 | Proceedings Article |
| Elbassioni2005f | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir | 2005 | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article |
| Elbassioni2005g | Elbassioni, Khaled M.
Katriel, Irit
Kutz, Martin
Mahajan, Meena | 2005 | | Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115 | Proceedings Article |
| Elbassioni2005ja | Elbassioni, Khaled M.
Elmasry, Amr
Kamel, Ibrahim | 2005 | | An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249 | Journal Article |
| Elbassioni2005jb | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | 2005 | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | Journal Article |
| Elbassioni2006 | Elbassioni, Khaled M. | 2006 | | On the Complexity of Monotone Boolean Duality Testing | Report |
| Elbassioni2006a | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir | 2006 | | Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765 | Proceedings Article |
| Elbassioni2006b | Elbassioni, Khaled M.
Mustafa, Nabil H. | 2006 | | Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263 | Proceedings Article |
| Elbassioni2006c | Elbassioni, Khaled M. | 2006 | | Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434 | Proceedings Article |
| Elbassioni2006d | Elbassioni, Khaled M. | 2006 | | On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351 | Proceedings Article |
| Elbassioni2006e | Elbassioni, Khaled M.
Lotker, Zvi
Seidel, Raimund | 2006 | | Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71 | Journal Article |
| Elbassioni2006f | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | 2006 | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article |
| Elbassioni2006g | Elbassioni, Khaled M.
Fishkin, Aleksei V.
Sitters, Rene | 2006 | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | Proceedings Article |
| Elbassioni2007a | Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh | 2007 | | 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) | Proceedings Article |
| Elbassioni2007b | Elbassioni, Khaled M.
Sitters, Rene
Zhang, Yan | 2007 | | A Quasi-PTAS for Envy-free Pricing on Line Graphs | Unpublished/Draft |
| Elbassioni2007c | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | 2007 | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft |
| Elbassioni2007d | Elbassioni, Khaled
Sitters, Rene
Zhang, Yan | 2007 | | 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 | Proceedings Article |
| Elbassioni2007e | Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor | 2007 | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article |
| Elbassioni2007f | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh | 2007 | | 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 | Proceedings Article |
| Elbassioni2007g | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2007 | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article |
| Elbassioni2007h | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2007 | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article |
| Elbassioni2007i | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2007 | | 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 | Journal Article |
| Elbassioni2007j | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2007 | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article |
| Elbassioni2008 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | 2008 | | 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 | Journal Article |
| Elbassioni2008a | Tiwary, Hans Raj
Elbassioni, Khaled | 2008 | | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198 | Proceedings Article |
| Elbassioni2008b | Elbassioni, Khaled
Hagen, Matthias
Rauf, Imran | 2008 | | Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102 | Proceedings Article |
| Elbassioni2008c | Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa | 2008 | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article |
| Elbassioni2008d | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir | 2008 | | 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 | Proceedings Article |
| Elbassioni2008e | Elbassioni, Khaled
Tiwary, Hans Raj | 2008 | | On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174 | Proceedings Article |
| Elbassioni2008f | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui | 2008 | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article |
| Elbassioni2008g | Kutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena | 2008 | | Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897 | Journal Article |
| Elbassioni2008h | Elbassioni, Khaled | 2008 | | A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277 | Journal Article |
| Elbassioni2008i | Elbassioni, Khaled | 2008 | | On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123 | Journal Article |
| Elbassioni2008j | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2008 | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | Journal Article |
| Elbassioni2008k | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir | 2008 | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article |
| Elbassioni2008l | Elbassioni, Khaled
Tiwary, Hans Raj | 2008 | | On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x | Journal Article |
| Elbassioni2008m | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2008 | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article |
| Elbassioni2008n | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | 2008 | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article |
| Elbassioni2008o | Elbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim | 2008 | | Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529 | Part of a Book |
| Elbassioni2008p | Elbassioni, Khaled | 2009 | | Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510 | Journal Article |
| Elbassioni2009a | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene | 2009 | | On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219 | Proceedings Article |
| Elbassioni2009d | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2010 | | 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 | Proceedings Article |
| Elbassioni2009ISAAC | Elbassioni, Khaled
Tiwary, Hans Raj | 2009 | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Proceedings Article |
| Elbassioni2009x | Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René | 2009 | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | Journal Article |
| Elbassioni2010 | Canzar, Stefan
Elbassioni, Khaled
Elmasry, Amr
Raman, Rajiv | 2010 | | On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179 | Proceedings Article |
| Elbassioni2010a | Elbassioni, Khaled
Chan, Hubert | 2010 | | 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 | Proceedings Article |
| Elbassioni2010b | Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj | 2010 | | Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136 | Proceedings Article |
| Elbassioni2010g | Elbassioni, Khaled
Fouz, Mahmoud
Swamy, Chaitanya | 2010 | | Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472 | Proceedings Article |
| Elbassioni2010h | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2010 | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft |
| Elbassioni2010i | Christodoulou, George
Elbassioni, Khaled
Fouz, Mahmoud | 2010 | | Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | Proceedings Article |
| Elbassioni2011a | Elbassioni, Khaled
Tiwary, Hans Raj | 2011 | | On a cone covering problem
In: Computational Geometry [44], 129-134 | Journal Article |
| Elbassioni2011d | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2011 | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft |
| Elbassioni2011e | Boros, Endre
Elbassioni, Khaled
Fouz, Mahmoud
Gurvich, Vladimir
Makino, Kazuhisa
Manthey, Bodo | 2011 | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article |
| Elbassioni2011f | Canzar,Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian | 2011 | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article |
| Elbassioni2011g | Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh | 2011 | | Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Electronic Proceedings Article |
| Elbassioni2011h | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2012 | | Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | Unpublished/Draft |
| Elbassioni2011i | Elbassioni, Khaled
Elmasry, Amr
Makino, Kazuhisa | 2011 | | Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506 | Journal Article |
| Elbassioni2011j | Chan, T.-H. Hubert
Elbassioni, Khaled | 2011 | | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723 | Journal Article |
| Elbassioni2011k | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | 2011 | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article |
| Elbassioni2011l | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian | 2011 | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Journal Article |
| Elbassioni2011m | Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj | 2011 | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463 | Journal Article |
| Elbassioni2011n | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | 2012 | | On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788 | Journal Article |
| Elbassioni2012a | Elbassioni, Khaled
Paluch, Katarzyna
van Zuylen, Anke | 2012 | | Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506 | Electronic Proceedings Article |
| Elbassioni2012b | Elbassioni, Khaled
Tiwary, Hans Raj | 2012 | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | Journal Article |
| Elbassioni2012c | Canzar, Stefan
El-Kebir, Mohammed
Pool, Rene
Elbassioni, Khaled
Malde, Alpeshkumar K.
Mark, Alan E.
Geerke, Daan P.
Stougie, Leen
Klau, Gunnar W. | 2012 | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article |
| Elbassioni2012d | Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh | ?? | | On Enumerating Minimal Transversals of Geometric Hypergraphs | Unpublished/Draft |
| Elbassioni2012e | Elbassioni, Khaled | 2012 | | A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524 | Proceedings Article |
| Elbassioni2012f | Elbassioni, Khaled
Fouad, Mohamed
Bertino, Elisa | 2012 | | Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450 | Proceedings Article |
| Elbassioni2012g | Elbassioni, Khaled
Garg, Naveen
Gupta, Divya
Kumar, Amit
Narula, Vishal
Pal, Arindam | 2012 | | 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 | Electronic Proceedings Article |
| Elbassioni2012h | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René | 2012 | | On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77 | Journal Article |
| Elbassioni2012i | Elbassioni, Khaled
Jeli´c, Slobodan
Matijevi`c, Domagoj | 2012 | | The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101 | Journal Article |
| Elbassioni2012j | Canzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian | 2011 | | On Tree-Constrained Matchings and Generalizations | Unpublished/Draft |
| Elbassioni2012z | Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj | 2012 | | Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151 | Journal Article |
| Elbassioni2013a | Elbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He | 2013 | | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft |
| ElbassioniKatriel2004 | Elbassioni, Khaled M.
Katriel, Irit | 2005 | | Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182 | Proceedings Article |
| ElbassioniKatriel2006 | Elbassioni, Khaled M. | 2006 | | Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352 | Journal Article |
| ElbassioniMestre2009a | Elbassioni, Khaled M.
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj | 2009 | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
| ElbassioniRauf2010 | Elbassioni, Khaled
Rauf, Imran | 2010 | | Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363 | Journal Article |
| ElbRau09a | Elbassioni, Khaled
Rauf, Imran | 2010 | | Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry | Unpublished/Draft |
| ElKahoui1996 | El Kahoui, M'hammed | 1996 | | An Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544 | Journal Article |
| ElKahoui2000 | El Kahoui, M'hammed | 2000 | | Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179 | Journal Article |
| ElKahoui2001 | El Kahoui, M'hammed | 2001 | | Improved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93 | Journal Article |
| ElKahoui2002a | Bouziane, Driss
El Kahoui, M'hammed | 2002 | | Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117 | Journal Article |
| ElKahoui2002b | El Kahoui, M'hammed | 2002 | | On plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23 | Journal Article |
| ElKahoui2003 | El Kahoui, M'hammed | 2003 | | An elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292 | Journal Article |
| ElKahoui2004a | El Kahoui, M'hammed | 2004 | | Contants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541 | Journal Article |
| ElKahoui2004b | El Kahoui, M'hammed | 2004 | | Subresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261 | Journal Article |
| ElKahoui2004c | El Kahoui, M'hammed | 2004 | | 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 | Proceedings Article |
| ElKahoui2005a | El Kahoui, M'hammed | 2005 | | Birational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71 | Journal Article |
| ElKahoui2005b | El Kahoui, M'hammed | 2005 | | $D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199 | Journal Article |
| ElKahoui2005c | El Kahoui, M'hammed | 2005 | | UFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452 | Journal Article |
| ElKahoui2005d | Brown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas | 2006 | | Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | Journal Article |
| ElKahoui2005e | El Kahoui, M'hammed | 2008 | | Computing with algebraic curves in generic position | Miscellaneous |
| ElKahoui2005f | El Kahoui, M'hammed | 2008 | | Polynomial parametrization of nonsingular algebraic curves | Miscellaneous |
| ElKahoui2005g | El Kahoui, M'hammed
Rakrak, Said | 2007 | | Structure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187 | Journal Article |
| Elmasry2008a | Elmasry, Amr
Hammad, Abdelrahman | 2008 | | Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18 | Journal Article |
| Elmasry2008b | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2008 | | Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19 | Journal Article |
| Elmasry2008c | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2008 | | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204 | Journal Article |
| Elmasry2008d | Elmasry, Amr | 2008 | | Violation Heaps: A Better Substitute for Fibonacci Heaps | Report |
| Elmasry2009 | Elmasry, Amr | 2009 | | Pairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476 | Proceedings Article |
| Elmasry2009x | Elmasry, Amr | 2009 | | Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086 | Journal Article |
| Elmasry2010 | Elmasry, Amr | 2010 | | Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110 | Journal Article |
| Elmasry2010a | Elmasry, Amr | 2010 | | The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658 | Journal Article |
| Elmasry2010b | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2010 | | Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37 | Proceedings Article |
| Elmasry2010c | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | 2010 | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article |
| Elmasry2012 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | 2012 | | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | Journal Article |
| Elmasry2013 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | 2013 | | Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | Journal Article |
| ElmasryMehlhornSchmidt2010 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | 2010 | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
| ElsaesserS2011 | Elsaesser, Robert
Sauerwald, Thomas | 2011 | | Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641 | Journal Article |
| emel-gcd-11 | Emeliyanenko, Pavel | 2011 | | High-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224 | Proceedings Article |
| Emel-gtc-10 | Emeliyanenko, Pavel | 2010 | | Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), - | Poster |
| emel-res-2012 | Emeliyanenko, Pavel | 2012 | | Computing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14 | Electronic Journal Article |
| Emel2007 | Emeliyanenko, Pavel | 2007 | | Visualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Masters thesis |
| emel_gpgpu_09 | Emeliyanenko, Pavel | 2009 | | Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article |
| emel_gpures_2010 | Emeliyanenko, Pavel | 2010 | | Modular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440 | Proceedings Article |
| Emminghaus95 | Emminghaus, Frank | 1995 | | Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
| EMR09 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | 2009 | | On the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 | Proceedings Article |
| EpJeSS12 | Epstein, Leah
Jez, Lukasz
Sgall, Jiri
van Stee, Rob | 2012 | | Online Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145 | Proceedings Article |
| EpKlSt2009 | Epstein, Leah
Kleiman, Elena
van Stee, Rob | 2009 | | Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | Proceedings Article |
| EpLeSt10 | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2010 | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings Article |
| EpLeSt11a | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2011 | | Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250 | Journal Article |
| EpLeSt12 | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2012 | | Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129 | Journal Article |
| EpLeSt13 | Epstein, Leah
Levin, Asaf
van Stee, Rob | 2013 | | 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 | Proceedings Article |
| EpsSte11 | Epstein, Leah
van Stee, Rob | 2011 | | Improved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92 | Journal Article |
| EpsSte12 | Epstein, Leah
van Stee, Rob | 2012 | | The price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54 | Journal Article |
| EpsSte2009 | Epstein, Leah
van Stee, Rob | 2010 | | Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57 | Journal Article |
| Epstein2006 | Epstein, Leah
Kesselman, Alexander | 2006 | | On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285 | Journal Article |
| EpsteinAMMMSS2010 | Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen | 2010 | | Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243 | Proceedings Article |
| EpStTa2009 | Epstein, Leah
van Stee, Rob
Tamir, Tami | 2009 | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | Journal Article |
| ES-complexity-12 | Emeliyanenko, Pavel
Sagraloff, Michael | 2012 | | On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161 | Proceedings Article |
| ESA:EMR09 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | 2009 | | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | Proceedings Article |
| esw-sacsee-02 | Eigenwillig, Arno
Schömer, Elmar
Wolpert, Nicola | 2002 | | Sweeping Arrangements of Cubic Segments Exactly and Efficiently | Report |
| EulerECJ07 | Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank | 2007 | | Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410 | Journal Article |
| FanghaenelGHV2013 | Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold | 2013 | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | Journal Article |
| Farzan2010 | Farzan, Arash
Gagie, Travis
Navarro, Gonzalo | 2010 | | Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 | Proceedings Article |
| Farzan2010a | Blelloch, Guy E.
Farzan, Arash | 2010 | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article |
| FarzanDynamic2011 | Farzan, Arash
Munro, J. Ian | 2011 | | Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678 | Journal Article |
| Fatourou2000 | Fatourou, Panagiota
Spirakis, Paul G. | 2000 | | Efficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232 | Journal Article |
| FBVI2011 | Friedrich, Tobias
Bringmann, Karl
Voss, Thomas
Igel, Christian | 2011 | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | Proceedings Article |
| Feld98 | Feld, Thomas | 1998 | | Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes | Thesis - Masters thesis |
| FeldmannBachelor2012 | Feldmann, Matthias | 2012 | | Stochastic optimization with fitness proportional ant systems
Universität des Saarlandes | Thesis - Bachelor thesis |
| Fellows2012 | Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A. | 2012 | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | Journal Article |
| FellowsFertinHermelinVialette2011 | Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane | 2011 | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | Journal Article |
| FellowsFriedrichHermelinEtAL2011 | Fellows, Michael R.
Friedrich, Tobias
Hermelin, Danny
Narodytska, Nina
Rosamond, Frances A. | 2011 | | 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 | Proceedings Article |
| FellowsHatrmanHermelinEtAl2011 | Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat | 2011 | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | Journal Article |
| FernauFominLokshtanovMnichPhilipSaurabh2010 | Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket | 2011 | | Ranking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, | Proceedings Article |
| FernauFominPhilipSaurabh2010 | Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket | 2010 | | The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 | Proceedings Article |
| FerraginaGrossSIAMJCOMPUT1998 | Ferragina, Paolo
Gross, Roberto | 1998 | | Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736 | Journal Article |
| fffmo-eropmoffsi-14 | Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos | 2014 | | Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | Proceedings Article |
| ffks-ffagp-13 | Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane | 2013 | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | Proceedings Article |
| FH08 | Friedrich, Tobias
Hebbinghaus, Nils | 2008 | | 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 | Proceedings Article |
| FHHNW10 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | 2010 | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | Journal Article |
| FHN10 | Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank | 2010 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864 | Journal Article |
| FHP2009 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | 2009 | | Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530 | Proceedings Article |
| FHPInfocom10 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | 2010 | | Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560 | Proceedings Article |
| Fialko97 | Fialko, Sergej | 1997 | | Das planare Augmentierungsproblem
Universität des Saarlandes | Thesis - Masters thesis |
| FinkDipl01 | Fink, Christian | 2001 | | Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes | Thesis - Masters thesis |
| Finkler-Diss97 | Finkler, Ulrich | 1997 | | Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes | Thesis - PhD thesis |
| Finkler-et-al96 | Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | 1996 | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | Proceedings Article |
| Finkler-et-al97 | Calinescu, Gruia
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | 1998 | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Journal Article |
| Finkler-Mehlhorn97 | Finkler, Ulrich
Mehlhorn, Kurt | 1997 | | Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389 | Proceedings Article |
| FK2006 | Funke, Stefan
Klein, Christian | 2006 | | Hole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385 | Proceedings Article |
| FKesselmanMeyerS2006 | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael | 2006 | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | Journal Article |
| FKKLS07 | Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael | 2007 | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | Journal Article |
| FKKMS02 | Fotakis, Dimitris
Kontogiannis, Spyros
Koutsoupias, Elias
Mavronicolas, Marios
Spirakis, Paul G. | 2002 | | The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134 | Proceedings Article |
| FKLS2004 | Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
Segal, Michael | 2004 | | Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 | Proceedings Article |
| FKMcEJC2010 | Fountoulakis, Nikolaos
Kang, Ross
McDiarmid, Colin | 2010 | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | Electronic Journal Article |
| FKMS2005 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | 2005 | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | Proceedings Article |
| FKMS2005b | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
Segal, Michael | 2005 | | 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 | Proceedings Article |
| fkw-eevsopcowsn-14 | Friedrichs, Stephan
Kulau, Ulf
Wolf, Lars | 2014 | | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | Proceedings Article |
| FL2007 | Funke, Stefan
Laue, Sören | 2007 | | 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 | Proceedings Article |
| Flash-WEA-2008 | Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan | 2008 | | 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 | Proceedings Article |
| Fleischer-FUN-1999 | Fleischer, Rudolf | 1999 | | FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98 | Proceedings Article |
| Fleischer-Jung-Mehlhorn95 | Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt | 1995 | | A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | Journal Article |
| Fleischer1998bahncard | Fleischer, Rudolf | 1998 | | On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74 | Proceedings Article |
| Fleischer1999 | Fleischer, Rudolf | 1999 | | Effiziente und Online-Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis |
| Fleischer96 | Fleischer, Rudolf | 1996 | | A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149 | Journal Article |
| FleischerSkutella2003 | Fleischer, Lisa
Skutella, Martin | 2003 | | Minimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75 | Proceedings Article |
| Fleischer_dectrees_1999 | Fleischer, Rudolf | 1999 | | Decision trees: old and new results
In: Information and computation [152], 44-61 | Journal Article |
| FLN2007 | Funke, Stefan
Laue, Sören
Naujoks, Rouven | 2007 | | Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 | Proceedings Article |
| FLNL2008 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi | 2008 | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article |
| fm-lalokfgc-00 | Funke, Stefan
Mehlhorn, Kurt | 2000 | | LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165 | Proceedings Article |
| fm-look-2002 | Funke, Stefan
Mehlhorn, Kurt | 2002 | | LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118 | Journal Article |
| FM2007 | Funke, Stefan
Milosavljevic, Nikola | 2007 | | Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967 | Proceedings Article |
| FM2007b | Funke, Stefan
Milosavljevic, Nikola | 2007 | | Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252 | Proceedings Article |
| FM97 | Fialko, Sergej
Mutzel, Petra | 1998 | | 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 | Proceedings Article |
| FMMW2006 | Funke, Stefan
Malamatos, Theocharis
Matijevic, Domagoj
Wolpert, Nicola | 2006 | | (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26 | Proceedings Article |
| FMN1999 | Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan | 1999 | | Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42 | Proceedings Article |
| FMR2004 | Funke, Stefan
Malamatos, Theocharis
Ray, Rahul | 2004 | | Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105 | Proceedings Article |
| FMR2004b | Funke, Stefan
Malamatos, Theocharis
Ray, Rahul | 2004 | | Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4 | Proceedings Article |
| FMS2003 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | 2003 | | Approximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241 | Proceedings Article |
| FMS2004 | Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | 2004 | | 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 | Proceedings Article |
| FNPS02 | Fotakis, Dimitris
Nikoletseas, Sotiris
Papadopoulou, Vicky
Spirakis, Paul G. | 2002 | | Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234 | Proceedings Article |
| FOCS::DietzfelbingerKMHRT1988 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | 1988 | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | Proceedings Article |
| FOCS::MehlhornNR1989 | Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika | 1989 | | On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548 | Proceedings Article |
| FollertSchoemerSellenSmidThiel97 | Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian | 1997 | | Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580 | Journal Article |
| FominLokshtanovMisraPhilipSaurabh2011 | Fomin, Fedor V.
Lokshtanov, Daniel
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket | 2011 | | Hitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200 | Proceedings Article |
| FominPhilipVillanger2011 | Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve | 2011 | | Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175 | Proceedings Article |
| FormalVerificationofCertifyingComputations | Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine | 2011 | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article |
| FOSW08 | Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten | 2008 | | Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952 | Proceedings Article |
| Fot03 | Fotakis, Dimitris | 2003 | | On the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652 | Proceedings Article |
| Fotakis2004a | Fotakis, Dimitris | 2004 | | Incremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358 | Proceedings Article |
| Fountoulakis2007 | Fountoulakis, Nikolaos
Reed, Bruce | 2007 | | Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486 | Journal Article |
| Fountoulakis2008 | Fountoulakis, Nikolaos
Reed, Bruce | 2008 | | The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86 | Journal Article |
| Fountoulakis2008a | Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2008 | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | Journal Article |
| Fountoulakis2008b | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2008 | | The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141 | Journal Article |
| Fountoulakis2009 | Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2009 | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | Journal Article |
| Fountoulakis2009a | Fountoulakis, Nikolaos | 2007 | | Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356 | Journal Article |
| Fountoulakis2009b | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | 2009 | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | Journal Article |
| Fountoulakis2011 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2011 | | 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | Journal Article |
| FountoulakisHuberPanagiotouBrief2010 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | 2009 | | The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530 | Proceedings Article |
| FountoulakisKhoslaPanagiotou2010 | Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos | 2011 | | The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236 | Proceedings Article |
| FountoulakisPS12 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Sauerwald, Thomas | 2012 | | Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660 | Proceedings Article |
| FouzDiss2012 | Fouz, Mahmoud | 2012 | | Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes | Thesis - PhD thesis |
| FP12RSA | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2012 | | Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333 | Journal Article |
| FPIcalp2010 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2010 | | Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359 | Proceedings Article |
| FPRandom10 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2010 | | Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573 | Proceedings Article |
| FPSS03 | Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G. | 2003 | | Space Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282 | Proceedings Article |
| FPSSICOMP2013 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | 2013 | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | Journal Article |
| fr-rcwcae-01 | Funke, Stefan
Ramos, Edgar A. | 2001 | | Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353 | Proceedings Article |
| fr-ssrinlt-02 | Funke, Stefan
Ramos, Edgar A. | 2002 | | Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790 | Proceedings Article |
| FredericksonSolis-Oba98 | Frederickson, Greg N.
Solis-Oba, Roberto | 1998 | | Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518 | Journal Article |
| FredmanKhachiyan96 | Fredman, Michael
Khachiyan, Leonid | 1996 | | On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628 | Journal Article |
| Friedrich2005 | Friedrich, Tobias | 2005 | | Deterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena | Thesis - Masters thesis |
| Friedrich2009 | Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas | 2010 | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | Proceedings Article |
| FriedrichDAM2011 | Friedrich, Tobias
Hebbinghaus, Nils | 2011 | | Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758 | Journal Article |
| FriedrichGS2012 | Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas | 2012 | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | Journal Article |
| FriedrichKN2011 | Friedrich, Tobias
Kroeger, Trent
Neumann, Frank | 2012 | | Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 | Electronic Journal Article |
| FriedrichOSW2009 | Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten | 2009 | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | Journal Article |
| FriedrichPhD2007 | Friedrich, Tobias | 2007 | | Use and Avoidance of Randomness
Universität des Saarlandes | Thesis - PhD thesis |
| FriedrichRGG2010 | Bradonjić, Milan
Elsässer, Robert
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre | 2010 | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | Proceedings Article |
| FriedrichRSA2011 | Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan | 2011 | | Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138 | Journal Article |
| FriedrichSauerwald2010 | Friedrich, Tobias
Sauerwald, Thomas | 2010 | | The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139 | Proceedings Article |
| FriedrichSauerwald2010EJC | Friedrich, Tobias
Sauerwald, Thomas | 2010 | | The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30 | Electronic Journal Article |
| FriedrichSauerwaldVilenchik09 | Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan | 2009 | | Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | Proceedings Article |
| FriedrichSS11 | Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre | 2011 | | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | Proceedings Article |
| FriedrichTCS2011 | Friedrich, Tobias
Horoba, Christian
Neumann, Frank | 2011 | | Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556 | Journal Article |
| Fries2000 | Fries, Markus | 2000 | | Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes | Thesis - Masters thesis |
| FriesDipl01 | Fries, Markus | 2001 | | Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes | Thesis - Masters thesis |
| FrietalECJ2009 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | 2009 | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | Journal Article |
| Frigioni-et-al-98 | Frigioni, Daniele
Miller, Tobias
Nanni, Umberto
Pasqualone, Giulio
Schäfer, Guido
Zaroliagis, Christos | 1998 | | An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 | Proceedings Article |
| FriHebNeuTCS2009 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | 2009 | | Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462 | Journal Article |
| FriHorNeuGECCO2009 | Friedrich, Tobias
Horoba, Christian
Neumann, Frank | 2009 | | Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 | Proceedings Article |
| FriHorNeuPPSN2008 | Friedrich, Tobias
Horoba, Christian
Neumann, Frank | 2008 | | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680 | Proceedings Article |
| FriNeuCEC2008 | Friedrich, Tobias
Neumann, Frank | 2008 | | When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003 | Proceedings Article |
| FriNeuNat2009 | Friedrich, Tobias
Neumann, Frank | 2010 | | When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294 | Journal Article |
| FroylandKMDW08 | Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard | 2008 | | Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75 | Journal Article |
| fs-rsm-01 | Fuhrmann, Artur
Schömer, Elmar | 2001 | | 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 | Proceedings Article |
| FS09 | Friedrich, Tobias
Sauerwald, Thomas | 2009 | | Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130 | Proceedings Article |
| FS2002a | Fotakis, Dimitris
Spirakis, Paul G. | 2002 | | Minimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422 | Journal Article |
| FuGui2006 | Funke, Stefan
Guibas, Leonidas
Nguyen, An
Wang, Yusu | 2006 | | Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251 | Proceedings Article |
| Funke1998 | Burnikel, Christoph
Funke, Stefan
Seel, Michael | 1998 | | Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183 | Proceedings Article |
| Funke2007 | Aronov, Boris
Asano, Tetsuo
Funke, Stefan | 2007 | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article |
| Funke97 | Funke, Stefan | 1997 | | Exact Arithmetic using Cascaded Computation
Universität des Saarlandes | Thesis - Masters thesis |
| FunkeDiss2001 | Funke, Stefan | 2001 | | Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes | Thesis - PhD thesis |
| FunkeHD2005 | Funke, Stefan | 2005 | | Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53 | Proceedings Article |
| FunkeIE2005 | Funke, Stefan
Milosavljevic, Nikola | 2005 | | Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367 | Proceedings Article |
| FunkeLaueLotkerNaujoks2006 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi | 2006 | | Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14 | Miscellaneous |
| FunkeRauf07 | Funke, Stefan
Rauf, Imran | 2007 | | Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100 | Proceedings Article |
| F.Sibeyn-ActaInformatica38-1998 | Sibeyn, Jop F. | 1998 | | List Ranking on Meshes
In: Acta Informatica [35], 543-566 | Journal Article |
| F.Sibeyn-HabilThesis-1999 | Sibeyn, Jop F. | 1999 | | Effiziente parallele Algorithmen
Universität des Saarlandes | Thesis - Habilitation thesis |
| F.Sibeyn-HiPC-1999 | Sibeyn, Jop F. | 1999 | | Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201 | Proceedings Article |
| F.Sibeyn-IEEETransParaDistri-1998 | Sibeyn, Jop F.
Juurlink, Ben
Rao, P. Srinivasa | 1998 | | Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525 | Journal Article |
| F.Sibeyn-IPPS-1999 | Sibeyn, Jop F. | 1999 | | 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 | Proceedings Article |
| F.Sibeyn-JParallelDistributedComp-1998 | Sibeyn, Jop F.
Grammatikakis, M.D.
Hsu, D.F.
Kraetzl, M. | 1998 | | Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132 | Journal Article |
| F.Sibeyn-PDCS-1999 | Lambert, Oliver
Sibeyn, Jop F. | 1999 | | Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460 | Proceedings Article |
| F.Sibeyn-SIAM-1999 | Sibeyn, Jop F. | 1999 | | Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863 | Journal Article |
| F.Sibeyn-SIROCCO-1999 | Sibeyn, Jop F. | 1999 | | Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263 | Proceedings Article |
| F.Sibeyn-STACS-1999 | Sibeyn, Jop F. | 1999 | | External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301 | Proceedings Article |
| F.SibeynSWAT1998 | Sibeyn, Jop F. | 1998 | | Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299 | Proceedings Article |
| G4 | P. Gao | 2012 | | Distributions of sparse spanning subgraphs in random graphs | Unpublished/Draft |
| G6 | P. Gao | 2012 | | Distribution of the number of spanning regular subgraphs in random graphs | Unpublished/Draft |
| G7 | P. Gao | 2012 | | Uniform generation of d-factors in dense host graphs | Unpublished/Draft |
| GaertnerHotzr2009 | Gärtner, Tobias
Hotz, Günter | 2009 | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | Proceedings Article |
| GameAging2001 | Doerr, Benjamin | 2001 | | Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx | Journal Article |
| Gao2010DegSub | Gao, Pu (Jane)
Wormald, Nicholas
Su, Yi | 2010 | | Induced subgraphs in sparse random graphs with given degree sequence | Unpublished/Draft |
| Gao2012dFactor | Gao, Pu (Jane) | 2011 | | Distribution of spanning regular subgraphs in random graphs | Unpublished/Draft |
| Garg-et-al96 | Garg, Naveen
Papatriantafilou, Marina
Tsigas, Philippas | 1996 | | 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 | Proceedings Article |
| Garg-Vazirani-95 | Garg, Naveen
Vazirani, Vijay V. | 1995 | | A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25 | Journal Article |
| Garg-Vazirani96 | Garg, Naveen
Vazirani, Vijay V. | 1996 | | Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251 | Journal Article |
| GargKonjevodRavi2000 | Garg, Naveen
Konjevod, Goran
Ravi, R. | 2000 | | Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84 | Journal Article |
| GasienicJanssonLingasOestlin1997 | Gasieniec, Leszek
Jansson, Jesper
Lingas, Andrzej
Östlin, Anna | 1997 | | On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145 | Proceedings Article |
| Gasieniec-Indyk-Krysta97 | Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr | 1997 | | External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101 | Proceedings Article |
| Gasieniec1-96 | Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech | 1996 | | Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403 | Proceedings Article |
| Gasieniec2-96 | Brodal, Gerth Stølting
Gasieniec, Leszek | 1996 | | Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74 | Proceedings Article |
| Gasieniec3-96 | Gasieniec, Leszek
Kranakis, Evangelos
Krizanc, Danny
Pelc, Andrzej | 1996 | | Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403 | Proceedings Article |
| Gasieniec4-96 | Chlebus, Bogdan S.
Czumaj, Artur
Gasieniec, Leszek
Kowaluk, Miroslaw
Plandowski, Wojciech | 1996 | | Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266 | Proceedings Article |
| Gasieniec5-96 | Gasieniec, Leszek
Karpinski, Marek
Plandowski, Wojciech
Rytter, Wojciech | 1996 | | Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49 | Proceedings Article |
| Gasieniec6-96 | Gasieniec, Leszek
Pelc, Andrzej | 1996 | | Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912 | Journal Article |
| GasieniecIndyk97 | Gasieniec, Leszek
Indyk, Piotr | 1997 | | Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197 | Proceedings Article |
| GasieniecPelc97 | Gasieniec, Leszek
Pelc, Andrzej | 1997 | | Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20 | Journal Article |
| Gast97 | Gast, Christoph | 1997 | | Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes | Thesis - Masters thesis |
| Gawrychowski2012a | Gawrychowski, Pawel | 2012 | | Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635 | Electronic Proceedings Article |
| Gawrychowski2012b | Gawrychowski, Pawel | 2012 | | Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242 | Proceedings Article |
| Gawrychowski2012c | Gawrychowski, Pawel | 2012 | | Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236 | Proceedings Article |
| Gawrychowski2013 | Gawrychowski, Pawel
Manea, Florin
Mercas, Robert
Nowotka, Dirk
Tiseanu, Catalin | 2013 | | Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 | Proceedings Article |
| Gawrychowski2013alphabetic | Gawrychowski, Pawel | 2013 | | Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48 | Proceedings Article |
| Gawrychowski2013ancestors | Gagie, Travis
Gawrychowski, Pawel
Nekrich, Yakov | 2013 | | Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150 | Proceedings Article |
| Gawrychowski2013beating | Gawrychowski, Pawel
Straszak, Damian | 2013 | | Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Proceedings Article |
| Gawrychowski2013converting | Bannai, Hideo
Gawrychowski, Pawel
Inenaga, Shunsuke
Takeda, Masayuki | 2013 | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Proceedings Article |
| Gawrychowski2013discovering | Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk | 2013 | | Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | Proceedings Article |
| Gawrychowski2013discriminating | Gawrychowski, Pawel
Kucherov, Gregory
Nekrich, Yakov
Starikovskaya, Tatiana | 2013 | | Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), | Proceedings Article |
| Gawrychowski2014 | Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk | 2014 | | Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349 | Proceedings Article |
| Gawrychowski2014a | Gagie, Travis
Gawrychowski, Pawel
Kärkkäinen, Juha
Nekrich, Yakov
Puglisi, Simon J. | 2014 | | LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742 | Proceedings Article |
| Gawrychowski2014b | Gawrychowski, Pawel
Mozes, Shay
Weimann, Oren | 2014 | | Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537 | Proceedings Article |
| Gawrychowski2014c | Gawrychowski, Pawel
Uznanski, Przemyslaw | 2014 | | Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139 | Proceedings Article |
| Gawrychowski2014d | Babenko, Maxim A.
Gawrychowski, Pawel
Kociumaka, Tomasz
Starikovskaya, Tatiana A. | 2014 | | 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 | Proceedings Article |
| Gawrychowski2014e | Gawrychowski, Pawel | 2014 | | Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41 | Journal Article |
| GawrychowskiJez2014 | Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz | 2014 | | Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372 | Journal Article |
| GDCompRep1999 | Brandenburg, Franz J.
Schreiber, Falk
Jünger, Michael
Marks, Joe
Mutzel, Petra | 1999 | | Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409 | Proceedings Article |
| gecco2009 | Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.) | 2009 | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings |
| Gergov-et-al96 | Gergov, Jordan | 1996 | | Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61 | Proceedings Article |
| Gergov-Meinel96 | Gergov, Jordan
Meinel, Christoph | 1996 | | Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282 | Journal Article |
| GergovDiss00 | Gergov, Jordan | 2000 | | Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes | Thesis - PhD thesis |
| ghhkms-bo3ds-03 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Proceedings Article |
| ghs-che-01 | Geismann, Nicola
Hemmer, Michael
Schömer, Elmar | 2001 | | The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322 | Proceedings Article |
| ghs-qsi-01 | Geismann, Nicola
Hemmer, Michael
Schömer, Elmar | 2001 | | 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 | Proceedings Article |
| GiakkoupisS12 | Giakkoupis, George
Sauerwald, Thomas | 2012 | | Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641 | Proceedings Article |
| Giannopoulos2010 | Giannopoulos, Panos
Klein, Rolf
Kutz, Martin
Marx, Daniel | 2010 | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | Journal Article |
| Gidenstam2007a | Gidenstam, Anders
Papatriantafilou, Marina | 2007 | | LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231 | Proceedings Article |
| Gidenstam200901 | Larsson, Andreas
Gidenstam, Anders
Ha, Phuong H.
Papatriantafilou, Marina
Tsigas, Philippas | 2009 | | Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30 | Electronic Journal Article |
| Gidenstam200902 | Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Håkan
Tsigas, Philippas | 2009 | | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Journal Article |
| Gidenstam200903 | Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Phillipas | 2009 | | NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35 | Electronic Journal Article |
| Gidenstam2010 | Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Philippas | 2010 | | NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338 | Journal Article |
| Giesen2007 | Giesen, Joachim
Schuberth, Eva
Simon, Klaus
Zolliker, Peter
Zweifel, Oliver | 2007 | | Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410 | Journal Article |
| Giesen2007b | Giesen, Joachim | 2008 | | Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | Journal Article |
| Giesen2007c | Giesen, Joachim | 2008 | | Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | Journal Article |
| Giesen2007col | Giesen, Joachim
Mitsche, Dieter
Schuberth, Eva | 2007 | | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Proceedings Article |
| Giesen2007conj | Giesen, Joachim | 2007 | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book |
| Giesen2007e | Giesen, Joachim | 2007 | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124 | Proceedings Article |
| Giesen2008z | Giesen, Joachim | 2008 | | The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190 | Journal Article |
| GKMMP06 | Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | 2007 | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | Journal Article |
| GKS | Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander | 2005 | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | Journal Article |
| GKS-DISC2003 | Georgiou, Chryssis
Kowalski, Dariusz
Shvartsman, Alexander | 2003 | | Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238 | Proceedings Article |
| GKWahlstroemW2012 | Giannopoulos, Panos
Knauer, Christian
Wahlström, Magnus
Werner, Daniel | 2012 | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | Journal Article |
| GnewuchWW12 | Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola | 2012 | | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | Journal Article |
| GnewuchWW13 | Doerr, Carola
Gnewuch, Michael
Wahlström, Magnus | 2013 | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book |
| GoemansSkutella2004 | Goemans, Michel X.
Skutella, Martin | 2004 | | Cooperative facility location games
In: Journal of Algorithms [50], 194-214 | Journal Article |
| GoeseleEtal2003 | Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter | 2002 | | 7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping | Proceedings |
| GoldbergMacKenziePhilipPatersonSrinivasan2000 | Goldberg, Leslie Ann
MacKenzie, Philip D.
Paterson, Mike
Srinivasan, Aravind | 2000 | | Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096 | Journal Article |
| GolinRamanSchwarzSmidSIAMJCOMPUT1998 | Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel | 1998 | | Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072 | Journal Article |
| GolumbicMR06 | Golumbic, Martin Charles
Mintz, Aviad
Rotics, Udi | 2006 | | Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477 | Journal Article |
| Goodrich-Ramos97 | Goodrich, Michael T.
Ramos, Edgar A. | 1997 | | Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420 | Journal Article |
| Govindarajan2007 | Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S. | 2008 | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | Journal Article |
| GPFOGA11 | Durrett, Greg
Neumann, Frank
O'Reilly, Una-May | 2011 | | 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 | Proceedings Article |
| Graphlets | Shervashidze, Nino
Vishwanathan, S .V. N.
Petri, Tobias H.
Mehlhorn, Kurt
Borgwardt, Karsten M. | 2009 | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Electronic Proceedings Article |
| Grove-et-al-1-95a | Awerbuch, Baruch
Azar, Yossi
Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott | 1995 | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | Proceedings Article |
| Grove-et-al-1-95b | Chian, Yi-Feng
Goodrich, Michael T.
Grove, Edward
Tamassia, Roberto
Vengroff, Darren Erik
Vitter, Jeffrey Scott | 1995 | | External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149 | Proceedings Article |
| Grove-et-al-2-95 | Barve, Rakesh D.
Grove, Edward
Vitter, Jeffrey Scott | 1995 | | An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213 | Proceedings Article |
| Grove-et-al95 | Grove, Edward
Kao, Ming-Yang
Krishnan, P.
Vitter, Jeffrey Scott | 1995 | | Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205 | Proceedings Article |
| Grove95 | Grove, Edward | 1995 | | On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436 | Proceedings Article |
| GSV | Garg, Naveen | 1996 | | A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309 | Proceedings Article |
| GuentherKM2010 | Günther, Elisabeth
König, Felix
Megow, Nicole | 2010 | | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | Proceedings Article |
| Guillaume97 | Guillaume, Frank | 1997 | | Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes | Thesis - Masters thesis |
| Gunopulos-et-al97 | Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev | 1997 | | Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229 | Proceedings Article |
| Gupta-et-al95 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar | 1995 | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171 | Proceedings Article |
| Gupta-Janardan-Smid-1-95 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | 1995 | | Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317 | Journal Article |
| Gupta-Janardan-Smid-2-95 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | 1995 | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171 | Proceedings Article |
| GuptaJanardanSmid96a-1 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | 1996 | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340 | Journal Article |
| GuptaJanardanSmid96a-2 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | 1996 | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19 | Journal Article |
| GuptaJanardanSmid96b | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | 1996 | | Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391 | Journal Article |
| GuptaJanardanSmid99 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel | 1999 | | Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13 | Journal Article |
| GuptaJanardanSmidDasgupta1997 | Gupta, Prosenjit
Janardan, Ravi
Smid, Michiel
Dasgupta, Bhaskar | 1997 | | The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456 | Journal Article |
| GuptaKallerMahajanShermer96 | Gupta, Arvind
Kaller, Damon
Mahajan, Sanjeev
Shermer, Thomas C. | 1996 | | Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172 | Proceedings Article |
| GuptaMahajan1997 | Gupta, Arvind
Mahajan, Sanjeev | 1997 | | Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63 | Journal Article |
| Gurvich77 | Gurvich, Vladimir | 1977 | | On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184 | Journal Article |
| Gurvich91 | Gurvich, Vladimir | 1991 | | Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726 | Journal Article |
| Gutwenger1999 | Gutwenger, Carsten | 1999 | | Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes | Thesis - Masters thesis |
| GutwengerMutzel1998 | Gutwenger, Carsten
Mutzel, Petra | 1998 | | Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182 | Proceedings Article |
| h-cap-01 | Hert, Susan | 2001 | | Connected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38 | Proceedings Article |
| Hachenberger1999 | Hachenberger, Peter | 1999 | | Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes | Thesis - Masters thesis |
| HachenbergerKettner2005Nef | Hachenberger, Peter
Kettner, Lutz | 2005 | | Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174 | Proceedings Article |
| Hagedoorn2000:nvpapm | Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco | 2000 | | A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370 | Proceedings Article |
| Hagedoorn2003:nncbfe | Hagedoorn, Michiel | 2003 | | Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454 | Proceedings Article |
| Hagerup-1-95 | Hagerup, Torben | 1995 | | A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128 | Journal Article |
| Hagerup-2-95 | Hagerup, Torben | 1995 | | Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649 | Journal Article |
| Hagerup-3-95 | Hagerup, Torben | 1995 | | The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64 | Journal Article |
| Hagerup-97b | Hagerup, Torben | 1997 | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197 | Journal Article |
| Hagerup-et-al-1-95 | Andersson, Arne
Hagerup, Torben
Nilsson, Stefan
Raman, Rajeev | 1995 | | Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436 | Proceedings Article |
| Hagerup-et-al-1-96 | Hagerup, Torben | 1996 | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33 | Proceedings Article |
| Hagerup-et-al-2-95 | Hagerup, Torben
Katajainen, Jyrki
Nishimura, Naomi
Ragde, Prabhakar | 1995 | | 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 | Proceedings Article |
| Hagerup-et-al95 | Berthomé, P.
Duboux, T.
Hagerup, Torben
Newman, I.
Schuster, Assaf | 1995 | | Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380 | Proceedings Article |
| Hagerup-et-al97 | Dietzfelbinger, Martin
Hagerup, Torben
Katajainen, Jyrki
Penttonen, Martti | 1997 | | A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51 | Journal Article |
| Hagerup-Keller95 | Hagerup, Torben
Keller, Jörg | 1995 | | Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148 | Journal Article |
| Hagerup-Kutylowski97 | Hagerup, Torben
Kutylowski, Miroslaw | 1997 | | Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66 | Journal Article |
| Hagerup00 | Hagerup, Torben | 2000 | | Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28 | Journal Article |
| Hagerup2000a | Hagerup, Torben | 2000 | | Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315 | Journal Article |
| Hagerup97a | Hagerup, Torben | 1997 | | Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302 | Proceedings Article |
| Hagerup98 | Hagerup, Torben | 1998 | | Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398 | Proceedings Article |
| HagerupICAL98 | Hagerup, Torben | 1998 | | Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90 | Proceedings Article |
| HagSanTra98 | Hagerup, Torben
Sanders, Peter
Träff, Jesper Larsson | 1998 | | An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154 | Proceedings Article |
| HaJaPS11 | Harren, Rolf
Jansen, Klaus
Prädel, Lars
van Stee, Rob | 2011 | | A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | Proceedings Article |
| HallHipplerSkutella2003 | Hall, Alex
Hippler, Steffen
Skutella, Martin | 2003 | | Multicommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409 | Proceedings Article |
| HallLangkauSkutella2003 | Hall, Alex
Langkau, Katharina
Skutella, Martin | 2003 | | 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 | Proceedings Article |
| Hammerschmidt1999 | Hammerschmidt, Frank | 1999 | | Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes | Thesis - Masters thesis |
| Happ2008 | Doerr, Benjamin
Happ, Edda
Klein, Christian | 2008 | | Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Proceedings Article |
| HappJohannsenKleinNeumann2008a | Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank | 2008 | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article |
| HappPhD2009 | Happ, Edda | 2009 | | Analyses of Evolutionary Algorithms
Universität des Saarlandes | Thesis - PhD thesis |
| Hariharan-et-al95 | Cole, Richard
Hariharan, Ramesh
Paterson, Mike
Zwick, Uri | 1995 | | Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45 | Journal Article |
| Hariharan-Kapoor95 | Hariharan, Ramesh
Kapoor, Sanjiv | 1995 | | Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265 | Journal Article |
| Hariharan-Kelsen-Mahajan96 | Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev | 1996 | | Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52 | Proceedings Article |
| Hariharan-Mahajan95 | Hariharan, Ramesh
Mahajan, Sanjeev | 1995 | | Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16 | Proceedings Article |
| Hariharan-Muthukrishnan95 | Hariharan, Ramesh
Muthukrishnan, S. | 1995 | | String Matching over a General Matching Relation
In: Information and Computation [122], 140-148 | Journal Article |
| HarKer11 | Harren, Rolf
Kern, Walter | 2012 | | Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | Proceedings Article |
| HarksHKS2013 | Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander | 2013 | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | Journal Article |
| Harren2006a | Harren, Rolf | 2006 | | Approximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249 | Proceedings Article |
| Harren2006b | Harren, Rolf | 2006 | | Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund | Thesis - other |
| Harren2007 | Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning | 2007 | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | Proceedings Article |
| Harren2007b | Harren, Rolf | 2007 | | Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme | Book |
| Harren2009a | Harren, Rolf | 2009 | | Approximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532 | Journal Article |
| HarrenPhD2010 | Harren, Rolf | 2010 | | Two-dimensional packing problems
Universität des Saarlandes | Thesis - PhD thesis |
| HarrenvanStee2008 | Harren, Rolf
van Stee, Rob | 2008 | | Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | Proceedings Article |
| HarrenvanStee2009b | Harren, Rolf
van Stee, Rob | 2009 | | Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189 | Proceedings Article |
| HarSte12 | Harren, Rolf
van Stee, Rob | 2012 | | Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75 | Journal Article |
| Hazboun1999 | Hazboun, Jack | 1999 | | Molekül-Docking-Reaktionen
Universität des Saarlandes | Thesis - Masters thesis |
| Hebbinghaus2005 | Doerr, Benjamin
Hebbinghaus, Nils | 2005 | | Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328 | Proceedings Article |
| Hebbinghaus2006 | Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank | 2006 | | Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987 | Proceedings Article |
| Hebbinghaus2006a | Bundy, David
Hebbinghaus, Nils
Stellmacher, Bernd | 2006 | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | Journal Article |
| Hebbinghaus2007 | Hebbinghaus, Nils | 2007 | | Discrepancy of Sums of two Arithmetic Progressions | Report |
| HeidrichBachelor2012 | Heydrich, Sandy | 2012 | | Dividing connected chores fairly
Universität des Saarlandes | Thesis - Bachelor thesis |
| HeinyKasprzikKoetzing2012 | Heinz, Jeffrey
Kasprzik, Anna
Kötzing, Timo | 2012 | | Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127 | Journal Article |
| HelNeuWan2009 | Helwig, Sabine
Neumann, Frank
Wanka, Rolf | 2009 | | Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | Proceedings Article |
| Hemmer2002 | Hemmer, Michael | 2002 | | Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes | Thesis - Masters thesis |
| Hemmer2007 | Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar | 2007 | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644 | Proceedings Article |
| Hemmer2008 | Hemmer, Michael | 2008 | | Exact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz | Thesis - PhD thesis |
| Hemmer2011 | Hemmer, Michael
Dupon, Laurent
Petitjean, Sylvain
Schomer, Elmar | 2011 | | 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 | Journal Article |
| Hermelin2010 | Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror | 2010 | | Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | Proceedings Article |
| Hermelin2010b | Butman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror | 2010 | | Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18 | Journal Article |
| Hermelin2012 | Hermelin, Danny
Rizzi, Romeo
Vialette, Stephane | 2012 | | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474 | Proceedings Article |
| HermelinCulex2010 | Nor, Igor
Hermelin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier Sagot, Marie-France | 2010 | | Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 | Proceedings Article |
| HermelinHuangKratschWahlstrom2011 | Hermelin, Danny
Huang, Chien-Chung
Kratsch, Stefan
Wahlström, Magnus | 2011 | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | Proceedings Article |
| HermelinLCS2010 | Gotthilf, Zvi
Hermelin, Danny
Landau, Gad M.
Lewenstein, Moshe | 2010 | | Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | Proceedings Article |
| HermelinLevyWeimanYuster2011 | Hermelin, Danny
Levy, Avivit
Weimann, Oren
Yuster, Raphael | 2011 | | Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | Proceedings Article |
| HermelinMestreRawitz2012 | Hermelin, Danny
Mestre, Julian
Rawitz, Dror | 2012 | | Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | Proceedings Article |
| HermelinMnichvanLeeuwen2012 | Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan | 2012 | | Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635 | Proceedings Article |
| HermelinMnichVanLeeuwenWoeginger2011 | Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan
Woeginger, Gerhard J. | 2011 | | Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | Proceedings Article |
| HermelinRawitz2011 | Hermelin, Danny
Rawitz, Dror | 2011 | | Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594 | Journal Article |
| HermelinWu2012 | Hermelin, Danny
Wu, Xi | 2012 | | Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113 | Proceedings Article |
| Hert1999 | Hert, Susan
Lumelsky, Vladimir | 1999 | | Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639 | Journal Article |
| Hertel84/02 | Hertel, Stefan
Mehlhorn, Kurt
Mäntylä, Martti
Nievergelt, Jurg | 1984 | | Space sweep solves intersection of two convex polyhedra elegantly | Report |
| Heydrich2015 | Heydrich, Sandy
van Stee, Rob | 2015 | | Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61 | Journal Article |
| HeySte13 | Heydrich, Sandy
van Stee, Rob | 2013 | | Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433 | Proceedings Article |
| HF2009 | Fountoulakis, Nikolaos
Huber, Anna | 2009 | | Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991 | Journal Article |
| hh-mgcd-2009 | Hemmer, Michael
Hülse, Dominik | 2009 | | Generic implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324 | Proceedings Article |
| hhkps-aegk-01 | Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael | 2001 | | An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90 | Proceedings Article |
| Hilpert96 | Hilpert, Peter | 1996 | | Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes | Thesis - Masters thesis |
| HKMN08 | Huang, Chien-Chung
Kavitha, Telikepalli
Michail, Dimitrios
Nasre, Meghana | 2008 | | Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 | Proceedings Article |
| hls-qarr-2009 | Hemmer, Michael
Limbach, Sebastian
Schömer, Elmar | 2009 | | Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | Proceedings Article |
| HMPT97 | Hundack, Christoph
Mutzel, Petra
Pouchkarev, Igor
Thome, Stefan | 1997 | | ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302 | Proceedings Article |
| HMT04:round-robin | Henz, Martin
Müller, Tobias
Thiel, Sven | 2004 | | Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101 | Journal Article |
| Hoefer-IJGT-2013 | Hoefer, Martin | 2013 | | Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53 | Journal Article |
| Hoefer03 | Hoefer, Martin | 2003 | | Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178 | Proceedings Article |
| Hoefer2013 | Hoefer, Martin | 2013 | | Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35 | Journal Article |
| HoeferK2013 | Hoefer, Martin
Kesselheim, Thomas | 2013 | | Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | Proceedings Article |
| HoeferKV2013 | Hoefer, Martin
Kesselheim, Thomas
Vöcking, Berthold | 2013 | | Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582 | Proceedings Article |
| HoeferS-TEAC-2013 | Hoefer, Martin
Skopalik, Alexander | 2013 | | Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21 | Journal Article |
| HoeferS-TOCS-2013 | Hoefer, Martin
Skopalik, Alexander | 2013 | | On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453 | Journal Article |
| HoeferS2013 | Hoefer, Martin
Sauerwald, Thomas | 2013 | | Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56 | Proceedings Article |
| HoeferW-WINE-2013 | Hoefer, Martin
Wagner, Lisa | 2013 | | Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262 | Proceedings Article |
| HoeferW2013 | Hoefer, Martin
Wagner, Lisa | 2013 | | Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631 | Proceedings Article |
| Hoepman-Papatr-Tsigas95 | Hoepman, Jaap-Henk
Papatriantafilou, Marina
Tsigas, Philippas | 1995 | | Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287 | Proceedings Article |
| HoogeveenSkutellaWoeginger2003 | Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J. | 2003 | | Preemptive scheduling with rejection
In: Mathematical Programming [94], 361-374 | Journal Article |
| HorNeuFOGA2009 | Horoba, Chrisitian
Neumann, Frank | 2009 | | 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 | Proceedings Article |
| HorNeuGECCO2008 | Horoba, Christian
Neumann, Frank | 2008 | | Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680 | Proceedings Article |
| hr-mrmpipppg-01 | Hert, Susan
Richards, Brad | 2002 | | Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205 | Proceedings Article |
| HTM06a | Hariharan, Ramesh
Telikepalli, Kavitha
Mehlhorn, Kurt | 2006 | | 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 | Proceedings Article |
| HTZ-AKCROSS-2009 | Hemmer, Michael
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
Emiris, Ioannis Z.
Karavelas, Menelaos I.
Mourrain, Bernard | 2009 | | Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | Proceedings Article |
| Huang2008 | Bhaskar, Umang
Fleischer, Lisa
Hoy, Darrell
Huang, Chien-Chung | 2009 | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | Proceedings Article |
| Huang2010 | Huang, Chien-Chung | 2010 | | Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253 | Proceedings Article |
| Huang2010a | Huang, Chien-Chung | 2010 | | Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150 | Journal Article |
| Huang2011 | Huang, Chien-Chung
Kavitha, Telikepalli
Michael, Dimitrios
Nasr, Meghana | 2011 | | Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | Journal Article |
| Huang2011a | Huang, Chien-Chung
Kavitha, Telikepalli | 2011 | | Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP), | Proceedings Article |
| Huang2011b | Huang, Chien-Chung
Kavitha, Telikepalli | 2011 | | Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA), | Proceedings Article |
| Huang2012a | Huang, Chien-Chung | 2012 | | Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | Proceedings Article |
| HuberPhD2010 | Huber, Anna | 2010 | | Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes | Thesis - PhD thesis |
| Humble97 | Humble, Monika | 1997 | | Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis |
| HundackPrömelSteger97 | Hundack, Christoph
Prömel, Hans Jürgen
Steger, Angelika | 1997 | | Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433 | Part of a Book |
| HutSanVit2001 | Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott | 2001 | | Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73 | Proceedings Article |
| HutSanVit2001a | Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott | 2001 | | The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335 | Proceedings Article |
| HybridVC07 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | 2007 | | On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621 | Proceedings Article |
| ICALP::MehlhornP1989 | Mehlhorn, Kurt
Paul, Wolfgang J. | 1989 | | Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609 | Proceedings Article |
| ICALP::MehlhornY1988 | Mehlhorn, Kurt
Yap, Chee-Keng | 1988 | | Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423 | Proceedings Article |
| IC::HoffmanMRT1986 | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | 1986 | | Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184 | Journal Article |
| IC::MehlhornP1987 | Mehlhorn, Kurt
Preparata, Franco P. | 1987 | | Area-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282 | Journal Article |
| ImmichDipl01 | Immich, Stefan | 2001 | | Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes | Thesis - Masters thesis |
| ImpBoun2006 | Doerr, Benjamin
Hebbinghaus, Nils
Werth, Sören | 2006 | | Improved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132 | Journal Article |
| Imreh2001 | Epstein, Leah
Imreh, Csanád
van Stee, Rob | 2002 | | More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268 | Proceedings Article |
| IngalalliMaster2011 | Ingalalli, Vijay | 2011 | | Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes | Thesis - Masters thesis |
| INRIA-00340887:1 | Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis | 2008 | | Experimental evaluation and cross-benchmarking of univariate real solvers | Report |
| inserpoints2006 | Teramoto, Sachio
Asano, Tetsuo
Katoh, Naoki
Doerr, Benjamin | 2006 | | Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356 | Journal Article |
| IntLiar2006 | Doerr, Benjamin
Lengler, Johannes
Steurer, Daniel | 2006 | | The Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327 | Proceedings Article |
| IPL::FriesMNT1987 | Fries, O.
Mehlhorn, Kurt
Näher, Stefan
Tsakalidis, A. | 1987 | | A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273 | Journal Article |
| IPL::JungM1988 | Jung, Hermann
Mehlhorn, Kurt | 1988 | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236 | Journal Article |
| IPL::Mehlhorn1988 | Mehlhorn, Kurt | 1988 | | A faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128 | Journal Article |
| Issac2015Sampling | Issac, Davis | 2015 | | Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015, | Proceedings Article |
| ITMMP2006 | Irving, Robert W.
Telikepalli, Kavitha
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna | 2006 | | Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610 | Journal Article |
| JACM::MehlhornP1986 | Mehlhorn, Kurt
Preparata, F. P. | 1986 | | Routing through a Rectangle
In: Journal of the ACM [33], 60-85 | Journal Article |
| JainKoetzingStephan2011 | Jain, Sanjay
Kötzing, Timo
Stephan, Frank | 2012 | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article |
| JALGO::KaufmannM1986 | Kaufmann, Michael
Mehlhorn, Kurt | 1986 | | Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531 | Journal Article |
| Janardan-Smid95 | Janardan, Ravi
Smid, Michiel | 1995 | | On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198 | Proceedings Article |
| Jansen-Latin-98 | Jansen, Klaus | 1998 | | 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 | Proceedings Article |
| Jansen-STACS-98 | Jansen, Klaus | 1998 | | The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297 | Proceedings Article |
| JansenKMS2010 | Jansen, Klaus
Kratsch, Stefan
Marx, Dániel
Schlotter, Ildikó | 2010 | | Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272 | Proceedings Article |
| JansenNeumann2010 | Jansen, Thomas
Neumann, Frank | 2010 | | Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334 | Journal Article |
| JansenPorkolab2002 | Jansen, Klaus
Porkolab, Lorant | 2002 | | Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520 | Journal Article |
| JansenSolisObaSviridenko2000 | Jansen, Klaus
Solis-Oba, Roberto
Sviridenko, Maxim | 2000 | | Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346 | Part of a Book |
| Jez2008ICALP | Jez, Artur
Okhotin, Alexander | 2014 | | Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94 | Journal Article |
| Jez2012STACS | Jez, Artur | 2014 | | The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718 | Journal Article |
| Jez2013CPM | Jez, Artur | 2013 | | Approximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176 | Proceedings Article |
| Jez2013DLT | Jez, Artur
Okhotin, Alexander | 2013 | | Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 | Proceedings Article |
| Jez2013DLTII | Jez, Artur | 2013 | | Recompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26 | Proceedings Article |
| Jez2013ICALP | Jez, Artur | 2013 | | One-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335 | Proceedings Article |
| Jez2013STACS | Jez, Artur | 2013 | | Recompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244 | Proceedings Article |
| Jez2014CPM | Jez, Artur | 2014 | | A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 | Proceedings Article |
| Jez2014CSR | Diekert, Volker
Jez, Artur
Plandowski, Wojciech | 2014 | | Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15 | Proceedings Article |
| Jez2014ICALP | Jez, Artur | 2014 | | Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article |
| Jez2014STACS | Jez, Artur
Lohrey, Markus | 2014 | | Approximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 | Proceedings Article |
| JezMaletti2013 | Jez, Artur
Maletti, Andreas | 2013 | | Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830 | Journal Article |
| JLM1998 | Jünger, Michael
Leipert, Sebastian
Mutzel, Petra | 1998 | | Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237 | Proceedings Article |
| JLM98 | Jünger, Michael
Leipert, Sebastian
Mutzel, Petra | 1998 | | 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 | Journal Article |
| JMO97 | Jünger, Michael
Lee, E. K.
Mutzel, Petra
Odenthal, Thomas | 1997 | | A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24 | Proceedings Article |
| JOCO:EMR10 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | 2011 | | On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304 | Journal Article |
| joe97 | Könemann, Jochen | 1997 | | Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes | Thesis - Masters thesis |
| Johannsen2006a | Johannsen, Daniel | 2006 | | Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin | Thesis - Masters thesis |
| JohannsenLK2010 | Johannsen, Daniel
Lengler, Johannes | 2010 | | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Proceedings Article |
| JohannsenPanagiotou2010 | Johannsen, Daniel
Panagiotou, Konstantinos | 2010 | | Vertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 | Proceedings Article |
| JohannsenPhD2010 | Johannsen, Daniel | 2010 | | Random combinatorial structures and randomized search heuristics
Universität des Saarlandes | Thesis - PhD thesis |
| JohannsenRazgonWahlstroem2008 | Johannsen, Daniel
Razgon, Igor
Wahlström, Magnus | 2009 | | Solving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85 | Proceedings Article |
| jounal/ploscb/ZotenkoMOP2008 | Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa | 2008 | | Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x | Journal Article |
| journals/dcg/AltMWW88 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | 1988 | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | Journal Article |
| journals/tc/FurerM89 | Fürer, Martin
Mehlhorn, Kurt | 1989 | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | Journal Article |
| journal/algo/GandhiM2007 | Gandhi, Rajiv
Mestre, Julián | 2009 | | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | Journal Article |
| Juenger-Mutzel-1-97 | Jünger, Michael
Mutzel, Petra | 1997 | | 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25 | Journal Article |
| Juenger-Mutzel-2-96 | Jünger, Michael
Mutzel, Petra | 1996 | | Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), - | Proceedings Article |
| Juenger-Mutzel95 | Jünger, Michael
Mutzel, Petra | 1995 | | The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130 | Proceedings Article |
| Juenger-Mutzel96 | Jünger, Michael
Mutzel, Petra | 1996 | | Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59 | Journal Article |
| Jung96 | Jung, Karin | 1996 | | Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes | Thesis - Masters thesis |
| JungLenhofMuellerRueb2000 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 2000 | | Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522 | Journal Article |
| JungLenhofMüllerRüb1999 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 1999 | | Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22 | Proceedings Article |
| jurkiewicz2009 | Jurkiewicz, Tomasz | 2009 | | Cycle Bases in Graphs
Universität des Saarlandes | Thesis - Masters thesis |
| Jurkiewicz2013 | Jurkiewicz, Tomasz | 2013 | | Toward Better Computation Models for Modern Machines
Universität des Saarlandes | Thesis - PhD thesis |
| JurkiewiczDanilewski2011 | Jurkiewicz, Tomasz
Danilewski, Piotr | 2011 | | Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Unpublished/Draft |
| Juurlink-Mutzel95 | Juurlink, Ben
Mutzel, Petra | 1995 | | ?
In: Conference on High-Performance Computing, 125-130 | Proceedings Article |
| Juurlink-Sibeyn95 | Juurlink, Ben
Sibeyn, Jop F. | 1995 | | Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760 | Proceedings Article |
| Kaligosi2006a | Kaligosi, Kanela
Sanders, Peter | 2006 | | How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791 | Proceedings Article |
| Kaligosi2006b | Brodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin | 2006 | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article |
| Kaligosi/Master03 | Kaligosi, Kanela | 2003 | | Length bounded network flows
Universität des Saarlandes | Thesis - Masters thesis |
| KamranDipl05 | Kamran Azam, Muhammad | 2005 | | Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes | Thesis - Masters thesis |
| Kapoor96 | Kapoor, Sanjiv | 1996 | | On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146 | Proceedings Article |
| KapoorSmid96 | Kapoor, Sanjiv
Smid, Michiel | 1996 | | New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796 | Journal Article |
| Kappel98 | Kappel, Holger | 1998 | | Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes | Thesis - Masters thesis |
| Karkkainen2002 | Kärkkäinen, Juha | 2002 | | Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357 | Proceedings Article |
| Karkkainen2003a | Kärkkäinen, Juha
Rao, S. Srinivasa | 2003 | | Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170 | Part of a Book |
| KarkkainenSanders2003 | Kärkkäinen, Juha
Sanders, Peter | 2003 | | Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955 | Proceedings Article |
| Karrenbauer2004 | Karrenbauer, Andreas | 2004 | | Packing Boxes with Arbitrary Rotations
Universität des Saarlandes | Thesis - other |
| KarrenbauerPhD | Karrenbauer, Andreas | 2007 | | Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes | Thesis - PhD thesis |
| Kasan95 | Kasan, Binaman | 1995 | | Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes | Thesis - Masters thesis |
| Katajainen-Traeff97 | Katajainen, Jyrki
Träff, Jesper Larsson | 1997 | | A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Proceedings Article |
| KatMey03 | Katriel, Irit
Meyer, Ulrich | 2003 | | Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84 | Part of a Book |
| Katriel2004 | Katriel, Irit | 2004 | | On Algorithms for Online Topological Ordering and Sorting | Report |
| Katriel2004a | Katriel, Irit | 2004 | | 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 | Proceedings Article |
| Katriel2004b | Katriel, Irit | 2004 | | On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178 | Journal Article |
| KatrielSWC2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | 2005 | | GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11 | Proceedings Article |
| KatrielThesis2004 | Katriel, Irit | 2004 | | Constraints and Changes
Universität des Saarlandes | Thesis - PhD thesis |
| KatrielThielGCC | Katriel, Irit
Thiel, Sven | 2005 | | Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | Journal Article |
| KatSanTra03 | Katriel, Irit
Sanders, Peter
Träff, Jesper Larsson | 2003 | | A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690 | Proceedings Article |
| Kaufmann-Meyer-Sibeyn94 | Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F. | 1994 | | Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663 | Proceedings Article |
| Kaufmann-Meyer-Sibeyn97a | Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F. | 1997 | | Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140 | Journal Article |
| Kaufmann-Meyer-Sibeyn97b | Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F. | 1997 | | Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319 | Proceedings Article |
| Kaufmann-Raman-Sibeyn97 | Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F. | 1997 | | Routing on Meshes with Buses
In: Algorithmica [18], 417-444 | Journal Article |
| Kaufmann-Schroeder-Sibeyn95 | Kaufmann, Michael
Schröder, Heiko
Sibeyn, Jop F. | 1995 | | Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95 | Journal Article |
| Kaufmann-Sibeyn-1-95 | Kaufmann, Michael
Sibeyn, Jop F. | 1995 | | Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422 | Proceedings Article |
| Kaufmann-Sibeyn-Suel95 | Kaufmann, Michael
Sibeyn, Jop F.
Suel, Torsten | 1995 | | Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88 | Proceedings Article |
| Kaufmann84/12 | Kaufmann, Michael
Mehlhorn, Kurt | 1984 | | Local routing of two-terminal nets is easy | Report |
| Kav08 | Kavitha, Telikepalli | 2008 | | On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354 | Proceedings Article |
| Kavitha2007TCS | Kavitha, Telikepalli
Mehlhorn, Kurt | 2007 | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Journal Article |
| Kavitha2012 | Kavitha, Telikepalli
Mestre, Julián | 2012 | | Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14 | Journal Article |
| KavithaALG2011 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios | 2011 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | Journal Article |
| KavithaMestre2008 | Kavitha, Telikepalli
Mestre, Julian | 2009 | | Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | Proceedings Article |
| KavithaMestre2010 | Kavitha, Telikepalli
Mestre, Julian | 2010 | | Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14 | Electronic Journal Article |
| KavithaTCS2011 | Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana | 2011 | | Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690 | Journal Article |
| KavvadiasPantziouSpirakisZaroliagis96 | Kavvadias, Dimitris J.
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos | 1996 | | Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154 | Journal Article |
| Kelsen-et-al95 | Han, Xiaofeng
Kelsen, Pierre
Ramachandran, Vijaya
Tarjan, Robert E. | 1995 | | Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358 | Journal Article |
| Kelsen96 | Kelsen, Pierre | 1996 | | Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233 | Proceedings Article |
| KelsenMahajanRamesh96 | Kelsen, Pierre
Mahajan, Sanjeev
Ramesh, Hariharan | 1996 | | Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52 | Proceedings Article |
| kerber-ijcm-2009 | Kerber, Michael | 2009 | | Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | Journal Article |
| Kerber2006 | Kerber, Michael | 2006 | | Analysis of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Masters thesis |
| KerberPhD2009 | Kerber, Michael | 2009 | | Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes | Thesis - PhD thesis |
| KerberSagraloff:RootApprox:2011 | Kerber, Michael
Sagraloff, Michael | 2011 | | Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | Proceedings Article |
| KerberSagraloff_JSC_2012 | Kerber, Michael
Sagraloff, Michael | 2012 | | A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258 | Journal Article |
| Kerber_CASC_2009 | Kerber, Michael | 2009 | | On the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article |
| Kerzmann2000 | Kerzmann, Andreas | 2000 | | Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes | Thesis - Masters thesis |
| Kesselmann2004a | Kesselman, Alexander
Kogan, Kirill | 2005 | | Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844 | Proceedings Article |
| Kesselmann2004b | Kesselman, Alexander
Guez, Dan
Rosen, Adi | 2004 | | Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102 | Proceedings Article |
| Kesselmann2004c | Kesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim | 2004 | | Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583 | Journal Article |
| Kesselmann2004d | Kesselman, Alexander
Mansour, Yishay | 2004 | | Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182 | Journal Article |
| Kesselmann2005wons | Kesselman, Alexander
Kowalski, Dariusz | 2005 | | Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124 | Proceedings Article |
| Kessler-Traeff97 | Keßler, Christoph W.
Träff, Jesper Larsson | 1997 | | Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221 | Proceedings Article |
| KesslerDipl02 | Kessler, Harald | 2002 | | Robust Computation of Visibility Maps
Universität des Saarlandes | Thesis - Masters thesis |
| Kettner2003DegreeBound | Kettner, Lutz
Kirkpatrick, David
Mantler, Andrea
Snoeyink, Jack
Speckmann, Bettina
Takeuchi, Fumihiko | 2003 | | Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12 | Journal Article |
| Kettner2003Safari | Kettner, Lutz
Rossignac, Jarek
Snoeyink, Jack | 2003 | | The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116 | Journal Article |
| Kettner2004Classroom | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | Proceedings Article |
| Kettner2004Handbook | Kettner, Lutz
Näher, Stefan | 2004 | | Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463 | Part of a Book |
| Kettner2005Handle | Kettner, Lutz | 2005 | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10 | Electronic Proceedings Article |
| Kettner2005PseudoTriangEnum | Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack | 2005 | | 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 | Proceedings Article |
| Kettner2005SocgVideoProceedings | Mitchell, Rote, Kettner (ed.) | 2005 | | 21st Annual Symposium on Computational Geometry (SCG'05) | Proceedings |
| Kettner2005Stxxl | Dementiev, Roman
Kettner, Lutz
Sanders, Peter | 2005 | | STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651 | Proceedings Article |
| Kettner2005StxxlReport | Dementiev, Roman
Kettner, Lutz
Sanders, Peter | 2005 | | STXXL: Standard Template Library for XXL Data Sets | Report |
| Kettner2006Handle | Kettner, Lutz | 2006 | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43 | Proceedings Article |
| Kettner2006PseudoTEnum | Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack | 2006 | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | Journal Article |
| Kettner2007CGALKernel | Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael | 2007 | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | Journal Article |
| Kettner2007Classroom | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | 2008 | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article |
| Kettner2007ECGBook | Mourrain, Bernard
Pion, Sylvain
Schmitt, Susanne
Técourt, Jean-Pierre
Tsigaridas, Elias
Wolpert, Nicola | 2007 | | Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155 | Part of a Book |
| Kettner2007ECGBookz | Fogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola | 2007 | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book |
| Kettner2007Nef3 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | 2007 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Journal Article |
| Kettner98 | Kettner, Björn | 1998 | | Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes | Thesis - Masters thesis |
| KhachiyanPorkolab2000 | Khachiyan, Leonid
Porkolab, Lorant | 2000 | | Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224 | Journal Article |
| Khosla2013 | Khosla, Megha | 2013 | | Balls into Bins Made Faster
In: Algorithms - ESA 2013, | Proceedings Article |
| KimPaulPhilip2012 | Kim, Eun Jung
Paul, Christophe
Philip, Geevarghese | 2012 | | A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 | Proceedings Article |
| KKM01 | Klau, Gunnar W.
Klein, Karsten
Mutzel, Petra | 2001 | | An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51 | Proceedings Article |
| KKS | Kesselman, Alexander
Kowalski, Dariusz
Segal, Michael | 2005 | | 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 | Journal Article |
| KKS-DSN | Konwar, Kishori
Kowalski, Dariusz
Shvartsman, Alexander | 2004 | | The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324 | Proceedings Article |
| Klaer94 | Klär, Gerhard | 1994 | | Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes | Thesis - Masters thesis |
| Klau1997b | Klau, Gunnar W. | 1998 | | Visuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales Zeichnen | Miscellaneous |
| Klau97a | Klau, Gunnar W. | 1997 | | Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes | Thesis - Masters thesis |
| KlauDiss01 | Klau, Gunnar W. | 2002 | | A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes | Thesis - PhD thesis |
| Klauk/Diplom04 | Klauk, Mathias | 2004 | | Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes | Thesis - Masters thesis |
| KlauMutzel1999 | Klau, Gunnar W.
Mutzel, Petra | 1999 | | Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37 | Proceedings Article |
| KlauMutzel1999a | Klau, Gunnar W.
Mutzel, Petra | 1999 | | Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319 | Proceedings Article |
| Klein03/89 | Klein, R.
Mehlhorn, Kurt
Meiser, Stefan | 1989 | | On the construction of abstract Voronoi diagrams, II. | Report |
| Klein2000 | Klein, Karsten | 2000 | | Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes | Thesis - Masters thesis |
| Klein2004 | Klein, Christian | 2004 | | Controlled Perturbation for Voronoi Diagrams
Universität des Saarlandes | Thesis - Masters thesis |
| Klein2004b | Klein, Christian | 2004 | | A Fast Root Checking Algorithm | Report |
| KleMehMei90 | Klein, R.
Mehlhorn, Kurt
Meiser, Stefan | 1990 | | On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 | Proceedings Article |
| KlKu2006a | Klein, Rolf
Kutz, Martin | 2007 | | Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | Proceedings Article |
| KlKu2006b | Klein, Rolf
Kutz, Martin | 2006 | | The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272 | Proceedings Article |
| KLM+2000 | Kececioglu, John
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
Vingron, Martin | 2000 | | A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | Journal Article |
| KM00a | Klau, Gunnar W.
Mutzel, Petra | 2000 | | Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350 | Proceedings Article |
| KM03a | Klau, Gunnar W.
Mutzel, Petra | 2003 | | Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608 | Part of a Book |
| KM03b | Mehlhorn, Kurt | 2003 | | The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263 | Part of a Book |
| KM08 | Kavitha, Telikepalli
Nasre, Meghana | 2008 | | Optimal Popular Matchings | Miscellaneous |
| KM2005 | Kavitha, Telikepalli
Mehlhorn, Kurt | 2005 | | 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 | Proceedings Article |
| KMM07 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios | 2007 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | Proceedings Article |
| KMMP2004c | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna | 2004 | | A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | Proceedings Article |
| KMS-ICDCS | Kowalski, Dariusz
Musial, Peter M.
Shvartsman, Alexander | 2005 | | Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58 | Proceedings Article |
| KMV2005 | Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal | 2005 | | Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183 | Journal Article |
| KMW2010 | Kratsch, Stefan
Marx, Dániel
Wahlström, Magnus | 2010 | | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500 | Proceedings Article |
| Knauer2012 | Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj | 2012 | | Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85 | Journal Article |
| KobelBachelor2008 | Kobel, Alexander | 2008 | | Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes | Thesis - Bachelor thesis |
| KobelMaster2011 | Kobel, Alexander | 2011 | | Certified numerical root finding
Universität des Saarlandes | Thesis - Masters thesis |
| Koe-Leh-Neu-Oli:c:10:AcoMinCut | Kötzing, Timo
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro S. | 2010 | | Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Proceedings Article |
| Koe-Neu-Roe-Wit:c:10:ACOTSP | Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten | 2010 | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article |
| Koe-Neu-Sud-Wag:c:Foga11AcoLinFun | Kötzing, Timo
Neumann, Frank
Sudholt, Dirk
Wagner, Markus | 2011 | | Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 | Proceedings Article |
| Koetzing2010LatticeLearning | Kasprzik, Anna
Kötzing, Timo | 2010 | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article |
| Koetzing2010NUMemLimited | Case, John
Kötzing, Timo | 2010 | | Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299 | Proceedings Article |
| Koetzing2010NUTechniques | Case, John
Kötzing, Timo | 2010 | | Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Proceedings Article |
| KoetzingALT2011 | Kötzing, Timo | 2011 | | Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article |
| KoetzingMolter2012 | Kötzing, Timo
Molter, Hendrik | 2012 | | ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | Proceedings Article |
| KoetzingNRW2012 | Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten | 2012 | | Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21 | Journal Article |
| KoetzingNS11GP | Kötzing, Timo
Neumann, Frank
Spöhel, Reto | 2011 | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article |
| KoetzingSNO2011 | Kötzing, Timo
Sutton, Andrew M.
Neumann, Frank
O'Reilly, Una-May | 2012 | | The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340 | Proceedings Article |
| KoetzingST2011 | Kötzing, Timo
Sudholt, Dirk
Theile, Madeleine | 2011 | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article |
| KohlbacherLenhof1999 | Kohlbacher, Oliver
Lenhof, Hans-Peter | 1999 | | Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92 | Proceedings Article |
| KohlbacherLenhof2000 | Kohlbacher, Oliver
Lenhof, Hans-Peter | 2000 | | BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824 | Journal Article |
| Koldehofe1999 | Koldehofe, Boris | 1999 | | Animation and Analysis of Distributed Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
| Koller-et-al:dominance-constraints | Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim | 2000 | | A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375 | Proceedings Article |
| Kollias2012 | Kollias, Konstantinos | 2013 | | Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440 | Electronic Journal Article |
| Kontogiannis2000 | Kontogiannis, Spyros
Pantziou, Grammati E.
Spirakis, Paul G.
Yung, Moti | 2000 | | Robust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464 | Journal Article |
| Kontogiannis2002 | Kontogiannis, Spyros | 2002 | | Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 124-133 | Proceedings Article |
| Kov07 | Kovács, Annamária | 2007 | | Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes | Thesis - PhD thesis |
| Kovacs2004 | Kovács, Annamária | 2004 | | Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80 | Proceedings Article |
| Kovacs2005a | Kovács, Annamária | 2005 | | Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852 | Proceedings Article |
| Kovacs2005b | Kovács, Annamária | 2005 | | Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627 | Proceedings Article |
| Kovacs2006 | Kovács, Annamária | 2006 | | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198 | Proceedings Article |
| Kowalik2005 | Kowalik, Lukasz | 2006 | | Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101 | Proceedings Article |
| Kowalik2006 | Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej | 2006 | | A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73 | Journal Article |
| Kowalik2009 | Kowalik, Lukasz | 2009 | | Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742 | Journal Article |
| KowalikAdjSparseGraphs | Kowalik, Lukasz | 2007 | | Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | Journal Article |
| KowalikEdgeColoring | Cole, Richard
Kowalik, Lukasz | 2008 | | New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368 | Journal Article |
| KowalikISAAC2006 | Kowalik, Lukasz | 2006 | | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566 | Proceedings Article |
| KowalikKotzig | Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste | 2007 | | A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | Journal Article |
| Kowalski-LATIN-2004 | Fraigniaud, Pierre
Gasieniec, Leszek
Kowalski, Dariusz
Pelc, Andrzej | 2004 | | Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151 | Proceedings Article |
| Kowalski-SODA-2004 | Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz | 2004 | | The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993 | Proceedings Article |
| Kowalski-SPAA-2004 | Kowalski, Dariusz
Shvartsman, Alex | 2004 | | Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320 | Proceedings Article |
| Kowalski-STOC-2004 | Chlebus, Bogdan S.
Kowalski, Dariusz
Shvartsman, Alex | 2004 | | Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330 | Proceedings Article |
| Kowalski2003a | Chlebus, Bogdan S.
Kowalski, Dariusz | 2004 | | Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41 | Journal Article |
| Kowalski2003b | Kowalski, Dariusz
Pelc, Andrzej | 2004 | | Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891 | Journal Article |
| KP-APPROX | Kowalski, Dariusz
Pelc, Andrzej | 2004 | | 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 | Proceedings Article |
| KP-ISAAC | Kowalski, Dariusz
Pelc, Andrzej | 2004 | | Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656 | Proceedings Article |
| KP-SIROCCO | Kowalski, Dariusz
Pelc, Andrzej | 2003 | | Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210 | Proceedings Article |
| KP-TCS | Kowalski, Dariusz
Pelc, Andrzej | 2005 | | Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371 | Journal Article |
| KPSS2010 | Kuhn, Fabian
Panagiotou, Konstantinos
Spencer, Joel
Steger, Angelika | 2010 | | Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964 | Proceedings Article |
| KrandickMehlhorn2004a | Krandick, Werner
Mehlhorn, Kurt | 2004 | | New Bounds for the Descartes Method | Report |
| KraNeuGECCO2009 | Kratsch, Stefan
Neumann, Frank | 2009 | | Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300 | Proceedings Article |
| Kratsch-et-al:interval | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | 2003 | | 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 | Proceedings Article |
| Kratsch2008 | Kratsch, Stefan | 2009 | | Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612 | Electronic Proceedings Article |
| KratschLNO2010 | Kratsch, Stefan
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro Simone | 2010 | | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 | Proceedings Article |
| KratschPhD2010 | Kratsch, Stefan | 2010 | | Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes | Thesis - PhD thesis |
| KratschPilipczukPilipczukWahlstroem2012 | Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus | 2012 | | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 | Proceedings Article |
| KratschS2010 | Kratsch, Stefan
Schweitzer, Pascal | 2010 | | Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92 | Proceedings Article |
| KratschW2009 | Kratsch, Stefan
Wahlström, Magnus | 2009 | | Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article |
| KratschWahlstroem2012a | Kratsch, Stefan
Wahlström, Magnus | 2012 | | 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 | Proceedings Article |
| KratschWahlstroem2012b | Kratsch, Stefan
Wahlström, Magnus | 2012 | | Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459 | Proceedings Article |
| KroGhaMicNeuPPSN2008 | Kroeske, Jense
Ghandar, Adam
Michalewicz, Zbigniew
Neumann, Frank | 2008 | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article |
| KrohmerMaster2012 | Krohmer, Anton | 2012 | | Finding cliques in scale-free networks
Universität des Saarlandes | Thesis - Masters thesis |
| KrStWe2009 | Krumke, Sven
van Stee, Rob
Westphal, Stefan | 2009 | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book |
| Krysta1999a | Krysta, Piotr
Pacholski, Leszek | 1999 | | The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219 | Journal Article |
| Krysta2001 | Krysta, Piotr
Kumar, V. S. Anil | 2001 | | 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 | Proceedings Article |
| Krysta2001b | Krysta, Piotr | 2001 | | Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes | Thesis - PhD thesis |
| Krysta2001c | Krysta, Piotr
Solis-Oba, Roberto | 2001 | | Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247 | Journal Article |
| Krysta2002a | Csaba, Bela
Krysta, Piotr
Karpinski, Marek | 2002 | | 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 | Proceedings Article |
| Krysta2002b | Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold | 2002 | | Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296 | Proceedings Article |
| Krysta2003b | Krysta, Piotr | 2003 | | Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288 | Journal Article |
| KrystaLorys1999 | Krysta, Piotr
Lorys, Krzysztof | 1999 | | Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413 | Proceedings Article |
| ks-ncrah-10 | Kerber, Michael
Sagraloff, Michael | 2011 | | A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430 | Journal Article |
| KS11 | Kayal, Neeraj
Saha, Chandan | 2011 | | On the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299 | Proceedings Article |
| KS12 | Kayal, Neeraj
Saha, Chandan | 2012 | | On the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15 | Journal Article |
| Ksinsik96 | Ksinsik, Patric | 1996 | | Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes | Thesis - Masters thesis |
| KSV03 | Krysta, Piotr
Sanders, Peter
Vöcking, Berthold | 2003 | | Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510 | Proceedings Article |
| KT03:gcc | Katriel, Irit
Thiel, Sven | 2003 | | Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451 | Proceedings Article |
| Kumar1999a | Kumar, V. S. Anil
Ramesh, Hariharan | 1999 | | Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454 | Proceedings Article |
| Kumar1999b | Kumar, V. S. Anil
Ramesh, Hariharan | 1999 | | Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251 | Proceedings Article |
| Kumar2000 | Kumar, V. S. Anil
Arya, Sunil
Ramesh, Hariharan | 2000 | | Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635 | Proceedings Article |
| Kumar2001a | Kumar, V. S. Anil | 2001 | | Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17 | Journal Article |
| Kursawe2002 | Albers, Susanne
Kursawe, Klaus
Schuierer, Sven | 2002 | | Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143 | Journal Article |
| Kursawe98 | Kursawe, Klaus | 1998 | | Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes | Thesis - Masters thesis |
| Kutz05 | Kutz, Martin
Pór, Attila | 2005 | | Angel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934 | Proceedings Article |
| Kutz2006 | Kutz, Martin | 2006 | | 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 | Proceedings Article |
| Kutz3dAngel | Kutz, Martin | 2005 | | Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451 | Journal Article |
| KutzHGames:2004 | Kutz, Martin | 2005 | | Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36 | Proceedings Article |
| KutzSchw2006 | Kutz, Martin
Schweitzer, Pascal | 2007 | | ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157 | Proceedings Article |
| KW2010b | Kratsch, Stefan
Wahlström, Magnus | 2010 | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article |
| Kwappik98 | Kwappik, Carsten | 1998 | | Exact Linear Programming
Universität des Saarlandes | Thesis - Masters thesis |
| KwekMehlhorn2003 | Kwek, St.
Mehlhorn, Kurt | 2003 | | Optimal Search for Rationals
In: Information Processing Letters [86], 23-26 | Journal Article |
Lambert2000
| Lambert, Oliver | 2000 | | Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes | Thesis - Masters thesis |
| LambertDipl01 | Lambert, Georg | 2001 | | Ein Parametric Search Toolkit
Universität des Saarlandes | Thesis - Masters thesis |
| Lang94 | Lang, Hans-Hermann | 1994 | | Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes | Thesis - Masters thesis |
| Lauer1998Diplom | Lauer, Thorsten | 1998 | | Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes | Thesis - Masters thesis |
| Lee2010a | Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung | 2010 | | 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 | Electronic Proceedings Article |
| Lee2010b | Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei | 2010 | | Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35 | Proceedings Article |
| Lee2010c | Han, Xin
Lam, Tak-Wah
Lee, Lap-Kei
To, Isaac K. K.
Wong, Prudence W. H. | 2010 | | Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | Journal Article |
| Lee2010d | Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk | 2011 | | Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517 | Journal Article |
| Lee2011b | Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei | 2011 | | Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403 | Electronic Proceedings Article |
| Leejh2000a | Lee, Jae-Ha
Park, Sang-Min
Chwa, Kyung-Yong | 2000 | | Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220 | Journal Article |
| Leejh2000b | Lee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong | 2000 | | Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783 | Journal Article |
| Leejha2001 | Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong | 2001 | | Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468 | Proceedings Article |
| Leejhc2000 | Lee, Jae-Ha
Cheong, Otfried
Kwon, Woo-Cheol
Shin, Sung-Yong
Chwa, Kyung-Yong | 2000 | | 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 | Proceedings Article |
| Leejhd2000 | Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong | 2000 | | Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526 | Proceedings Article |
| LeeLK2012 | Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung | 2012 | | Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111 | Journal Article |
| LehNeuOliCEC2009 | Oliveto, Pietro Simone
Lehre, Per Kristian
Neumann, Frank | 2009 | | Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 | Proceedings Article |
| LehnSchw2007 | Lehnert, Jörg
Schweitzer, Pascal | 2007 | | The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241 | Journal Article |
| Leinenbach95 | Leinenbach, Stefan | 1997 | | Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes | Thesis - Masters thesis |
| Lenhof-1-97 | Lenhof, Hans-Peter | 1997 | | New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191 | Proceedings Article |
| Lenhof-et-al-1-97 | Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John | 1997 | | 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 | Proceedings Article |
| Lenhof-et-al-2-97 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 1997 | | Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521 | Journal Article |
| Lenhof-et-al-3-97 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 1997 | | Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM | Proceedings Article |
| Lenhof-et-al95 | Datta, Amitava
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel | 1995 | | Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503 | Journal Article |
| Lenhof-Smid-1-92 | Lenhof, Hans-Peter
Smid, Michiel | 1992 | | Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398 | Proceedings Article |
| Lenhof-Smid-1-95 | Lenhof, Hans-Peter
Smid, Michiel | 1995 | | Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312 | Journal Article |
| Lenhof-Smid-2-92 | Lenhof, Hans-Peter
Smid, Michiel | 1992 | | Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386 | Proceedings Article |
| Lenhof-Smid-2-94 | Lenhof, Hans-Peter
Smid, Michiel | 1994 | | Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49 | Journal Article |
| Lenhof-Smid-2-95 | Lenhof, Hans-Peter
Smid, Michiel | 1995 | | Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288 | Journal Article |
| Lenhof-Smid-91 | Lenhof, Hans-Peter
Smid, Michiel | 1991 | | An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363 | Proceedings Article |
| Lenhof-Smid93 | Lenhof, Hans-Peter
Smid, Michiel | 1993 | | An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267 | Journal Article |
| Lenhof-Smid94 | Lenhof, Hans-Peter
Smid, Michiel | 1994 | | An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387 | Proceedings Article |
| Lenhof95 | Lenhof, Hans-Peter | 1995 | | An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139 | Part of a Book |
| LenhofMorgensternReinert1999 | Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut | 1999 | | An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210 | Journal Article |
| lenhof_habil | Lenhof, Hans-Peter | 1999 | | Bioinformatik
Universität des Saarlandes | Thesis - Habilitation thesis |
| Lennerz2001 | Lennerz, Christian
Schömer, Elmar | 2002 | | Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69 | Proceedings Article |
| LennerzDiss05 | Lennerz, Christian | 2005 | | Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes | Thesis - PhD thesis |
