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: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

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

#YearTitleType
2003Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
1
Hide details for Hoefer, Kesselheim [Kesselheim]Hoefer, Kesselheim [Kesselheim]
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
1
Hide details for Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking]Hoefer, Kesselheim, Vöcking [Kesselheim, Vöcking]
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
1
Hide details for Hoefer, Sauerwald [-]Hoefer, Sauerwald [-]
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2
Hide details for Hoefer, Skopalik [Skopalik]Hoefer, Skopalik [Skopalik]
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
1
Hide details for Hoefer, Wagner [Wagner, Chen, Immorlica]Hoefer, Wagner [Wagner, Chen, Immorlica]
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
1
Hide details for Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg]Hoefer, Wagner [Wagner, Fomin, Freivalds, Kwiatkowska, Peleg]
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
1
Hide details for Hoepman, Papatriantafilou, Tsigas [Hélary, Hoepman, Raynal]Hoepman, Papatriantafilou, Tsigas [Hélary, Hoepman, Raynal]
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1
Hide details for Hoffmann, Mehlhorn [-]Hoffmann, Mehlhorn [-]
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
3
Hide details for Hoffmann, Mehlhorn, Rosenstiehl, Tarjan [-]Hoffmann, Mehlhorn, Rosenstiehl, Tarjan [-]
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proceedings Article
1984Sorting Jordan sequences in linear timeReport
1
Hide details for Höhn, Jacobs, Megow [Höhn, Jacobs]Höhn, Jacobs, Megow [Höhn, Jacobs]
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
1
Hide details for Hong, Mehlhorn [-]Hong, Mehlhorn [-]
1982Cost tradeoffs in graph embeddings, with applicationsReport
2
Hide details for Hong, Mehlhorn, Rosenberg [-]Hong, Mehlhorn, Rosenberg [-]
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proceedings Article
1
Hide details for Hoogeveen, Skutella, Woeginger [Hoogeveen, Woeginger]Hoogeveen, Skutella, Woeginger [Hoogeveen, Woeginger]
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
1
Hide details for Horoba, Neumann [Horoba, Ryan, Keijzer]Horoba, Neumann [Horoba, Ryan, Keijzer]
2008Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
Proceedings Article
1
Hide details for Horoba, Neumann [Horoba]Horoba, Neumann [Horoba]
2009Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86
Proceedings Article
2
Hide details for Huang [-]Huang [-]
2010Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Journal Article
2010Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Proceedings Article
1
Hide details for Huang [, Fomin, Kaski]Huang [, Fomin, Kaski]
2012Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Proceedings Article
2
Hide details for Huang, Kavitha [Kavitha]Huang, Kavitha [Kavitha]
2011Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Proceedings Article
2011Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Proceedings Article
1
Hide details for Huang, Kavitha, Michael, Nasr [Kavitha, Michael, Nasr]Huang, Kavitha, Michael, Nasr [Kavitha, Michael, Nasr]
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Journal Article
1
Hide details for Huang, Kavitha, Michail, Nasre [Huang, Michail, Nasre]Huang, Kavitha, Michail, Nasre [Huang, Michail, Nasre]
2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
1
Hide details for Huber [-]Huber [-]
2010Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Huddleston, Mehlhorn [-]Huddleston, Mehlhorn [-]
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
Journal Article
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proceedings Article
1
Hide details for Humble [-]Humble [-]
1997Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hundack, Mutzel, Pouchkarev, Thome [Pouchkarev, Thome]Hundack, Mutzel, Pouchkarev, Thome [Pouchkarev, Thome]
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
1
Hide details for Hundack, Prömel, Steger []Hundack, Prömel, Steger []
1997Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
Part of a Book
3
Hide details for Hutchinson, Sanders, Vitter [Hutchinson, Vitter]Hutchinson, Sanders, Vitter [Hutchinson, Vitter]
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
Journal Article
2001Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
1
Hide details for Iacono, Ramezani, Soranzo, Altafani [Iacono, Soranzo, Altafani]Iacono, Ramezani, Soranzo, Altafani [Iacono, Soranzo, Altafani]
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
1
Hide details for Immich [-]Immich [-]
2001Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ingalalli [-]Ingalalli [-]
2011Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Irving, Telikepalli, Mehlhorn, Michail, Paluch [Irving, Telikepalli, Paluch]Irving, Telikepalli, Mehlhorn, Michail, Paluch [Irving, Telikepalli, Paluch]
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
Journal Article
1
Hide details for Issac [Bhattacharya, Jaiswal, Kumar, Xu, Du, Du]Issac [Bhattacharya, Jaiswal, Kumar, Xu, Du, Du]
2015Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
1
Hide details for Jain, Kötzing, Stephan [Jain, Stephan, Bshouty, Stoltz, Vayatis, Zeugmann]Jain, Kötzing, Stephan [Jain, Stephan, Bshouty, Stoltz, Vayatis, Zeugmann]
2012Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
Proceedings Article
1
Hide details for Janardan, Smid [Janardan]Janardan, Smid [Janardan]
1995On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Proceedings Article
1
Hide details for Jansen [Lucchesi, Moura]Jansen [Lucchesi, Moura]
1998A New Characterization for Parity Graphs and a Coloring Problem with Costs
In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260
Proceedings Article
1
Hide details for Jansen [Morvan, Meinel, Krob]Jansen [Morvan, Meinel, Krob]
1998The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297
Proceedings Article
1
Hide details for Jansen, Kratsch, Marx, Schlotter [Jansen, Marx, Schlotter, Kaplan]Jansen, Kratsch, Marx, Schlotter [Jansen, Marx, Schlotter, Kaplan]
2010Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272
Proceedings Article
1
Hide details for Jansen, Neumann [Jansen]Jansen, Neumann [Jansen]
2010Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
Journal Article
1
Hide details for Jansen, Porkolab [Jansen]Jansen, Porkolab [Jansen]
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
Journal Article
1
Hide details for Jansen, Solis-Oba, Sviridenko [Jansen, Sviridenko, Pardalos]Jansen, Solis-Oba, Sviridenko [Jansen, Sviridenko, Pardalos]
2000Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
Part of a Book
1
Hide details for Jez [-]Jez [-]
2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
1
Hide details for Jez [Beal, Carton]Jez [Beal, Carton]
2013Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Proceedings Article
1
Hide details for Jez [Esparza, Fraigniaud, Husfeldt, Koutsoupia]Jez [Esparza, Fraigniaud, Husfeldt, Koutsoupia]
2014Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Proceedings Article
1
Hide details for Jez [Fischer, Sanders]Jez [Fischer, Sanders]
2013Attachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
1
Hide details for Jez [Fomin, Freivalds, Kwiatkowska, Peleg]Jez [Fomin, Freivalds, Kwiatkowska, Peleg]
2013Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Proceedings Article
1
Hide details for Jez [Kulikov, Kuznetsov, Pevzner]Jez [Kulikov, Kuznetsov, Pevzner]
2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings Article
1
Hide details for Jez [Portier, Wilke]Jez [Portier, Wilke]
2013Attachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Proceedings Article
1
Hide details for Jez, Lohrey [Lohrey, Mayr, Portier]Jez, Lohrey [Lohrey, Mayr, Portier]
2014Attachment IconApproximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
Proceedings Article
1
Hide details for Jez, Maletti [Maletti]Jez, Maletti [Maletti]
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Journal Article
1
Hide details for Jez, Okhotin [Okhotin, Beal, Carton]Jez, Okhotin [Okhotin, Beal, Carton]
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Proceedings Article
1
Hide details for Jez, Okhotin [Okhotin]Jez, Okhotin [Okhotin]
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
2
Hide details for Johannsen [-]Johannsen [-]
2010Attachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
Thesis - PhD thesis
2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Thesis - Masters thesis
1
Hide details for Johannsen, Lengler [Kurur, Pelikan, Branke]Johannsen, Lengler [Kurur, Pelikan, Branke]
2010Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
Proceedings Article
1
Hide details for Johannsen, Panagiotou [Charikar]Johannsen, Panagiotou [Charikar]
2010Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Proceedings Article
1
Hide details for Johannsen, Razgon, Wahlström [Razgon, Kullmann]Johannsen, Razgon, Wahlström [Razgon, Kullmann]
2009Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Proceedings Article
1
Hide details for Jung [-]Jung [-]
1996Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Jünger, Lee, Mutzel, Odenthal [Jünger, Odenthal]Jünger, Lee, Mutzel, Odenthal [Jünger, Odenthal]
1997A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24
Proceedings Article
1
Hide details for Jünger, Leipert, Mutzel [Juenger, Leipert]Jünger, Leipert, Mutzel [Juenger, Leipert]
1998A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612
Journal Article
1
Hide details for Jünger, Leipert, Mutzel [Jünger, Leipert, Whitesides]Jünger, Leipert, Mutzel [Jünger, Leipert, Whitesides]
1998Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
Proceedings Article
1
Hide details for Jünger, Leipert, Mutzel [Leipert, Jünger]Jünger, Leipert, Mutzel [Leipert, Jünger]
1997Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
Proceedings Article
1
Hide details for Jünger, Mutzel [Brandenburg, Jünger]Jünger, Mutzel [Brandenburg, Jünger]
1996Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), -
Proceedings Article
2
Hide details for Jünger, Mutzel [Jünger]Jünger, Mutzel [Jünger]
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Journal Article
1996Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
Journal Article
1
Hide details for Jünger, Mutzel [Tamassia, Tollis, Jünger]Jünger, Mutzel [Tamassia, Tollis, Jünger]
1995The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130
Proceedings Article
1
Hide details for Jünger, Mutzel, Odenthal, Scharbrodt [Jünger, Odenthal, Scharbrodt]Jünger, Mutzel, Odenthal, Scharbrodt [Jünger, Odenthal, Scharbrodt]
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
1
Hide details for Jung, Lenhof, Müller, Rüb [Jung, Sloot, Bubak, Hoekstra, Hertzberger]Jung, Lenhof, Müller, Rüb [Jung, Sloot, Bubak, Hoekstra, Hertzberger]
1999Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
3
Hide details for Jung, Lenhof, Müller, Rüb [Jung]Jung, Lenhof, Müller, Rüb [Jung]
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Journal Article
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
1
Hide details for Jung, Mehlhorn [-]Jung, Mehlhorn [-]
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesReport
1
Hide details for Jung, Mehlhorn []Jung, Mehlhorn []
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Journal Article
2
Hide details for Jurkiewicz [-]Jurkiewicz [-]
2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - PhD thesis
2009Cycle Bases in Graphs
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Jurkiewicz, Danilewski [-]Jurkiewicz, Danilewski [-]
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
1
Hide details for Jurkiewicz, Mehlhorn [-]Jurkiewicz, Mehlhorn [-]
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Proceedings Article
1
Hide details for Juurlink, Mutzel [Juurlink]Juurlink, Mutzel [Juurlink]
1995?
In: Conference on High-Performance Computing, 125-130
Proceedings Article
1
Hide details for Juurlink, Sibeyn [Juurlink]Juurlink, Sibeyn [Juurlink]
1995Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Proceedings Article
1
Hide details for Juurlink, Sibeyn, Rao [Bougé, Fraigniaud, Juurlink, Mignotte, Rao, Robert]Juurlink, Sibeyn, Rao [Bougé, Fraigniaud, Juurlink, Mignotte, Rao, Robert]
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
1
Hide details for Kagaris, Pantziou, Tragoudas, Zaroliagis [Akl, Dehne, Kagaris, Pantziou, Sack, Santoro, Tragoudas]Kagaris, Pantziou, Tragoudas, Zaroliagis [Akl, Dehne, Kagaris, Pantziou, Sack, Santoro, Tragoudas]
1995On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1
Hide details for Kagaris, Pantziou, Tragoudas, Zaroliagis [El-Rewini, Kagaris, Pantziou, Shriver, Tragoudas]Kagaris, Pantziou, Tragoudas, Zaroliagis [El-Rewini, Kagaris, Pantziou, Shriver, Tragoudas]
1995Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Proceedings Article
1
Hide details for Kagaris, Pantziou, Tragoudas, Zaroliagis [Kagaris, Pantziou, Tragoudas]Kagaris, Pantziou, Tragoudas, Zaroliagis [Kagaris, Pantziou, Tragoudas]
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
Journal Article
1
Hide details for Kaligosi [-]Kaligosi [-]
2003Length bounded network flows
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kaligosi, Mehlhorn, Munro, Sanders [Munro, Sanders]Kaligosi, Mehlhorn, Munro, Sanders [Munro, Sanders]
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
Proceedings Article
1
Hide details for Kaligosi, Sanders [Sanders, Azar, Erlebach]Kaligosi, Sanders [Sanders, Azar, Erlebach]
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
Proceedings Article
1
Hide details for Kamran Azam [-]Kamran Azam [-]
2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kane, Mehlhorn, Sauerwald, Sun [Kane, Czumaj, Pitts, Wattenhofer]Kane, Mehlhorn, Sauerwald, Sun [Kane, Czumaj, Pitts, Wattenhofer]
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
1
Hide details for Kao, Leung, Sun, Zhang [Kao, Leung, Zhang, Kratchovil, Li, Fiala, Kolman]Kao, Leung, Sun, Zhang [Kao, Leung, Zhang, Kratchovil, Li, Fiala, Kolman]
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
1
Hide details for Kapoor [-]Kapoor [-]
1996On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Proceedings Article
1
Hide details for Kapoor, Smid [-]Kapoor, Smid [-]
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Journal Article
1
Hide details for Kappel [-]Kappel [-]
1998Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kärkkäinen [Penttonen, Meineche Schmidt]Kärkkäinen [Penttonen, Meineche Schmidt]
2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
1
Hide details for Kärkkäinen, Rao [Sibeyn, Rao]Kärkkäinen, Rao [Sibeyn, Rao]
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
1
Hide details for Kärkkäinen, Sanders [Baeten, Lenstra, Parrow, Woeginger]Kärkkäinen, Sanders [Baeten, Lenstra, Parrow, Woeginger]
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
Proceedings Article
1
Hide details for Karp, Schindelhauer, Shenker, Vöcking [Karp, Schindelhauer, Shenker]Karp, Schindelhauer, Shenker, Vöcking [Karp, Schindelhauer, Shenker]
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
2
Hide details for Karrenbauer [-]Karrenbauer [-]
2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - PhD thesis
2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Thesis - other
1
Hide details for Kasan [-]Kasan [-]
1995Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kasprzik, Kötzing [Kasprzik, Martin-Vide, Fernau, Dediu]Kasprzik, Kötzing [Kasprzik, Martin-Vide, Fernau, Dediu]
2010String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
Proceedings Article
1
Hide details for Katajainen, Träff [Bongiovanni, Bovet, Di Battista, Katajainen]Katajainen, Träff [Bongiovanni, Bovet, Di Battista, Katajainen]
1997A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228
Proceedings Article
3
Hide details for Katriel [-]Katriel [-]
2004Constraints and Changes
Universität des Saarlandes
Thesis - PhD thesis
2004Attachment IconOn Algorithms for Online Topological Ordering and SortingReport
2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
1
Hide details for Katriel [Régin, Rueher]Katriel [Régin, Rueher]
2004Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
Proceedings Article
1
Hide details for Katriel, Bodlaender [Bodlaender]Katriel, Bodlaender [Bodlaender]
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
Proceedings Article
1
Hide details for Katriel, Meyer [-]Katriel, Meyer [-]
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
Part of a Book
1
Hide details for Katriel, Michel, Van Hentenryck [Michel, Van Hentenryck]Katriel, Michel, Van Hentenryck [Michel, Van Hentenryck]
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
Journal Article
1
Hide details for Katriel, Sanders, Träff [Träff, Di Battista, Zwick]Katriel, Sanders, Träff [Träff, Di Battista, Zwick]
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
Proceedings Article
1
Hide details for Katriel, Thiel [-]Katriel, Thiel [-]
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
Journal Article
1
Hide details for Katriel, Thiel [Rossi]Katriel, Thiel [Rossi]
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
7
Hide details for Kaufmann, Mehlhorn [-]Kaufmann, Mehlhorn [-]
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Journal Article
1989Routing Problems in Grid GraphsReport
1989Routing problems in grid graphsReport
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid GraphsReport
1986On Local Routing of Two-Terminal NetsReport
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Journal Article
1984Attachment IconRouting through a generalized switchboxReport
1
Hide details for Kaufmann, Mehlhorn [Brandenburg, Vidal-Naquet, Wirsing]Kaufmann, Mehlhorn [Brandenburg, Vidal-Naquet, Wirsing]
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
1
Hide details for Kaufmann, Mehlhorn [Kaufmann, Mehlhorn]Kaufmann, Mehlhorn [Kaufmann, Mehlhorn]
1984Attachment IconLocal routing of two-terminal nets is easyReport
2
Hide details for Kaufmann, Mehlhorn []Kaufmann, Mehlhorn []
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Journal Article
1990Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
Part of a Book
3
Hide details for Kaufmann, Meyer, Sibeyn [Kaufmann]Kaufmann, Meyer, Sibeyn [Kaufmann]
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
1
Hide details for Kaufmann, Raman, Sibeyn [Kaufmann, Raman]Kaufmann, Raman, Sibeyn [Kaufmann, Raman]
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
1
Hide details for Kaufmann, Schröder, Sibeyn [Kaufmann, Schröder]Kaufmann, Schröder, Sibeyn [Kaufmann, Schröder]
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
1
Hide details for Kaufmann, Sibeyn [Hájek, Kaufmann, Wiedermann]Kaufmann, Sibeyn [Hájek, Kaufmann, Wiedermann]
1995Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
1
Hide details for Kaufmann, Sibeyn [Kaufmann]Kaufmann, Sibeyn [Kaufmann]
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1
Hide details for Kaufmann, Sibeyn, Suel [Kaufmann, Spirakis, Suel]Kaufmann, Sibeyn, Suel [Kaufmann, Spirakis, Suel]
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
1
Hide details for Kavitha [-]Kavitha [-]
2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Proceedings Article
1
Hide details for Kavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, Zweig [Kavitha, Liebchen, Rizzi, Ueckerdt, Zweig]Kavitha, Liebchen, Mehlhorn, Michail, Rizzi, Ueckerdt, Zweig [Kavitha, Liebchen, Rizzi, Ueckerdt, Zweig]
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
1
Hide details for Kavitha, Mehlhorn [-]Kavitha, Mehlhorn [-]
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
1
Hide details for Kavitha, Mehlhorn [Diekert, Durand]Kavitha, Mehlhorn [Diekert, Durand]
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
1
Hide details for Kavitha, Mehlhorn, Michail [Kavitha, Thomas, Weil]Kavitha, Mehlhorn, Michail [Kavitha, Thomas, Weil]
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
1
Hide details for Kavitha, Mehlhorn, Michail [Kavitha]Kavitha, Mehlhorn, Michail [Kavitha]
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Journal Article
1
Hide details for Kavitha, Mehlhorn, Michail, Paluch [Kavitha, Paluch]Kavitha, Mehlhorn, Michail, Paluch [Kavitha, Paluch]
2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
Journal Article
1
Hide details for Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diaz, Karhumäki, Lepistö, Sannella]Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diaz, Karhumäki, Lepistö, Sannella]
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
1
Hide details for Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diekert, Habib]Kavitha, Mehlhorn, Michail, Paluch [Paluch, Diekert, Habib]
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
1
Hide details for Kavitha, Mestre [Kavitha, Dong, Du, Ibarra]Kavitha, Mestre [Kavitha, Dong, Du, Ibarra]
2009Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Proceedings Article
1
Hide details for Kavitha, Mestre [Kavitha]Kavitha, Mestre [Kavitha]
2010Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
Electronic Journal Article
1
Hide details for Kavitha, Mestre [Mestre]Kavitha, Mestre [Mestre]
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Journal Article
1
Hide details for Kavitha, Mestre, Nasre [Kavitha, Nasre, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas]Kavitha, Mestre, Nasre [Kavitha, Nasre, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas]
2009Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
Proceedings Article
1
Hide details for Kavitha, Mestre, Nasre [Kavitha, Nasre]Kavitha, Mestre, Nasre [Kavitha, Nasre]
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Journal Article
1
Hide details for Kavitha, Nasre [Nasre]Kavitha, Nasre [Nasre]
2008Optimal Popular MatchingsMiscellaneous
1
Hide details for Kavvadias, Pantziou, Spirakis, Zaroliagis [Kavvadias, Pantziou, Spirakis]Kavvadias, Pantziou, Spirakis, Zaroliagis [Kavvadias, Pantziou, Spirakis]
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
2
Hide details for Kayal, Saha [Kayal]Kayal, Saha [Kayal]
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
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
1
Hide details for Kececioglu, Lenhof, Mehlhorn, Mutzel, Reinert, Vingron [Kececioglu, Vingron]Kececioglu, Lenhof, Mehlhorn, Mutzel, Reinert, Vingron [Kececioglu, Vingron]
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
1
Hide details for Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, NeKeizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.) [Keizer, Antoniol, Congdon, Deb, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener]
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Kelsen [-]Kelsen [-]
1996Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Proceedings Article
1
Hide details for Kelsen, Mahajan, Ramesh [Mahajan, Ramesh]Kelsen, Mahajan, Ramesh [Mahajan, Ramesh]
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Proceedings Article
4
Hide details for Kerber [-]Kerber [-]
2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Journal Article
2009Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Thesis - PhD thesis
2008Attachment IconOn filter methods in CGAL's 2D curved kernelReport
2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kerber [Gerdt, Mayr, Vorozhtsov]Kerber [Gerdt, Mayr, Vorozhtsov]
2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
1
Hide details for Kerber, Sagraloff [Kerber, Leykin]Kerber, Sagraloff [Kerber, Leykin]
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Proceedings Article
2
Hide details for Kerber, Sagraloff [Kerber]Kerber, Sagraloff [Kerber]
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Journal Article
1
Hide details for Kerzmann [-]Kerzmann [-]
2000Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kesselman, Guez, Rosen [Guez, Rosen]Kesselman, Guez, Rosen [Guez, Rosen]
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
1
Hide details for Kesselman, Kogan [Kogan]Kesselman, Kogan [Kogan]
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
Proceedings Article
1
Hide details for Kesselman, Kowalski [-]Kesselman, Kowalski [-]
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
1
Hide details for Kesselman, Kowalski, Segal [Segal]Kesselman, Kowalski, Segal [Segal]
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
1
Hide details for Kesselman, Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko [Lotker, Mansour, Patt-Shamir, Schieber, SvirideKesselman, Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko [Lotker, Mansour, Patt-Shamir, Schieber, Sviridenko]
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
Journal Article
1
Hide details for Kesselman, Mansour [Mansour]Kesselman, Mansour [Mansour]
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
Journal Article
1
Hide details for Kessler [-]Kessler [-]
2002Robust Computation of Visibility Maps
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Keßler, Träff [Keßler, Kessler]Keßler, Träff [Keßler, Kessler]
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
1
Hide details for Keßler, Träff [Keßler, Keßler]Keßler, Träff [Keßler, Keßler]
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
1
Hide details for Kettner [-]Kettner [-]
1998Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kettner [Lumsdaine, Schupp]Kettner [Lumsdaine, Schupp]
2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
Electronic Proceedings Article
1
Hide details for Kettner [Musser, Siek]Kettner [Musser, Siek]
2006Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Proceedings Article
1
Hide details for Kettner, Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi [Kirkpatrick, Mantler, Snoeyink, Speckmann, TakeuKettner, Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi [Kirkpatrick, Mantler, Snoeyink, Speckmann, Takeuchi]
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
Journal Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Albers, Radzik]Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Albers, Radzik]
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
Proceedings Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Gavrilova, Gervasi, Kumar, Tan, Taniar, Laganà, MunKettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap, Gavrilova, Gervasi, Kumar, Tan, Taniar, Laganà, Mun, Choo]
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
Proceedings Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap]Kettner, Mehlhorn, Pion, Schirra, Yap [Pion, Schirra, Yap]
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
Journal Article
1
Hide details for Kettner, Mehlhorn, Pion, Schirra, Yap [Schirra, Yap]Kettner, Mehlhorn, Pion, Schirra, Yap [Schirra, Yap]
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
1
Hide details for Kettner, Näher [Näher, Goodman, O'Rourke]Kettner, Näher [Näher, Goodman, O'Rourke]
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
1
Hide details for Kettner, Rossignac, Snoeyink [Rossignac, Snoeyink]Kettner, Rossignac, Snoeyink [Rossignac, Snoeyink]
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
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich, Deng, Du]Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich, Deng, Du]
2005Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
Proceedings Article
2
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich]Khachiyan, Boros, Borys, Elbassioni, Gurvich [Khachiyan, Boros, Borys, Gurvich]
2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Journal Article
2006Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765
Proceedings Article
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino, Azar, ErlebachKhachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino, Azar, Erlebach]
2006Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455
Proceedings Article
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino]Khachiyan, Boros, Borys, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Borys, Gurvich, Makino]
2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Journal Article
1
Hide details for Khachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, Zhao [Khachiyan, Boros, Borys, Gurvich, Rudolf, Zhao]Khachiyan, Boros, Borys, Elbassioni, Gurvich, Rudolf, Zhao [Khachiyan, Boros, Borys, Gurvich, Rudolf, Zhao]
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
1
Hide details for Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Jedrzejowicz, Szepietowski]Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Jedrzejowicz, Szepietowski]
2005Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567
Proceedings Article
1
Hide details for Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Wang]Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich, Wang]
2005A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
Proceedings Article
4
Hide details for Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich]Khachiyan, Boros, Elbassioni, Gurvich [Khachiyan, Boros, Gurvich]
2008Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034
Journal Article
2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Journal Article
2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article
2007On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150
Journal Article
3
Hide details for Khachiyan, Boros, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Gurvich, Makino]Khachiyan, Boros, Elbassioni, Gurvich, Makino [Khachiyan, Boros, Gurvich, Makino]
2007Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376
Journal Article
2007Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149
Journal Article
2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
Journal Article
1
Hide details for Khachiyan, Porkolab [Khachiyan]Khachiyan, Porkolab [Khachiyan]
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Journal Article
1
Hide details for Khosla [Bodlaender, Italiano]Khosla [Bodlaender, Italiano]
2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
1
Hide details for Khuller, Malekian, Mestre [Khuller, Malekian, Arge, Hoffmann, Welzl]Khuller, Malekian, Mestre [Khuller, Malekian, Arge, Hoffmann, Welzl]
2007To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
Proceedings Article
1
Hide details for Khuller, Mestre [Khuller]Khuller, Mestre [Khuller]
2008An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610
Proceedings Article
1
Hide details for Kim, Paul, Philip [Kim, Paul, Fomin, Kaski]Kim, Paul, Philip [Kim, Paul, Fomin, Kaski]
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
1
Hide details for Kirousis, Spirakis, Tsigas [Kirousis, Spirakis]Kirousis, Spirakis, Tsigas [Kirousis, Spirakis]
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
1
Hide details for Klär [-]Klär [-]
1994Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Klau [-]Klau [-]
2002A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes
Thesis - PhD thesis
1998Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenMiscellaneous
1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Klauk [-]Klauk [-]
2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Klau, Klein, Mutzel [Marks, Klau, Mutzel]Klau, Klein, Mutzel [Marks, Klau, Mutzel]
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
Proceedings Article
1
Hide details for Klau, Mutzel [Cornuéjols, Burkard, Woeginger]Klau, Mutzel [Cornuéjols, Burkard, Woeginger]
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
1
Hide details for Klau, Mutzel [Du, Eades, Estivill-Castro, Lin, Sharma]Klau, Mutzel [Du, Eades, Estivill-Castro, Lin, Sharma]
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
1
Hide details for Klau, Mutzel [Jäger, Krebs]Klau, Mutzel [Jäger, Krebs]
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
1
Hide details for Klau, Mutzel [Kratochvíl]Klau, Mutzel [Kratochvíl]
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Proceedings Article
3
Hide details for Klein [-]Klein [-]
2004Attachment IconA Fast Root Checking AlgorithmReport
2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
Thesis - Masters thesis
2000Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Klein, Kutz [Klein, Kaufmann, Wagner]Klein, Kutz [Klein, Kaufmann, Wagner]
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Proceedings Article
1
Hide details for Klein, Kutz [Klein]Klein, Kutz [Klein]
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
1
Hide details for Klein, Mehlhorn, Meiser [Klein, Meiser]Klein, Mehlhorn, Meiser [Klein, Meiser]
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Report
2
Hide details for Klein, Mehlhorn, Meiser [, ]Klein, Mehlhorn, Meiser [, ]
1992Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Part of a Book
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
Proceedings Article
1
Hide details for Klein, Mehlhorn, Meiser []Klein, Mehlhorn, Meiser []
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Journal Article
1
Hide details for Knauer, Schlipf, Schmidt, Tiwary [Knauer, Schlipf, Tiwary]Knauer, Schlipf, Schmidt, Tiwary [Knauer, Schlipf, Tiwary]
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
2
Hide details for Kobel [-]Kobel [-]
2011Certified numerical root finding
Universität des Saarlandes
Thesis - Masters thesis
2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Kobel, Sagraloff [-]Kobel, Sagraloff [-]
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
2
Hide details for Kohlbacher, Lenhof [-]Kohlbacher, Lenhof [-]
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
Journal Article
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Proceedings Article
1
Hide details for Koldehofe [-]Koldehofe [-]
1999Animation and Analysis of Distributed Algorithms
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Koller, Mehlhorn, Niehren [Koller]Koller, Mehlhorn, Niehren [Koller]
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
1
Hide details for Kollias [-]Kollias [-]
2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Electronic Journal Article
1
Hide details for Könemann [-]Könemann [-]
1997Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Konidaris, Mehlhorn, Shell []Konidaris, Mehlhorn, Shell []
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsUnpublished/Draft
1
Hide details for Kontogiannis [-]Kontogiannis [-]
2002Lower Bounds & Competitive Algorithms for Online Scheduling of Unit-Size Tasks to Related Machines
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 124-133
Proceedings Article
1
Hide details for Kontogiannis, Pantziou, Spirakis, Yung [Pantziou, Spirakis, Yung]Kontogiannis, Pantziou, Spirakis, Yung [Pantziou, Spirakis, Yung]
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
1
Hide details for Konwar, Kowalski, Shvartsman [Konwar, Shvartsman]Konwar, Kowalski, Shvartsman [Konwar, Shvartsman]
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
Proceedings Article
1
Hide details for Kötzing [Kivinen, Szepesvári, Ukkonen, Zeugmann]Kötzing [Kivinen, Szepesvári, Ukkonen, Zeugmann]
2011Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Proceedings Article
1
Hide details for Kötzing, Lehre, Neumann, Oliveto [Lehre, Oliveto, Pelikan, Branke]Kötzing, Lehre, Neumann, Oliveto [Lehre, Oliveto, Pelikan, Branke]
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
1
Hide details for Kötzing, Molter [Molter, Coello Coello, Cutello, Deb, Forrest, Nicosia, Pavone]Kötzing, Molter [Molter, Coello Coello, Cutello, Deb, Forrest, Nicosia, Pavone]
2012ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122
Proceedings Article
1
Hide details for Kötzing, Neumann, Röglin, Witt [Neumann, Röglin, Witt]Kötzing, Neumann, Röglin, Witt [Neumann, Röglin, Witt]
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
1
Hide details for Kötzing, Neumann, Röglin, Witt [Röglin, Witt, Dorigo, Birattari, Di Caro, Doursat, Engelbrecht, Floreano, GambKötzing, Neumann, Röglin, Witt [Röglin, Witt, Dorigo, Birattari, Di Caro, Doursat, Engelbrecht, Floreano, Gambardella, Groß, Sahin, Sayama, Stützle]
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
1
Hide details for Kötzing, Neumann, Spöhel [Neumann, Krasnogor, Lanzi]Kötzing, Neumann, Spöhel [Neumann, Krasnogor, Lanzi]
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
Proceedings Article
1
Hide details for Kötzing, Neumann, Sudholt, Wagner [Neumann, Sudholt, Wagner, Beyer, Langdon]Kötzing, Neumann, Sudholt, Wagner [Neumann, Sudholt, Wagner, Beyer, Langdon]
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
1
Hide details for Kötzing, Sudholt, Theile [Sudholt, Theile, Krasnogor, Lanzi]Kötzing, Sudholt, Theile [Sudholt, Theile, Krasnogor, Lanzi]
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
Proceedings Article
1
Hide details for Kötzing, Sutton, Neumann, O'Reilly [Sutton, Neumann, O'Reilly, Soule, Moore]Kötzing, Sutton, Neumann, O'Reilly [Sutton, Neumann, O'Reilly, Soule, Moore]
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
1
Hide details for Kovács [-]Kovács [-]
2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Kovács [Brodal, Leonardi]Kovács [Brodal, Leonardi]
2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Proceedings Article
1
Hide details for Kovács [Caires, Italiano, Monteiro, Palamidessi, Yung]Kovács [Caires, Italiano, Monteiro, Palamidessi, Yung]
2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Proceedings Article
1
Hide details for Kovács [Calamoneri, Finocchi, Italiano]Kovács [Calamoneri, Finocchi, Italiano]
2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Proceedings Article
1
Hide details for Kovács [Diekert, Habib]Kovács [Diekert, Habib]
2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Proceedings Article
2
Hide details for Kowalik [-]Kowalik [-]
2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Journal Article
2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
Journal Article
1
Hide details for Kowalik [Asano]Kowalik [Asano]
2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
Proceedings Article
1
Hide details for Kowalik [Fomin]Kowalik [Fomin]
2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Proceedings Article
1
Hide details for Kowalski, Musial, Shvartsman [Musial, Shvartsman]Kowalski, Musial, Shvartsman [Musial, Shvartsman]
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
Proceedings Article
1
Hide details for Kowalski, Pelc [Pelc, Fleischer, Trippen]Kowalski, Pelc [Pelc, Fleischer, Trippen]
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
Proceedings Article
1
Hide details for Kowalski, Pelc [Pelc, Jansen, Khanna, Rolim, Ron]Kowalski, Pelc [Pelc, Jansen, Khanna, Rolim, Ron]
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
3
Hide details for Kowalski, Pelc [Pelc]Kowalski, Pelc [Pelc]
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
Journal Article
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Journal Article
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
1
Hide details for Kowalski, Shvartsman [Shvartsman]Kowalski, Shvartsman [Shvartsman]
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
2
Hide details for Krandick, Mehlhorn [Krandick]Krandick, Mehlhorn [Krandick]
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
2004New Bounds for the Descartes MethodReport
1
Hide details for Kratsch [-]Kratsch [-]
2010Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Kratsch [Albers, Marion]Kratsch [Albers, Marion]
2009Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612
Electronic Proceedings Article
1
Hide details for Kratsch, Lehre, Neumann, Oliveto [Lehre, Neumann, Oliveto, Schaefer, Cotta, Kolodziej, Rudolph]Kratsch, Lehre, Neumann, Oliveto [Lehre, Neumann, Oliveto, Schaefer, Cotta, Kolodziej, Rudolph]
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
1
Hide details for Kratsch, Marx, Wahlström [Marx, Hlinený, Kucera]Kratsch, Marx, Wahlström [Marx, Hlinený, Kucera]
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
1
Hide details for Kratsch, McConnell, Mehlhorn, Spinrad [Kratsch, McConnell, Spinrad]Kratsch, McConnell, Mehlhorn, Spinrad [Kratsch, McConnell, Spinrad]
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
1
Hide details for Kratsch, McConnell, Mehlhorn, Spinrad []Kratsch, McConnell, Mehlhorn, Spinrad []
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
1
Hide details for Kratsch, Neumann [Raidl, Rothlauf]Kratsch, Neumann [Raidl, Rothlauf]
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
1
Hide details for Kratsch, Pilipczuk, Pilipczuk, Wahlström [Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer]Kratsch, Pilipczuk, Pilipczuk, Wahlström [Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer]
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
1
Hide details for Kratsch, Schweitzer [Kaplan]Kratsch, Schweitzer [Kaplan]
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
1
Hide details for Kratsch, Wahlström [Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]Kratsch, Wahlström [Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Proceedings Article
1
Hide details for Kratsch, Wahlström [Chen, Fomin]Kratsch, Wahlström [Chen, Fomin]
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
1
Hide details for Kratsch, Wahlström [Kratsch, Rabani]Kratsch, Wahlström [Kratsch, Rabani]
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
1
Hide details for Kratsch, Wahlström [Kratsch, Roughgarden]Kratsch, Wahlström [Kratsch, Roughgarden]
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
1
Hide details for Krick, Meyer auf der Heide, Räcke, Vöcking, Westermann [Krick, Meyer auf der Heide, Räcke, Westermann]Krick, Meyer auf der Heide, Räcke, Vöcking, Westermann [Krick, Meyer auf der Heide, Räcke, Westermann]
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Journal Article
1
Hide details for Krithivasan, Rema, Schirra, Vijaykumar [Fiala, Kranakis, Krithivasan, Rema, Sack, Vijaykumar]Krithivasan, Rema, Schirra, Vijaykumar [Fiala, Kranakis, Krithivasan, Rema, Sack, Vijaykumar]
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
1
Hide details for Krivelevich, Spöhel [Krivelevich]Krivelevich, Spöhel [Krivelevich]
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
1
Hide details for Kroeske, Ghandar, Michalewicz, Neumann [Kroeske, Ghandar, Michalewicz, Rudolph, Jansen, Lucas, Poloni, Beume]Kroeske, Ghandar, Michalewicz, Neumann [Kroeske, Ghandar, Michalewicz, Rudolph, Jansen, Lucas, Poloni, Beume]
2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
Proceedings Article
1
Hide details for Krohmer [-]Krohmer [-]
2012Finding cliques in scale-free networks
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Krumke, Schwahn, van Stee, Westphal [Krumke, Schwahn, Westphal]Krumke, Schwahn, van Stee, Westphal [Krumke, Schwahn, Westphal]
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
1
Hide details for Krumke, van Stee, Westphal [Krumke, Westphal, Ravi, Shukla]Krumke, van Stee, Westphal [Krumke, Westphal, Ravi, Shukla]
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
2
Hide details for Krysta [-]Krysta [-]
2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Journal Article
2001Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Krysta, Kumar [Ferreira, Reichel]Krysta, Kumar [Ferreira, Reichel]
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
1
Hide details for Krysta, Lorys [Lorys, Nesetril, Lorys]Krysta, Lorys [Lorys, Nesetril, Lorys]
1999Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
Proceedings Article
1
Hide details for Krysta, Pacholski [Pacholski]Krysta, Pacholski [Pacholski]
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Journal Article
1
Hide details for Krysta, Sanders, Vöcking [Rovan, Vojtáš]Krysta, Sanders, Vöcking [Rovan, Vojtáš]
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
1
Hide details for Krysta, Solis-Oba [-]Krysta, Solis-Oba [-]
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Journal Article
1
Hide details for Krysta, Solis-Oba [Asano, Imai, Lee, Nakano, Tokuyama]Krysta, Solis-Oba [Asano, Imai, Lee, Nakano, Tokuyama]
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Proceedings Article
1
Hide details for Ksinsik [-]Ksinsik [-]
1996Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kucera, Mehlhorn, Preis, Schwarzenecker []Kucera, Mehlhorn, Preis, Schwarzenecker []
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
1
Hide details for Kuhn, Panagiotou, Spencer, Steger [Kuhn, Spencer, Steger, Charikar]Kuhn, Panagiotou, Spencer, Steger [Kuhn, Spencer, Steger, Charikar]
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
1
Hide details for Kumar [Ramesh]Kumar [Ramesh]
2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Journal Article
1
Hide details for Kumar, Arya, Ramesh [Arya, Ramesh, Montanari, Rolim, Welzl]Kumar, Arya, Ramesh [Arya, Ramesh, Montanari, Rolim, Welzl]
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Proceedings Article
2
Hide details for Kumar, Ramesh [Ramesh]Kumar, Ramesh [Ramesh]
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
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
1
Hide details for Kursawe [-]Kursawe [-]
1998Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kutz [-]Kutz [-]
2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
1
Hide details for Kutz [Amenta, Cheong]Kutz [Amenta, Cheong]
2006Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437
Proceedings Article
1
Hide details for Kutz [Felsner]Kutz [Felsner]
2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Proceedings Article
1
Hide details for Kutz, Elbassioni, Katriel, Mahajan [Kutz, Katriel, Mahajan]Kutz, Elbassioni, Katriel, Mahajan [Kutz, Katriel, Mahajan]
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Journal Article
1
Hide details for Kutz, Pór [Pór, Wang]Kutz, Pór [Pór, Wang]
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Proceedings Article
1
Hide details for Kutz, Schweitzer [-]Kutz, Schweitzer [-]
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Proceedings Article
1
Hide details for Kwappik [-]Kwappik [-]
1998Exact Linear Programming
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kwek, Mehlhorn [Kwek]Kwek, Mehlhorn [Kwek]
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
Journal Article
2
Hide details for Lambert [-]Lambert [-]
2001Ein Parametric Search Toolkit
Universität des Saarlandes
Thesis - Masters thesis
2000Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Lambert, Sibeyn [Zheng]Lambert, Sibeyn [Zheng]
1999Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460
Proceedings Article
1
Hide details for Lang [-]Lang [-]
1994Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Larsson, Gidenstam, Ha, Papatriantafilou, Tsigas [Larsson, Ha, Papatriantafilou, Tsigas]Larsson, Gidenstam, Ha, Papatriantafilou, Tsigas [Larsson, Ha, Papatriantafilou, Tsigas]
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
1
Hide details for Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.) []Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.) []
2005Cache-Oblivious and Cache-Aware AlgorithmsReport
1
Hide details for Lauer [-]Lauer [-]
1998Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Laura, Leonardi, Millozzi, Meyer, Sibeyn [Laura, Leonardi, Millozzi, Sibeyn, Di Battista, Zwick]Laura, Leonardi, Millozzi, Meyer, Sibeyn [Laura, Leonardi, Millozzi, Sibeyn, Di Battista, Zwick]
2003Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
Proceedings Article
1
Hide details for Lee, Cheong, Kwon, Shin, Chwa [Cheong, Kwon, Shin, Chwa, Paterson]Lee, Cheong, Kwon, Shin, Chwa [Cheong, Kwon, Shin, Chwa, Paterson]
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
1
Hide details for Lee, Park, Chwa [Park, Chwa]Lee, Park, Chwa [Park, Chwa]
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Journal Article
1
Hide details for Lee, Shin, Chwa [Shin, Chwa]Lee, Shin, Chwa [Shin, Chwa]
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
1
Hide details for Lehnert, Schweitzer [Lehnert]Lehnert, Schweitzer [Lehnert]
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
Journal Article
1
Hide details for Leinenbach [-]Leinenbach [-]
1997Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes
Thesis - Masters thesis
7
Hide details for Lengauer, Mehlhorn [-]Lengauer, Mehlhorn [-]
1986Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
Part of a Book
1984Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
Journal Article
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
1983Four results on the complexity of VLSI computationsReport
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit LayoutsReport
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design SystemReport
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
Journal Article
2
Hide details for Lenhof [-]Lenhof [-]
1999Bioinformatik
Universität des Saarlandes
Thesis - Habilitation thesis
1997New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191
Proceedings Article
1
Hide details for Lenhof [Plesser, Wittenberg]Lenhof [Plesser, Wittenberg]
1997Parallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48
Part of a Book
1
Hide details for Lenhof [Schomburg, Lessel]Lenhof [Schomburg, Lessel]
1995An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Part of a Book
1
Hide details for Lenhof, Morgenstern, Reinert [Morgenstern]Lenhof, Morgenstern, Reinert [Morgenstern]
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
Journal Article
1
Hide details for Lenhof, Reinert, Vingron [Vingron, Istrail, Pevzner, Waterman]Lenhof, Reinert, Vingron [Vingron, Istrail, Pevzner, Waterman]
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
1
Hide details for Lenhof, Reinert, Vingron [Vingron]Lenhof, Reinert, Vingron [Vingron]
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
6
Hide details for Lenhof, Smid [-]Lenhof, Smid [-]
1995Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Journal Article
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Journal Article
1994An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Proceedings Article
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Journal Article
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Journal Article
1992Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Proceedings Article
1
Hide details for Lenhof, Smid [Hsu, Lee]Lenhof, Smid [Hsu, Lee]
1991An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
1
Hide details for Lenhof, Smid [Nurmi, Ukkonen]Lenhof, Smid [Nurmi, Ukkonen]
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
1
Hide details for Lennerz [-]Lennerz [-]
2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Lennerz, Schömer [Hiromasa, Ralph]Lennerz, Schömer [Hiromasa, Ralph]
2002Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
2
Hide details for Leonardi, Schäfer [Leonardi]Leonardi, Schäfer [Leonardi]
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
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Journal Article
1
Hide details for Lermen [-]Lermen [-]
1997Multiple Sequence Alignment
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Lermen, Reinert [Lermen]Lermen, Reinert [Lermen]
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
Journal Article
1
Hide details for Limbach [-]Limbach [-]
2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Loeckx, Mehlhorn, Wilhelm [-]Loeckx, Mehlhorn, Wilhelm [-]
1989Foundations of Programming LanguagesBook
1986Grundlagen der ProgrammiersprachenBook
1
Hide details for Lokshtanov, Saurabh, Wahlström [Lokshtanov, Saurabh, D'Souza, Kavitha, Radhakrishna]Lokshtanov, Saurabh, Wahlström [Lokshtanov, Saurabh, D'Souza, Kavitha, Radhakrishna]
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
1
Hide details for Loock, Schömer [Loock]Loock, Schömer [Loock]
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
1
Hide details for Lotker, Majumdar, Narayanaswamy, Weber [Lotker, Narayanaswamy, Chen, Lee]Lotker, Majumdar, Narayanaswamy, Weber [Lotker, Narayanaswamy, Chen, Lee]
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
Proceedings Article
1
Hide details for Lutter [-]Lutter [-]
1996Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Lüttke-Hüttmann [-]Lüttke-Hüttmann [-]
2000Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Maggs, Vöcking [Maggs]Maggs, Vöcking [Maggs]
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
1
Hide details for Mahajan, Ramos, Subrahmanyam [-]Mahajan, Ramos, Subrahmanyam [-]
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
1
Hide details for Mainberger, Hoffmann, Weickert, Tang, Johannsen, Neumann, Doerr [Mainberger, Hoffmann, Weickert, Johannsen, NeMainberger, Hoffmann, Weickert, Tang, Johannsen, Neumann, Doerr [Mainberger, Hoffmann, Weickert, Johannsen, Neumann, Bruckstein, ter Haar Romeny, Bronstein, Bronstein]
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
1
Hide details for Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.) []Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.) []
1986VLSI algorithms and architectures : Aegean workshop on computingProceedings
2
Hide details for Malamatos [-]Malamatos [-]
2008Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Journal Article
2005Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194
Electronic Proceedings Article
1
Hide details for Manjunath [-]Manjunath [-]
2008Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Manjunath, Mehlhorn, Panagiotou, Sun [Demetrescu, M. Halldórsson]Manjunath, Mehlhorn, Panagiotou, Sun [Demetrescu, M. Halldórsson]
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Proceedings Article
1
Hide details for Manjunath, Sharma [Sharma]Manjunath, Sharma [Sharma]
2011Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
Journal Article
1
Hide details for Mannila, Mehlhorn [-]Mannila, Mehlhorn [-]
1985Attachment IconA fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272
Journal Article
1
Hide details for Manss [-]Manss [-]
1997Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Margewitsch [-]Margewitsch [-]
1997Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Martens, Skutella [Albers, Radzik]Martens, Skutella [Albers, Radzik]
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
1
Hide details for Matijevic [-]Matijevic [-]
2007Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Maue [-]Maue [-]
2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Maue, Sanders, Matijevic [Sanders, Alvarez, Serna]Maue, Sanders, Matijevic [Sanders, Alvarez, Serna]
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
1
Hide details for Maurer [-]Maurer [-]
1997Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Mavronicolas, Papatriantafilou, Tsigas [Mavronicolas]Mavronicolas, Papatriantafilou, Tsigas [Mavronicolas]
1997The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
1
Hide details for McConnella, Mehlhorn, Näher, Schweitzer [McConnella, Näher, Schweitzer]McConnella, Mehlhorn, Näher, Schweitzer [McConnella, Näher, Schweitzer]
2010Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
Electronic Journal Article
1
Hide details for McGeoch, Sanders, Fleischer, Cohen, Precup [McGeoch, Fleischer, Cohen, Precup, Fleischer, Moret, Meineche SchmMcGeoch, Sanders, Fleischer, Cohen, Precup [McGeoch, Fleischer, Cohen, Precup, Fleischer, Moret, Meineche Schmidt]
2002Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
Part of a Book
1
Hide details for Megow [Biermann, Götschel, Lutz-Westphal]Megow [Biermann, Götschel, Lutz-Westphal]
2010Keller oder Dach zuerst
In: Besser als Mathe, 111-116
Part of a Book
1
Hide details for Megow, Mehlhorn, Schweitzer [Aceto, Henzinger, Sgall]Megow, Mehlhorn, Schweitzer [Aceto, Henzinger, Sgall]
2011Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Proceedings Article
1
Hide details for Megow, Mehlhorn, Schweitzer [Schweitzer]Megow, Mehlhorn, Schweitzer [Schweitzer]
2012Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Journal Article
1
Hide details for Megow, Mestre [Mestre]Megow, Mestre [Mestre]
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
1
Hide details for Megow, Möhring, Schulz [Möhring, Schulz]Megow, Möhring, Schulz [Möhring, Schulz]
2011Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
Journal Article
1
Hide details for Megow, Skutella, Verschae, Wiese [Skutella, Verschae, Czumaj, Pitts, Wattenhofer]Megow, Skutella, Verschae, Wiese [Skutella, Verschae, Czumaj, Pitts, Wattenhofer]
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
1
Hide details for Megow, Verschae [Verschae]Megow, Verschae [Verschae]
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
4
Hide details for Mehlhorn (ed.) [-]Mehlhorn (ed.) [-]
1998Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer CongressProceedings
1989Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
Proceedings
1987Workshop über Komplexitätstheorie, Effiziente Algorithmen und DatenstrukturenProceedings
1985Theoretical aspects of computer science (STACS-85) : 2nd annual symposiumProceedings
64
Hide details for Mehlhorn [-]Mehlhorn [-]
2007Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Proceedings Article
2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
2001Attachment IconA Remark on the Sign Variation Method for Real Root IsolationUnpublished/Draft
2001Attachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
Part of a Book
1999Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Proceedings Article
1999The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Proceedings Article
1998Attachment IconAmortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102
Part of a Book
1996Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52
Proceedings Article
1995Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363
Journal Article
1988Attachment IconA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
Journal Article
1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
1987A Faster Approximation Algorithm for the Steiner Problem in GraphsReport
1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
1986Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Journal Article
1984Channel Routing in Knock-Knee Mode: Simplified Algorithms and ProofReport
1984Data structures and algorithms. Volume 1 : Sorting and searchingBook
1984Data structures and algorithms. Volume 2 : Graph algorithms and NP-completenessBook
1984Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryBook
1984On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30
Proceedings Article
1984Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89
Proceedings Article
1984$AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167
Journal Article
1983$AT^2$-optimal VLSI for integer division and integer square rootingReport
1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
Journal Article
1982Attachment 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
1981Attachment 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
1981Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
Journal Article
1980A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112
Proceedings Article
1980Attachment IconAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
Journal Article
1980Lower bounds on the efficiency of transforming static data structures into dynamic structuresReport
1980Attachment IconPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
Proceedings Article
1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Journal Article
1979Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
Journal Article
1979Attachment IconKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
Proceedings Article
1979Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
Journal Article
1979Attachment IconSearching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145
Proceedings Article
1979Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
Journal Article
1979Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380
Proceedings Article
1979Attachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
Proceedings Article
1978An efficient algorithm for constructing nearly optimal prefix codesReport
1978Arbitrary Weight Changes in Dynamic TreesReport
1978Effiziente Algorithmen: Ein BeispielReport
1978Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
Journal Article
1978Sorting Presorted FilesReport
1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
1977Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
Proceedings Article
1977Effiziente AlgorithmenBook
1976An improved lower bound on the formula complexity of context-free recognitionReport
1976Attachment IconAn Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524
Journal Article
1976An O(n log n) lower bound for the synchronous circuit size of integer multiplicationReport
1976Attachment IconBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
Journal Article
1976Dynamic Binary SearchReport
1976Dynamic Binary Search Trees : Extended AbstractsReport
1976Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
Journal Article
1975A game on graphsReport
1975Best 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
1975Bracket-Languages are Recognizable in Logarithmic SpaceReport
1975Attachment IconNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
Journal Article
1974Attachment IconPolynomial and abstract subrecursive classes
Cornell University
Thesis - PhD thesis
1974Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14
Report
1974Attachment 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
1974Attachment IconThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
Proceedings Article
1973Attachment IconOn the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196
Proceedings Article
1973On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22
Report
1973The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25
Report
1
Hide details for Mehlhorn [Aggarwal]Mehlhorn [Aggarwal]
1999The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Proceedings Article
1
Hide details for Mehlhorn [Akl, Dehne, Sack, Santoro]Mehlhorn [Akl, Dehne, Sack, Santoro]
1995Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
1
Hide details for Mehlhorn [Calamoneri, Finocchi, Italiano]Mehlhorn [Calamoneri, Finocchi, Italiano]
2006Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Proceedings Article
1
Hide details for Mehlhorn [Dress, Xu, Zhu]Mehlhorn [Dress, Xu, Zhu]
2007Attachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Proceedings Article
1
Hide details for Mehlhorn [Fukuda, Van der Hoeven, Joswig, Takayama]Mehlhorn [Fukuda, Van der Hoeven, Joswig, Takayama]
2010Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Proceedings Article
1
Hide details for Mehlhorn [Jansen, Margraf, Mastrolli, Rolim]Mehlhorn [Jansen, Margraf, Mastrolli, Rolim]
2003Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Proceedings Article
1
Hide details for Mehlhorn [Klein, Six, Wegner]Mehlhorn [Klein, Six, Wegner]
2003Attachment 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
1
Hide details for Mehlhorn [Lipitakis]Mehlhorn [Lipitakis]
2002Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87
Proceedings Article
1
Hide details for Mehlhorn [Montanari, Rolim, Welzl]Mehlhorn [Montanari, Rolim, Welzl]
2000Attachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Proceedings Article
1
Hide details for Mehlhorn [Shyamasundar]Mehlhorn [Shyamasundar]
1992Recent 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
1
Hide details for Mehlhorn [Zimmermann]Mehlhorn [Zimmermann]
1988SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29
Proceedings Article
1
Hide details for Mehlhorn []Mehlhorn []
1996The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Proceedings Article
1
Hide details for Mehlhorn, Burnikel, Fleischer, Schirra [-]Mehlhorn, Burnikel, Fleischer, Schirra [-]
1997A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709
Proceedings Article
1
Hide details for Mehlhorn, Claus, Thomas [Mehlhorn, Wilhelm]Mehlhorn, Claus, Thomas [Mehlhorn, Wilhelm]
1996Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
Proceedings Article
1
Hide details for Mehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, Spinrad [-]Mehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, Spinrad [-]
2005Certifying Algorithms (draft)Unpublished/Draft
2
Hide details for Mehlhorn, Galil [-]Mehlhorn, Galil [-]
1976Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Journal Article
1975Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319
Proceedings Article
1
Hide details for Mehlhorn, Kavitha, Hariharan [Kavitha, Hariharan]Mehlhorn, Kavitha, Hariharan [Kavitha, Hariharan]
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
1
Hide details for Mehlhorn, Meiser, O'Dunlaing [-]Mehlhorn, Meiser, O'Dunlaing [-]
1989Attachment IconOn the construction of abstract Voronoi diagramsReport
1
Hide details for Mehlhorn, Meiser, Ó'Dúnlaing [, ]Mehlhorn, Meiser, Ó'Dúnlaing [, ]
1990On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239
Proceedings Article
1
Hide details for Mehlhorn, Meiser, O'Dúnlaing []Mehlhorn, Meiser, O'Dúnlaing []
1991On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Journal Article
1
Hide details for Mehlhorn, Meiser, Rasch [Meiser, Rasch]Mehlhorn, Meiser, Rasch [Meiser, Rasch]
2001Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Journal Article
1
Hide details for Mehlhorn, Meyer [Möhring, Raman]Mehlhorn, Meyer [Möhring, Raman]
2002Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
Proceedings Article
4
Hide details for Mehlhorn, Michail [-]Mehlhorn, Michail [-]
2009Attachment IconMinimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13
Electronic Journal Article
2007Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
2006Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
1
Hide details for Mehlhorn, Michail [Nikoletseas]Mehlhorn, Michail [Nikoletseas]
2005Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
Proceedings Article
1
Hide details for Mehlhorn, Michail, Telikepalli, Irving, Paluch [Irving, Paluch]Mehlhorn, Michail, Telikepalli, Irving, Paluch [Irving, Paluch]
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
2
Hide details for Mehlhorn, Müller, Näher, Schirra, Seel, Uhrig, Ziegler [-]Mehlhorn, Müller, Näher, Schirra, Seel, Uhrig, Ziegler [-]
1998A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
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
1
Hide details for Mehlhorn, Mutzel [-]Mehlhorn, Mutzel [-]
1996Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Journal Article
6
Hide details for Mehlhorn, Näher [-]Mehlhorn, Näher [-]
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
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
1990A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166
Journal Article
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Journal Article
1987A faster compaction algorithm with automatic jog insertionReport
1986Dynamic fractional cascadingReport
1
Hide details for Mehlhorn, Näher [Brim, Gruska, Zlatuska]Mehlhorn, Näher [Brim, Gruska, Zlatuska]
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
2
Hide details for Mehlhorn, Näher [Näher]Mehlhorn, Näher [Näher]
1999LEDA: a platform for combinatorial and geometric computingBook
1995Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Journal Article
1
Hide details for Mehlhorn, Näher [Pehrson, Simon]Mehlhorn, Näher [Pehrson, Simon]
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
4
Hide details for Mehlhorn, Näher []Mehlhorn, Näher []
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
1990Attachment IconDynamic Fractional Cascading
In: Algorithmica [5], 215-241
Journal Article
1989A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Proceedings Article
1989LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Proceedings Article
2
Hide details for Mehlhorn, Näher, Alt [-]Mehlhorn, Näher, Alt [-]
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
1986A Lower Bound for the Complexity of the Union-Split-Find ProblemReport
1
Hide details for Mehlhorn, Näher, Alt []Mehlhorn, Näher, Alt []
1988A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
Journal Article
1
Hide details for Mehlhorn, Näher, Nievergelt []Mehlhorn, Näher, Nievergelt []
1994Attachment IconIntroduction
In: Journal of Symbolic Computation [17], 295-295
Journal Article
2
Hide details for Mehlhorn, Näher, Rauch []Mehlhorn, Näher, Rauch []
1990On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Journal Article
1989On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548
Proceedings Article
1
Hide details for Mehlhorn, Näher, Schilz, Schirra, Seel, Seidel, Uhrig [Näher, Seidel]Mehlhorn, Näher, Schilz, Schirra, Seel, Seidel, Uhrig [Näher, Seidel]
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1
Hide details for Mehlhorn, Näher, Schweitzer [McConnell]Mehlhorn, Näher, Schweitzer [McConnell]
2011Certifying algorithms
In: Computer Science Review [5], 119-161
Journal Article
1
Hide details for Mehlhorn, Näher, Seel, Seidel, Schilz, Schirra, Uhrig [Näher, Seidel]Mehlhorn, Näher, Seel, Seidel, Schilz, Schirra, Uhrig [Näher, Seidel]
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
3
Hide details for Mehlhorn, Näher, Uhrig [-]Mehlhorn, Näher, Uhrig [-]
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
1996The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
Proceedings Article
1990Attachment IconHidden line elimination for isooriented rectanglesReport
1
Hide details for Mehlhorn, Näher, Uhrig []Mehlhorn, Näher, Uhrig []
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
2
Hide details for Mehlhorn, Neumann, Schmidt [-]Mehlhorn, Neumann, Schmidt [-]
2013Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
2012Attachment IconCertifying 3-Edge-ConnectivityUnpublished/Draft
2
Hide details for Mehlhorn, Osbild, Sagraloff [-]Mehlhorn, Osbild, Sagraloff [-]
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
2008A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
1
Hide details for Mehlhorn, Osbild, Sagraloff [Bugliesi, Preneel, Sassone, Wegener]Mehlhorn, Osbild, Sagraloff [Bugliesi, Preneel, Sassone, Wegener]
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
2
Hide details for Mehlhorn, Overmars [-]Mehlhorn, Overmars [-]
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Journal Article
1980Optimal dynamization of decomposable searching problemsReport
1
Hide details for Mehlhorn, Paul [Paul]Mehlhorn, Paul [Paul]
1989Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
Proceedings Article
1
Hide details for Mehlhorn, Paul, Uhrig [Paul]Mehlhorn, Paul, Uhrig [Paul]
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Journal Article
9
Hide details for Mehlhorn, Preparata [-]Mehlhorn, Preparata [-]
1987Attachment IconArea-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282
Journal Article
1986Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352
Proceedings Article
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Journal Article
1985Area-time optimal division for T=omega((logn)1+epsilon)Report
1984Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357
Proceedings Article
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeReport
1983Attachment IconArea-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
Journal Article
1983Routing through a RectangleReport
1983$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Journal Article
1
Hide details for Mehlhorn, Preparata, Sarrafzadeh [-]Mehlhorn, Preparata, Sarrafzadeh [-]
1986Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Journal Article
1
Hide details for Mehlhorn, Priebe [-]Mehlhorn, Priebe [-]
1997On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220
Journal Article
1
Hide details for Mehlhorn, Priebe [Spirakis]Mehlhorn, Priebe [Spirakis]
1995On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Proceedings Article
1
Hide details for Mehlhorn, Priebe, Schäfer, Sivadasan [-]Mehlhorn, Priebe, Schäfer, Sivadasan [-]
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
Journal Article
1
Hide details for Mehlhorn, Ray [-]Mehlhorn, Ray [-]
2010Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Journal Article
2
Hide details for Mehlhorn, Rülling [-]Mehlhorn, Rülling [-]
1990Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
Journal Article
1988Compaction on the TorusReport
1
Hide details for Mehlhorn, Rülling []Mehlhorn, Rülling []
1988Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
1
Hide details for Mehlhorn, Sack [Sack]Mehlhorn, Sack [Sack]
2000Editorial
In: Computational Geometry [17], 1-2
Journal Article
1
Hide details for Mehlhorn, Sack, Urrutia [-]Mehlhorn, Sack, Urrutia [-]
1999Editorial
In: Computational Geometry [12], 153-154
Journal Article
3
Hide details for Mehlhorn, Sagraloff [-]Mehlhorn, Sagraloff [-]
2011A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Journal Article
2009Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Proceedings Article
2008A deterministic Bitstream Descartes AlgorithmReport
1
Hide details for Mehlhorn, Sagraloff, Wang [-]Mehlhorn, Sagraloff, Wang [-]
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
1
Hide details for Mehlhorn, Sanders [-]Mehlhorn, Sanders [-]
2003Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Journal Article
1
Hide details for Mehlhorn, Sanders [Sanders]Mehlhorn, Sanders [Sanders]
2008Algorithms and Data Structures: The Basic ToolboxBook
1
Hide details for Mehlhorn, Schäfer [-]Mehlhorn, Schäfer [-]
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
1
Hide details for Mehlhorn, Schäfer [Meyer auf der Heide]Mehlhorn, Schäfer [Meyer auf der Heide]
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
1
Hide details for Mehlhorn, Schäfer [Näher, Wagner]Mehlhorn, Schäfer [Näher, Wagner]
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
1
Hide details for Mehlhorn, Schirra [Alefeld, Rohn, Rump, Yamamoto]Mehlhorn, Schirra [Alefeld, Rohn, Rump, Yamamoto]
2001Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
1
Hide details for Mehlhorn, Schirra [Laurent, Sablonnière, Schumaker]Mehlhorn, Schirra [Laurent, Sablonnière, Schumaker]
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
4
Hide details for Mehlhorn, Schmidt [-]Mehlhorn, Schmidt [-]
1986Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Journal Article
1985On BF-perfect graphsReport
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
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
1
Hide details for Mehlhorn, Schweitzer [Lee, Chen, Ying]Mehlhorn, Schweitzer [Lee, Chen, Ying]
2010Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Proceedings Article
1
Hide details for Mehlhorn, Seel [Seel]Mehlhorn, Seel [Seel]
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Journal Article
1
Hide details for Mehlhorn, Sharir, Welzl [-]Mehlhorn, Sharir, Welzl [-]
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
1
Hide details for Mehlhorn, Sharir, Welzl [, ]Mehlhorn, Sharir, Welzl [, ]
1992Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1
Hide details for Mehlhorn, Shermer, Yap [Shermer, Yap]Mehlhorn, Shermer, Yap [Shermer, Yap]
1997Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
1
Hide details for Mehlhorn, Simon [-]Mehlhorn, Simon [-]
1985Attachment IconIntersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542
Proceedings Article
1
Hide details for Mehlhorn, Snelting (ed.) [-]Mehlhorn, Snelting (ed.) [-]
2000Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für InformatikProceedings
1
Hide details for Mehlhorn, Sundar, Uhrig [Sundar]Mehlhorn, Sundar, Uhrig [Sundar]
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
1
Hide details for Mehlhorn, Sundar, Uhrig []Mehlhorn, Sundar, Uhrig []
1994Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Proceedings Article
1
Hide details for Mehlhorn, Thiel [Dechter]Mehlhorn, Thiel [Dechter]
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
1
Hide details for Mehlhorn, Trajan (ed.) [-]Mehlhorn, Trajan (ed.) [-]
1991Effiziente Algorithmen - TagungsberichtProceedings
1
Hide details for Mehlhorn, Tsagarakis [-]Mehlhorn, Tsagarakis [-]
1979On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
Journal Article
5
Hide details for Mehlhorn, Tsakalidis [-]Mehlhorn, Tsakalidis [-]
1993Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Journal Article
1989Attachment IconData structuresReport
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Journal Article
1985Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
Proceedings Article
1985Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
Proceedings Article
1
Hide details for Mehlhorn, Tsakalidis []Mehlhorn, Tsakalidis []
1990Data Structures
In: Handbook of Theoretical Computer Science, 301-341
Part of a Book
2
Hide details for Mehlhorn, Vishkin [-]Mehlhorn, Vishkin [-]
1984Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
Journal Article
1983Granularity of parallel memoriesReport
1
Hide details for Mehlhorn, Waldmann, Wilhelm [Wilhelm]Mehlhorn, Waldmann, Wilhelm [Wilhelm]
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Part of a Book
1
Hide details for Mehlhorn, Yap [-]Mehlhorn, Yap [-]
1988Constructive Hopf's theorem: or how to untangle closed planar curvesReport
1
Hide details for Mehlhorn, Yap [Lepistö, Salomaa]Mehlhorn, Yap [Lepistö, Salomaa]
1988Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
1
Hide details for Mehlhorn, Yap []Mehlhorn, Yap []
1991Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Journal Article
1
Hide details for Mehlhorn, Ziegelmann [-]Mehlhorn, Ziegelmann [-]
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
1
Hide details for Mehlhorn, Ziegelmann [Paterson]Mehlhorn, Ziegelmann [Paterson]
2000Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
Proceedings Article
1
Hide details for Mehnert [-]Mehnert [-]
2004External Memory Suffix Array Construction
Universität des Saarlandes
Thesis - Masters thesis
3
Show details for Mestre [-]Mestre [-]

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