| BibTeX cite key | Author/Editor | Year | | Title | Type |
|---|
| JACM::MehlhornP1986 | Mehlhorn, Kurt
Preparata, F. P. | 1986 |  | Routing through a Rectangle
In: Journal of the ACM [33], 60-85 | Journal Article |
| JainKoetzingStephan2011 | Jain, Sanjay
Kötzing, Timo
Stephan, Frank | 2012 | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article |
| JALGO::KaufmannM1986 | Kaufmann, Michael
Mehlhorn, Kurt | 1986 | | Routing through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531 | Journal Article |
| Janardan-Smid95 | Janardan, Ravi
Smid, Michiel | 1995 | | On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198 | Proceedings Article |
| Jansen-Latin-98 | Jansen, Klaus | 1998 | | A New Characterization for Parity Graphs and a Coloring Problem with Costs
In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260 | Proceedings Article |
| Jansen-STACS-98 | Jansen, Klaus | 1998 | | The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297 | Proceedings Article |
| JansenKMS2010 | Jansen, Klaus
Kratsch, Stefan
Marx, Dániel
Schlotter, Ildikó | 2010 | | Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272 | Proceedings Article |
| JansenNeumann2010 | Jansen, Thomas
Neumann, Frank | 2010 | | Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334 | Journal Article |
| JansenPorkolab2002 | Jansen, Klaus
Porkolab, Lorant | 2002 | | Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520 | Journal Article |
| JansenSolisObaSviridenko2000 | Jansen, Klaus
Solis-Oba, Roberto
Sviridenko, Maxim | 2000 | | Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346 | Part of a Book |
| Jez2008ICALP | Jez, Artur
Okhotin, Alexander | 2014 | | Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94 | Journal Article |
| Jez2012STACS | Jez, Artur | 2014 | | The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718 | Journal Article |
| Jez2013CPM | Jez, Artur | 2013 | | Approximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176 | Proceedings Article |
| Jez2013DLT | Jez, Artur
Okhotin, Alexander | 2013 | | Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 | Proceedings Article |
| Jez2013DLTII | Jez, Artur | 2013 | | Recompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26 | Proceedings Article |
| Jez2013ICALP | Jez, Artur | 2013 | | One-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335 | Proceedings Article |
| Jez2013STACS | Jez, Artur | 2013 | | Recompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244 | Proceedings Article |
| Jez2014CPM | Jez, Artur | 2014 | | A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 | Proceedings Article |
| Jez2014CSR | Diekert, Volker
Jez, Artur
Plandowski, Wojciech | 2014 | | Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15 | Proceedings Article |
| Jez2014ICALP | Jez, Artur | 2014 | | Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article |
| Jez2014STACS | Jez, Artur
Lohrey, Markus | 2014 | | Approximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 | Proceedings Article |
| JezMaletti2013 | Jez, Artur
Maletti, Andreas | 2013 | | Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830 | Journal Article |
| JLM1998 | Jünger, Michael
Leipert, Sebastian
Mutzel, Petra | 1998 | | Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237 | Proceedings Article |
| JLM98 | Jünger, Michael
Leipert, Sebastian
Mutzel, Petra | 1998 | | A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612 | Journal Article |
| JMO97 | Jünger, Michael
Lee, E. K.
Mutzel, Petra
Odenthal, Thomas | 1997 | | A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24 | Proceedings Article |
| JOCO:EMR10 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | 2011 | | On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304 | Journal Article |
| joe97 | Könemann, Jochen | 1997 | | Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes | Thesis - Masters thesis |
| Johannsen2006a | Johannsen, Daniel | 2006 | | Sampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin | Thesis - Masters thesis |
| JohannsenLK2010 | Johannsen, Daniel
Lengler, Johannes | 2010 | | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Proceedings Article |
| JohannsenPanagiotou2010 | Johannsen, Daniel
Panagiotou, Konstantinos | 2010 | | Vertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 | Proceedings Article |
| JohannsenPhD2010 | Johannsen, Daniel | 2010 | | Random combinatorial structures and randomized search heuristics
Universität des Saarlandes | Thesis - PhD thesis |
| JohannsenRazgonWahlstroem2008 | Johannsen, Daniel
Razgon, Igor
Wahlström, Magnus | 2009 | | Solving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85 | Proceedings Article |
| jounal/ploscb/ZotenkoMOP2008 | Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa | 2008 | | Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x | Journal Article |
| journals/dcg/AltMWW88 | Alt, Helmut
Mehlhorn, Kurt
Wagener, Hubert
Welzl, Emo | 1988 | | Congruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256 | Journal Article |
| journals/tc/FurerM89 | Fürer, Martin
Mehlhorn, Kurt | 1989 | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | Journal Article |
| journal/algo/GandhiM2007 | Gandhi, Rajiv
Mestre, Julián | 2009 | | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | Journal Article |
| Juenger-Mutzel-1-97 | Jünger, Michael
Mutzel, Petra | 1997 | | 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25 | Journal Article |
| Juenger-Mutzel-2-96 | Jünger, Michael
Mutzel, Petra | 1996 | | Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), - | Proceedings Article |
| Juenger-Mutzel95 | Jünger, Michael
Mutzel, Petra | 1995 | | The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130 | Proceedings Article |
| Juenger-Mutzel96 | Jünger, Michael
Mutzel, Petra | 1996 | | Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59 | Journal Article |
| Jung96 | Jung, Karin | 1996 | | Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes | Thesis - Masters thesis |
| JungLenhofMuellerRueb2000 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 2000 | | Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522 | Journal Article |
| JungLenhofMüllerRüb1999 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 1999 | | Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22 | Proceedings Article |
| jurkiewicz2009 | Jurkiewicz, Tomasz | 2009 | | Cycle Bases in Graphs
Universität des Saarlandes | Thesis - Masters thesis |
| Jurkiewicz2013 | Jurkiewicz, Tomasz | 2013 | | Toward Better Computation Models for Modern Machines
Universität des Saarlandes | Thesis - PhD thesis |
| JurkiewiczDanilewski2011 | Jurkiewicz, Tomasz
Danilewski, Piotr | 2011 | | Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Unpublished/Draft |
| Juurlink-Mutzel95 | Juurlink, Ben
Mutzel, Petra | 1995 | | ?
In: Conference on High-Performance Computing, 125-130 | Proceedings Article |
| Juurlink-Sibeyn95 | Juurlink, Ben
Sibeyn, Jop F. | 1995 | | Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760 | Proceedings Article |
| Kaligosi2006a | Kaligosi, Kanela
Sanders, Peter | 2006 | | How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791 | Proceedings Article |
| Kaligosi2006b | Brodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin | 2006 | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article |
| Kaligosi/Master03 | Kaligosi, Kanela | 2003 | | Length bounded network flows
Universität des Saarlandes | Thesis - Masters thesis |
| KamranDipl05 | Kamran Azam, Muhammad | 2005 | | Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes | Thesis - Masters thesis |
| Kapoor96 | Kapoor, Sanjiv | 1996 | | On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146 | Proceedings Article |
| KapoorSmid96 | Kapoor, Sanjiv
Smid, Michiel | 1996 | | New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796 | Journal Article |
| Kappel98 | Kappel, Holger | 1998 | | Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes | Thesis - Masters thesis |
| Karkkainen2002 | Kärkkäinen, Juha | 2002 | | Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357 | Proceedings Article |
| Karkkainen2003a | Kärkkäinen, Juha
Rao, S. Srinivasa | 2003 | | Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170 | Part of a Book |
| KarkkainenSanders2003 | Kärkkäinen, Juha
Sanders, Peter | 2003 | | Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955 | Proceedings Article |
| Karrenbauer2004 | Karrenbauer, Andreas | 2004 | | Packing Boxes with Arbitrary Rotations
Universität des Saarlandes | Thesis - other |
| KarrenbauerPhD | Karrenbauer, Andreas | 2007 | | Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes | Thesis - PhD thesis |
| Kasan95 | Kasan, Binaman | 1995 | | Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes | Thesis - Masters thesis |
| Katajainen-Traeff97 | Katajainen, Jyrki
Träff, Jesper Larsson | 1997 | | A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228 | Proceedings Article |
| KatMey03 | Katriel, Irit
Meyer, Ulrich | 2003 | | Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84 | Part of a Book |
| Katriel2004 | Katriel, Irit | 2004 | | On Algorithms for Online Topological Ordering and Sorting | Report |
| Katriel2004a | Katriel, Irit | 2004 | | Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199 | Proceedings Article |
| Katriel2004b | Katriel, Irit | 2004 | | On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178 | Journal Article |
| KatrielSWC2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | 2005 | | GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11 | Proceedings Article |
| KatrielThesis2004 | Katriel, Irit | 2004 | | Constraints and Changes
Universität des Saarlandes | Thesis - PhD thesis |
| KatrielThielGCC | Katriel, Irit
Thiel, Sven | 2005 | | Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | Journal Article |
| KatSanTra03 | Katriel, Irit
Sanders, Peter
Träff, Jesper Larsson | 2003 | | A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690 | Proceedings Article |
| Kaufmann-Meyer-Sibeyn94 | Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F. | 1994 | | Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663 | Proceedings Article |
| Kaufmann-Meyer-Sibeyn97a | Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F. | 1997 | | Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140 | Journal Article |
| Kaufmann-Meyer-Sibeyn97b | Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F. | 1997 | | Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319 | Proceedings Article |
| Kaufmann-Raman-Sibeyn97 | Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F. | 1997 | | Routing on Meshes with Buses
In: Algorithmica [18], 417-444 | Journal Article |
| Kaufmann-Schroeder-Sibeyn95 | Kaufmann, Michael
Schröder, Heiko
Sibeyn, Jop F. | 1995 | | Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95 | Journal Article |
| Kaufmann-Sibeyn-1-95 | Kaufmann, Michael
Sibeyn, Jop F. | 1995 | | Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422 | Proceedings Article |
| Kaufmann-Sibeyn-Suel95 | Kaufmann, Michael
Sibeyn, Jop F.
Suel, Torsten | 1995 | | Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88 | Proceedings Article |
| Kaufmann84/12 | Kaufmann, Michael
Mehlhorn, Kurt | 1984 | | Local routing of two-terminal nets is easy | Report |
| Kav08 | Kavitha, Telikepalli | 2008 | | On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354 | Proceedings Article |
| Kavitha2007TCS | Kavitha, Telikepalli
Mehlhorn, Kurt | 2007 | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Journal Article |
| Kavitha2012 | Kavitha, Telikepalli
Mestre, Julián | 2012 | | Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14 | Journal Article |
| KavithaALG2011 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios | 2011 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | Journal Article |
| KavithaMestre2008 | Kavitha, Telikepalli
Mestre, Julian | 2009 | | Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | Proceedings Article |
| KavithaMestre2010 | Kavitha, Telikepalli
Mestre, Julian | 2010 | | Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14 | Electronic Journal Article |
| KavithaTCS2011 | Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana | 2011 | | Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690 | Journal Article |
| KavvadiasPantziouSpirakisZaroliagis96 | Kavvadias, Dimitris J.
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos | 1996 | | Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154 | Journal Article |
| Kelsen-et-al95 | Han, Xiaofeng
Kelsen, Pierre
Ramachandran, Vijaya
Tarjan, Robert E. | 1995 | | Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358 | Journal Article |
| Kelsen96 | Kelsen, Pierre | 1996 | | Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233 | Proceedings Article |
| KelsenMahajanRamesh96 | Kelsen, Pierre
Mahajan, Sanjeev
Ramesh, Hariharan | 1996 | | Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52 | Proceedings Article |
| kerber-ijcm-2009 | Kerber, Michael | 2009 | | Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | Journal Article |
| Kerber2006 | Kerber, Michael | 2006 | | Analysis of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Masters thesis |
| KerberPhD2009 | Kerber, Michael | 2009 | | Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes | Thesis - PhD thesis |
| KerberSagraloff:RootApprox:2011 | Kerber, Michael
Sagraloff, Michael | 2011 | | Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | Proceedings Article |
| KerberSagraloff_JSC_2012 | Kerber, Michael
Sagraloff, Michael | 2012 | | A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258 | Journal Article |
| Kerber_CASC_2009 | Kerber, Michael | 2009 | | On the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article |
| Kerzmann2000 | Kerzmann, Andreas | 2000 | | Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes | Thesis - Masters thesis |
| Kesselmann2004a | Kesselman, Alexander
Kogan, Kirill | 2005 | | Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844 | Proceedings Article |
| Kesselmann2004b | Kesselman, Alexander
Guez, Dan
Rosen, Adi | 2004 | | Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102 | Proceedings Article |
| Kesselmann2004c | Kesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim | 2004 | | Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583 | Journal Article |
| Kesselmann2004d | Kesselman, Alexander
Mansour, Yishay | 2004 | | Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182 | Journal Article |
| Kesselmann2005wons | Kesselman, Alexander
Kowalski, Dariusz | 2005 | | Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124 | Proceedings Article |
| Kessler-Traeff97 | Keßler, Christoph W.
Träff, Jesper Larsson | 1997 | | Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221 | Proceedings Article |
| KesslerDipl02 | Kessler, Harald | 2002 | | Robust Computation of Visibility Maps
Universität des Saarlandes | Thesis - Masters thesis |
| Kettner2003DegreeBound | Kettner, Lutz
Kirkpatrick, David
Mantler, Andrea
Snoeyink, Jack
Speckmann, Bettina
Takeuchi, Fumihiko | 2003 | | Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12 | Journal Article |
| Kettner2003Safari | Kettner, Lutz
Rossignac, Jarek
Snoeyink, Jack | 2003 | | The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116 | Journal Article |
| Kettner2004Classroom | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | 2004 | | Classroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713 | Proceedings Article |
| Kettner2004Handbook | Kettner, Lutz
Näher, Stefan | 2004 | | Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463 | Part of a Book |
| Kettner2005Handle | Kettner, Lutz | 2005 | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10 | Electronic Proceedings Article |
| Kettner2005PseudoTriangEnum | Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack | 2005 | | Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110 | Proceedings Article |
| Kettner2005SocgVideoProceedings | Mitchell, Rote, Kettner (ed.) | 2005 | | 21st Annual Symposium on Computational Geometry (SCG'05) | Proceedings |
| Kettner2005Stxxl | Dementiev, Roman
Kettner, Lutz
Sanders, Peter | 2005 | | STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651 | Proceedings Article |
| Kettner2005StxxlReport | Dementiev, Roman
Kettner, Lutz
Sanders, Peter | 2005 | | STXXL: Standard Template Library for XXL Data Sets | Report |
| Kettner2006Handle | Kettner, Lutz | 2006 | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43 | Proceedings Article |
| Kettner2006PseudoTEnum | Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack | 2006 | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | Journal Article |
| Kettner2007CGALKernel | Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael | 2007 | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | Journal Article |
| Kettner2007Classroom | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | 2008 | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article |
| Kettner2007ECGBook | Mourrain, Bernard
Pion, Sylvain
Schmitt, Susanne
Técourt, Jean-Pierre
Tsigaridas, Elias
Wolpert, Nicola | 2007 | | Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155 | Part of a Book |
| Kettner2007ECGBookz | Fogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola | 2007 | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book |
| Kettner2007Nef3 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | 2007 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Journal Article |
| Kettner98 | Kettner, Björn | 1998 | | Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes | Thesis - Masters thesis |
| KhachiyanPorkolab2000 | Khachiyan, Leonid
Porkolab, Lorant | 2000 | | Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224 | Journal Article |
| Khosla2013 | Khosla, Megha | 2013 | | Balls into Bins Made Faster
In: Algorithms - ESA 2013, | Proceedings Article |
| KimPaulPhilip2012 | Kim, Eun Jung
Paul, Christophe
Philip, Geevarghese | 2012 | | A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 | Proceedings Article |
| KKM01 | Klau, Gunnar W.
Klein, Karsten
Mutzel, Petra | 2001 | | An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51 | Proceedings Article |
| KKS | Kesselman, Alexander
Kowalski, Dariusz
Segal, Michael | 2005 | | Energy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26 | Journal Article |
| KKS-DSN | Konwar, Kishori
Kowalski, Dariusz
Shvartsman, Alexander | 2004 | | The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324 | Proceedings Article |
| Klaer94 | Klär, Gerhard | 1994 | | Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes | Thesis - Masters thesis |
| Klau1997b | Klau, Gunnar W. | 1998 | | Visuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales Zeichnen | Miscellaneous |
| Klau97a | Klau, Gunnar W. | 1997 | | Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes | Thesis - Masters thesis |
| KlauDiss01 | Klau, Gunnar W. | 2002 | | A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes | Thesis - PhD thesis |
| Klauk/Diplom04 | Klauk, Mathias | 2004 | | Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes | Thesis - Masters thesis |
| KlauMutzel1999 | Klau, Gunnar W.
Mutzel, Petra | 1999 | | Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37 | Proceedings Article |
| KlauMutzel1999a | Klau, Gunnar W.
Mutzel, Petra | 1999 | | Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319 | Proceedings Article |
| Klein03/89 | Klein, R.
Mehlhorn, Kurt
Meiser, Stefan | 1989 | | On the construction of abstract Voronoi diagrams, II. | Report |
| Klein2000 | Klein, Karsten | 2000 | | Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes | Thesis - Masters thesis |
| Klein2004 | Klein, Christian | 2004 | | Controlled Perturbation for Voronoi Diagrams
Universität des Saarlandes | Thesis - Masters thesis |
| Klein2004b | Klein, Christian | 2004 | | A Fast Root Checking Algorithm | Report |
| KleMehMei90 | Klein, R.
Mehlhorn, Kurt
Meiser, Stefan | 1990 | | On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154 | Proceedings Article |
| KlKu2006a | Klein, Rolf
Kutz, Martin | 2007 | | Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | Proceedings Article |
| KlKu2006b | Klein, Rolf
Kutz, Martin | 2006 | | The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272 | Proceedings Article |
| KLM+2000 | Kececioglu, John
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
Vingron, Martin | 2000 | | A polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186 | Journal Article |
| KM00a | Klau, Gunnar W.
Mutzel, Petra | 2000 | | Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350 | Proceedings Article |
| KM03a | Klau, Gunnar W.
Mutzel, Petra | 2003 | | Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608 | Part of a Book |
| KM03b | Mehlhorn, Kurt | 2003 | | The reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263 | Part of a Book |
| KM08 | Kavitha, Telikepalli
Nasre, Meghana | 2008 | | Optimal Popular Matchings | Miscellaneous |
| KM2005 | Kavitha, Telikepalli
Mehlhorn, Kurt | 2005 | | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665 | Proceedings Article |
| KMM07 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios | 2007 | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | Proceedings Article |
| KMMP2004c | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna | 2004 | | A Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857 | Proceedings Article |
| KMS-ICDCS | Kowalski, Dariusz
Musial, Peter M.
Shvartsman, Alexander | 2005 | | Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58 | Proceedings Article |
| KMV2005 | Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal | 2005 | | Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183 | Journal Article |
| KMW2010 | Kratsch, Stefan
Marx, Dániel
Wahlström, Magnus | 2010 | | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500 | Proceedings Article |
| Knauer2012 | Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj | 2012 | | Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85 | Journal Article |
| KobelBachelor2008 | Kobel, Alexander | 2008 | | Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes | Thesis - Bachelor thesis |
| KobelMaster2011 | Kobel, Alexander | 2011 | | Certified numerical root finding
Universität des Saarlandes | Thesis - Masters thesis |
| Koe-Leh-Neu-Oli:c:10:AcoMinCut | Kötzing, Timo
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro S. | 2010 | | Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Proceedings Article |
| Koe-Neu-Roe-Wit:c:10:ACOTSP | Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten | 2010 | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article |
| Koe-Neu-Sud-Wag:c:Foga11AcoLinFun | Kötzing, Timo
Neumann, Frank
Sudholt, Dirk
Wagner, Markus | 2011 | | Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 | Proceedings Article |
| Koetzing2010LatticeLearning | Kasprzik, Anna
Kötzing, Timo | 2010 | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article |
| Koetzing2010NUMemLimited | Case, John
Kötzing, Timo | 2010 | | Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299 | Proceedings Article |
| Koetzing2010NUTechniques | Case, John
Kötzing, Timo | 2010 | | Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Proceedings Article |
| KoetzingALT2011 | Kötzing, Timo | 2011 | | Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article |
| KoetzingMolter2012 | Kötzing, Timo
Molter, Hendrik | 2012 | | ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | Proceedings Article |
| KoetzingNRW2012 | Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten | 2012 | | Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21 | Journal Article |
| KoetzingNS11GP | Kötzing, Timo
Neumann, Frank
Spöhel, Reto | 2011 | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article |
| KoetzingSNO2011 | Kötzing, Timo
Sutton, Andrew M.
Neumann, Frank
O'Reilly, Una-May | 2012 | | The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340 | Proceedings Article |
| KoetzingST2011 | Kötzing, Timo
Sudholt, Dirk
Theile, Madeleine | 2011 | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article |
| KohlbacherLenhof1999 | Kohlbacher, Oliver
Lenhof, Hans-Peter | 1999 | | Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92 | Proceedings Article |
| KohlbacherLenhof2000 | Kohlbacher, Oliver
Lenhof, Hans-Peter | 2000 | | BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824 | Journal Article |
| Koldehofe1999 | Koldehofe, Boris | 1999 | | Animation and Analysis of Distributed Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
| Koller-et-al:dominance-constraints | Koller, Alexander
Mehlhorn, Kurt
Niehren, Joachim | 2000 | | A Polynomial-Time Fragment of Dominance Constraints
In: Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics (ACL-00), 368-375 | Proceedings Article |
| Kollias2012 | Kollias, Konstantinos | 2013 | | Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440 | Electronic Journal Article |
| Kontogiannis2000 | Kontogiannis, Spyros
Pantziou, Grammati E.
Spirakis, Paul G.
Yung, Moti | 2000 | | Robust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464 | Journal Article |
| Kontogiannis2002 | Kontogiannis, Spyros | 2002 | | Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 124-133 | Proceedings Article |
| Kov07 | Kovács, Annamária | 2007 | | Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes | Thesis - PhD thesis |
| Kovacs2004 | Kovács, Annamária | 2004 | | Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80 | Proceedings Article |
| Kovacs2005a | Kovács, Annamária | 2005 | | Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852 | Proceedings Article |
| Kovacs2005b | Kovács, Annamária | 2005 | | Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627 | Proceedings Article |
| Kovacs2006 | Kovács, Annamária | 2006 | | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198 | Proceedings Article |
| Kowalik2005 | Kowalik, Lukasz | 2006 | | Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101 | Proceedings Article |
| Kowalik2006 | Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej | 2006 | | A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73 | Journal Article |
| Kowalik2009 | Kowalik, Lukasz | 2009 | | Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742 | Journal Article |
| KowalikAdjSparseGraphs | Kowalik, Lukasz | 2007 | | Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | Journal Article |
| KowalikEdgeColoring | Cole, Richard
Kowalik, Lukasz | 2008 | | New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368 | Journal Article |
| KowalikISAAC2006 | Kowalik, Lukasz | 2006 | | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566 | Proceedings Article |
| KowalikKotzig | Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste | 2007 | | A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | Journal Article |
| Kowalski-LATIN-2004 | Fraigniaud, Pierre
Gasieniec, Leszek
Kowalski, Dariusz
Pelc, Andrzej | 2004 | | Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151 | Proceedings Article |
| Kowalski-SODA-2004 | Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz | 2004 | | The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993 | Proceedings Article |
| Kowalski-SPAA-2004 | Kowalski, Dariusz
Shvartsman, Alex | 2004 | | Writing-All deterministically and optimally using a non-trivial number of asynchronous processors
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 311-320 | Proceedings Article |
| Kowalski-STOC-2004 | Chlebus, Bogdan S.
Kowalski, Dariusz
Shvartsman, Alex | 2004 | | Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330 | Proceedings Article |
| Kowalski2003a | Chlebus, Bogdan S.
Kowalski, Dariusz | 2004 | | Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41 | Journal Article |
| Kowalski2003b | Kowalski, Dariusz
Pelc, Andrzej | 2004 | | Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891 | Journal Article |
| KP-APPROX | Kowalski, Dariusz
Pelc, Andrzej | 2004 | | Centralized deterministic broadcasting in undirected multi-hop radio networks
In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, 171-182 | Proceedings Article |
| KP-ISAAC | Kowalski, Dariusz
Pelc, Andrzej | 2004 | | Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656 | Proceedings Article |
| KP-SIROCCO | Kowalski, Dariusz
Pelc, Andrzej | 2003 | | Time of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Proceedings of the 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 195-210 | Proceedings Article |
| KP-TCS | Kowalski, Dariusz
Pelc, Andrzej | 2005 | | Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371 | Journal Article |
| KPSS2010 | Kuhn, Fabian
Panagiotou, Konstantinos
Spencer, Joel
Steger, Angelika | 2010 | | Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964 | Proceedings Article |
| KrandickMehlhorn2004a | Krandick, Werner
Mehlhorn, Kurt | 2004 | | New Bounds for the Descartes Method | Report |
| KraNeuGECCO2009 | Kratsch, Stefan
Neumann, Frank | 2009 | | Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300 | Proceedings Article |
| Kratsch-et-al:interval | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | 2003 | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167 | Proceedings Article |
| Kratsch2008 | Kratsch, Stefan | 2009 | | Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612 | Electronic Proceedings Article |
| KratschLNO2010 | Kratsch, Stefan
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro Simone | 2010 | | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 | Proceedings Article |
| KratschPhD2010 | Kratsch, Stefan | 2010 | | Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes | Thesis - PhD thesis |
| KratschPilipczukPilipczukWahlstroem2012 | Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus | 2012 | | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 | Proceedings Article |
| KratschS2010 | Kratsch, Stefan
Schweitzer, Pascal | 2010 | | Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92 | Proceedings Article |
| KratschW2009 | Kratsch, Stefan
Wahlström, Magnus | 2009 | | Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article |
| KratschWahlstroem2012a | Kratsch, Stefan
Wahlström, Magnus | 2012 | | Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103 | Proceedings Article |
| KratschWahlstroem2012b | Kratsch, Stefan
Wahlström, Magnus | 2012 | | Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459 | Proceedings Article |
| KroGhaMicNeuPPSN2008 | Kroeske, Jense
Ghandar, Adam
Michalewicz, Zbigniew
Neumann, Frank | 2008 | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article |
| KrohmerMaster2012 | Krohmer, Anton | 2012 | | Finding cliques in scale-free networks
Universität des Saarlandes | Thesis - Masters thesis |
| KrStWe2009 | Krumke, Sven
van Stee, Rob
Westphal, Stefan | 2009 | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book |
| Krysta1999a | Krysta, Piotr
Pacholski, Leszek | 1999 | | The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219 | Journal Article |
| Krysta2001 | Krysta, Piotr
Kumar, V. S. Anil | 2001 | | Approximation Algorithms for Minimum Size 2-connectivity Problems
In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS-01), 431-442 | Proceedings Article |
| Krysta2001b | Krysta, Piotr | 2001 | | Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes | Thesis - PhD thesis |
| Krysta2001c | Krysta, Piotr
Solis-Oba, Roberto | 2001 | | Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247 | Journal Article |
| Krysta2002a | Csaba, Bela
Krysta, Piotr
Karpinski, Marek | 2002 | | Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83 | Proceedings Article |
| Krysta2002b | Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold | 2002 | | Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296 | Proceedings Article |
| Krysta2003b | Krysta, Piotr | 2003 | | Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288 | Journal Article |
| KrystaLorys1999 | Krysta, Piotr
Lorys, Krzysztof | 1999 | | Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413 | Proceedings Article |
| ks-ncrah-10 | Kerber, Michael
Sagraloff, Michael | 2011 | | A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430 | Journal Article |
| KS11 | Kayal, Neeraj
Saha, Chandan | 2011 | | On the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299 | Proceedings Article |
| KS12 | Kayal, Neeraj
Saha, Chandan | 2012 | | On the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15 | Journal Article |
| Ksinsik96 | Ksinsik, Patric | 1996 | | Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes | Thesis - Masters thesis |
| KSV03 | Krysta, Piotr
Sanders, Peter
Vöcking, Berthold | 2003 | | Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510 | Proceedings Article |
| KT03:gcc | Katriel, Irit
Thiel, Sven | 2003 | | Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451 | Proceedings Article |
| Kumar1999a | Kumar, V. S. Anil
Ramesh, Hariharan | 1999 | | Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454 | Proceedings Article |
| Kumar1999b | Kumar, V. S. Anil
Ramesh, Hariharan | 1999 | | Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS-99), 241-251 | Proceedings Article |
| Kumar2000 | Kumar, V. S. Anil
Arya, Sunil
Ramesh, Hariharan | 2000 | | Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635 | Proceedings Article |
| Kumar2001a | Kumar, V. S. Anil | 2001 | | Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17 | Journal Article |
| Kursawe2002 | Albers, Susanne
Kursawe, Klaus
Schuierer, Sven | 2002 | | Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143 | Journal Article |
| Kursawe98 | Kursawe, Klaus | 1998 | | Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes | Thesis - Masters thesis |
| Kutz05 | Kutz, Martin
Pór, Attila | 2005 | | Angel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934 | Proceedings Article |
| Kutz2006 | Kutz, Martin | 2006 | | Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437 | Proceedings Article |
| Kutz3dAngel | Kutz, Martin | 2005 | | Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451 | Journal Article |
| KutzHGames:2004 | Kutz, Martin | 2005 | | Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36 | Proceedings Article |
| KutzSchw2006 | Kutz, Martin
Schweitzer, Pascal | 2007 | | ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157 | Proceedings Article |
| KW2010b | Kratsch, Stefan
Wahlström, Magnus | 2010 | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article |
| Kwappik98 | Kwappik, Carsten | 1998 | | Exact Linear Programming
Universität des Saarlandes | Thesis - Masters thesis |
| KwekMehlhorn2003 | Kwek, St.
Mehlhorn, Kurt | 2003 | | Optimal Search for Rationals
In: Information Processing Letters [86], 23-26 | Journal Article |
Lambert2000
| Lambert, Oliver | 2000 | | Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes | Thesis - Masters thesis |
| LambertDipl01 | Lambert, Georg | 2001 | | Ein Parametric Search Toolkit
Universität des Saarlandes | Thesis - Masters thesis |
| Lang94 | Lang, Hans-Hermann | 1994 | | Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes | Thesis - Masters thesis |
| Lauer1998Diplom | Lauer, Thorsten | 1998 | | Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes | Thesis - Masters thesis |
| Lee2010a | Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung | 2010 | | Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190 | Electronic Proceedings Article |
| Lee2010b | Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei | 2010 | | Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35 | Proceedings Article |
| Lee2010c | Han, Xin
Lam, Tak-Wah
Lee, Lap-Kei
To, Isaac K. K.
Wong, Prudence W. H. | 2010 | | Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | Journal Article |
| Lee2010d | Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk | 2011 | | Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517 | Journal Article |
| Lee2011b | Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei | 2011 | | Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403 | Electronic Proceedings Article |
| Leejh2000a | Lee, Jae-Ha
Park, Sang-Min
Chwa, Kyung-Yong | 2000 | | Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220 | Journal Article |
| Leejh2000b | Lee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong | 2000 | | Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783 | Journal Article |
| Leejha2001 | Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong | 2001 | | Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468 | Proceedings Article |
| Leejhc2000 | Lee, Jae-Ha
Cheong, Otfried
Kwon, Woo-Cheol
Shin, Sung-Yong
Chwa, Kyung-Yong | 2000 | | Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325 | Proceedings Article |
| Leejhd2000 | Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong | 2000 | | Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526 | Proceedings Article |
| LeeLK2012 | Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung | 2012 | | Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111 | Journal Article |
| LehNeuOliCEC2009 | Oliveto, Pietro Simone
Lehre, Per Kristian
Neumann, Frank | 2009 | | Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 | Proceedings Article |
| LehnSchw2007 | Lehnert, Jörg
Schweitzer, Pascal | 2007 | | The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241 | Journal Article |
| Leinenbach95 | Leinenbach, Stefan | 1997 | | Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes | Thesis - Masters thesis |
| Lenhof-1-97 | Lenhof, Hans-Peter | 1997 | | New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191 | Proceedings Article |
| Lenhof-et-al-1-97 | Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John | 1997 | | A Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250 | Proceedings Article |
| Lenhof-et-al-2-97 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 1997 | | Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521 | Journal Article |
| Lenhof-et-al-3-97 | Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine | 1997 | | Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM | Proceedings Article |
| Lenhof-et-al95 | Datta, Amitava
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel | 1995 | | Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503 | Journal Article |
| Lenhof-Smid-1-92 | Lenhof, Hans-Peter
Smid, Michiel | 1992 | | Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398 | Proceedings Article |
| Lenhof-Smid-1-95 | Lenhof, Hans-Peter
Smid, Michiel | 1995 | | Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312 | Journal Article |
| Lenhof-Smid-2-92 | Lenhof, Hans-Peter
Smid, Michiel | 1992 | | Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386 | Proceedings Article |
| Lenhof-Smid-2-94 | Lenhof, Hans-Peter
Smid, Michiel | 1994 | | Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49 | Journal Article |
| Lenhof-Smid-2-95 | Lenhof, Hans-Peter
Smid, Michiel | 1995 | | Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288 | Journal Article |
| Lenhof-Smid-91 | Lenhof, Hans-Peter
Smid, Michiel | 1991 | | An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363 | Proceedings Article |
| Lenhof-Smid93 | Lenhof, Hans-Peter
Smid, Michiel | 1993 | | An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267 | Journal Article |
| Lenhof-Smid94 | Lenhof, Hans-Peter
Smid, Michiel | 1994 | | An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387 | Proceedings Article |
| Lenhof95 | Lenhof, Hans-Peter | 1995 | | An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139 | Part of a Book |
| LenhofMorgensternReinert1999 | Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut | 1999 | | An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210 | Journal Article |
| lenhof_habil | Lenhof, Hans-Peter | 1999 | | Bioinformatik
Universität des Saarlandes | Thesis - Habilitation thesis |
| Lennerz2001 | Lennerz, Christian
Schömer, Elmar | 2002 | | Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69 | Proceedings Article |
| LennerzDiss05 | Lennerz, Christian | 2005 | | Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes | Thesis - PhD thesis |
| LenReiVin1998 | Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin | 1998 | | A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530 | Journal Article |
| LenReiVin98 | Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin | 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 |
| Leonardi03 | Henzinger, Monika R.
Leonardi, Stefano | 2003 | | Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611 | Journal Article |
| Leonardi04 | Leonardi, Stefano
Schäfer, Guido | 2004 | | Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442 | Journal Article |
| Leonardi04EC | Leonardi, Stefano
Schäfer, Guido | 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 |
| Lermen97 | Lermen, Martin | 1997 | | Multiple Sequence Alignment
Universität des Saarlandes | Thesis - Masters thesis |
| Limbach2008 | Limbach, Sebastian | 2008 | | Continued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes | Thesis - Masters thesis |
| LJM97 | Jünger, Michael
Leipert, Sebastian
Mutzel, Petra | 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 |
| LLMMS2003 | Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F. | 2003 | | Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714 | Proceedings Article |
| lncs319*212 | Mehlhorn, Kurt
Rülling, W. | 1988 | | Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225 | Proceedings Article |
| lncs333*55 | Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark | 1988 | | On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70 | Proceedings Article |
| lncs379*88 | Mehlhorn, Kurt
Näher, S | 1989 | | A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | Proceedings Article |
| lotkeretal06cocoon | Lotker, Zvi
Majumdar, Debapriyo
Narayanaswamy, N.S.
Weber, Ingmar | 2006 | | Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225 | Proceedings Article |
| LpDisc2006 | Doerr, Benjamin | 2007 | | Lp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666 | Journal Article |
| LR2000 | Lermen, Martin
Reinert, Knut | 2000 | | The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671 | Journal Article |
| ls-dc-01 | Loock, Achim
Schömer, Elmar | 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 |
| LSWahlstroem2012 | Lokshtanov, Daniel
Saurabh, Saket
Wahlström, Magnus | 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 |
| LuettkeHuettmann2000Thesis | Lüttke-Hüttmann, Dirk | 2000 | | Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes | Thesis - Masters thesis |
| Lutter96 | Lutter, Stefan | 1996 | | Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes | Thesis - Masters thesis |
| M01 | Mutzel, Petra | 2001 | | An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080 | Journal Article |
| Mahajan-Ramos-Subrahmanyam97 | Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V. | 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 |
| MainbergerWTJND11 | Mainberger, Markus
Hoffmann, Sebastian
Weickert, Joachim
Tang, Ching Hoo
Johannsen, Daniel
Neumann, Frank
Doerr, Benjamin | 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 |
| Mal05 | Elmasry, Amr
Elbassioni, Khaled M. | 2005 | | Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251 | Electronic Proceedings Article |
| Mal05z | Malamatos, Theocharis | 2005 | | Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194 | Electronic Proceedings Article |
| Malamatos2007a | Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun | 2007 | | Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610 | Journal Article |
| Malamatos2007b | Arya, Sunil
Malamatos, Theocharis
Mount, David M. | 2007 | | A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17 | Journal Article |
| Malamatos2008 | Malamatos, Theocharis | 2008 | | Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103 | Journal Article |
| Manjunath2008 | Eigensatz, Michael
Giesen, Joachim
Manjunath, Madhusudan | 2008 | | The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214 | Proceedings Article |
| Manjunath2008th | Manjunath, Madhusudan | 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 |
| Manjunath2009a | Giesen, Joachim
Manjunath, Madhusudan | 2009 | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article |
| Manjunath2009b | Elmasry, Amr
Manjunath, Madhusudan | 2009 | | Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103 | Proceedings Article |
| Manjunath2010 | Amini, Omid
Manjunath, Madhusudan | 2010 | | Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Electronic Journal Article |
| Manjunath2011 | Manjunath, Madhusudan
Sharma, Vikram | 2011 | | Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649 | Journal Article |
| Manss97 | Manss, Christian | 1997 | | Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes | Thesis - Masters thesis |
| MaRaSu00 | Ramos, Edgar A. | 2001 | | Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395 | Journal Article |
| Margewitsch97 | Margewitsch, Erwin | 1997 | | Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes | Thesis - Masters thesis |
| Martens2004 | Martens, Maren
Skutella, Martin | 2004 | | Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531 | Proceedings Article |
| Master03/Parreira | Parreira, Josiane | 2003 | | Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes | Thesis - Masters thesis |
| MasterWang2012 | Wang, Pengming | 2012 | | Certification of Curve Arrangements
Universität des Saarlandes | Thesis - Masters thesis |
| MastSteurer06 | Steurer, David | 2006 | | An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes | Thesis - Masters thesis |
| MatijevicPhD | Matijevic, Domagoj | 2007 | | Geometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes | Thesis - PhD thesis |
| Maue2006 | Maue, Jens | 2006 | | A Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes | Thesis - Masters thesis |
| MaueSandersMatijevic2006 | Maue, Jens
Sanders, Peter
Matijevic, Domagoj | 2006 | | Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327 | Proceedings Article |
| Maurer97 | Maurer, Tanja | 1997 | | Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes | Thesis - Masters thesis |
| Mavronikolas-et-al97 | Mavronicolas, Marios
Papatriantafilou, Marina
Tsigas, Philippas | 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 |
| Mcbg2006 | Bárány, Imre
Doerr, Benjamin | 2006 | | Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | Journal Article |
| McConnell2010 | Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | 2011 | | Certifying algorithms
In: Computer Science Review [5], 119-161 | Journal Article |
| McConnella2010 | McConnella, Ross M.
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | 2010 | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | Electronic Journal Article |
| Megow2011-explore | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | 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 |
| Megow2011-MCsched | Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen | 2012 | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article |
| Megow2011-speed | Anand, S.
Garg, Naveen
Megow, Nicole | 2011 | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article |
| Megow2012-eulerian | Höhn, Wiebke
Jacobs, Tobias
Megow, Nicole | 2012 | | On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309 | Journal Article |
| Megow2012-universal | Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen | 2012 | | Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586 | Journal Article |
| MegowMatheonBuch2009 | Megow, Nicole | 2010 | | Keller oder Dach zuerst
In: Besser als Mathe, 111-116 | Part of a Book |
| MegowMehlhornSchweitzer2012 | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | 2012 | | Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72 | Journal Article |
| MegowMestre2013 | Megow, Nicole
Mestre, Julian | 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 |
| MegowMS10-turnaround | Megow, Nicole
Möhring, Rolf H.
Schulz, Jens | 2011 | | Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204 | Journal Article |
| MegowSVW2012 | Megow, Nicole
Skutella, Martin
Verschae, Jose
Wiese, Andreas | 2012 | | The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700 | Proceedings Article |
| MegowV2013 | Megow, Nicole
Verschae, Jose | 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 |
| MegowWiese-SODA2013 | Günther, Elisabeth
Maurer, Olaf
Megow, Nicole
Wiese, Andreas | 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 |
| mehhorn80e | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | 1980 | | Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | Journal Article |
| MehlhonMestre2009 | Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián | 2010 | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Journal Article |
| mehlhorn | Konidaris, G.
Mehlhorn, Kurt
Shell, D.A. | 2004 | | An optimal algorithm for finding edge segment adjacencies in configurations of convex polygons | Unpublished/Draft |
| Mehlhorn-et-al-1-96 | Mehlhorn, Kurt
Näher, Stefan
Schilz, Thomas
Schirra, Stefan
Seel, Michael
Seidel, Raimund
Uhrig, Christian | 1996 | | Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165 | Proceedings Article |
| Mehlhorn-et-al97 | Mehlhorn, Kurt
Shermer, Thomas C.
Yap, Chee | 1997 | | A complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138 | Proceedings Article |
| Mehlhorn-et-al99 | Mehlhorn, Kurt
Näher, Stefan
Seel, Michael
Seidel, Raimund
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian | 1999 | | Checking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104 | Journal Article |
| Mehlhorn-Mutzel96 | Mehlhorn, Kurt
Mutzel, Petra | 1996 | | On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242 | Journal Article |
| Mehlhorn-Naeher95 | Mehlhorn, Kurt
Näher, Stefan | 1995 | | LEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102 | Journal Article |
| Mehlhorn-Priebe95 | Mehlhorn, Kurt
Priebe, Volker | 1995 | | On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198 | Proceedings Article |
| Mehlhorn-Sanders:Toolbox | Mehlhorn, Kurt
Sanders, Peter | 2008 | | Algorithms and Data Structures: The Basic Toolbox | Book |
| Mehlhorn-Schaefer:WeightedMatchings | Mehlhorn, Kurt
Schäfer, Guido | 2000 | | Implementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38 | Proceedings Article |
| Mehlhorn-Uhrig95 | Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian | 1995 | | Lower bounds for set intersection queries
In: Algorithmica [14], 154-168 | Journal Article |
| Mehlhorn-Uhrig97 | Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian | 1997 | | Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198 | Journal Article |
| mehlhorn01c | Mehlhorn, Kurt | 2001 | | A Remark on the Sign Variation Method for Real Root Isolation | Unpublished/Draft |
| mehlhorn01g | Mehlhorn, Kurt | 2001 | | From Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273 | Part of a Book |
| Mehlhorn02 | Mehlhorn, Kurt | 2002 | | Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87 | Proceedings Article |
| mehlhorn03 | Mehlhorn, Kurt | 2003 | | The Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222 | Proceedings Article |
| mehlhorn05 | Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.) | 2005 | | Cache-Oblivious and Cache-Aware Algorithms | Report |
| mehlhorn05 | Mehlhorn, Kurt | 2005 | | Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532 | Proceedings Article |
| mehlhorn05 | Mehlhorn, Kurt
Waldmann, Uwe
Wilhelm, Reinhard | 2005 | | Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108 | Part of a Book |
| mehlhorn05o | Kaligosi, Kanela
Mehlhorn, Kurt
Munro, J. Ian
Sanders, Peter | 2005 | | Towards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 | Proceedings Article |
| mehlhorn05z | Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan | 2005 | | Structural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194 | Journal Article |
| mehlhorn06 | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | 2006 | | Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 | Proceedings Article |
| mehlhorn06b | Kratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P. | 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 |
| mehlhorn06e | Krandick, Werner
Mehlhorn, Kurt | 2006 | | New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66 | Journal Article |
| mehlhorn06x | Mehlhorn, Kurt | 2006 | | Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2 | Proceedings Article |
| mehlhorn06y | Abraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt | 2005 | | Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175 | Proceedings Article |
| mehlhorn06z | Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi | 2006 | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article |
| Mehlhorn157 | Mehlhorn, Kurt
Seel, Michael | 2003 | | Infimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255 | Journal Article |
| Mehlhorn1993h | Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund | 1993 | | Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212 | Journal Article |
| Mehlhorn1999 | Mehlhorn, Kurt
Näher, Stefan | 1999 | | LEDA: a platform for combinatorial and geometric computing | Book |
| mehlhorn2000o | Mehlhorn, Snelting (ed.) | 2000 | | Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für Informatik | Proceedings |
| Mehlhorn2004PolylineApprox | Aranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi | 2004 | | Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88 | Proceedings Article |
| Mehlhorn2007b | Mehlhorn, Kurt
Michail, Dimitrios | 2007 | | Implementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14 | Electronic Journal Article |
| Mehlhorn2008a | Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián | 2008 | | Assigning Papers to Referees | Unpublished/Draft |
| Mehlhorn2008b | Mehlhorn, Kurt
Kavitha, T.
Hariharan, R. | 2008 | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | Journal Article |
| Mehlhorn2010 | Mehlhorn, Kurt | 2010 | | Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11 | Proceedings Article |
| Mehlhorn2013 | Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M. | 2013 | | Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369 | Proceedings Article |
| mehlhorn73 | Mehlhorn, Kurt | 1973 | | The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25 | Report |
| mehlhorn73a | Mehlhorn, Kurt | 1973 | | On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196 | Proceedings Article |
| mehlhorn73b | Mehlhorn, Kurt | 1973 | | On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22 | Report |
| mehlhorn74 | Mehlhorn, Kurt | 1974 | | Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14 | Report |
| Mehlhorn74 | Mehlhorn, Kurt | 1974 | | The 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325 | Proceedings Article |
| mehlhorn74a | Mehlhorn, Kurt | 1974 | | Polynomial and Abstract Subrecursive Classes
In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109
In: Informatik Spektrum, 96-109 | Proceedings Article |
| mehlhorn75 | Alt, Helmut
Mehlhorn, Kurt | 1975 | | Untere Schranken für den Platzbedarf bei der kontext-freien Analyse | Report |
| mehlhorn75a | Mehlhorn, Kurt | 1975 | | A game on graphs | Report |
| mehlhorn75b | Mehlhorn, Kurt | 1974 | | Polynomial and abstract subrecursive classes
Cornell University | Thesis - PhD thesis |
| mehlhorn75by | Mehlhorn, Kurt | 1975 | | Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41 | Proceedings Article |
mehlhorn75bz
| Alt, Helmut
Mehlhorn, Kurt | 1975 | | A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33 | Journal Article |
| mehlhorn75f | Mehlhorn, Kurt | 1975 | | Nearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295 | Journal Article |
| mehlhorn75y | Mehlhorn, Kurt
Galil, Zvi | 1975 | | Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319 | Proceedings Article |
| mehlhorn75z | Mehlhorn, Kurt | 1975 | | Bracket-Languages are Recognizable in Logarithmic Space | Report |
| mehlhorn76 | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang | 1976 | | Binary Search Trees: Average and Worst Case Behavior | Report |
| mehlhorn76 | Mehlhorn, Kurt | 1976 | | An O(n log n) lower bound for the synchronous circuit size of integer multiplication | Report |
| Mehlhorn76b | Mehlhorn, Kurt | 1976 | | An Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524 | Journal Article |
| Mehlhorn76c | Mehlhorn, Kurt | 1976 | | Polynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178 | Journal Article |
| mehlhorn76e | Alt, Helmut
Mehlhorn, Kurt | 1976 | | Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354 | Proceedings Article |
| mehlhorn76f | Heydthausen, Manfred
Mehlhorn, Kurt | 1976 | | Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108 | Proceedings Article |
| mehlhorn76f | Mehlhorn, Kurt | 1976 | | Bracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170 | Journal Article |
| mehlhorn76g | Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert | 1976 | | Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313 | Proceedings Article |
| Mehlhorn76j | Mehlhorn, Kurt
Galil, Zvi | 1976 | | Monotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111 | Journal Article |
| mehlhorn76v | Mehlhorn, Kurt | 1976 | | An improved lower bound on the formula complexity of context-free recognition | Report |
| mehlhorn76w | Mehlhorn, Kurt | 1976 | | Dynamic Binary Search Trees : Extended Abstracts | Report |
| mehlhorn76x | Mehlhorn, Kurt | 1976 | | Dynamic Binary Search | Report |
| mehlhorn76z | Heydthausen, Manfred
Mehlhorn, Kurt | 1976 | | Top down parsing of macro grammars (preliminary report) | Report |
| mehlhorn77 | Mehlhorn, Kurt | 1977 | | Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336 | Proceedings Article |
| Mehlhorn77a | Mehlhorn, Kurt | 1977 | | A best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239 | Journal Article |
| mehlhorn77c | Mehlhorn, Kurt | 1977 | | Effiziente Algorithmen | Book |
| mehlhorn77d | Deussen, Peter
Mehlhorn, Kurt | 1977 | | Van Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199 | Journal Article |
| mehlhorn78 | Altenkamp, Doris
Mehlhorn, Kurt | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25 | Proceedings Article |
| mehlhorn78 | Mehlhorn, Kurt | 1978 | | Effiziente Algorithmen: Ein Beispiel | Report |
| mehlhorn78a | Mehlhorn, Kurt | 1978 | | Effiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89 | Journal Article |
| mehlhorn78t | Blum, Norbert
Mehlhorn, Kurt | 1978 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees | Report |
| mehlhorn78u | Mehlhorn, Kurt | 1978 | | Sorting Presorted Files | Report |
| mehlhorn78w | Alt, Helmut
Mehlhorn, Kurt | 1978 | | Complexity Arguments in Algebraic Language Theory | Report |
| [Replication or Save Conflict] |  | | | | |
| mehlhorn78xx | Altenkamp, Doris
Mehlhorn, Kurt | 1978 | | Codes: Unequal Probabilities, Unequal Letter Cost | Report |
| mehlhorn78y | Mehlhorn, Kurt | 1978 | | An efficient algorithm for constructing nearly optimal prefix codes | Report |
| mehlhorn78z | Mehlhorn, Kurt | 1978 | | Arbitrary Weight Changes in Dynamic Trees | Report |
| mehlhorn79a | Alt, Helmut
Mehlhorn, Kurt | 1979 | | Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225 | Journal Article |
| mehlhorn79b | Mehlhorn, Kurt | 1979 | | Parsing Macro Grammars Top Down
In: Information and Control [40], 123-143 | Journal Article |
| mehlhorn79bz | Mehlhorn, Kurt | 1979 | | Dynamic Binary Search
In: SIAM Journal on Computing [8], 175-198 | Journal Article |
| mehlhorn79c | Mehlhorn, Kurt | 1979 | | Dynamic data structures
In: Mathematical Centre Tracts [108], 71-96 | Journal Article |
| mehlhorn79d | Mehlhorn, Kurt | 1979 | | Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380 | Proceedings Article |
| mehlhorn79dz | Mehlhorn, Kurt | 1979 | | Searching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145 | Proceedings Article |
| mehlhorn79e | Mehlhorn, Kurt | 1979 | | Konzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22 | Proceedings Article |
| mehlhorn79g | Blum, Norbert
Mehlhorn, Kurt | 1979 | | Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78 | Proceedings Article |
| mehlhorn79h | Mehlhorn, Kurt | 1979 | | Sorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212 | Proceedings Article |
| mehlhorn79i | Mehlhorn, Kurt
Tsagarakis, M. | 1979 | | On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ?? | Journal Article |
| mehlhorn79j | Mehlhorn, Kurt | 1979 | | Some Remarks on Boolean Sums
In: Acta Informatica [12], 371-375 | Journal Article |
| mehlhorn80 | Mehlhorn, Kurt
Overmars, Mark H. | 1980 | | Optimal dynamization of decomposable searching problems | Report |
| mehlhorn80b | Mehlhorn, Kurt | 1980 | | Pebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435 | Proceedings Article |
| mehlhorn80c | Blum, Norbert
Mehlhorn, Kurt | 1980 | | On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320 | Journal Article |
| mehlhorn80d | Altenkamp, Doris
Mehlhorn, Kurt | 1980 | | Codes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427 | Journal Article |
| mehlhorn80dz | Mehlhorn, Kurt | 1980 | | A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112 | Proceedings Article |
| mehlhorn80f | Mehlhorn, Kurt | 1980 | | An Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517 | Journal Article |
| mehlhorn80z | Mehlhorn, Kurt | 1980 | | Lower bounds on the efficiency of transforming static data structures into dynamic structures | Report |
| mehlhorn81a | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | 1981 | | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Proceedings Article |
| mehlhorn81b | Mehlhorn, Kurt
Overmars, Mark H. | 1981 | | Optimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98 | Journal Article |
| mehlhorn81c | Huddleston, S.
Mehlhorn, Kurt | 1981 | | Robust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244 | Proceedings Article |
| mehlhorn81d | Mehlhorn, Kurt | 1981 | | Arbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211 | Journal Article |
| mehlhorn81dz | Mehlhorn, Kurt | 1981 | | Lower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16 | Journal Article |
| mehlhorn81e | Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian | 1981 | | Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161 | Proceedings Article |
| mehlhorn81g | Lengauer, Thomas
Mehlhorn, Kurt | 1981 | | On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99 | Journal Article |
| mehlhorn82a | Mehlhorn, Kurt | 1982 | | A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760 | Journal Article |
| mehlhorn82c | Huddleston, Scott
Mehlhorn, Kurt | 1982 | | A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184 | Journal Article |
| mehlhorn82d | Mehlhorn, Kurt
Schmidt, Erik M. | 1982 | | Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337 | Proceedings Article |
| mehlhorn82e | Becker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T. | 1982 | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | Journal Article |
| mehlhorn82f | Mehlhorn, Kurt | 1982 | | On the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175 | Proceedings Article |
| mehlhorn82g | Hong, Jia-Wei
Mehlhorn, Kurt | 1982 | | Cost tradeoffs in graph embeddings, with applications | Report |
| mehlhorn83 | Mehlhorn, Kurt
Preparata, F. P. | 1983 | | Routing through a Rectangle | Report |
| mehlhorn83a | Lengauer, Thomas
Mehlhorn, Kurt | 1983 | | Four results on the complexity of VLSI computations | Report |
| mehlhorn83b | Eisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick | 1982 | | The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174 | Journal Article |
| mehlhorn83bz | Lengauer, Thomas
Mehlhorn, Kurt | 1983 | | The HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layouts | Report |
| mehlhorn83c | Lengauer, Thomas
Mehlhorn, Kurt | 1983 | | VLSI Complexity, Efficient VLSI Algorithms and the HILL Design System | Report |
| mehlhorn83d | Mehlhorn, Kurt
Vishkin, Uzi | 1983 | | Granularity of parallel memories | Report |
| mehlhorn83e | von Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger | 1983 | | The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51 | Journal Article |
| mehlhorn83f | Hertel, Stefan
Mehlhorn, Kurt | 1983 | | Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218 | Proceedings Article |
| mehlhorn83f | Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L. | 1983 | | Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728 | Journal Article |
| mehlhorn83f | Mehlhorn, Kurt
Schmidt, Bernd H. | 1983 | | A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309 | Proceedings Article |
| mehlhorn83i | Mehlhorn, Kurt
Preparata, Franco P. | 1983 | | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time | Report |
| mehlhorn83j | Mehlhorn, Kurt | 1983 | | $AT^2$-optimal VLSI for integer division and integer square rooting | Report |
| mehlhorn83k | Mehlhorn, Kurt
Preparata, Franco P. | 1983 | | Area-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156 | Journal Article |
| mehlhorn83n | Mehlhorn, Kurt
Preparata, F. P. | 1983 | | $AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196 | Journal Article |
| mehlhorn84 | Mehlhorn, Kurt | 1984 | | Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proof | Report |
| mehlhorn84a | Mehlhorn, Kurt | 1984 | | Data structures and algorithms. Volume 1 : Sorting and searching | Book |
| mehlhorn84b | Mehlhorn, Kurt | 1984 | | Data structures and algorithms. Volume 2 : Graph algorithms and NP-completeness | Book |
| mehlhorn84b | Mehlhorn, Kurt | 1984 | | Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometry | Book |
| mehlhorn84d | Becker, Michael
Mehlhorn, Kurt | 1984 | | Algorithms for routing in planar graphs | Report |
| mehlhorn84e | Fontet, Mehlhorn (ed.) | 1984 | | Theoretical aspects of computer science (STACS-84) : [1st] symposium | Proceedings |
| mehlhorn84g | Kaufmann, Michael
Mehlhorn, Kurt | 1984 | | Routing through a generalized switchbox | Report |
| mehlhorn84h | Mehlhorn, Kurt
Preparata, Franco P. | 1984 | | Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357 | Proceedings Article |
| mehlhorn84i | Alt, Helmut
Mehlhorn, Kurt
Munro, J. Ian | 1984 | | Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65 | Journal Article |
| mehlhorn84j | Mehlhorn, Kurt | 1984 | | Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89 | Proceedings Article |
| mehlhorn84k | Mehlhorn, Kurt | 1984 | | On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30 | Proceedings Article |
| mehlhorn84l | Hoffmann, K
Mehlhorn, Kurt | 1984 | | Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121 | Journal Article |
| mehlhorn84m | Lengauer, Thomas
Mehlhorn, Kurt | 1984 | | Four results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22 | Journal Article |
| mehlhorn84n | Mehlhorn, Kurt
Vishkin, Uzi | 1984 | | Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374 | Journal Article |
| mehlhorn84o | Alt, Helmut
Mehlhorn, Kurt
Munro, J. | 1984 | | On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65 | Journal Article |
| mehlhorn84oz | Hertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg | 1984 | | Space Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519 | Journal Article |
| mehlhorn84q | Lengauer, Thomas
Mehlhorn, Kurt | 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 |
| mehlhorn84r | Mehlhorn, Kurt | 1984 | | $AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167 | Journal Article |
| mehlhorn85 | Mehlhorn, Kurt
Schmidt, Bernd H. | 1985 | | On BF-perfect graphs | Report |
| mehlhorn85a | Mannila, Heikki
Mehlhorn, Kurt | 1985 | | A fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272 | Journal Article |
| mehlhorn85b | Alt, Helmut
Mehlhorn, Kurt | 1985 | | Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848 | Journal Article |
| mehlhorn85c | Mehlhorn (ed.) | 1985 | | Theoretical aspects of computer science (STACS-85) : 2nd annual symposium | Proceedings |
| mehlhorn85d | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | 1985 | | Dynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434 | Proceedings Article |
| mehlhorn85d | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | 1985 | | Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337 | Proceedings Article |
| mehlhorn85e | Fries, O.
Mehlhorn, Kurt
Näher, Stefan | 1985 | | Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176 | Proceedings Article |
| mehlhorn85e | Hertel, Stefan
Mehlhorn, Kurt | 1985 | | Fast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76 | Journal Article |
| mehlhorn85e | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | 1985 | | Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203 | Proceedings Article |
| mehlhorn85h | Mehlhorn, Kurt
Simon, Klaus | 1985 | | Intersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542 | Proceedings Article |
| mehlhorn85k | Mehlhorn, Kurt
Preparata, Franco P. | 1985 | | Area-time optimal division for T=omega((logn)1+epsilon) | Report |
| mehlhorn85kz | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | 1985 | | Deterministic simulation of idealized parallel computers on more realistic ones | Report |
| mehlhorn85z | Fries, O.
Mehlhorn, Kurt
Näher, Stefan | 1985 | | Dynamization of geometric data structures | Report |
| mehlhorn86 | Lengauer, Thomas
Mehlhorn, Kurt | 1986 | | VLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89 | Part of a Book |
| mehlhorn86a | Mehlhorn, Kurt | 1986 | | Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | Book |
| mehlhorn86c | Mehlhorn, Kurt | 1986 | | Über Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234 | Journal Article |
| mehlhorn86d | Fürer, Martin
Mehlhorn, Kurt | 1986 | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225 | Proceedings Article |
| mehlhorn86d | Fürer, Martin
Mehlhorn, Kurt | 1986 | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | Proceedings |
| mehlhorn86d | Fürer, Martin
Mehlhorn, Kurt | 1986 | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | Proceedings |
| mehlhorn86e | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | 1990 | | Can a maximum flow be computed in $o(nm)$ time? | Report |
| mehlhorn86g | Mehlhorn, Kurt
Schmidt, Bernd H. | 1986 | | On BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327 | Journal Article |
| mehlhorn86p | Loeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard | 1986 | | Grundlagen der Programmiersprachen | Book |
| mehlhorn86r | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | 1986 | | A Lower Bound for the Complexity of the Union-Split-Find Problem | Report |
| mehlhorn86y | Kaufmann, Michael
Mehlhorn, Kurt | 1986 | | On Local Routing of Two-Terminal Nets | Report |
| mehlhorn86z | Mehlhorn, Kurt
Näher, Stefan | 1986 | | Dynamic fractional cascading | Report |
| mehlhorn87 | Mehlhorn (ed.) | 1987 | | Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturen | Proceedings |
| mehlhorn87 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | 1987 | | A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488 | Proceedings Article |
| mehlhorn87h | Mehlhorn, Kurt | 1987 | | A Faster Approximation Algorithm for the Steiner Problem in Graphs | Report |
| mehlhorn87i | Mehlhorn, Kurt
Näher, Stefan | 1987 | | A faster compaction algorithm with automatic jog insertion | Report |
| mehlhorn87z | Jung, Hermann
Mehlhorn, Kurt | 1987 | | Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees | Report |
| mehlhorn88 | Mehlhorn, Kurt
Rülling, W. | 1988 | | Compaction on the Torus | Report |
| mehlhorn88k | Mehlhorn, Kurt | 1988 | | Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchen | Book |
| mehlhorn88l | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | 1988 | | Faster Algorithms for the Shortest Path Problem | Report |
| mehlhorn88m | Mehlhorn, Kurt
Yap, Chee-Keng | 1988 | | Constructive Hopf's theorem: or how to untangle closed planar curves | Report |
| mehlhorn88z | Ahuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E. | 1988 | | Faster Algorithms for the Shortest Path Problem | Report |
| mehlhorn88z | Kaufmann, Michael
Mehlhorn, Kurt | 1988 | | A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs | Report |
| mehlhorn89 | Kaufmann, Michael
Mehlhorn, Kurt | 1989 | | Routing Problems in Grid Graphs | Report |
| mehlhorn89z | Kaufmann, Michael
Mehlhorn, Kurt | 1989 | | Routing problems in grid graphs | Report |
| mehlhorn89z | Mehlhorn, Kurt
Meiser, Stefan
O'Dunlaing, Colm | 1989 | | On the construction of abstract Voronoi diagrams | Report |
| mehlhorn90 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | 1990 | | Hidden line elimination for isooriented rectangles | Report |
| mehlhorn90 | Mehlhorn, Kurt
Rülling, W. | 1990 | | Compaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397 | Journal Article |
| Mehlhorn90a | Mehlhorn, Kurt
Meiser, Stefan
Ó'Dúnlaing, Colm | 1990 | | On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239 | Proceedings Article |
| Mehlhorn90b | Näher, Stefan
Mehlhorn, Kurt | 1990 | | LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5 | Proceedings Article |
| Mehlhorn90c | Cheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt | 1990 | | Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248 | Proceedings Article |
| mehlhorn90w | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | 1989 | | Data structures | Report |
| mehlhorn90y | Kaufmann, Morgan
Mehlhorn, Kurt | 1990 | | Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184 | Part of a Book |
| mehlhorn90z | Mehlhorn, Kurt
Näher, Stefan | 1990 | | A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166 | Journal Article |
| Mehlhorn91a | Alt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus | 1991 | | Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240 | Journal Article |
| Mehlhorn91b | Mehlhorn, Kurt
Yap, Chee-Keng | 1991 | | Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621 | Journal Article |
| Mehlhorn91c | Mehlhorn, Kurt
Meiser, Stefan
O'Dúnlaing, Colm | 1991 | | On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224 | Journal Article |
| mehlhorn91d | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | 1991 | | Dynamic Perfect Hashing: Upper and Lower Bounds | Report |
| Mehlhorn91d | Fleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt | 1991 | | A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401 | Proceedings Article |
| mehlhorn91e | Alt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A. | 1991 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | Report |
| mehlhorn91f | Mehlhorn, Trajan (ed.) | 1991 | | Effiziente Algorithmen - Tagungsbericht | Proceedings |
| Mehlhorn92a | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | 1992 | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | Journal Article |
| Mehlhorn92d | Mehlhorn, Kurt | 1992 | | Recent Developments in Algorithms for the Maximum Flow Problem (Abstract)
In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404 | Proceedings Article |
| mehlhorn92d | Mehlhorn, Kurt
Näher, Stefan | 1992 | | Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508 | Proceedings Article |
| Mehlhorn92e | Fleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian | 1992 | | Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43 | Part of a Book |
| Mehlhorn92f | Clarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund | 1992 | | Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474 | Proceedings Article |
| Mehlhorn92g | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | 1992 | | Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258 | Proceedings Article |
| Mehlhorn92gz | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | 1992 | | Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93 | Proceedings Article |
| Mehlhorn92j | Alt, Helmut
Geffert, Viliam
Mehlhorn, Kurt | 1992 | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | Journal Article |
| Mehlhorn92k | Kaufmann, Michael
Mehlhorn, Kurt | 1992 | | On local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72 | Journal Article |
| Mehlhorn92m | Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan | 1992 | | Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308 | Part of a Book |
| Mehlhorn93a | Kucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E. | 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 |
| Mehlhorn93b | Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette | 1993 | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324 | Proceedings Article |
| Mehlhorn93c | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | 1993 | | Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634 | Journal Article |
| Mehlhorn93d | Hagerup, Torben
Mehlhorn, Kurt
Munro, I. | 1993 | | Maintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264 | Proceedings Article |
| Mehlhorn93e | Dubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian | 1993 | | Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443 | Proceedings Article |
| Mehlhorn93f | Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian | 1993 | | Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201 | Proceedings Article |
| Mehlhorn93g | Klein, Rolf
Mehlhorn, Kurt
Meiser, Stefan | 1993 | | Randomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184 | Journal Article |
| Mehlhorn93i | Mehlhorn, Kurt
Sharir, Micha
Welzl, Emo | 1993 | | Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246 | Journal Article |
| mehlhorn93j | Dobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette | 1993 | | A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron | Report |
| mehlhorn93k | Hoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E. | 1984 | | Sorting Jordan sequences in linear time | Report |
| mehlhorn94 | Buchberger, Mehlhorn, Näher, Nievergelt (ed.) | 1994 | | Special issue on “algorithms: implementation, libraries and use” | Book |
| Mehlhorn94b | Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan | 1994 | | How to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239 | Proceedings Article |
| Mehlhorn94c | Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E. | 1994 | | Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761 | Journal Article |
| Mehlhorn94d | Mehlhorn, Kurt
Näher, Stefan | 1994 | | The Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231 | Proceedings Article |
| Mehlhorn94e | Bilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt | 1994 | | A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105 | Journal Article |
| Mehlhorn94f | Baumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt | 1994 | | Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380 | Journal Article |
| Mehlhorn94g | Mehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg | 1994 | | Introduction
In: Journal of Symbolic Computation [17], 295-295 | Journal Article |
| Mehlhorn94gz | Burnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan | 1994 | | On degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23 | Proceedings Article |
| Mehlhorn94h | Kaufmann, Michael
Mehlhorn, Kurt | 1994 | | A linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246 | Journal Article |
| Mehlhorn94i | Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian | 1994 | | Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222 | Proceedings Article |
| mehlhorn94j | van Leeuwen, Mehlhorn, Reps (ed.) | 1994 | | Incremental Computation and Dynamic Algorithms 02.05.-06.05.94 | Report |
| Mehlhorn95 | Mehlhorn, Kurt | 1995 | | Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518 | Proceedings Article |
| mehlhorn95 | Mehlhorn, Kurt | 1995 | | Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363 | Journal Article |
| mehlhorn95z | Mehlhorn, Kurt
Näher, Stefan | 1995 | | LEDA : A Platform for Combinatorial and Geometric Computing | Report |
| mehlhorn96 | Mehlhorn, Kurt | 1996 | | Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52 | Proceedings Article |
| mehlhorn96 | Mehlhorn, Kurt | 1996 | | The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126 | Proceedings Article |
| mehlhorn96 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | 1996 | | The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50 | Proceedings Article |
| mehlhorn98 | Mehlhorn, Kurt | 1998 | | Amortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102 | Part of a Book |
| mehlhorn98 | Mehlhorn, Kurt
Näher, Stefan | 1998 | | From Algorithms to Working Programs on the Use of Program Checking in LEDA
In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, 81-88 | Proceedings Article |
| mehlhorn98e | Mehlhorn (ed.) | 1998 | | Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer Congress | Proceedings |
| mehlhorn99 | Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt | 1999 | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | Journal Article |
| mehlhorn99 | Finkler, Ulrich
Mehlhorn, Kurt | 1999 | | Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902 | Proceedings Article |
| mehlhorn99 | Mehlhorn, Kurt | 1999 | | Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14 | Proceedings Article |
| Mehlhorn99 | Mehlhorn, Kurt | 1999 | | The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3 | Proceedings Article |
| mehlhorn99 | Mehlhorn, Kurt | 1999 | | The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449 | Proceedings Article |
| mehlhorn99 | Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg | 1999 | | Editorial
In: Computational Geometry [12], 153-154 | Journal Article |
| MehlhornCT93 | Mehlhorn, Kurt
Claus, Volker
Thomas, Wolfgang | 1996 | | Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116 | Proceedings Article |
| MehlhornMeiser01 | Mehlhorn, Kurt
Meiser, Stefan
Rasch, Ronald | 2001 | | Furthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616 | Journal Article |
| MehlhornMFCS07 | Mehlhorn, Kurt | 2007 | | Minimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | Proceedings Article |
| MehlhornNaeherUhrig1997 | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | 1997 | | The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16 | Proceedings Article |
| MehlhornNäher98 | Mehlhorn, Kurt
Näher, Stefan | 1998 | | From Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93 | Proceedings Article |
| MehlhornPriebe97 | Mehlhorn, Kurt
Priebe, Volker | 1997 | | On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220 | Journal Article |
| MehlhornPU1992 | Mehlhorn, Kurt
Paul, Wolfgang J.
Uhrig, C | 1992 | | $k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129 | Journal Article |
| MehlhornRay2010 | Mehlhorn, Kurt
Ray, Saurabh | 2010 | | Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683 | Journal Article |
| MehlhornSack2000 | Mehlhorn, Kurt
Sack, Jörg-Rüdiger | 2000 | | Editorial
In: Computational Geometry [17], 1-2 | Journal Article |
| MehlhornSchaefer2001 | Mehlhorn, Kurt
Schäfer, Guido | 2001 | | A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253 | Proceedings Article |
| MehlhornSchweitzer2010 | Mehlhorn, Kurt
Schweitzer, Pascal | 2010 | | Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5 | Proceedings Article |
| MehlhornTALG2011 | Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth | 2011 | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article |
| MehlhornThiel2000 | Mehlhorn, Kurt
Thiel, Sven | 2000 | | Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319 | Proceedings Article |
| MehlhornZiegelmann2000 | Mehlhorn, Kurt
Ziegelmann, Mark | 2000 | | Resource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337 | Proceedings Article |
| MehlhornZiegelmann2001 | Mehlhorn, Kurt
Ziegelmann, Mark | 2001 | | CNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31 | Proceedings Article |
| Mehlhorn$^+$90 | Mehlhorn, Kurt
Tsakalidis, A. | 1990 | | Data Structures
In: Handbook of Theoretical Computer Science, 301-341 | Part of a Book |
| mehlhorn:1989:lledt | Mehlhorn, Kurt
Näher, Stefan | 1989 | | LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106 | Proceedings Article |
| Mehlhorn:1990:BOD | Mehlhorn, Kurt
Näher, Stefan | 1990 | | Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189 | Journal Article |
| Mehlhorn:1990:CGR | Mehlhorn, Kurt
Näher, Stefan
Rauch, Monika | 1990 | | On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906 | Journal Article |
| Mehlhorn:1990:HLE | Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian | 1990 | | Hidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143 | Journal Article |
| MehMey2002 | Mehlhorn, Kurt
Meyer, Ulrich | 2002 | | External-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735 | Proceedings Article |
| Mehnert/Diploma04 | Mehnert, Jens | 2004 | | External Memory Suffix Array Construction
Universität des Saarlandes | Thesis - Masters thesis |
| MehSan03j | Mehlhorn, Kurt
Sanders, Peter | 2003 | | Scanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93 | Journal Article |
| MeSchi:lede_real | Mehlhorn, Kurt
Schirra, Stefan | 2001 | | Exact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172 | Part of a Book |
| Mestre2008 | Epstein, Leah
Kleiman, Elena
Mestre, Julian | 2009 | | Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78 | Proceedings Article |
| Mestre2009 | Kavitha, T.
Mestre, Julián
Nasre, M. | 2009 | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article |
| Mestre2010 | Mestre, Julian | 2010 | | Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057 | Journal Article |
| Mestre2010a | Canzar, Stefan
Elbassioni, Khaled
Mestre, Julian | 2010 | | A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33 | Proceedings Article |
| Mestre2010b | Epstein, Leah
Levin, Asaf
Mestre, Julian
Segev, Danny | 2010 | | Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358 | Electronic Proceedings Article |
| Metzler97 | Metzler, Matthias | 1997 | | Ergebnisüberprüfung bei Graphenalgorithmen
Universität des Saarlandes | Thesis - Masters thesis |
| Meyer-Sibeyn95 | Meyer, Ulrich
Sibeyn, Jop F. | 1995 | | Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290 | Proceedings Article |
| Meyer2001a | Meyer, Ulrich | 2001 | | External Memory BFS on Undirected Graphs with Bounded Degree
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 87-88 | Proceedings Article |
| Meyer2001b | Meyer, Ulrich | 2001 | | Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 797-806 | Proceedings Article |
| Meyer2001c | Meyer, Ulrich | 2001 | | Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351 | Proceedings Article |
| Meyer2002a | Meyer, Ulrich | 2002 | | Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75 | Proceedings Article |
| Meyer2002diss | Meyer, Ulrich | 2002 | | Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms
Universität des Saarlandes | Thesis - PhD thesis |
| Meyer2003 | Meyer, Ulrich | 2003 | | Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134 | Journal Article |
| Meyer2003a | Meyer, Ulrich
Sanders, Peter | 2003 | | $\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152 | Journal Article |
| Meyer95 | Meyer, Ulrich | 1995 | | Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes | Thesis - Masters thesis |
| MeyerhenkeS2012 | Meyerhenke, Henning
Sauerwald, Thomas | 2012 | | Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361 | Journal Article |
| MeyerSanders1998a | Meyer, Ulrich
Sanders, Peter | 1998 | | $\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404 | Proceedings Article |
| MeyerSibeyn1998a | Meyer, Ulrich
Sibeyn, Jop F. | 1998 | | Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046 | Proceedings Article |
| MeyerWetzel2006 | Meyer, Ulrike
Wetzel, Susanne | 2006 | | Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282 | Proceedings Article |
| Meyer_Swat08 | Meyer, Ulrich | 2008 | | On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy | Proceedings Article |
| MeySan2000 | Meyer, Ulrich
Sanders, Peter | 2000 | | Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470 | Proceedings Article |
| MeySanSib2003 | Meyer, Sanders, Sibeyn (ed.) | 2003 | | Algorithms for Memory Hierarchies | Book |
| MeySib02 | Meyer, Ulrich
Sibeyn, Jop F. | 2002 | | Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19 | Journal Article |
| MeyZeh06 | Meyer, Ulrich
Zeh, Norbert | 2006 | | I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551 | Proceedings Article |
| MeyZeh2003 | Meyer, Ulrich
Zeh, Norbert | 2003 | | I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445 | Proceedings Article |
| Me:ICALP2000 | Mehlhorn, Kurt | 2000 | | Constraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575 | Proceedings Article |
| MFCS::AltHMP1986 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | 1986 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | Proceedings Article |
| MGBFKKZNAAKJBL1998 | Mutzel, Petra
Gutwenger, Carsten
Brockenauer, Ralf
Fialko, Sergej
Klau, Gunnar W.
Krüger, Michael
Ziegler, Thomas
Näher, Stefan
Alberts, David
Ambras, Dirk
Koch, Gunter
Jünger, Michael
Buchheim, Christoph
Leipert, Sebastian | 1998 | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | Proceedings Article |
| Michail2004a | Mehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
Irving, Robert W.
Paluch, Katarzyna | 2004 | | Rank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75 | Proceedings Article |
| Michail2004b | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna | 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 |
| Michail2006 | Michail, Dimitrios | 2006 | | Minimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes | Thesis - PhD thesis |
| Miller-Zaroliagis97 | Miller, Tobias
Zaroliagis, Christos | 1997 | | A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73 | Proceedings Article |
| Miller98 | Miller, Tobias | 1998 | | Implementation and Experimental Evaluation of Dynamic Transitive Closure Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
| Milosavljevic2009 | Guibas, Leonidas
Milosavljevic, Nikola
Motskin, Arik | 2010 | | Connected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 | Proceedings Article |
| Milosavljevic2011Zigzag | Milosavljevic, Nikola
Morozov, Dmitriy
Skraba, Primoz | 2011 | | Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225 | Proceedings Article |
| MinLoad2004 | Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Srivastav, Anand | 2004 | | Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133 | Journal Article |
| MisraPhilipRamanSaurabh2010 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket | 2010 | | The effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107 | Proceedings Article |
| MisraPhilipRamanSaurabh2011 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket | 2011 | | On Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109 | Proceedings Article |
| MisraPhilipRamanSaurabh2012 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket | 2012 | | On Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75 | Journal Article |
| MisraPhilipRamanSaurabhSikdar2010 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath | 2010 | | FPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280 | Proceedings Article |
| MisraPhilipRamanSaurabhSikdar2012 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath | 2012 | | FPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146 | Journal Article |
| MM05 | Mehlhorn, Kurt
Michail, Dimitrios | 2005 | | Implementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43 | Proceedings Article |
| MM05a | Mehlhorn, Kurt
Michail, Dimitrios | 2005 | | Network Problems with Non-Polynomial Weights and Applications | Unpublished/Draft |
| MM06 | Mehlhorn, Kurt
Michail, Dimitrios | 2006 | | Implementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14 | Electronic Journal Article |
| mmnssuz-cbhcg-97 | Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim | 1997 | | A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263 | Proceedings Article |
| MMNSSUZ98 | Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim | 1998 | | A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304 | Journal Article |
| MMueller98 | Müller, Matthias | 1998 | | Ein Simulator für Prozessornetzwerke
Universität des Saarlandes | Thesis - Masters thesis |
| MnichPhilipSaurabhSuchy2012a | Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
Suchy, Ondrej | 2012 | | Beyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423 | Electronic Proceedings Article |
| mod-hemmer-2009 | Hemmer, Michael | 2009 | | Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual |
| MoehringSkutellaStork2004 | Moehring, Rolf H.
Skutella, Martin
Stork, Frederik | 2004 | | Scheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415 | Journal Article |
| MolterMaster2012 | Molter, Hendrik | 2012 | | ACO beats EA on a dynamic pseudo-Boolean function
Universität des Saarlandes | Thesis - Masters thesis |
| MoranMaster2012 | Moran, Shay | 2012 | | Shattering extremal systems
Universität des Saarlandes | Thesis - Masters thesis |
| MortensenPettie2005 | Mortensen, Christian Worm
Pettie, Seth | 2005 | | The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60 | Proceedings Article |
| MOS-CP2011 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | 2011 | | A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528 | Journal Article |
| MOS06 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | 2006 | | Reliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310 | Proceedings Article |
| mo:Mehlhorn:86 | Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.) | 1986 | | VLSI algorithms and architectures : Aegean workshop on computing | Proceedings |
| MPSS2002 | Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen | 2002 | | All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343 | Journal Article |
| MS2002 | Mehlhorn, Kurt
Schäfer, Guido | 2002 | | Implementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7], | Electronic Journal Article |
| mstb-giae-impl-2010 | Mörig, Marc
Scholz, Sven
Tscheuschner, Tobias
Berberich, Eric | 2010 | | Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289 | Part of a Book |
| MSWClustering2013 | Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming | 2013 | | From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870], | Electronic Journal Article |
| MS:Bistream:2011 | Mehlhorn, Kurt
Sagraloff, Michael | 2011 | | A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90 | Journal Article |
| MS:Bitstream:2009 | Mehlhorn, Kurt
Sagraloff, Michael | 2009 | | Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254 | Proceedings Article |
| Mueck98 | Mueck, Thomas | 1998 | | Implementation of Hammock Decomposition with Application to Shortest Path Problems
Universität des Saarlandes | Thesis - Masters thesis |
| MulCol2001 | Doerr, Benjamin
Srivastav, Anand | 2001 | | Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx | Journal Article |
| Müller-Rüb96 | Müller, Michael
Rüb, Christine
Rülling, Wolfgang | 1996 | | A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163 | Journal Article |
| Müller95 | Müller, Peter | 1995 | | Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere
Universität des Saarlandes | Thesis - Masters thesis |
| MüllerDiss99 | Müller, Peter | 1999 | | Parallel molecular dynamics simulations for synthetic polymers
Universität des Saarlandes | Thesis - PhD thesis |
| MultiColor2004 | Doerr, Benjamin | 2004 | | Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685 | Journal Article |
| MultVC07 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | 2007 | | Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804 | Proceedings Article |
| MustafaRay2010 | Mustafa, Nabil H.
Ray, Saurabh | 2010 | | Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895 | Journal Article |
| Mutzel-et-al-1-97 | Jünger, Michael
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M. | 1998 | | The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176 | Journal Article |
| Mutzel-et-al-2-97 | Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M. | 1998 | | The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73 | Journal Article |
| Mutzel-et-al-95 | DeSimone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni | 1995 | | Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496 | Journal Article |
| Mutzel-et-al-97 | Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard | 1997 | | A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92 | Proceedings Article |
| Mutzel1999 | Mutzel, Petra | 1999 | | Zeichnen von Diagrammen - Theorie und Praxis
Universität des Saarlandes | Thesis - Habilitation thesis |
| Mutzel95 | Mutzel, Petra | 1995 | | A Polyhedral Approach to Planar Augmentation and Related Problems
In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507 | Proceedings Article |
| Mutzel96 | Mutzel, Petra | 1996 | | An alternative method to crossing minimization on hierarchical graphs
In: Proceedings of the 4th Symposium on Graph Drawing (GD-96), 318-333 | Proceedings Article |
| MutzelZiegler1998 | Mutzel, Petra
Ziegler, Thomas | 1999 | | The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134 | Proceedings Article |
| MZ00 | Mutzel, Petra
Ziegler, Thomas | 2000 | | The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185 | Proceedings Article |
| NaRa07 | Mustafa, Nabil H.
Ray, Saurabh | 2007 | | An Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141 | Proceedings Article |
| NaRa07b | Ray, Saurabh
Mustafa, Nabil H. | 2007 | | Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244 | Proceedings Article |
| Naujoks10a | Althaus, Ernst
Altmeyer, Sebastian
Naujoks, Rouven | 2010 | | A New Combinatorial Approach to Parametric Path Analysis | Report |
| Naujoks2006 | Althaus, Ernst
Naujoks, Rouven | 2006 | | Computing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181 | Proceedings Article |
| Naujoks2011 | Funke, Stefan
Laue, Soeren
Lotker, Zvi
Naujoks, Rouven | 2011 | | Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035 | Journal Article |
| NaujoksPhD | Naujoks, Rouven | 2008 | | NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes | Thesis - PhD thesis |
| Naujoks/Diplom04 | Naujoks, Rouven | 2004 | | A heuristic for solving interior point Methods exactly
Universität des Saarlandes | Thesis - Masters thesis |
| Nest98 | Nest, Martin | 1998 | | Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene
Universität des Saarlandes | Thesis - Masters thesis |
| NeuEul07 | Neumann, Frank | 2008 | | Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759 | Journal Article |
| Neukirch94 | Neukirch, Markus | 1994 | | Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA
Universität des Saarlandes | Thesis - Masters thesis |
| Neumann2008 | Neumann, Frank
Witt, Carsten | 2009 | | Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255 | Journal Article |
| Neumann2011 | Neumann, Frank
Reichel, Joachim
Skutella, Martin | 2011 | | Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342 | Journal Article |
| NeumannHaltnerLehr1998 | Neumann, Dirk
Haltner, Elleonore
Lehr, Claus-Michael
Kohlbacher, Oliver
Lenhof, Hans-Peter | 1998 | | Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549 | Proceedings Article |
| NeumannMaster2011 | Neumann, Adrian | 2011 | | Implementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes | Thesis - Masters thesis |
| NeumannWitt2010 | Neumann, Frank
Witt, Carsten | 2010 | | Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413 | Journal Article |
| NeuOliWitGECCO2009 | Neumann, Frank
Oliveto, Pietro Simone
Witt, Carsten | 2009 | | Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842 | Proceedings Article |
| NeuReiPPSN2008 | Neumann, Frank
Reichel, Joachim | 2008 | | Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81 | Proceedings Article |
| NeuReiSku2008 | Neumann, Frank
Reichel, Joachim
Skutella, Martin | 2008 | | Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786 | Proceedings Article |
| NeuSudWit2008 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | 2008 | | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article |
| NeuSudWitSwarm2009 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | 2009 | | Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68 | Journal Article |
| NeuWegMST2007 | Neumann, Frank
Wegener, Ingo | 2007 | | Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40 | Journal Article |
| NeuWitLion2008 | Neumann, Frank
Witt, Carsten | 2008 | | Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166 | Proceedings Article |
| NeuWittMST2006 | Neumann, Frank
Witt, Carsten | 2006 | | Ant Colony Optimization and the Minimum Spanning Tree Problem | Report |
| NewoDipl05 | Newo Kenmogne, Regis | 2005 | | Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes | Thesis - Masters thesis |
| Nissen98 | Nissen, Marco | 1998 | | Graph Iterators: Decoupling Graph Structures from Algorithms
Universität des Saarlandes | Thesis - Masters thesis |
| NKH+2000 | Neumann, Dirk
Kohlbacher, Oliver
Haltner, Eleonore
Lenhof, Hans-Peter
Lehr, Claus-Michael | 2000 | | Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233 | Proceedings Article |
| Nor2012 | Nor, Igor
Hermlin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier
Sagot, Marie-France | 2012 | | Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32 | Journal Article |
| NSBV+02 | Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold | 2002 | | Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912 | Proceedings Article |
| NSWACOchapter09 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | 2009 | | Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120 | Part of a Book |
| NSWSLS2007 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | 2007 | | Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75 | Proceedings Article |
| nt-hemmer-2007 | Hemmer, Michael
Hert, Susan
Kettner, Lutz
Pion, Sylvain
Schirra, Stefan | 2007 | | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual |
| Nutov/Penn/2000 | Nutov, Zeev
Penn, Michael | 2000 | | On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252 | Journal Article |
| NZ97 | Zosin, Leonid | 1997 | | A 2-Approximation Algorithm for the Directed Multiway Cut Problem
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 548-553 | Proceedings Article |
| Oberhauser97 | Oberhauser, Fred | 1997 | | Arithmetik der Transduktoren
Universität des Saarlandes | Thesis - Masters thesis |
| OssamyDipl02 | Ossamy, Rodrigue | 2002 | | TSP Cuts Outside the Template Paradigm
Universität des Saarlandes | Thesis - Masters thesis |
| Ost95 | Ost, Kirstin | 1995 | | Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes | Thesis - Masters thesis |
| OTO_ISAAC_2007 | Ajwani, Deepak
Friedrich, Tobias | 2007 | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article |
| Ott2013 | Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José | 2013 | | How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 | Proceedings Article |
| OttMaster2012 | Ott, Sebastian | 2012 | | Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes | Thesis - Masters thesis |
| Paluch2006 | Paluch, Katarzyna | 2006 | | A New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721 | Proceedings Article |
| Panagiotou2008 | Panagiotou, Konstantinos | 2009 | | Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article |
| Panagiotou2012b | Panagiotou, Konstantinos
Sinha, Makrand | 2012 | | Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130 | Journal Article |
| PanagiotouSinhaProc2009 | Panagiotou, Konstantinos | 2009 | | Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45 | Proceedings Article |
| PanagiotouSteger2008 | Panagiotou, Konstantinos
Steger, Angelika | 2009 | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 | Proceedings Article |
| PanagiotouSteger2011 | Panagiotou, Konstantinos
Steger, Angelika | 2011 | | On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210 | Proceedings Article |
| PanagiotouStegerJournal2010 | Panagiotou, Konstantinos
Steger, Angelika | 2010 | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21 | Journal Article |
| Papatr-Tsigas95 | Papatriantafilou, Marina
Tsigas, Philippas | 1995 | | Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319 | Proceedings Article |
| Parreira03 | Parreira, Josiane | 2003 | | On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes | Thesis - Masters thesis |
| patent2005 | Xu, Chihao
Wahl, Jürgen
Eeisenbrand, Friedrich
Karrenbauer, Andreas
Soh, Kian Min
Hitzelberger, Christoph | 2005 | | Verfahren zur Ansteuerung von Matrixanzeigen | Miscellaneous |
| Paterson2000 | Fleischer, Rudolf
Wahl, Michaela | 2000 | | Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210 | Proceedings Article |
| Pemmaraju2011 | Pemmaraju, Sriram V.
Raman, Rajiv
Varadarajan, Kasturi | 2011 | | Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21 | Journal Article |
| PerezGimenez2011 | Müller, Tobias
Perez-Gimenez, Xavier
Wormald, Nicholas | 2011 | | Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322 | Journal Article |
| Pettie-sensitivity2005 | Pettie, Seth | 2005 | | Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973 | Proceedings Article |
| Pettie2005 | Pettie, Seth | 2005 | | Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183 | Proceedings Article |
| PettieSanders2004 | Pettie, Seth
Sanders, Peter | 2004 | | A simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276 | Journal Article |
| PettieSanders2005 | Pettie, Seth
Sanders, Peter | 2005 | | Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models | Unpublished/Draft |
| PhDEmeliyanenko12 | Emeliyanenko, Pavel | 2012 | | Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes | Thesis - PhD thesis |
| PhilipMScThesis2008 | Philip, Geevarghese | 2008 | | Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute | Thesis - Masters thesis |
| PhilipPhDThesis | Philip, Geevarghese | 2011 | | The Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute | Thesis - PhD thesis |
| PhilipRamanSikdar2009 | Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath | 2009 | | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705 | Proceedings Article |
| PhilipRamanSikdar2012 | Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath | 2012 | | Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23 | Journal Article |
| PhilipRamanVillanger2010 | Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve | 2010 | | A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 | Proceedings Article |
| Piskorski94 | Piskorski, Jakub | 1994 | | Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes | Thesis - Masters thesis |
| poly-hemmer-2009 | Hemmer, Michael | 2009 | | Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual |
| Polzin2002-ESA | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2002 | | Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807 | Proceedings Article |
| Polzin2002-MSTH | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2003 | | On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20 | Journal Article |
| PolzinPhD03 | Polzin, Tobias | 2003 | | Algorithms for the Steiner Problem in Networks
Universität des Saarlandes | Thesis - PhD thesis |
| PolzinVahdati2000 | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2000 | | Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225 | Proceedings Article |
| PolzinVahdati2001a | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2001 | | A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261 | Journal Article |
| PolzinVahdati2001b | Polzin, Tobias
Vahdati Daneshmand, Siavash | 2001 | | Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300 | Journal Article |
| Porkolab97a | Porkolab, Lorant
Khachiyan, Leonid | 1997 | | Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171 | Proceedings Article |
| Portz94 | Portz, Sascha | 1994 | | Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes | Thesis - Masters thesis |
| Potikoglou99 | Potikoglou, Ioannis | 1999 | | Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes | Thesis - Masters thesis |
| Pouchkarev2000 | Pouchkarev, Igor | 2000 | | ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes | Thesis - Masters thesis |
| Pourmiri2013 | Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas | 2013 | | Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456 | Proceedings Article |
| PriebeDiss01 | Priebe, Volker | 2001 | | Average-case complexity of shortest-paths problems
Universität des Saarlandes | Thesis - PhD thesis |
| PS03 | Sanders, Peter | 2003 | | Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10 | Part of a Book |
| ptrianta-tsigas97-1 | Papatriantafilou, Marina
Tsigas, Philippas | 1997 | | Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328 | Journal Article |
| ptrianta-tsigas98-1 | Panconesi, Alessandro
Papatriantafilou, Marina
Tsigas, Philippas
Vitanyi, Paul | 1998 | | Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124 | Journal Article |
| Pyrga2007 | Pyrga, Evangelia
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos | 2007 | | Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39 | Journal Article |
| Pyrga2008 | Pyrga, Evangelia
Ray, Saurabh | 2008 | | New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207 | Proceedings Article |
| Pyrga2009 | Pyrga, Evangelia
Chung, Christine | 2009 | | Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195 | Proceedings Article |
| PyrgaDipl05 | Pyrga, Evangelia | 2005 | | Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes | Thesis - Masters thesis |
| PyrgaPhD2010 | Pyrga, Evangelia | 2010 | | Algorithmic Game Theory and Networks
Universität des Saarlandes | Thesis - PhD thesis |
| QianSWvZ12 | Qian, Jiawei
Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke | 2012 | | On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617 | Proceedings Article |
| Rahul2001 | Ray, Rahul
Smid, MIchiel
Lange, Katharina
Wendt, Ulrich | 2002 | | Computing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152 | Proceedings Article |
| Rahul2002a | Wendt, Ulrich
Lange, Katharina
Smid, Michiel
Ray, Rahul
Tönnies, Klaus-Dietz | 2002 | | Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627 | Journal Article |
| Rahul2002b | Agarwal, Pankaj
Hagerup, Torben
Ray, Rahul
Sharir, Micha
Smid, Michiel
Welzl, Emo | 2002 | | Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53 | Proceedings Article |
| Rahul2002c | Wendt, Ulrich
Lange, Katharina
Ray, Rahul
Smid, Michiel | 2001 | | Surface Topography Quantification using Computational Geometry | Miscellaneous |
| Rahul2002d | Ray, Rahul | 2002 | | An O(nlogn) Algorithm for Classifying Identical Curves | Miscellaneous |
| Rahul2003 | Smid, Michiel
Ray, Rahul
Wendt, Ulrich
Lange, Katharina | 2004 | | Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264 | Journal Article |
| Raman2009 | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene | 2009 | | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286 | Proceedings Article |
| Ramezani2010 | Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C. | 2010 | | Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | Journal Article |
| Ramezani2011 | Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio | 2012 | | Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83 | Journal Article |
| Ramezani2013 | Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh | 2013 | | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76 | Proceedings Article |
| Ramos00 | Ramos, Edgar A. | 2001 | | An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244 | Journal Article |
| Ramos1999 | Ramos, Edgar A. | 1999 | | On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399 | Proceedings Article |
| Ramos2000a | Amato, Nancy M.
Goodrich, Michael T.
Ramos, Edgar A. | 2000 | | Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212 | Proceedings Article |
| Ramos2000b | Dey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A. | 2000 | | Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244 | Journal Article |
| Ramos2000c | Ramos, Edgar A. | 2000 | | Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299 | Proceedings Article |
| Ramos2000d | Ramos, Edgar A. | 2000 | | Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181 | Proceedings Article |
| Ramos2000e | Ramos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T. | 2000 | | Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | Proceedings Article |
| Ramos97 | Ramos, Edgar A. | 1997 | | Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66 | Proceedings Article |
| Ramos97a | Ramos, Edgar A. | 1997 | | Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65 | Journal Article |
| RandCol2006 | Doerr, Benjamin | 2006 | | Non-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659 | Journal Article |
| Rasch94 | Rasch, Ronald | 1994 | | Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes | Thesis - PhD thesis |
| RatSanKni99 | Rathe, Ulrich
Sanders, Peter
Knight, Peter | 1999 | | A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534 | Journal Article |
| Rau97 | Rau, Stephan | 1997 | | Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes | Thesis - Masters thesis |
| RaufDiss04 | Rauf, Imran | 2005 | | Earliest Arrival Flows with Multiple Sources
Universität des Saarlandes | Thesis - Masters thesis |
| RayDiss04 | Ray, Rahul | 2004 | | Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes | Thesis - PhD thesis |
| Ray/Diploma04 | Ray, Saurabh | 2004 | | Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes | Thesis - Masters thesis |
| Reichel2003 | Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
Schömer, Elmar | 2003 | | Packing a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629 | Proceedings Article |
| Reichel2005 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar | 2005 | | Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206 | Proceedings Article |
| ReichelDipl01 | Reichel, Joachim | 2001 | | Optimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes | Thesis - Masters thesis |
| Reinert94 | Reinert, Knut | 1994 | | Deferred Data Structuring
Universität des Saarlandes | Thesis - Masters thesis |
| ReinertDiss99 | Reinert, Knut | 1999 | | A polyhedral approach to sequence alignment problems
Universität des Saarlandes | Thesis - PhD thesis |
| Reinstaedtler-Dipl98 | Reinstädtler, Martin | 1998 | | Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes | Thesis - Masters thesis |
| res_2010 | Emeliyanenko, Pavel | 2010 | | A complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43 | Proceedings Article |
| Rieger95 | Rieger, Joachim | 1995 | | Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217 | Journal Article |
| rizkallah:2011:matching | Rizkallah, Christine | 2011 | | Maximum Cardinality Matching
In: Archive of Formal Proofs, | Electronic Journal Article |
| Roehrig1998Diplom | Röhrig, Hein | 1998 | | Tree Decomposition: A Feasibility Study
Universität des Saarlandes | Thesis - Masters thesis |
| Rottmann96 | Rottmann, Klaus-Dieter | 1996 | | Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes | Thesis - Masters thesis |
| RoundSmSub2006 | Doerr, Benjamin | 2006 | | Matrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112 | Journal Article |
| RSPM98 | Sanders, Peter
Reussner, Ralf
Prechelt, Lutz
Müller, Matthias | 1998 | | SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59 | Proceedings Article |
| Rüb98 | Rüb, Christine | 1998 | | On Batcher's Merge Sorts as Parallel Sorting Algorithms
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420 | Proceedings Article |
| Rueb-1-97 | Rüb, Christine | 1997 | | On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346 | Journal Article |
| Rueb95 | Rüb, Christine | 1995 | | On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501 | Proceedings Article |
| Ruppert1999 | Ruppert, Barbara | 1999 | | Polygontriangulierung in Linearzeit
Universität des Saarlandes | Thesis - Masters thesis |
| RusinovSchweitzer2010 | Rusinov, Momchil
Schweitzer, Pascal | 2010 | | Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262 | Journal Article |
| s-cssl-03 | Schmitt, Susanne | 2003 | | Common Subexpression Search in LEDA_reals | Report |
| s-doran-03 | Schmitt, Susanne | 2003 | | The Diamond Operator for Real Algebraic Numbers | Report |
| Sabo1999 | Sabo, Holger | 1999 | | Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes | Thesis - Masters thesis |
| Sagraloff-BitstreamComplexity2010a | Sagraloff, Michael | 2010 | | On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33 | Electronic Journal Article |
| Sagraloff-BitstreamPrecision2011 | Sagraloff, Michael | 2010 | | A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506 | Journal Article |
| SagraloffMPGJahrbuch2012 | Sagraloff, Michael | 2012 | | Exaktes geometrisches Rechnen | Miscellaneous |
| SagraloffYap:CEVAL:2011 | Sagraloff, Michael
Yap, Chee | 2011 | | A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360 | Proceedings Article |
| Sagraloff_ISSAC_2012 | Sagraloff, Michael | 2012 | | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304 | Proceedings Article |
| Same2005 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | 2007 | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article |
| SameCPAIOR2004 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | 2004 | | Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79 | Proceedings Article |
| San2001a | Sanders, Peter | 2001 | | Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76 | Proceedings Article |
| San98b | Sanders, Peter | 1998 | | Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132 | Proceedings Article |
| San98c | Sanders, Peter | 1998 | | Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309 | Journal Article |
| San98d | Sanders, Peter | 1998 | | Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165 | Journal Article |
| San99a | Sanders, Peter | 1999 | | Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327 | Proceedings Article |
| San99b | Sanders, Peter
Takkula, Tuomo
Wedelin, Dag | 1999 | | High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12 | Proceedings Article |
| San99c | Sanders, Peter | 1999 | | Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664 | Proceedings Article |
| San99d | Sanders, Peter | 1999 | | Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48 | Proceedings Article |
| San99e | Sanders, Peter | 1999 | | Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540 | Part of a Book |
| Sand98a | Sanders, Peter | 1998 | | Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97 | Journal Article |
| Sanders1999 | Sanders, Peter | 1999 | | Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033 | Journal Article |
| Sanders2000 | Sanders, Peter | 2000 | | Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25 | Electronic Journal Article |
| Sanders2000a | Sanders, Peter
Solis-Oba, Roberto | 2000 | | How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402 | Proceedings Article |
| Sanders2000b | Sanders, Peter | 2000 | | Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98 | Proceedings Article |
| Sanders2002 | Sanders, Peter
Träff, Jesper Larsson | 2002 | | The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803 | Proceedings Article |
| Sanders2002a | Bader, David
Moret, Bernard
Sanders, Peter | 2002 | | Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23 | Part of a Book |
| Sanders2002b | McGeoch, Catherine
Sanders, Peter
Fleischer, Rudolf
Cohen, Paul R.
Precup, Doina | 2002 | | Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126 | Part of a Book |
| Sanders2002c | Sanders, Peter | 2002 | | Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196 | Part of a Book |
| Sanders2002d | Sanders, Peter | 2002 | | Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573 | Journal Article |
| Sanders2002e | Sanders, Peter
Vollmar, R.
Worsch, T. | 2002 | | Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248 | Journal Article |
| Sanders2002f | Niedermeier, Rolf
Reinhard, Klaus
Sanders, Peter | 2002 | | Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237 | Journal Article |
| Sanders2002g | Sanders, Peter
Vöcking, Berthold | 2002 | | Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130 | Proceedings Article |
| Sanders2002h | Beier, Rene
Sanders, Peter
Sivadasan, Naveen | 2002 | | Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376 | Proceedings Article |
| Sanders2002i | Sanders, Peter | 2002 | | Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723 | Journal Article |
| Sanders2003 | Sanders, Peter | 2003 | | Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184 | Journal Article |
| Sanders2004a | Sanders, Peter | 2004 | | Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101 | Proceedings Article |
| Sanders2005 | Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott | 2005 | | Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463 | Journal Article |
| Sanders2005b | Fotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G. | 2005 | | Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248 | Journal Article |
| SandersPettie2004 | Sanders, Peter
Pettie, Seth | 2004 | | A Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
| Report |
| SandersWinkel2004 | Sanders, Peter | 2004 | | Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796 | Proceedings Article |
| SanEgnKor2000 | Sanders, Peter
Egner, Sebastian
Korst, Jan | 2000 | | Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858 | Proceedings Article |
| SanSib03 | Sanders, Peter
Sibeyn, Jop F. | 2003 | | A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38 | Journal Article |
| SanSib2000 | Sanders, Peter
Sibeyn, Jop F. | 2000 | | A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926 | Proceedings Article |
| SanSol2001 | Sanders, Peter
Solis-Oba, Roberto | 2001 | | How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98 | Journal Article |
| SanSte2005 | Sanders, Peter
Steurer, David | 2005 | | An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906 | Proceedings Article |
| SanVoe03 | Sanders, Peter
Vöcking, Berthold | 2003 | | Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article |
| SaSiSt13 | Sanders, Peter
Singler, Johannes
van Stee, Rob | 2013 | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | Journal Article |
| Sauerwald2010 | Sauerwald, Thomas
Stauffer, Alexandre | 2011 | | Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475 | Proceedings Article |
| scg89 | Mehlhorn (ed.) | 1989 | | Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89) | Proceedings |
| SCG90*216 | Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng | 1990 | | On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224 | Proceedings Article |
| SCG90*281 | Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian | 1990 | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | Proceedings Article |
| Schaefer2000 | Schäfer, Guido | 2000 | | Weighted Matchings in General Graphs
Universität des Saarlandes | Thesis - Masters thesis |
| Schäfer04 | Schäfer, Guido | 2004 | | Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes | Thesis - PhD thesis |
| Schäfer2003 | Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark | 2003 | | Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471 | Proceedings Article |
| SchalekampWvZ12 | Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke | 2012 | | A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486 | Proceedings Article |
| SchanneDipl01 | Schanne, Thomas | 2001 | | Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes | Thesis - Masters thesis |
| SchilzPhD2000 | Schilz, Thomas | 2000 | | Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes | Thesis - PhD thesis |
| Schirra-et-al-1-96 | Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan | 1996 | | Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327 | Journal Article |
| Schirra-et-al-2-96 | Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven | 1996 | | The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202 | Proceedings Article |
| Schirra-et-al-3-96 | Krithivasan, Kamala
Rema, Anna
Schirra, Stefan
Vijaykumar, P.I. | 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 |
| Schirra1999 | Mehlhorn, Kurt
Schirra, Stefan | 2000 | | Geometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286 | Proceedings Article |
| Schirra1999a | Schirra, Stefan | 1999 | | A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176 | Proceedings Article |
| Schirra2000 | Schirra, Stefan | 2000 | | Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632 | Part of a Book |
| Schirra2000DesignCGAL | Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven | 2000 | | On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202 | Journal Article |
| Schirra2000GenericProgramming | Brönnimann, Hervé
Kettner, Lutz
Schirra, Stefan
Veltkamp, Remco | 2000 | | Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216 | Part of a Book |
| Schirra2001EdgeColoring | Cole, Richard
Ost, Kirstin
Schirra, Stefan | 2001 | | Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12 | Journal Article |
| Schirra97a | Schirra, Stefan | 1997 | | Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287 | Part of a Book |
| Schirra97b | Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan | 1997 | | Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468 | Proceedings Article |
| Schirra97c | Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan | 1997 | | Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468 | Proceedings Article |
| Schirra_habil | Schirra, Stefan | 1998 | | Computational Geometry: Theory and Implementation
Universität des Saarlandes | Thesis - Habilitation thesis |
| Schmidt2012 | Schmidt, Jens M. | 2012 | | Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208 | Journal Article |
| Schmidt2012a | Schmidt, Jens M.
Valtr, Pavel | 2012 | | Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208 | Proceedings Article |
| Schmidt2012b | Schmidt, Jens M. | 2012 | | Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797 | Proceedings Article |
| Schmidt2013 | Schmidt, Jens M. | 2013 | | Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535 | Journal Article |
| Schmidt2013 | Schmidt, Jens M. | 2013 | | Contractions, Removals and How to Certify 3-Connectivity in Linear Time | Unpublished/Draft |
| Schmidt2013a | Schmidt, Jens M. | 2013 | | A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244 | Journal Article |
| Schmidt2013b | Schmidt, Jens M. | 2013 | | A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776 | Proceedings Article |
| Schmitt04a | Schmitt, Susanne | 2004 | | Improved separation bounds for the diamond operator | Report |
| Schmitt04b | Schmitt, Susanne | 2004 | | Common Subexpression Search in LEDA_reals -- a study of the diamond-operator | Report |
| Schmitt2003 | Schmitt, Susanne
Zimmer, Horst G. | 2003 | | Elliptic Curves : A Computational Approach | Book |
| Schmitt2005 | Schmitt, Susanne | 2005 | | The diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366 | Proceedings Article |
| SchmittFoussee2004 | Schmitt, Susanne
Fousse, Laurent | 2004 | | A comparison of polynomial evaluation schemes | Report |
| Schmitz95 | Schmitz, Christoph | 1995 | | Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes | Thesis - Masters thesis |
| Schoemer-Thiel95 | Schömer, Elmar
Thiel, Christian | 1995 | | Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60 | Proceedings Article |
| Schröder98 | Schröder, Bianca | 1998 | | Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes | Thesis - Masters thesis |
| SchulteDipl01 | Schulte, Ralph | 2001 | | Exaktes Lösen von Linearen Programmen
Universität des Saarlandes | Thesis - Masters thesis |
| SchultesDipl05 | Schultes, Dominik | 2005 | | Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes | Thesis - Masters thesis |
| Schwarz-et-al95a | Evans, B.L.
Schwarz, Christian
Teich, Jürgen | 1995 | | Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502 | Proceedings Article |
| Schwarz-et-al95b | Evans, Brian
Schwarz, Christian
Teich, Jürgen
Vainshtein, Alek
Welzl, Emo | 1995 | | Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35 | Proceedings Article |
| Schwarz-Smid-et-al95 | Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel | 1995 | | Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27 | Journal Article |
| Schwarzenecker95 | Schwarzenecker, Erik | 1995 | | Ein NP-schweres Plazierungsproblem
Universität des Saarlandes | Thesis - PhD thesis |
| Schwarzetal2009 | Schwarz, Karsten
Karrenbauer, Andreas
Schehr, Gregory
Rieger, H. | 2009 | | Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | Electronic Journal Article |
| Schweitzer2008 | Schweitzer, Pascal | 2009 | | Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232 | Journal Article |
| SchweitzerPhD2009 | Schweitzer, Pascal | 2009 | | Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes | Thesis - PhD thesis |
| SchweitzerSchweitzer2010 | Schweitzer, Pascal
Schweitzer, Patrick | 2010 | | Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | Journal Article |
| Seel94 | Seel, Michael | 1994 | | Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes | Thesis - Masters thesis |
| SeelDiss01 | Seel, Michael | 2001 | | Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes | Thesis - PhD thesis |
| Seiden1999 | Seiden, Steve S. | 1999 | | Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416 | Journal Article |
| Seiden2000 | Seiden, Steve S. | 2000 | | Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216 | Journal Article |
| selection07 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | 2007 | | Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225 | Proceedings Article |
| Semeloglou2000 | Semeloglou, Anastasios | 2000 | | Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes | Thesis - Masters thesis |
| SemKiel | Doerr, Benjamin
Gnewuch, Michael | 2006 | | Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding | Report |
| SET03 | Sanders, Peter
Egner, Sebastian
Tolhuizen, Ludo | 2003 | | Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294 | Proceedings Article |
| setcover07 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | 2007 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629 | Proceedings Article |
| Sharma2008 | Sharma, Vikram | 2008 | | Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310 | Electronic Journal Article |
| Shervashidze2011 | Shervashidze, Nino
Schweitzer, Pascal
van Leeuwen, Erik Jan
Mehlhorn, Kurt
Borgwardt, Karsten M. | 2011 | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | Journal Article |
| Shiva-Dubhashi95 | Chaudhuri, Shiva
Dubhashi, Devdatt | 1995 | | Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219 | Proceedings Article |
| Shiva-Hagerup95 | Chaudhuri, Shiva
Hagerup, Torben | 1995 | | Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218 | Proceedings Article |
| Shiva-Zaro-1-95 | Chaudhuri, Shiva
Zaroliagis, Christos | 1995 | | Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255 | Proceedings Article |
| Shiva-Zaro-2-95 | Chaudhuri, Shiva
Zaroliagis, Christos | 1995 | | Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45 | Proceedings Article |
| SiAbMe02 | Sibeyn, Jop F.
Abello, James
Meyer, Ulrich | 2002 | | Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292 | Proceedings Article |
| Sibeyn-et-al-1-96 | Sibeyn, Jop F. | 1996 | | List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541 | Proceedings Article |
| Sibeyn-et-al-1-97 | Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S. | 1997 | | Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141 | Journal Article |
| Sibeyn-et-al-2-96 | Sibeyn, Jop F. | 1996 | | Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541 | Proceedings Article |
| Sibeyn-et-al-3-96 | Juurlink, Ben
Sibeyn, Jop F.
Rao, P. Srinivasa | 1996 | | Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369 | Proceedings Article |
| Sibeyn-et-al96 | Preetham, A. J.
Krithivasan, Kamala
Rangan, C. Pandu
Sibeyn, Jop F. | 1996 | | Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, - | Proceedings Article |
| Sibeyn-Kaufmann97 | Kaufmann, Michael
Sibeyn, Jop F. | 1997 | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | Journal Article |
| Sibeyn2000 | Sibeyn, Jop F. | 2000 | | Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332 | Journal Article |
| Sibeyn95 | Sibeyn, Jop F. | 1995 | | Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228 | Proceedings Article |
| Sibeyn97a | Sibeyn, Jop F. | 1997 | | Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230 | Proceedings Article |
| Sibeyn97b | Sibeyn, Jop F. | 1997 | | Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287 | Journal Article |
| Sibeyn97c | Sibeyn, Jop F. | 1997 | | Routing with Finite Speeds of Memory and Network
In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497 | Proceedings Article |
| Sibeyn97d | Sibeyn, Jop F. | 1997 | | Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398 | Proceedings Article |
| Sibeyn97e | Sibeyn, Jop F.
Kaufmann, Michael | 1997 | | Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244 | Journal Article |
| SibeynGuillaumeSeidel1997 | Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann | 1997 | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | Proceedings Article |
| SibeynGuillaumeSeidel99 | Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann | 1999 | | Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180 | Journal Article |
| SibeynKaufmann1997 | Sibeyn, Jop F.
Kaufmann, Michael | 1997 | | BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240 | Proceedings Article |
| SICOMP::AltHMP1987 | Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P. | 1987 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | Journal Article |
| SICOMP::MehlhornNA1988 | Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut | 1988 | | A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102 | Journal Article |
| SICOMP::MehlhornT1986 | Mehlhorn, Kurt
Tsakalidis, Athanasios K. | 1986 | | An Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33 | Journal Article |
| Sitters2005 | Sitters, Rene | 2005 | | Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48 | Journal Article |
| Sitters2005b | Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene | 2005 | | Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 | Proceedings Article |
| Sitters2006 | Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas | 2006 | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | Proceedings Article |
| Sitters2006a | Feremans, Corinne
Grigoriev, Alexander
Sitters, Rene | 2006 | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | Journal Article |
| Sitters2006b | Sitters, Rene
Stougie, Leen | 2006 | | The general two-server problem
In: Journal of the ACM [53], 437-458 | Journal Article |
| Sitters2006c | Grigoriev, Alexander
van Loon, Joyce
Sitters, Rene
Uetz, Marc | 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 |
| Sitters2006d | Bartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene | 2006 | | On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48 | Proceedings Article |
| Sivadas2003 | Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold | 2003 | | Randomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244 | Journal Article |
| Sivadasan2004 | Schäfer, Guido
Sivadasan, Naveen | 2004 | | Topology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500 | Proceedings Article |
| Sivadasan2004-2 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | 2004 | | Online scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122 | Proceedings Article |
| Sivadasan2009 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | 2009 | | Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498 | Journal Article |
| SivadasanDiss04 | Sivadasan, Naveen | 2004 | | Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes | Thesis - PhD thesis |
| SivadasanSandersSkutella2004 | Sivadasan, Naveen
Sanders, Peter
Skutella, Martin | 2004 | | Online Scheduling with Bounded Migration | Report |
| SKH-CCRI-2009 | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | 2009 | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article |
| Skutella2003 | Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J. | 2003 | | The complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223 | Journal Article |
| Smid-et-al-1-95 | Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian | 1995 | | Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442 | Proceedings Article |
| Smid95 | Smid, Michiel | 1995 | | Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9 | Journal Article |
| SODATO2004 | Katriel, Irit
Bodlaender, Hans L. | 2005 | | Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450 | Proceedings Article |
| Solis-Oba1998a | Solis-Oba, Roberto | 1998 | | 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452 | Proceedings Article |
| Solis-Oba1998b | Solis-Oba, Roberto
Frederickson, Greg N. | 1998 | | Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125 | Proceedings Article |
| Solis-Oba1999a | Solis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim | 1999 | | Makespan minimization in job shops: a polynomial time approximation scheme
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399 | Proceedings Article |
| Solis-Oba1999f | Solis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim | 1999 | | A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188 | Proceedings Article |
| Solis-Oba1999h | Krysta, Piotr
Solis-Oba, Roberto | 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 |
| Son1999 | Son, Jung-Bae | 1999 | | Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes | Thesis - Masters thesis |
| Spoehel2011 | Mütze, Torsten
Rast, Thomas
Spöhel, Reto | 2011 | | Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158 | Proceedings Article |
| Spoehel2011a | Gugelmann, Luca
Spöhel, Reto | 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 |
| Spoehel2011b | Mütze, Torsten
Spöhel, Reto | 2011 | | On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 | Electronic Proceedings Article |
| Spoehel2011c | Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning | 2011 | | Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704 | Electronic Proceedings Article |
| Spoehel2011d | Mütze, Torsten
Spöhel, Reto | 2011 | | On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33 | Electronic Journal Article |
| SpoehelBM2012 | Belfrage, Michael
Mütze, Torsten
Spöhel, Reto | 2012 | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article |
| SpoehelK2012 | Krivelevich, Michael
Spöhel, Reto | 2012 | | Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | Journal Article |
| SpoehelPST2013 | Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning | 2013 | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article |
| Srivastava96 | Srivastava, Satanand | 1996 | | Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes | Thesis - Masters thesis |
| SRWLSM02 | Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian | 2002 | | Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328 | Proceedings Article |
| SSS12 | Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin | 2013 | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69 | Electronic Journal Article |
| SSS13 | Agrawal, Manindra
Saha, Chandan
Saxena, Nitin | 2013 | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | Proceedings Article |
| stacs07_rand | Doerr, Benjamin | 2007 | | Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452 | Proceedings Article |
| STACS::KaufmannM1987 | Kaufmann, Michael
Mehlhorn, Kurt | 1987 | | On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52 | Proceedings Article |
| Stee12 | van Stee, Rob | 2012 | | An improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74 | Journal Article |
| Stee12a | van Stee, Rob | 2012 | | SIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136 | Journal Article |
| Stee12b | van Stee, Rob | 2012 | | SIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129 | Journal Article |
| Stephan2000 | Stephan, Anne | 2000 | | Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes | Thesis - Masters thesis |
| Stormer98 | Stormer, Henrik | 1998 | | Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes | Thesis - Masters thesis |
| Sun2010 | Kao, Ming-Yang
Leung, Henry C. M.
Sun, He
Zhang, Yong | 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 |
| Sun2011 | Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He | 2011 | | Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Proceedings Article |
| Sun2011b | Chin, Francis Y. L.
Guo, Zeyu
Sun, He | 2011 | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | Journal Article |
| Sun2011c | Guo, Zeyu
Sun, He
Zhu, Hong | 2011 | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | Journal Article |
| Sun2012a | Giakkoupis, George
Sauerwald, Thomas
Sun, He
Woelfel, Philipp | 2012 | | Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | Electronic Proceedings Article |
| Sun2012b | Kane, Daniel
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He | 2012 | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Proceedings Article |
| Sun2012c | Sauerwald, Thomas
Sun, He | 2012 | | Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350 | Proceedings Article |
| SurveyCycleBases | Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K. | 2009 | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | Journal Article |
| SviridenkoWiese2013 | Sviridenko, Maxim
Wiese, Andreas | 2013 | | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article |
| sw-ectrac-05 | Seidel, Raimund
Wolpert, Nicola | 2005 | | On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115 | Proceedings Article |
| sw-eeaccaq-05 | Schömer, Elmar
Wolpert, Nicola | 2006 | | An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97 | Journal Article |
| SWAT::DietzfelbingerMHR1988 | Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H. | 1988 | | Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215 | Proceedings Article |
| SymHyp2006 | Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils | 2006 | | Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | Electronic Journal Article |
| S:NEWDSC:2011 | Sagraloff, Michael | 2011 | | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21 | Electronic Journal Article |
| TechReportGDF2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | 2006 | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report |
| Telikepalli2003a | Telikepalli, Kavitha | 2003 | | Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288 | Proceedings Article |
| Telikepalli2003b | Telikepalli, Kavitha
Varadarajan, Kasturi | 2003 | | On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173 | Proceedings Article |
| Telikepalli2003c | Telikepalli, Kavitha
Chandran, Sunil
Subramanian, C. R. | 2003 | | Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393 | Proceedings Article |
| TF_CGTA1 | Bringmann, Karl
Friedrich, Tobias | 2010 | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Journal Article |
