Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 4. BibTeX Citation Keys

Login to this database


 

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

BibTeX cite keyAuthor/EditorYearTitleType
Kaligosi2006aKaligosi, Kanela
Sanders, Peter
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
Kaligosi2006bBrodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin
2006Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341
Proceedings Article
Kaligosi/Master03Kaligosi, Kanela2003Length bounded network flows
Universität des Saarlandes
Thesis - Masters thesis
KamranDipl05Kamran Azam, Muhammad2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
Thesis - Masters thesis
Kapoor96Kapoor, Sanjiv1996On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Proceedings Article
KapoorSmid96Kapoor, Sanjiv
Smid, Michiel
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Journal Article
Kappel98Kappel, Holger1998Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Thesis - Masters thesis
Karkkainen2002Kärkkäinen, Juha2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
Karkkainen2003aKärkkäinen, Juha
Rao, S. Srinivasa
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
KarkkainenSanders2003Kärkkäinen, Juha
Sanders, Peter
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
Karrenbauer2004Karrenbauer, Andreas2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Thesis - other
KarrenbauerPhDKarrenbauer, Andreas2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - PhD thesis
Kasan95Kasan, Binaman1995Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Thesis - Masters thesis
Katajainen-Traeff97Katajainen, Jyrki
Träff, Jesper Larsson
1997A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228
Proceedings Article
KatMey03Katriel, Irit
Meyer, Ulrich
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
Katriel2004Katriel, Irit2004Attachment IconOn Algorithms for Online Topological Ordering and SortingReport
Katriel2004aKatriel, Irit2004Dynamic 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
Katriel2004bKatriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
KatrielSWC2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2005GCC-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
KatrielThesis2004Katriel, Irit2004Constraints and Changes
Universität des Saarlandes
Thesis - PhD thesis
KatrielThielGCCKatriel, Irit
Thiel, Sven
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Journal Article
KatSanTra03Katriel, Irit
Sanders, Peter
Träff, Jesper Larsson
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
Kaufmann-Meyer-Sibeyn94Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
Kaufmann-Meyer-Sibeyn97aKaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
Kaufmann-Meyer-Sibeyn97bKaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
Kaufmann-Raman-Sibeyn97Kaufmann, Michael
Raman, Rajeev
Sibeyn, Jop F.
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
Kaufmann-Schroeder-Sibeyn95Kaufmann, Michael
Schröder, Heiko
Sibeyn, Jop F.
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
Kaufmann-Sibeyn-1-95Kaufmann, Michael
Sibeyn, Jop F.
1995Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
Kaufmann-Sibeyn-Suel95Kaufmann, Michael
Sibeyn, Jop F.
Suel, Torsten
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
Kaufmann84/12Kaufmann, Michael
Mehlhorn, Kurt
1984Attachment IconLocal routing of two-terminal nets is easyReport
Kav08Kavitha, Telikepalli2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Proceedings Article
Kavitha2007TCSKavitha, Telikepalli
Mehlhorn, Kurt
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
Kavitha2012Kavitha, Telikepalli
Mestre, Julián
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Journal Article
KavithaALG2011Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Journal Article
KavithaMestre2008Kavitha, Telikepalli
Mestre, Julian
2009Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Proceedings Article
KavithaMestre2010Kavitha, Telikepalli
Mestre, Julian
2010Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
Electronic Journal Article
KavithaTCS2011Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Journal Article
KavvadiasPantziouSpirakisZaroliagis96Kavvadias, Dimitris J.
Pantziou, Grammati E.
Spirakis, Paul G.
Zaroliagis, Christos
1996Hammock-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-al95Han, Xiaofeng
Kelsen, Pierre
Ramachandran, Vijaya
Tarjan, Robert E.
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
Kelsen96Kelsen, Pierre1996Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Proceedings Article
KelsenMahajanRamesh96Kelsen, Pierre
Mahajan, Sanjeev
Ramesh, Hariharan
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Proceedings Article
kerber-ijcm-2009Kerber, Michael2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Journal Article
Kerber2006Kerber, Michael2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
KerberPhD2009Kerber, Michael2009Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Thesis - PhD thesis
KerberSagraloff:RootApprox:2011Kerber, Michael
Sagraloff, Michael
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Proceedings Article
KerberSagraloff_JSC_2012Kerber, Michael
Sagraloff, Michael
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
Kerber_CASC_2009Kerber, Michael2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
Kerzmann2000Kerzmann, Andreas2000Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Thesis - Masters thesis
Kesselmann2004aKesselman, Alexander
Kogan, Kirill
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Proceedings Article
Kesselmann2004bKesselman, Alexander
Guez, Dan
Rosen, Adi
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
Kesselmann2004cKesselman, Alexander
Lotker, Zvi
Mansour, Yishay
Patt-Shamir, Boaz
Schieber, Baruch
Sviridenko, Maxim
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
Kesselmann2004dKesselman, Alexander
Mansour, Yishay
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Journal Article
Kesselmann2005wonsKesselman, Alexander
Kowalski, Dariusz
2005Fast 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-Traeff97Keßler, Christoph W.
Träff, Jesper Larsson
1997Language 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
KesslerDipl02Kessler, Harald2002Robust Computation of Visibility Maps
Universität des Saarlandes
Thesis - Masters thesis
Kettner2003DegreeBoundKettner, Lutz
Kirkpatrick, David
Mantler, Andrea
Snoeyink, Jack
Speckmann, Bettina
Takeuchi, Fumihiko
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Journal Article
Kettner2003SafariKettner, Lutz
Rossignac, Jarek
Snoeyink, Jack
2003The 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
Kettner2004ClassroomKettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
Kettner2004HandbookKettner, Lutz
Näher, Stefan
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
Kettner2005HandleKettner, Lutz2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Electronic Proceedings Article
Kettner2005PseudoTriangEnumBrönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2005Counting 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
Kettner2005SocgVideoProceedingsMitchell, Rote, Kettner (ed.)200521st Annual Symposium on Computational Geometry (SCG'05)Proceedings
Kettner2005StxxlDementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
Kettner2005StxxlReportDementiev, Roman
Kettner, Lutz
Sanders, Peter
2005STXXL: Standard Template Library for XXL Data SetsReport
Kettner2006HandleKettner, Lutz2006Reference 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
Kettner2006PseudoTEnumBrönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack
2006Attachment IconCounting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739
Journal Article
Kettner2007CGALKernelHert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
Kettner2007ClassroomKettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
Kettner2007ECGBookMourrain, Bernard
Pion, Sylvain
Schmitt, Susanne
Técourt, Jean-Pierre
Tsigaridas, Elias
Wolpert, Nicola
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
Part of a Book
Kettner2007ECGBookzFogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
Kettner2007Nef3Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
Kettner98Kettner, Björn1998Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Thesis - Masters thesis
KhachiyanPorkolab2000Khachiyan, Leonid
Porkolab, Lorant
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Journal Article
Khosla2013Khosla, Megha2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
KimPaulPhilip2012Kim, Eun Jung
Paul, Christophe
Philip, Geevarghese
2012Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
Proceedings Article
KKM01Klau, Gunnar W.
Klein, Karsten
Mutzel, Petra
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
Proceedings Article
KKSKesselman, Alexander
Kowalski, Dariusz
Segal, Michael
2005Attachment IconEnergy 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-DSNKonwar, Kishori
Kowalski, Dariusz
Shvartsman, Alexander
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
Proceedings Article
Klaer94Klär, Gerhard1994Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Thesis - Masters thesis
Klau1997bKlau, Gunnar W.1998Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenMiscellaneous
Klau97aKlau, Gunnar W.1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Thesis - Masters thesis
KlauDiss01Klau, Gunnar W.2002A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes
Thesis - PhD thesis
Klauk/Diplom04Klauk, Mathias2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Thesis - Masters thesis
KlauMutzel1999Klau, Gunnar W.
Mutzel, Petra
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Proceedings Article
KlauMutzel1999aKlau, Gunnar W.
Mutzel, Petra
1999Optimal 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/89Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Report
Klein2000Klein, Karsten2000Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Thesis - Masters thesis
Klein2004Klein, Christian2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Thesis - Masters thesis
Klein2004bKlein, Christian2004Attachment IconA Fast Root Checking AlgorithmReport
KleMehMei90Klein, R.
Mehlhorn, Kurt
Meiser, Stefan
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Proceedings Article
KlKu2006aKlein, Rolf
Kutz, Martin
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
KlKu2006bKlein, Rolf
Kutz, Martin
2006Attachment IconThe 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+2000Kececioglu, John
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Reinert, Knut
Vingron, Martin
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
KM00aKlau, Gunnar W.
Mutzel, Petra
2000Optimal 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
KM03aKlau, Gunnar W.
Mutzel, Petra
2003Automatic 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
KM03bMehlhorn, Kurt2003Attachment IconThe 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
KM08Kavitha, Telikepalli
Nasre, Meghana
2008Optimal Popular MatchingsMiscellaneous
KM2005Kavitha, Telikepalli
Mehlhorn, Kurt
2005Attachment IconA 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
KMM07Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
2007Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
Proceedings Article
KMMP2004cKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
KMS-ICDCSKowalski, Dariusz
Musial, Peter M.
Shvartsman, Alexander
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Proceedings Article
KMV2005Katriel, Irit
Michel, Laurent
Van Hentenryck, Pascal
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
KMW2010Kratsch, Stefan
Marx, Dániel
Wahlström, Magnus
2010Parameterized 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
Knauer2012Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
KobelBachelor2008Kobel, Alexander2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
Thesis - Bachelor thesis
KobelMaster2011Kobel, Alexander2011Certified numerical root finding
Universität des Saarlandes
Thesis - Masters thesis
Koe-Leh-Neu-Oli:c:10:AcoMinCutKötzing, Timo
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro S.
2010Ant 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:ACOTSPKötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten
2010Theoretical 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:Foga11AcoLinFunKötzing, Timo
Neumann, Frank
Sudholt, Dirk
Wagner, Markus
2011Simple 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
Koetzing2010LatticeLearningKasprzik, Anna
Kötzing, Timo
2010String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
Proceedings Article
Koetzing2010NUMemLimitedCase, John
Kötzing, Timo
2010Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article
Koetzing2010NUTechniquesCase, John
Kötzing, Timo
2010Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Proceedings Article
KoetzingALT2011Kötzing, Timo2011Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Proceedings Article
KoetzingMolter2012Kötzing, Timo
Molter, Hendrik
2012ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122
Proceedings Article
KoetzingNRW2012Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
KoetzingNS11GPKötzing, Timo
Neumann, Frank
Spöhel, Reto
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
Proceedings Article
KoetzingSNO2011Kötzing, Timo
Sutton, Andrew M.
Neumann, Frank
O'Reilly, Una-May
2012The 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
KoetzingST2011Kötzing, Timo
Sudholt, Dirk
Theile, Madeleine
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
Proceedings Article
KohlbacherLenhof1999Kohlbacher, Oliver
Lenhof, Hans-Peter
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Proceedings Article
KohlbacherLenhof2000Kohlbacher, Oliver
Lenhof, Hans-Peter
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
Journal Article
Koldehofe1999Koldehofe, Boris1999Animation and Analysis of Distributed Algorithms
Universität des Saarlandes
Thesis - Masters thesis
Koller-et-al:dominance-constraintsKoller, Alexander
Mehlhorn, Kurt
Niehren, Joachim
2000Attachment IconA 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
Kollias2012Kollias, Konstantinos2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Electronic Journal Article
Kontogiannis2000Kontogiannis, Spyros
Pantziou, Grammati E.
Spirakis, Paul G.
Yung, Moti
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
Kontogiannis2002Kontogiannis, Spyros2002Lower 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
Kov07Kovács, Annamária2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Thesis - PhD thesis
Kovacs2004Kovács, Annamária2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Proceedings Article
Kovacs2005aKovács, Annamária2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
Kovacs2005bKovács, Annamária2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Proceedings Article
Kovacs2006Kovács, Annamária2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
Kowalik2005Kowalik, Lukasz2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Proceedings Article
Kowalik2006Chrobak, Marek
Dürr, Christoph
Jawor, Wojciech
Kowalik, Lukasz
Kurowski, Maciej
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Journal Article
Kowalik2009Kowalik, Lukasz2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Journal Article
KowalikAdjSparseGraphsKowalik, Lukasz2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Journal Article
KowalikEdgeColoringCole, Richard
Kowalik, Lukasz
2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Journal Article
KowalikISAAC2006Kowalik, Lukasz2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
Proceedings Article
KowalikKotzigCole, Richard
Kowalik, Lukasz
Skrekovski, Riste
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
Kowalski-LATIN-2004Fraigniaud, Pierre
Gasieniec, Leszek
Kowalski, Dariusz
Pelc, Andrzej
2004Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151
Proceedings Article
Kowalski-SODA-2004Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz
2004The 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-2004Kowalski, Dariusz
Shvartsman, Alex
2004Writing-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-2004Chlebus, Bogdan S.
Kowalski, Dariusz
Shvartsman, Alex
2004Collective 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
Kowalski2003aChlebus, Bogdan S.
Kowalski, Dariusz
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Journal Article
Kowalski2003bKowalski, Dariusz
Pelc, Andrzej
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Journal Article
KP-APPROXKowalski, Dariusz
Pelc, Andrzej
2004Centralized 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-ISAACKowalski, Dariusz
Pelc, Andrzej
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Proceedings Article
KP-SIROCCOKowalski, Dariusz
Pelc, Andrzej
2003Time 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-TCSKowalski, Dariusz
Pelc, Andrzej
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Journal Article
KPSS2010Kuhn, Fabian
Panagiotou, Konstantinos
Spencer, Joel
Steger, Angelika
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
Proceedings Article
KrandickMehlhorn2004aKrandick, Werner
Mehlhorn, Kurt
2004New Bounds for the Descartes MethodReport
KraNeuGECCO2009Kratsch, Stefan
Neumann, Frank
2009Fixed-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:intervalKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2003Attachment IconCertifying 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
Kratsch2008Kratsch, Stefan2009Polynomial 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
KratschLNO2010Kratsch, Stefan
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro Simone
2010Fixed 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
KratschPhD2010Kratsch, Stefan2010Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
Thesis - PhD thesis
KratschPilipczukPilipczukWahlstroem2012Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
KratschS2010Kratsch, Stefan
Schweitzer, Pascal
2010Isomorphism 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
KratschW2009Kratsch, Stefan
Wahlström, Magnus
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
KratschWahlstroem2012aKratsch, Stefan
Wahlström, Magnus
2012Compression 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
KratschWahlstroem2012bKratsch, Stefan
Wahlström, Magnus
2012Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
Proceedings Article
KroGhaMicNeuPPSN2008Kroeske, Jense
Ghandar, Adam
Michalewicz, Zbigniew
Neumann, Frank
2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
KrohmerMaster2012Krohmer, Anton2012Finding cliques in scale-free networks
Universität des Saarlandes
Thesis - Masters thesis
KrStWe2009Krumke, Sven
van Stee, Rob
Westphal, Stefan
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
Krysta1999aKrysta, Piotr
Pacholski, Leszek
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Journal Article
Krysta2001Krysta, Piotr
Kumar, V. S. Anil
2001Approximation 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
Krysta2001bKrysta, Piotr2001Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes
Thesis - PhD thesis
Krysta2001cKrysta, Piotr
Solis-Oba, Roberto
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Journal Article
Krysta2002aCsaba, Bela
Krysta, Piotr
Karpinski, Marek
2002Approximability 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
Krysta2002bCzumaj, Artur
Krysta, Piotr
Vöcking, Berthold
2002Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
Proceedings Article
Krysta2003bKrysta, Piotr2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Journal Article
KrystaLorys1999Krysta, Piotr
Lorys, Krzysztof
1999Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
Proceedings Article
ks-ncrah-10Kerber, Michael
Sagraloff, Michael
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Journal Article
KS11Kayal, Neeraj
Saha, Chandan
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
KS12Kayal, Neeraj
Saha, Chandan
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
Ksinsik96Ksinsik, Patric1996Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes
Thesis - Masters thesis
KSV03Krysta, Piotr
Sanders, Peter
Vöcking, Berthold
2003Scheduling 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:gccKatriel, Irit
Thiel, Sven
2003Fast 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
Kumar1999aKumar, V. S. Anil
Ramesh, Hariharan
1999Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Proceedings Article
Kumar1999bKumar, V. S. Anil
Ramesh, Hariharan
1999Markovian 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
Kumar2000Kumar, V. S. Anil
Arya, Sunil
Ramesh, Hariharan
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
Kumar2001aKumar, V. S. Anil2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Journal Article
Kursawe2002Albers, Susanne
Kursawe, Klaus
Schuierer, Sven
2002Exploring unkown environments with obstacles
In: Algorithmica [32], 123-143
Journal Article
Kursawe98Kursawe, Klaus1998Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Thesis - Masters thesis
Kutz05Kutz, Martin
Pór, Attila
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
Kutz2006Kutz, Martin2006Computing 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
Kutz3dAngelKutz, Martin2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
KutzHGames:2004Kutz, Martin2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Proceedings Article
KutzSchw2006Kutz, Martin
Schweitzer, Pascal
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Proceedings Article
KW2010bKratsch, Stefan
Wahlström, Magnus
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Proceedings Article
Kwappik98Kwappik, Carsten1998Exact Linear Programming
Universität des Saarlandes
Thesis - Masters thesis
KwekMehlhorn2003Kwek, St.
Mehlhorn, Kurt
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
Journal Article
Lambert2000


Lambert, Oliver2000Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes
Thesis - Masters thesis
LambertDipl01Lambert, Georg2001Ein Parametric Search Toolkit
Universität des Saarlandes
Thesis - Masters thesis
Lang94Lang, Hans-Hermann1994Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes
Thesis - Masters thesis
Lauer1998DiplomLauer, Thorsten1998Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes
Thesis - Masters thesis
Lee2010aChan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2010Continuous 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
Lee2010bChan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2010Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35
Proceedings Article
Lee2010cHan, Xin
Lam, Tak-Wah
Lee, Lap-Kei
To, Isaac K. K.
Wong, Prudence W. H.
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
Lee2010dChan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Journal Article
Lee2011bChan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei
2011Scheduling 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
Leejh2000aLee, Jae-Ha
Park, Sang-Min
Chwa, Kyung-Yong
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Journal Article
Leejh2000bLee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
Leejha2001Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong
2001Visibility-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
Leejhc2000Lee, Jae-Ha
Cheong, Otfried
Kwon, Woo-Cheol
Shin, Sung-Yong
Chwa, Kyung-Yong
2000Approximation 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
Leejhd2000Park, Sang-Min
Lee, Jae-Ha
Chwa, Kyung-Yong
2000Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526
Proceedings Article
LeeLK2012Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
Journal Article
LehNeuOliCEC2009Oliveto, Pietro Simone
Lehre, Per Kristian
Neumann, Frank
2009Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462
Proceedings Article
LehnSchw2007Lehnert, Jörg
Schweitzer, Pascal
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
Leinenbach95Leinenbach, Stefan1997Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes
Thesis - Masters thesis
Lenhof-1-97Lenhof, Hans-Peter1997New 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-97Reinert, Knut
Lenhof, Hans-Peter
Mehlhorn, Kurt
Mutzel, Petra
Kececioglu, John
1997Attachment IconA 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-97Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
Lenhof-et-al-3-97Jung, Bernd
Lenhof, Hans-Peter
Müller, Peter
Rüb, Christine
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
Lenhof-et-al95Datta, Amitava
Lenhof, Hans-Peter
Schwarz, Christian
Smid, Michiel
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal Article
Lenhof-Smid-1-92Lenhof, Hans-Peter
Smid, Michiel
1992Maintaining 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-95Lenhof, Hans-Peter
Smid, Michiel
1995Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Journal Article
Lenhof-Smid-2-92Lenhof, Hans-Peter
Smid, Michiel
1992Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Proceedings Article
Lenhof-Smid-2-94Lenhof, Hans-Peter
Smid, Michiel
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Journal Article
Lenhof-Smid-2-95Lenhof, Hans-Peter
Smid, Michiel
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Journal Article
Lenhof-Smid-91Lenhof, Hans-Peter
Smid, Michiel
1991An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
Lenhof-Smid93Lenhof, Hans-Peter
Smid, Michiel
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Journal Article
Lenhof-Smid94Lenhof, Hans-Peter
Smid, Michiel
1994An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Proceedings Article
Lenhof95Lenhof, Hans-Peter1995An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Part of a Book
LenhofMorgensternReinert1999Lenhof, Hans-Peter
Morgenstern, Burkhard
Reinert, Knut
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Journal Article
lenhof_habilLenhof, Hans-Peter1999Bioinformatik
Universität des Saarlandes
Thesis - Habilitation thesis
Lennerz2001Lennerz, Christian
Schömer, Elmar
2002Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
LennerzDiss05Lennerz, Christian2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Thesis - PhD thesis
LenReiVin1998Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
LenReiVin98Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A 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
Leonardi03Henzinger, Monika R.
Leonardi, Stefano
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
Leonardi04Leonardi, Stefano
Schäfer, Guido
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
Leonardi04ECLeonardi, Stefano
Schäfer, Guido
2004Cross-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
Lermen97Lermen, Martin1997Multiple Sequence Alignment
Universität des Saarlandes
Thesis - Masters thesis
Limbach2008Limbach, Sebastian2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Thesis - Masters thesis
LJM97Jünger, Michael
Leipert, Sebastian
Mutzel, Petra
1997Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
Proceedings Article
LLMMS2003Laura, Luigi
Leonardi, Stefano
Millozzi, Stefano
Meyer, Ulrich
Sibeyn, Jop F.
2003Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
Proceedings Article
lncs319*212Mehlhorn, Kurt
Rülling, W.
1988Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
lncs333*55Gao, Shaodi
Kaufmann, Michael
Mehlhorn, Kurt
Rülling, Wolfgang
Storb, Christoph
Jerrum, Mark
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proceedings Article
lncs379*88Mehlhorn, Kurt
Näher, S
1989A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Proceedings Article
lotkeretal06cocoonLotker, Zvi
Majumdar, Debapriyo
Narayanaswamy, N.S.
Weber, Ingmar
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
LpDisc2006Doerr, Benjamin2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Journal Article
LR2000Lermen, Martin
Reinert, Knut
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Journal Article
ls-dc-01Loock, Achim
Schömer, Elmar
2001A 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
LSWahlstroem2012Lokshtanov, Daniel
Saurabh, Saket
Wahlström, Magnus
2012Subexponential 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
LuettkeHuettmann2000ThesisLüttke-Hüttmann, Dirk2000Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes
Thesis - Masters thesis
Lutter96Lutter, Stefan1996Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes
Thesis - Masters thesis
M01Mutzel, Petra2001An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080
Journal Article
Mahajan-Ramos-Subrahmanyam97Mahajan, Sanjeev
Ramos, Edgar A.
Subrahmanyam, K. V.
1997Solving 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
MainbergerWTJND11Mainberger, Markus
Hoffmann, Sebastian
Weickert, Joachim
Tang, Ching Hoo
Johannsen, Daniel
Neumann, Frank
Doerr, Benjamin
2011Optimising 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
Mal05Elmasry, Amr
Elbassioni, Khaled M.
2005Output-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
Mal05zMalamatos, Theocharis2005Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194
Electronic Proceedings Article
Malamatos2007aArya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
Malamatos2007bArya, Sunil
Malamatos, Theocharis
Mount, David M.
2007A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Journal Article
Malamatos2008Malamatos, Theocharis2008Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Journal Article
Manjunath2008Eigensatz, Michael
Giesen, Joachim
Manjunath, Madhusudan
2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
Manjunath2008thManjunath, Madhusudan2008Two 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
Manjunath2009aGiesen, Joachim
Manjunath, Madhusudan
2009Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Electronic Proceedings Article
Manjunath2009bElmasry, Amr
Manjunath, Madhusudan
2009Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Proceedings Article
Manjunath2010Amini, Omid
Manjunath, Madhusudan
2010Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
Electronic Journal Article
Manjunath2011Manjunath, Madhusudan
Sharma, Vikram
2011Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
Journal Article
Manss97Manss, Christian1997Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes
Thesis - Masters thesis
MaRaSu00Ramos, Edgar A.2001Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
Journal Article
Margewitsch97Margewitsch, Erwin1997Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes
Thesis - Masters thesis
Martens2004Martens, Maren
Skutella, Martin
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
Master03/ParreiraParreira, Josiane2003Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
Thesis - Masters thesis
MasterWang2012Wang, Pengming2012Certification of Curve Arrangements
Universität des Saarlandes
Thesis - Masters thesis
MastSteurer06Steurer, David2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
Thesis - Masters thesis
MatijevicPhDMatijevic, Domagoj2007Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
Thesis - PhD thesis
Maue2006Maue, Jens2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Thesis - Masters thesis
MaueSandersMatijevic2006Maue, Jens
Sanders, Peter
Matijevic, Domagoj
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
Maurer97Maurer, Tanja1997Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes
Thesis - Masters thesis
Mavronikolas-et-al97Mavronicolas, Marios
Papatriantafilou, Marina
Tsigas, Philippas
1997The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
Mcbg2006Bárány, Imre
Doerr, Benjamin
2006Attachment IconBalanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469
Journal Article
McConnell2010Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
2011Certifying algorithms
In: Computer Science Review [5], 119-161
Journal Article
McConnella2010McConnella, Ross M.
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
2010Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
Electronic Journal Article
Megow2011-exploreMegow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
2011Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
Megow2011-MCschedBaruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Journal Article
Megow2011-speedAnand, S.
Garg, Naveen
Megow, Nicole
2011Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243
Proceedings Article
Megow2012-eulerianHöhn, Wiebke
Jacobs, Tobias
Megow, Nicole
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
Megow2012-universalEpstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
MegowMatheonBuch2009Megow, Nicole2010Keller oder Dach zuerst
In: Besser als Mathe, 111-116
Part of a Book
MegowMehlhornSchweitzer2012Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
2012Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Journal Article
MegowMestre2013Megow, Nicole
Mestre, Julian
2013Instance-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-turnaroundMegow, Nicole
Möhring, Rolf H.
Schulz, Jens
2011Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
Journal Article
MegowSVW2012Megow, Nicole
Skutella, Martin
Verschae, Jose
Wiese, Andreas
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
MegowV2013Megow, Nicole
Verschae, Jose
2013Dual 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-SODA2013Günther, Elisabeth
Maurer, Olaf
Megow, Nicole
Wiese, Andreas
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
Proceedings Article
mehhorn80eGüttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1980Attachment IconBinary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61
Journal Article
MehlhonMestre2009Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Journal Article
mehlhornKonidaris, G.
Mehlhorn, Kurt
Shell, D.A.
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsUnpublished/Draft
Mehlhorn-et-al-1-96Mehlhorn, Kurt
Näher, Stefan
Schilz, Thomas
Schirra, Stefan
Seel, Michael
Seidel, Raimund
Uhrig, Christian
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
Mehlhorn-et-al97Mehlhorn, Kurt
Shermer, Thomas C.
Yap, Chee
1997Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
Mehlhorn-et-al99Mehlhorn, Kurt
Näher, Stefan
Seel, Michael
Seidel, Raimund
Schilz, Thomas
Schirra, Stefan
Uhrig, Christian
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
Mehlhorn-Mutzel96Mehlhorn, Kurt
Mutzel, Petra
1996Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Journal Article
Mehlhorn-Naeher95Mehlhorn, Kurt
Näher, Stefan
1995Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Journal Article
Mehlhorn-Priebe95Mehlhorn, Kurt
Priebe, Volker
1995On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Proceedings Article
Mehlhorn-Sanders:ToolboxMehlhorn, Kurt
Sanders, Peter
2008Algorithms and Data Structures: The Basic ToolboxBook
Mehlhorn-Schaefer:WeightedMatchingsMehlhorn, Kurt
Schäfer, Guido
2000Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
Mehlhorn-Uhrig95Dietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
Mehlhorn-Uhrig97Mehlhorn, Kurt
Sundar, R.
Uhrig, Christian
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
mehlhorn01cMehlhorn, Kurt2001Attachment IconA Remark on the Sign Variation Method for Real Root IsolationUnpublished/Draft
mehlhorn01gMehlhorn, Kurt2001Attachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
Part of a Book
Mehlhorn02Mehlhorn, Kurt2002Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87
Proceedings Article
mehlhorn03Mehlhorn, Kurt2003Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Proceedings Article
mehlhorn05Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)2005Cache-Oblivious and Cache-Aware AlgorithmsReport
mehlhorn05Mehlhorn, Kurt2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
mehlhorn05Mehlhorn, Kurt
Waldmann, Uwe
Wilhelm, Reinhard
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Part of a Book
mehlhorn05oKaligosi, Kanela
Mehlhorn, Kurt
Munro, J. Ian
Sanders, Peter
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
mehlhorn05zFunke, Stefan
Mehlhorn, Kurt
Näher, Stefan
2005Attachment IconStructural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194
Journal Article
mehlhorn06Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
mehlhorn06bKratsch, Dieter
McConnell, Ross
Mehlhorn, Kurt
Spinrad, Jeremy P.
2006Attachment IconCertifying 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
mehlhorn06eKrandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
mehlhorn06xMehlhorn, Kurt2006Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Proceedings Article
mehlhorn06yAbraham, David J.
Cechlárová, Katarína
Manlove, David
Mehlhorn, Kurt
2005Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175
Proceedings Article
mehlhorn06zAronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
Mehlhorn157Mehlhorn, Kurt
Seel, Michael
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Journal Article
Mehlhorn1993hClarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Journal Article
Mehlhorn1999Mehlhorn, Kurt
Näher, Stefan
1999LEDA: a platform for combinatorial and geometric computingBook
mehlhorn2000oMehlhorn, Snelting (ed.)2000Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für InformatikProceedings
Mehlhorn2004PolylineApproxAranov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
Proceedings Article
Mehlhorn2007bMehlhorn, Kurt
Michail, Dimitrios
2007Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
Mehlhorn2008aGarg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
Mehlhorn2008bMehlhorn, Kurt
Kavitha, T.
Hariharan, R.
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
Mehlhorn2010Mehlhorn, Kurt2010Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Proceedings Article
Mehlhorn2013Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M.
2013Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
mehlhorn73Mehlhorn, Kurt1973The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25
Report
mehlhorn73aMehlhorn, Kurt1973Attachment IconOn the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196
Proceedings Article
mehlhorn73bMehlhorn, Kurt1973On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22
Report
mehlhorn74Mehlhorn, Kurt1974Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14
Report
Mehlhorn74Mehlhorn, Kurt1974Attachment IconThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
Proceedings Article
mehlhorn74aMehlhorn, Kurt1974Attachment IconPolynomial 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
mehlhorn75Alt, Helmut
Mehlhorn, Kurt
1975Untere Schranken für den Platzbedarf bei der kontext-freien AnalyseReport
mehlhorn75aMehlhorn, Kurt1975A game on graphsReport
mehlhorn75bMehlhorn, Kurt1974Attachment IconPolynomial and abstract subrecursive classes
Cornell University
Thesis - PhD thesis
mehlhorn75byMehlhorn, Kurt1975Best 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
1975Attachment IconA Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33
Journal Article
mehlhorn75fMehlhorn, Kurt1975Attachment IconNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
Journal Article
mehlhorn75yMehlhorn, Kurt
Galil, Zvi
1975Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319
Proceedings Article
mehlhorn75zMehlhorn, Kurt1975Bracket-Languages are Recognizable in Logarithmic SpaceReport
mehlhorn76Güttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
1976Binary Search Trees: Average and Worst Case BehaviorReport
mehlhorn76Mehlhorn, Kurt1976An O(n log n) lower bound for the synchronous circuit size of integer multiplicationReport
Mehlhorn76bMehlhorn, Kurt1976Attachment IconAn Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524
Journal Article
Mehlhorn76cMehlhorn, Kurt1976Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
Journal Article
mehlhorn76eAlt, Helmut
Mehlhorn, Kurt
1976Attachment IconLower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354
Proceedings Article
mehlhorn76fHeydthausen, Manfred
Mehlhorn, Kurt
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
Proceedings Article
mehlhorn76fMehlhorn, Kurt1976Attachment IconBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
Journal Article
mehlhorn76gGüttler, Reiner
Mehlhorn, Kurt
Schneider, Wolfgang
Wernet, Norbert
1976Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
Proceedings Article
Mehlhorn76jMehlhorn, Kurt
Galil, Zvi
1976Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Journal Article
mehlhorn76vMehlhorn, Kurt1976An improved lower bound on the formula complexity of context-free recognitionReport
mehlhorn76wMehlhorn, Kurt1976Dynamic Binary Search Trees : Extended AbstractsReport
mehlhorn76xMehlhorn, Kurt1976Dynamic Binary SearchReport
mehlhorn76zHeydthausen, Manfred
Mehlhorn, Kurt
1976Top down parsing of macro grammars (preliminary report)Report
mehlhorn77Mehlhorn, Kurt1977Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
Proceedings Article
Mehlhorn77aMehlhorn, Kurt1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
mehlhorn77cMehlhorn, Kurt1977Effiziente AlgorithmenBook
mehlhorn77dDeussen, Peter
Mehlhorn, Kurt
1977Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Journal Article
mehlhorn78Altenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter Cost
In: Automata, languages and programming (ICALP-78): 5th international colloquium, 15-25
Proceedings Article
mehlhorn78Mehlhorn, Kurt1978Effiziente Algorithmen: Ein BeispielReport
mehlhorn78aMehlhorn, Kurt1978Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
Journal Article
mehlhorn78tBlum, Norbert
Mehlhorn, Kurt
1978On the Average Number of Rebalancing Operations in Weight-Balanced TreesReport
mehlhorn78uMehlhorn, Kurt1978Sorting Presorted FilesReport
mehlhorn78wAlt, Helmut
Mehlhorn, Kurt
1978Complexity Arguments in Algebraic Language TheoryReport
[Replication or Save Conflict]
mehlhorn78xxAltenkamp, Doris
Mehlhorn, Kurt
1978Codes: Unequal Probabilities, Unequal Letter CostReport
mehlhorn78yMehlhorn, Kurt1978An efficient algorithm for constructing nearly optimal prefix codesReport
mehlhorn78zMehlhorn, Kurt1978Arbitrary Weight Changes in Dynamic TreesReport
mehlhorn79aAlt, Helmut
Mehlhorn, Kurt
1979Attachment IconComplexity 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
mehlhorn79bMehlhorn, Kurt1979Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
Journal Article
mehlhorn79bzMehlhorn, Kurt1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Journal Article
mehlhorn79cMehlhorn, Kurt1979Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
Journal Article
mehlhorn79dMehlhorn, Kurt1979Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380
Proceedings Article
mehlhorn79dzMehlhorn, Kurt1979Attachment IconSearching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145
Proceedings Article
mehlhorn79eMehlhorn, Kurt1979Attachment IconKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
Proceedings Article
mehlhorn79gBlum, Norbert
Mehlhorn, Kurt
1979Attachment IconMittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78
Proceedings Article
mehlhorn79hMehlhorn, Kurt1979Attachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
Proceedings Article
mehlhorn79iMehlhorn, Kurt
Tsagarakis, M.
1979On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
Journal Article
mehlhorn79jMehlhorn, Kurt1979Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
Journal Article
mehlhorn80Mehlhorn, Kurt
Overmars, Mark H.
1980Optimal dynamization of decomposable searching problemsReport
mehlhorn80bMehlhorn, Kurt1980Attachment IconPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
Proceedings Article
mehlhorn80cBlum, Norbert
Mehlhorn, Kurt
1980Attachment IconOn the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320
Journal Article
mehlhorn80dAltenkamp, Doris
Mehlhorn, Kurt
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article
mehlhorn80dzMehlhorn, Kurt1980A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112
Proceedings Article
mehlhorn80fMehlhorn, Kurt1980Attachment IconAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
Journal Article
mehlhorn80zMehlhorn, Kurt1980Lower bounds on the efficiency of transforming static data structures into dynamic structuresReport
mehlhorn81aHong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
mehlhorn81bMehlhorn, Kurt
Overmars, Mark H.
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Journal Article
mehlhorn81cHuddleston, S.
Mehlhorn, Kurt
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proceedings Article
mehlhorn81dMehlhorn, Kurt1981Attachment IconArbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211
Journal Article
mehlhorn81dzMehlhorn, Kurt1981Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
Journal Article
mehlhorn81eAlt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1981Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161
Proceedings Article
mehlhorn81gLengauer, Thomas
Mehlhorn, Kurt
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Journal Article
mehlhorn82aMehlhorn, Kurt1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
Journal Article
mehlhorn82cHuddleston, Scott
Mehlhorn, Kurt
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
Journal Article
mehlhorn82dMehlhorn, Kurt
Schmidt, Erik M.
1982Las 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
mehlhorn82eBecker, Michael
Degenhardt, W.
Doenhardt, J.
Hertel, S.
Kaninke, G.
Kerber, W.
Mehlhorn, Kurt
Näher, Stefan
Rohnert, H.
Winter, T.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
mehlhorn82fMehlhorn, Kurt1982Attachment IconOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
Proceedings Article
mehlhorn82gHong, Jia-Wei
Mehlhorn, Kurt
1982Cost tradeoffs in graph embeddings, with applicationsReport
mehlhorn83Mehlhorn, Kurt
Preparata, F. P.
1983Routing through a RectangleReport
mehlhorn83aLengauer, Thomas
Mehlhorn, Kurt
1983Four results on the complexity of VLSI computationsReport
mehlhorn83bEisenbarth, Bernhard
Ziviani, Nivio
Gonnet, Gaston H.
Mehlhorn, Kurt
Wood, Derick
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
mehlhorn83bzLengauer, Thomas
Mehlhorn, Kurt
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit LayoutsReport
mehlhorn83cLengauer, Thomas
Mehlhorn, Kurt
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design SystemReport
mehlhorn83dMehlhorn, Kurt
Vishkin, Uzi
1983Granularity of parallel memoriesReport
mehlhorn83evon Braunmühl, Burchard
Cook, Stephen
Mehlhorn, Kurt
Verbeek, Rutger
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Journal Article
mehlhorn83fHertel, Stefan
Mehlhorn, Kurt
1983Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Proceedings Article
mehlhorn83fHong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
mehlhorn83fMehlhorn, Kurt
Schmidt, Bernd H.
1983A 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
mehlhorn83iMehlhorn, Kurt
Preparata, Franco P.
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeReport
mehlhorn83jMehlhorn, Kurt1983$AT^2$-optimal VLSI for integer division and integer square rootingReport
mehlhorn83kMehlhorn, Kurt
Preparata, Franco P.
1983Attachment IconArea-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
Journal Article
mehlhorn83nMehlhorn, Kurt
Preparata, F. P.
1983$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Journal Article
mehlhorn84Mehlhorn, Kurt1984Channel Routing in Knock-Knee Mode: Simplified Algorithms and ProofReport
mehlhorn84aMehlhorn, Kurt1984Data structures and algorithms. Volume 1 : Sorting and searchingBook
mehlhorn84bMehlhorn, Kurt1984Data structures and algorithms. Volume 2 : Graph algorithms and NP-completenessBook
mehlhorn84bMehlhorn, Kurt1984Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryBook
mehlhorn84dBecker, Michael
Mehlhorn, Kurt
1984Attachment IconAlgorithms for routing in planar graphsReport
mehlhorn84eFontet, Mehlhorn (ed.)1984Theoretical aspects of computer science (STACS-84) : [1st] symposiumProceedings
mehlhorn84gKaufmann, Michael
Mehlhorn, Kurt
1984Attachment IconRouting through a generalized switchboxReport
mehlhorn84hMehlhorn, Kurt
Preparata, Franco P.
1984Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357
Proceedings Article
mehlhorn84iAlt, Helmut
Mehlhorn, Kurt
Munro, J. Ian
1984Attachment IconPartial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65
Journal Article
mehlhorn84jMehlhorn, Kurt1984Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89
Proceedings Article
mehlhorn84kMehlhorn, Kurt1984On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30
Proceedings Article
mehlhorn84lHoffmann, K
Mehlhorn, Kurt
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
mehlhorn84mLengauer, Thomas
Mehlhorn, Kurt
1984Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
Journal Article
mehlhorn84nMehlhorn, Kurt
Vishkin, Uzi
1984Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
Journal Article
mehlhorn84oAlt, Helmut
Mehlhorn, Kurt
Munro, J.
1984On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65
Journal Article
mehlhorn84ozHertel, Stefan
Mäntylä, Martti
Mehlhorn, Kurt
Nievergelt, Jurg
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
Journal Article
mehlhorn84qLengauer, Thomas
Mehlhorn, Kurt
1984Attachment IconThe 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
mehlhorn84rMehlhorn, Kurt1984$AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167
Journal Article
mehlhorn85Mehlhorn, Kurt
Schmidt, Bernd H.
1985On BF-perfect graphsReport
mehlhorn85aMannila, Heikki
Mehlhorn, Kurt
1985Attachment IconA fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272
Journal Article
mehlhorn85bAlt, Helmut
Mehlhorn, Kurt
1985Attachment IconSearching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848
Journal Article
mehlhorn85cMehlhorn (ed.)1985Theoretical aspects of computer science (STACS-85) : 2nd annual symposiumProceedings
mehlhorn85dMehlhorn, Kurt
Tsakalidis, Athanasios K.
1985Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
Proceedings Article
mehlhorn85dMehlhorn, Kurt
Tsakalidis, Athanasios K.
1985Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
Proceedings Article
mehlhorn85eFries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176
Proceedings Article
mehlhorn85eHertel, Stefan
Mehlhorn, Kurt
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Journal Article
mehlhorn85eHoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proceedings Article
mehlhorn85hMehlhorn, Kurt
Simon, Klaus
1985Attachment IconIntersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542
Proceedings Article
mehlhorn85kMehlhorn, Kurt
Preparata, Franco P.
1985Area-time optimal division for T=omega((logn)1+epsilon)Report
mehlhorn85kzAlt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1985Deterministic simulation of idealized parallel computers on more realistic onesReport
mehlhorn85zFries, O.
Mehlhorn, Kurt
Näher, Stefan
1985Dynamization of geometric data structuresReport
mehlhorn86Lengauer, Thomas
Mehlhorn, Kurt
1986Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
Part of a Book
mehlhorn86aMehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
mehlhorn86cMehlhorn, Kurt1986Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Journal Article
mehlhorn86dFürer, Martin
Mehlhorn, Kurt
1986AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225
Proceedings Article
mehlhorn86dFürer, Martin
Mehlhorn, Kurt
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
mehlhorn86dFürer, Martin
Mehlhorn, Kurt
1986VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328
Proceedings
mehlhorn86eCheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?Report
mehlhorn86gMehlhorn, Kurt
Schmidt, Bernd H.
1986Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Journal Article
mehlhorn86pLoeckx, Jacques
Mehlhorn, Kurt
Wilhelm, Reinhard
1986Grundlagen der ProgrammiersprachenBook
mehlhorn86rMehlhorn, Kurt
Näher, Stefan
Alt, Helmut
1986A Lower Bound for the Complexity of the Union-Split-Find ProblemReport
mehlhorn86yKaufmann, Michael
Mehlhorn, Kurt
1986On Local Routing of Two-Terminal NetsReport
mehlhorn86zMehlhorn, Kurt
Näher, Stefan
1986Dynamic fractional cascadingReport
mehlhorn87Mehlhorn (ed.)1987Workshop über Komplexitätstheorie, Effiziente Algorithmen und DatenstrukturenProceedings
mehlhorn87Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut
1987A 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
mehlhorn87hMehlhorn, Kurt1987A Faster Approximation Algorithm for the Steiner Problem in GraphsReport
mehlhorn87iMehlhorn, Kurt
Näher, Stefan
1987A faster compaction algorithm with automatic jog insertionReport
mehlhorn87zJung, Hermann
Mehlhorn, Kurt
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesReport
mehlhorn88Mehlhorn, Kurt
Rülling, W.
1988Compaction on the TorusReport
mehlhorn88kMehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
mehlhorn88lAhuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
mehlhorn88mMehlhorn, Kurt
Yap, Chee-Keng
1988Constructive Hopf's theorem: or how to untangle closed planar curvesReport
mehlhorn88zAhuja, Ravindra K.
Mehlhorn, Kurt
Orlin, James B.
Tarjan, Robert E.
1988Faster Algorithms for the Shortest Path ProblemReport
mehlhorn88zKaufmann, Michael
Mehlhorn, Kurt
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid GraphsReport
mehlhorn89Kaufmann, Michael
Mehlhorn, Kurt
1989Routing Problems in Grid GraphsReport
mehlhorn89zKaufmann, Michael
Mehlhorn, Kurt
1989Routing problems in grid graphsReport
mehlhorn89zMehlhorn, Kurt
Meiser, Stefan
O'Dunlaing, Colm
1989Attachment IconOn the construction of abstract Voronoi diagramsReport
mehlhorn90Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectanglesReport
mehlhorn90Mehlhorn, Kurt
Rülling, W.
1990Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
Journal Article
Mehlhorn90aMehlhorn, Kurt
Meiser, Stefan
Ó'Dúnlaing, Colm
1990On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239
Proceedings Article
Mehlhorn90bNäher, Stefan
Mehlhorn, Kurt
1990LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5
Proceedings Article
Mehlhorn90cCheriyan, Joseph
Hagerup, Torben
Mehlhorn, Kurt
1990Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248
Proceedings Article
mehlhorn90wMehlhorn, Kurt
Tsakalidis, Athanasios K.
1989Attachment IconData structuresReport
mehlhorn90yKaufmann, Morgan
Mehlhorn, Kurt
1990Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
Part of a Book
mehlhorn90zMehlhorn, Kurt
Näher, Stefan
1990A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166
Journal Article
Mehlhorn91aAlt, Helmut
Blum, Norbert
Mehlhorn, Kurt
Paul, Markus
1991Attachment IconComputing 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
Mehlhorn91bMehlhorn, Kurt
Yap, Chee-Keng
1991Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Journal Article
Mehlhorn91cMehlhorn, Kurt
Meiser, Stefan
O'Dúnlaing, Colm
1991On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Journal Article
mehlhorn91dDietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1991Dynamic Perfect Hashing: Upper and Lower BoundsReport
Mehlhorn91dFleischer, Rudolf
Jung, Hermann
Mehlhorn, Kurt
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
mehlhorn91eAlt, Helmut
Guibas, L.
Mehlhorn, Kurt
Karp, Richard M.
Wigderson, A.
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail ProbabilitiesReport
mehlhorn91fMehlhorn, Trajan (ed.)1991Effiziente Algorithmen - TagungsberichtProceedings
Mehlhorn92aAlt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
Mehlhorn92dMehlhorn, Kurt1992Recent 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
mehlhorn92dMehlhorn, Kurt
Näher, Stefan
1992Attachment IconAlgorithm 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
Mehlhorn92eFleischer, Rudolf
Fries, Otfried
Mehlhorn, Kurt
Meiser, Stefan
Näher, Stefan
Rohnert, Hans
Schirra, Stefan
Simon, Klaus
Tsakalidis, Athanasios
Uhrig, Christian
1992Selected 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
Mehlhorn92fClarkson, Kenneth L.
Mehlhorn, Kurt
Seidel, Raimund
1992Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Proceedings Article
Mehlhorn92gBaumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1992Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
Mehlhorn92gzMehlhorn, Kurt
Sharir, Micha
Welzl, Emo
1992Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
Mehlhorn92jAlt, Helmut
Geffert, Viliam
Mehlhorn, Kurt
1992Attachment IconA lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27
Journal Article
Mehlhorn92kKaufmann, Michael
Mehlhorn, Kurt
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Journal Article
Mehlhorn92mKlein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
1992Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Part of a Book
Mehlhorn93aKucera, Ludek
Mehlhorn, Kurt
Preis, B.
Schwarzenecker, E.
1993Attachment IconExact Algorithms for a Geometric Packing Problem (Extended Abstract)
In: Theoretical aspects of computer science (STACS-93) : 10th annual symposium, 317-322
Proceedings Article
Mehlhorn93bDobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
1993Attachment IconA 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
Mehlhorn93cMehlhorn, Kurt
Tsakalidis, Athanasios K.
1993Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Journal Article
Mehlhorn93dHagerup, Torben
Mehlhorn, Kurt
Munro, I.
1993Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Proceedings Article
Mehlhorn93eDubhashi, Devdatt P.
Ranjan, Desh
Mehlhorn, Kurt
Thiel, Christian
1993Attachment IconSearching, 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
Mehlhorn93fDietz, Paul
Mehlhorn, Kurt
Raman, Rajeev
Uhrig, Christian
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
Mehlhorn93gKlein, Rolf
Mehlhorn, Kurt
Meiser, Stefan
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Journal Article
Mehlhorn93iMehlhorn, Kurt
Sharir, Micha
Welzl, Emo
1993Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Journal Article
mehlhorn93jDobrindt, Katrin
Mehlhorn, Kurt
Yvinec, Mariette
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex PolyhedronReport
mehlhorn93kHoffmann, Kurt
Mehlhorn, Kurt
Rosenstiehl, Pierre
Tarjan, Robert E.
1984Sorting Jordan sequences in linear timeReport
mehlhorn94Buchberger, Mehlhorn, Näher, Nievergelt (ed.)1994Special issue on “algorithms: implementation, libraries and use”Book
Mehlhorn94bBurnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
1994Attachment IconHow to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239
Proceedings Article
Mehlhorn94cDietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
Mehlhorn94dMehlhorn, Kurt
Näher, Stefan
1994Attachment IconThe Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
Proceedings Article
Mehlhorn94eBilardi, Gianfranco
Chaudhuri, Shiva
Dubhashi, Devdatt
Mehlhorn, Kurt
1994Attachment IconA lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105
Journal Article
Mehlhorn94fBaumgarten, Hanna
Jung, Hermann
Mehlhorn, Kurt
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Journal Article
Mehlhorn94gMehlhorn, Kurt
Näher, Stefan
Nievergelt, Jurg
1994Attachment IconIntroduction
In: Journal of Symbolic Computation [17], 295-295
Journal Article
Mehlhorn94gzBurnikel, Christoph
Mehlhorn, Kurt
Schirra, Stefan
1994Attachment IconOn degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23
Proceedings Article
Mehlhorn94hKaufmann, Michael
Mehlhorn, Kurt
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Journal Article
Mehlhorn94iMehlhorn, Kurt
Sundar, R.
Uhrig, Christian
1994Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Proceedings Article
mehlhorn94jvan Leeuwen, Mehlhorn, Reps (ed.)1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94Report
Mehlhorn95Mehlhorn, Kurt1995Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
mehlhorn95Mehlhorn, Kurt1995Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363
Journal Article
mehlhorn95zMehlhorn, Kurt
Näher, Stefan
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
mehlhorn96Mehlhorn, Kurt1996Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52
Proceedings Article
mehlhorn96Mehlhorn, Kurt1996The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Proceedings Article
mehlhorn96Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1996The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
Proceedings Article
mehlhorn98Mehlhorn, Kurt1998Attachment IconAmortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102
Part of a Book
mehlhorn98Mehlhorn, Kurt
Näher, Stefan
1998From 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
mehlhorn98eMehlhorn (ed.)1998Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer CongressProceedings
mehlhorn99Arya, Sunil
Golin, Mordecai J.
Mehlhorn, Kurt
1999On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228
Journal Article
mehlhorn99Finkler, Ulrich
Mehlhorn, Kurt
1999Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902
Proceedings Article
mehlhorn99Mehlhorn, Kurt1999Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Proceedings Article
Mehlhorn99Mehlhorn, Kurt1999The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Proceedings Article
mehlhorn99Mehlhorn, Kurt1999The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Proceedings Article
mehlhorn99Mehlhorn, Kurt
Sack, Jörg-Rüdiger
Urrutia, Jorg
1999Editorial
In: Computational Geometry [12], 153-154
Journal Article
MehlhornCT93Mehlhorn, Kurt
Claus, Volker
Thomas, Wolfgang
1996Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
Proceedings Article
MehlhornMeiser01Mehlhorn, Kurt
Meiser, Stefan
Rasch, Ronald
2001Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Journal Article
MehlhornMFCS07Mehlhorn, Kurt2007Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Proceedings Article
MehlhornNäher98Mehlhorn, Kurt
Näher, Stefan
1998Attachment IconFrom 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
MehlhornNaeherUhrig1997Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1997The 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
MehlhornPriebe97Mehlhorn, Kurt
Priebe, Volker
1997On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220
Journal Article
MehlhornPU1992Mehlhorn, Kurt
Paul, Wolfgang J.
Uhrig, C
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Journal Article
MehlhornRay2010Mehlhorn, Kurt
Ray, Saurabh
2010Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Journal Article
MehlhornSack2000Mehlhorn, Kurt
Sack, Jörg-Rüdiger
2000Editorial
In: Computational Geometry [17], 1-2
Journal Article
MehlhornSchaefer2001Mehlhorn, Kurt
Schäfer, Guido
2001A 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
MehlhornSchweitzer2010Mehlhorn, Kurt
Schweitzer, Pascal
2010Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Proceedings Article
MehlhornTALG2011Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article
MehlhornThiel2000Mehlhorn, Kurt
Thiel, Sven
2000Attachment IconFaster 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
MehlhornZiegelmann2000Mehlhorn, Kurt
Ziegelmann, Mark
2000Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
Proceedings Article
MehlhornZiegelmann2001Mehlhorn, Kurt
Ziegelmann, Mark
2001Attachment IconCNOP - 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$^+$90Mehlhorn, Kurt
Tsakalidis, A.
1990Data Structures
In: Handbook of Theoretical Computer Science, 301-341
Part of a Book
mehlhorn:1989:lledtMehlhorn, Kurt
Näher, Stefan
1989LEDA: 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:BODMehlhorn, Kurt
Näher, Stefan
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Journal Article
Mehlhorn:1990:CGRMehlhorn, Kurt
Näher, Stefan
Rauch, Monika
1990On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Journal Article
Mehlhorn:1990:HLEMehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
MehMey2002Mehlhorn, Kurt
Meyer, Ulrich
2002Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
Proceedings Article
Mehnert/Diploma04Mehnert, Jens2004External Memory Suffix Array Construction
Universität des Saarlandes
Thesis - Masters thesis
MehSan03jMehlhorn, Kurt
Sanders, Peter
2003Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Journal Article
MeSchi:lede_realMehlhorn, Kurt
Schirra, Stefan
2001Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
Mestre2008Epstein, Leah
Kleiman, Elena
Mestre, Julian
2009Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
Proceedings Article
Mestre2009Kavitha, T.
Mestre, Julián
Nasre, M.
2009Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
Proceedings Article
Mestre2010Mestre, Julian2010Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057
Journal Article
Mestre2010aCanzar, Stefan
Elbassioni, Khaled
Mestre, Julian
2010A 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
Mestre2010bEpstein, Leah
Levin, Asaf
Mestre, Julian
Segev, Danny
2010Improved 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
Metzler97Metzler, Matthias1997Ergebnisüberprüfung bei Graphenalgorithmen
Universität des Saarlandes
Thesis - Masters thesis
Meyer-Sibeyn95Meyer, Ulrich
Sibeyn, Jop F.
1995Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290
Proceedings Article
Meyer2001aMeyer, Ulrich2001External 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
Meyer2001bMeyer, Ulrich2001Single-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
Meyer2001cMeyer, Ulrich2001Heaps 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
Meyer2002aMeyer, Ulrich2002Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75
Proceedings Article
Meyer2002dissMeyer, Ulrich2002Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms
Universität des Saarlandes
Thesis - PhD thesis
Meyer2003Meyer, Ulrich2003Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134
Journal Article
Meyer2003aMeyer, Ulrich
Sanders, Peter
2003$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Journal Article
Meyer95Meyer, Ulrich1995Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Thesis - Masters thesis
MeyerhenkeS2012Meyerhenke, Henning
Sauerwald, Thomas
2012Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
Journal Article
MeyerSanders1998aMeyer, 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
MeyerSibeyn1998aMeyer, Ulrich
Sibeyn, Jop F.
1998Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Proceedings Article
MeyerWetzel2006Meyer, Ulrike
Wetzel, Susanne
2006Introducing 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_Swat08Meyer, Ulrich2008On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy
Proceedings Article
MeySan2000Meyer, Ulrich
Sanders, Peter
2000Parallel 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
MeySanSib2003Meyer, Sanders, Sibeyn (ed.)2003Algorithms for Memory HierarchiesBook
MeySib02Meyer, Ulrich
Sibeyn, Jop F.
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Journal Article
MeyZeh06Meyer, Ulrich
Zeh, Norbert
2006I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551
Proceedings Article
MeyZeh2003Meyer, Ulrich
Zeh, Norbert
2003I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445
Proceedings Article
Me:ICALP2000Mehlhorn, Kurt2000Attachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Proceedings Article
MFCS::AltHMP1986Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
MGBFKKZNAAKJBL1998Mutzel, 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
1998AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article
Michail2004aMehlhorn, Kurt
Michail, Dimitrios
Telikepalli, Kavitha
Irving, Robert W.
Paluch, Katarzyna
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
Michail2004bKavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna
2004Attachment IconStrongly 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
Michail2006Michail, Dimitrios2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - PhD thesis
Miller-Zaroliagis97Miller, Tobias
Zaroliagis, Christos
1997A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73
Proceedings Article
Miller98Miller, Tobias1998Implementation and Experimental Evaluation of Dynamic Transitive Closure Algorithms
Universität des Saarlandes
Thesis - Masters thesis
Milosavljevic2009Guibas, Leonidas
Milosavljevic, Nikola
Motskin, Arik
2010Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
Proceedings Article
Milosavljevic2011ZigzagMilosavljevic, Nikola
Morozov, Dmitriy
Skraba, Primoz
2011Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225
Proceedings Article
MinLoad2004Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Srivastav, Anand
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Journal Article
MisraPhilipRamanSaurabh2010Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2010Attachment IconThe 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
MisraPhilipRamanSaurabh2011Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2011Attachment IconOn 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
MisraPhilipRamanSaurabh2012Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
MisraPhilipRamanSaurabhSikdar2010Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
2010Attachment IconFPT 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
MisraPhilipRamanSaurabhSikdar2012Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
MM05Mehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
Proceedings Article
MM05aMehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
MM06Mehlhorn, Kurt
Michail, Dimitrios
2006Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
mmnssuz-cbhcg-97Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
1997A 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
MMNSSUZ98Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
1998A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
MMueller98Müller, Matthias1998Ein Simulator für Prozessornetzwerke
Universität des Saarlandes
Thesis - Masters thesis
MnichPhilipSaurabhSuchy2012aMnich, Matthias
Philip, Geevarghese
Saurabh, Saket
Suchy, Ondrej
2012Attachment IconBeyond 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-2009Hemmer, Michael2009Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
MoehringSkutellaStork2004Moehring, Rolf H.
Skutella, Martin
Stork, Frederik
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Journal Article
MolterMaster2012Molter, Hendrik2012ACO beats EA on a dynamic pseudo-Boolean function
Universität des Saarlandes
Thesis - Masters thesis
MoranMaster2012Moran, Shay2012Shattering extremal systems
Universität des Saarlandes
Thesis - Masters thesis
MortensenPettie2005Mortensen, Christian Worm
Pettie, Seth
2005The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
Proceedings Article
MOS-CP2011Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
MOS06Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
2006Attachment IconReliable 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:86Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.)1986VLSI algorithms and architectures : Aegean workshop on computingProceedings
MPSS2002Mehlhorn, Kurt
Priebe, Volker
Schäfer, Guido
Sivadasan, Naveen
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
Journal Article
MS2002Mehlhorn, Kurt
Schäfer, Guido
2002Attachment IconImplementation 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-2010Mörig, Marc
Scholz, Sven
Tscheuschner, Tobias
Berberich, Eric
2010Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
MSWClustering2013Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
MS:Bistream:2011Mehlhorn, Kurt
Sagraloff, Michael
2011A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Journal Article
MS:Bitstream:2009Mehlhorn, Kurt
Sagraloff, Michael
2009Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Proceedings Article
Mueck98Mueck, Thomas1998Implementation of Hammock Decomposition with Application to Shortest Path Problems
Universität des Saarlandes
Thesis - Masters thesis
Müller-Rüb96Müller, Michael
Rüb, Christine
Rülling, Wolfgang
1996A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Journal Article
Müller95Müller, Peter1995Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere
Universität des Saarlandes
Thesis - Masters thesis
MüllerDiss99Müller, Peter1999Parallel molecular dynamics simulations for synthetic polymers
Universität des Saarlandes
Thesis - PhD thesis
MulCol2001Doerr, Benjamin
Srivastav, Anand
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Journal Article
MultiColor2004Doerr, Benjamin2004Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
Journal Article
MultVC07Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
MustafaRay2010Mustafa, Nabil H.
Ray, Saurabh
2010Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
Journal Article
Mutzel-et-al-1-97Jünger, Michael
Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
Mutzel-et-al-2-97Mutzel, Petra
Odenthal, Thomas
Scharbrodt, M.
1998The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Journal Article
Mutzel-et-al-95DeSimone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni
1995Exact 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-97Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A 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
Mutzel1999Mutzel, Petra1999Zeichnen von Diagrammen - Theorie und Praxis
Universität des Saarlandes
Thesis - Habilitation thesis
Mutzel95Mutzel, Petra1995A Polyhedral Approach to Planar Augmentation and Related Problems
In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507
Proceedings Article
Mutzel96Mutzel, Petra1996An alternative method to crossing minimization on hierarchical graphs
In: Proceedings of the 4th Symposium on Graph Drawing (GD-96), 318-333
Proceedings Article
MutzelZiegler1998Mutzel, Petra
Ziegler, Thomas
1999The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134
Proceedings Article
MZ00Mutzel, Petra
Ziegler, Thomas
2000The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
Proceedings Article
NaRa07Mustafa, Nabil H.
Ray, Saurabh
2007Attachment IconAn 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
NaRa07bRay, Saurabh
Mustafa, Nabil H.
2007Attachment IconWeak $\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
Naujoks10aAlthaus, Ernst
Altmeyer, Sebastian
Naujoks, Rouven
2010A New Combinatorial Approach to Parametric Path AnalysisReport
Naujoks2006Althaus, Ernst
Naujoks, Rouven
2006Attachment IconComputing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181
Proceedings Article
Naujoks2011Funke, Stefan
Laue, Soeren
Lotker, Zvi
Naujoks, Rouven
2011Power 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
NaujoksPhDNaujoks, Rouven2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
Thesis - PhD thesis
Naujoks/Diplom04Naujoks, Rouven2004A heuristic for solving interior point Methods exactly
Universität des Saarlandes
Thesis - Masters thesis
Nest98Nest, Martin1998Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene
Universität des Saarlandes
Thesis - Masters thesis
NeuEul07Neumann, Frank2008Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
Journal Article
Neukirch94Neukirch, Markus1994Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA
Universität des Saarlandes
Thesis - Masters thesis
Neumann2008Neumann, Frank
Witt, Carsten
2009Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Journal Article
Neumann2011Neumann, Frank
Reichel, Joachim
Skutella, Martin
2011Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Journal Article
NeumannHaltnerLehr1998Neumann, Dirk
Haltner, Elleonore
Lehr, Claus-Michael
Kohlbacher, Oliver
Lenhof, Hans-Peter
1998Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549
Proceedings Article
NeumannMaster2011Neumann, Adrian2011Implementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes
Thesis - Masters thesis
NeumannWitt2010Neumann, Frank
Witt, Carsten
2010Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
Journal Article
NeuOliWitGECCO2009Neumann, Frank
Oliveto, Pietro Simone
Witt, Carsten
2009Theoretical 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
NeuReiPPSN2008Neumann, Frank
Reichel, Joachim
2008Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Proceedings Article
NeuReiSku2008Neumann, Frank
Reichel, Joachim
Skutella, Martin
2008Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Proceedings Article
NeuSudWit2008Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2008Rigorous 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
NeuSudWitSwarm2009Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2009Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
Journal Article
NeuWegMST2007Neumann, Frank
Wegener, Ingo
2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Journal Article
NeuWitLion2008Neumann, Frank
Witt, Carsten
2008Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
Proceedings Article
NeuWittMST2006Neumann, Frank
Witt, Carsten
2006Ant Colony Optimization and the Minimum Spanning Tree ProblemReport
NewoDipl05Newo Kenmogne, Regis2005Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
Thesis - Masters thesis
Nissen98Nissen, Marco1998Graph Iterators: Decoupling Graph Structures from Algorithms
Universität des Saarlandes
Thesis - Masters thesis
NKH+2000Neumann, Dirk
Kohlbacher, Oliver
Haltner, Eleonore
Lenhof, Hans-Peter
Lehr, Claus-Michael
2000Modeling 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
Nor2012Nor, Igor
Hermlin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier
Sagot, Marie-France
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
NSBV+02Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
NSWACOchapter09Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2009Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120
Part of a Book
NSWSLS2007Neumann, Frank
Sudholt, Dirk
Witt, Carsten
2007Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Proceedings Article
nt-hemmer-2007Hemmer, Michael
Hert, Susan
Kettner, Lutz
Pion, Sylvain
Schirra, Stefan
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
Nutov/Penn/2000Nutov, Zeev
Penn, Michael
2000On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Journal Article
NZ97Zosin, Leonid1997A 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
Oberhauser97Oberhauser, Fred1997Arithmetik der Transduktoren
Universität des Saarlandes
Thesis - Masters thesis
OssamyDipl02Ossamy, Rodrigue2002TSP Cuts Outside the Template Paradigm
Universität des Saarlandes
Thesis - Masters thesis
Ost95Ost, Kirstin1995Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes
Thesis - Masters thesis
OTO_ISAAC_2007Ajwani, Deepak
Friedrich, Tobias
2007Average-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
Ott2013Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José
2013How 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
OttMaster2012Ott, Sebastian2012Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes
Thesis - Masters thesis
Paluch2006Paluch, Katarzyna2006Attachment IconA New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721
Proceedings Article
Panagiotou2008Panagiotou, Konstantinos2009Blocks 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
Panagiotou2012bPanagiotou, Konstantinos
Sinha, Makrand
2012Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Journal Article
PanagiotouSinhaProc2009Panagiotou, Konstantinos2009Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
Proceedings Article
PanagiotouSteger2008Panagiotou, Konstantinos
Steger, Angelika
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Proceedings Article
PanagiotouSteger2011Panagiotou, Konstantinos
Steger, Angelika
2011On 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
PanagiotouStegerJournal2010Panagiotou, Konstantinos
Steger, Angelika
2010Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
Journal Article
Papatr-Tsigas95Papatriantafilou, Marina
Tsigas, Philippas
1995Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Proceedings Article
Parreira03Parreira, Josiane2003On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes
Thesis - Masters thesis
patent2005Xu, Chihao
Wahl, Jürgen
Eeisenbrand, Friedrich
Karrenbauer, Andreas
Soh, Kian Min
Hitzelberger, Christoph
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
Paterson2000Fleischer, Rudolf
Wahl, Michaela
2000Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Proceedings Article
Pemmaraju2011Pemmaraju, Sriram V.
Raman, Rajiv
Varadarajan, Kasturi
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Journal Article
PerezGimenez2011Müller, Tobias
Perez-Gimenez, Xavier
Wormald, Nicholas
2011Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
Journal Article
Pettie-sensitivity2005Pettie, Seth2005Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
Proceedings Article
Pettie2005Pettie, Seth2005Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183
Proceedings Article
PettieSanders2004Pettie, Seth
Sanders, Peter
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
PettieSanders2005Pettie, Seth
Sanders, Peter
2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsUnpublished/Draft
PhDEmeliyanenko12Emeliyanenko, Pavel2012Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
Thesis - PhD thesis
PhilipMScThesis2008Philip, Geevarghese2008Attachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
Thesis - Masters thesis
PhilipPhDThesisPhilip, Geevarghese2011Attachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
Thesis - PhD thesis
PhilipRamanSikdar2009Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath
2009Attachment IconSolving 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
PhilipRamanSikdar2012Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Journal Article
PhilipRamanVillanger2010Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve
2010Attachment IconA 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
Piskorski94Piskorski, Jakub1994Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes
Thesis - Masters thesis
poly-hemmer-2009Hemmer, Michael2009Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
Polzin2002-ESAPolzin, Tobias
Vahdati Daneshmand, Siavash
2002Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
Proceedings Article
Polzin2002-MSTHPolzin, Tobias
Vahdati Daneshmand, Siavash
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
Journal Article
PolzinPhD03Polzin, Tobias2003Algorithms for the Steiner Problem in Networks
Universität des Saarlandes
Thesis - PhD thesis
PolzinVahdati2000Polzin, Tobias
Vahdati Daneshmand, Siavash
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Proceedings Article
PolzinVahdati2001aPolzin, Tobias
Vahdati Daneshmand, Siavash
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Journal Article
PolzinVahdati2001bPolzin, Tobias
Vahdati Daneshmand, Siavash
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Journal Article
Porkolab97aPorkolab, Lorant
Khachiyan, Leonid
1997Computing 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
Portz94Portz, Sascha1994Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes
Thesis - Masters thesis
Potikoglou99Potikoglou, Ioannis1999Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes
Thesis - Masters thesis
Pouchkarev2000Pouchkarev, Igor2000ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes
Thesis - Masters thesis
Pourmiri2013Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
PriebeDiss01Priebe, Volker2001Average-case complexity of shortest-paths problems
Universität des Saarlandes
Thesis - PhD thesis
PS03Sanders, Peter2003Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
ptrianta-tsigas97-1Papatriantafilou, Marina
Tsigas, Philippas
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Journal Article
ptrianta-tsigas98-1Panconesi, Alessandro
Papatriantafilou, Marina
Tsigas, Philippas
Vitanyi, Paul
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Journal Article
Pyrga2007Pyrga, Evangelia
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
Pyrga2008Pyrga, Evangelia
Ray, Saurabh
2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Proceedings Article
Pyrga2009Pyrga, Evangelia
Chung, Christine
2009Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
Proceedings Article
PyrgaDipl05Pyrga, Evangelia2005Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
Thesis - Masters thesis
PyrgaPhD2010Pyrga, Evangelia2010Algorithmic Game Theory and Networks
Universität des Saarlandes
Thesis - PhD thesis
QianSWvZ12Qian, Jiawei
Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke
2012On 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
Rahul2001Ray, Rahul
Smid, MIchiel
Lange, Katharina
Wendt, Ulrich
2002Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
Rahul2002aWendt, Ulrich
Lange, Katharina
Smid, Michiel
Ray, Rahul
Tönnies, Klaus-Dietz
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Journal Article
Rahul2002bAgarwal, Pankaj
Hagerup, Torben
Ray, Rahul
Sharir, Micha
Smid, Michiel
Welzl, Emo
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
Rahul2002cWendt, Ulrich
Lange, Katharina
Ray, Rahul
Smid, Michiel
2001Surface Topography Quantification using Computational GeometryMiscellaneous
Rahul2002dRay, Rahul2002An O(nlogn) Algorithm for Classifying Identical CurvesMiscellaneous
Rahul2003Smid, Michiel
Ray, Rahul
Wendt, Ulrich
Lange, Katharina
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
Raman2009Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
2009Attachment IconOn 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
Ramezani2010Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C.
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
Ramezani2011Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
Ramezani2013Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
Ramos00Ramos, Edgar A.2001An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
Journal Article
Ramos1999Ramos, Edgar A.1999On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
Proceedings Article
Ramos2000aAmato, Nancy M.
Goodrich, Michael T.
Ramos, Edgar A.
2000Linear-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
Ramos2000bDey, Tamal K.
Mehlhorn, Kurt
Ramos, Edgar A.
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Journal Article
Ramos2000cRamos, Edgar A.2000Deterministic 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
Ramos2000dRamos, Edgar A.2000Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
Proceedings Article
Ramos2000eRamos, Edgar A.
Amato, Nancy M.
Goodrich, Michael T.
2000Computing 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
Ramos97Ramos, Edgar A.1997Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
Proceedings Article
Ramos97aRamos, Edgar A.1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Journal Article
RandCol2006Doerr, Benjamin2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Journal Article
Rasch94Rasch, Ronald1994Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Thesis - PhD thesis
RatSanKni99Rathe, Ulrich
Sanders, Peter
Knight, Peter
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
Rau97Rau, Stephan1997Ein 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
RaufDiss04Rauf, Imran2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Masters thesis
RayDiss04Ray, Rahul2004Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
Thesis - PhD thesis
Ray/Diploma04Ray, Saurabh2004Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
Thesis - Masters thesis
Reichel2003Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
Schömer, Elmar
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
Reichel2005Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
ReichelDipl01Reichel, Joachim2001Attachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
Thesis - Masters thesis
Reinert94Reinert, Knut1994Deferred Data Structuring
Universität des Saarlandes
Thesis - Masters thesis
ReinertDiss99Reinert, Knut1999A polyhedral approach to sequence alignment problems
Universität des Saarlandes
Thesis - PhD thesis
Reinstaedtler-Dipl98Reinstädtler, Martin1998Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Thesis - Masters thesis
res_2010Emeliyanenko, Pavel2010Attachment IconA 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
Rieger95Rieger, Joachim1995Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Journal Article
rizkallah:2011:matchingRizkallah, Christine2011Maximum Cardinality Matching
In: Archive of Formal Proofs,
Electronic Journal Article
Roehrig1998DiplomRöhrig, Hein1998Tree Decomposition: A Feasibility Study
Universität des Saarlandes
Thesis - Masters thesis
Rottmann96Rottmann, Klaus-Dieter1996Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes
Thesis - Masters thesis
RoundSmSub2006Doerr, Benjamin2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Journal Article
RSPM98Sanders, Peter
Reussner, Ralf
Prechelt, Lutz
Müller, Matthias
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
Rueb-1-97Rüb, Christine1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Journal Article
Rueb95Rüb, Christine1995On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Proceedings Article
Rüb98Rüb, Christine1998On 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
Ruppert1999Ruppert, Barbara1999Polygontriangulierung in Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
RusinovSchweitzer2010Rusinov, Momchil
Schweitzer, Pascal
2010Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Journal Article
s-cssl-03Schmitt, Susanne2003Common Subexpression Search in LEDA_realsReport
s-doran-03Schmitt, Susanne2003The Diamond Operator for Real Algebraic NumbersReport
Sabo1999Sabo, Holger1999Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Thesis - Masters thesis
Sagraloff-BitstreamComplexity2010aSagraloff, Michael2010On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Electronic Journal Article
Sagraloff-BitstreamPrecision2011Sagraloff, Michael2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Journal Article
SagraloffMPGJahrbuch2012Sagraloff, Michael2012Exaktes geometrisches RechnenMiscellaneous
SagraloffYap:CEVAL:2011Sagraloff, Michael
Yap, Chee
2011A 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_2012Sagraloff, Michael2012When 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
Same2005Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2007Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Journal Article
SameCPAIOR2004Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Filtering 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
San2001aSanders, Peter2001Reconciling 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
San98bSanders, Peter1998Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Proceedings Article
San98cSanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Journal Article
San98dSanders, Peter1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Journal Article
San99aSanders, Peter1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
San99bSanders, Peter
Takkula, Tuomo
Wedelin, Dag
1999High 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
San99cSanders, Peter1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
San99dSanders, Peter1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
San99eSanders, Peter1999Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
Part of a Book
Sand98aSanders, Peter1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Journal Article
Sanders1999Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
Sanders2000Sanders, Peter2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
Sanders2000aSanders, Peter
Solis-Oba, Roberto
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
Sanders2000bSanders, Peter2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
Sanders2002Sanders, Peter
Träff, Jesper Larsson
2002The 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
Sanders2002aBader, David
Moret, Bernard
Sanders, Peter
2002Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23
Part of a Book
Sanders2002bMcGeoch, Catherine
Sanders, Peter
Fleischer, Rudolf
Cohen, Paul R.
Precup, Doina
2002Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
Part of a Book
Sanders2002cSanders, Peter2002Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Part of a Book
Sanders2002dSanders, Peter2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Journal Article
Sanders2002eSanders, Peter
Vollmar, R.
Worsch, T.
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
Sanders2002fNiedermeier, Rolf
Reinhard, Klaus
Sanders, Peter
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Journal Article
Sanders2002gSanders, Peter
Vöcking, Berthold
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Proceedings Article
Sanders2002hBeier, Rene
Sanders, Peter
Sivadasan, Naveen
2002Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376
Proceedings Article
Sanders2002iSanders, Peter2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Journal Article
Sanders2003Sanders, Peter2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Journal Article
Sanders2004aSanders, Peter2004Algorithms 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
Sanders2005Hutchinson, David A.
Sanders, Peter
Vitter, Jeffrey Scott
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
Sanders2005bFotakis, Dimitris
Pagh, Rasmus
Sanders, Peter
Spirakis, Paul G.
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
Journal Article
SandersPettie2004Sanders, Peter
Pettie, Seth
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Report
SandersWinkel2004Sanders, Peter2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
SanEgnKor2000Sanders, Peter
Egner, Sebastian
Korst, Jan
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
SanSib03Sanders, Peter
Sibeyn, Jop F.
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
SanSib2000Sanders, Peter
Sibeyn, Jop F.
2000A 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
SanSol2001Sanders, Peter
Solis-Oba, Roberto
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
SanSte2005Sanders, Peter
Steurer, David
2005An 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
SanVoe03Sanders, Peter
Vöcking, Berthold
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
SaSiSt13Sanders, Peter
Singler, Johannes
van Stee, Rob
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
Sauerwald2010Sauerwald, Thomas
Stauffer, Alexandre
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
scg89Mehlhorn (ed.)1989Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
Proceedings
SCG90*216Fleischer, Rudolf
Mehlhorn, Kurt
Rote, Günter
Welzl, Emo
Yap, Chee-Keng
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
SCG90*281Alt, Helmut
Fleischer, Rudolf
Kaufmann, Michael
Mehlhorn, Kurt
Näher, Stefan
Schirra, Stefan
Uhrig, Christian
1990Approximate 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
Schäfer04Schäfer, Guido2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
Schaefer2000Schäfer, Guido2000Weighted Matchings in General Graphs
Universität des Saarlandes
Thesis - Masters thesis
Schäfer2003Becchetti, Luca
Leonardi, Stefano
Marchetti-Spaccamela, Alberto
Schäfer, Guido
Vredeveld, Tjark
2003Average 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
SchalekampWvZ12Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke
2012A 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
SchanneDipl01Schanne, Thomas2001Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Thesis - Masters thesis
SchilzPhD2000Schilz, Thomas2000Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Thesis - PhD thesis
Schirra-et-al-1-96Devillers, Olivier
Golin, Mordecai J.
Kedem, Klara
Schirra, Stefan
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
Schirra-et-al-2-96Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
1996The 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-96Krithivasan, Kamala
Rema, Anna
Schirra, Stefan
Vijaykumar, P.I.
1996Velocity 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
Schirra1999Mehlhorn, Kurt
Schirra, Stefan
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
Schirra1999aSchirra, Stefan1999A 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
Schirra2000Schirra, Stefan2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
Schirra2000DesignCGALFabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
Schirra2000GenericProgrammingBrönnimann, Hervé
Kettner, Lutz
Schirra, Stefan
Veltkamp, Remco
2000Applications 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
Schirra2001EdgeColoringCole, Richard
Ost, Kirstin
Schirra, Stefan
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
Schirra97aSchirra, Stefan1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
Schirra97bSchwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing 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
Schirra97cSchwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing 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_habilSchirra, Stefan1998Computational Geometry: Theory and Implementation
Universität des Saarlandes
Thesis - Habilitation thesis
Schmidt2012Schmidt, Jens M.2012Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Journal Article
Schmidt2012aSchmidt, Jens M.
Valtr, Pavel
2012Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Proceedings Article
Schmidt2012bSchmidt, Jens M.2012Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Proceedings Article
Schmidt2013Schmidt, Jens M.2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Journal Article
Schmidt2013Schmidt, Jens M.2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/Draft
Schmidt2013aSchmidt, Jens M.2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Journal Article
Schmidt2013bSchmidt, Jens M.2013A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Proceedings Article
Schmitt04aSchmitt, Susanne2004Improved separation bounds for the diamond operatorReport
Schmitt04bSchmitt, Susanne2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorReport
Schmitt2003Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
Schmitt2005Schmitt, Susanne2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
SchmittFoussee2004Schmitt, Susanne
Fousse, Laurent
2004Attachment IconA comparison of polynomial evaluation schemesReport
Schmitz95Schmitz, Christoph1995Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Thesis - Masters thesis
Schoemer-Thiel95Schömer, Elmar
Thiel, Christian
1995Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Proceedings Article
Schröder98Schröder, Bianca1998Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Thesis - Masters thesis
SchulteDipl01Schulte, Ralph2001Exaktes Lösen von Linearen Programmen
Universität des Saarlandes
Thesis - Masters thesis
SchultesDipl05Schultes, Dominik2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Thesis - Masters thesis
Schwarz-et-al95aEvans, B.L.
Schwarz, Christian
Teich, Jürgen
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
Schwarz-et-al95bEvans, Brian
Schwarz, Christian
Teich, Jürgen
Vainshtein, Alek
Welzl, Emo
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
Schwarz-Smid-et-al95Golin, Mordecai J.
Raman, Rajeev
Schwarz, Christian
Smid, Michiel
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
Schwarzenecker95Schwarzenecker, Erik1995Ein NP-schweres Plazierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
Schwarzetal2009Schwarz, Karsten
Karrenbauer, Andreas
Schehr, Gregory
Rieger, H.
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
Schweitzer2008Schweitzer, Pascal2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
SchweitzerPhD2009Schweitzer, Pascal2009Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
Thesis - PhD thesis
SchweitzerSchweitzer2010Schweitzer, Pascal
Schweitzer, Patrick
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
Seel94Seel, Michael1994Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Thesis - Masters thesis
SeelDiss01Seel, Michael2001Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
Thesis - PhD thesis
Seiden1999Seiden, Steve S.1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Journal Article
Seiden2000Seiden, Steve S.2000Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Journal Article
selection07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
Semeloglou2000Semeloglou, Anastasios2000Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Thesis - Masters thesis
SemKielDoerr, Benjamin
Gnewuch, Michael
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
SET03Sanders, Peter
Egner, Sebastian
Tolhuizen, Ludo
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
Proceedings Article
setcover07Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
Sharma2008Sharma, Vikram2008Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Electronic Journal Article
Shervashidze2011Shervashidze, Nino
Schweitzer, Pascal
van Leeuwen, Erik Jan
Mehlhorn, Kurt
Borgwardt, Karsten M.
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
Shiva-Dubhashi95Chaudhuri, Shiva
Dubhashi, Devdatt
1995Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Proceedings Article
Shiva-Hagerup95Chaudhuri, Shiva
Hagerup, Torben
1995Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
Shiva-Zaro-1-95Chaudhuri, Shiva
Zaroliagis, Christos
1995Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Proceedings Article
Shiva-Zaro-2-95Chaudhuri, Shiva
Zaroliagis, Christos
1995Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Proceedings Article
SiAbMe02Sibeyn, Jop F.
Abello, James
Meyer, Ulrich
2002Heuristics 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-96Sibeyn, Jop F.1996List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
Proceedings Article
Sibeyn-et-al-1-97Sibeyn, Jop F.
Kaufmann, Michael
Chlebus, Bogdan S.
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Journal Article
Sibeyn-et-al-2-96Sibeyn, Jop F.1996Routing 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-96Juurlink, Ben
Sibeyn, Jop F.
Rao, P. Srinivasa
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
Sibeyn-et-al96Preetham, A. J.
Krithivasan, Kamala
Rangan, C. Pandu
Sibeyn, Jop F.
1996Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Proceedings Article
Sibeyn-Kaufmann97Kaufmann, Michael
Sibeyn, Jop F.
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
Sibeyn2000Sibeyn, Jop F.2000Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Journal Article
Sibeyn95Sibeyn, Jop F.1995Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
Proceedings Article
Sibeyn97aSibeyn, Jop F.1997Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230
Proceedings Article
Sibeyn97bSibeyn, Jop F.1997Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Journal Article
Sibeyn97cSibeyn, Jop F.1997Routing 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
Sibeyn97dSibeyn, Jop F.1997Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Proceedings Article
Sibeyn97eSibeyn, Jop F.
Kaufmann, Michael
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
SibeynGuillaumeSeidel1997Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann
1997Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
SibeynGuillaumeSeidel99Sibeyn, Jop F.
Guillaume, Frank
Seidel, Tillmann
1999Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Journal Article
SibeynKaufmann1997Sibeyn, Jop F.
Kaufmann, Michael
1997BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240
Proceedings Article
SICOMP::AltHMP1987Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
SICOMP::MehlhornNA1988Mehlhorn, Kurt
Näher, Stefan
Alt, Helmut
1988A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
Journal Article
SICOMP::MehlhornT1986Mehlhorn, Kurt
Tsakalidis, Athanasios K.
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Journal Article
Sitters2005Sitters, Rene2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
Sitters2005bElbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
Sitters2006Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
Sitters2006aFeremans, Corinne
Grigoriev, Alexander
Sitters, Rene
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
Sitters2006bSitters, Rene
Stougie, Leen
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
Sitters2006cGrigoriev, Alexander
van Loon, Joyce
Sitters, Rene
Uetz, Marc
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
Sitters2006dBartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene
2006On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48
Proceedings Article
Sivadas2003Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
Sivadasan2004Schäfer, Guido
Sivadasan, Naveen
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
Sivadasan2004-2Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
Sivadasan2009Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
SivadasanDiss04Sivadasan, Naveen2004Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Thesis - PhD thesis
SivadasanSandersSkutella2004Sivadasan, Naveen
Sanders, Peter
Skutella, Martin
2004Attachment IconOnline Scheduling with Bounded MigrationReport
SKH-CCRI-2009Sagraloff, Michael
Kerber, Michael
Hemmer, Michael
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
Skutella2003Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
Smid-et-al-1-95Follert, Frank
Schömer, Elmar
Sellen, Jürgen
Smid, Michiel
Thiel, Christian
1995Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
Smid95Smid, Michiel1995Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Journal Article
SODATO2004Katriel, Irit
Bodlaender, Hans L.
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article
Solis-Oba1998aSolis-Oba, Roberto19982-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-Oba1998bSolis-Oba, Roberto
Frederickson, Greg N.
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
Solis-Oba1999aSolis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim
1999Makespan 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-Oba1999fSolis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim
1999A 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-Oba1999hKrysta, Piotr
Solis-Oba, Roberto
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Proceedings Article
Son1999Son, Jung-Bae1999Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
Spoehel2011Mütze, Torsten
Rast, Thomas
Spöhel, Reto
2011Coloring 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
Spoehel2011aGugelmann, Luca
Spöhel, Reto
2011On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
Spoehel2011bMütze, Torsten
Spöhel, Reto
2011On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
Electronic Proceedings Article
Spoehel2011cPanagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning
2011Explosive 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
Spoehel2011dMütze, Torsten
Spöhel, Reto
2011On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33
Electronic Journal Article
SpoehelBM2012Belfrage, Michael
Mütze, Torsten
Spöhel, Reto
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article
SpoehelK2012Krivelevich, Michael
Spöhel, Reto
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
SpoehelPST2013Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Journal Article
Srivastava96Srivastava, Satanand1996Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes
Thesis - Masters thesis
SRWLSM02Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
SSS12Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
SSS13Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
2013A 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_randDoerr, Benjamin2007Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Proceedings Article
STACS::KaufmannM1987Kaufmann, Michael
Mehlhorn, Kurt
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
Stee12van Stee, Rob2012Attachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
Journal Article
Stee12avan Stee, Rob2012Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
Journal Article
Stee12bvan Stee, Rob2012Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
Journal Article
Stephan2000Stephan, Anne2000Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
Stormer98Stormer, Henrik1998Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes
Thesis - Masters thesis
Sun2010Kao, Ming-Yang
Leung, Henry C. M.
Sun, He
Zhang, Yong
2010Deterministic 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
Sun2011Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Proceedings Article
Sun2011bChin, Francis Y. L.
Guo, Zeyu
Sun, He
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Journal Article
Sun2011cGuo, Zeyu
Sun, He
Zhu, Hong
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Journal Article
Sun2012aGiakkoupis, George
Sauerwald, Thomas
Sun, He
Woelfel, Philipp
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
Sun2012bKane, Daniel
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
Sun2012cSauerwald, Thomas
Sun, He
2012Tight 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
SurveyCycleBasesKavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K.
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
SviridenkoWiese2013Sviridenko, Maxim
Wiese, Andreas
2013Approximating 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-05Seidel, Raimund
Wolpert, Nicola
2005On 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-05Schömer, Elmar
Wolpert, Nicola
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
SWAT::DietzfelbingerMHR1988Dietzfelbinger, Martin
Mehlhorn, Kurt
Meyer auf der Heide, Friedhelm
Rohnert, H.
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
SymHyp2006Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
S:NEWDSC:2011Sagraloff, Michael2011When 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
TechReportGDF2006Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
Telikepalli2003aTelikepalli, Kavitha2003Efficient 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
Telikepalli2003bTelikepalli, Kavitha
Varadarajan, Kasturi
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Proceedings Article
Telikepalli2003cTelikepalli, Kavitha
Chandran, Sunil
Subramanian, C. R.
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
Proceedings Article
TF_CGTA1Bringmann, Karl
Friedrich, Tobias
2010Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Journal Article
TF_ECJ4Bringmann, Karl
Friedrich, Tobias
2010An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Journal Article
TF_RSA2Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
Thiel-Diss96Thiel, Christian1996Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes
Thesis - PhD thesis
ThielDiss04Thiel, Sven2004Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
Thesis - PhD thesis
ThielMasterThesis99Thiel, Sven1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Masters thesis
Thome2000Thome, Stefan2000Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes
Thesis - Masters thesis
Thorup/2000Thorup, Mikkel2000Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Journal Article
Traeff-Kessler96Keßler, Christoph W.
Träff, Jesper Larsson
1996A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195
Proceedings Article
Traeff-Zaroliagis96Träff, Jesper Larsson
Zaroliagis, Christos
1996A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
Traeff95Träff, Jesper Larsson1995An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532
Journal Article
Traeff96Träff, Jesper Larsson1996A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569
Journal Article
TraeffZaroliagis2000Träff, Jesper Larsson
Zaroliagis, Christos
2000A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124
Journal Article
Traff97:stringCzumaj, Artur
Ferragina, Paolo
Gasieniec, Leszek
Muthukrishnan, S.
Träff, Jesper Larsson
1997The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Proceedings Article
TSeidel97Seidel, Tillmann1997Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
Tsigas-et-al96Kirousis, Lefteris
Spirakis, Paul G.
Tsigas, Philippas
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
unbiasmatr2006Doerr, Benjamin
Klein, Christian
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
vanStee2008Epstein, Leah
van Stee, Rob
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
vanStee2008aEpstein, Leah
van Stee, Rob
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
vanStee2008bvan Stee, Rob2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
vanStee2008dvan Stee, Rob2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
vanStee2008eEpstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Journal Article
vanStee2008fKrumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
vanStee2008gEpstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
vanStee2008hPruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
vanStee2008ivan Stee, Rob2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
vanStee2008jEpstein, Leah
van Stee, Rob
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
vanStee2008kEpstein, Leah
van Stee, Rob
2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
vanStee2009aEpstein, Leah
van Stee, Rob
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Journal Article
vanStee2010van Stee, Rob2011Attachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
vanStee2013van Stee, Rob2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Journal Article
vanSteeTALG2011Epstein, Leah
van Stee, Rob
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
vanZuylenALG2011van Zuylen, Anke2011Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
Journal Article
vanZuylenCTW2011van Zuylen, Anke
Schalekamp, Frans
Williamson, David P.
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
vanZuylenORL2011van Zuylen, Anke2011An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
Journal Article
vanZuylenTCS2011van Zuylen, Anke2011Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Journal Article
vanZuylenWAOA2011van Zuylen, Anke2012Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
Proceedings Article
VAT2013Jurkiewicz, Tomasz
Mehlhorn, Kurt
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Proceedings Article
VerificationCertComp12Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2013A Framework for the Verification of Certifying ComputationsUnpublished/Draft
Vidali2009Vidali, Angelina2009The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Proceedings Article
Vidali2010Pountourakis, Emmanouil
Vidali, Angelina
2010A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Proceedings Article
VLM97Vingron, Martin
Lenhof, Hans-Peter
Mutzel, Petra
1997Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Part of a Book
Vocking2000Maggs, Bruce M.
Vöcking, Berthold
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
Voecking2000Karp, Richard
Schindelhauer, Christian
Shenker, Scott
Vöcking, Berthold
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
Voecking2001aRajaraman, Rajmohan
Richa, Andrea W.
Vöcking, Berthold
Vuppuluri, Gayathri
2001A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
Voecking2001bVöcking, Berthold2001Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539
Proceedings Article
Voecking2001cVöcking, Berthold2001Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10
Proceedings Article
Vöcking2003Krick, Christof
Meyer auf der Heide, Friedhelm
Räcke, Harald
Vöcking, Berthold
Westermann, Matthias
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
w-jccetansal-03Wolpert, Nicola2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesReport

Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)