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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

Login to this database


 

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

#YearTitleType
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
1
Hide details for Megow, Verschae [Verschae]Megow, Verschae [Verschae]
2013Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756
Proceedings Article
4
Hide details for Mehlhorn (ed.) [-]Mehlhorn (ed.) [-]
1998Fundamentals - Foundations of Computer Science : Proceedings of the XV. IFIP World Computer CongressProceedings
1989Proceedings of the fifth annual symposium on Computational geometry
1989 (SCG '89)
Proceedings
1987Workshop über Komplexitätstheorie, Effiziente Algorithmen und DatenstrukturenProceedings
1985Theoretical aspects of computer science (STACS-85) : 2nd annual symposiumProceedings
64
Hide details for Mehlhorn [-]Mehlhorn [-]
2007Attachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Proceedings Article
2005Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532
Proceedings Article
2001Attachment IconA Remark on the Sign Variation Method for Real Root IsolationUnpublished/Draft
2001Attachment IconFrom Algorithm to Program to Software Library
In: Informatics : 10 years back, 10 years ahead, 268-273
Part of a Book
1999Ten Years of LEDA Some Thoughts (Abstract)
In: Algorithm engineering (WAE-99) : 3rd International Workshop, 14-14
Proceedings Article
1999The Engineering of Some Bipartite Matching Programs
In: Foundations of software technology and theoretical computer science : 19th conference, 446-449
Proceedings Article
1998Attachment IconAmortisierte Analyse
In: Prinzipien des Algorithmenentwurfs, 91-102
Part of a Book
1996Position Paper for Panel Discussion
In: Applied Computational Geormetry, Towards Geometric Engineering, FCRC'96 Workshop, WACG'96, Selected Papers, 51-52
Proceedings Article
1995Guest Editor's Foreword
In: Discrete and Computational Geometry [14], 363-363
Journal Article
1988Attachment IconA faster approximation algorithm for the Steiner problem in graphs
In: Information Processing Letters [27], 125-128
Journal Article
1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
1987A Faster Approximation Algorithm for the Steiner Problem in GraphsReport
1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
1986Attachment IconÜber Verdrahtungsalgorithmen
In: Informatik Spektrum [9], 227-234
Journal Article
1984Channel Routing in Knock-Knee Mode: Simplified Algorithms and ProofReport
1984Data structures and algorithms. Volume 1 : Sorting and searchingBook
1984Data structures and algorithms. Volume 2 : Graph algorithms and NP-completenessBook
1984Data structures and algorithms. Volume 3 : Multi-dimensional searching and computational geometryBook
1984On Optimal VLSI-Circuits for the Basic Arithmetic Functions
In: 9. Colloquium on Trees in Algebra and Programming (CAAP'84), 23-30
Proceedings Article
1984Über Verdrahtungsalgorithmen
In: GI Jahrestagung (Fachgespräche), 79-89
Proceedings Article
1984$AT^2$-optimal VLSI integer division and integer square rooting
In: Integration, the VLSI Journal [2], 163-167
Journal Article
1983$AT^2$-optimal VLSI for integer division and integer square rootingReport
1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
Journal Article
1982Attachment IconOn the Program Size of Perfect and Universal Hash Functions
In: 23th Annual Symposium on Foundations of Computer Science (FOCS 1982), 170-175
Proceedings Article
1981Attachment IconArbitrary Weight Changes in Dynamic Trees
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO [15], 183-211
Journal Article
1981Attachment IconLower bounds on the efficiency of transforming static data structures into dynamic structures
In: Mathematical Systems Theory [15], 1-16
Journal Article
1980A New Data Structure for Representing Sorted Lists
In: Graph-theoretic concepts in computer science (WG-80) : 6th international workshop, 90-112
Proceedings Article
1980Attachment IconAn Efficient Algorithm for Constructing Nearly Optimal Prefix Codes
In: IEEE Transactions on Information Theory [26], 513-517
Journal Article
1980Lower bounds on the efficiency of transforming static data structures into dynamic structuresReport
1980Attachment IconPebbling Mountain Ranges and its Application of DCFL-Recognition
In: Automata, languages and programming (ICALP-80) : 7th annual international colloquium, 422-435
Proceedings Article
1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Journal Article
1979Attachment IconDynamic data structures
In: Mathematical Centre Tracts [108], 71-96
Journal Article
1979Attachment IconKonzepte der Komplexitätstheorie illustriert am Beispiel des Sortierens
In: GI - 9. Jahrestagung, 16-22
Proceedings Article
1979Attachment IconParsing Macro Grammars Top Down
In: Information and Control [40], 123-143
Journal Article
1979Attachment IconSearching, Sorting and Information Theory
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 131-145
Proceedings Article
1979Attachment IconSome Remarks on Boolean Sums
In: Acta Informatica [12], 371-375
Journal Article
1979Some Remarks on Boolean Sums
In: Mathematical foundations of computer science (MFCS-79) : 8th symposium, 375-380
Proceedings Article
1979Attachment IconSorting Presorted Files
In: Theoretical Computer Science, 4th GI-Conference, 199-212
Proceedings Article
1978An efficient algorithm for constructing nearly optimal prefix codesReport
1978Arbitrary Weight Changes in Dynamic TreesReport
1978Effiziente Algorithmen: Ein BeispielReport
1978Attachment IconEffiziente Algorithmen: Ein Beispiel
In: Informatik Spektrum [1], 81-89
Journal Article
1978Sorting Presorted FilesReport
1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
1977Dynamic Binary Search
In: Automata, Languages and Programming : Fourth Colloquium (ICALP-77), 323-336
Proceedings Article
1977Effiziente AlgorithmenBook
1976An improved lower bound on the formula complexity of context-free recognitionReport
1976Attachment IconAn Improved Lower Bound on the Formula Complexity of Context-Free Recognition
In: Elektronische Informationsverarbeitung und Kybernetik [12], 523-524
Journal Article
1976An O(n log n) lower bound for the synchronous circuit size of integer multiplicationReport
1976Attachment IconBracket-languages are recognizable in logarithmic space
In: Information Processing Letters [5], 168-170
Journal Article
1976Dynamic Binary SearchReport
1976Dynamic Binary Search Trees : Extended AbstractsReport
1976Attachment IconPolynomial and abstract subrecursive classes
In: Journal of Computer and System Sciences [12], 147-178
Journal Article
1975A game on graphsReport
1975Best possible bounds for the weighted path length of optimum binary search trees
In: Automata Theory and Formal Languages, 2nd GI Conference, 31-41
Proceedings Article
1975Bracket-Languages are Recognizable in Logarithmic SpaceReport
1975Attachment IconNearly Optimal Binary Search Trees
In: Acta Informatica [5], 287-295
Journal Article
1974Attachment IconPolynomial and abstract subrecursive classes
Cornell University
Thesis - PhD thesis
1974Polynomial and abstract subrecursive classes
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 14
Report
1974Attachment IconPolynomial and Abstract Subrecursive Classes
In: Conference Record of Sixth Annual ACM Symposium on Theory of computing (STOC-74), 96-109
In: Informatik Spektrum, 96-109
Proceedings Article
1974Attachment IconThe 'almost all' theory of subrecursive degrees is decidable
In: Automata, languages and programming : 2nd colloquium (ICALP-74), 317-325
Proceedings Article
1973Attachment IconOn the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 190-196
Proceedings Article
1973On the Size of Sets of Computable Functions
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 22
Report
1973The "almost all" theory of subrecursive degrees is decidable
In: 14th Annual Symposium on Switching & Automata Theory (SSAT-73), 25
Report
1
Hide details for Mehlhorn [Aggarwal]Mehlhorn [Aggarwal]
1999The Engineering of Some Bipartite Matching Programs
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 1-3
Proceedings Article
1
Hide details for Mehlhorn [Akl, Dehne, Sack, Santoro]Mehlhorn [Akl, Dehne, Sack, Santoro]
1995Experiences with the implementation of geometric algorithms
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 518-518
Proceedings Article
1
Hide details for Mehlhorn [Calamoneri, Finocchi, Italiano]Mehlhorn [Calamoneri, Finocchi, Italiano]
2006Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2
Proceedings Article
1
Hide details for Mehlhorn [Dress, Xu, Zhu]Mehlhorn [Dress, Xu, Zhu]
2007Attachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Proceedings Article
1
Hide details for Mehlhorn [Fukuda, Van der Hoeven, Joswig, Takayama]Mehlhorn [Fukuda, Van der Hoeven, Joswig, Takayama]
2010Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Proceedings Article
1
Hide details for Mehlhorn [Jansen, Margraf, Mastrolli, Rolim]Mehlhorn [Jansen, Margraf, Mastrolli, Rolim]
2003Attachment IconThe Reliable Algorithmic Software Challenge RASC
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 222-222
Proceedings Article
1
Hide details for Mehlhorn [Klein, Six, Wegner]Mehlhorn [Klein, Six, Wegner]
2003Attachment IconThe reliable algorithmic software challenge RASC : dedicated to Thomas Ottmann on the occassion of his 60th birthday
In: Computer Science in Perspective : essays dedicated to Thomas Ottmann, 255-263
Part of a Book
1
Hide details for Mehlhorn [Lipitakis]Mehlhorn [Lipitakis]
2002Exact geometric computation
In: HERCMA 2001 : proceedings of the 5th Hellenic-European Conference on Computer Mathematics and its Applications (HERCMA-01), 87-87
Proceedings Article
1
Hide details for Mehlhorn [Montanari, Rolim, Welzl]Mehlhorn [Montanari, Rolim, Welzl]
2000Attachment IconConstraint Programming and Graph Algorithms
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 571-575
Proceedings Article
1
Hide details for Mehlhorn [Shyamasundar]Mehlhorn [Shyamasundar]
1992Recent Developments in Algorithms for the Maximum Flow Problem (Abstract)
In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1992), 404-404
Proceedings Article
1
Hide details for Mehlhorn [Zimmermann]Mehlhorn [Zimmermann]
1988SFB 124: VLSI-Entwurfsmethoden und Parallelität
In: GI - 18. Jahrestagung II, Vernetzte and komplexe Informatik-Systems, 3-29
Proceedings Article
1
Hide details for Mehlhorn []Mehlhorn []
1996The LEDA Platform of Combinatorial and Geometric Computing
In: Proceedings of Conference on Computing: The Australian Theory Symposium, 126-126
Proceedings Article
1
Hide details for Mehlhorn, Burnikel, Fleischer, Schirra [-]Mehlhorn, Burnikel, Fleischer, Schirra [-]
1997A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709
Proceedings Article
1
Hide details for Mehlhorn, Claus, Thomas [Mehlhorn, Wilhelm]Mehlhorn, Claus, Thomas [Mehlhorn, Wilhelm]
1996Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
Proceedings Article
1
Hide details for Mehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, Spinrad [-]Mehlhorn, Eigenwillig, Kaligosi, Kratsch, McConnell, Meyer, Spinrad [-]
2005Certifying Algorithms (draft)Unpublished/Draft
2
Hide details for Mehlhorn, Galil [-]Mehlhorn, Galil [-]
1976Attachment IconMonotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111
Journal Article
1975Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319
Proceedings Article
1
Hide details for Mehlhorn, Kavitha, Hariharan [Kavitha, Hariharan]Mehlhorn, Kavitha, Hariharan [Kavitha, Hariharan]
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
1
Hide details for Mehlhorn, Meiser, O'Dunlaing [-]Mehlhorn, Meiser, O'Dunlaing [-]
1989Attachment IconOn the construction of abstract Voronoi diagramsReport
1
Hide details for Mehlhorn, Meiser, Ó'Dúnlaing [, ]Mehlhorn, Meiser, Ó'Dúnlaing [, ]
1990On the Construction of Abstract Voronoi Diagrams
In: Theoretical aspects of computer science (STACS-90) : 7th annual symposium, 227-239
Proceedings Article
1
Hide details for Mehlhorn, Meiser, O'Dúnlaing []Mehlhorn, Meiser, O'Dúnlaing []
1991On the construction of abstract Voronoi diagrams
In: Discrete & Computational Geometry [6], 211-224
Journal Article
1
Hide details for Mehlhorn, Meiser, Rasch [Meiser, Rasch]Mehlhorn, Meiser, Rasch [Meiser, Rasch]
2001Attachment IconFurthest site abstract Voronoi diagrams
In: International Journal of Computational Geometry & Applications [11], 583-616
Journal Article
1
Hide details for Mehlhorn, Meyer [Möhring, Raman]Mehlhorn, Meyer [Möhring, Raman]
2002Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
Proceedings Article
4
Hide details for Mehlhorn, Michail [-]Mehlhorn, Michail [-]
2009Attachment IconMinimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13
Electronic Journal Article
2007Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
2006Attachment IconImplementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14
Electronic Journal Article
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
1
Hide details for Mehlhorn, Michail [Nikoletseas]Mehlhorn, Michail [Nikoletseas]
2005Attachment IconImplementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43
Proceedings Article
1
Hide details for Mehlhorn, Michail, Telikepalli, Irving, Paluch [Irving, Paluch]Mehlhorn, Michail, Telikepalli, Irving, Paluch [Irving, Paluch]
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
2
Hide details for Mehlhorn, Müller, Näher, Schirra, Seel, Uhrig, Ziegler [-]Mehlhorn, Müller, Näher, Schirra, Seel, Uhrig, Ziegler [-]
1998A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1997A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
1
Hide details for Mehlhorn, Mutzel [-]Mehlhorn, Mutzel [-]
1996Attachment IconOn the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
In: Algorithmica [16], 233-242
Journal Article
6
Hide details for Mehlhorn, Näher [-]Mehlhorn, Näher [-]
1998From Algorithms to Working Programs on the Use of Program Checking in LEDA
In: Fundamentals - foundations of computer science : XV. IFIP world computer congress, 81-88
Proceedings Article
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
1990A faster compaction algorithm with automatic jog insertion
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 158-166
Journal Article
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Journal Article
1987A faster compaction algorithm with automatic jog insertionReport
1986Dynamic fractional cascadingReport
1
Hide details for Mehlhorn, Näher [Brim, Gruska, Zlatuska]Mehlhorn, Näher [Brim, Gruska, Zlatuska]
1998Attachment IconFrom Algorithms to Working Programs: On the Use of Program Checking in LEDA
In: Mathematical foundations of computer science (MFCS-98) : 23rd international symposium, 84-93
Proceedings Article
2
Hide details for Mehlhorn, Näher [Näher]Mehlhorn, Näher [Näher]
1999LEDA: a platform for combinatorial and geometric computingBook
1995Attachment IconLEDA: A Platform for Combinatorial and Geometric Computing
In: Communications of the ACM [38], 96-102
Journal Article
1
Hide details for Mehlhorn, Näher [Pehrson, Simon]Mehlhorn, Näher [Pehrson, Simon]
1994Attachment IconThe Implementation of Geometric Algorithms
In: Technology and foundations : Information Processing '94 ; proceedings of the IFIP 13th World Computer Congress, 223-231
Proceedings Article
4
Hide details for Mehlhorn, Näher []Mehlhorn, Näher []
1992Attachment IconAlgorithm Design and Software Libraries: Recent Developments in the LEDA Project
In: Proceedings of the IFIP 12th World Computer Congress. Volume 1: Algorithms, Software, Architecture, 493-508
Proceedings Article
1990Attachment IconDynamic Fractional Cascading
In: Algorithmica [5], 215-241
Journal Article
1989A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Proceedings Article
1989LEDA: A library of efficient data types and algorithms
In: Mathematical foundations of computer science (MFCS-89) : 14th international symposium, 88-106
Proceedings Article
2
Hide details for Mehlhorn, Näher, Alt [-]Mehlhorn, Näher, Alt [-]
1987A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488
Proceedings Article
1986A Lower Bound for the Complexity of the Union-Split-Find ProblemReport
1
Hide details for Mehlhorn, Näher, Alt []Mehlhorn, Näher, Alt []
1988A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102
Journal Article
1
Hide details for Mehlhorn, Näher, Nievergelt []Mehlhorn, Näher, Nievergelt []
1994Attachment IconIntroduction
In: Journal of Symbolic Computation [17], 295-295
Journal Article
2
Hide details for Mehlhorn, Näher, Rauch []Mehlhorn, Näher, Rauch []
1990On the Complexity of a Game Related to the Dictionary Problem
In: SIAM Journal on Computing [19], 902-906
Journal Article
1989On the Complexity of a Game Related to the Dictionary Problem
In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), 546-548
Proceedings Article
1
Hide details for Mehlhorn, Näher, Schilz, Schirra, Seel, Seidel, Uhrig [Näher, Seidel]Mehlhorn, Näher, Schilz, Schirra, Seel, Seidel, Uhrig [Näher, Seidel]
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1
Hide details for Mehlhorn, Näher, Schweitzer [McConnell]Mehlhorn, Näher, Schweitzer [McConnell]
2011Certifying algorithms
In: Computer Science Review [5], 119-161
Journal Article
1
Hide details for Mehlhorn, Näher, Seel, Seidel, Schilz, Schirra, Uhrig [Näher, Seidel]Mehlhorn, Näher, Seel, Seidel, Schilz, Schirra, Uhrig [Näher, Seidel]
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
3
Hide details for Mehlhorn, Näher, Uhrig [-]Mehlhorn, Näher, Uhrig [-]
1997The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16
Proceedings Article
1996The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
Proceedings Article
1990Attachment IconHidden line elimination for isooriented rectanglesReport
1
Hide details for Mehlhorn, Näher, Uhrig []Mehlhorn, Näher, Uhrig []
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
2
Hide details for Mehlhorn, Neumann, Schmidt [-]Mehlhorn, Neumann, Schmidt [-]
2013Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369
Proceedings Article
2012Attachment IconCertifying 3-Edge-ConnectivityUnpublished/Draft
2
Hide details for Mehlhorn, Osbild, Sagraloff [-]Mehlhorn, Osbild, Sagraloff [-]
2011A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Journal Article
2008A General Approach to the Analysis of Controlled Perturbation AlgorithmsReport
1
Hide details for Mehlhorn, Osbild, Sagraloff [Bugliesi, Preneel, Sassone, Wegener]Mehlhorn, Osbild, Sagraloff [Bugliesi, Preneel, Sassone, Wegener]
2006Attachment IconReliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310
Proceedings Article
2
Hide details for Mehlhorn, Overmars [-]Mehlhorn, Overmars [-]
1981Attachment IconOptimal dynamization of decomposable searching problems
In: Information Processing Letters [12], 93-98
Journal Article
1980Optimal dynamization of decomposable searching problemsReport
1
Hide details for Mehlhorn, Paul [Paul]Mehlhorn, Paul [Paul]
1989Two Versus One Index Register and Modifiable Versus Non-modifiable Programs
In: Automata, languages and programming (ICALP-89) : 16th international colloquium, 603-609
Proceedings Article
1
Hide details for Mehlhorn, Paul, Uhrig [Paul]Mehlhorn, Paul, Uhrig [Paul]
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Journal Article
9
Hide details for Mehlhorn, Preparata [-]Mehlhorn, Preparata [-]
1987Attachment IconArea-Time Optimal Division for $T=\Omega((\log n)^1+\epsilon)$
In: Information and Computation [72], 270-282
Journal Article
1986Area-time Optimal Division for T=Omega(log n)$^1+epsilon$"
In: STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, 341-352
Proceedings Article
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Journal Article
1985Area-time optimal division for T=omega((logn)1+epsilon)Report
1984Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
In: Automata, languages and programming (ICALP-84) : 11th colloquium, 347-357
Proceedings Article
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeReport
1983Attachment IconArea-Time Optimal VLSI Integer Mutliplier with Minimum Computation Time
In: Information and Control [58], 137-156
Journal Article
1983Routing through a RectangleReport
1983$AT^2$-optimal VLSI multipliers with minimum computation time
In: Information & Control [58], 137-196
Journal Article
1
Hide details for Mehlhorn, Preparata, Sarrafzadeh [-]Mehlhorn, Preparata, Sarrafzadeh [-]
1986Attachment IconChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs
In: Algorithmica [1], 213-221
Journal Article
1
Hide details for Mehlhorn, Priebe [-]Mehlhorn, Priebe [-]
1997On the All-Pairs Shortest-Path Algorithm of Moffat and Takaoka
In: Random Structures Algorithms [10], 205-220
Journal Article
1
Hide details for Mehlhorn, Priebe [Spirakis]Mehlhorn, Priebe [Spirakis]
1995On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
In: Algorithms - ESA'95: 3rd Annual European Symposium, 185-198
Proceedings Article
1
Hide details for Mehlhorn, Priebe, Schäfer, Sivadasan [-]Mehlhorn, Priebe, Schäfer, Sivadasan [-]
2002Attachment IconAll-Pairs Shortest-Paths Computation in the Presence of Negative Cycles
In: Information Processing Letters [81], 341-343
Journal Article
1
Hide details for Mehlhorn, Ray [-]Mehlhorn, Ray [-]
2010Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Journal Article
2
Hide details for Mehlhorn, Rülling [-]Mehlhorn, Rülling [-]
1990Attachment IconCompaction on the torus
In: IEEE Transactions on CAD of Integrated Circuits and Systems [9], 389-397
Journal Article
1988Compaction on the TorusReport
1
Hide details for Mehlhorn, Rülling []Mehlhorn, Rülling []
1988Compaction on the Torus
In: VLSI algorithms and architectures : 3rd Aegean Workshop on Computing, AWOC 88, 212-225
Proceedings Article
1
Hide details for Mehlhorn, Sack [Sack]Mehlhorn, Sack [Sack]
2000Editorial
In: Computational Geometry [17], 1-2
Journal Article
1
Hide details for Mehlhorn, Sack, Urrutia [-]Mehlhorn, Sack, Urrutia [-]
1999Editorial
In: Computational Geometry [12], 153-154
Journal Article
3
Hide details for Mehlhorn, Sagraloff [-]Mehlhorn, Sagraloff [-]
2011A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Journal Article
2009Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254
Proceedings Article
2008A deterministic Bitstream Descartes AlgorithmReport
1
Hide details for Mehlhorn, Sagraloff, Wang [-]Mehlhorn, Sagraloff, Wang [-]
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
1
Hide details for Mehlhorn, Sanders [-]Mehlhorn, Sanders [-]
2003Attachment IconScanning Multiple Sequences via Cache Memory
In: Algorithmica [35], 75-93
Journal Article
1
Hide details for Mehlhorn, Sanders [Sanders]Mehlhorn, Sanders [Sanders]
2008Algorithms and Data Structures: The Basic ToolboxBook
1
Hide details for Mehlhorn, Schäfer [-]Mehlhorn, Schäfer [-]
2002Attachment IconImplementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
Electronic Journal Article
1
Hide details for Mehlhorn, Schäfer [Meyer auf der Heide]Mehlhorn, Schäfer [Meyer auf der Heide]
2001A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253
Proceedings Article
1
Hide details for Mehlhorn, Schäfer [Näher, Wagner]Mehlhorn, Schäfer [Näher, Wagner]
2000Attachment IconImplementation of $O(nm \log n)$ weighted matchings: The power of data structures
In: 4th International Workshop on Algorithm Engineering, 23-38
Proceedings Article
1
Hide details for Mehlhorn, Schirra [Alefeld, Rohn, Rump, Yamamoto]Mehlhorn, Schirra [Alefeld, Rohn, Rump, Yamamoto]
2001Attachment IconExact computation with leda_real - Theory and geometric applications
In: Symbolic Algebraic Methods and Verification Methods, 163-172
Part of a Book
1
Hide details for Mehlhorn, Schirra [Laurent, Sablonnière, Schumaker]Mehlhorn, Schirra [Laurent, Sablonnière, Schumaker]
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
4
Hide details for Mehlhorn, Schmidt [-]Mehlhorn, Schmidt [-]
1986Attachment IconOn BF-orderable graphs
In: Discrete Applied Mathematics [15], 315-327
Journal Article
1985On BF-perfect graphsReport
1983A Single Shortest Path Algorithm for Graphs with Separators
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 302-309
Proceedings Article
1982Las Vegas Is better than Determinism in VLSI and Distributed Computing
In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), 330-337
Proceedings Article
1
Hide details for Mehlhorn, Schweitzer [Lee, Chen, Ying]Mehlhorn, Schweitzer [Lee, Chen, Ying]
2010Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Proceedings Article
1
Hide details for Mehlhorn, Seel [Seel]Mehlhorn, Seel [Seel]
2003Attachment IconInfimaximal frames: A technique for making lines look like segments
In: International Journal of Computational Geometry & Applications [13], 241-255
Journal Article
1
Hide details for Mehlhorn, Sharir, Welzl [-]Mehlhorn, Sharir, Welzl [-]
1993Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Journal Article
1
Hide details for Mehlhorn, Sharir, Welzl [, ]Mehlhorn, Sharir, Welzl [, ]
1992Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1
Hide details for Mehlhorn, Shermer, Yap [Shermer, Yap]Mehlhorn, Shermer, Yap [Shermer, Yap]
1997Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
1
Hide details for Mehlhorn, Simon [-]Mehlhorn, Simon [-]
1985Attachment IconIntersecting two polyhedra one of which is convex
In: FCT '85: Fundamentals of Computation Theory, 534-542
Proceedings Article
1
Hide details for Mehlhorn, Snelting (ed.) [-]Mehlhorn, Snelting (ed.) [-]
2000Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für InformatikProceedings
1
Hide details for Mehlhorn, Sundar, Uhrig [Sundar]Mehlhorn, Sundar, Uhrig [Sundar]
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
1
Hide details for Mehlhorn, Sundar, Uhrig []Mehlhorn, Sundar, Uhrig []
1994Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Proceedings Article
1
Hide details for Mehlhorn, Thiel [Dechter]Mehlhorn, Thiel [Dechter]
2000Attachment IconFaster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319
Proceedings Article
1
Hide details for Mehlhorn, Trajan (ed.) [-]Mehlhorn, Trajan (ed.) [-]
1991Effiziente Algorithmen - TagungsberichtProceedings
1
Hide details for Mehlhorn, Tsagarakis [-]Mehlhorn, Tsagarakis [-]
1979On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
Journal Article
5
Hide details for Mehlhorn, Tsakalidis [-]Mehlhorn, Tsakalidis [-]
1993Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Journal Article
1989Attachment IconData structuresReport
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Journal Article
1985Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
Proceedings Article
1985Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
Proceedings Article
1
Hide details for Mehlhorn, Tsakalidis []Mehlhorn, Tsakalidis []
1990Data Structures
In: Handbook of Theoretical Computer Science, 301-341
Part of a Book
2
Hide details for Mehlhorn, Vishkin [-]Mehlhorn, Vishkin [-]
1984Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
Journal Article
1983Granularity of parallel memoriesReport
1
Hide details for Mehlhorn, Waldmann, Wilhelm [Wilhelm]Mehlhorn, Waldmann, Wilhelm [Wilhelm]
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
Part of a Book
1
Hide details for Mehlhorn, Yap [-]Mehlhorn, Yap [-]
1988Constructive Hopf's theorem: or how to untangle closed planar curvesReport
1
Hide details for Mehlhorn, Yap [Lepistö, Salomaa]Mehlhorn, Yap [Lepistö, Salomaa]
1988Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
1
Hide details for Mehlhorn, Yap []Mehlhorn, Yap []
1991Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Journal Article
1
Hide details for Mehlhorn, Ziegelmann [-]Mehlhorn, Ziegelmann [-]
2001Attachment IconCNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31
Proceedings Article
1
Hide details for Mehlhorn, Ziegelmann [Paterson]Mehlhorn, Ziegelmann [Paterson]
2000Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
Proceedings Article
1
Hide details for Mehnert [-]Mehnert [-]
2004External Memory Suffix Array Construction
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Mestre [-]Mestre [-]
2010Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057
Journal Article
2008Adaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160
Proceedings Article
2008Lagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550
Proceedings Article
1
Hide details for Metzler [-]Metzler [-]
1997Ergebnisüberprüfung bei Graphenalgorithmen
Universität des Saarlandes
Thesis - Masters thesis
7
Hide details for Meyer [-]Meyer [-]
2003Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
In: Journal of Algorithms [48], 91-134
Journal Article
2002Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75
Proceedings Article
2002Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms
Universität des Saarlandes
Thesis - PhD thesis
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
Proceedings Article
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
Proceedings Article
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
Proceedings Article
1995Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Meyer [Meyer, Albers, Weil, Rochange]Meyer [Meyer, Albers, Weil, Rochange]
2008On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560
Proceedings Article
1
Hide details for Meyer [Meyer]Meyer [Meyer]
2008On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy
Proceedings Article
1
Hide details for Meyerhenke, Sauerwald [Meyerhenke]Meyerhenke, Sauerwald [Meyerhenke]
2012Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
Journal Article
1
Hide details for Meyer, Sanders [-]Meyer, Sanders [-]
2003$\Delta$-stepping: a parallelizable shortest path algorithm
In: Journal of Algorithms [49], 114-152
Journal Article
1
Hide details for Meyer, Sanders [Bilardi, Italiano, Pietracaprina, Pucci]Meyer, Sanders [Bilardi, Italiano, Pietracaprina, Pucci]
1998$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
1
Hide details for Meyer, Sanders [Bode, Ludwig, Karl, Wismüller]Meyer, Sanders [Bode, Ludwig, Karl, Wismüller]
2000Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
1
Hide details for Meyer, Sanders, Sibeyn (ed.) [Sibeyn]Meyer, Sanders, Sibeyn (ed.) [Sibeyn]
2003Algorithms for Memory HierarchiesBook
1
Hide details for Meyer, Sibeyn [Breitenecker, Husinsky]Meyer, Sibeyn [Breitenecker, Husinsky]
1995Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
In: Eurosim '95, 285-290
Proceedings Article
1
Hide details for Meyer, Sibeyn [Pritchard, Reeve]Meyer, Sibeyn [Pritchard, Reeve]
1998Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Proceedings Article
1
Hide details for Meyer, Sibeyn [Sibeyn]Meyer, Sibeyn [Sibeyn]
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Journal Article
1
Hide details for Meyer, Wetzel [Wetzel]Meyer, Wetzel [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
Proceedings Article
1
Hide details for Meyer, Zeh [Zeh, Azar, Erlebach]Meyer, Zeh [Zeh, Azar, Erlebach]
2006I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551
Proceedings Article
1
Hide details for Meyer, Zeh [Zeh, Di Battista, Zwick]Meyer, Zeh [Zeh, Di Battista, Zwick]
2003I/O-Efficient Undirected Shortest Paths
In: Algorithms - ESA 2003: 11th Annual European Symposium, 434-445
Proceedings Article
2
Hide details for Michail [-]Michail [-]
2007Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132
Journal Article
2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Miklos, Giesen, Pauly [Miklos, Pauly]Miklos, Giesen, Pauly [Miklos, 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
Proceedings Article
1
Hide details for Miller [-]Miller [-]
1998Implementation and Experimental Evaluation of Dynamic Transitive Closure Algorithms
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Miller, Zaroliagis [Italiano, Orlando]Miller, Zaroliagis [Italiano, Orlando]
1997A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73
Proceedings Article
1
Hide details for Milosavljevic, Morozov, Skraba [Morozov, Skraba]Milosavljevic, Morozov, Skraba [Morozov, Skraba]
2011Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225
Proceedings Article
1
Hide details for Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh, Fu, Du]Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh, Fu, Du]
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Proceedings Article
1
Hide details for Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh, Lodaya, Mahajan]Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh, Lodaya, Mahajan]
2010Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
1
Hide details for Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh]Misra, Philip, Raman, Saurabh [Misra, Raman, Saurabh]
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
1
Hide details for Misra, Philip, Raman, Saurabh, Sikdar [Misra, Raman, Saurabh, Sikdar, Rahman, Fujita]Misra, Philip, Raman, Saurabh, Sikdar [Misra, Raman, Saurabh, Sikdar, Rahman, Fujita]
2010Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
1
Hide details for Misra, Philip, Raman, Saurabh, Sikdar [Misra, Raman, Saurabh, Sikdar]Misra, Philip, Raman, Saurabh, Sikdar [Misra, Raman, Saurabh, Sikdar]
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
1
Hide details for Mitchell, Rote, Kettner (ed.) [Mitchell, Rote]Mitchell, Rote, Kettner (ed.) [Mitchell, Rote]
200521st Annual Symposium on Computational Geometry (SCG'05)Proceedings
1
Hide details for Mnich, Philip, Saurabh, Suchy [Saurabh, Suchy, D'Souza, Kavitha, Radhakrishnan]Mnich, Philip, Saurabh, Suchy [Saurabh, Suchy, D'Souza, Kavitha, Radhakrishnan]
2012Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
1
Hide details for Moehring, Skutella, Stork [Moehring, Stork]Moehring, Skutella, Stork [Moehring, Stork]
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Journal Article
1
Hide details for Mokbel, Aref, Elbassioni, Kamel [Mokbel, Aref, Kamel]Mokbel, Aref, Elbassioni, Kamel [Mokbel, Aref, Kamel]
2004Attachment IconScalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
Proceedings Article
1
Hide details for Molter [-]Molter [-]
2012ACO beats EA on a dynamic pseudo-Boolean function
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Moran [-]Moran [-]
2012Shattering extremal systems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Mörig, Scholz, Tscheuschner, Berberich [Mörig, Scholz, Tscheuschner, Müller-Hannemann, Schirra]Mörig, Scholz, Tscheuschner, Berberich [Mörig, Scholz, Tscheuschner, Müller-Hannemann, Schirra]
2010Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
1
Hide details for Mortensen, Pettie [Mortensen]Mortensen, Pettie [Mortensen]
2005The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60
Proceedings Article
1
Hide details for Mourrain, Pion, Schmitt, Técourt, Tsigaridas, Wolpert [Mourrain, Pion, Técourt, Tsigaridas, Boissonnat, TeillaMourrain, Pion, Schmitt, Técourt, Tsigaridas, Wolpert [Mourrain, Pion, Técourt, Tsigaridas, Boissonnat, Teillaud]
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
Part of a Book
1
Hide details for Mueck [-]Mueck [-]
1998Implementation of Hammock Decomposition with Application to Shortest Path Problems
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Müller [-]Müller [-]
1999Parallel molecular dynamics simulations for synthetic polymers
Universität des Saarlandes
Thesis - PhD thesis
1998Ein Simulator für Prozessornetzwerke
Universität des Saarlandes
Thesis - Masters thesis
1995Ein effizienter paralleler Molekulardynamik-Simulationsalgorithmus für synthetische Polymere
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Müller, Perez-Gimenez, Wormald [Müller, Wormald]Müller, Perez-Gimenez, Wormald [Müller, Wormald]
2011Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
Journal Article
1
Hide details for Müller, Rüb, Rülling [Rülling]Müller, Rüb, Rülling [Rülling]
1996A Circuit for Exact Summation of Floating-Point Numbers
In: Information Processing Letters [57], 159-163
Journal Article
1
Hide details for Mustafa, Ray [-]Mustafa, Ray [-]
2010Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
Journal Article
1
Hide details for Mustafa, Ray [Ray]Mustafa, Ray [Ray]
2007Attachment IconAn Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141
Proceedings Article
3
Hide details for Mutzel [-]Mutzel [-]
2001An alternative method to crossing minimization on hierarchical graphs
In: SIAM Journal on Optimization [11], 1065-1080
Journal Article
1999Zeichnen von Diagrammen - Theorie und Praxis
Universität des Saarlandes
Thesis - Habilitation thesis
1995A Polyhedral Approach to Planar Augmentation and Related Problems
In: Algorithms - ESA'95: 3rd Annual European Symposium, 494-507
Proceedings Article
1
Hide details for Mutzel [North]Mutzel [North]
1996An alternative method to crossing minimization on hierarchical graphs
In: Proceedings of the 4th Symposium on Graph Drawing (GD-96), 318-333
Proceedings Article
1
Hide details for Mutzel, Eades [Eades, Atallah]Mutzel, Eades [Eades, Atallah]
1999Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26
Part of a Book
1
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 [Näher, Alberts, Ambras, Koch, Jünger, Buchheim, Leipert, Whitesides]
1998AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article
1
Hide details for Mutzel, Odenthal, Scharbrodt [Odenthal]Mutzel, Odenthal, Scharbrodt [Odenthal]
1998The thickness of graphs: A survey
In: Graphs and Combinatorics [14], 59-73
Journal Article
1
Hide details for Mutzel, Weiskircher [Chwa, Ibarra]Mutzel, Weiskircher [Chwa, Ibarra]
1998Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Proceedings Article
1
Hide details for Mutzel, Weiskircher [Cornuéjols, Burkard, Woeginger]Mutzel, Weiskircher [Cornuéjols, Burkard, Woeginger]
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
Proceedings Article
1
Hide details for Mutzel, Ziegler [Kall, Lüthi]Mutzel, Ziegler [Kall, Lüthi]
1999The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134
Proceedings Article
1
Hide details for Mutzel, Ziegler [Kratochvil]Mutzel, Ziegler [Kratochvil]
2000The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
Proceedings Article
1
Hide details for Mütze, Rast, Spöhel [Mütze, Rast, Randall]Mütze, Rast, Spöhel [Mütze, Rast, Randall]
2011Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Proceedings Article
1
Hide details for Mütze, Spöhel [Mütze, Nešetřil, Győri, Sali]Mütze, Spöhel [Mütze, Nešetřil, Győri, Sali]
2011On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
Electronic Proceedings Article
1
Hide details for Mütze, Spöhel [Mütze]Mütze, Spöhel [Mütze]
2011On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33
Electronic Journal Article
1
Hide details for Näher, Mehlhorn [-]Näher, Mehlhorn [-]
1990LEDA: A Library of Efficient Data Types and Algorithms
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 1-5
Proceedings Article
1
Hide details for Näher, Mehlhorn [, ]Näher, Mehlhorn [, ]
1990LEDA - A Library of Efficient Data Types and Algorithms
In: GI - 20. Jahrestagung I, Informatik auf dem Weg zum Anwender, 35-39
Proceedings Article
2
Hide details for Naujoks [-]Naujoks [-]
2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
Thesis - PhD thesis
2004A heuristic for solving interior point Methods exactly
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Nest [-]Nest [-]
1998Vergleich von praxisnahen seriellen und parallelisierten Verfahren zur Bestimmung der Schnittpunkte von Liniensegmenten in der Ebene
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Neukirch [-]Neukirch [-]
1994Grundlegende geometrische Datenstrukturen und Algorithmen für LEDA
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Neumann [-]Neumann [-]
2011Implementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes
Thesis - Masters thesis
2008Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
Journal Article
1
Hide details for Neumann, Haltner, Lehr, Kohlbacher, Lenhof [Neumann, Haltner, Lehr]Neumann, Haltner, Lehr, Kohlbacher, Lenhof [Neumann, Haltner, Lehr]
1998Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549
Proceedings Article
1
Hide details for Neumann, Kohlbacher, Haltner, Lenhof, Lehr [Neumann, Haltner, Lehr]Neumann, Kohlbacher, Haltner, Lenhof, Lehr [Neumann, Haltner, 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
Proceedings Article
1
Hide details for Neumann, Oliveto, Witt [Oliveto, Witt, Raidl, Rothlauf]Neumann, Oliveto, Witt [Oliveto, Witt, Raidl, Rothlauf]
2009Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Proceedings Article
1
Hide details for Neumann, Reichel [Reichel, Rudolph, Jansen, Lucas, Poloni, Beume]Neumann, Reichel [Reichel, Rudolph, Jansen, Lucas, Poloni, Beume]
2008Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Proceedings Article
1
Hide details for Neumann, Reichel, Skutella [Reichel, Skutella, Ryan, Keijzer]Neumann, Reichel, Skutella [Reichel, Skutella, Ryan, Keijzer]
2008Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
Proceedings Article
1
Hide details for Neumann, Reichel, Skutella [Reichel, Skutella]Neumann, Reichel, Skutella [Reichel, Skutella]
2011Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
Journal Article
1
Hide details for Neumann, Sudholt, Witt [Sudholt, Witt, Dorigo, Birattari, Blum, Clerc, Stützle, Winfield]Neumann, Sudholt, Witt [Sudholt, Witt, Dorigo, Birattari, Blum, Clerc, Stützle, Winfield]
2008Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143
Proceedings Article
1
Hide details for Neumann, Sudholt, Witt [Sudholt, Witt, Lim, Jain, Dehuri]Neumann, Sudholt, Witt [Sudholt, Witt, Lim, Jain, Dehuri]
2009Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120
Part of a Book
1
Hide details for Neumann, Sudholt, Witt [Sudholt, Witt, Stützle, Birattari, Hoss]Neumann, Sudholt, Witt [Sudholt, Witt, Stützle, Birattari, Hoss]
2007Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Proceedings Article
1
Hide details for Neumann, Sudholt, Witt [Sudholt, Witt]Neumann, Sudholt, Witt [Sudholt, Witt]
2009Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
Journal Article
1
Hide details for Neumann, Wegener [Wegener]Neumann, Wegener [Wegener]
2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Journal Article
1
Hide details for Neumann, Witt [Witt, Maniezzo, Battiti, Watson]Neumann, Witt [Witt, Maniezzo, Battiti, Watson]
2008Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
Proceedings Article
4
Hide details for Neumann, Witt [Witt]Neumann, Witt [Witt]
2010Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
Journal Article
2010Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational ComplexityBook
2009Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Journal Article
2006Ant Colony Optimization and the Minimum Spanning Tree ProblemReport
1
Hide details for Newo Kenmogne [-]Newo Kenmogne [-]
2005Understanding LSI Via The Truncated Term-Term Matrix
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Niedermeier, Reinhard, Sanders [Niedermeier, Reinhard]Niedermeier, Reinhard, Sanders [Niedermeier, Reinhard]
2002Towards Optimal Locality in Mesh-Indexings
In: Discrete Applied Mathematics [117], 211-237
Journal Article
1
Hide details for Nissen [-]Nissen [-]
1998Graph Iterators: Decoupling Graph Structures from Algorithms
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Nor, Hermelin, Charlat, Engelstadter, Reuter, Duron [Nor, Charlat, Engelstadter, Reuter, Duron, Amir, Parida]Nor, Hermelin, Charlat, Engelstadter, Reuter, Duron [Nor, Charlat, Engelstadter, Reuter, Duron, Amir, Parida]
2010Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Proceedings Article
1
Hide details for Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot [Nor, Charlat, Engelstadter, Reuter, Duron, Sagot]Nor, Hermlin, Charlat, Engelstadter, Reuter, Duron, Sagot [Nor, Charlat, Engelstadter, Reuter, Duron, Sagot]
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
1
Hide details for Nutov, Penn [Penn]Nutov, Penn [Penn]
2000On Integrality, Stability and Composition of Dicycle Packings and Covers
In: Journal of Combinatorial Optimization [4], 235 - 252
Journal Article
1
Hide details for Oberhauser [-]Oberhauser [-]
1997Arithmetik der Transduktoren
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Oliveto, Lehre, Neumann [Oliveto, Lehre]Oliveto, Lehre, Neumann [Oliveto, Lehre]
2009Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462
Proceedings Article
1
Hide details for Ossamy [-]Ossamy [-]
2002TSP Cuts Outside the Template Paradigm
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ost [-]Ost [-]
1995Algorithmen für das Kantenfärbungsproblem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ott [-]Ott [-]
2012Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Paluch [Asano]Paluch [Asano]
2006Attachment IconA New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721
Proceedings Article
1
Hide details for Panagiotou [Bernasconi, Steger]Panagiotou [Bernasconi, Steger]
2009The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
Journal Article
1
Hide details for Panagiotou [Krattenthaler, Strehl, Kauers]Panagiotou [Krattenthaler, Strehl, Kauers]
2009Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744
Electronic Proceedings Article
1
Hide details for Panagiotou [Sinha]Panagiotou [Sinha]
2009Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
Proceedings Article
1
Hide details for Panagiotou, Coja-Oghlan [Coja-Oghlan]Panagiotou, Coja-Oghlan [Coja-Oghlan]
2012Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907
Proceedings Article
1
Hide details for Panagiotou, Pourmiri, Sauerwald [-]Panagiotou, Pourmiri, Sauerwald [-]
2013Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Proceedings Article
1
Hide details for Panagiotou, Sinha [Sinha]Panagiotou, Sinha [Sinha]
2012Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
Journal Article
1
Hide details for Panagiotou, Spöhel, Steger, Thomas [Steger, Thomas, Nešetřil, Győri, Sali]Panagiotou, Spöhel, Steger, Thomas [Steger, Thomas, Nešetřil, Győri, Sali]
2011Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Electronic Proceedings Article
1
Hide details for Panagiotou, Spöhel, Steger, Thomas [Steger, Thomas]Panagiotou, Spöhel, Steger, Thomas [Steger, Thomas]
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Journal Article
1
Hide details for Panagiotou, Steger [Steger, Matthieu]Panagiotou, Steger [Steger, Matthieu]
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Proceedings Article
1
Hide details for Panagiotou, Steger [Steger, Randall]Panagiotou, Steger [Steger, Randall]
2011On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210
Proceedings Article
1
Hide details for Panagiotou, Steger [Steger]Panagiotou, Steger [Steger]
2010Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
Journal Article
1
Hide details for Panconesi, Papatriantafilou, Tsigas, Vitanyi [Panconesi, Vitanyi]Panconesi, Papatriantafilou, Tsigas, Vitanyi [Panconesi, Vitanyi]
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Journal Article
2
Hide details for Papatriantafilou, Tsigas [-]Papatriantafilou, Tsigas [-]
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Journal Article
1995Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Proceedings Article
1
Hide details for Park, Lee, Chwa [Park, Chwa, Lee, Teng]Park, Lee, Chwa [Park, Chwa, Lee, Teng]
2000Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526
Proceedings Article
1
Hide details for Park, Lee, Chwa [Park, Chwa, Orejas, Spirakis, Leeuwen]Park, Lee, Chwa [Park, Chwa, Orejas, Spirakis, Leeuwen]
2001Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468
Proceedings Article
2
Hide details for Parreira [-]Parreira [-]
2003Information Retrieval by Dimension Reduction - A Comparative Study
Universität des Saarlandes
Thesis - Masters thesis
2003On the Role of the Singular Values in Latent Semantic Indexing
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Pemmaraju, Raman, Varadarajan [Pemmaraju, Varadarajan]Pemmaraju, Raman, Varadarajan [Pemmaraju, Varadarajan]
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Journal Article
2
Hide details for Pettie [-]Pettie [-]
2005Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973
Proceedings Article
2005Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183
Proceedings Article
2
Hide details for Pettie, Sanders [-]Pettie, Sanders [-]
2005Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network ModelsUnpublished/Draft
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
2
Hide details for Philip [-]Philip [-]
2011Attachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
Thesis - PhD thesis
2008Attachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
Thesis - Masters thesis
1
Hide details for Philip, Raman, Sikdar [Raman, Sikdar, Fiat, Sanders]Philip, Raman, Sikdar [Raman, Sikdar, Fiat, Sanders]
2009Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Proceedings Article
1
Hide details for Philip, Raman, Sikdar [Raman, Sikdar]Philip, Raman, Sikdar [Raman, Sikdar]
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Journal Article
1
Hide details for Philip, Raman, Villanger [Raman, Villanger, Thilikos]Philip, Raman, Villanger [Raman, Villanger, Thilikos]
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
1
Hide details for Piskorski [-]Piskorski [-]
1994Parallele Graphenalgorithmen für den Hypercube
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Pohl [-]Pohl [-]
2006Exact Integer Linear Programming with Bounded Variables in a Branch- and Cut Algorithm
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Polzin [-]Polzin [-]
2003Algorithms for the Steiner Problem in Networks
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Polzin, Vahdati Daneshmand [Vahdati Daneshmand, Jansen, Khuller]Polzin, Vahdati Daneshmand [Vahdati Daneshmand, Jansen, Khuller]
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Proceedings Article
1
Hide details for Polzin, Vahdati Daneshmand [Vahdati Daneshmand, Möhring, Raman]Polzin, Vahdati Daneshmand [Vahdati Daneshmand, Möhring, Raman]
2002Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
Proceedings Article
3
Hide details for Polzin, Vahdati Daneshmand [Vahdati Daneshmand]Polzin, Vahdati Daneshmand [Vahdati Daneshmand]
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
Journal Article
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Journal Article
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Journal Article
1
Hide details for Porkolab, Khachiyan [-]Porkolab, 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
Proceedings Article
1
Hide details for Portz [-]Portz [-]
1994Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Potikoglou [-]Potikoglou [-]
1999Parallele Algorithmen zur Lösung des Single-Source Shortest Path Problems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Pouchkarev [-]Pouchkarev [-]
2000ArchEd: Ein interaktives Zeichensystem für die Archäologie
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Pountourakis, Vidali [Pountourakis, de Berg, Meyer]Pountourakis, Vidali [Pountourakis, de Berg, Meyer]
2010A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Proceedings Article
1
Hide details for Preetham, Krithivasan, Rangan, Sibeyn [Preetham, Krithivasan, Rangan]Preetham, Krithivasan, Rangan, Sibeyn [Preetham, Krithivasan, Rangan]
1996Parallel algorithm for maximum empty L-shaped polygon
In: 3rd Conference on High-Performance Computing, -
Proceedings Article
1
Hide details for Priebe [-]Priebe [-]
2001Average-case complexity of shortest-paths problems
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Pruhs, van Stee, Uthaisombut [Pruhs, Uthaisombut]Pruhs, van Stee, Uthaisombut [Pruhs, Uthaisombut]
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
2
Hide details for Pyrga [-]Pyrga [-]
2010Algorithmic Game Theory and Networks
Universität des Saarlandes
Thesis - PhD thesis
2005Shortest Paths in Time-Dependent Networks and their Applications
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Pyrga, Chung [Chung, Mavronicolas, Papadopoulou]Pyrga, Chung [Chung, Mavronicolas, Papadopoulou]
2009Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
Proceedings Article
1
Hide details for Pyrga, Ray [Ray]Pyrga, Ray [Ray]
2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Proceedings Article
1
Hide details for Pyrga, Schulz, Wagner, Zaroliagis [Schulz, Wagner, Zaroliagis]Pyrga, Schulz, Wagner, Zaroliagis [Schulz, Wagner, Zaroliagis]
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
3
Hide details for P. Gao [-]P. Gao [-]
2012Distribution of the number of spanning regular subgraphs in random graphsUnpublished/Draft
2012Distributions of sparse spanning subgraphs in random graphsUnpublished/Draft
2012Uniform generation of d-factors in dense host graphsUnpublished/Draft
1
Hide details for Qian, Schalekamp, Williamson, van Zuylen [Qian, Schalekamp, Williamson, Fernández-Baca]Qian, Schalekamp, Williamson, van Zuylen [Qian, Schalekamp, Williamson, Fernández-Baca]
2012On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
1
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.) [Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert]
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Rajaraman, Richa, Vöcking, Vuppuluri [Rajaraman, Richa, Vuppuluri]Rajaraman, Richa, Vöcking, Vuppuluri [Rajaraman, Richa, 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
Proceedings Article
6
Hide details for Ramos [-]Ramos [-]
2001An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
In: Discrete and Computational Geometry [26], 233-244
Journal Article
2000Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 290-299
Proceedings Article
2000Linear Programming Queries Revisited
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 176-181
Proceedings Article
1999On range reporting, ray shooting and $k$-level construction
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 390-399
Proceedings Article
1997Construction of 1-d lower envelopes and applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 57-66
Proceedings Article
1997Intersection of unit-balls and diameter of a point set in R³
In: Computational Geometry Theory and Applications [8], 57-65
Journal Article
1
Hide details for Ramos [Mahajan, Subrahmanyam]Ramos [Mahajan, Subrahmanyam]
2001Solving Some Discrepancy Problems in NC
In: Algorithmica [29], 371-395
Journal Article
2
Hide details for Ramos, Amato, Goodrich [Amato, Goodrich]Ramos, Amato, Goodrich [Amato, Goodrich]
2001A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265
Journal Article
2000Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706
Proceedings Article
1
Hide details for Rasch [-]Rasch [-]
1994Furthest Site Abstract Voronoi Diagrams
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Rathe, Sanders, Knight [Rathe, Knight]Rathe, Sanders, Knight [Rathe, Knight]
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
1
Hide details for Rau [-]Rau [-]
1997Ein experimenteller Vergleich von zwei Algorithmen zur Berechnung des maximalen Flusses in einem asymmetrischen Netzwerk mit reellen Kapazitäten
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rauf [-]Rauf [-]
2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Ray [-]Ray [-]
2004Counting Straight-Edge Triangulations of Planar Point Sets
Universität des Saarlandes
Thesis - Masters thesis
2004Geometric Algorithms for Object Placement and Planarity in a Terrain
Universität des Saarlandes
Thesis - PhD thesis
2002An O(nlogn) Algorithm for Classifying Identical CurvesMiscellaneous
1
Hide details for Ray, Mustafa [Ray]Ray, Mustafa [Ray]
2007Attachment IconWeak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244
Proceedings Article
1
Hide details for Ray, Smid, Lange, Wendt [Smid, Lange, Wendt, Fourey, Herman, Kong]Ray, Smid, Lange, Wendt [Smid, Lange, Wendt, Fourey, Herman, Kong]
2002Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
2
Hide details for Reichel [-]Reichel [-]
2006Attachment IconCombinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes
Thesis - PhD thesis
2001Attachment IconOptimale Hüllkörper für Objekte mit gekrümmten Oberflächen
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Reinert [-]Reinert [-]
1999A polyhedral approach to sequence alignment problems
Universität des Saarlandes
Thesis - PhD thesis
1994Deferred Data Structuring
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Reinert, Lenhof, Mehlhorn, Mutzel, Kececioglu [-]Reinert, 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
Proceedings Article
1
Hide details for Reinstädtler [-]Reinstädtler [-]
1998Verlustfreie Datenkompression mit selbstorganisierenden Listen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rieger [-]Rieger [-]
1995Generic Evolutions of Edges on Families of Diffused Greyvalue Surfaces
In: Journal of Mathematical Imaging and Vision [5], 207-217
Journal Article
1
Hide details for Rizkallah [-]Rizkallah [-]
2011Maximum Cardinality Matching
In: Archive of Formal Proofs,
Electronic Journal Article
1
Hide details for Rizkallah [Brown]Rizkallah [Brown]
2011Attachment IconGlivenko and Kuroda for Simple Type TheoryUnpublished/Draft
1
Hide details for Röhrig [-]Röhrig [-]
1998Tree Decomposition: A Feasibility Study
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rottmann [-]Rottmann [-]
1996Bewegung eines Polygons zwischen polygonalen Hindernisse
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Rüb [-]Rüb [-]
1997On the average running time of odd-even merge sort
In: Journal of Algorithms [22], 329-346
Journal Article
1995On the Average Running Time of Odd-Even Merge Sort
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 491-501
Proceedings Article
1
Hide details for Rüb [Morvan, Meinel, Krob]Rüb [Morvan, Meinel, Krob]
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
Proceedings Article
1
Hide details for Ruppert [-]Ruppert [-]
1999Polygontriangulierung in Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Rusinov, Schweitzer [Rusinov]Rusinov, Schweitzer [Rusinov]
2010Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Journal Article
1
Hide details for Sabo [-]Sabo [-]
1999Ein schnelles Verfahren zur exakten Berechnung von Skalarprodukten
Universität des Saarlandes
Thesis - Masters thesis
4
Hide details for Sagraloff [-]Sagraloff [-]
2012Exaktes geometrisches RechnenMiscellaneous
2011When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
Electronic Journal Article
2010A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Journal Article
2010On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
Electronic Journal Article
1
Hide details for Sagraloff [van der Hoeven, van Hoeij]Sagraloff [van der Hoeven, van Hoeij]
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
Proceedings Article
1
Hide details for Sagraloff, Kerber, Hemmer [Suzuki, Hong, Anai, Yap, Sato, Yoshida]Sagraloff, Kerber, Hemmer [Suzuki, Hong, Anai, Yap, Sato, Yoshida]
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
1
Hide details for Sagraloff, Yap [Yap, Leykin]Sagraloff, Yap [Yap, Leykin]
2011A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360
Proceedings Article
1
Hide details for Saha, Saptharishi, Saxena [Saptharishi, Saxena]Saha, Saptharishi, Saxena [Saptharishi, Saxena]
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
10
Hide details for Sanders [-]Sanders [-]
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
Proceedings Article
2003Asynchronous Scheduling of Redundant Disk Arrays
In: IEEE Transactions on Computers [52], 1170-1184
Journal Article
2002Randomized Receiver Initiated Load Balancing Algorithms for Tree Shaped Computations
In: The Computer Journal [45], 561-573
Journal Article
2002Reconciling simplicity and realism in parallel disk models
In: Parallel Computing [28], 705-723
Journal Article
2001Reconciling Simplicity and Realism in Parallel Disk Models
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 67-76
Proceedings Article
2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
1998Random Permutations on Distributed, External and Hierarchical Memory
In: Information Processing Letters [67], 305-309
Journal Article
1998Random Permutations on Distributed, External and Hierarchical Memory
In: PARS-Mitteilungen, 160-165
In: PARS-Mitteilungen [1998], 160-165
Journal Article
1998Randomized Priority Queues for Fast Parallel Access
In: Journal Parallel and Distributed Computing [49], 86-97
Journal Article
1
Hide details for Sanders [Aggarwal, Rangan]Sanders [Aggarwal, Rangan]
1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
1
Hide details for Sanders [Bode]Sanders [Bode]
1998Tree Shaped Computations as a Model for Parallel Applications
In: Anwendungsbezogene Lastverteilung (ALV), 123-132
Proceedings Article
1
Hide details for Sanders [Fleischer, Moret, Meineche Schmidt]Sanders [Fleischer, Moret, Meineche Schmidt]
2002Presenting Data from Experiments in Algorithmics
In: Experimental Algorithmics, 181-196
Part of a Book
1
Hide details for Sanders [Goodrich, McGeoc]Sanders [Goodrich, McGeoc]
1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
1
Hide details for Sanders [Plehn, Deutschmann]Sanders [Plehn, Deutschmann]
1999Berechnungen mit großen Datenmengen
In: Jahrbuch der Max-Planck-Gesellschaft 1999, 534-540
Part of a Book
1
Hide details for Sanders [Sibeyn]Sanders [Sibeyn]
2003Memory hierarchies - models and lower bounds
In: Algorithms for memory hierarchies, 1-10
Part of a Book
1
Hide details for Sanders [Teng]Sanders [Teng]
2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
1
Hide details for Sanders [Wiedermann, van Emde Boas, Nielsen]Sanders [Wiedermann, van Emde Boas, Nielsen]
1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
1
Hide details for Sanders [Winkel]Sanders [Winkel]
2004Super Scalar Sample Sort
In: Algorithms – ESA 2004: 12th Annual European Symposium, 784-796
Proceedings Article
1
Hide details for Sanders, Egner, Korst [Egner, Korst]Sanders, Egner, Korst [Egner, Korst]
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
1
Hide details for Sanders, Egner, Tolhuizen [Egner, Tolhuizen]Sanders, Egner, Tolhuizen [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
Proceedings Article
1
Hide details for Sanders, Pettie [-]Sanders, Pettie [-]
2004Attachment IconA Simpler Linear Time 2/3 - epsilon Approximation for Maximum
Weight Matching
Report
1
Hide details for Sanders, Reussner, Prechelt, Müller [Reussner, Prechelt, Müller, Alexandrov]Sanders, Reussner, Prechelt, Müller [Reussner, Prechelt, Müller, Alexandrov]
1998SKaMPI: A Detailed, Accurate MPI Benchmark
In: Proceedings of the 5th European PVM/MPI Users' Group Meeting, 52-59
Proceedings Article
1
Hide details for Sanders, Sibeyn [-]Sanders, Sibeyn [-]
2000A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
1
Hide details for Sanders, Sibeyn [Sibeyn]Sanders, Sibeyn [Sibeyn]
2003A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Information Processing Letters [86], 33-38
Journal Article
1
Hide details for Sanders, Singler, van Stee [Sanders, Singler]Sanders, Singler, van Stee [Sanders, Singler]
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
1
Hide details for Sanders, Sivadasan, Skutella [Díaz, Karhumäki, Lepistö, Sannella]Sanders, Sivadasan, Skutella [Díaz, Karhumäki, Lepistö, Sannella]
2004Attachment IconOnline scheduling with bounded migration
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 1111-1122
Proceedings Article
1
Hide details for Sanders, Sivadasan, Skutella [Sanders, Skutella]Sanders, Sivadasan, Skutella [Sanders, Skutella]
2009Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Journal Article
2
Hide details for Sanders, Solis-Oba [Solis-Oba]Sanders, Solis-Oba [Solis-Oba]
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
1
Hide details for Sanders, Steurer [-]Sanders, 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
Proceedings Article
1
Hide details for Sanders, Takkula, Wedelin [Takkula, Wedelin, Sloot, Bubak, Hoekstra, Hertzberger]Sanders, Takkula, Wedelin [Takkula, Wedelin, Sloot, Bubak, Hoekstra, Hertzberger]
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1
Hide details for Sanders, Träff [Monien, Feldman, Träff]Sanders, Träff [Monien, Feldman, 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
Proceedings Article
1
Hide details for Sanders, Vöcking [-]Sanders, Vöcking [-]
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
Journal Article
1
Hide details for Sanders, Vöcking [Penttonen, Meineche Schmidt]Sanders, Vöcking [Penttonen, Meineche Schmidt]
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
Proceedings Article
1
Hide details for Sanders, Vollmar, Worsch [Vollmar, Worsch]Sanders, Vollmar, Worsch [Vollmar, Worsch]
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
Journal Article
1
Hide details for Sauerwald, Stauffer [Stauffer, Randall]Sauerwald, Stauffer [Stauffer, Randall]
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
1
Hide details for Sauerwald, Sun [Roughgarden]Sauerwald, Sun [Roughgarden]
2012Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Proceedings Article
2
Hide details for Schäfer [-]Schäfer [-]
2004Worst case instances are fragile: average case and smoothed competitive analysis of algorithms
Universität des Saarlandes
Thesis - PhD thesis
2000Weighted Matchings in General Graphs
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schäfer, Sivadasan [Diekert, Habib]Schäfer, Sivadasan [Diekert, Habib]
2004Attachment IconTopology matters: Smoothed competitiveness of metrical task systems
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 489-500
Proceedings Article
1
Hide details for Schalekamp, Williamson, van Zuylen [Schalekamp, Williamson, Rabani]Schalekamp, Williamson, van Zuylen [Schalekamp, Williamson, Rabani]
2012A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
1
Hide details for Schanne [-]Schanne [-]
2001Visualisierung der Dialektgeographie und Topographie im deutschen Dialektraum
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schilz [-]Schilz [-]
2000Effiziente Algorithmen für das verteilte Rechnen auf Workstation-Clustern
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Schirra [-]Schirra [-]
2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
1998Computational Geometry: Theory and Implementation
Universität des Saarlandes
Thesis - Habilitation thesis
1
Hide details for Schirra [Goodrich, McGeoch]Schirra [Goodrich, McGeoch]
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
Proceedings Article
1
Hide details for Schirra [van Kreveld, Nievergelt, Roos, Widmayer]Schirra [van Kreveld, Nievergelt, Roos, Widmayer]
1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
5
Hide details for Schmidt [-]Schmidt [-]
2013A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
Proceedings Article
2013A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Journal Article
2013Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
Journal Article
2013Contractions, Removals and How to Certify 3-Connectivity in Linear TimeUnpublished/Draft
2012Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Journal Article
1
Hide details for Schmidt [Czumaj, Pitts, Wattenhofer]Schmidt [Czumaj, Pitts, Wattenhofer]
2012Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
Proceedings Article
1
Hide details for Schmidt, Valtr [Valtr]Schmidt, Valtr [Valtr]
2012Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Proceedings Article
5
Hide details for Schmitt [-]Schmitt [-]
2006Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes
Thesis - Bachelor thesis
2004Common Subexpression Search in LEDA_reals -- a study of the diamond-operatorReport
2004Improved separation bounds for the diamond operatorReport
2003Common Subexpression Search in LEDA_realsReport
2003The Diamond Operator for Real Algebraic NumbersReport
1
Hide details for Schmitt [Ganzha, Mayr, Vorozhtsov]Schmitt [Ganzha, Mayr, Vorozhtsov]
2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
1
Hide details for Schmitt, Fousse [-]Schmitt, Fousse [-]
2004Attachment IconA comparison of polynomial evaluation schemesReport
1
Hide details for Schmitt, Zimmer [Zimmer]Schmitt, Zimmer [Zimmer]
2003Elliptic Curves : A Computational ApproachBook
1
Hide details for Schmitz [-]Schmitz [-]
1995Analyse von Branch-and-Bound Algorithmen zum Problem des Handlungsreisenden
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schnorr, Subramanian [Schnorr, Luby, Rolim, Serna]Schnorr, Subramanian [Schnorr, Luby, Rolim, Serna]
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
Proceedings Article
1
Hide details for Schömer, Reichel, Warken, Lennerz [Lee, Patrikalakis]Schömer, Reichel, Warken, Lennerz [Lee, Patrikalakis]
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
1
Hide details for Schömer, Thiel [Schömer]Schömer, Thiel [Schömer]
1995Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Proceedings Article
1
Hide details for Schömer, Wolpert [Schömer]Schömer, Wolpert [Schömer]
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
Journal Article
1
Hide details for Schröder [-]Schröder [-]
1998Upper and Lower Bounds for Basic Scheduling Problems
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schulte [-]Schulte [-]
2001Exaktes Lösen von Linearen Programmen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schultes [-]Schultes [-]
2005Fast and Exact Shortest Path Queries Using Highway Hierachies
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Schwarzenecker [-]Schwarzenecker [-]
1995Ein NP-schweres Plazierungsproblem
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Schwarz, Karrenbauer, Schehr, Rieger [Schwarz, Schehr, Rieger]Schwarz, Karrenbauer, Schehr, Rieger [Schwarz, Schehr, Rieger]
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
2
Hide details for Schweitzer [-]Schweitzer [-]
2009Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
Thesis - PhD thesis
2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
1
Hide details for Schweitzer, Schweitzer [Schweitzer]Schweitzer, Schweitzer [Schweitzer]
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
2
Hide details for Schwerdt, Smid, Schirra [Schwerdt, Smid]Schwerdt, Smid, Schirra [Schwerdt, Smid]
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
2
Hide details for Seel [-]Seel [-]
2001Planar Nef Polyhedra and Generic Higher-dimensional Geometry
Universität des Saarlandes
Thesis - PhD thesis
1994Eine Implementierung abstrakter Voronoidiagramme
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Seidel [-]Seidel [-]
1997Paralleles List Ranking
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Seidel, Wolpert [Seidel]Seidel, Wolpert [Seidel]
2005On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
Proceedings Article
2
Hide details for Seiden [-]Seiden [-]
2000Online randomized multiprocessor scheduling
In: Algorithmica [28], 173-216
Journal Article
1999Randomized online scheduling with delivery times
In: Journal of Combinatorial Optimization [3], 399-416
Journal Article
1
Hide details for Semeloglou [-]Semeloglou [-]
2000Kürzeste Wege in planare Graphen. Implementierung eines parallelen Algorithmus mithilfe von PAD
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Sharma [-]Sharma [-]
2008Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
Electronic Journal Article
1
Hide details for Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt [Shervashidze, van Leeuwen, Borgwardt]Shervashidze, Schweitzer, van Leeuwen, Mehlhorn, Borgwardt [Shervashidze, van Leeuwen, Borgwardt]
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
1
Hide details for Shervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt [Shervashidze, Vishwanathan, Petri, Borgwardt, van Dyk,Shervashidze, Vishwanathan, Petri, Mehlhorn, Borgwardt [Shervashidze, Vishwanathan, Petri, Borgwardt, van Dyk, Welling]
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
10
Hide details for Sibeyn [-]Sibeyn [-]
2000Solving fundamental problems on sparse-meshes
In: IEEE Transactions on Parallel & Distributed Systems [11], 1324-1332
Journal Article
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
Proceedings Article
1999Effiziente parallele Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
1998List Ranking on Meshes
In: Acta Informatica [35], 543-566
Journal Article
1997Better Trade-offs for Parallel List Ranking
In: Proceedings of the 9th Symposium on Parallel Algorithms and Architectures (SPAA-97), 221-230
Proceedings Article
1997Routing on Triangles, Tori and Honeycombs
In: International Journal on the Foundations of Computer Science [8], 269-287
Journal Article
1997Routing with Finite Speeds of Memory and Network
In: Proceedings of the 22nd Symposium on the Mathematical Foundations of Computer Science (MFCS-97), 488-497
Proceedings Article
1997Sample Sort on Meshes
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 389-398
Proceedings Article
1995Sample Sort on Meshes
In: Proceedings of Computing Science in the Netherlands, SION, 217-228
Proceedings Article
1
Hide details for Sibeyn [Arnborg, Ivansson]Sibeyn [Arnborg, Ivansson]
1998Solving Fundamental Problems on Sparse-Meshes
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 288-299
Proceedings Article
1
Hide details for Sibeyn [Banerjee, Prasanna, Sinha]Sibeyn [Banerjee, Prasanna, Sinha]
1999Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Proceedings Article
1
Hide details for Sibeyn [Bougé, Fraigniaud, Mignotte, Robert]Sibeyn [Bougé, Fraigniaud, Mignotte, Robert]
1996List Ranking on Interconnection Networks
In: 2nd Euro-Par Conference, 529-541
Proceedings Article
1
Hide details for Sibeyn [Gavoille, Bermond, Raspaud]Sibeyn [Gavoille, Bermond, Raspaud]
1999Power and Limitations of Optical Reconfigurable Arrays
In: Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO 6), 249-263
Proceedings Article
1
Hide details for Sibeyn [Meinel, Tison]Sibeyn [Meinel, Tison]
1999External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
Proceedings Article
1
Hide details for Sibeyn [Penczek, Szalas]Sibeyn [Penczek, Szalas]
1996Routing on Triangles, Tori and Honeycombs
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 529-541
Proceedings Article
1
Hide details for Sibeyn, Abello, Meyer [Sibeyn, Abello]Sibeyn, Abello, Meyer [Sibeyn, Abello]
2002Heuristics for Semi-External Depth First Search on Directed Graphs
In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 282-292
Proceedings Article
1
Hide details for Sibeyn, Grammatikakis, Hsu, Kraetzl [Grammatikakis, Hsu, Kraetzl]Sibeyn, Grammatikakis, Hsu, Kraetzl [Grammatikakis, Hsu, Kraetzl]
1998Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Journal Article
2
Hide details for Sibeyn, Guillaume, Seidel [Guillaume, Seidel]Sibeyn, Guillaume, Seidel [Guillaume, Seidel]
1999Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180
Journal Article
1997Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36
Proceedings Article
1
Hide details for Sibeyn, Juurlink, Rao [Juurlink, Rao]Sibeyn, Juurlink, Rao [Juurlink, Rao]
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Journal Article
2
Hide details for Sibeyn, Kaufmann [Kaufmann]Sibeyn, Kaufmann [Kaufmann]
1997BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240
Proceedings Article
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1
Hide details for Sibeyn, Kaufmann, Chlebus [-]Sibeyn, Kaufmann, Chlebus [-]
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Journal Article
1
Hide details for Sitters [-]Sitters [-]
2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
1
Hide details for Sitters, Stougie [Stougie]Sitters, Stougie [Stougie]
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
1
Hide details for Sivadasan [-]Sivadasan [-]
2004Online Problems and Two-Player Games: Algorithms and Analysis
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Sivadasan, Sanders, Skutella [-]Sivadasan, Sanders, Skutella [-]
2004Attachment IconOnline Scheduling with Bounded MigrationReport
1
Hide details for Smid [-]Smid [-]
1995Dynamic rectangular point location, with an application to the closest pair problem
In: Information and Computation [16], 1-9
Journal Article
1
Hide details for Smid, Ray, Wendt, Lange [Smid, Lange, Wendt]Smid, Ray, Wendt, Lange [Smid, Lange, Wendt]
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
Journal Article
1
Hide details for Solis-Oba [BIlardi, Italiano, Pietracaprina, Pucci]Solis-Oba [BIlardi, Italiano, Pietracaprina, Pucci]
19982-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452
Proceedings Article
1
Hide details for Solis-Oba, Frederickson [Frederickson, Degano, Vaccaro, Pirillo]Solis-Oba, Frederickson [Frederickson, Degano, Vaccaro, Pirillo]
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
1
Hide details for Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko, Hochbaum, Rolim, Sinclair]Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko, Hochbaum, Rolim, Sinclair]
1999A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188
Proceedings Article
1
Hide details for Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko]Solis-Oba, Jansen, Sviridenko [Jansen, Sviridenko]
1999Makespan minimization in job shops: a polynomial time approximation scheme
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399
Proceedings Article
1
Hide details for Son [-]Son [-]
1999Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Soranzo, Ramezani, Iacono, Altafini [Soranzo, Iacono, Altafini]Soranzo, Ramezani, Iacono, Altafini [Soranzo, Iacono, Altafini]
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
1
Hide details for Sridharan, Subramanian, Sudha [Sridharan, Sudha]Sridharan, Subramanian, Sudha [Sridharan, Sudha]
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Journal Article
1
Hide details for Srivastava [-]Srivastava [-]
1996Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Stephan [-]Stephan [-]
2000Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Steurer [-]Steurer [-]
2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
Thesis - Masters thesis
2006Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Stormer [-]Stormer [-]
1998Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Subramanian [-]Subramanian [-]
2000Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77
Journal Article
1999A Generalization of Janson inequalities and its application to finding shortest paths
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 795-804
Proceedings Article
1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Journal Article
1
Hide details for Subramanian, Fürer, Veni Madhavan [Subramanian, Fürer, Veni Madhavan]Subramanian, Fürer, Veni Madhavan [Subramanian, Fürer, Veni Madhavan]
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Journal Article
1
Hide details for Sviridenko, Wiese [Sviridenko, Goemans]Sviridenko, Wiese [Sviridenko, Goemans]
2013Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
1
Hide details for Telikepalli [Pandya, Radhakrishnan]Telikepalli [Pandya, Radhakrishnan]
2003Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288
Proceedings Article
1
Hide details for Telikepalli, Chandran, Subramanian [Subramanian, Warnow, Zhu]Telikepalli, Chandran, Subramanian [Subramanian, Warnow, Zhu]
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
Proceedings Article
1
Hide details for Telikepalli, Varadarajan [Varadarajan, McAllister]Telikepalli, Varadarajan [Varadarajan, McAllister]
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
Proceedings Article
1
Hide details for Teramoto, Asano, Katoh, Doerr [Teramoto, Asano, Katoh]Teramoto, Asano, Katoh, Doerr [Teramoto, Asano, Katoh]
2006Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356
Journal Article
3
Hide details for Thiel [-]Thiel [-]
2004Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
Thesis - PhD thesis
1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Masters thesis
1996Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, PeThierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.) [Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Kovacs, Kumar, Miller, Moore, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener]
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Thome [-]Thome [-]
2000Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Thorup [-]Thorup [-]
2000Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Journal Article
1
Hide details for Tiwary, Elbassioni [Tiwary]Tiwary, Elbassioni [Tiwary]
2008On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198
Proceedings Article
2
Hide details for Träff [-]Träff [-]
1996A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569
Journal Article
1995An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532
Journal Article
1
Hide details for Träff, Zaroliagis [-]Träff, Zaroliagis [-]
2000A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124
Journal Article
1
Hide details for Träff, Zaroliagis [Ferreira, Rolim, Saad, Yang]Träff, Zaroliagis [Ferreira, Rolim, Saad, Yang]
1996A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
1
Hide details for van Leeuwen, Mehlhorn, Reps (ed.) [-]van Leeuwen, Mehlhorn, Reps (ed.) [-]
1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94Report
5
Hide details for van Stee [-]van Stee [-]
2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Journal Article
2012Attachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
Journal Article
2012Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
Journal Article
2012Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
Journal Article
2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
1
Hide details for van Stee [Jansen, Solis-Oba]van Stee [Jansen, Solis-Oba]
2011Attachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
2
Hide details for van Stee [Kao]van Stee [Kao]
2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
3
Hide details for van Zuylen [-]van Zuylen [-]
2011An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
Journal Article
2011Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
Journal Article
2011Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Journal Article
1
Hide details for van Zuylen [Solis-Oba, Persiano]van Zuylen [Solis-Oba, Persiano]
2012Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
Proceedings Article
1
Hide details for van Zuylen, Schalekamp, Williamson [Schalekamp, Williamson, Adacher, Flamini, Leo, Nicosia, Pacifici, Picciallvan Zuylen, Schalekamp, Williamson [Schalekamp, Williamson, Adacher, Flamini, Leo, Nicosia, Pacifici, Piccialli]
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
1
Hide details for Vidali [Leonardi]Vidali [Leonardi]
2009The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Proceedings Article
1
Hide details for Vingron, Lenhof, Mutzel [Vingron]Vingron, Lenhof, Mutzel [Vingron]
1997Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Part of a Book
2
Hide details for Vöcking [-]Vöcking [-]
2001Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539
Proceedings Article
2001Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10
Proceedings Article
1
Hide details for von Braunmühl, Cook, Mehlhorn, Verbeek [-]von Braunmühl, Cook, Mehlhorn, Verbeek [-]
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
Journal Article
1
Hide details for von Zülow [-]von Zülow [-]
1994Das k-Closest-Pair-Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wagner, Veeramachaneni, Neumann, O'Reilly [Veeramachaneni, Neumann, O'Reilly]Wagner, Veeramachaneni, Neumann, O'Reilly [Veeramachaneni, Neumann, O'Reilly]
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
1
Hide details for Wahl [-]Wahl [-]
2000Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wahlström [-]Wahlström [-]
2011New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Journal Article
1
Hide details for Wahlström [Frid, Morozov, Rybalchenko, Wagner]Wahlström [Frid, Morozov, Rybalchenko, Wagner]
2009New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
Proceedings Article
1
Hide details for Wahlström [Grohe, Niedermeier]Wahlström [Grohe, Niedermeier]
2008A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Proceedings Article
1
Hide details for Wahlström [Portier, Wilke]Wahlström [Portier, Wilke]
2013Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13),
Electronic Proceedings Article
1
Hide details for Wang [-]Wang [-]
2012Certification of Curve Arrangements
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Warken [-]Warken [-]
2004Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Warken, Schömer [Skala]Warken, Schömer [Skala]
2001Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62
Proceedings Article
2
Hide details for Weber [-]Weber [-]
2007Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
Thesis - PhD thesis
2006Solving large Sparse Linear Systems exactly
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou, ScWeikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou, Schindelhauer]
2005Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
Proceedings Article
1
Hide details for Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou]Weikum, Bast, Canright, Hales, Schindelhauer, Triantafillou [Canright, Hales, Schindelhauer, Triantafillou]
2007Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?
Proceedings Article
1
Hide details for Weinand [-]Weinand [-]
2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Weiskircher [-]Weiskircher [-]
2002New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
Thesis - PhD thesis
1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wendt, Lange, Ray, Smid [Wendt, Lange, Smid]Wendt, Lange, Ray, Smid [Wendt, Lange, Smid]
2001Surface Topography Quantification using Computational GeometryMiscellaneous
1
Hide details for Wendt, Lange, Smid, Ray, Tönnies [Tönnies, Wendt, Lange, Smid]Wendt, Lange, Smid, Ray, Tönnies [Tönnies, Wendt, Lange, Smid]
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
Journal Article
1
Hide details for Wilhelmi [-]Wilhelmi [-]
1995Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Winzen [-]Winzen [-]
2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Journal Article
2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
2011Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Wissen [-]Wissen [-]
1998Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wolpert [-]Wolpert [-]
2002An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Wolpert [Di Battista, Zwick]Wolpert [Di Battista, Zwick]
2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesReport
1
Hide details for Xu, Karrenbauer, Soh, Codrea [Xu, Soh, Codrea]Xu, Karrenbauer, Soh, Codrea [Xu, Soh, Codrea]
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Journal Article
1
Hide details for Xu, Karrenbauer, Soh, Wahl [Xu, Soh, Wahl, Morreale]Xu, Karrenbauer, Soh, Wahl [Xu, Soh, Wahl, Morreale]
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
1
Hide details for Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger [Xu, Wahl, Eeisenbrand, Soh, Hitzelberger]Xu, Wahl, Eeisenbrand, Karrenbauer, Soh, Hitzelberger [Xu, Wahl, Eeisenbrand, Soh, Hitzelberger]
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
1
Hide details for Yap, Sagraloff, Sharma [Yap, Sharma]Yap, Sagraloff, Sharma [Yap, Sharma]
2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
1
Hide details for Zaroliagis [-]Zaroliagis [-]
1997Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37
Journal Article
1
Hide details for Ziegelmann [-]Ziegelmann [-]
2001Constrained Shortest Paths and Related Problems
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Ziegenbein [-]Ziegenbein [-]
1997Bewertung verschiedener paarweiser Alignment-Methoden, Ersetzungsmatrizen und Gap-Funktionen
Universität des Saarlandes
Thesis - Masters thesis

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