| # |  | Year | | Title | Type | |
|---|
| 1 |
![Hide details for Gawrychowski, Mozes, Weimann [Mozes, Weimann, Esparza, Fraigniaud, Husfeldt, Koutsoupias]](/intranet/ag1/ag1publ.nsf/$PlusMinus?OpenImageResource&ImgIndex=1) | Gawrychowski, Mozes, Weimann [Mozes, Weimann, Esparza, Fraigniaud, Husfeldt, Koutsoupias] |
| |
| | 2014 | | Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537 | Proceedings Article | |
| 1 |
| Gawrychowski, Straszak [Straszak, Cai, Cheng, Lam] |
| |
| | 2013 | | Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Proceedings Article | |
| 1 |
| Gawrychowski, Uznanski [Uznanski, Kulikov, Kuznetsov, Pevzner] |
| |
| | 2014 | | Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139 | Proceedings Article | |
| 2 |
| Geismann, Hemmer, Schömer [-] |
| |
| | 2001 | | Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273 | Proceedings Article | |
| | 2001 | | The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322 | Proceedings Article | |
| 1 |
| Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman, Fich] |
| |
| | 2003 | | Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238 | Proceedings Article | |
| 1 |
| Georgiou, Kowalski, Shvartsman [Georgiou, Shvartsman] |
| |
| | 2005 | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | Journal Article | |
| 1 |
| |
| | 2000 | | Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| |
| | 1996 | | Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61 | Proceedings Article | |
| 1 |
| |
| | 1996 | | Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282 | Journal Article | |
| 1 |
| Giakkoupis, Sauerwald [Giakkoupis, Rabani] |
| |
| | 2012 | | Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641 | Proceedings Article | |
| 1 |
| Giakkoupis, Sauerwald, Sun, Woelfel [Giakkoupis, Woelfel, Dürr, Wilke] |
| |
| | 2012 | | Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | Electronic Proceedings Article | |
| 1 |
| Giannopoulos, Klein, Kutz, Marx [Giannopoulos, Klein, Marx] |
| |
| | 2010 | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | Journal Article | |
| 1 |
| Giannopoulos, Knauer, Wahlström, Werner [Giannopoulos, Knauer, Werner] |
| |
| | 2012 | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | Journal Article | |
| 1 |
| Gidenstam, Papatriantafilou [Papatriantafilou, Tovar, Tsigas, Fouchal] |
| |
| | 2007 | | LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231 | Proceedings Article | |
| 1 |
| Gidenstam, Papatriantafilou, Sundell, Tsigas [Papatriantafilou, Sundell, Tsigas] |
| |
| | 2009 | | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Journal Article | |
| 2 |
| Gidenstam, Papatriantafilou, Tsigas [Papatriantafilou, Tsigas] |
| |
| | 2010 | | NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338 | Journal Article | |
| | 2009 | | NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35 | Electronic Journal Article | |
| 1 |
| Giesen [Dey, Goswami] |
| |
| | 2008 | | Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | Journal Article | |
| 1 |
| Giesen [John] |
| |
| | 2008 | | The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190 | Journal Article | |
| 1 |
| Giesen [Miklos, Pauly] |
| |
| | 2007 | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124 | Proceedings Article | |
| 1 |
| Giesen [Mueller, Schuberth, Zolliker, wang] |
| |
| | 2008 | | Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | Journal Article | |
| 1 |
| Giesen [Schuberth, , , ] |
| |
| | 2007 | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book | |
| 1 |
| Giesen, Manjunath [Giesen, Agarwal, Alt, Teillaud] |
| |
| | 2009 | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article | |
| 1 |
| Giesen, Mitsche, Schuberth [Mitsche, Schuberth, Kao, Li] |
| |
| | 2007 |  | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Proceedings Article | |
| 1 |
| Giesen, Schuberth, Simon, Zolliker, Zweifel [Schuberth, Simon, Zolliker, Zweifel] |
| |
| | 2007 | | Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410 | Journal Article | |
| 1 |
| Gnewuch, Wahlström, Winzen [Gnewuch] |
| |
| | 2012 | | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | Journal Article | |
| 1 |
| Goemans, Skutella [Goemans] |
| |
| | 2004 | | Cooperative facility location games
In: Journal of Algorithms [50], 194-214 | Journal Article | |
| 1 |
| Goesele, Kautz, Lang, Lensch, Seidel [-] |
| |
| | 2002 | | 7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping | Proceedings | |
| 1 |
| Goldberg, MacKenzie, Paterson, Srinivasan [Goldberg, MacKenzie, Paterson] |
| |
| | 2000 | | Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096 | Journal Article | |
| 2 |
| Golin, Raman, Schwarz, Smid [Golin, Raman] |
| |
| | 1998 | | Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072 | Journal Article | |
| | 1995 | | Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27 | Journal Article | |
| 1 |
| Golumbic, Mintz, Rotics [Golumbic, Mintz, Rotics] |
| |
| | 2006 | | Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477 | Journal Article | |
| 1 |
| Goodrich, Ramos [Goodrich] |
| |
| | 1997 | | Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420 | Journal Article | |
| 1 |
| Gotsman, Kaligosi, Mehlhorn, Michail, Pyrga [Gotsman] |
| |
| | 2007 | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | Journal Article | |
| 1 |
| Gotthilf, Hermelin, Landau, Lewenstein [Gotthilf, Hermelin, Landau, Lewenstein] |
| |
| | 2010 | | Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | Proceedings Article | |
| 1 |
| Govindarajan, Dietze, Agarwal, Clark [Dietze, Agarwal, Clark] |
| |
| | 2008 | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | Journal Article | |
| 1 |
| Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [-] |
| |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | Report | |
| 1 |
| Granados, Hachenberger, Hert, Kettner, Mehlhorn, Seel [Di Battista, Zwick] |
| |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | Proceedings Article | |
| 1 |
| Grigoriev, van Loon, Sitters, Uetz [Grigoriev, van Loon, Uetz, Fomin] |
| |
| | 2006 | | How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136 | Proceedings Article | |
| 1 |
| |
| | 1995 | | On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436 | Proceedings Article | |
| 1 |
| Grove, Kao, Krishnan, Vitter [Akl, Dehne, Kao, Krishnan, Sack, Santoro, Vitter] |
| |
| | 1995 | | Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205 | Proceedings Article | |
| 1 |
| Gugelmann, Spöhel [Gugelmann, Nešetřil, Győri, Sali] |
| |
| | 2011 | | On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 | Electronic Proceedings Article | |
| 1 |
| Guibas, Milosavljevic, Motskin [Motskin, Guibas] |
| |
| | 2010 | | Connected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 | Proceedings Article | |
| 1 |
| |
| | 1997 | | Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Gunopulos, Mannila, Saluja [Manila] |
| |
| | 1997 | | Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229 | Proceedings Article | |
| 1 |
| Günther, König, Megow [Günther, König, Bampis, Jansen] |
| |
| | 2010 | | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | Proceedings Article | |
| 1 |
| Günther, Maurer, Megow, Wiese [Günther, Maurer] |
| |
| | 2013 | | A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), | Proceedings Article | |
| 1 |
| |
| | 2011 | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | Journal Article | |
| 6 |
| Gupta, Janardan, Smid [Janardan] |
| |
| | 1999 | | Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13 | Journal Article | |
| | 1996 | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340 | Journal Article | |
| | 1996 | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19 | Journal Article | |
| | 1996 | | Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391 | Journal Article | |
| | 1995 | | Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317 | Journal Article | |
| | 1995 | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171 | Proceedings Article | |
| 2 |
| Gupta, Janardan, Smid, Dasgupta [Janardan, Dasgupta] |
| |
| | 1997 | | The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456 | Journal Article | |
| | 1995 | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171 | Proceedings Article | |
| 1 |
| Gupta, Kaller, Mahajan, Shermer [Gupta, Kaller, Shermer, Karlsson, Lingas, Karlsson, Lingas, Gupta, Kaller, Mahajan, Shermer] |
| |
| | 1996 | | Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172 | Proceedings Article | |
| 1 |
| |
| | 1997 | | Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63 | Journal Article | |
| 2 |
| |
| | 1991 | | Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726 | Journal Article | |
| | 1977 | | On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184 | Journal Article | |
| 2 |
| Güttler, Mehlhorn, Schneider [-] |
| |
| | 1980 | | Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | Journal Article | |
| | 1976 | | Binary Search Trees: Average and Worst Case Behavior | Report | |
| 1 |
| Güttler, Mehlhorn, Schneider, Wernet [-] |
| |
| | 1976 | | Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313 | Proceedings Article | |
| 1 |
| |
| | 1999 | | Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Gutwenger, Mutzel [Whitesides] |
| |
| | 1998 | | Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182 | Proceedings Article | |
| 2 |
| |
| | 2006 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1999 | | Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Hachenberger, Kettner [Kobbelt, Shapiro] |
| |
| | 2005 | | Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174 | Proceedings Article | |
| 1 |
| Hachenberger, Kettner, Mehlhorn [-] |
| |
| | 2007 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Journal Article | |
| 1 |
| Hagedoorn [Calvanese, Lenzerini, Motwani, Calvanese, Lenzerini, Motwani] |
| |
| | 2003 | | Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454 | Proceedings Article | |
| 1 |
| Hagedoorn, Overmars, Veltkamp [Borgefors, Nystrom, Sanniti di Baja] |
| |
| | 2000 | | A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370 | Proceedings Article | |
| 6 |
| Hagerup [-] |
| |
| | 2000 | | Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315 | Journal Article | |
| | 2000 | | Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28 | Journal Article | |
| | 1997 | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197 | Journal Article | |
| | 1995 | | A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128 | Journal Article | |
| | 1995 | | Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649 | Journal Article | |
| | 1995 | | The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64 | Journal Article | |
| 1 |
| Hagerup [Degano, Gorrieri, Marchetti-Spaccamela] |
| |
| | 1997 | | Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302 | Proceedings Article | |
| 1 |
| Hagerup [Ferreira, Rolim, Yang] |
| |
| | 1996 | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33 | Proceedings Article | |
| 1 |
| |
| | 1998 | | Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90 | Proceedings Article | |
| 1 |
| Hagerup [Morvan, Meinel, Krob] |
| |
| | 1998 | | Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398 | Proceedings Article | |
| 1 |
| Hagerup, Katajainen, Nishimura, Ragde [Katajainen, Nishimura, Ragde] |
| |
| | 1995 | | Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649 | Proceedings Article | |
| 1 |
| |
| | 1995 | | Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148 | Journal Article | |
| 1 |
| Hagerup, Kutylowski [Kutylowski] |
| |
| | 1997 | | Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66 | Journal Article | |
| 1 |
| Hagerup, Mehlhorn, Munro [, ] |
| |
| | 1993 | | Maintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264 | Proceedings Article | |
| 1 |
| Hagerup, Sanders, Träff [Träff] |
| |
| | 1998 | | An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154 | Proceedings Article | |
| 1 |
| Hajiaghayi, Khandekar, Kortsarz, Mestre [Hajiaghayi, Khandekar, Kortsarz, Serna, Shaltiel, Jansen, Rolim] |
| |
| | 2010 | | 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 |
| Hall, Hippler, Skutella [Hall, Hippler, Baeten, Lenstra, Parrow, Woeginger] |
| |
| | 2003 | | Multicommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409 | Proceedings Article | |
| 1 |
| Hall, Langkau, Skutella [Hall, Langkau, Arora, Jansen, Rolim, Sahai] |
| |
| | 2003 | | An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82 | Proceedings Article | |
| 1 |
| |
| | 1999 | | Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Han, Kelsen, Ramachandran, Tarjan [Han, Ramachandran, Tarjan] |
| |
| | 1995 | | Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358 | Journal Article | |
| 1 |
| Han, Lam, Lee, To, Wong [Han, Lam, To, Wong] |
| |
| | 2010 | | Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | Journal Article | |
| 1 |
| |
| | 2009 | | Analyses of Evolutionary Algorithms
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Happ, Johannsen, Klein, Neumann [Ryan, Keijzer] |
| |
| | 2008 | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article | |
| 1 |
| Hariharan, Kapoor [Kapoor] |
| |
| | 1995 | | Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265 | Journal Article | |
| 1 |
| Hariharan, Kelsen, Mahajan [Karlsson, Lingas] |
| |
| | 1996 | | Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52 | Proceedings Article | |
| 1 |
| |
| | 1995 | | Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16 | Proceedings Article | |
| 1 |
| Hariharan, Muthukrishnan [Muthukrishnan] |
| |
| | 1995 | | String Matching over a General Matching Relation
In: Information and Computation [122], 140-148 | Journal Article | |
| 1 |
| Hariharan, Telikepalli, Mehlhorn [Hariharan, Telikepalli, Bugliesi, Preneel, Sassone, Wegener] |
| |
| | 2006 | | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261 | Proceedings Article | |
| 1 |
| Harks, Hoefer, Klimm, Skopalik [Harks, Klimm, Skopalik] |
| |
| | 2013 | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | Journal Article | |
| 4 |
| |
| | 2010 | | Two-dimensional packing problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2009 | | Approximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532 | Journal Article | |
| | 2007 | | Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme | Book | |
| | 2006 | | Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund | Thesis - other | |
| 1 |
| Harren [Bugliesi, Preneel, Sassone, Wegener] |
| |
| | 2006 | | Approximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249 | Proceedings Article | |
| 1 |
| Harren, Jansen, Prädel, van Stee [Jansen, Prädel, Dehne, Iacono, Sack] |
| |
| | 2011 | | A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | Proceedings Article | |
| 1 |
| Harren, Kern [Kern, Solis-Oba, Persiano] |
| |
| | 2012 | | Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | Proceedings Article | |
| 1 |
| Harren, van Stee [-] |
| |
| | 2012 | | Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75 | Journal Article | |
| 1 |
| Harren, van Stee [Dinur, Jansen, Naor, Rolim] |
| |
| | 2009 | | Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189 | Proceedings Article | |
| 1 |
| Harren, van Stee [Gudmundsson] |
| |
| | 2008 | | Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | Proceedings Article | |
| 1 |
| Hazboun [-] |
| |
| | 1999 | | Molekül-Docking-Reaktionen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Hebbinghaus [-] |
| |
| | 2007 | | Discrepancy of Sums of two Arithmetic Progressions | Report | |
| 1 |
| Heinz, Kasprzik, Kötzing [Heinz, Kasprzik] |
| |
| | 2012 | | Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127 | Journal Article | |
| 1 |
| Helwig, Neumann, Wanka [Helwig, Wanka, Bouchachia, Nedjah, de Macedo Mourelle, Pedrycz] |
| |
| | 2009 | | Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | Proceedings Article | |
| 8 |
| Hemmer [-] |
| |
| | 2009 | | Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual | |
| | 2009 | | Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual | |
| | 2008 | | CGAL package for modular arithmetic operations | Report | |
| | 2008 | | CGAL package: Algebraic Foundations | Report | |
| | 2008 | | Evaluation of different approaches in 3D curved kernel for arrangements of quadrics | Report | |
| | 2008 | | Exact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz | Thesis - PhD thesis | |
| | 2007 | | Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual | |
| | 2002 | | Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Hemmer, Dupont, Petitjean, Schömer [Dupont, Petitjean, Schömer] |
| |
| | 2008 | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics | Report | |
| 1 |
| Hemmer, Dupon, Petitjean, Schomer [Dupon, Petitjean, Schomer] |
| |
| | 2011 | | A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494 | Journal Article | |
| 1 |
| Hemmer, Hert, Kettner, Pion, Schirra [Hert, Kettner, Pion, Schirra] |
| |
| | 2007 | | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual | |
| 2 |
| |
| | 2009 | | Generic implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324 | Proceedings Article | |
| | 2007 | | Traits classes for polynomial gcd computation over algebraic extensions | Report | |
| 1 |
| Hemmer, Kettner, Schömer [Hemmer, Schömer] |
| |
| | 2004 | | Effects of a Modular Filter on Geometric Applications | Report | |
| 2 |
| Hemmer, Limbach [Limbach] |
| |
| | 2008 | | Arrangements of quadrics in 3D: continued work on experimental implementation | Report | |
| | 2007 | | Benchmarks on a generic univariate algebraic kernel | Report | |
| 1 |
| Hemmer, Limbach, Schömer [Schömer] |
| |
| | 2009 | | Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | Proceedings Article | |
| 1 |
| Hemmer, Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain [Tsigaridas, Zafeirakopoulos, Emiris, Karavelas, Mourrain] |
| |
| | 2009 | | Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | Proceedings Article | |
| 1 |
| Henzinger, Leonardi [Henzinger] |
| |
| | 2003 | | Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611 | Journal Article | |
| 1 |
| Henz, Müller, Thiel [Henz, Müller] |
| |
| | 2004 | | Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101 | Journal Article | |
| 1 |
| Hermelin, Huang, Kratsch, Wahlström [Huang, Kratsch, Kolman, Kratochvíl] |
| |
| | 2011 | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | Proceedings Article | |
| 1 |
| Hermelin, Levy, Weimann, Yuster [Levy, Weimann, Yuster, Aceto, Henzinger, Sgall] |
| |
| | 2011 | | Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | Proceedings Article | |
| 1 |
| Hermelin, Mestre, Rawitz [Mestre, Rawitz, Golumbic, Stern, Levy, Morgenstern] |
| |
| | 2012 | | Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | Proceedings Article | |
| 1 |
| Hermelin, Mnich, van Leeuwen [Mnich, van Leeuwen, Epstein, Ferragina] |
| |
| | 2012 | | Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635 | Proceedings Article | |
| 1 |
| Hermelin, Mnich, van Leeuwen, Woeginger [Mnich, van Leeuwen, Woeginger, Aceto, Henzinger, Sgall] |
| |
| | 2011 | | Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | Proceedings Article | |
| 1 |
| Hermelin, Rawitz [Rawitz] |
| |
| | 2011 | | Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594 | Journal Article | |
| 1 |
| Hermelin, Rizzi, Vialette [Rizzi, Vialette, Chao, Hsu, Lee] |
| |
| | 2012 | | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474 | Proceedings Article | |
| 1 |
| Hermelin, Wu [Wu, Rabani] |
| |
| | 2012 | | Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113 | Proceedings Article | |
| 1 |
| |
| | 2001 | | Connected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38 | Proceedings Article | |
| 1 |
| Hertel, Mäntylä, Mehlhorn, Nievergelt [-] |
| |
| | 1984 | | Space Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519 | Journal Article | |
| 2 |
| |
| | 1985 | | Fast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76 | Journal Article | |
| | 1983 | | Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218 | Proceedings Article | |
| 1 |
| Hertel, Mehlhorn, Mäntylä, Nievergelt [Hertel, Mehlhorn, Mäntylä, Nievergelt] |
| |
| | 1984 | | Space sweep solves intersection of two convex polyhedra elegantly | Report | |
| 1 |
| Hert, Hoffmann, Kettner, Pion, Seel [Hert, Hoffmann, Pion, Seel] |
| |
| | 2007 | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | Journal Article | |
| 1 |
| Hert, Hoffmann, Kettner, Pion, Seel [Hoffmann, Kettner, Pion, Brodal, Frigioni, Marchetti-Spaccamela] |
| |
| | 2001 | | An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90 | Proceedings Article | |
| 1 |
| Hert, Lumelsky [-] |
| |
| | 1999 | | Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639 | Journal Article | |
| 1 |
| Hert, Richards [Richards, Christensen, Hager] |
| |
| | 2002 | | Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205 | Proceedings Article | |
| 1 |
| Heydrich [-] |
| |
| | 2012 | | Dividing connected chores fairly
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 1 |
| Heydrich, van Stee [Heydrich, Voecking] |
| |
| | 2013 | | Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433 | Proceedings Article | |
| 1 |
| Heydrich, van Stee [van Stee] |
| |
| | 2015 | | Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61 | Journal Article | |
| 2 |
| Heydthausen, Mehlhorn [-] |
| |
| | 1976 | | Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108 | Proceedings Article | |
| | 1976 | | Top down parsing of macro grammars (preliminary report) | Report | |
| 1 |
| |
| | 1996 | | Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes | Thesis - Masters thesis | |
| 2 |
| |
| | 2013 | | Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35 | Journal Article | |
| | 2013 | | Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53 | Journal Article | |
| 1 |
| Hoefer [Jansen, Margraf, Mastrolli, Rolim] |
| |
| | 2003 | | Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178 | Proceedings Article | |
| 1 |
| Hoefer, Kesselheim [Kesselheim] |
| |
| | 2013 | | Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | Proceedings Article | |
| 1 |
| Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking] |
| |
| | 2013 | | Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582 | Proceedings Article | |
| 1 |
| Hoefer, Sauerwald [-] |
| |
| | 2013 | | Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56 | Proceedings Article | |
| 2 |
| Hoefer, Skopalik [Skopalik] |
| |
| | 2013 | | Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21 | Journal Article | |
| | 2013 | | On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453 | Journal Article | |
| 1 |
| Hoefer, Wagner [Wagner, Chen, Immorlica] |
| |
| | 2013 | | Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262 | Proceedings Article | |
| 1 |
| Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg] |
| |
| | 2013 | | Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631 | Proceedings Article | |
| 1 |
| Hoepman, Papatriantafilou, Tsigas [Hélary, Hoepman, Raynal] |
| |
| | 1995 | | Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287 | Proceedings Article | |
| 1 |
| |
| | 1984 | | Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121 | Journal Article | |
| 3 |
| Hoffmann, Mehlhorn, Rosenstiehl, Tarjan [-] |
| |
| | 1986 | | Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184 | Journal Article | |
| | 1985 | | Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203 | Proceedings Article | |
| | 1984 | | Sorting Jordan sequences in linear time | Report | |
| 1 |
| Höhn, Jacobs, Megow [Höhn, Jacobs] |
| |
| | 2012 | | On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309 | Journal Article | |
| 1 |
| |
| | 1982 | | Cost tradeoffs in graph embeddings, with applications | Report | |
| 2 |
| Hong, Mehlhorn, Rosenberg [-] |
| |
| | 1983 | | Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728 | Journal Article | |
| | 1981 | | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Proceedings Article | |
| 1 |
| Hoogeveen, Skutella, Woeginger [Hoogeveen, Woeginger] |
| |
| | 2003 | | Preemptive scheduling with rejection
In: Mathematical Programming [94], 361-374 | Journal Article | |
| 1 |
| Horoba, Neumann [Horoba, Ryan, Keijzer] |
| |
| | 2008 | | Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680 | Proceedings Article | |
| 1 |
| Horoba, Neumann [Horoba] |
| |
| | 2009 | | Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86 | Proceedings Article | |
| 2 |
| Huang [-] |
| |
| | 2010 | | Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150 | Journal Article | |
| | 2010 | | Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253 | Proceedings Article | |
| 1 |
| |
| | 2012 | | Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | Proceedings Article | |
| 2 |
| |
| | 2011 | | Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA), | Proceedings Article | |
| | 2011 | | Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP), | Proceedings Article | |
| 1 |
| Huang, Kavitha, Michael, Nasr [Kavitha, Michael, Nasr] |
| |
| | 2011 | | Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | Journal Article | |
| 1 |
| Huang, Kavitha, Michail, Nasre [Huang, Michail, Nasre] |
| |
| | 2008 | | Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 | Proceedings Article | |
| 1 |
| Huber [-] |
| |
| | 2010 | | Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes | Thesis - PhD thesis | |
| 2 |
| Huddleston, Mehlhorn [-] |
| |
| | 1982 | | A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184 | Journal Article | |
| | 1981 | | Robust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244 | Proceedings Article | |
| 1 |
| |
| | 1997 | | Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Hundack, Mutzel, Pouchkarev, Thome [Pouchkarev, Thome] |
| |
| | 1997 | | ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302 | Proceedings Article | |
| 1 |
| Hundack, Prömel, Steger [] |
| |
| | 1997 | | Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433 | Part of a Book | |
| 3 |
| Hutchinson, Sanders, Vitter [Hutchinson, Vitter] |
| |
| | 2005 | | Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463 | Journal Article | |
| | 2001 | | Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73 | Proceedings Article | |
| | 2001 | | The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335 | Proceedings Article | |
| 1 |
| Iacono, Ramezani, Soranzo, Altafani [Iacono, Soranzo, Altafani] |
| |
| | 2010 | | Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | Journal Article | |
| 1 |
| |
| | 2001 | | Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2011 | | Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Irving, Telikepalli, Mehlhorn, Michail, Paluch [Irving, Telikepalli, Paluch] |
| |
| | 2006 | | Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610 | Journal Article | |
| 1 |
| Issac [Bhattacharya, Jaiswal, Kumar, Xu, Du, Du] |
| |
| | 2015 | | Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015, | Proceedings Article | |
| 1 |
| Jain, Kötzing, Stephan [Jain, Stephan, Bshouty, Stoltz, Vayatis, Zeugmann] |
| |
| | 2012 | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article | |
| 1 |
| Janardan, Smid [Janardan] |
| |
| | 1995 | | On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198 | Proceedings Article | |
| 1 |
| |
| | 1998 | | A New Characterization for Parity Graphs and a Coloring Problem with Costs
In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260 | Proceedings Article | |
| 1 |
| Jansen [Morvan, Meinel, Krob] |
| |
| | 1998 | | The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297 | Proceedings Article | |
| 1 |
| Jansen, Kratsch, Marx, Schlotter [Jansen, Marx, Schlotter, Kaplan] |
| |
| | 2010 | | Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272 | Proceedings Article | |
| 1 |
| |
| | 2010 | | Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334 | Journal Article | |
| 1 |
| Jansen, Porkolab [Jansen] |
| |
| | 2002 | | Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520 | Journal Article | |
| 1 |
| Jansen, Solis-Oba, Sviridenko [Jansen, Sviridenko, Pardalos] |
| |
| | 2000 | | Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346 | Part of a Book | |
| 1 |
| |
| | 2014 | | The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718 | Journal Article | |
| 1 |
| |
| | 2013 | | Recompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26 | Proceedings Article | |
| 1 |
| Jez [Esparza, Fraigniaud, Husfeldt, Koutsoupia] |
| |
| | 2014 | | Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article | |
| 1 |
| |
| | 2013 | | Approximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176 | Proceedings Article | |
| 1 |
| Jez [Fomin, Freivalds, Kwiatkowska, Peleg] |
| |
| | 2013 | | One-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335 | Proceedings Article | |
| 1 |
| Jez [Kulikov, Kuznetsov, Pevzner] |
| |
| | 2014 | | A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 | Proceedings Article | |
| 1 |
| |
| | 2013 | | Recompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244 | Proceedings Article | |
| 1 |
| Jez, Lohrey [Lohrey, Mayr, Portier] |
| |
| | 2014 | | Approximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 | Proceedings Article | |
| 1 |
| |
| | 2013 | | Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830 | Journal Article | |
| 1 |
| Jez, Okhotin [Okhotin, Beal, Carton] |
| |
| | 2013 | | Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 | Proceedings Article | |
| 1 |
| |
| | 2014 | | Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94 | Journal Article | |
| 2 |
| |
| | 2010 | | Random combinatorial structures and randomized search heuristics
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2006 | | Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin | Thesis - Masters thesis | |
| 1 |
| Johannsen, Lengler [Kurur, Pelikan, Branke] |
| |
| | 2010 | | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Proceedings Article | |
| 1 |
| Johannsen, Panagiotou [Charikar] |
| |
| | 2010 | | Vertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 | Proceedings Article | |
| 1 |
| Johannsen, Razgon, Wahlström [Razgon, Kullmann] |
| |
| | 2009 | | Solving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85 | Proceedings Article | |
| 1 |
| Jung [-] |
| |
| | 1996 | | Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Jünger, Lee, Mutzel, Odenthal [Jünger, Odenthal] |
| |
| | 1997 | | A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24 | Proceedings Article | |
| 1 |
| Jünger, Leipert, Mutzel [Juenger, Leipert] |
| |
| | 1998 | | A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612 | Journal Article | |
| 1 |
| Jünger, Leipert, Mutzel [Jünger, Leipert, Whitesides] |
| |
| | 1998 | | Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237 | Proceedings Article | |
| 1 |
| Jünger, Leipert, Mutzel [Leipert, Jünger] |
| |
| | 1997 | | Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204 | Proceedings Article | |
| 1 |
| Jünger, Mutzel [Brandenburg, Jünger] |
| |
| | 1996 | | Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), - | Proceedings Article | |
| 2 |
| Jünger, Mutzel [Jünger] |
| |
| | 1997 | | 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25 | Journal Article | |
| | 1996 | | Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59 | Journal Article | |
| 1 |
| Jünger, Mutzel [Tamassia, Tollis, Jünger] |
| |
| | 1995 | | The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130 | Proceedings Article | |
| 1 |
| Jünger, Mutzel, Odenthal, Scharbrodt [Jünger, Odenthal, Scharbrodt] |
| |
| | 1998 | | The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176 | Journal Article | |
| 1 |
| Jung, Lenhof, Müller, Rüb [Jung, Sloot, Bubak, Hoekstra, Hertzberger] |
| |
| | 1999 | | Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22 | Proceedings Article | |
| 3 |
| Jung, Lenhof, Müller, Rüb [Jung] |
| |
| | 2000 | | Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522 | Journal Article | |
| | 1997 | | Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521 | Journal Article | |
| | 1997 | | Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM | Proceedings Article | |
| 1 |
| |
| | 1987 | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees | Report | |
| 1 |
| |
| | 1988 | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236 | Journal Article | |
| 2 |
| |
| | 2013 | | Toward Better Computation Models for Modern Machines
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2009 | | Cycle Bases in Graphs
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Jurkiewicz, Danilewski [-] |
| |
| | 2011 | | Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Unpublished/Draft | |
| 1 |
| Jurkiewicz, Mehlhorn [-] |
| |
| | 2013 | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article | |
| 1 |
| Juurlink, Mutzel [Juurlink] |
| |
| | 1995 | | ?
In: Conference on High-Performance Computing, 125-130 | Proceedings Article | |
| 1 |
| Juurlink, Sibeyn [Juurlink] |
| |
| | 1995 | | Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760 | Proceedings Article | |
| 1 |
| Juurlink, Sibeyn, Rao [Bougé, Fraigniaud, Juurlink, Mignotte, Rao, Robert] |
| |
| | 1996 | | Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369 | Proceedings Article | |
| 1 |
| Kagaris, Pantziou, Tragoudas, Zaroliagis [Akl, Dehne, Kagaris, Pantziou, Sack, Santoro, Tragoudas] |
| |
| | 1995 | | On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 | Proceedings Article | |
| 1 |
| Kagaris, Pantziou, Tragoudas, Zaroliagis [El-Rewini, Kagaris, Pantziou, Shriver, Tragoudas] |
| |
| | 1995 | | Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44 | Proceedings Article | |
| 1 |
| Kagaris, Pantziou, Tragoudas, Zaroliagis [Kagaris, Pantziou, Tragoudas] |
| |
| | 1999 | | Transmissions in a network with capacities and delays
In: Networks [33
], 167-174 | Journal Article | |
| 1 |
| Kaligosi [-] |
| |
| | 2003 | | Length bounded network flows
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kaligosi, Mehlhorn, Munro, Sanders [Munro, Sanders] |
| |
| | 2005 | | Towards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 | Proceedings Article | |
| 1 |
| Kaligosi, Sanders [Sanders, Azar, Erlebach] |
| |
| | 2006 | | How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791 | Proceedings Article | |
| 1 |
| Kamran Azam [-] |
| |
| | 2005 | | Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kane, Mehlhorn, Sauerwald, Sun [Kane, Czumaj, Pitts, Wattenhofer] |
| |
| | 2012 | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Proceedings Article | |
| 1 |
| Kao, Leung, Sun, Zhang [Kao, Leung, Zhang, Kratchovil, Li, Fiala, Kolman] |
| |
| | 2010 | | 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 | |
| 1 |
| Kapoor [-] |
| |
| | 1996 | | On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146 | Proceedings Article | |
| 1 |
| Kapoor, Smid [-] |
| |
| | 1996 | | New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796 | Journal Article | |
| 1 |
| Kappel [-] |
| |
| | 1998 | | Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kärkkäinen [Penttonen, Meineche Schmidt] |
| |
| | 2002 | | Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357 | Proceedings Article | |
| 1 |
| Kärkkäinen, Rao [Sibeyn, Rao] |
| |
| | 2003 | | Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170 | Part of a Book | |
| 1 |
| Kärkkäinen, Sanders [Baeten, Lenstra, Parrow, Woeginger] |
| |
| | 2003 | | Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955 | Proceedings Article | |
| 1 |
| Karp, Schindelhauer, Shenker, Vöcking [Karp, Schindelhauer, Shenker] |
| |
| | 2000 | | Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574 | Proceedings Article | |
| 2 |
| Karrenbauer [-] |
| |
| | 2007 | | Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2004 | | Packing Boxes with Arbitrary Rotations
Universität des Saarlandes | Thesis - other | |
| 1 |
| |
| | 1995 | | Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kasprzik, Kötzing [Kasprzik, Martin-Vide, Fernau, Dediu] |
| |
| | 2010 | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article | |
| 1 |
| Katajainen, Träff [Bongiovanni, Bovet, Di Battista, Katajainen] |
| |
| | 1997 | | A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Proceedings Article | |
| 3 |
| |
| | 2004 | | Constraints and Changes
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2004 | | On Algorithms for Online Topological Ordering and Sorting | Report | |
| | 2004 | | On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178 | Journal Article | |
| 1 |
| |
| | 2004 | | Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199 | Proceedings Article | |
| 1 |
| Katriel, Bodlaender [Bodlaender] |
| |
| | 2005 | | Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450 | Proceedings Article | |
| 1 |
| |
| | 2003 | | Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84 | Part of a Book | |
| 1 |
| Katriel, Michel, Van Hentenryck [Michel, Van Hentenryck] |
| |
| | 2005 | | Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183 | Journal Article | |
| 1 |
| Katriel, Sanders, Träff [Träff, Di Battista, Zwick] |
| |
| | 2003 | | A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690 | Proceedings Article | |
| 1 |
| |
| | 2005 | | Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | Journal Article | |
| 1 |
| |
| | 2003 | | Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451 | Proceedings Article | |
| 7 |
| |
| | 1992 | | On local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72 | Journal Article | |
| | 1989 | | Routing Problems in Grid Graphs | Report | |
| | 1989 | | Routing problems in grid graphs | Report | |
| | 1988 | | A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | Report | |
| | 1986 | | On Local Routing of Two-Terminal Nets | Report | |
| | 1986 | | Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531 | Journal Article | |
| | 1984 | | Routing through a generalized switchbox | Report | |
| 1 |
| Kaufmann, Mehlhorn [Brandenburg, Vidal-Naquet, Wirsing] |
| |
| | 1987 | | On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52 | Proceedings Article | |
| 1 |
| Kaufmann, Mehlhorn [Kaufmann, Mehlhorn] |
| |
| | 1984 | | Local routing of two-terminal nets is easy | Report | |
| 2 |
| |
| | 1994 | | A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246 | Journal Article | |
| | 1990 | | Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184 | Part of a Book | |
| 3 |
| Kaufmann, Meyer, Sibeyn [Kaufmann] |
| |
| | 1997 | | Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140 | Journal Article | |
| | 1997 | | Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319 | Proceedings Article | |
| | 1994 | | Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663 | Proceedings Article | |
| 1 |
| Kaufmann, Raman, Sibeyn [Kaufmann, Raman] |
| |
| | 1997 | | Routing on Meshes with Buses
In: Algorithmica [18], 417-444 | Journal Article | |
| 1 |
| Kaufmann, Schröder, Sibeyn [Kaufmann, Schröder] |
| |
| | 1995 | | Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95 | Journal Article | |
| 1 |
| Kaufmann, Sibeyn [Hájek, Kaufmann, Wiedermann] |
| |
| | 1995 | | Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422 | Proceedings Article | |
| 1 |
| Kaufmann, Sibeyn [Kaufmann] |
| |
| | 1997 | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | Journal Article | |
| 1 |
| Kaufmann, Sibeyn, Suel [Kaufmann, Spirakis, Suel] |
| |
| | 1995 | | Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88 | Proceedings Article | |
| 1 |
| Kavitha [-] |
| |
| | 2008 | | On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354 | Proceedings Article | |
| 1 |
| Kavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, Zweig [Kavitha, Liebchen, Rizzi, Ueckerdt, Zweig] |
| |
| | 2009 | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | Journal Article | |
| 1 |
| Kavitha, Mehlhorn [-] |
| |
| | 2007 | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Journal Article | |
| 1 |
| Kavitha, Mehlhorn [Diekert, Durand] |
| |
| | 2005 | | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665 | Proceedings Article | |
| 1 |
| Kavitha, Mehlhorn, Michail [Kavitha, Thomas, Weil] |
| |
| | 2007 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | Proceedings Article | |
| 1 |
| Kavitha, Mehlhorn, Michail [Kavitha] |
| |
| | 2011 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | Journal Article | |
| 1 |
| Kavitha, Mehlhorn, Michail, Paluch [Kavitha, Paluch] |
| |
| | 2007 | | 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 | |
| 1 |
| Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diaz, Karhumäki, Lepistö, Sannella] |
| |
| | 2004 | | A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | Proceedings Article | |
| 1 |
| Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diekert, Habib] |
| |
| | 2004 | | 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 | |
| 1 |
| Kavitha, Mestre [Kavitha, Dong, Du, Ibarra] |
| |
| | 2009 | | Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | Proceedings Article | |
| 1 |
| Kavitha, Mestre [Kavitha] |
| |
| | 2010 | | Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14 | Electronic Journal Article | |
| 1 |
| Kavitha, Mestre [Mestre] |
| |
| | 2012 | | Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14 | Journal Article | |
| 1 |
| Kavitha, Mestre, Nasre [Kavitha, Nasre, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas] |
| |
| | 2009 | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article | |
| 1 |
| Kavitha, Mestre, Nasre [Kavitha, Nasre] |
| |
| | 2011 | | Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690 | Journal Article | |
| 1 |
| Kavitha, Nasre [Nasre] |
| |
| | 2008 | | Optimal Popular Matchings | Miscellaneous | |
| 1 |
| Kavvadias, Pantziou, Spirakis, Zaroliagis [Kavvadias, Pantziou, Spirakis] |
| |
| | 1996 | | Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154 | Journal Article | |
| 2 |
| Kayal, Saha [Kayal] |
| |
| | 2012 | | On the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15 | Journal Article | |
| | 2011 | | On the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299 | Proceedings Article | |
| 1 |
| Kececioglu, Lenhof, Mehlhorn, Mutzel, Reinert, Vingron [Kececioglu, Vingron] |
| |
| | 2000 | | A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | Journal Article | |
| 1 |
| Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.) [Keizer, Antoniol, Congdon, Deb, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener] |
| |
| | 2008 | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| 1 |
| |
| | 1996 | | Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233 | Proceedings Article | |
| 1 |
| Kelsen, Mahajan, Ramesh [Mahajan, Ramesh] |
| |
| | 1996 | | Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52 | Proceedings Article | |
| 4 |
| |
| | 2009 | | Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | Journal Article | |
| | 2009 | | Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2008 | | On filter methods in CGAL's 2D curved kernel | Report | |
| | 2006 | | Analysis of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kerber [Gerdt, Mayr, Vorozhtsov] |
| |
| | 2009 | | On the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article | |
| 1 |
| Kerber, Sagraloff [Kerber, Leykin] |
| |
| | 2011 | | Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | Proceedings Article | |
| 2 |
| Kerber, Sagraloff [Kerber] |
| |
| | 2012 | | A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258 | Journal Article | |
| | 2011 | | A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430 | Journal Article | |
| 1 |
| |
| | 2000 | | Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kesselman, Guez, Rosen [Guez, Rosen] |
| |
| | 2004 | | Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102 | Proceedings Article | |
| 1 |
| |
| | 2005 | | Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844 | Proceedings Article | |
| 1 |
| |
| | 2005 | | Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124 | Proceedings Article | |
| 1 |
| Kesselman, Kowalski, Segal [Segal] |
| |
| | 2005 | | Energy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26 | Journal Article | |
| 1 |
| Kesselman, Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko [Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko] |
| |
| | 2004 | | Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583 | Journal Article | |
| 1 |
| Kesselman, Mansour [Mansour] |
| |
| | 2004 | | Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182 | Journal Article | |
| 1 |
| |
| | 2002 | | Robust Computation of Visibility Maps
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Keßler, Träff [Keßler, Kessler] |
| |
| | 1997 | | Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221 | Proceedings Article | |
| 1 |
| Keßler, Träff [Keßler, Keßler] |
| |
| | 1996 | | 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 |
| |
| | 1998 | | Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kettner [Lumsdaine, Schupp] |
| |
| | 2005 | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10 | Electronic Proceedings Article | |
| 1 |
| |
| | 2006 | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43 | Proceedings Article | |
| 1 |
| Kettner, Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi [Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi] |
| |
| | 2003 | | Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12 | Journal Article | |
| 1 |
| Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Albers, Radzik] |
| |
| | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | Proceedings Article | |
| 1 |
| Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Gavrilova, Gervasi, Kumar, Tan, Taniar, Laganà, Mun, Choo] |
| |
| | 2006 | | Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 | Proceedings Article | |
| 1 |
| Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap] |
| |
| | 2008 | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article | |
| 1 |
| Kettner, Mehlhorn, Pion, Schirra, Yap [Schirra, Yap] |
| |
| | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations | Report | |
| 1 |
| Kettner, Näher [Näher, Goodman, O'Rourke] |
| |
| | 2004 | | Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463 | Part of a Book | |
| 1 |
| Kettner, Rossignac, Snoeyink [Rossignac, Snoeyink] |
| |
| | 2003 | | The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116 | Journal Article | |
| 1 |
| Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich, Deng, Du] |
| |
| | 2005 | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article | |
| 2 |
| Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich] |
| |
| | 2008 | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article | |
| | 2006 | | Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765 | Proceedings Article | |
| 1 |
| Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino, Azar, Erlebach] |
| |
| | 2006 | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article | |
| 1 |
| Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino] |
| |
| | 2008 | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article | |
| 1 |
| Khachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, Zhao [Khachiyan, Boros, Borys, Gurvich, Rudolf, Zhao] |
| |
| | 2008 | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article | |
| 1 |
| Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Jedrzejowicz, Szepietowski] |
| |
| | 2005 | | Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567 | Proceedings Article | |
| 1 |
| Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Wang] |
| |
| | 2005 | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | Proceedings Article | |
| 4 |
| Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich] |
| |
| | 2008 | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | Journal Article | |
| | 2008 | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article | |
| | 2007 | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article | |
| | 2007 | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article | |
| 3 |
| Khachiyan, Boros, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Gurvich, Makino] |
| |
| | 2007 | | Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | Journal Article | |
| | 2007 | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article | |
| | 2005 | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | Journal Article | |
| 1 |
| Khachiyan, Porkolab [Khachiyan] |
| |
| | 2000 | | Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224 | Journal Article | |
| 1 |
| Khosla [Bodlaender, Italiano] |
| |
| | 2013 | | Balls into Bins Made Faster
In: Algorithms - ESA 2013, | Proceedings Article | |
| 1 |
| Khuller, Malekian, Mestre [Khuller, Malekian, Arge, Hoffmann, Welzl] |
| |
| | 2007 | | To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545 | Proceedings Article | |
| 1 |
| Khuller, Mestre [Khuller] |
| |
| | 2008 | | An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610 | Proceedings Article | |
| 1 |
| Kim, Paul, Philip [Kim, Paul, Fomin, Kaski] |
| |
| | 2012 | | A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 | Proceedings Article | |
| 1 |
| Kirousis, Spirakis, Tsigas [Kirousis, Spirakis] |
| |
| | 1996 | | Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53 | Journal Article | |
| 1 |
| |
| | 1994 | | Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes | Thesis - Masters thesis | |
| 3 |
| |
| | 2002 | | A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 1998 | | Visuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales Zeichnen | Miscellaneous | |
| | 1997 | | Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2004 | | Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Klau, Klein, Mutzel [Marks, Klau, Mutzel] |
| |
| | 2001 | | An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51 | Proceedings Article | |
| 1 |
| Klau, Mutzel [Cornuéjols, Burkard, Woeginger] |
| |
| | 1999 | | Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319 | Proceedings Article | |
| 1 |
| Klau, Mutzel [Du, Eades, Estivill-Castro, Lin, Sharma] |
| |
| | 2000 | | Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350 | Proceedings Article | |
| 1 |
| Klau, Mutzel [Jäger, Krebs] |
| |
| | 2003 | | Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608 | Part of a Book | |
| 1 |
| Klau, Mutzel [Kratochvíl] |
| |
| | 1999 | | Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37 | Proceedings Article | |
| 3 |
| |
| | 2004 | | A Fast Root Checking Algorithm | Report | |
| | 2004 | | Controlled Perturbation for Voronoi Diagrams
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2000 | | Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Klein, Kutz [Klein, Kaufmann, Wagner] |
| |
| | 2007 | | Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | Proceedings Article | |
| 1 |
| |
| | 2006 | | The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272 | Proceedings Article | |
| 1 |
| Klein, Mehlhorn, Meiser [Klein, Meiser] |
| |
| | 1989 | | On the construction of abstract Voronoi diagrams, II. | Report | |
| 2 |
| Klein, Mehlhorn, Meiser [, ] |
| |
| | 1992 | | Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308 | Part of a Book | |
| | 1990 | | On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 | Proceedings Article | |
| 1 |
| Klein, Mehlhorn, Meiser [] |
| |
| | 1993 | | Randomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184 | Journal Article | |
| 1 |
| Knauer, Schlipf, Schmidt, Tiwary [Knauer, Schlipf, Tiwary] |
| |
| | 2012 | | Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85 | Journal Article | |
| 2 |
| Kobel [-] |
| |
| | 2011 | | Certified numerical root finding
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2008 | | Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes | Thesis - Bachelor thesis | |
| 1 |
| |
| | 2013 | | Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17 | Electronic Journal Article | |
| 2 |
| |
| | 2000 | | BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824 | Journal Article | |
| | 1999 | | Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92 | Proceedings Article | |
| 1 |
| Koldehofe [-] |
| |
| | 1999 | | Animation and Analysis of Distributed Algorithms
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Koller, Mehlhorn, Niehren [Koller] |
| |
| | 2000 | | A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375 | Proceedings Article | |
| 1 |
| Kollias [-] |
| |
| | 2013 | | Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440 | Electronic Journal Article | |
| 1 |
| Könemann [-] |
| |
| | 1997 | | Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Konidaris, Mehlhorn, Shell [] |
| |
| | 2004 | | An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons | Unpublished/Draft | |
| 1 |
| Kontogiannis [-] |
| |
| | 2002 | | Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 124-133 | Proceedings Article | |
| 1 |
| Kontogiannis, Pantziou, Spirakis, Yung [Pantziou, Spirakis, Yung] |
| |
| | 2000 | | Robust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464 | Journal Article | |
| 1 |
| Konwar, Kowalski, Shvartsman [Konwar, Shvartsman] |
| |
| | 2004 | | The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324 | Proceedings Article | |
| 1 |
| Kötzing [Kivinen, Szepesvári, Ukkonen, Zeugmann] |
| |
| | 2011 | | Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article | |
| 1 |
| Kötzing, Lehre, Neumann, Oliveto [Lehre, Oliveto, Pelikan, Branke] |
| |
| | 2010 | | Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Proceedings Article | |
| 1 |
| Kötzing, Molter [Molter, Coello Coello, Cutello, Deb, Forrest, Nicosia, Pavone] |
| |
| | 2012 | | ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | Proceedings Article | |
| 1 |
| Kötzing, Neumann, Röglin, Witt [Neumann, Röglin, Witt] |
| |
| | 2012 | | Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21 | Journal Article | |
| 1 |
| Kötzing, Neumann, Röglin, Witt [Röglin, Witt, Dorigo, Birattari, Di Caro, Doursat, Engelbrecht, Floreano, Gambardella, Groß, Sahin, Sayama, Stützle] |
| |
| | 2010 | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article | |
| 1 |
| Kötzing, Neumann, Spöhel [Neumann, Krasnogor, Lanzi] |
| |
| | 2011 | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article | |
| 1 |
| Kötzing, Neumann, Sudholt, Wagner [Neumann, Sudholt, Wagner, Beyer, Langdon] |
| |
| | 2011 | | Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 | Proceedings Article | |
| 1 |
| Kötzing, Sudholt, Theile [Sudholt, Theile, Krasnogor, Lanzi] |
| |
| | 2011 | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article | |
| 1 |
| Kötzing, Sutton, Neumann, O'Reilly [Sutton, Neumann, O'Reilly, Soule, Moore] |
| |
| | 2012 | | The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340 | Proceedings Article | |
| 1 |
| Kovács [-] |
| |
| | 2007 | | Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Kovács [Brodal, Leonardi] |
| |
| | 2005 | | Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627 | Proceedings Article | |
| 1 |
| Kovács [Caires, Italiano, Monteiro, Palamidessi, Yung] |
| |
| | 2005 | | Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852 | Proceedings Article | |
| 1 |
| Kovács [Calamoneri, Finocchi, Italiano] |
| |
| | 2006 | | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198 | Proceedings Article | |
| 1 |
| Kovács [Diekert, Habib] |
| |
| | 2004 | | Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80 | Proceedings Article | |
| 2 |
| Kowalik [-] |
| |
| | 2009 | | Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742 | Journal Article | |
| | 2007 | | Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | Journal Article | |
| 1 |
| |
| | 2006 | | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566 | Proceedings Article | |
| 1 |
| |
| | 2006 | | Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101 | Proceedings Article | |
| 1 |
| Kowalski, Musial, Shvartsman [Musial, Shvartsman] |
| |
| | 2005 | | Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58 | Proceedings Article | |
| 1 |
| Kowalski, Pelc [Pelc, Fleischer, Trippen] |
| |
| | 2004 | | Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656 | Proceedings Article | |
| 1 |
| Kowalski, Pelc [Pelc, Jansen, Khanna, Rolim, Ron] |
| |
| | 2004 | | Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182 | Proceedings Article | |
| 3 |
| |
| | 2005 | | Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371 | Journal Article | |
| | 2004 | | Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891 | Journal Article | |
| | 2003 | | Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210 | Proceedings Article | |
| 1 |
| Kowalski, Shvartsman [Shvartsman] |
| |
| | 2004 | | Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320 | Proceedings Article | |
| 2 |
| Krandick, Mehlhorn [Krandick] |
| |
| | 2006 | | New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66 | Journal Article | |
| | 2004 | | New Bounds for the Descartes Method | Report | |
| 1 |
| Kratsch [-] |
| |
| | 2010 | | Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Kratsch [Albers, Marion] |
| |
| | 2009 | | Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612 | Electronic Proceedings Article | |
| 1 |
| Kratsch, Lehre, Neumann, Oliveto [Lehre, Neumann, Oliveto, Schaefer, Cotta, Kolodziej, Rudolph] |
| |
| | 2010 | | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 | Proceedings Article | |
| 1 |
| Kratsch, Marx, Wahlström [Marx, Hlinený, Kucera] |
| |
| | 2010 | | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500 | Proceedings Article | |
| 1 |
| Kratsch, McConnell, Mehlhorn, Spinrad [Kratsch, McConnell, Spinrad] |
| |
| | 2006 | | 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 | |
| 1 |
| Kratsch, McConnell, Mehlhorn, Spinrad [] |
| |
| | 2003 | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167 | Proceedings Article | |
| 1 |
| Kratsch, Neumann [Raidl, Rothlauf] |
| |
| | 2009 | | Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300 | Proceedings Article | |
| 1 |
| Kratsch, Pilipczuk, Pilipczuk, Wahlström [Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer] |
| |
| | 2012 | | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 | Proceedings Article | |
| 1 |
| Kratsch, Schweitzer [Kaplan] |
| |
| | 2010 | | Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92 | Proceedings Article | |
| 1 |
| Kratsch, Wahlström [Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis] |
| |
| | 2010 | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | |
| 1 |
| Kratsch, Wahlström [Chen, Fomin] |
| |
| | 2009 | | Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article | |
| 1 |
| Kratsch, Wahlström [Kratsch, Rabani] |
| |
| | 2012 | | Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103 | Proceedings Article | |
| 1 |
| Kratsch, Wahlström [Kratsch, Roughgarden] |
| |
| | 2012 | | Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459 | Proceedings Article | |
| 1 |
| Krick, Meyer auf der Heide, Räcke, Vöcking, Westermann [Krick, Meyer auf der Heide, Räcke, Westermann] |
| |
| | 2003 | | Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245 | Journal Article | |
| 1 |
| Krithivasan, Rema, Schirra, Vijaykumar [Fiala, Kranakis, Krithivasan, Rema, Sack, Vijaykumar] |
| |
| | 1996 | | 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 | |
| 1 |
| Krivelevich, Spöhel [Krivelevich] |
| |
| | 2012 | | Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | Journal Article | |
| 1 |
| Kroeske, Ghandar, Michalewicz, Neumann [Kroeske, Ghandar, Michalewicz, Rudolph, Jansen, Lucas, Poloni, Beume] |
| |
| | 2008 | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article | |
| 1 |
| Krohmer [-] |
| |
| | 2012 | | Finding cliques in scale-free networks
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Krumke, Schwahn, van Stee, Westphal [Krumke, Schwahn, Westphal] |
| |
| | 2008 | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | Journal Article | |
| 1 |
| Krumke, van Stee, Westphal [Krumke, Westphal, Ravi, Shukla] |
| |
| | 2009 | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book | |
| 2 |
| Krysta [-] |
| |
| | 2003 | | Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288 | Journal Article | |
| | 2001 | | Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Krysta, Kumar [Ferreira, Reichel] |
| |
| | 2001 | | Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442 | Proceedings Article | |
| 1 |
| Krysta, Lorys [Lorys, Nesetril, Lorys] |
| |
| | 1999 | | Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413 | Proceedings Article | |
| 1 |
| Krysta, Pacholski [Pacholski] |
| |
| | 1999 | | The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219 | Journal Article | |
| 1 |
| Krysta, Sanders, Vöcking [Rovan, Vojtáš] |
| |
| | 2003 | | Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510 | Proceedings Article | |
| 1 |
| |
| | 2001 | | Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247 | Journal Article | |
| 1 |
| Krysta, Solis-Oba [Asano, Imai, Lee, Nakano, Tokuyama] |
| |
| | 1999 | | Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250 | Proceedings Article | |
| 1 |
| |
| | 1996 | | Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kucera, Mehlhorn, Preis, Schwarzenecker [] |
| |
| | 1993 | | Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322 | Proceedings Article | |
| 1 |
| Kuhn, Panagiotou, Spencer, Steger [Kuhn, Spencer, Steger, Charikar] |
| |
| | 2010 | | Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964 | Proceedings Article | |
| 1 |
| |
| | 2001 | | Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17 | Journal Article | |
| 1 |
| Kumar, Arya, Ramesh [Arya, Ramesh, Montanari, Rolim, Welzl] |
| |
| | 2000 | | Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635 | Proceedings Article | |
| 2 |
| |
| | 1999 | | Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454 | Proceedings Article | |
| | 1999 | | Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251 | Proceedings Article | |
| 1 |
| Kursawe [-] |
| |
| | 1998 | | Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kutz [-] |
| |
| | 2005 | | Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451 | Journal Article | |
| 1 |
| Kutz [Amenta, Cheong] |
| |
| | 2006 | | Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437 | Proceedings Article | |
| 1 |
| Kutz [Felsner] |
| |
| | 2005 | | Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36 | Proceedings Article | |
| 1 |
| Kutz, Elbassioni, Katriel, Mahajan [Kutz, Katriel, Mahajan] |
| |
| | 2008 | | Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897 | Journal Article | |
| 1 |
| Kutz, Pór [Pór, Wang] |
| |
| | 2005 | | Angel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934 | Proceedings Article | |
| 1 |
| Kutz, Schweitzer [-] |
| |
| | 2007 | | ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157 | Proceedings Article | |
| 1 |
| Kwappik [-] |
| |
| | 1998 | | Exact Linear Programming
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Kwek, Mehlhorn [Kwek] |
| |
| | 2003 | | Optimal Search for Rationals
In: Information Processing Letters [86], 23-26 | Journal Article | |
| 2 |
| Lambert [-] |
| |
| | 2001 | | Ein Parametric Search Toolkit
Universität des Saarlandes | Thesis - Masters thesis | |
| | 2000 | | Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 1999 | | Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460 | Proceedings Article | |
| 1 |
| |
| | 1994 | | Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Larsson, Gidenstam, Ha, Papatriantafilou, Tsigas [Larsson, Ha, Papatriantafilou, Tsigas] |
| |
| | 2009 | | Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30 | Electronic Journal Article | |
| 1 |
| Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.) [] |
| |
| | 2005 | | Cache-Oblivious and Cache-Aware Algorithms | Report | |
| 1 |
| |
| | 1998 | | Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Laura, Leonardi, Millozzi, Meyer, Sibeyn [Laura, Leonardi, Millozzi, Sibeyn, Di Battista, Zwick] |
| |
| | 2003 | | Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714 | Proceedings Article | |
| 1 |
| Lee, Cheong, Kwon, Shin, Chwa [Cheong, Kwon, Shin, Chwa, Paterson] |
| |
| | 2000 | | Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325 | Proceedings Article | |
| 1 |
| Lee, Park, Chwa [Park, Chwa] |
| |
| | 2000 | | Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220 | Journal Article | |
| 1 |
| Lee, Shin, Chwa [Shin, Chwa] |
| |
| | 2000 | | Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783 | Journal Article | |
| 1 |
| Lehnert, Schweitzer [Lehnert] |
| |
| | 2007 | | The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241 | Journal Article | |
| 1 |
| |
| | 1997 | | Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes | Thesis - Masters thesis | |
| 7 |
| |
| | 1986 | | VLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89 | Part of a Book | |
| | 1984 | | Four results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22 | Journal Article | |
| | 1984 | | The HILL system: A design environment for the hierarchical spezification, compaction, and simulation of integrated circuit layouts
In: Proceedings, Conference on Advanced Research in VLSI, 139-149 | Proceedings Article | |
| | 1983 | | Four results on the complexity of VLSI computations | Report | |
| | 1983 | | The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts | Report | |
| | 1983 | | VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System | Report | |
| | 1981 | | On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99 | Journal Article | |
| 2 |
| |
| | 1999 | | Bioinformatik
Universität des Saarlandes | Thesis - Habilitation thesis | |
| | 1997 | | New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191 | Proceedings Article | |
| 1 |
| Lenhof [Plesser, Wittenberg] |
| |
| | 1997 | | Parallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48 | Part of a Book | |
| 1 |
| Lenhof [Schomburg, Lessel] |
| |
| | 1995 | | An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139 | Part of a Book | |
| 1 |
| Lenhof, Morgenstern, Reinert [Morgenstern] |
| |
| | 1999 | | An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210 | Journal Article | |
| 1 |
| Lenhof, Reinert, Vingron [Vingron, Istrail, Pevzner, Waterman] |
| |
| | 1998 | | A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162 | Proceedings Article | |
| 1 |
| Lenhof, Reinert, Vingron [Vingron] |
| |
| | 1998 | | A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530 | Journal Article | |
| 6 |
| Lenhof, Smid [-] |
| |
| | 1995 | | Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312 | Journal Article | |
| | 1995 | | Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288 | Journal Article | |
| | 1994 | | An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387 | Proceedings Article | |
| | 1994 | | Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49 | Journal Article | |
| | 1993 | | An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267 | Journal Article | |
| | 1992 | | Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386 | Proceedings Article | |
| 1 |
| |
| | 1991 | | An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363 | Proceedings Article | |
| 1 |
| Lenhof, Smid [Nurmi, Ukkonen] |
| |
| | 1992 | | Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398 | Proceedings Article | |
| 1 |
| |
| | 2005 | | Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Lennerz, Schömer [Hiromasa, Ralph] |
| |
| | 2002 | | Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69 | Proceedings Article | |
| 2 |
| Leonardi, Schäfer [Leonardi] |
| |
| | 2004 | | Cross-monotonic cost sharing methods for connected facility location games
In: EC'04 : proceedings of the 5th ACM Conference on Electronic Commerce ; New York, New York, USA, May 17-20, 2004, 242-243 | Proceedings Article | |
| | 2004 | | Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442 | Journal Article | |
| 1 |
| Lermen [-] |
| |
| | 1997 | | Multiple Sequence Alignment
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Lermen, Reinert [Lermen] |
| |
| | 2000 | | The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671 | Journal Article | |
| 1 |
| Limbach [-] |
| |
| | 2008 | | Continued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes | Thesis - Masters thesis | |
| 2 |
| Loeckx, Mehlhorn, Wilhelm [-] |
| |
| | 1989 | | Foundations of Programming Languages | Book | |
| | 1986 | | Grundlagen der Programmiersprachen | Book | |
| 1 |
| Lokshtanov, Saurabh, Wahlström [Lokshtanov, Saurabh, D'Souza, Kavitha, Radhakrishna] |
| |
| | 2012 | | 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 | |
| 1 |
| |
| | 2001 | | A Virtual Environment for Interactive Assembly Simulation: From Rigid Bodies to Deformable Cables
In: Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI-01): Emergent computing and virtual engineering, 325-332 | Proceedings Article | |
| 1 |
| Lotker, Majumdar, Narayanaswamy, Weber [Lotker, Narayanaswamy, Chen, Lee] |
| |
| | 2006 | | Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225 | Proceedings Article | |
| 1 |
| |
| | 1996 | | Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2000 | | Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| |
| | 2000 | | Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464 | Journal Article | |
| 1 |
| Mahajan, Ramos, Subrahmanyam [-] |
| |
| | 1997 | | Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36 | Proceedings Article | |
| 1 |
| Mainberger, Hoffmann, Weickert, Tang, Johannsen, Neumann, Doerr [Mainberger, Hoffmann, Weickert, Johannsen, Neumann, Bruckstein, ter Haar Romeny, Bronstein, Bronstein] |
| |
| | 2011 | | 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 | |
| 1 |
| Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.) [] |
| |
| | 1986 | | VLSI algorithms and architectures : Aegean workshop on computing | Proceedings | |
| 2 |
| |
| | 2008 | | Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103 | Journal Article | |
| | 2005 | | Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194 | Electronic Proceedings Article | |
| 1 |
| Manjunath [-] |
| |
| | 2008 | | Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Manjunath, Mehlhorn, Panagiotou, Sun [Demetrescu, M. Halldórsson] |
| |
| | 2011 | | Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Proceedings Article | |
| 1 |
| Manjunath, Sharma [Sharma] |
| |
| | 2011 | | Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649 | Journal Article | |
| 1 |
| Mannila, Mehlhorn [-] |
| |
| | 1985 | | A fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272 | Journal Article | |
| 1 |
| Manss [-] |
| |
| | 1997 | | Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Margewitsch [-] |
| |
| | 1997 | | Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Martens, Skutella [Albers, Radzik] |
| |
| | 2004 | | Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531 | Proceedings Article | |
| 1 |
| Matijevic [-] |
| |
| | 2007 | | Geometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes | Thesis - PhD thesis | |
| 1 |
| Maue [-] |
| |
| | 2006 | | A Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Maue, Sanders, Matijevic [Sanders, Alvarez, Serna] |
| |
| | 2006 | | Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327 | Proceedings Article | |
| 1 |
| Maurer [-] |
| |
| | 1997 | | Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes | Thesis - Masters thesis | |
| 1 |
| Mavronicolas, Papatriantafilou, Tsigas [Mavronicolas] |
| |
| | 1997 | | The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688 | Proceedings Article | |
| 1 |
| McConnella, Mehlhorn, Näher, Schweitzer [McConnella, Näher, Schweitzer] |
| |
| | 2010 | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | Electronic Journal Article | |
| 1 |
| McGeoch, Sanders, Fleischer, Cohen, Precup [McGeoch, Fleischer, Cohen, Precup, Fleischer, Moret, Meineche Schmidt] |
| |
| | 2002 | | Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126 | Part of a Book | |
| 1 |
| Megow [Biermann, Götschel, Lutz-Westphal] |
| |
| | 2010 | | Keller oder Dach zuerst
In: Besser als Mathe, 111-116 | Part of a Book | |
| 1 |
| Megow, Mehlhorn, Schweitzer [Aceto, Henzinger, Sgall] |
| |
| | 2011 | | Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | Proceedings Article | |
| 1 |
| Megow, Mehlhorn, Schweitzer [Schweitzer] |
| |
| | 2012 | | Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72 | Journal Article | |
| 1 |
| Megow, Mestre [Mestre] |
| |
| | 2013 | | Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), | Proceedings Article | |
| 1 |
| Megow, Möhring, Schulz [Möhring, Schulz] |
| |
| | 2011 | | Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204 | Journal Article | |
| 1 |
| Megow, Skutella, Verschae, Wiese [Skutella, Verschae, Czumaj, Pitts, Wattenhofer] |
| |
| | 2012 | | The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700 | Proceedings Article | |
| 1 |
| Megow, Verschae [Verschae] |
| |
| | 2013 | | Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756 | Proceedings Article | |
