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 - 4. with BibTeX cite keys

Login to this database


 

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

YearTitleBibTeX cite key
Hide details for Klein, KutzKlein, Kutz
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
KlKu2006a
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
KlKu2006b
Hide details for Klein, Mehlhorn, MeiserKlein, Mehlhorn, Meiser
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Mehlhorn93g
1992Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
Mehlhorn92m
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
KleMehMei90
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Klein03/89
Hide details for Knauer, Schlipf, Schmidt, TiwaryKnauer, Schlipf, Schmidt, Tiwary
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Knauer2012
Hide details for KobelKobel
2011Certified numerical root finding
Universität des Saarlandes
KobelMaster2011
2008Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
KobelBachelor2008
Hide details for Kobel, SagraloffKobel, Sagraloff
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
DBLP:journals/corr/abs-1304-8069
Hide details for KönemannKönemann
1997Fast combinatorial algorithms for packing and covering problems
Universität des Saarlandes
joe97
Hide details for KötzingKötzing
2011Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
KoetzingALT2011
Hide details for Kötzing, Lehre, Neumann, OlivetoKötzing, Lehre, Neumann, Oliveto
2010Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400
Koe-Leh-Neu-Oli:c:10:AcoMinCut
Hide details for Kötzing, MolterKötzing, Molter
2012ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122
KoetzingMolter2012
Hide details for Kötzing, Neumann, Röglin, WittKötzing, Neumann, Röglin, Witt
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
KoetzingNRW2012
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Koe-Neu-Roe-Wit:c:10:ACOTSP
Hide details for Kötzing, Neumann, SpöhelKötzing, Neumann, Spöhel
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
KoetzingNS11GP
Hide details for Kötzing, Neumann, Sudholt, WagnerKötzing, Neumann, Sudholt, Wagner
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
Koe-Neu-Sud-Wag:c:Foga11AcoLinFun
Hide details for Kötzing, Sudholt, TheileKötzing, Sudholt, Theile
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
KoetzingST2011
Hide details for Kötzing, Sutton, Neumann, O'ReillyKötzing, Sutton, Neumann, O'Reilly
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
KoetzingSNO2011
Hide details for Kohlbacher, LenhofKohlbacher, Lenhof
2000BALL - Rapid Software Prototyping in Computational Molecular Biology
In: Bioinformatics [16], 815-824
KohlbacherLenhof2000
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
KohlbacherLenhof1999
Hide details for KoldehofeKoldehofe
1999Animation and Analysis of Distributed Algorithms
Universität des Saarlandes
Koldehofe1999
Hide details for Koller, Mehlhorn, NiehrenKoller, Mehlhorn, Niehren
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
Koller-et-al:dominance-constraints
Hide details for KolliasKollias
2013Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Kollias2012
Hide details for Konidaris, Mehlhorn, ShellKonidaris, Mehlhorn, Shell
2004Attachment IconAn optimal algorithm for finding edge segment adjacencies in configurations of convex polygonsmehlhorn
Hide details for KontogiannisKontogiannis
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
Kontogiannis2002
Hide details for Kontogiannis, Pantziou, Spirakis, YungKontogiannis, Pantziou, Spirakis, Yung
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Kontogiannis2000
Hide details for Konwar, Kowalski, ShvartsmanKonwar, Kowalski, Shvartsman
2004The Join problem in dynamic network algorithms
In: 2004 International Conference on Dependable Systems and Networks (DSN 2004), 315-324
KKS-DSN
Hide details for KovácsKovács
2007Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes
Kov07
2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198
Kovacs2006
2005Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627
Kovacs2005b
2005Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852
Kovacs2005a
2004Sum-Multicoloring on Paths
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 68-80
Kovacs2004
Hide details for KowalikKowalik
2009Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Kowalik2009
2007Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], -
KowalikAdjSparseGraphs
2006Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566
KowalikISAAC2006
2006Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101
Kowalik2005
Hide details for Kowalski, Musial, ShvartsmanKowalski, Musial, Shvartsman
2005Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58
KMS-ICDCS
Hide details for Kowalski, PelcKowalski, Pelc
2005Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371
KP-TCS
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
KP-APPROX
2004Polynomial deterministic rendezvous in arbitrary graphs
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 644-656
KP-ISAAC
2004Time of deterministic broadcasting in radio networks with local knowledge
In: SIAM Journal on Computing [33], 870-891
Kowalski2003b
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
KP-SIROCCO
Hide details for Kowalski, ShvartsmanKowalski, 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
Kowalski-SPAA-2004
Hide details for Krandick, MehlhornKrandick, Mehlhorn
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
mehlhorn06e
2004New Bounds for the Descartes MethodKrandickMehlhorn2004a
Hide details for KratschKratsch
2010Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes
KratschPhD2010
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
Kratsch2008
Hide details for Kratsch, Lehre, Neumann, OlivetoKratsch, Lehre, Neumann, Oliveto
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
KratschLNO2010
Hide details for Kratsch, Marx, WahlströmKratsch, Marx, Wahlström
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
KMW2010
Hide details for Kratsch, McConnell, Mehlhorn, SpinradKratsch, McConnell, Mehlhorn, 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
mehlhorn06b
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
Kratsch-et-al:interval
Hide details for Kratsch, NeumannKratsch, Neumann
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
KraNeuGECCO2009
Hide details for Kratsch, Pilipczuk, Pilipczuk, WahlströmKratsch, Pilipczuk, Pilipczuk, Wahlström
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
KratschPilipczukPilipczukWahlstroem2012
Hide details for Kratsch, SchweitzerKratsch, Schweitzer
2010Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92
KratschS2010
Hide details for Kratsch, WahlströmKratsch, Wahlström
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
KratschWahlstroem2012a
2012Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
KratschWahlstroem2012b
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
KW2010b
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
KratschW2009
Hide details for Krick, Meyer auf der Heide, Räcke, Vöcking, WestermannKrick, Meyer auf der Heide, Räcke, Vöcking, Westermann
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
Vöcking2003
Hide details for Krithivasan, Rema, Schirra, VijaykumarKrithivasan, Rema, Schirra, 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
Schirra-et-al-3-96
Hide details for Krivelevich, SpöhelKrivelevich, Spöhel
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
SpoehelK2012
Hide details for Kroeske, Ghandar, Michalewicz, NeumannKroeske, Ghandar, Michalewicz, Neumann
2008Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060
KroGhaMicNeuPPSN2008
Hide details for KrohmerKrohmer
2012Finding cliques in scale-free networks
Universität des Saarlandes
KrohmerMaster2012
Hide details for Krumke, Schwahn, van Stee, WestphalKrumke, Schwahn, van Stee, Westphal
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
vanStee2008f
Hide details for Krumke, van Stee, WestphalKrumke, van Stee, Westphal
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
KrStWe2009
Hide details for KrystaKrysta
2003Approximating Minimum Size 1,2-Connected Networks
In: Discrete Applied Mathematics [125], 267-288
Krysta2003b
2001Approximation Algorithms for Combinatorial Optimization Problems in Graph Coloring and Network Design
Universität des Saarlandes
Krysta2001b
Hide details for Krysta, KumarKrysta, Kumar
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
Krysta2001
Hide details for Krysta, LorysKrysta, Lorys
1999Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
KrystaLorys1999
Hide details for Krysta, PacholskiKrysta, Pacholski
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Krysta1999a
Hide details for Krysta, Sanders, VöckingKrysta, Sanders, Vöcking
2003Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
KSV03
Hide details for Krysta, Solis-ObaKrysta, Solis-Oba
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Krysta2001c
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Solis-Oba1999h
Hide details for KsinsikKsinsik
1996Approximative Bewegungsplanung für einen rechteckigen Roboter mit Hilfe von Voronoidiagrammen
Universität des Saarlandes
Ksinsik96
Hide details for Kucera, Mehlhorn, Preis, SchwarzeneckerKucera, 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
Mehlhorn93a
Hide details for Kuhn, Panagiotou, Spencer, StegerKuhn, Panagiotou, Spencer, Steger
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
KPSS2010
Hide details for KumarKumar
2001Coupling vs. conductance for the Jerrum-Sinclair chain
In: Random Structures & Algorithms [18], 1-17
Kumar2001a
Hide details for Kumar, Arya, RameshKumar, Arya, Ramesh
2000Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635
Kumar2000
Hide details for Kumar, RameshKumar, Ramesh
1999Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Kumar1999a
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
Kumar1999b
Hide details for KursaweKursawe
1998Exploration von geometrischen Umgebungen mit Hindernissen
Universität des Saarlandes
Kursawe98
Hide details for KutzKutz
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
Kutz2006
2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Kutz3dAngel
2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
KutzHGames:2004
Hide details for Kutz, Elbassioni, Katriel, MahajanKutz, Elbassioni, Katriel, Mahajan
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Elbassioni2008g
Hide details for Kutz, PórKutz, Pór
2005Attachment IconAngel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934
Kutz05
Hide details for Kutz, SchweitzerKutz, Schweitzer
2007ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
KutzSchw2006
Hide details for KwappikKwappik
1998Exact Linear Programming
Universität des Saarlandes
Kwappik98
Hide details for Kwek, MehlhornKwek, Mehlhorn
2003Attachment IconOptimal Search for Rationals
In: Information Processing Letters [86], 23-26
KwekMehlhorn2003
Hide details for LambertLambert
2001Ein Parametric Search Toolkit
Universität des Saarlandes
LambertDipl01
2000Parallele und externe Implementierung eines Zusammenhangskomponentenalgorithmus
Universität des Saarlandes
Lambert2000


