| # |  | Year | Author(s) [non member] | | Title | Type | |
|---|
| 2 |
 | Jez, Lukasz |
| |
| | 2014 | Gawrychowski, Pawel
Jez, Artur
[Jez, Lukasz] | | Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372 | Journal Article | |
| | 2012 | [Epstein, Leah]
[Jez, Lukasz]
[Sgall, Jiri]
van Stee, Rob |  | 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 | |
| 1 |
| |
| | 1997 | Breslauer, Dany
[Jiang, Tao]
[Jiang, Zhigen] | | Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353 | Journal Article | |
| 1 |
| |
| | 1997 | Gasieniec, Leszek
[Jansson, Jesper]
[Lingas, Andrzej]
[Östlin, Anna] | | On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145 | Proceedings Article | |
| 1 |
| |
| | 1997 | Breslauer, Dany
[Jiang, Tao]
[Jiang, Zhigen] | | Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353 | Journal Article | |
| 21 |
| |
| | 2013 | Doerr, Benjamin
[Johannsen, Daniel]
Kötzing, Timo
[Neumann, Frank]
[Theile, Madeleine] | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article | |
| | 2012 | Doerr, Benjamin
[Johannsen, Daniel]
Winzen, Carola | | Multiplicative Drift Analysis
In: Algorithmica [64], 673-697 | Journal Article | |
| | 2012 | Doerr, Benjamin
[Johannsen, Daniel]
Winzen, Carola | | Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86 | Journal Article | |
| | 2011 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
[Lehre, Per Christian]
Wagner, Markus
Winzen, Carola | | 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 | |
| | 2011 | [Mainberger, Markus]
[Hoffmann, Sebastian]
[Weickert, Joachim]
Tang, Ching Hoo
[Johannsen, Daniel]
[Neumann, Frank]
Doerr, Benjamin | | Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
Johannsen, Daniel
[Schmidt, Martin] | | 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 | |
| | 2010 | Johannsen, Daniel
Lengler, Johannes | | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Johannsen, Daniel] | | 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 | |
| | 2010 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine] | | 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 | |
| | 2010 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article | |
| | 2010 | Johannsen, Daniel | | Random combinatorial structures and randomized search heuristics
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2010 | Johannsen, Daniel
Panagiotou, Konstantinos | | Vertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 | Proceedings Article | |
| | 2009 | Johannsen, Daniel
[Razgon, Igor]
Wahlström, Magnus | | 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 | |
| | 2008 | [Cameron, Peter]
Johannsen, Daniel
[Prellberg, Thomas]
Schweitzer, Pascal | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article | |
| | 2008 | Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo] | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article | |
| | 2008 | Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article | |
| | 2007 | [Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun] | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article | |
| | 2007 | Doerr, Benjamin
Johannsen, Daniel | | Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Proceedings Article | |
| | 2007 | Doerr, Benjamin
Johannsen, Daniel | | Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507 | Proceedings Article | |
| | 2006 | Johannsen, Daniel | | Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin | Thesis - Masters thesis | |
| 1 |
| |
| | 2008 | Chang, Kevin
[Johnson, Aaron] | | Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Proceedings Article | |
| 2 |
| |
| | 2009 | Ajwani, Deepak
[Meyer, Ulrich]
[Osipov, Vitaly] | | Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Part of a Book | |
| | 2009 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book | |
| 1 |
| Johnson, David (ed.) |
| |
| | 2006 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article | |
| 2 |
| Johnson, Ellis (ed.) |
| |
| | 1992 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| | 1992 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93 | Proceedings Article | |
| 1 |
| |
| | 2009 | Emeliyanenko, Pavel | | Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article | |
| 1 |
| |
| | 2010 | Mehlhorn, Kurt | | Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11 | Proceedings Article | |
| 19 |
| |
| | 2007 | Behle, Markus
[Jünger, Michael]
[Liers, Frauke] | | A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392 | Proceedings Article | |
| | 2002 | Althaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article | |
| | 1999 | [Brandenburg, Franz J.]
[Schreiber, Falk]
[Jünger, Michael]
[Marks, Joe]
Mutzel, Petra | | Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409 | Proceedings Article | |
| | 1998 | Jünger, Michael
[Leipert, Sebastian]
Mutzel, Petra | | 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 | |
| | 1998 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian] | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Proceedings Article | |
| | 1998 | [Jünger, Michael]
[Leipert, Sebastian]
Mutzel, Petra | | Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237 | Proceedings Article | |
| | 1998 | [Jünger, Michael]
Mutzel, Petra
[Odenthal, Thomas]
[Scharbrodt, M.] | | The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176 | Journal Article | |
| | 1997 | [Jünger, Michael]
Mutzel, Petra | | 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25 | Journal Article | |
| | 1997 | [Christof, Thomas]
[Jünger, Michael]
[Kececioglu, John]
Mutzel, Petra
[Reinelt, Gerhard] | | A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447 | Journal Article | |
| | 1997 | Christof, Thomas
[Jünger, Michael]
Kececioglu, John
Mutzel, Petra
[Reinelt, Gerhard] | | A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92 | Proceedings Article | |
| | 1997 | [Jünger, Michael]
Lee, E. K.
Mutzel, Petra
[Odenthal, Thomas] | | 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 | |
| | 1997 | [Brandenburg, Franz J.]
[Jünger, Michael]
Mutzel, Petra | | Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207 | Journal Article | |
| | 1997 | [Jünger, Michael]
[Leipert, Sebastian]
Mutzel, Petra | | Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204 | Proceedings Article | |
| | 1997 | [Brandenburg, Franz J.]
[Jünger, Michael]
Mutzel, Petra
[Lengauer, Thomas] | | SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen"
In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67 | Proceedings Article | |
| | 1996 | [Jünger, Michael]
Mutzel, Petra | | Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), - | Proceedings Article | |
| | 1996 | [De Simone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni] | | Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371 | Journal Article | |
| | 1996 | [Jünger, Michael]
Mutzel, Petra | | Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59 | Journal Article | |
| | 1995 | [DeSimone, Caterina]
[Diehl, Martin]
[Jünger, Michael]
Mutzel, Petra
[Reinelt, Gerhard]
[Rinaldi, Giovanni] | | Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496 | Journal Article | |
| | 1995 | [Jünger, Michael]
Mutzel, Petra | | 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 | |
| 4 |
| |
| | 2000 | [Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | | Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522 | Journal Article | |
| | 1999 | [Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | | 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 | |
| | 1997 | [Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | | Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521 | Journal Article | |
| | 1997 | [Jung, Bernd]
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | | Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM | Proceedings Article | |
| 6 |
| Jung, Hermann |
| |
| | 1995 | Fleischer, Rudolf
[Jung, Hermann]
Mehlhorn, Kurt | | A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | Journal Article | |
| | 1994 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | Journal Article | |
| | 1992 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| | 1991 | Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt | | A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401 | Proceedings Article | |
| | 1988 | Jung, Hermann
Mehlhorn, Kurt | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236 | Journal Article | |
| | 1987 | Jung, Hermann
Mehlhorn, Kurt | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees | Report | |
| 3 |
| |
| | 1987 | Alt, Helmut
Hagerup,Torben
Mehlhorn, Kurt
Preparata, Franco P. | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | Proceedings Article | |
| | 1987 | | | Parallel algorithms and architectures (WPAA-87) : international workshop | Proceedings | |
| | 1987 | | | Parallel algorithms and architectures : International Workshop | Proceedings | |
| 1 |
| |
| | 1996 | Jung, Karin | | Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Jurdzi´nski, Tomasz (ed.) |
| |
| | 2007 | Christodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article | |
| 6 |
| |
| | 2013 | Jurkiewicz, Tomasz
Mehlhorn, Kurt | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article | |
| | 2013 | Jurkiewicz, Tomasz | | Toward Better Computation Models for Modern Machines
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2011 | Jurkiewicz, Tomasz
Danilewski, Piotr | | Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Unpublished/Draft | |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article | |
| | 2009 | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | Proceedings Article | |
| | 2009 | Jurkiewicz, Tomasz | | Cycle Bases in Graphs
Universität des Saarlandes | Thesis - Masters thesis | |
| 4 |
| Juurlink, Ben |
| |
| | 1998 | Sibeyn, Jop F.
[Juurlink, Ben]
Rao, P. Srinivasa | | Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525 | Journal Article | |
| | 1996 | [Juurlink, Ben]
Sibeyn, Jop F.
[Rao, P. Srinivasa] | | Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369 | Proceedings Article | |
| | 1995 | [Juurlink, Ben]
Sibeyn, Jop F. | | Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760 | Proceedings Article | |
| | 1995 | [Juurlink, Ben]
Mutzel, Petra | | ?
In: Conference on High-Performance Computing, 125-130 | Proceedings Article | |
| 3 |
| |
| | 1999 | Kagaris, Dimitrios
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos | | Transmissions in a network with capacities and delays
In: Networks [33
], 167-174 | Journal Article | |
| | 1995 | [Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos | | On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 | Proceedings Article | |
| | 1995 | [Kagaris, Dimitrios]
[Pantziou, Grammati E.]
[Tragoudas, Spyros]
Zaroliagis, Christos | | Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44 | Proceedings Article | |
| 1 |
| |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report | |
| 2 |
| |
| | 2007 | [Caragiannis, Ioannis]
Fishkin, Aleksei V.
[Kaklamanis, Christos]
[Papaioannou, Evi] | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | Journal Article | |
| | 2007 | [Caragiannis, Ioannis]
Fishkin, Aleksei V.
[Kaklamanis, Christos]
[Papaioannou, Evi] | | Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 | Proceedings Article | |
| 3 |
| Kaklamanis, Christos (ed.) |
| |
| | 2008 | [Epstein, Leah]
van Stee, Rob | | Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | Proceedings Article | |
| | 2008 | [Epstein, Leah]
van Stee, Rob | | On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | Proceedings Article | |
| | 2006 | [Bodlaender, Hans L.]
[Feremans, Corinne]
[Grigoriev, Alexander]
[Penninkx, Eelko]
Sitters, Rene
[Wolle, Thomas] | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | Proceedings Article | |
| 1 |
| Kalai, Adam Tauman (ed.) |
| |
| | 2010 | [Case, John]
Kötzing, Timo | | Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Proceedings Article | |
| 6 |
| Kaligosi, Kanela |
| |
| | 2007 | [Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | Journal Article | |
| | 2006 | [Brodal, Gerth Stølting]
Kaligosi, Kanela
[Katriel, Irit]
Kutz, Martin | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article | |
| | 2006 | Kaligosi, Kanela
[Sanders, Peter] | | How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791 | Proceedings Article | |
| | 2005 | Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P. | | Certifying Algorithms (draft) | Unpublished/Draft | |
| | 2005 | Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter] | | Towards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 | Proceedings Article | |
| | 2003 | Kaligosi, Kanela | | Length bounded network flows
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 1996 | [Gupta, Arvind]
[Kaller, Damon]
[Mahajan, Sanjeev]
[Shermer, Thomas C.] | | Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172 | Proceedings Article | |
| 1 |
| |
| | 1999 | Mutzel, Petra
Ziegler, Thomas | | The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134 | Proceedings Article | |
| 4 |
| |
| | 2008 | Elbassioni, Khaled
Elmasry, Amr
[Kamel, Ibrahim] | | Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529 | Part of a Book | |
| | 2005 | Elbassioni, Khaled M.
[Elmasry, Amr]
[Kamel, Ibrahim] | | An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249 | Journal Article | |
| | 2004 | [Mokbel, Mohamed F.]
[Aref, Walid G.]
Elbassioni, Khaled M.
[Kamel, Ibrahim] | | Scalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509 | Proceedings Article | |
| | 2003 | Elbassioni, Khaled M.
[Elmasry, Amr]
[Kamel, Ibrahim] | | An Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439 | Proceedings Article | |
| 1 |
| Kammenhuber, Nils |
| |
| | 2003 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | | An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | Proceedings Article | |
| 1 |
| Kamran Azam, Muhammad |
| |
| | 2005 | Kamran Azam, Muhammad | | Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kando, Noriko (ed.) |
| |
| | 2007 | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | | ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Proceedings Article | |
| 1 |
| Kane, Daniel |
| |
| | 2012 | [Kane, Daniel]
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Proceedings Article | |
| 1 |
| Kang, Mihyun |
| |
| | 2007 | [Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun] | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article | |
| 1 |
| Kang, Ross |
| |
| | 2010 | Fountoulakis, Nikolaos
[Kang, Ross]
[McDiarmid, Colin] | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | Electronic Journal Article | |
| 1 |
| Kaninke, G. |
| |
| | 1982 | Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T. | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | Journal Article | |
| 1 |
| Kannan, Ravi |
| |
| | 2006 | Chang, Kevin L.
[Kannan, Ravi] | | The Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166 | Proceedings Article | |
| 3 |
| Kao, Ming-Yang |
| |
| | 2010 | [Kao, Ming-Yang]
[Leung, Henry C. M.]
Sun, He
[Zhang, Yong] | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article | |
| | 1995 | [Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott] | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | Proceedings Article | |
| | 1995 | Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott] | | Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205 | Proceedings Article | |
| 5 |
| Kao, Ming-Yang (ed.) |
| |
| | 2008 | van Stee, Rob | | Packet Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| | 2008 | van Stee, Rob | | Paging
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| | 2008 | Christodoulou, George | | Price of Anarchy
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| | 2007 | Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva] | | 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 | |
| | 1998 | Fleischer, Rudolf | | On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74 | Proceedings Article | |
| 3 |
| Kaplan, Haim (ed.) |
| |
| | 2010 | [Jansen, Klaus]
Kratsch, Stefan
[Marx, Dániel]
[Schlotter, Ildikó] | | 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 | |
| | 2010 | Kratsch, Stefan
Schweitzer, Pascal | | 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 | |
| | 2010 | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37 | Proceedings Article | |
| 5 |
| Kapoor, Sanjiv |
| |
| | 1997 | [Das, Gautam]
[Kapoor, Sanjiv]
Smid, Michiel | | 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 | |
| | 1996 | Kapoor, Sanjiv
Smid, Michiel | | New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796 | Journal Article | |
| | 1996 | Kapoor, Sanjiv | | 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 | |
| | 1996 | [Das, Gautam]
[Kapoor, Sanjiv]
Smid, Michiel | | 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 | |
| | 1995 | Hariharan, Ramesh
[Kapoor, Sanjiv] | | Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265 | Journal Article | |
| 1 |
| Kappel, Holger |
| |
| | 1998 | Kappel, Holger | | Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Karamanis, Nikiforos |
| |
| | 2004 | Althaus, Ernst
[Karamanis, Nikiforos]
[Koller, Alexander] | | Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406 | Proceedings Article | |
| 4 |
| Karavelas, Menelaos |
| |
| | 2008 | [Emiris,Ioannis]
Hemmer, Michael
[Karavelas, Menelaos]
[Limbach, Sebastian]
[Mourrain, Bernard]
[Tsigaridas, Elias]
[Zafeirakopoulos,Zafeirakis] | | Cross-benchmarks of univariate algebraic kernels | Report | |
| | 2008 | [Emiris, Ioannis Z.]
Hemmer, Michael
[Karavelas, Menelaos]
[Mourrain, Bernard]
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis] | | Experimental evaluation and cross-benchmarking of univariate real solvers | Report | |
| | 2008 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | Prototype implementation of the algebraic kernel | Report | |
| | 2006 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | Interface specification of algebraic kernel | Report | |
| 2 |
| |
| | 2009 | Hemmer, Michael
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
[Emiris, Ioannis Z.]
[Karavelas, Menelaos I.]
[Mourrain, Bernard] | | Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | Proceedings Article | |
| | 2007 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos I.]
[Teillaud, Monique] | | Revision of interface specification of algebraic kernel | Report | |
| 3 |
| Karhumäki, Juhani (ed.) |
| |
| | 2004 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | Proceedings Article | |
| | 2004 | [Arge, Lars]
Meyer, Ulrich
[Toma, Laura] | | External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157 | Proceedings Article | |
| | 2004 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | | Online scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122 | Proceedings Article | |
| 1 |
| Kariv, Oded (ed.) |
| |
| | 1981 | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Proceedings Article | |
| 10 |
| Kärkkäinen, Juha |
| |
| | 2014 | [Gagie, Travis]
Gawrychowski, Pawel
[Kärkkäinen, Juha]
[Nekrich, Yakov]
[Puglisi, Simon J.] | | 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 | |
| | 2005 | Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter | | 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 | |
| | 2003 | Burkhardt, Stefan
Kärkkäinen, Juha | | Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70 | Journal Article | |
| | 2003 | Burkhardt, Stefan
Kärkkäinen, Juha | | Fast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69 | Proceedings Article | |
| | 2003 | Kärkkäinen, Juha
[Rao, S. Srinivasa] | | Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170 | Part of a Book | |
| | 2003 | Kärkkäinen, Juha
Sanders, Peter | | Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955 | Proceedings Article | |
| | 2002 | Kärkkäinen, Juha | | Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357 | Proceedings Article | |
| | 2002 | Burkhardt, Stefan
Kärkkäinen, Juha | | One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234 | Proceedings Article | |
| | 2001 | Burkhardt, Stefan
Kärkkäinen, Juha | | Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85 | Proceedings Article | |
| | 1997 | [Das, Gautam]
Fleischer, Rudolf
Gasieniec, Leszek
Gunopulos, Dimitrios
Kärkkäinen, Juha | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Proceedings Article | |
| 1 |
| |
| | 2012 | Gawrychowski, Pawel | | Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242 | Proceedings Article | |
| 1 |
| |
| | 2009 | Celikik, Marjan
Bast, Hannah | | Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205 | Proceedings Article | |
| 3 |
| |
| | 1994 | [Dietzfelbinger, Martin]
[Karlin, Anna]
Mehlhorn, Kurt
[Meyer Auf Der Heide, Friedhelm]
[Rohnert, Hans]
[Tarjan, Robert E.] | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | Journal Article | |
| | 1991 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | Dynamic Perfect Hashing: Upper and Lower Bounds | Report | |
| | 1988 | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531 | Proceedings Article | |
| 2 |
| |
| | 1998 | [Calinescu, Gruia]
Fernandes, Cristina G.
Finkler, Ulrich
Karloff, Howard | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Journal Article | |
| | 1996 | [Calinescu, Gruia]
[Fernandes, Cristina G.]
Finkler, Ulrich
[Karloff, Howard] | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | Proceedings Article | |
| 8 |
| Karlsson, Rolf (ed.) |
| |
| | 1996 | Kelsen, Pierre
[Mahajan, Sanjeev]
[Ramesh, Hariharan] | | Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52 | Proceedings Article | |
| | 1996 | Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev | | Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52 | Proceedings Article | |
| | 1996 | Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech] | | Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403 | Proceedings Article | |
| | 1996 | Kelsen, Pierre | | Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233 | Proceedings Article | |
| | 1996 | Brodal, Gerth Stølting
Chaudhuri, Shiva
[Radhakrishnan, Jaikumar] | | The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15 | Proceedings Article | |
| | 1996 | [Gupta, Arvind]
[Kaller, Damon]
[Mahajan, Sanjeev]
[Shermer, Thomas C.] | | Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172 | Proceedings Article | |
| | 1993 | Hagerup, Torben
Mehlhorn, Kurt
Munro, I. | | Maintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264 | Proceedings Article | |
| | 1988 | Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H. | | Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215 | Proceedings Article | |
| 2 |
| |
| | 2000 | Sanders, Peter
Sibeyn, Jop F. | | A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926 | Proceedings Article | |
| | 2000 | Meyer, Ulrich
Sanders, Peter | | Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470 | Proceedings Article | |
| 3 |
| Karpinski, Marek |
| |
| | 2002 | Csaba, Bela
Krysta, Piotr
[Karpinski, Marek] | | 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 | |
| | 1996 | Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech] | | Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403 | Proceedings Article | |
| | 1996 | Gasieniec, Leszek
[Karpinski, Marek]
[Plandowski, Wojciech]
[Rytter, Wojciech] | | Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49 | Proceedings Article | |
| 2 |
| Karpinski, Marek (ed.) |
| |
| | 1983 | Mehlhorn, Kurt
Schmidt, Bernd H. | | A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309 | Proceedings Article | |
| | 1983 | Hertel, Stefan
Mehlhorn, Kurt | | Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218 | Proceedings Article | |
| 1 |
| |
| | 2000 | [Karp, Richard]
[Schindelhauer, Christian]
[Shenker, Scott]
Vöcking, Berthold | | Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574 | Proceedings Article | |
| 2 |
| |
| | 1996 | [Alt, Helmut]
[Guibas, L.]
Mehlhorn, Kurt
[Karp, Richard M.]
[Wigderson, A.] | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | Journal Article | |
| | 1991 | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Report | |
| 17 |
| Karrenbauer, Andreas |
| |
| | 2011 | [Althaus, Ernst]
[Canzar, Stefan]
Elbassioni, Khaled
[Karrenbauer, Andreas]
[Mestre, Julian] | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Journal Article | |
| | 2009 | [Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.] | | Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | Electronic Journal Article | |
| | 2009 | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao] | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | Journal Article | |
| | 2008 | [Albrecht, Marc]
Karrenbauer, Andreas
[Xu, Chihao] | | A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289 | Proceedings Article | |
| | 2008 | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián | | Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article | |
| | 2008 | Althaus, Ernst
Canzar, Stefan
[Emmett, Mark]
Karrenbauer, Andreas
[Marshall, Alan]
[Meyer-Bäse, Anke]
[Zhang, Huimin] | | Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | Proceedings Article | |
| | 2008 | [Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Codrea, Cosmin] | | Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219 | Journal Article | |
| | 2008 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article | |
| | 2007 | [Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Wahl, Jürgen] | | A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | Proceedings Article | |
| | 2007 | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Xu, Chihao] | | Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351 | Proceedings Article | |
| | 2007 | Karrenbauer, Andreas | | Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar] | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article | |
| | 2006 | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao] | | Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755 | Proceedings Article | |
| | 2005 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | Proceedings Article | |
| | 2005 | Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar] | | Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206 | Proceedings Article | |
| | 2005 | [Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph] | | Verfahren zur Ansteuerung von Matrixanzeigen | Miscellaneous | |
| | 2004 | Karrenbauer, Andreas | | Packing Boxes with Arbitrary Rotations
Universität des Saarlandes | Thesis - other | |
| 1 |
| Kasan, Binaman |
| |
| | 1995 | Kasan, Binaman | | Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| Kaski, Petteri (ed.) |
| |
| | 2012 | [Kim, Eun Jung]
[Paul, Christophe]
Philip, Geevarghese | | 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 | |
| | 2012 | Doerr, Benjamin
[Fouz, Mahmoud]
[Friedrich, Tobias] | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article | |
| | 2012 | Huang, Chien-Chung | | Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | Proceedings Article | |
| 1 |
| Kasper, Thomas |
| |
| | 2002 | Althaus, Ernst
[Bockmayr, Alexander]
[Elf, Matthias]
[Kasper, Thomas]
[Jünger, Michael]
Mehlhorn, Kurt | | SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87 | Proceedings Article | |
| 2 |
| Kasprzik, Anna |
| |
| | 2012 | [Heinz, Jeffrey]
[Kasprzik, Anna]
Kötzing, Timo | | Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127 | Journal Article | |
| | 2010 | [Kasprzik, Anna]
Kötzing, Timo | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article | |
| 8 |
| |
| | 2010 | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37 | Proceedings Article | |
| | 2010 | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article | |
| | 2008 | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19 | Journal Article | |
| | 2008 | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204 | Journal Article | |
| | 1998 | Brodal, Gerth Stølting
Katajainen, Jyrki | | Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118 | Proceedings Article | |
| | 1997 | Katajainen, Jyrki
Träff, Jesper Larsson | | A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Proceedings Article | |
| | 1997 | [Dietzfelbinger, Martin]
Hagerup, Torben
Katajainen, Jyrki
[Penttonen, Martti] | | A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51 | Journal Article | |
| | 1995 | Hagerup, Torben
[Katajainen, Jyrki]
[Nishimura, Naomi]
[Ragde, Prabhakar] | | 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 | |
| 1 |
| Katajainen, Jyrki (ed.) |
| |
| | 2004 | [Brodal, Gerth Stølting]
[Fagerberg, Rolf]
Meyer, Ulrich
[Zeh, Norbert] | | Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492 | Proceedings Article | |
| 3 |
| Katoh, Naoki |
| |
| | 2006 | [Teramoto, Sachio]
[Asano, Tetsuo]
[Katoh, Naoki]
Doerr, Benjamin | | Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356 | Journal Article | |
| | 2006 | [Aronov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article | |
| | 2004 | [Aranov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | Proceedings Article | |
| 2 |
| Katoh, Naoki (ed.) |
| |
| | 1995 | Bradford, Phillip Gnassi
Fleischer, Rudolf | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | Proceedings Article | |
| | 1995 | [Dedorath, Jürgen]
Gergov, Jordan
Hagerup, Torben | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | Proceedings Article | |
| 18 |
| |
| | 2008 | [Kutz, Martin]
Elbassioni, Khaled
[Katriel, Irit]
[Mahajan, Meena] | | Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897 | Journal Article | |
| | 2007 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article | |
| | 2006 | [Brodal, Gerth Stølting]
Kaligosi, Kanela
[Katriel, Irit]
Kutz, Martin | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article | |
| | 2005 | Katriel, Irit
Thiel, Sven | | Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | Journal Article | |
| | 2005 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | 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 | |
| | 2005 | Katriel, Irit
[Michel, Laurent]
[Van Hentenryck, Pascal] | | Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183 | Journal Article | |
| | 2005 | Elbassioni, Khaled M.
Katriel, Irit | | 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 | |
| | 2005 | Katriel, Irit
[Bodlaender, Hans L.] | | Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450 | Proceedings Article | |
| | 2005 | Elbassioni, Khaled M.
[Katriel, Irit]
Kutz, Martin
[Mahajan, Meena] | | Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115 | Proceedings Article | |
| | 2004 | Katriel, Irit | | Constraints and Changes
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2004 | Katriel, Irit | | 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 | |
| | 2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | | Filtering algorithms for the Same and UsedBy constraints | Report | |
| | 2004 | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79 | Proceedings Article | |
| | 2004 | Katriel, Irit | | On Algorithms for Online Topological Ordering and Sorting | Report | |
| | 2004 | Katriel, Irit | | On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178 | Journal Article | |
| | 2003 | Katriel, Irit
Sanders, Peter
[Träff, Jesper Larsson] | | A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690 | Proceedings Article | |
| | 2003 | Katriel, Irit
Meyer, Ulrich | | Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84 | Part of a Book | |
| | 2003 | Katriel, Irit
Thiel, Sven | | 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 | |
| 1 |
| Kauers, Manuel (ed.) |
| |
| | 2009 | Panagiotou, Konstantinos | | Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article | |
| 26 |
| Kaufmann, Michael |
| |
| | 1998 | [Biedl, Therese]
[Kaufmann, Michael]
Mutzel, Petra | | Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F.
[Kaufmann, Michael] | | BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S. | | Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141 | Journal Article | |
| | 1997 | [Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F. | | Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140 | Journal Article | |
| | 1997 | [Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F. | | Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319 | Proceedings Article | |
| | 1997 | Sibeyn, Jop F.
[Kaufmann, Michael] | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | Journal Article | |
| | 1997 | [Kaufmann, Michael]
Sibeyn, Jop F. | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | Journal Article | |
| | 1997 | [Kaufmann, Michael]
[Raman, Rajeev]
Sibeyn, Jop F. | | Routing on Meshes with Buses
In: Algorithmica [18], 417-444 | Journal Article | |
| | 1995 | [Kaufmann, Michael]
[Schröder, Heiko]
Sibeyn, Jop F. | | Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95 | Journal Article | |
| | 1995 | [Kaufmann, Michael]
Sibeyn, Jop F.
[Suel, Torsten] | | Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88 | Proceedings Article | |
| | 1995 | [Kaufmann, Michael]
Sibeyn, Jop F. | | Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422 | Proceedings Article | |
| | 1994 | Kaufmann, Michael
Mehlhorn, Kurt | | A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246 | Journal Article | |
| | 1994 | [Kaufmann, Michael]
Meyer, Ulrich
Sibeyn, Jop F. | | Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663 | Proceedings Article | |
| | 1992 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | Journal Article | |
| | 1992 | Kaufmann, Michael
Mehlhorn, Kurt | | On local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72 | Journal Article | |
| | 1990 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | Proceedings Article | |
| | 1989 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing Problems in Grid Graphs | Report | |
| | 1989 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing problems in grid graphs | Report | |
| | 1988 | Kaufmann, Michael
Mehlhorn, Kurt | | A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | Report | |
| | 1988 | Gao, Shaodi
Jerrum, Mark
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang | | On Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402 | Proceedings Article | |
| | 1988 | Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark | | On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70 | Proceedings Article | |
| | 1987 | Kaufmann, Michael
Mehlhorn, Kurt | | On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52 | Proceedings Article | |
| | 1986 | Kaufmann, Michael
Mehlhorn, Kurt | | On Local Routing of Two-Terminal Nets | Report | |
| | 1986 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531 | Journal Article | |
| | 1984 | [Kaufmann, Michael]
[Mehlhorn, Kurt] | | Local routing of two-terminal nets is easy | Report | |
| | 1984 | Kaufmann, Michael
Mehlhorn, Kurt | | Routing through a generalized switchbox | Report | |
| 2 |
| |
| | 2007 | [Klein, Rolf]
Kutz, Martin | | Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | Proceedings Article | |
| | 2001 | [Eiglsperger, Markus]
Fekete, Sandor P.
Klau, Gunnar W. | | Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171 | Part of a Book | |
| 1 |
| Kaufmann, Morgan |
| |
| | 1990 | Kaufmann, Morgan
Mehlhorn, Kurt | | Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184 | Part of a Book | |
| 1 |
| Kautz, Jan |
| |
| | 2002 | Goesele, Michael
Kautz, Jan
Lang, Jochen
Lensch, Hendrik P. A.
Seidel, Hans-Peter | | 7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping | Proceedings | |
| 19 |
| Kavitha, Telikepalli |
| |
| | 2012 | Kavitha, Telikepalli
[Mestre, Julián] | | Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14 | Journal Article | |
| | 2011 | [Baswana, Surender]
[Kavitha, Telikepalli]
Mehlhorn, Kurt
[Pettie, Seth] | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article | |
| | 2011 | Huang, Chien-Chung
[Kavitha, Telikepalli]
[Michael, Dimitrios]
[Nasr, Meghana] | | Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | Journal Article | |
| | 2011 | Huang, Chien-Chung
[Kavitha, Telikepalli] | | Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA), | Proceedings Article | |
| | 2011 | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | Journal Article | |
| | 2011 | Huang, Chien-Chung
[Kavitha, Telikepalli] | | Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP), | Proceedings Article | |
| | 2011 | [Kavitha, Telikepalli]
Mestre, Julian
[Nasre, Meghana] | | Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690 | Journal Article | |
| | 2010 | [Kavitha, Telikepalli]
Mestre, Julian | | Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14 | Electronic Journal Article | |
| | 2009 | [Kavitha, Telikepalli]
Mestre, Julian | | Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | Proceedings Article | |
| | 2008 | [Huang, Chien-Chung]
Kavitha, Telikepalli
[Michail, Dimitrios]
[Nasre, Meghana] | | Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 | Proceedings Article | |
| | 2008 | Kavitha, Telikepalli | | On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354 | Proceedings Article | |
| | 2008 | Kavitha, Telikepalli
[Nasre, Meghana] | | Optimal Popular Matchings | Miscellaneous | |
| | 2007 | Kavitha, Telikepalli
Mehlhorn, Kurt | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Journal Article | |
| | 2007 | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios | | 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 | |
| | 2007 | [Abraham, David J.]
[Irving, Robert W.]
[Kavitha, Telikepalli]
Mehlhorn, Kurt | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article | |
| | 2007 | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna E.] | | Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18 | Journal Article | |
| | 2005 | Kavitha, Telikepalli
Mehlhorn, Kurt | | 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 | |
| | 2004 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | Proceedings Article | |
| | 2004 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233 | Proceedings Article | |
| 3 |
| Kavitha, Telikepalli (ed.) |
| |
| | 2012 | Elbassioni, Khaled
[Garg, Naveen]
[Gupta, Divya]
[Kumar, Amit]
[Narula, Vishal]
[Pal, Arindam] | | 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 | |
| | 2012 | Mnich, Matthias
Philip, Geevarghese
[Saurabh, Saket]
[Suchy, Ondrej] | | Beyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423 | Electronic Proceedings Article | |
| | 2012 | [Lokshtanov, Daniel]
[Saurabh, Saket]
Wahlström, Magnus | | Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434 | Electronic Proceedings Article | |
| 5 |
| Kavitha, T. |
| |
| | 2010 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Journal Article | |
| | 2009 | [Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.] | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | Journal Article | |
| | 2009 | [Kavitha, T.]
Mestre, Julián
[Nasre, M.] | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article | |
| | 2008 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees | Unpublished/Draft | |
| | 2008 | Mehlhorn, Kurt
[Kavitha, T.]
[Hariharan, R.] | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | Journal Article | |
| 1 |
| Kavvadias, Dimitris J. |
| |
| | 1996 | [Kavvadias, Dimitris J.]
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
Zaroliagis, Christos | | 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 | |
| 2 |
| Kayal, Neeraj |
| |
| | 2012 | [Kayal, Neeraj]
Saha, Chandan | | 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 | |
| | 2011 | [Kayal, Neeraj]
Saha, Chandan | | On the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299 | Proceedings Article | |
| 1 |
| |
| | 2001 | Meyer, Ulrich | | Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351 | Proceedings Article | |
| 4 |
| |
| | 2000 | [Kececioglu, John]
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
[Vingron, Martin] | | A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | Journal Article | |
| | 1997 | Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John | | 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 | |
| | 1997 | [Christof, Thomas]
[Jünger, Michael]
[Kececioglu, John]
Mutzel, Petra
[Reinelt, Gerhard] | | A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447 | Journal Article | |
| | 1997 | Christof, Thomas
[Jünger, Michael]
Kececioglu, John
Mutzel, Petra
[Reinelt, Gerhard] | | A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92 | Proceedings Article | |
| 1 |
| Kedem, Klara |
| |
| | 1996 | [Devillers, Olivier]
[Golin, Mordecai J.]
[Kedem, Klara]
Schirra, Stefan | | Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327 | Journal Article | |
| 1 |
| Kehden, Britta |
| |
| | 2008 | [Diedrich, Florian]
[Kehden, Britta]
Neumann, Frank | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article | |
| 1 |
| Keidar, Idit (ed.) |
| |
| | 2009 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | | 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 | |
| 6 |
| Keijzer, Maarten (ed.) |
| |
| | 2008 | [Horoba, Christian]
Neumann, Frank | | 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 | |
| | 2008 | Doerr, Benjamin
[Jansen, Thomas]
[Klein, Christian] | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article | |
| | 2008 | Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin] | | Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786 | Proceedings Article | |
| | 2008 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Proceedings Article | |
| | 2008 | Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article | |
| | 2008 | Friedrich, Tobias
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten] | | 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 | |
| 1 |
| |
| | 2008 | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 1 |
| |
| | 2008 | Doerr, Benjamin
[Gnewuch, Michael] | | 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 | |
| 1 |
| |
| | 1995 | Hagerup, Torben
[Keller, Jörg] | | Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148 | Journal Article | |
| 4 |
| |
| | 1996 | Kelsen, Pierre
[Mahajan, Sanjeev]
[Ramesh, Hariharan] | | Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52 | Proceedings Article | |
| | 1996 | Hariharan, Ramesh
Kelsen, Pierre
Mahajan, Sanjeev | | Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52 | Proceedings Article | |
| | 1996 | Kelsen, Pierre | | Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233 | Proceedings Article | |
| | 1995 | [Han, Xiaofeng]
Kelsen, Pierre
[Ramachandran, Vijaya]
[Tarjan, Robert E.] | | Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358 | Journal Article | |
| 1 |
| Kennedy, John (ed.) |
| |
| | 2008 | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 26 |
| Kerber, Michael |
| |
| | 2012 | [Kerber, Michael]
Sagraloff, Michael | | A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258 | Journal Article | |
| | 2012 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | Journal Article | |
| | 2011 | Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael] | | A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186 | Proceedings Article | |
| | 2011 | [Kerber, Michael]
Sagraloff, Michael | | A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430 | Journal Article | |
| | 2011 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Electronic Journal Article | |
| | 2011 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Proceedings Article | |
| | 2011 | [Kerber, Michael]
Sagraloff, Michael | | Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | Proceedings Article | |
| | 2010 | Berberich, Eric
[Hemmer, Michael]
[Kerber, Michael] | | A Generic Algebraic Kernel for Non-linear Geometric Applications | Report | |
| | 2010 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278 | Journal Article | |
| | 2010 | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Kerber, Michael]
[Setter, Ophir] | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article | |
| | 2010 | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article | |
| | 2009 | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article | |
| | 2009 | Kerber, Michael | | Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | Journal Article | |
| | 2009 | Kerber, Michael | | Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2009 | Kerber, Michael | | On the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article | |
| | 2008 | Emeliyanenko, Pavel
Kerber, Michael | | An implementation of the 2D Algebraic Kernel | Report | |
| | 2008 | Berberich, Eric
Kerber, Michael | | Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 | Proceedings Article | |
| | 2008 | Eigenwillig, Arno
Kerber, Michael | | 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 | |
| | 2008 | Berberich, Eric
Kerber, Michael | | Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Proceedings Article | |
| | 2008 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article | |
| | 2008 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 | Proceedings Article | |
| | 2008 | Kerber, Michael | | On filter methods in CGAL's 2D curved kernel | Report | |
| | 2008 | Emeliyanenko, Pavel
Kerber, Michael | | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings Article | |
| | 2008 | Emeliyanenko, Pavel
Kerber, Michael | | Visualizing and Exploring Planar Algebraic Arrangements - a Web Application | Report | |
| | 2007 | Eigenwillig, Arno
Kerber, Michael
[Wolpert, Nicola] | | 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 | |
| | 2006 | Kerber, Michael | | Analysis of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 1982 | Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T. | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | Journal Article | |
| 1 |
| |
| | 2012 | Harren, Rolf
[Kern, Walter] | | Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | Proceedings Article | |
| 1 |
| |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article | |
| 1 |
| |
| | 2012 | [Croitoru, Cosmina]
Kötzing, Timo | | Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | Proceedings Article | |
| 1 |
| |
| | 2000 | Kerzmann, Andreas | | Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 2013 | Hoefer, Martin
[Kesselheim, Thomas] | | Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | Proceedings Article | |
| | 2013 | [Dams, Johannes]
Hoefer, Martin
[Kesselheim, Thomas] | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | Proceedings Article | |
| | 2013 | Hoefer, Martin
[Kesselheim, Thomas]
[Vöcking, Berthold] | | Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582 | Proceedings Article | |
| 11 |
| |
| | 2007 | Funke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael] | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | Journal Article | |
| | 2006 | [Funke, Stefan]
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | Journal Article | |
| | 2006 | [Epstein, Leah]
Kesselman, Alexander | | On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285 | Journal Article | |
| | 2005 | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | 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 | |
| | 2005 | Kesselman, Alexander
Kowalski, Dariusz
[Segal, Michael] | | 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 | |
| | 2005 | Kesselman, Alexander
Kowalski, Dariusz | | 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 | |
| | 2005 | Kesselman, Alexander
[Kogan, Kirill] | | Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844 | Proceedings Article | |
| | 2004 | Kesselman, Alexander
[Lotker, Zvi]
[Mansour, Yishay]
[Patt-Shamir, Boaz]
[Schieber, Baruch]
[Sviridenko, Maxim] | | Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583 | Journal Article | |
| | 2004 | Kesselman, Alexander
[Mansour, Yishay] | | Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182 | Journal Article | |
| | 2004 | Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
[Segal, Michael] | | Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 | Proceedings Article | |
| | 2004 | Kesselman, Alexander
[Guez, Dan]
[Rosen, Adi] | | Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102 | Proceedings Article | |
| 1 |
| |
| | 2002 | Kessler, Harald | | Robust Computation of Visibility Maps
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| |
| | 1997 | [Keßler, Christoph W.]
Träff, Jesper Larsson | | 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 | |
| | 1996 | [Keßler, Christoph W.]
Träff, Jesper Larsson | | A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195 | Proceedings Article | |
| 1 |
| Kettner, Björn |
| |
| | 1998 | Kettner, Björn | | Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes | Thesis - Masters thesis | |
| 40 |
| Kettner, Lutz |
| |
| | 2008 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article | |
| | 2007 | [Hert, Susan]
[Hoffmann, Michael]
Kettner, Lutz
[Pion, Sylvain]
[Seel, Michael] | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | Journal Article | |
| | 2007 | [Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book | |
| | 2007 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | | 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 | |
| | 2007 | Berberich, Eric
Kettner, Lutz | | Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point | Report | |
| | 2007 | Hemmer, Michael
[Hert, Susan]
[Kettner, Lutz]
[Pion, Sylvain]
[Schirra, Stefan] | | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual | |
| | 2007 | Eigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola] | | Snap Rounding of Bézier Curves | Report | |
| | 2007 | Eigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola] | | Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167 | Proceedings Article | |
| | 2006 | [Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack] | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | Journal Article | |
| | 2006 | Berberich, Eric
Ebert, Franziska
Kettner, Lutz | | Definition of file format for benchmark instances for arrangements of Quadrics | Report | |
| | 2006 | Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73 | Journal Article | |
| | 2006 | Kettner, Lutz | | 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 | |
| | 2006 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 | Proceedings Article | |
| | 2006 | Berberich, Eric
Ebert, Franziska
[Fogel, Efi]
Kettner, Lutz | | Web-site with benchmark instances for planar curve arrangements | Report | |
| | 2005 | Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Proceedings Article | |
| | 2005 | Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106 | Proceedings Article | |
| | 2005 | Hachenberger, Peter
Kettner, Lutz | | 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 | |
| | 2005 | [Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack] | | 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 | |
| | 2005 | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | Proceedings Article | |
| | 2005 | Kettner, Lutz | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10 | Electronic Proceedings Article | |
| | 2005 | [Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter] | | STXXL: Standard Template Library for XXL Data Sets | Report | |
| | 2005 | [Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter] | | STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651 | Proceedings Article | |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Emiris, Ioannis]
[Fogel, Efraim]
[Hemmer, Michael]
[Halperin, Dan]
[Kakargias, Athanasios]
Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schömer, Elmar]
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | Report | |
| | 2004 | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
[Schirra, Stefan]
[Yap, Chee] | | Classroom Examples of Robustness Problems in Geometric Computations | Report | |
| | 2004 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | Proceedings Article | |
| | 2004 | Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418 | Proceedings Article | |
| | 2004 | [Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar] | | Effects of a Modular Filter on Geometric Applications | Report | |
| | 2004 | Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter | | 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 | |
| | 2004 | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Weber, Dennis
Wolpert, Nicola | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | Report | |
| | 2004 | Kettner, Lutz
[Näher, Stefan] | | Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463 | Part of a Book | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report | |
| | 2003 | Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Proceedings Article | |
| | 2003 | Berberich, Eric
Eigenwillig, Arno
[Fogel, Efi]
[Halperin, Dan]
Hert, Susan
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron] | | Specification of the traits classes for CGAL arrangements of curves | Report | |
| | 2003 | Kettner, Lutz
[Rossignac, Jarek]
[Snoeyink, Jack] | | 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 | |
| | 2003 | Kettner, Lutz
[Kirkpatrick, David]
[Mantler, Andrea]
[Snoeyink, Jack]
[Speckmann, Bettina]
[Takeuchi, Fumihiko] | | Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12 | Journal Article | |
| | 2001 | Hert, Susan
[Hoffmann, Michael]
[Kettner, Lutz]
[Pion, Sylvain]
Seel, Michael | | An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90 | Proceedings Article | |
| | 2001 | [Bäsken, Matthias]
[Brönnimann, Hervé]
[Frank, Da]
[Devillers, Olivier]
[Ester, Ezra]
[Fabri, Andreas]
[Flato, Eyal]
[Gärtner, Bernd]
[Giezeman, Geert-Jan]
[Halperin, Dan]
[Hanniel, Iddo]
[Har-Peled, Sariel]
[Herrmann, Thomas]
Hert, Susan
[Hirsch, Shai]
[Hoffmann, Michael]
Kettner, Lutz
[Nechushtan, Oren]
[Neyer, Gabriele]
[Pasechnik, Dmitrii]
[Pion, Sylvain]
Schirra, Stefan
[Schönherr, Sven]
Seel, Michael
[Teillaud, Monique]
[Veltkamp, Remco]
[Wein, Ron]
[Wesselink, Wieger]
[Yvinec, Mariette] | | CGAL Reference and User Manuals | Unknown Form: eBookForm | |
| | 2000 | [Brönnimann, Hervé]
[Kettner, Lutz]
Schirra, Stefan
[Veltkamp, Remco] | | Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216 | Part of a Book | |
| | 2000 | [Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven] | | On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202 | Journal Article | |
| | 1996 | [Fabri, Andreas]
[Giezeman, Geert-Jan]
[Kettner, Lutz]
Schirra, Stefan
[Schönherr, Sven] | | The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202 | Proceedings Article | |
| 4 |
| |
| | 2006 | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | Interface specification of algebraic kernel | Report | |
| | 2006 | Berberich, Eric
Hemmer, Michael | | Prototype implementation of the algebraic kernel | Report | |
| | 2005 | | | 21st Annual Symposium on Computational Geometry (SCG'05) | Proceedings | |
| | 2005 | Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106 | Proceedings Article | |
| 33 |
| Khachiyan, Leonid |
| |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | 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 | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir] | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article | |
| | 2008 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui] | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | 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 | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article | |
| | 2007 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article | |
| | 2006 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | 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 | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | 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 | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article | |
| | 2005 | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | Journal Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | 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 | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | 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 | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid] | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | Journal Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555 | Proceedings Article | |
| | 2003 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | 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 | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | Journal Article | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | Electronic Journal Article | |
| | | | | | | |
| | 2002 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | Proceedings Article | |
| | 2001 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | 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 | |
| | 2000 | [Boros, Endre]
Elbassioni, Khaled M.
[Khachiyan, Leonid]
[Gurvich, Vladimir] | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | Journal Article | |
| | 2000 | Khachiyan, Leonid
Porkolab, Lorant | | Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224 | Journal Article | |
| | 1997 | Porkolab, Lorant
Khachiyan, Leonid | | Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171 | Proceedings Article | |
| | 1996 | [Fredman, Michael]
[Khachiyan, Leonid] | | On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628 | Journal Article | |
| 1 |
| Khandekar, Rohit |
| |
| | 2010 | [Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian | | The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231 | Proceedings Article | |
| 1 |
| Khanna, Sanjeev |
| |
| | 1999 | Albers, Susanne
[Arora, Sanjeev]
[Khanna, Sanjeev] | | Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40 | Proceedings Article | |
| 1 |
| Khanna, Sanjeev (ed.) |
| |
| | 2004 | Kowalski, Dariusz
[Pelc, Andrzej] | | 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 | |
| 2 |
| Khosla, Megha |
| |
| | 2013 | Khosla, Megha | | Balls into Bins Made Faster
In: Algorithms - ESA 2013, | Proceedings Article | |
| | 2011 | Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos | | 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 | |
| 2 |
| |
| | 2008 | [Khuller, Samir]
Mestre, Julián | | An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610 | Proceedings Article | |
| | 2007 | [Khuller, Samir]
[Malekian, Azarakhsh]
Mestre, Julián | | To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545 | Proceedings Article | |
| 1 |
| Khuller, Samir (ed.) |
| |
| | 2000 | Polzin, Tobias
[Vahdati Daneshmand, Siavash] | | Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225 | Proceedings Article | |
| 1 |
| Kim, Eun Jung |
| |
| | 2012 | [Kim, Eun Jung]
[Paul, Christophe]
Philip, Geevarghese | | 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 | |
| 1 |
| Kim, Young-Kuk (ed.) |
| |
| | 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article | |
| 4 |
| Kirchner, Claude (ed.) |
| |
| | 2010 | [Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article | |
| | 2010 | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings Article | |
| | 2010 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | 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 | |
| | 2010 | Kratsch, Stefan
Wahlström, Magnus | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | |
| 1 |
| |
| | 2003 | Kettner, Lutz
[Kirkpatrick, David]
[Mantler, Andrea]
[Snoeyink, Jack]
[Speckmann, Bettina]
[Takeuchi, Fumihiko] | | Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12 | Journal Article | |
| 1 |
| |
| | 1996 | [Kirousis, Lefteris]
Spirakis, Paul G.
Tsigas, Philippas | | Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53 | Journal Article | |
| 1 |
| |
| | 2011 | Kötzing, Timo | | Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article | |
| 1 |
| |
| | 2006 | Elbassioni, Khaled M. | | Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434 | Proceedings Article | |
| 1 |
| |
| | 1994 | Klär, Gerhard | | Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2004 | Klauk, Mathias | | Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes | Thesis - Masters thesis | |
| 13 |
| |
| | 2012 | [Canzar, Stefan]
[El-Kebir, Mohammed]
[Pool, Rene]
Elbassioni, Khaled
[Malde, Alpeshkumar K.]
[Mark, Alan E.]
[Geerke, Daan P.]
[Stougie, Leen]
[Klau, Gunnar W.] | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article | |
| | 2011 | [Canzar, Stefan]
Elbassioni, Khaled
[Klau, Gunnar W.]
[Mestre, Julian] | | On Tree-Constrained Matchings and Generalizations | Unpublished/Draft | |
| | 2011 | [Canzar,Stefan]
Elbassioni, Khaled
[Klau, Gunnar W.]
[Mestre, Julian] | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article | |
| | 2003 | Klau, Gunnar W.
Mutzel, Petra | | 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 | |
| | 2002 | Klau, Gunnar W. | | A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2001 | [Klau, Gunnar W.]
Klein, Karsten
[Mutzel, Petra] | | An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51 | Proceedings Article | |
| | 2001 | [Eiglsperger, Markus]
Fekete, Sandor P.
Klau, Gunnar W. | | Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171 | Part of a Book | |
| | 2000 | Klau, Gunnar W.
Mutzel, Petra | | 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 | |
| | 1999 | Klau, Gunnar W.
Mutzel, Petra | | Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37 | Proceedings Article | |
| | 1999 | Klau, Gunnar W.
Mutzel, Petra | | 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 | |
| | 1998 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian] | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Proceedings Article | |
| | 1998 | Klau, Gunnar W. | | Visuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales Zeichnen | Miscellaneous | |
| | 1997 | Klau, Gunnar W. | | Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 2013 | [Chen, Xujin]
[Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob | | Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19 | Journal Article | |
| | 2009 | [Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob | | Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | Proceedings Article | |
| | 2009 | [Epstein, Leah]
[Kleiman, Elena]
Mestre, Julian | | Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78 | Proceedings Article | |
| 1 |
| |
| | 2009 | Chan, T-H. Hubert
[Dhamdhere, Kedar]
[Gupta, Anupam]
[Kleinberg, Jon]
[Slivkins, Aleksandrs] | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | Journal Article | |
| 19 |
| |
| | 2012 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | Journal Article | |
| | 2011 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691 | Journal Article | |
| | 2009 | [Brockhoff, Dimo]
[Friedrich, Tobias]
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart] | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | Journal Article | |
| | 2008 | Doerr, Benjamin
[Jansen, Thomas]
[Klein, Christian] | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article | |
| | 2008 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Proceedings Article | |
| | 2008 | Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article | |
| | 2007 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | 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 | |
| | 2007 | [Brockhoff, Dimo]
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart] | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | Proceedings Article | |
| | 2007 | Doerr, Benjamin
Klein, Christian
[Storch, Tobias] | | Faster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250 | Proceedings Article | |
| | 2007 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | Journal Article | |
| | 2006 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | Controlled Perturbation for Delaunay Triangulations | Report | |
| | 2006 | Doerr, Benjamin
Klein, Christian | | Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40 | Electronic Journal Article | |
| | 2006 | Funke, Stefan
Klein, Christian | | 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 | |
| | 2006 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 | Proceedings Article | |
| | 2006 | Doerr, Benjamin
Klein, Christian | | Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211 | Proceedings Article | |
| | 2005 | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | Proceedings Article | |
| | 2005 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 | Proceedings Article | |
| | 2004 | Klein, Christian | | A Fast Root Checking Algorithm | Report | |
| | 2004 | Klein, Christian | | Controlled Perturbation for Voronoi Diagrams
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| |
| | 2001 | [Klau, Gunnar W.]
Klein, Karsten
[Mutzel, Petra] | | An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51 | Proceedings Article | |
| | 2000 | Klein, Karsten | | Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes | Thesis - Masters thesis | |
| 5 |
| Klein, Rolf |
| |
| | 2010 | [Giannopoulos, Panos]
[Klein, Rolf]
Kutz, Martin
[Marx, Daniel] | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | Journal Article | |
| | 2007 | [Klein, Rolf]
Kutz, Martin | | Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | Proceedings Article | |
| | 2006 | [Klein, Rolf]
Kutz, Martin | | 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 | |
| | 1993 | Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan | | Randomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184 | Journal Article | |
| | 1992 | Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan | | Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308 | Part of a Book | |
| 1 |
| Klein, Rolf (ed.) |
| |
| | 2003 | Mehlhorn, Kurt | | 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 | |
| 2 |
| Klein, R. |
| |
| | 1990 | Klein, R.
Mehlhorn, Kurt
Meiser, Stefan | | On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 | Proceedings Article | |
| | 1989 | [Klein, R.]
Mehlhorn, Kurt
[Meiser, Stefan] | | On the construction of abstract Voronoi diagrams, II. | Report | |
| 1 |
| |
| | 2013 | [Harks, Tobias]
Hoefer, Martin
[Klimm, Max]
[Skopalik, Alexander] | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | Journal Article | |
| 1 |
| |
| | 1998 | [Bodlaender, Hans L.]
[Deogun, Jitender S.]
Jansen, Klaus
[Kloks, Ton]
[Kratsch, Dieter]
[Müller, Haiko]
[Tuza, Zsolt] | | Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181 | Journal Article | |
| 2 |
| |
| | 2012 | [Giannopoulos, Panos]
[Knauer, Christian]
Wahlström, Magnus
[Werner, Daniel] | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | Journal Article | |
| | 2012 | [Knauer, Christian]
[Schlipf, Lena]
Schmidt, Jens M.
[Tiwary, Hans Raj] | | Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85 | Journal Article | |
| 1 |
| Knight, Peter |
| |
| | 1999 | [Rathe, Ulrich]
Sanders, Peter
[Knight, Peter] | | A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534 | Journal Article | |
| 1 |
| Knowles, Joshua D. (ed.) |
| |
| | 2009 | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| 1 |
| Kobayashi, Naoki (ed.) |
| |
| | 2015 | Bei, Xiaohui | | Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142 | Proceedings Article | |
| 1 |
| Kobbelt, Leif (ed.) |
| |
| | 2005 | Hachenberger, Peter
Kettner, Lutz | | 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 | |
| 7 |
| Kobel, Alexander |
| |
| | 2013 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | Journal Article | |
| | 2013 | Kobel, Alexander
Sagraloff, Michael | | Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17 | Electronic Journal Article | |
| | 2012 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46 | Electronic Journal Article | |
| | 2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Electronic Journal Article | |
| | 2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article | |
| | 2011 | Kobel, Alexander | | Certified numerical root finding
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2008 | Kobel, Alexander | | Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 1 |
| Koch, Gunter |
| |
| | 1998 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian] | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Proceedings Article | |
| 1 |
| Koch, Thorsten |
| |
| | 2008 | [Froyland, Gary]
[Koch, Thorsten]
Megow, Nicole
[Duane, Emily]
[Wren, Howard] | | Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75 | Journal Article | |
| 1 |
| Kociumaka, Tomasz |
| |
| | 2014 | [Babenko, Maxim A.]
[Gawrychowski, Pawel]
[Kociumaka, Tomasz]
[Starikovskaya, Tatiana A.] | | 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 | |
| 1 |
| Kodric, Bojana |
| |
| | 2013 | Doerr, Benjamin
Kodric, Bojana
Voigt, Marco | | Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439 | Proceedings Article | |
| 1 |
| Kogan, Kirill |
| |
| | 2005 | Kesselman, Alexander
[Kogan, Kirill] | | Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844 | Proceedings Article | |
| 2 |
| Koga, Hisashi |
| |
| | 1998 | Albers, Susanne
[Koga, Hisashi] | | New on-line algorithms for the page replication problem
In: Journal of Algorithms [27], 75-96 | Journal Article | |
| | 1995 | Albers, Susanne
[Koga, Hisashi] | | Page migration with limited local memory capacity
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 412-158 | Proceedings Article | |
| 7 |
| |
| | 2002 | Althaus, Ernst
[Kohlbacher, Oliver]
[Lenhof, Hans-Peter]
Müller, Peter | | A combinatorial approach to protein docking with flexible side chains
In: Journal of Computational Biology [9], 597-612 | Journal Article | |
| | 2000 | Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter | | A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24 | Proceedings Article | |
| | 2000 | Kohlbacher, Oliver
Lenhof, Hans-Peter | | BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824 | Journal Article | |
| | 2000 | [Neumann, Dirk]
Kohlbacher, Oliver
[Haltner, Eleonore]
Lenhof, Hans-Peter
[Lehr, Claus-Michael] | | Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233 | Proceedings Article | |
| | 1999 | Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter | | BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344 | Proceedings Article | |
| | 1999 | Kohlbacher, Oliver
Lenhof, Hans-Peter | | Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92 | Proceedings Article | |
| | 1998 | [Neumann, Dirk]
[Haltner, Elleonore]
[Lehr, Claus-Michael]
Kohlbacher, Oliver
Lenhof, Hans-Peter | | Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549 | Proceedings Article | |
| 1 |
| |
| | 2004 | Baumann, Nadine
[Köhler, Ekkehard] | | Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610 | Proceedings Article | |
| 1 |
| Kolaitis, Photokion (ed.) |
| |
| | 1997 | Gunopulos, Dimitrios
Mannila, Heikki
Saluja, Sanjeev | | Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229 | Proceedings Article | |
| 1 |
| |
| | 1999 | Koldehofe, Boris | | Animation and Analysis of Distributed Algorithms
Universität des Saarlandes | Thesis - Masters thesis | |
| 4 |
| |
| | 2004 | Althaus, Ernst
[Karamanis, Nikiforos]
[Koller, Alexander] | | Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406 | Proceedings Article | |
| | 2003 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219 | Journal Article | |
| | 2001 | Althaus, Ernst
[Duchier, Denys]
[Koller, Alexander]
Mehlhorn, Kurt
[Niehren, Joachim]
Thiel, Sven | | An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824 | Proceedings Article | |
| | 2000 | Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim | | 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 | |
| 1 |
| Kollias, Konstantinos |
| |
| | 2013 | Kollias, Konstantinos | | Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440 | Electronic Journal Article | |
| 2 |
| Kolman, Petr (ed.) |
| |
| | 2011 | Hermelin, Danny
[Huang, Chien-Chung]
[Kratsch, Stefan]
Wahlström, Magnus | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | Proceedings Article | |
| | 2010 | [Kao, Ming-Yang]
[Leung, Henry C. M.]
Sun, He
[Zhang, Yong] | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article | |
| 7 |
| |
| | 2010 | Doerr, Benjamin
[Goldberg, Leslie Ann] | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Goldberg, Leslie Ann] | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Proceedings Article | |
| | 2010 | Kratsch, Stefan
[Lehre, Per Kristian]
[Neumann, Frank]
[Oliveto, Pietro Simone] | | 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 | |
| | 2010 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine] | | 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 | |
| | 2010 | [Böttcher, Süntje]
Doerr, Benjamin
Neumann, Frank | | Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10 | Proceedings Article | |
| | 2010 | Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine] | | Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | Proceedings Article | |
| | 2010 | [Bringmann, Karl]
Friedrich, Tobias | | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | Proceedings Article | |
| 4 |
| |
| | 2005 | Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article | |
| | 2003 | Eisenbrand, Friedrich
Funke, Stefan
[Garg, Naveen]
[Könemann, Jochen] | | 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 | |
| | 1997 | Könemann, Jochen | | Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes | Thesis - Masters thesis | |
| | 1995 | Burnikel, Christoph
Könemann, Jochen
Mehlhorn, Kurt
[Näher, Stefan]
Schirra, Stefan
Uhrig, Christian | | Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19 | Proceedings Article | |
| 1 |
| Kong, T. Yung (ed.) |
| |
| | 2002 | Ray, Rahul
[Smid, MIchiel]
[Lange, Katharina]
[Wendt, Ulrich] | | Computing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152 | Proceedings Article | |
| 1 |
| Konidaris, G. |
| |
| | 2004 | Konidaris, G.
Mehlhorn, Kurt
Shell, D.A. | | An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons | Unpublished/Draft | |
| 1 |
| König, Felix |
| |
| | 2010 | [Günther, Elisabeth]
[König, Felix]
Megow, Nicole | | 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 | |
| 1 |
| Konjevod, Goran |
| |
| | 2000 | Garg, Naveen
[Konjevod, Goran]
[Ravi, R.] | | Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84 | Journal Article | |
| 3 |
| Kontogiannis, Spyros |
| |
| | 2002 | Kontogiannis, Spyros | | 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 | |
| | 2002 | Fotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.] | | 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 | |
| | 2000 | Kontogiannis, Spyros
[Pantziou, Grammati E.]
[Spirakis, Paul G.]
[Yung, Moti] | | Robust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464 | Journal Article | |
| 1 |
| Konwar, Kishori |
| |
| | 2004 | [Konwar, Kishori]
Kowalski, Dariusz
[Shvartsman, Alexander] | | The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324 | Proceedings Article | |
| 1 |
| Koppula, Venkata |
| |
| | 2010 | [Ambalath, Abhimanyu M.]
[Balasundaram, Radheshyam]
[H., Chintan Rao]
[Koppula, Venkata]
[Misra, Neeldhara]
Philip, Geevarghese
[Ramanujan, M. S.] | | On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25 | Proceedings Article | |
| 1 |
| Koracin, Darko (ed.) |
| |
| | 2009 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article | |
| 1 |
| Korst, Jan |
| |
| | 2000 | Sanders, Peter
[Egner, Sebastian]
[Korst, Jan] | | Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858 | Proceedings Article | |
| 2 |
| Korteweg, Peter |
| |
| | 2011 | Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen] | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | Journal Article | |
| | 2011 | Bonifaci, Vincenzo
[Korteweg, Peter]
[Marchetti-Spaccamela, Alberto]
[Stougie, Leen] | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Journal Article | |
| 1 |
| |
| | 1990 | Kaufmann, Morgan
Mehlhorn, Kurt | | Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184 | Part of a Book | |
| 1 |
| |
| | 2010 | [Hajiaghayi, MohammadTaghi]
[Khandekar, Rohit]
[Kortsarz, Guy]
Mestre, Julian | | The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231 | Proceedings Article | |
| 2 |
| |
| | 1992 | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article | |
| | 1992 | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | | Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93 | Proceedings Article | |
| 1 |
| Kosch, Harald (ed.) |
| |
| | 2003 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | | An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | Proceedings Article | |
| 29 |
| Kötzing, Timo |
| |
| | 2014 | Croitoru, Cosmina
Kötzing, Timo | | A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45 | Proceedings Article | |
| | 2013 | Doerr, Benjamin
Kötzing, Timo
[Lengler, Johannes]
Winzen, Carola | | Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | Journal Article | |
| | 2013 | [Case, John]
Kötzing, Timo | | Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123 | Electronic Journal Article | |
| | 2013 | Doerr, Benjamin
[Johannsen, Daniel]
Kötzing, Timo
[Neumann, Frank]
[Theile, Madeleine] | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article | |
| | 2012 | Kötzing, Timo
[Molter, Hendrik] | | ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | Proceedings Article | |
| | 2012 | Doerr, Benjamin
[Hota, Ashish]
Kötzing, Timo | | 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 | |
| | 2012 | [Case, John]
Kötzing, Timo | | Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | Journal Article | |
| | 2012 | [Croitoru, Cosmina]
Kötzing, Timo | | Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | Proceedings Article | |
| | 2012 | Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch | | Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | Proceedings Article | |
| | 2012 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch
Baumbach, Jan | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article | |
| | 2012 | [Jain, Sanjay]
Kötzing, Timo
[Stephan, Frank] | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article | |
| | 2012 | [Heinz, Jeffrey]
[Kasprzik, Anna]
Kötzing, Timo | | Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127 | Journal Article | |
| | 2012 | [Case, John]
Kötzing, Timo | | Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73 | Journal Article | |
| | 2012 | Kötzing, Timo
[Sutton, Andrew M.]
[Neumann, Frank]
[O'Reilly, Una-May] | | 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 | |
| | 2012 | Kötzing, Timo
[Neumann, Frank]
[Röglin, Heiko]
[Witt, Carsten] | | Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21 | Journal Article | |
| | 2011 | Doerr, Benjamin
[Lengler, Johannes]
Kötzing, Timo
Winzen, Carola | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
[Lehre, Per Christian]
Wagner, Markus
Winzen, Carola | | 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 | |
| | 2011 | Kötzing, Timo
[Sudholt, Dirk]
[Theile, Madeleine] | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article | |
| | 2011 | Kötzing, Timo | | Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article | |
| | 2011 | [Case, John]
Kötzing, Timo | | Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331 | Electronic Proceedings Article | |
| | 2011 | Kötzing, Timo
[Neumann, Frank]
Spöhel, Reto | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article | |
| | 2011 | Kötzing, Timo
[Neumann, Frank]
[Sudholt, Dirk]
[Wagner, Markus] | | 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 | |
| | 2011 | Doerr, Benjamin
Kötzing, Timo
Winzen, Carola | | Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article | |
| | 2010 | Kötzing, Timo
[Lehre, Per Kristian]
Neumann, Frank
[Oliveto, Pietro S.] | | 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 | |
| | 2010 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine] | | 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 | |
| | 2010 | [Case, John]
Kötzing, Timo | | 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 | |
| | 2010 | [Kasprzik, Anna]
Kötzing, Timo | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article | |
| | 2010 | [Case, John]
Kötzing, Timo | | Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Proceedings Article | |
| | 2010 | Kötzing, Timo
Neumann, Frank
[Röglin, Heiko]
[Witt, Carsten] | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article | |
| 2 |
| Koubek, Vaclav (ed.) |
| |
| | 2004 | Baumann, Nadine
[Köhler, Ekkehard] | | Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | 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 | |
| 8 |
| |
| | 2010 | Christodoulou, George
[Koutsoupias, Elias]
[Kovács, Annamária] | | Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18 | Journal Article | |
| | 2009 | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | | A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | Journal Article | |
| | 2009 | Christodoulou, George
[Koutsoupias, Elias]
[Nanavati, Akash] | | Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | Journal Article | |
| | 2009 | Christodoulou, George
[Koutsoupias, Elias] | | Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | Journal Article | |
| | 2008 | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | | A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307 | Proceedings Article | |
| | 2007 | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | | A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170 | Proceedings Article | |
| | 2007 | Christodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article | |
| | 2002 | Fotakis, Dimitris
Kontogiannis, Spyros
[Koutsoupias, Elias]
[Mavronicolas, Marios]
[Spirakis, Paul G.] | | 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 | |
| 1 |
| Koutsoupias, Elias (ed.) |
| |
| | 2014 | Gawrychowski, Pawel
[Mozes, Shay]
[Weimann, Oren] | | 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 | |
| 1 |
| Koutsoupia, Elias (ed.) |
| |
| | 2014 | Jez, Artur | | Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article | |
| 11 |
| Kovacs, Annamaria |
| |
| | 2013 | [Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob | | A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | Journal Article | |
| | 2010 | Christodoulou, George
[Kovács, Annamária] | | A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016 | Proceedings Article | |
| | 2010 | [Christodoulou, George]
[Kovacs, Annamaria]
van Stee, Rob | | A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193 | Proceedings Article | |
| | 2010 | Christodoulou, George
[Koutsoupias, Elias]
[Kovács, Annamária] | | Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18 | Journal Article | |
| | 2008 | Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael] | | Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | Proceedings Article | |
| | 2007 | Kovács, Annamária | | Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | Christodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article | |
| | 2006 | Kovács, Annamária | | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198 | Proceedings Article | |
| | 2005 | Kovács, Annamária | | Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627 | Proceedings Article | |
| | 2005 | Kovács, Annamária | | Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852 | Proceedings Article | |
| | 2004 | Kovács, Annamária | | Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80 | Proceedings Article | |
| 1 |
| Kovacs, Tim (ed.) |
| |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 7 |
| Kowalik, Lukasz |
| |
| | 2009 | Kowalik, Lukasz | | Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742 | Journal Article | |
| | 2008 | Cole, Richard
Kowalik, Lukasz | | New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368 | Journal Article | |
| | 2007 | [Cole, Richard]
Kowalik, Lukasz
[Skrekovski, Riste] | | A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | Journal Article | |
| | 2007 | Kowalik, Lukasz | | Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | Journal Article | |
| | 2006 | [Chrobak, Marek]
[Dürr, Christoph]
[Jawor, Wojciech]
Kowalik, Lukasz
[Kurowski, Maciej] | | A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73 | Journal Article | |
| | 2006 | Kowalik, Lukasz | | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566 | Proceedings Article | |
| | 2006 | Kowalik, Lukasz | | Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101 | Proceedings Article | |
| 1 |
| Kowalski, Darek (ed.) |
| |
| | 2012 | [Akbari, Hoda]
[Berenbrink, Petra]
Sauerwald, Thomas | | A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 | Proceedings Article | |
| 22 |
| Kowalski, Dariusz |
| |
| | 2006 | [Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej] | | Complexity of searching for a black hole | Unpublished/Draft | |
| | 2006 | [Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej] | | Deterministic rendezvous in graphs | Unpublished/Draft | |
| | 2006 | [Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej] | | Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | Journal Article | |
| | 2005 | [Chlebus, Bogdan S.]
Kowalski, Dariusz | | Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739 | Proceedings Article | |
| | 2005 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | Journal Article | |
| | 2005 | Kesselman, Alexander
Kowalski, Dariusz
[Segal, Michael] | | 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 | |
| | 2005 | Kowalski, Dariusz
[Musial, Peter M.]
[Shvartsman, Alexander] | | Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58 | Proceedings Article | |
| | 2005 | Kesselman, Alexander
Kowalski, Dariusz | | 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 | |
| | 2005 | [Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej] | | Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80 | Proceedings Article | |
| | 2005 | Kowalski, Dariusz
[Pelc, Andrzej] | | Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371 | Journal Article | |
| | 2004 | [Chlebus, Bogdan S.]
Kowalski, Dariusz | | A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274 | Proceedings Article | |
| | 2004 | Kowalski, Dariusz
[Pelc, Andrzej] | | 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 | |
| | 2004 | [Chlebus, Bogdan S.]
Kowalski, Dariusz
[Shvartsman, Alex] | | 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 | |
| | 2004 | [Fraigniaud, Pierre]
[Gasieniec, Leszek]
Kowalski, Dariusz
[Pelc, Andrzej] | | Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151 | Proceedings Article | |
| | 2004 | Kowalski, Dariusz
[Pelc, Andrzej] | | Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656 | Proceedings Article | |
| | 2004 | [Chlebus, Bogdan S.]
Kowalski, Dariusz | | Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41 | Journal Article | |
| | 2004 | [Konwar, Kishori]
Kowalski, Dariusz
[Shvartsman, Alexander] | | The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324 | Proceedings Article | |
| | 2004 | [Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz | | 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 | |
| | 2004 | Kowalski, Dariusz
[Pelc, Andrzej] | | Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891 | Journal Article | |
| | 2004 | Kowalski, Dariusz
[Shvartsman, Alex] | | 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 | |
| | 2003 | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238 | Proceedings Article | |
| | 2003 | Kowalski, Dariusz
[Pelc, Andrzej] | | 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 | |
| 1 |
| |
| | 2007 | [Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz R. | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | Journal Article | |
| 1 |
| |
| | 1996 | [Chlebus, Bogdan S.]
[Czumaj, Artur]
Gasieniec, Leszek
[Kowaluk, Miroslaw]
[Plandowski, Wojciech] | | Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266 | Proceedings Article | |
| 1 |
| |
| | 1998 | Sibeyn, Jop F.
[Grammatikakis, M.D.]
[Hsu, D.F.]
[Kraetzl, M.] | | Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132 | Journal Article | |
| 1 |
| |
| | 1996 | Gasieniec, Leszek
[Kranakis, Evangelos]
[Krizanc, Danny]
[Pelc, Andrzej] | | 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 | |
| 3 |
| Kranakis, Evangelos (ed.) |
| |
| | 2007 | Funke, Stefan
Rauf, Imran | | 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 | |
| | 2004 | Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
[Segal, Michael] | | Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 | Proceedings Article | |
| | 1996 | [Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.] | | Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154 | Proceedings Article | |
| 3 |
| |
| | 2006 | [Krandick, Werner]
Mehlhorn, Kurt | | New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66 | Journal Article | |
| | 2005 | Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Proceedings Article | |
| | 2004 | [Krandick, Werner]
Mehlhorn, Kurt | | New Bounds for the Descartes Method | Report | |
| 7 |
| |
| | 2011 | Doerr, Benjamin
[Lengler, Johannes]
Kötzing, Timo
Winzen, Carola | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article | |
| | 2011 | Bringmann, Karl
Friedrich, Tobias | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article | |
| | 2011 | Doerr, Benjamin | | Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320 | Proceedings Article | |
| | 2011 | Kötzing, Timo
[Sudholt, Dirk]
[Theile, Madeleine] | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article | |
| | 2011 | Kötzing, Timo
[Neumann, Frank]
Spöhel, Reto | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
[Fouz, Mahmoud]
[Witt, Carsten] | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | Proceedings Article | |
| | 2011 | Doerr, Benjamin
Kötzing, Timo
Winzen, Carola | | Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article | |
| 1 |
| |
| | 2010 | [Kao, Ming-Yang]
[Leung, Henry C. M.]
Sun, He
[Zhang, Yong] | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article | |
| 7 |
| |
| | 2011 | Hermelin, Danny
[Huang, Chien-Chung]
[Kratsch, Stefan]
Wahlström, Magnus | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | Proceedings Article | |
| | 2007 | [Caragiannis, Ioannis]
Fishkin, Aleksei V.
[Kaklamanis, Christos]
[Papaioannou, Evi] | | Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 | Proceedings Article | |
| | 2004 | Baumann, Nadine
[Köhler, Ekkehard] | | Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610 | Proceedings Article | |
| | 2004 | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Khachiyan, Leonid]
[Makino, Kazuhisa] | | 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 | |
| | 2000 | Mutzel, Petra
Ziegler, Thomas | | The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185 | Proceedings Article | |
| | 1999 | Klau, Gunnar W.
Mutzel, Petra | | Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37 | Proceedings Article | |
| | 1999 | [Brandenburg, Franz J.]
[Schreiber, Falk]
[Jünger, Michael]
[Marks, Joe]
Mutzel, Petra | | Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409 | Proceedings Article | |
| 4 |
| |
| | 2006 | [Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.] | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353 | Journal Article | |
| | 2005 | Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P. | | Certifying Algorithms (draft) | Unpublished/Draft | |
| | 2003 | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | | 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 | |
| | 1998 | [Bodlaender, Hans L.]
[Deogun, Jitender S.]
Jansen, Klaus
[Kloks, Ton]
[Kratsch, Dieter]
[Müller, Haiko]
[Tuza, Zsolt] | | Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181 | Journal Article | |
| 14 |
| Kratsch, Stefan |
| |
| | 2012 | [Cygan, Marek]
[Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus | | Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 | Proceedings Article | |
| | 2012 | [Kratsch, Stefan]
Wahlström, Magnus | | 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 | |
| | 2012 | [Kratsch, Stefan]
[Pilipczuk, Marcin]
[Pilipczuk, Michał]
Wahlström, Magnus | | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 | Proceedings Article | |
| | 2012 | [Kratsch, Stefan]
Wahlström, Magnus | | 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 | |
| | 2011 | Hermelin, Danny
[Huang, Chien-Chung]
[Kratsch, Stefan]
Wahlström, Magnus | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | Proceedings Article | |
| | 2010 | [Jansen, Klaus]
Kratsch, Stefan
[Marx, Dániel]
[Schlotter, Ildikó] | | 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 | |
| | 2010 | Kratsch, Stefan
[Lehre, Per Kristian]
[Neumann, Frank]
[Oliveto, Pietro Simone] | | 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 | |
| | 2010 | Kratsch, Stefan
Schweitzer, Pascal | | 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 | |
| | 2010 | Kratsch, Stefan | | Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2010 | Kratsch, Stefan
[Marx, Dániel]
Wahlström, Magnus | | 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 | |
| | 2010 | Kratsch, Stefan
Wahlström, Magnus | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | |
| | 2009 | Kratsch, Stefan
Neumann, Frank | | 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 | |
| | 2009 | Kratsch, Stefan | | 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 | |
| | 2009 | Kratsch, Stefan
Wahlström, Magnus | | Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article | |
| 1 |
| Krattenthaler, Christian (ed.) |
| |
| | 2009 | Panagiotou, Konstantinos | | Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article | |
| 1 |
| Krebs, Hans-Joachim (ed.) |
| |
| | 2003 | Klau, Gunnar W.
Mutzel, Petra | | 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 | |
| 2 |
| |
| | 1989 | Mehlhorn, Kurt
Näher, S | | A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | Proceedings Article | |
| | 1989 | Mehlhorn, Kurt
Näher, Stefan | | LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | Proceedings Article | |
| 1 |
| Kreveld, Marc van |
| |
| | 1995 | [Berg, Marc de]
[Kreveld, Marc van]
Schirra, Stefan | | A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88 | Proceedings Article | |
| 1 |
| Krick, Christof |
| |
| | 2003 | [Krick, Christof]
[Meyer auf der Heide, Friedhelm]
[Räcke, Harald]
Vöcking, Berthold
[Westermann, Matthias] | | Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245 | Journal Article | |
| 2 |
| Krishnan, P. |
| |
| | 1995 | [Awerbuch, Baruch]
[Azar, Yossi]
Grove, Edward
[Kao, Ming-Yang]
Krishnan, P.
[Vitter, Jeffrey Scott] | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | Proceedings Article | |
| | 1995 | Grove, Edward
[Kao, Ming-Yang]
[Krishnan, P.]
[Vitter, Jeffrey Scott] | | Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205 | Proceedings Article | |
| 2 |
| |
| | 1996 | Preetham, A. J.
[Krithivasan, Kamala]
[Rangan, C. Pandu]
Sibeyn, Jop F. | | Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, - | Proceedings Article | |
| | 1996 | [Krithivasan, Kamala]
[Rema, Anna]
Schirra, Stefan
[Vijaykumar, P.I.] | | Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154 | Proceedings Article | |
| 2 |
| Kritzer, Peter |
| |
| | 2008 | Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Friedrich] | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | Journal Article | |
| | 2008 | Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Peter] | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | Journal Article | |
| 1 |
| |
| | 2012 | [Krivelevich, Michael]
Spöhel, Reto | | Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | Journal Article | |
| 1 |
| |
| | 1996 | Gasieniec, Leszek
[Kranakis, Evangelos]
[Krizanc, Danny]
[Pelc, Andrzej] | | 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 | |
| 3 |
| |
| | 1998 | Rüb, Christine | | On Batcher's Merge Sorts as Parallel Sorting Algorithms
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420 | Proceedings Article | |
| | 1998 | Hagerup, Torben | | 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 | |
| | 1998 | Jansen, Klaus | | 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 | |
| 1 |
| |
| | 2012 | Friedrich, Tobias
[Kroeger, Trent]
[Neumann, Frank] | | Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 | Electronic Journal Article | |
| 1 |
| |
| | 2008 | [Kroeske, Jense]
[Ghandar, Adam]
[Michalewicz, Zbigniew]
Neumann, Frank | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article | |
| 3 |
| |
| | 2012 | Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch | | Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | Proceedings Article | |
| | 2012 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
[Krohmer, Anton]
Müller, Joachim
Pauling, Josch
Baumbach, Jan | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article | |
| | 2012 | Krohmer, Anton | | Finding cliques in scale-free networks
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 2011 | Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julian
[Severdija, Domagoj] | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463 | Journal Article | |
| | 2009 | Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj] | | Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371 | Electronic Proceedings Article | |
| | 2009 | Elbassioni, Khaled M.
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj] | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13 | Electronic Journal Article | |
| 1 |
| |
| | 2013 | [Fekete, Sándor P.]
[Friedrichs, Stephan]
[Kröller, Alexander]
[Schmidt, Christiane] | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | Proceedings Article | |
| 1 |
| |
| | 1998 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
[Näher, Stefan]
[Alberts, David]
[Ambras, Dirk]
[Koch, Gunter]
[Jünger, Michael]
[Buchheim, Christoph]
[Leipert, Sebastian] | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Proceedings Article | |
| 1 |
| |
| | 2009 | [Krumke, Sven]
van Stee, Rob
[Westphal, Stefan] | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book | |
| 1 |
| |
| | 2008 | [Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan] | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | Journal Article | |
| 15 |
| |
| | 2006 | Beier, René
[Czumaj, Artur]
[Krysta, Piotr]
[Vöcking, Berthold] | | Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | Journal Article | |
| | 2004 | Beier, Rene
[Krysta, Piotr]
[Czumaj, Artur]
[Vöcking, Berthold] | | Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748 | Proceedings Article | |
| | 2003 | [Agarwal, Amit]
[Agarwal, Tarun]
[Chopra, Sumit]
[Feldmann, Anja]
[Kammenhuber, Nils]
Krysta, Piotr
[Vöcking, Berthold] | | An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235 | Proceedings Article | |
| | 2003 | Krysta, Piotr | | Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288 | Journal Article | |
| | 2003 | Berman, Piotr
Krysta, Piotr | | Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201 | Proceedings Article | |
| | 2003 | Krysta, Piotr
Sanders, Peter
Vöcking, Berthold | | 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 | |
| | 2002 | Csaba, Bela
Krysta, Piotr
[Karpinski, Marek] | | 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 | |
| | 2002 | [Czumaj, Artur]
Krysta, Piotr
Vöcking, Berthold | | Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296 | Proceedings Article | |
| | 2001 | Krysta, Piotr
Solis-Oba, Roberto | | Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247 | Journal Article | |
| | 2001 | Krysta, Piotr | | Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2001 | Krysta, Piotr
Kumar, V. S. Anil | | 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 | |
| | 1999 | Krysta, Piotr
Solis-Oba, Roberto | | Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 | Proceedings Article | |
| | 1999 | Krysta, Piotr
[Lorys, Krzysztof] | | Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413 | Proceedings Article | |
| | 1999 | Krysta, Piotr
[Pacholski, Leszek] | | The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219 | Journal Article | |
| | 1997 | Gasieniec, Leszek
Indyk, Piotr
Krysta, Piotr | | External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101 | Proceedings Article | |
| 1 |
| |
| | 1996 | Ksinsik, Patric | | Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| 1 |
| '{ |
| |
| 1 |
| |
| | 2010 | [Baruah, Sanjoy]
Bonifaci, Vincenzo
[D'Angelo, Gianlorenzo]
[Li, Haohan]
[Marchetti-Spaccamela, Alberto]
Megow, Nicole
[Stougie, Leen] | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article | |
| 2 |
| |
| | 2010 | Kratsch, Stefan
[Marx, Dániel]
Wahlström, Magnus | | 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 | |
| | 2007 | Mehlhorn, Kurt | | Minimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | Proceedings Article | |
| 1 |
| Kucera, Ludek |
| |
| | 1993 | Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E. | | Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322 | Proceedings Article | |
| 2 |
| Kucera, Ludek (ed.) |
| |
| | 2007 | Mehlhorn, Kurt | | Minimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | Proceedings Article | |
| | 2002 | Fotakis, Dimitris
[Nikoletseas, Sotiris]
[Papadopoulou, Vicky]
[Spirakis, Paul G.] | | 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 | |
| 1 |
| |
| | 2013 | Gawrychowski, Pawel
[Kucherov, Gregory]
[Nekrich, Yakov]
[Starikovskaya, Tatiana] | | Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), | Proceedings Article | |
| 4 |
| |
| | 2009 | [Cooley, Oliver]
[Fountoulakis, Nikolaos]
[Kühn, Daniela]
[Osthus, Deryk] | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | Journal Article | |
| | 2009 | Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk] | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | Journal Article | |
| | 2008 | [Cooley, Oliver]
Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk] | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | Journal Article | |
| | 2008 | Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk] | | The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141 | Journal Article | |
| 2 |
| Kuhn, Fabian |
| |
| | 2010 | [Kuhn, Fabian]
Panagiotou, Konstantinos
[Spencer, Joel]
[Steger, Angelika] | | 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 | |
| | 2007 | Funke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael] | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | Journal Article | |
| 1 |
| |
| | 2014 | [Friedrichs, Stephan]
[Kulau, Ulf]
[Wolf, Lars] | | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | Proceedings Article | |
| 1 |
| |
| | 2011 | Doerr, Benjamin
Winzen, Carola | | 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 | |
| 2 |
| Kulikov, Alexander S. (ed.) |
| |
| | 2014 | [Babenko, Maxim A.]
[Gawrychowski, Pawel]
[Kociumaka, Tomasz]
[Starikovskaya, Tatiana A.] | | 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 | |
| | 2014 | Gawrychowski, Pawel
[Uznanski, Przemyslaw] | | 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 | |
| 1 |
| Kulikov, Alexander (ed.) |
| |
| | 2014 | Jez, Artur | | A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 | Proceedings Article | |
| 1 |
| Kullmann, Oliver (ed.) |
| |
| | 2009 | Johannsen, Daniel
[Razgon, Igor]
Wahlström, Magnus | | 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 | |
| 4 |
| Kumar, Amit |
| |
| | 2013 | Anand, S
Bringmann, Karl
[Friedrich, Tobias]
[Garg, Naveen]
[Kumar, Amit] | | Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | Proceedings Article | |
| | 2012 | Elbassioni, Khaled
[Garg, Naveen]
[Gupta, Divya]
[Kumar, Amit]
[Narula, Vishal]
[Pal, Arindam] | | 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 | |
| | 2010 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Journal Article | |
| | 2008 | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees | Unpublished/Draft | |
| 1 |
| |
| | 2011 | [Fomin, Fedor V.]
Philip, Geevarghese
[Villanger, Yngve] | | 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 | |
| 1 |
| |
| | 2003 | [Cheng, Siu-Wing]
Funke, Stefan
[Golin, Mordecai J.]
[Kumar, Piyush]
[Poon, Sheung-Hung]
[Ramos, Edgar A.] | | Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429 | Proceedings Article | |
| 2 |
| |
| | 2008 | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| | 2007 | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 1 |
| Kumar, Vipin (ed.) |
| |
| | 2006 | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 | Proceedings Article | |
| 5 |
| Kumar, V. S. Anil |
| |
| | 2001 | Krysta, Piotr
Kumar, V. S. Anil | | 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 | |
| | 2001 | Kumar, V. S. Anil | | Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17 | Journal Article | |
| | 2000 | Kumar, V. S. Anil
[Arya, Sunil]
[Ramesh, Hariharan] | | Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635 | Proceedings Article | |
| | 1999 | Kumar, V. S. Anil
[Ramesh, Hariharan] | | 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 | |
| | 1999 | Kumar, V. S. Anil
[Ramesh, Hariharan] | | 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 | |
| 7 |
| Künnemann, Marvin |
| |
| | 2013 | [Curticapean, Radu]
Künnemann, Marvin | | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | Proceedings Article | |