Hide details for Lambert, SibeynLambert, Sibeyn
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
F.Sibeyn-PDCS-1999
Hide details for LangLang
1994Hidden Line Elimination für iso-orientierte Rechtecke
Universität des Saarlandes
Lang94
Hide details for Larsson, Gidenstam, Ha, Papatriantafilou, TsigasLarsson, Gidenstam, Ha, Papatriantafilou, Tsigas
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Gidenstam200901
Hide details for Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)Lars, Bender, Demaine, Leiserson, Mehlhorn (ed.)
2005Cache-Oblivious and Cache-Aware Algorithmsmehlhorn05
Hide details for LauerLauer
1998Design und Implementierung eines Testmanagers für LiDIA
Universität des Saarlandes
Lauer1998Diplom
Hide details for Laura, Leonardi, Millozzi, Meyer, SibeynLaura, Leonardi, Millozzi, Meyer, Sibeyn
2003Algorithms and Experiments for the Webgraph
In: Algorithms - ESA 2003: 11th Annual European Symposium, 703-714
LLMMS2003
Hide details for Lee, Cheong, Kwon, Shin, ChwaLee, Cheong, Kwon, Shin, Chwa
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
Leejhc2000
Hide details for Lee, Park, ChwaLee, Park, Chwa
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Leejh2000a
Hide details for Lee, Shin, ChwaLee, Shin, Chwa
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Leejh2000b
Hide details for Lehnert, SchweitzerLehnert, Schweitzer
2007The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241
LehnSchw2007
Hide details for LeinenbachLeinenbach
1997Eine effiziente Implementierung des Datentyps Polyeder
Universität des Saarlandes
Leinenbach95
Hide details for Lengauer, MehlhornLengauer, Mehlhorn
1986Attachment IconVLSI complexity, efficient VLSI algorithms and the HILL design system
In: Algorithmics for VLSI, 33-89
mehlhorn86
1984Attachment IconFour results on the complexity of VLSI computation
In: Advances in Computing Research [2], 1-22
mehlhorn84m
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
mehlhorn84q
1983Four results on the complexity of VLSI computationsmehlhorn83a
1983Attachment IconThe HILL System: A Design Environment for the Hierarchical Specification, Compaction, and Simulation of Integrated Circuit Layoutsmehlhorn83bz
1983VLSI Complexity, Efficient VLSI Algorithms and the HILL Design Systemmehlhorn83c
1981On the Complexity of VLSI-Computations
In: VLSI Systems and Computations [??], 89-99
mehlhorn81g
Hide details for LenhofLenhof
1999Bioinformatik
Universität des Saarlandes
lenhof_habil
1997New contact measures for the protein docking problem
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 182-191
Lenhof-1-97
1997Parallel Protein Puzzle: A New Suite of Protein Docking Tools
In: Forschung und wissenschaftliches Rechnen: Beiträge zum Heinz-Billing-Preis 1996, 31-48
BILLING97
1995An Algorithm for the Protein Docking Problem
In: Bioinformatics: From Nucleic Acids and Proteins to Cell Metabolism, 125-139
Lenhof95
Hide details for Lenhof, Morgenstern, ReinertLenhof, Morgenstern, Reinert
1999An exact solution for the segment-to-segment multiple sequence alignment problem
In: Bioinformatics [15], 203-210
LenhofMorgensternReinert1999
Hide details for Lenhof, Reinert, VingronLenhof, Reinert, Vingron
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
LenReiVin1998
1998A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
LenReiVin98
Hide details for Lenhof, SmidLenhof, Smid
1995Maintaining the visibility map of spheres while moving the viewpoint
In: Algorithmica [13], 301-312
Lenhof-Smid-1-95
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Lenhof-Smid-2-95
1994An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Lenhof-Smid94
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Lenhof-Smid-2-94
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Lenhof-Smid93
1992Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Lenhof-Smid-2-92
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
Lenhof-Smid-1-92
1991An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Lenhof-Smid-91
Hide details for LennerzLennerz
2005Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes
LennerzDiss05
Hide details for Lennerz, SchömerLennerz, Schömer
2002Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Lennerz2001
Hide details for Leonardi, SchäferLeonardi, Schäfer
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
Leonardi04EC
2004Cross-monotonic cost sharing methods for connected facility location games
In: Theoretical Computer Science [326], 431-442
Leonardi04
Hide details for LermenLermen
1997Multiple Sequence Alignment
Universität des Saarlandes
Lermen97
Hide details for Lermen, ReinertLermen, Reinert
2000The practical use of the A* algorithm for exact multiple sequence alignment
In: Journal of Computational Biology [7], 665-671
LR2000
Hide details for LimbachLimbach
2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Limbach2008
Hide details for Loeckx, Mehlhorn, WilhelmLoeckx, Mehlhorn, Wilhelm
1989Foundations of Programming Languagesbooks/wi/LoeckxMW89
1986Grundlagen der Programmiersprachenmehlhorn86p
Hide details for Lokshtanov, Saurabh, WahlströmLokshtanov, Saurabh, Wahlström
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
LSWahlstroem2012
Hide details for Loock, SchömerLoock, Schömer
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
ls-dc-01
Hide details for Lotker, Majumdar, Narayanaswamy, WeberLotker, Majumdar, Narayanaswamy, Weber
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
lotkeretal06cocoon
Hide details for Lüttke-HüttmannLüttke-Hüttmann
2000Knickminimales Zeichnen 4-planarer Clustergraphen
Universität des Saarlandes
LuettkeHuettmann2000Thesis
Hide details for LutterLutter
1996Ein Bewegungsplanungsalgorithmus für zwei Rechtecke mit einem gemeinsamen Eckpunkt
Universität des Saarlandes
Lutter96
Hide details for Maggs, VöckingMaggs, Vöcking
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Vocking2000
Hide details for Mahajan, Ramos, SubrahmanyamMahajan, 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
Mahajan-Ramos-Subrahmanyam97
Hide details for Mainberger, Hoffmann, Weickert, Tang, Johannsen, Neumann, DoerrMainberger, Hoffmann, Weickert, Tang, Johannsen, Neumann, Doerr
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
MainbergerWTJND11
Hide details for Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.)Makedon, Mehlhorn, Papatheodorou, Spirakis (ed.)
1986VLSI algorithms and architectures : Aegean workshop on computingmo:Mehlhorn:86
Hide details for MalamatosMalamatos
2008Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Malamatos2008
2005Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194
Mal05z
Hide details for ManjunathManjunath
2008Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes
Manjunath2008th
Hide details for Manjunath, Mehlhorn, Panagiotou, SunManjunath, Mehlhorn, Panagiotou, Sun
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Sun2011
Hide details for Manjunath, SharmaManjunath, Sharma
2011Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
Manjunath2011
Hide details for Mannila, MehlhornMannila, Mehlhorn
1985Attachment IconA fast algorithm for renaming a set of clauses as a Horn set
In: Information Processing Letters [21], 269-272
mehlhorn85a
Hide details for ManssManss
1997Separatoren in planaren Graphen: Implementierung einer 2-Approximation
Universität des Saarlandes
Manss97
Hide details for MargewitschMargewitsch
1997Parallele Berechnung elektrostatischer Wechselwirkungen für synthetische Polymere
Universität des Saarlandes
Margewitsch97
Hide details for Martens, SkutellaMartens, Skutella
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Martens2004
Hide details for MatijevicMatijevic
2007Attachment IconGeometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes
MatijevicPhD
Hide details for MaueMaue
2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Maue2006
Hide details for Maue, Sanders, MatijevicMaue, Sanders, Matijevic
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
MaueSandersMatijevic2006
Hide details for MaurerMaurer
1997Heuristiken für Goldbergs Preflow Push Algorithmus
Universität des Saarlandes
Maurer97
Hide details for Mavronicolas, Papatriantafilou, TsigasMavronicolas, Papatriantafilou, Tsigas
1997The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Mavronikolas-et-al97
Hide details for McConnella, Mehlhorn, Näher, SchweitzerMcConnella, Mehlhorn, Näher, Schweitzer
2010Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
McConnella2010
Hide details for McGeoch, Sanders, Fleischer, Cohen, PrecupMcGeoch, Sanders, Fleischer, Cohen, Precup
2002Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126
Sanders2002b
Hide details for MegowMegow
2010Keller oder Dach zuerst
In: Besser als Mathe, 111-116
MegowMatheonBuch2009
Hide details for Megow, Mehlhorn, SchweitzerMegow, Mehlhorn, Schweitzer
2012Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
MegowMehlhornSchweitzer2012
2011Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489
Megow2011-explore
Hide details for Megow, MestreMegow, Mestre
2013Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013),
MegowMestre2013
Hide details for Megow, Möhring, SchulzMegow, Möhring, Schulz
2011Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204
MegowMS10-turnaround
Hide details for Megow, Skutella, Verschae, WieseMegow, Skutella, Verschae, Wiese
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
MegowSVW2012
Hide details for Megow, VerschaeMegow, 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
MegowV2013
Hide details for MehlhornMehlhorn
2010Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Mehlhorn2010
2007Attachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
COCOA07
2007Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
MehlhornMFCS07
2006Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
mehlhorn06x
2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
mehlhorn05
2003Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
mehlhorn03
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
KM03b
2002Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87
Mehlhorn02
2001Attachment IconA Remark on the Sign Variation Method for Real Root Isolationmehlhorn01c
2001Attachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
mehlhorn01g
2000Attachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Me:ICALP2000
1999Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
mehlhorn99
1999The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Mehlhorn99
1999The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
mehlhorn99
1998Attachment IconAmortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102
mehlhorn98
1996Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52
mehlhorn96
1996The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
mehlhorn96
1995Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Mehlhorn95
1995Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363
mehlhorn95
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
Mehlhorn92d
1988Attachment IconA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
IPL::Mehlhorn1988
1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchenmehlhorn88k
1988SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29
conf/gi/MehlhornZ88
1987A Faster Approximation Algorithm for the Steiner Problem in Graphsmehlhorn87h
1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und Suchenmehlhorn86a
1986Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
mehlhorn86c
1984Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofmehlhorn84
1984Data structures and algorithms. Volume 1 : Sorting and searchingmehlhorn84a
1984Data structures and algorithms. Volume 2 : Graph algorithms and NP-completenessmehlhorn84b
1984Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometrymehlhorn84b
1984On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30
mehlhorn84k
1984Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89
mehlhorn84j
1984$AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167
mehlhorn84r
1983$AT^2$-optimal VLSI for integer division and integer square rootingmehlhorn83j
1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
mehlhorn82a
1982Attachment IconOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
mehlhorn82f
1981Attachment IconArbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211
mehlhorn81d
1981Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
mehlhorn81dz
1980A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112
mehlhorn80dz
1980Attachment IconAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
mehlhorn80f
1980Lower bounds on the efficiency of transforming static data structures into dynamic structuresmehlhorn80z
1980Attachment IconPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
mehlhorn80b
1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
mehlhorn79bz
1979Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
mehlhorn79c
1979Attachment IconKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
mehlhorn79e
1979Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
mehlhorn79b
1979Attachment IconSearching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145
mehlhorn79dz
1979Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
mehlhorn79j
1979Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380
mehlhorn79d
1979Attachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
mehlhorn79h
1978An efficient algorithm for constructing nearly optimal prefix codesmehlhorn78y
1978Arbitrary Weight Changes in Dynamic Treesmehlhorn78z
1978Effiziente Algorithmen: Ein Beispielmehlhorn78
1978Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
mehlhorn78a
1978Sorting Presorted Filesmehlhorn78u
1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Mehlhorn77a
1977Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
mehlhorn77
1977Effiziente Algorithmenmehlhorn77c
1976An improved lower bound on the formula complexity of context-free recognitionmehlhorn76v
1976Attachment IconAn Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524
Mehlhorn76b
1976An O(n log n) lower bound for the synchronous circuit size of integer multiplicationmehlhorn76
1976Attachment IconBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
mehlhorn76f
1976Dynamic Binary Searchmehlhorn76x
1976Dynamic Binary Search Trees : Extended Abstractsmehlhorn76w
1976Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
Mehlhorn76c
1975A game on graphsmehlhorn75a
1975Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41
mehlhorn75by
1975Bracket-Languages are Recognizable in Logarithmic Spacemehlhorn75z
1975Attachment IconNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
mehlhorn75f
1974Attachment IconPolynomial and abstract subrecursive classes
Cornell University
mehlhorn75b
1974Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14
mehlhorn74
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
mehlhorn74a
1974Attachment IconThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
Mehlhorn74
1973Attachment IconOn the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196
mehlhorn73a
1973On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22
mehlhorn73b
1973The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25
mehlhorn73
Hide details for Mehlhorn (ed.)Mehlhorn (ed.)
1998Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer Congressmehlhorn98e
1989Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
scg89
1987Workshop über Komplexitätstheorie, Effiziente Algorithmen und Datenstrukturenmehlhorn87
1985Theoretical aspects of computer science (STACS-85) : 2nd annual symposiummehlhorn85c
Hide details for Mehlhorn, Burnikel, Fleischer, SchirraMehlhorn, 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
Burnikel-et-al97
Hide details for Mehlhorn, Claus, ThomasMehlhorn, Claus, Thomas
1996Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
MehlhornCT93
Hide details for Mehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, SpinradMehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, Spinrad
2005Certifying Algorithms (draft)CertifyingAlgs
Hide details for Mehlhorn, GalilMehlhorn, Galil
1976Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Mehlhorn76j
1975Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319
mehlhorn75y
Hide details for Mehlhorn, Kavitha, HariharanMehlhorn, Kavitha, Hariharan
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Mehlhorn2008b
Hide details for Mehlhorn, Meiser, O'DúnlaingMehlhorn, Meiser, O'Dúnlaing
1991On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Mehlhorn91c
1990On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239
Mehlhorn90a
1989Attachment IconOn the construction of abstract Voronoi diagramsmehlhorn89z
Hide details for Mehlhorn, Meiser, RaschMehlhorn, Meiser, Rasch
2001Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
MehlhornMeiser01
Hide details for Mehlhorn, MeyerMehlhorn, Meyer
2002Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
MehMey2002
Hide details for Mehlhorn, MichailMehlhorn, Michail
2009Attachment IconMinimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13
CycleBasisSimplified
2007Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Mehlhorn2007b
2006Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
MM06
2005Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
MM05
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsMM05a
Hide details for Mehlhorn, Michail, Telikepalli, Irving, PaluchMehlhorn, Michail, Telikepalli, Irving, Paluch
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Michail2004a
Hide details for Mehlhorn, Müller, Näher, Schirra, Seel, Uhrig, ZieglerMehlhorn, 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
MMNSSUZ98
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
mmnssuz-cbhcg-97
Hide details for Mehlhorn, MutzelMehlhorn, Mutzel
1996Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Mehlhorn-Mutzel96
Hide details for Mehlhorn, NäherMehlhorn, Näher
1999LEDA: a platform for combinatorial and geometric computingMehlhorn1999
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
mehlhorn98
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
MehlhornNäher98
1995LEDA : A Platform for Combinatorial and Geometric Computingmehlhorn95z
1995Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Mehlhorn-Naeher95
1994Attachment IconThe Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
Mehlhorn94d
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
mehlhorn92d
1990A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166
mehlhorn90z
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Mehlhorn:1990:BOD
1990Attachment IconDynamic Fractional Cascading
In: Algorithmica [5], 215-241
ALGOR::MehlhornN1990
1989A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
lncs379*88
1989LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
mehlhorn:1989:lledt
1987A faster compaction algorithm with automatic jog insertionmehlhorn87i
1986Dynamic fractional cascadingmehlhorn86z
Hide details for Mehlhorn, Näher, AltMehlhorn, Näher, Alt
1988A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
SICOMP::MehlhornNA1988
1987A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488
mehlhorn87
1986A Lower Bound for the Complexity of the Union-Split-Find Problemmehlhorn86r
Hide details for Mehlhorn, Näher, NievergeltMehlhorn, Näher, Nievergelt
1994Attachment IconIntroduction
In: Journal of Symbolic Computation [17], 295-295
Mehlhorn94g
Hide details for Mehlhorn, Näher, RauchMehlhorn, Näher, Rauch
1990On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Mehlhorn:1990:CGR
1989On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548
FOCS::MehlhornNR1989
Hide details for Mehlhorn, Näher, Schilz, Schirra, Seel, Seidel, UhrigMehlhorn, Näher, Schilz, Schirra, Seel, Seidel, Uhrig
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Mehlhorn-et-al-1-96
Hide details for Mehlhorn, Näher, SchweitzerMehlhorn, Näher, Schweitzer
2011Certifying algorithms
In: Computer Science Review [5], 119-161
McConnell2010
Hide details for Mehlhorn, Näher, Seel, Seidel, Schilz, Schirra, UhrigMehlhorn, Näher, Seel, Seidel, Schilz, Schirra, Uhrig
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Mehlhorn-et-al99
Hide details for Mehlhorn, Näher, UhrigMehlhorn, 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
MehlhornNaeherUhrig1997
1996The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
mehlhorn96
1990Attachment IconHidden line elimination for isooriented rectanglesmehlhorn90
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Mehlhorn:1990:HLE
Hide details for Mehlhorn, Neumann, SchmidtMehlhorn, Neumann, Schmidt
2013Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Mehlhorn2013
2012Attachment IconCertifying 3-Edge-ConnectivityCertifying3EdgeConnectivity2012
Hide details for Mehlhorn, Osbild, SagraloffMehlhorn, Osbild, Sagraloff
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
MOS-CP2011
2008A General Approach to the Analysis of Controlled Perturbation AlgorithmsACS-TR-361502-02
2006Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
MOS06
Hide details for Mehlhorn, OvermarsMehlhorn, Overmars
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
mehlhorn81b
1980Optimal dynamization of decomposable searching problemsmehlhorn80
Hide details for Mehlhorn, PaulMehlhorn, Paul
1989Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
ICALP::MehlhornP1989
Hide details for Mehlhorn, Paul, UhrigMehlhorn, Paul, Uhrig
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
MehlhornPU1992
Hide details for Mehlhorn, PreparataMehlhorn, Preparata
1987Attachment IconArea-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282
IC::MehlhornP1987
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
conf/stacs/MehlhornP86
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
JACM::MehlhornP1986
1985Area-time optimal division for T=omega((logn)1+epsilon)mehlhorn85k
1984Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357
mehlhorn84h
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Timemehlhorn83i
1983Attachment IconArea-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
mehlhorn83k
1983Routing through a Rectanglemehlhorn83
1983$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
mehlhorn83n
Hide details for Mehlhorn, Preparata, SarrafzadehMehlhorn, Preparata, Sarrafzadeh
1986Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
ALGOR::MehlhornPS1986
Hide details for Mehlhorn, PriebeMehlhorn, Priebe
1997On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220
MehlhornPriebe97
1995On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Mehlhorn-Priebe95
Hide details for Mehlhorn, Priebe, Schäfer, SivadasanMehlhorn, Priebe, Schäfer, Sivadasan
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
MPSS2002
Hide details for Mehlhorn, RayMehlhorn, Ray
2010Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
MehlhornRay2010
Hide details for Mehlhorn, RüllingMehlhorn, Rülling
1990Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
mehlhorn90
1988Compaction on the Torusmehlhorn88
1988Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
lncs319*212
Hide details for Mehlhorn, SackMehlhorn, Sack
2000Editorial
In: Computational Geometry [17], 1-2
MehlhornSack2000
Hide details for Mehlhorn, Sack, UrrutiaMehlhorn, Sack, Urrutia
1999Editorial
In: Computational Geometry [12], 153-154
mehlhorn99
Hide details for Mehlhorn, SagraloffMehlhorn, Sagraloff
2011A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
MS:Bistream:2011
2009Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
MS:Bitstream:2009
2008A deterministic Bitstream Descartes AlgorithmACS-TR-361502-03
Hide details for Mehlhorn, Sagraloff, WangMehlhorn, Sagraloff, Wang
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
MSWClustering2013
Hide details for Mehlhorn, SandersMehlhorn, Sanders
2008Algorithms and Data Structures: The Basic ToolboxMehlhorn-Sanders:Toolbox
2003Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
MehSan03j
Hide details for Mehlhorn, SchäferMehlhorn, 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],
MS2002
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
MehlhornSchaefer2001
2000Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Mehlhorn-Schaefer:WeightedMatchings
Hide details for Mehlhorn, SchirraMehlhorn, Schirra
2001Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
MeSchi:lede_real
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Schirra1999
Hide details for Mehlhorn, SchmidtMehlhorn, Schmidt
1986Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
mehlhorn86g
1985On BF-perfect graphsmehlhorn85
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
mehlhorn83f
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
mehlhorn82d
Hide details for Mehlhorn, SchweitzerMehlhorn, Schweitzer
2010Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
MehlhornSchweitzer2010
Hide details for Mehlhorn, SeelMehlhorn, Seel
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Mehlhorn157
Hide details for Mehlhorn, Sharir, WelzlMehlhorn, 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
Mehlhorn93i
1992Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Mehlhorn92gz
Hide details for Mehlhorn, Shermer, YapMehlhorn, Shermer, Yap
1997Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Mehlhorn-et-al97
Hide details for Mehlhorn, SimonMehlhorn, Simon
1985Attachment IconIntersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542
mehlhorn85h
Hide details for Mehlhorn, Snelting (ed.)Mehlhorn, Snelting (ed.)
2000Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für Informatikmehlhorn2000o
Hide details for Mehlhorn, Sundar, UhrigMehlhorn, Sundar, Uhrig
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Mehlhorn-Uhrig97
1994Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Mehlhorn94i
Hide details for Mehlhorn, ThielMehlhorn, Thiel
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
MehlhornThiel2000
Hide details for Mehlhorn, Trajan (ed.)Mehlhorn, Trajan (ed.)
1991Effiziente Algorithmen - Tagungsberichtmehlhorn91f
Hide details for Mehlhorn, TsagarakisMehlhorn, Tsagarakis
1979On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
mehlhorn79i
Hide details for Mehlhorn, TsakalidisMehlhorn, Tsakalidis
1993Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Mehlhorn93c
1990Data Structures
In: Handbook of Theoretical Computer Science, 301-341
Mehlhorn$^+$90
1989Attachment IconData structuresmehlhorn90w
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
SICOMP::MehlhornT1986
1985Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
mehlhorn85d
1985Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
mehlhorn85d
Hide details for Mehlhorn, VishkinMehlhorn, Vishkin
1984Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
mehlhorn84n
1983Granularity of parallel memoriesmehlhorn83d
Hide details for Mehlhorn, Waldmann, WilhelmMehlhorn, Waldmann, Wilhelm
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
mehlhorn05
Hide details for Mehlhorn, YapMehlhorn, Yap
1991Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Mehlhorn91b
1988Constructive Hopf's theorem: or how to untangle closed planar curvesmehlhorn88m
1988Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
ICALP::MehlhornY1988
Hide details for Mehlhorn, ZiegelmannMehlhorn, 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
MehlhornZiegelmann2001
2000Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
MehlhornZiegelmann2000
Hide details for MehnertMehnert
2004External Memory Suffix Array Construction
Universität des Saarlandes
Mehnert/Diploma04
Hide details for MestreMestre
2010Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057
Mestre2010
2008Adaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160
conf/soda/Mestre2008
2008Lagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550
conf/stacs/Mestre2008
Hide details for MetzlerMetzler
1997Ergebnisüberprüfung bei Graphenalgorithmen
Universität des Saarlandes
Metzler97
Hide details for MeyerMeyer
2008On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560
DBLP:conf/stacs/Meyer08
2008On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy
Meyer_Swat08
2003Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134
Meyer2003
2002Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75
Meyer2002a
2002Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms
Universität des Saarlandes
Meyer2002diss
2001External Memory BFS on Undirected Graphs with Bounded Degree
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 87-88
Meyer2001a
2001Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, 343-351
Meyer2001c
2001Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 797-806
Meyer2001b
1995Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Meyer95
Hide details for Meyerhenke, SauerwaldMeyerhenke, Sauerwald
2012Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
MeyerhenkeS2012
Hide details for Meyer, SandersMeyer, Sanders
2003$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Meyer2003a
2000Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
MeySan2000
1998$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
MeyerSanders1998a
Hide details for Meyer, Sanders, Sibeyn (ed.)Meyer, Sanders, Sibeyn (ed.)
2003Algorithms for Memory HierarchiesMeySanSib2003
Hide details for Meyer, SibeynMeyer, Sibeyn
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
MeySib02
1998Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
MeyerSibeyn1998a
1995Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290
Meyer-Sibeyn95
Hide details for Meyer, WetzelMeyer, Wetzel
2006Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282
MeyerWetzel2006
Hide details for Meyer, ZehMeyer, Zeh
2006I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551
MeyZeh06
2003I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445
MeyZeh2003
Hide details for MichailMichail
2007Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132
Dimitrios2007
2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Michail2006
Hide details for Miklos, Giesen, PaulyMiklos, Giesen, Pauly
2007Attachment IconMedial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124
BaGiePa2007
Hide details for MillerMiller
1998Implementation and Experimental Evaluation of Dynamic Transitive Closure Algorithms
Universität des Saarlandes
Miller98
Hide details for Miller, ZaroliagisMiller, Zaroliagis
1997A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73
Miller-Zaroliagis97
Hide details for Milosavljevic, Morozov, SkrabaMilosavljevic, Morozov, Skraba
2011Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225
Milosavljevic2011Zigzag
Hide details for Misra, Philip, Raman, SaurabhMisra, Philip, Raman, Saurabh
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
MisraPhilipRamanSaurabh2012
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
MisraPhilipRamanSaurabh2011
2010Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
MisraPhilipRamanSaurabh2010
Hide details for Misra, Philip, Raman, Saurabh, SikdarMisra, Philip, Raman, Saurabh, Sikdar
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
MisraPhilipRamanSaurabhSikdar2012
2010Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
MisraPhilipRamanSaurabhSikdar2010
Hide details for Mitchell, Rote, Kettner (ed.)Mitchell, Rote, Kettner (ed.)
200521st Annual Symposium on Computational Geometry (SCG'05)Kettner2005SocgVideoProceedings
Hide details for Mnich, Philip, Saurabh, SuchyMnich, Philip, Saurabh, Suchy
2012Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
MnichPhilipSaurabhSuchy2012a
Hide details for Moehring, Skutella, StorkMoehring, Skutella, Stork
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
MoehringSkutellaStork2004
Hide details for Mörig, Scholz, Tscheuschner, BerberichMörig, Scholz, Tscheuschner, Berberich
2010Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
mstb-giae-impl-2010
Hide details for Mokbel, Aref, Elbassioni, KamelMokbel, Aref, Elbassioni, Kamel
2004Attachment IconScalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
Elbassioni2004f
Hide details for MolterMolter
2012ACO beats EA on a dynamic pseudo-Boolean function
Universität des Saarlandes
MolterMaster2012
Hide details for MoranMoran
2012Shattering extremal systems
Universität des Saarlandes
MoranMaster2012
Hide details for Mortensen, PettieMortensen, Pettie
2005The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
MortensenPettie2005
Hide details for Mourrain, Pion, Schmitt, Técourt, Tsigaridas, WolpertMourrain, Pion, Schmitt, Técourt, Tsigaridas, Wolpert
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
Kettner2007ECGBook
Hide details for MueckMueck
1998Implementation of Hammock Decomposition with Application to Shortest Path Problems
Universität des Saarlandes
Mueck98
Hide details for MüllerMüller
1999Parallel molecular dynamics simulations for synthetic polymers
Universität des Saarlandes
MüllerDiss99
1998Ein Simulator für Prozessornetzwerke
Universität des Saarlandes
MMueller98
1995Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere
Universität des Saarlandes
Müller95
Hide details for Müller, Perez-Gimenez, WormaldMüller, Perez-Gimenez, Wormald
2011Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
PerezGimenez2011
Hide details for Müller, Rüb, RüllingMüller, Rüb, Rülling
1996A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Müller-Rüb96
Hide details for Mütze, Rast, SpöhelMütze, Rast, Spöhel
2011Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Spoehel2011
Hide details for Mütze, SpöhelMütze, Spöhel
2011On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33
Spoehel2011d
2011On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
Spoehel2011b
Hide details for Mustafa, RayMustafa, Ray
2010Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
MustafaRay2010
2007Attachment IconAn Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141
NaRa07
Hide details for MutzelMutzel
2001An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080
M01
1999Zeichnen von Diagrammen - Theorie und Praxis
Universität des Saarlandes
Mutzel1999
1996An alternative method to crossing minimization on hierarchical graphs
In: Proceedings of the 4th Symposium on Graph Drawing (GD-96), 318-333
Mutzel96
1995A Polyhedral Approach to Planar Augmentation and Related Problems
In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507
Mutzel95
Hide details for Mutzel, EadesMutzel, Eades
1999Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26
EadesMutzel1999
Hide details for Mutzel, Gutwenger, Brockenauer, Fialko, Klau, Krüger, Ziegler, Näher, Alberts, Ambras, Koch, Jünger, Buchheim,Mutzel, Gutwenger, Brockenauer, Fialko, Klau, Krüger, Ziegler, Näher, Alberts, Ambras, Koch, Jünger, Buchheim, Leipert
1998AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
MGBFKKZNAAKJBL1998
Hide details for Mutzel, Odenthal, ScharbrodtMutzel, Odenthal, Scharbrodt
1998The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Mutzel-et-al-2-97
Hide details for Mutzel, WeiskircherMutzel, Weiskircher
1999Optimizing Over All Combinatorial Embeddings of a Planar Graph
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376
Weiskircher1999
1998Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Weiskircher1998
Hide details for Mutzel, ZieglerMutzel, Ziegler
2000The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
MZ00
1999The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134
MutzelZiegler1998
Hide details for Näher, MehlhornNäher, Mehlhorn
1990LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39
DBLP:conf/gi/NaherM90
1990LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5
Mehlhorn90b
Hide details for NaujoksNaujoks
2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
NaujoksPhD
2004A heuristic for solving interior point Methods exactly
Universität des Saarlandes
Naujoks/Diplom04
Hide details for NestNest
1998Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene
Universität des Saarlandes
Nest98
Hide details for NeukirchNeukirch
1994Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA
Universität des Saarlandes
Neukirch94
Hide details for NeumannNeumann
2011Implementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes
NeumannMaster2011
2008Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
NeuEul07
Hide details for Neumann, Haltner, Lehr, Kohlbacher, LenhofNeumann, Haltner, Lehr, Kohlbacher, Lenhof
1998Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549
NeumannHaltnerLehr1998
Hide details for Neumann, Kohlbacher, Haltner, Lenhof, LehrNeumann, Kohlbacher, Haltner, Lenhof, Lehr
2000Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233
NKH+2000
Hide details for Neumann, Oliveto, WittNeumann, Oliveto, Witt
2009Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
NeuOliWitGECCO2009
Hide details for Neumann, ReichelNeumann, Reichel
2008Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
NeuReiPPSN2008
Hide details for Neumann, Reichel, SkutellaNeumann, Reichel, Skutella
2011Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Neumann2011
2008Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
NeuReiSku2008
Hide details for Neumann, Sudholt, WittNeumann, Sudholt, Witt
2009Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
NeuSudWitSwarm2009
2009Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120
NSWACOchapter09
2008Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143
NeuSudWit2008
2007Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
NSWSLS2007
Hide details for Neumann, WegenerNeumann, Wegener
2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
NeuWegMST2007
Hide details for Neumann, WittNeumann, Witt
2010Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
NeumannWitt2010
2010Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational ComplexityBookNeumannWitt
2009Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Neumann2008
2008Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
NeuWitLion2008
2006Ant Colony Optimization and the Minimum Spanning Tree ProblemNeuWittMST2006
Hide details for Newo KenmogneNewo Kenmogne
2005Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
NewoDipl05
Hide details for Niedermeier, Reinhard, SandersNiedermeier, Reinhard, Sanders
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Sanders2002f
Hide details for NissenNissen
1998Graph Iterators: Decoupling Graph Structures from Algorithms
Universität des Saarlandes
Nissen98
Hide details for Nor, Hermelin, Charlat, Engelstadter, Reuter, DuronNor, Hermelin, Charlat, Engelstadter, Reuter, Duron
2010Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
HermelinCulex2010
Hide details for Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, SagotNor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Nor2012
Hide details for Nutov, PennNutov, Penn
2000On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Nutov/Penn/2000
Hide details for OberhauserOberhauser
1997Arithmetik der Transduktoren
Universität des Saarlandes
Oberhauser97
Hide details for Oliveto, Lehre, NeumannOliveto, Lehre, Neumann
2009Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462
LehNeuOliCEC2009
Hide details for OssamyOssamy
2002TSP Cuts Outside the Template Paradigm
Universität des Saarlandes
OssamyDipl02
Hide details for OstOst
1995Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes
Ost95
Hide details for OttOtt
2012Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes
OttMaster2012
Hide details for PaluchPaluch
2006Attachment IconA New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721
Paluch2006
Hide details for PanagiotouPanagiotou
2009Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744
Panagiotou2008
2009The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
BernasconiPanagiotouSteger2009
2009Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
PanagiotouSinhaProc2009
Hide details for Panagiotou, Coja-OghlanPanagiotou, Coja-Oghlan
2012Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907
ACO-P2012
Hide details for Panagiotou, Pourmiri, SauerwaldPanagiotou, Pourmiri, Sauerwald
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Pourmiri2013
Hide details for Panagiotou, SinhaPanagiotou, Sinha
2012Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Panagiotou2012b
Hide details for Panagiotou, Spöhel, Steger, ThomasPanagiotou, Spöhel, Steger, Thomas
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
SpoehelPST2013
2011Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Spoehel2011c
Hide details for Panagiotou, StegerPanagiotou, Steger
2011On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210
PanagiotouSteger2011
2010Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
PanagiotouStegerJournal2010
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
PanagiotouSteger2008
Hide details for Panconesi, Papatriantafilou, Tsigas, VitanyiPanconesi, Papatriantafilou, Tsigas, Vitanyi
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
ptrianta-tsigas98-1
Hide details for Papatriantafilou, TsigasPapatriantafilou, Tsigas
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
ptrianta-tsigas97-1
1995Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Papatr-Tsigas95
Hide details for Park, Lee, ChwaPark, Lee, Chwa
2001Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468
Leejha2001
2000Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526
Leejhd2000
Hide details for ParreiraParreira
2003Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
Master03/Parreira
2003On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes
Parreira03
Hide details for Pemmaraju, Raman, VaradarajanPemmaraju, Raman, Varadarajan
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Pemmaraju2011
Hide details for PettiePettie
2005Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
Pettie-sensitivity2005
2005Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183
Pettie2005
Hide details for Pettie, SandersPettie, Sanders
2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsPettieSanders2005
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
PettieSanders2004
Hide details for PhilipPhilip
2011Attachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
PhilipPhDThesis
2008Attachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
PhilipMScThesis2008
Hide details for Philip, Raman, SikdarPhilip, Raman, Sikdar
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
PhilipRamanSikdar2012
2009Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
PhilipRamanSikdar2009
Hide details for Philip, Raman, VillangerPhilip, Raman, Villanger
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
PhilipRamanVillanger2010
Hide details for PiskorskiPiskorski
1994Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes
Piskorski94
Hide details for PohlPohl
2006Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes
DiplPohl06
Hide details for PolzinPolzin
2003Algorithms for the Steiner Problem in Networks
Universität des Saarlandes
PolzinPhD03
Hide details for Polzin, Vahdati DaneshmandPolzin, Vahdati Daneshmand
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
Polzin2002-MSTH
2002Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
Polzin2002-ESA
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
PolzinVahdati2001a
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
PolzinVahdati2001b
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
PolzinVahdati2000
Hide details for Porkolab, KhachiyanPorkolab, Khachiyan
1997Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171
Porkolab97a
Hide details for PortzPortz
1994Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes
Portz94
Hide details for PotikoglouPotikoglou
1999Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes
Potikoglou99
Hide details for PouchkarevPouchkarev
2000ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes
Pouchkarev2000
Hide details for Pountourakis, VidaliPountourakis, Vidali
2010A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Vidali2010
Hide details for Preetham, Krithivasan, Rangan, SibeynPreetham, Krithivasan, Rangan, Sibeyn
1996Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Sibeyn-et-al96
Hide details for PriebePriebe
2001Average-case complexity of shortest-paths problems
Universität des Saarlandes
PriebeDiss01
Hide details for Pruhs, van Stee, UthaisombutPruhs, van Stee, Uthaisombut
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
vanStee2008h
Hide details for PyrgaPyrga
2010Algorithmic Game Theory and Networks
Universität des Saarlandes
PyrgaPhD2010
2005Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
PyrgaDipl05
Hide details for Pyrga, ChungPyrga, Chung
2009Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
Pyrga2009
Hide details for Pyrga, RayPyrga, Ray
2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Pyrga2008
Hide details for Pyrga, Schulz, Wagner, ZaroliagisPyrga, Schulz, Wagner, Zaroliagis
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Pyrga2007
Hide details for P. GaoP. Gao
2012Distribution of the number of spanning regular subgraphs in random graphsG6
2012Distributions of sparse spanning subgraphs in random graphsG4
2012Uniform generation of d-factors in dense host graphsG7
Hide details for Qian, Schalekamp, Williamson, van ZuylenQian, Schalekamp, Williamson, van Zuylen
2012On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
QianSWvZ12
Hide details for Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, EbnerRaidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.gecco2009
Hide details for Rajaraman, Richa, Vöcking, VuppuluriRajaraman, Richa, Vöcking, Vuppuluri
2001A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Voecking2001a
Hide details for RamosRamos
2001An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
Ramos00
2001Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
MaRaSu00
2000Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299
Ramos2000c
2000Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
Ramos2000d
1999On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
Ramos1999
1997Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
Ramos97
1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Ramos97a
Hide details for Ramos, Amato, GoodrichRamos, Amato, Goodrich
2001A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
AmGoRa01
2000Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Ramos2000e
Hide details for RaschRasch
1994Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Rasch94
Hide details for Rathe, Sanders, KnightRathe, Sanders, Knight
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
RatSanKni99
Hide details for RauRau
1997Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes
Rau97
Hide details for RaufRauf
2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
RaufDiss04
Hide details for RayRay
2004Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
Ray/Diploma04
2004Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
RayDiss04
2002An O(nlogn) Algorithm for Classifying Identical CurvesRahul2002d
Hide details for Ray, MustafaRay, Mustafa
2007Attachment IconWeak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244
NaRa07b
Hide details for Ray, Smid, Lange, WendtRay, Smid, Lange, Wendt
2002Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Rahul2001
Hide details for ReichelReichel
2006Attachment IconCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
DissReichel06
2001Attachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
ReichelDipl01
Hide details for ReinertReinert
1999A polyhedral approach to sequence alignment problems
Universität des Saarlandes
ReinertDiss99
1994Deferred Data Structuring
Universität des Saarlandes
Reinert94
Hide details for Reinert, Lenhof, Mehlhorn, Mutzel, KececiogluReinert, Lenhof, Mehlhorn, Mutzel, Kececioglu
1997Attachment IconA Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250
Lenhof-et-al-1-97
Hide details for ReinstädtlerReinstädtler
1998Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Reinstaedtler-Dipl98
Hide details for RiegerRieger
1995Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Rieger95
Hide details for RizkallahRizkallah
2011Attachment IconGlivenko and Kuroda for Simple Type TheoryBrownRizkallah2011
2011Maximum Cardinality Matching
In: Archive of Formal Proofs,
rizkallah:2011:matching
Hide details for RöhrigRöhrig
1998Tree Decomposition: A Feasibility Study
Universität des Saarlandes
Roehrig1998Diplom
Hide details for RottmannRottmann
1996Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes
Rottmann96
Hide details for RübRüb
1998On Batcher's Merge Sorts as Parallel Sorting Algorithms
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 410-420
Rüb98
1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Rueb-1-97
1995On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Rueb95
Hide details for RuppertRuppert
1999Polygontriangulierung in Linearzeit
Universität des Saarlandes
Ruppert1999
Hide details for Rusinov, SchweitzerRusinov, Schweitzer
2010Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
RusinovSchweitzer2010
Hide details for SaboSabo
1999Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Sabo1999
Hide details for SagraloffSagraloff
2012Exaktes geometrisches RechnenSagraloffMPGJahrbuch2012
2012When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304
Sagraloff_ISSAC_2012
2011When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
S:NEWDSC:2011
2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Sagraloff-BitstreamPrecision2011
2010On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Sagraloff-BitstreamComplexity2010a
Hide details for Sagraloff, Kerber, HemmerSagraloff, Kerber, Hemmer
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
SKH-CCRI-2009
Hide details for Sagraloff, YapSagraloff, Yap
2011A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360
SagraloffYap:CEVAL:2011
Hide details for Saha, Saptharishi, SaxenaSaha, Saptharishi, Saxena
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
SSS12
Hide details for SandersSanders
2004Algorithms for Scalable Storage Servers
In: SOFSEM 2004 : theory and practice of computer science ; 30th Conference on Current Trends in Theory and Practice of Computer Science, 82-101
Sanders2004a
2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
SandersWinkel2004
2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Sanders2003
2003Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
PS03
2002Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Sanders2002c
2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Sanders2002d
2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Sanders2002i
2001Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76
San2001a
2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Sanders2000b
2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Sanders2000
1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
San99c
1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Sanders1999
1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
San99d
1999Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
San99e
1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
San99a
1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
San98c
1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
San98d
1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Sand98a
1998Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
San98b
Hide details for Sanders, Egner, KorstSanders, Egner, Korst
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
SanEgnKor2000
Hide details for Sanders, Egner, TolhuizenSanders, Egner, Tolhuizen
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
SET03
Hide details for Sanders, PettieSanders, Pettie
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
SandersPettie2004
Hide details for Sanders, Reussner, Prechelt, MüllerSanders, Reussner, Prechelt, Müller
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
RSPM98
Hide details for Sanders, SibeynSanders, Sibeyn
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
SanSib03
2000A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
SanSib2000
Hide details for Sanders, Singler, van SteeSanders, Singler, van Stee
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
SaSiSt13
Hide details for Sanders, Sivadasan, SkutellaSanders, Sivadasan, Skutella
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Sivadasan2009
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Sivadasan2004-2
Hide details for Sanders, Solis-ObaSanders, Solis-Oba
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
SanSol2001
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Sanders2000a
Hide details for Sanders, SteurerSanders, Steurer
2005An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906
SanSte2005
Hide details for Sanders, Takkula, WedelinSanders, Takkula, Wedelin
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
San99b
Hide details for Sanders, TräffSanders, Träff
2002The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
Sanders2002
Hide details for Sanders, VöckingSanders, Vöcking
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
SanVoe03
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Sanders2002g
Hide details for Sanders, Vollmar, WorschSanders, Vollmar, Worsch
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Sanders2002e
Hide details for Sauerwald, StaufferSauerwald, Stauffer
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Sauerwald2010
Hide details for Sauerwald, SunSauerwald, Sun
2012Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Sun2012c
Hide details for SchäferSchäfer
2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Schäfer04
2000Weighted Matchings in General Graphs
Universität des Saarlandes
Schaefer2000
Hide details for Schäfer, SivadasanSchäfer, Sivadasan
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Sivadasan2004
Hide details for Schalekamp, Williamson, van ZuylenSchalekamp, Williamson, van Zuylen
2012A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
SchalekampWvZ12
Hide details for SchanneSchanne
2001Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
SchanneDipl01
Hide details for SchilzSchilz
2000Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
SchilzPhD2000
Hide details for SchirraSchirra
2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Schirra2000
1999A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176
Schirra1999a
1998Computational Geometry: Theory and Implementation
Universität des Saarlandes
Schirra_habil
1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Schirra97a
Hide details for SchmidtSchmidt
2013A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Schmidt2013b
2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Schmidt2013a
2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Schmidt2013
2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeSchmidt2013
2012Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Schmidt2012b
2012Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Schmidt2012
Hide details for Schmidt, ValtrSchmidt, Valtr
2012Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Schmidt2012a
Hide details for SchmittSchmitt
2006Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
BachSchmitt06
2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Schmitt2005
2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorSchmitt04b
2004Improved separation bounds for the diamond operatorSchmitt04a
2003Common Subexpression Search in LEDA_realss-cssl-03
2003The Diamond Operator for Real Algebraic Numberss-doran-03
Hide details for Schmitt, FousseSchmitt, Fousse
2004Attachment IconA comparison of polynomial evaluation schemesSchmittFoussee2004
Hide details for Schmitt, ZimmerSchmitt, Zimmer
2003Elliptic Curves : A Computational ApproachSchmitt2003
Hide details for SchmitzSchmitz
1995Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Schmitz95
Hide details for Schnorr, SubramanianSchnorr, Subramanian
1998Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231
crs98c
Hide details for Schömer, Reichel, Warken, LennerzSchömer, Reichel, Warken, Lennerz
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
SRWLSM02
Hide details for Schömer, ThielSchömer, Thiel
1995Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Schoemer-Thiel95
Hide details for Schömer, WolpertSchömer, Wolpert
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
sw-eeaccaq-05
Hide details for SchröderSchröder
1998Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Schröder98
Hide details for SchulteSchulte
2001Exaktes Lösen von Linearen Programmen
Universität des Saarlandes
SchulteDipl01
Hide details for SchultesSchultes
2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
SchultesDipl05
Hide details for SchwarzeneckerSchwarzenecker
1995Ein NP-schweres Plazierungsproblem
Universität des Saarlandes
Schwarzenecker95
Hide details for Schwarz, Karrenbauer, Schehr, RiegerSchwarz, Karrenbauer, Schehr, Rieger
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Schwarzetal2009
Hide details for SchweitzerSchweitzer
2009Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
SchweitzerPhD2009
2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Schweitzer2008
Hide details for Schweitzer, SchweitzerSchweitzer, Schweitzer
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
SchweitzerSchweitzer2010
Hide details for Schwerdt, Smid, SchirraSchwerdt, Smid, Schirra
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Schirra97b
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Schirra97c
Hide details for SeelSeel
2001Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
SeelDiss01
1994Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Seel94
Hide details for SeidelSeidel
1997Paralleles List Ranking
Universität des Saarlandes
TSeidel97
Hide details for Seidel, WolpertSeidel, Wolpert
2005On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
sw-ectrac-05
Hide details for SeidenSeiden
2000Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Seiden2000
1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Seiden1999
Hide details for SemeloglouSemeloglou
2000Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Semeloglou2000
Hide details for SharmaSharma
2008Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Sharma2008
Hide details for Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, BorgwardtShervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Shervashidze2011
Hide details for Shervashidze, Vishwanathan, Petri, Mehlhorn, BorgwardtShervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Graphlets
Hide details for SibeynSibeyn
2000Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Sibeyn2000
1999Better Deterministic Routing on Meshes
In: Proceedings of the 13th International Parallel Processing Symposium, and 10th Symposium on Parallel and Distributed Processing (IPPS/SPDP-99), 420-425
F.Sibeyn-IPPS-1999

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