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: 7. Library - 4. Category, Keywords

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

Author/EditorYearTitleType
Hide details for ideal theoryideal theory
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
Hide details for identity testingidentity testing
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
2013Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
Electronic Journal Article
Hide details for implementationimplementation
Fleischer, Rudolf1999FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
Hide details for in-approximabilityin-approximability
Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
Hide details for IncompressibilityIncompressibility
Schweitzer, Pascal2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
Hide details for incremental algorithmincremental algorithm
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
Hide details for incremental algorithmsincremental algorithms
Elbassioni, Khaled M.2002Attachment IconOn Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
Proceedings Article
Fotakis, Dimitris2004Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Proceedings Article
Hide details for incremental generation algorithmsincremental generation algorithms
Elbassioni, Khaled M.2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
Hide details for Incremental polynomial timeIncremental polynomial time
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Hide details for Independent Feedback Vertex SetIndependent Feedback Vertex Set
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Proceedings Article
Hide details for independent setindependent set
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Hide details for indexingindexing
Crauser, Andreas
Ferragina, Paolo
2002A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35
Journal Article
Hide details for induced subgraphinduced subgraph
Gao, Pu (Jane)
Wormald, Nicholas
Su, Yi
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
Hide details for Inefficiency of EquilibriaInefficiency of Equilibria
Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido
2010Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
Hide details for Infinite gamesInfinite games
Kutz, Martin2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
Hide details for Information BrokerageInformation Brokerage
Funke, Stefan
Rauf, Imran
2007Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
Proceedings Article
Hide details for information retrievalinformation retrieval
Bast, Holger2004Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), 113-116
Proceedings Article
Hagedoorn, Michiel2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
Hide details for insertionsinsertions
Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M.
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Journal Article
Hide details for InstrumentsInstruments
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for integer divisioninteger division
Mehlhorn, Kurt1983$AT^2$-optimal VLSI for integer division and integer square rootingReport
Hide details for Integer Linear ProgrammingInteger Linear Programming
Mutzel, Petra
Weiskircher, René
1998Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Proceedings Article
Mutzel, Petra
Ziegler, Thomas
2000The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
Proceedings Article
Mutzel, Petra
Ziegler, Thomas
1999The constrained crossing minimization problem: a first approach
In: Operations Research Proceedings 1998, 125-134
Proceedings Article
Hide details for Integer Linear ProgramsInteger Linear Programs
Mutzel, Petra
Weiskircher, René
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
Hide details for integer multiplicationinteger multiplication
Mehlhorn, Kurt
Preparata, Franco P.
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeReport
Hide details for Integer OptimizationInteger Optimization
Mutzel, Petra
Weiskircher, René
1998Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Proceedings Article
Hide details for integer programinteger program
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for Integer ProgrammingInteger Programming
Althaus, Ernst1998Attachment IconBerechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
Klau, Gunnar W.
Mutzel, Petra
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Proceedings Article
Hide details for Integer Programming Graph DrawingInteger Programming Graph Drawing
Klau, Gunnar W.
Mutzel, Petra
1999Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319
Proceedings Article
Hide details for Interconnection NetworksInterconnection Networks
Meyer, Ulrich
Sibeyn, Jop F.
1998Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Proceedings Article
Hide details for Internet RoutingInternet Routing
Pyrga, Evangelia
Chung, Christine
2009Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
Proceedings Article
Hide details for intersection computationintersection computation
Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
Hide details for interval arithmeticinterval arithmetic
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
1998Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
Proceedings Article
Hide details for InversionsInversions
Elmasry, Amr
Hammad, Abdelrahman
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
Hide details for IP networksIP networks
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for IrregularIrregular
Bast, Hannah2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Journal Article
Hide details for Isooriented RectanglesIsooriented Rectangles
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
Hide details for I.3.5 [ComputationalI.3.5 [Computational
Geometry and Object Modeling]: Curve
Miklos, Balint
Giesen, Joachim
Pauly, Mark
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
Hide details for I/O KomplexitätI/O Komplexität
Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
1997Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132
Proceedings Article
Hide details for job shop schedulingjob shop scheduling
Solis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim
1999A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188
Proceedings Article
Hide details for k-splittable flowk-splittable flow
Martens, Maren
Skutella, Martin
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
Hide details for k mismatches problemk mismatches problem
Burkhardt, Stefan
Kärkkäinen, Juha
2003Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70
Journal Article
Burkhardt, Stefan
Kärkkäinen, Juha
2001Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85
Proceedings Article
Hide details for Kemeny AggregationKemeny Aggregation
Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
Hide details for Kernel lower boundsKernel lower bounds
Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S.
2010Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket
2010Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
Hide details for KernelizationKernelization
Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket
2010Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
Fomin, Fedor V.
Lokshtanov, Daniel
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconHitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200
Proceedings Article
Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve
2011Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
Proceedings Article
Kratsch, Stefan2009Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612
Electronic Proceedings Article
Kratsch, Stefan
Wahlström, Magnus
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Proceedings Article
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2010Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath
2012Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23
Journal Article
Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath
2009Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Proceedings Article
Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
Hide details for Knapsack ProblemKnapsack Problem
Beier, Rene
Vöcking, Berthold
2004Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Proceedings Article
Beier, René
Vöcking, Berthold
2004Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Journal Article
Beier, Rene
Vöcking, Berthold
2003Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
Proceedings Article
Hide details for Knapsack problem - Random instances - Experimental study - Pareto optimalityKnapsack problem - Random instances - Experimental study - Pareto optimality
Beier, René
Vöcking, Berthold
2006Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
Journal Article
Hide details for KomplexitaetstheorieKomplexitaetstheorie
Mehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Mehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Hide details for Kürzeste-Wege-BerechnungKürzeste-Wege-Berechnung
Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
1997Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132
Proceedings Article
Hide details for Language equationsLanguage equations
Jez, Artur
Okhotin, Alexander
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
Jez, Artur
Okhotin, Alexander
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Proceedings Article
Hide details for Latent Semantic IndexingLatent Semantic Indexing
Bast, Holger
Majumdar, Debapriyo
2005Attachment IconWhy Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18
Proceedings Article
Hide details for latticelattice
Elbassioni, Khaled M.2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
Hide details for latticeslattices
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2000Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Journal Article
Hide details for LayoutLayout
Mutzel, Petra
Eades, Peter
1999Graph Drawing Algorithms
In: Algorithms & Theory of Computation Handbook, 9-1-9-26
Part of a Book
Hide details for LectinsLectins
Neumann, Dirk
Kohlbacher, Oliver
Haltner, Eleonore
Lenhof, Hans-Peter
Lehr, Claus-Michael
2000Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233
Proceedings Article
Hide details for LEDALEDA
Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
1999Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Proceedings Article
Mehlhorn, Kurt
Müller, Michael
Näher, Stefan
Schirra, Stefan
Seel, Michael
Uhrig, Christian
Ziegler, Joachim
1997A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
Mehlhorn, Kurt
Schirra, Stefan
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
Schirra, Stefan1999A Case Study on the Cost of Geometric Computing
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 156-176
Proceedings Article
Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
Hide details for Levenshtein DistanceLevenshtein Distance
Burkhardt, Stefan
Kärkkäinen, Juha
2002One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234
Proceedings Article
Hide details for LibraryLibrary
Alberts, David
Gutwenger, Carsten
Mutzel, Petra
Näher, Stefan
1997AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123
Proceedings Article
Hide details for limiting distributionlimiting distribution
Gao, Pu (Jane)2011Distribution of spanning regular subgraphs in random graphsUnpublished/Draft
Hide details for line segmentsline segments
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
Hide details for Line simplificationLine simplification
de Berg, Marc
van Kreveld, Marc
Schirra, Stefan
1998Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
Journal Article
Hide details for Linear complementarity problem (LCP)Linear complementarity problem (LCP)
El Kahoui, M'hammed2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
Journal Article
Hide details for linear programminglinear programming
Krysta, Piotr
Solis-Oba, Roberto
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
Proceedings Article
Hide details for linear systemslinear systems
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
1998Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
Proceedings Article
Hide details for List-RankingList-Ranking
Sibeyn, Jop F.1999Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Proceedings Article
Hide details for List RankingList Ranking
Lambert, Oliver
Sibeyn, Jop F.
1999Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460
Proceedings Article
Hide details for Load BalancingLoad Balancing
Bast, Hannah2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Journal Article
Bast, Hannah1998Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191
Proceedings Article
Hert, Susan
Richards, Brad
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
Sanders, Peter2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
Hide details for load balancing random loadsload balancing random loads
Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
Hide details for Local algorithmLocal algorithm
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
2011Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Journal Article
Hide details for Location FreenessLocation Freeness
Funke, Stefan
Rauf, Imran
2007Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100
Proceedings Article
Hide details for lock-freelock-free
Gidenstam, Anders
Papatriantafilou, Marina
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
Hide details for LoopsLoops
Bast, Hannah2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Journal Article
Hide details for Lossy minimization.Lossy minimization.
Jez, Artur
Maletti, Andreas
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Journal Article
Hide details for LovLov
Hide details for '{a}sz Local Lemma'{a}sz Local Lemma
Schweitzer, Pascal2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
Hide details for low-discrepancy point setslow-discrepancy point sets
Doerr, Benjamin
Gnewuch, Michael
Srivastav, Anand
2005Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
Journal Article
Hide details for lower boundlower bound
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
Fleischer, Rudolf1999Decision trees: old and new results
In: Information and computation [152], 44-61
Journal Article
Polzin, Tobias
Vahdati Daneshmand, Siavash
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Journal Article
Polzin, Tobias
Vahdati Daneshmand, Siavash
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Journal Article
Polzin, Tobias
Vahdati Daneshmand, Siavash
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Proceedings Article
Hide details for Lower EnvelopesLower Envelopes
Berberich, Eric
Meyerovitch, Michal
2007Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Proceedings Article
Berberich, Eric
Sagraloff, Michael
2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
Hide details for LP relaxationLP relaxation
Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
Hide details for manifoldsmanifolds
Michail, Dimitrios2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for Map LabelingMap Labeling
Klau, Gunnar W.
Mutzel, Petra
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Proceedings Article
Hide details for MappingMapping
Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
Hide details for Market EquilibriaMarket Equilibria
Beier, René
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold
2006Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
Journal Article
Hide details for massive data setmassive data set
Chang, Kevin L.
Kannan, Ravi
2006Attachment IconThe Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166
Proceedings Article
Hide details for massive data setsmassive data sets
Chang, Kevin2007Attachment IconMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
Proceedings Article
Hide details for MastermindMastermind
Doerr, Benjamin
Winzen, Carola
2012Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
Hide details for matchingmatching
Pettie, Seth
Sanders, Peter
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
Sanders, Peter
Solis-Oba, Roberto
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
Hide details for matchingsmatchings
Mehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
Hide details for Mathematical economicsMathematical economics
Fekete, Sandor P.
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
Hide details for Mathematical Techniques--GeometryMathematical Techniques--Geometry
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
Hide details for Mathematical Techniques--TreesMathematical Techniques--Trees
Mehlhorn, Kurt
Näher, Stefan
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Journal Article
Hide details for mathematicsmathematics
Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for matrix multiplication.matrix multiplication.
Milosavljevic, Nikola
Morozov, Dmitriy
Skraba, Primoz
2011Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225
Proceedings Article
Hide details for matroidmatroid
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Hide details for Max-CutMax-Cut
De Simone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
Suchy, Ondrej
2012Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
Hide details for max-min fairnessmax-min fairness
Epstein, Leah
van Stee, Rob
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
Hide details for Maximal frequent setMaximal frequent set
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Hide details for maximum flowmaximum flow
Sanders, Peter
Egner, Sebastian
Korst, Jan
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
Hide details for maximum load deviationmaximum load deviation
Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
Hide details for maximum weight matchingmaximum weight matching
Pettie, Seth
Sanders, Peter
2004Attachment IconA simpler linear time 2/3 - eps approximation for maximum weight matching
In: Information Processing Letters [91], 271-276
Journal Article
Hide details for mean payoff gamesmean payoff games
Moehring, Rolf H.
Skutella, Martin
Stork, Frederik
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Journal Article
Hide details for membership queriesmembership queries
Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M.
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Journal Article
Hide details for memory-restricted algorithmsmemory-restricted algorithms
Doerr, Benjamin
Winzen, Carola
2012Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
Hide details for memory hierarchymemory hierarchy
Sanders, Peter1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
Hide details for MengeMenge
Mehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Mehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Hide details for MeshesMeshes
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
Meyer, Ulrich1995Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Thesis - Master's thesis
Meyer, Ulrich
Sibeyn, Jop F.
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Journal Article
Meyer, Ulrich
Sibeyn, Jop F.
1998Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Proceedings Article
Sibeyn, Jop F.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
Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
Hide details for meshingmeshing
Berberich, Eric
Sagraloff, Michael
2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
Hide details for Meticulous AnalysisMeticulous Analysis
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
Hide details for metric spacesmetric spaces
Hagedoorn, Michiel2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
Hide details for MIMDMIMD
Jurkiewicz, Tomasz
Danilewski, Piotr
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
Hide details for Min-Max Priority QueuesMin-Max Priority Queues
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
Hide details for MinimizationMinimization
Jez, Artur
Maletti, Andreas
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Journal Article
Hide details for Minimum Cycle BasisMinimum Cycle Basis
Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article
Hide details for Minimum DiameterMinimum Diameter
Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
Hide details for Minimum Fill-InMinimum Fill-In
Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve
2011Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
Proceedings Article
Hide details for Mixed CriticalityMixed Criticality
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2010Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen
2011Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
Hide details for Möbius transformationsMöbius transformations
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
Hide details for Modified Uspensky methodModified Uspensky method
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
Hide details for Modular ArithmeticModular Arithmetic
Hemmer, Michael2008CGAL package for modular arithmetic operationsReport
Hide details for Molecular ModelingMolecular Modeling
Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter
1999BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344
Proceedings Article
Kohlbacher, Oliver
Lenhof, Hans-Peter
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Proceedings Article
Hide details for momentsmoments
Gao, Pu (Jane)2011Distribution of spanning regular subgraphs in random graphsUnpublished/Draft
Hide details for Monotone Boolean dualizationMonotone Boolean dualization
Elbassioni, Khaled
Rauf, Imran
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
Hide details for Monotone Boolean functionMonotone Boolean function
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Hide details for monotone discrete binary functionsmonotone discrete binary functions
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
Hide details for monotone inequalitiesmonotone inequalities
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
Hide details for Mordell-Weil groupMordell-Weil group
Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
Hide details for Motion PlanningMotion Planning
Hert, Susan2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
Hert, Susan
Richards, Brad
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
Hide details for MSIMDMSIMD
Jurkiewicz, Tomasz
Danilewski, Piotr
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
Hide details for Multi-Objective OptimizationMulti-Objective Optimization
Bringmann, Karl
Friedrich, Tobias
Neumann, Frank
Wagner, Markus
2011Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203
Proceedings Article
Hide details for multi mergemulti merge
Sanders, Peter1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
Hide details for multicommodity flowmulticommodity flow
Martens, Maren
Skutella, Martin
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
Hide details for multicore algorithmsmulticore algorithms
Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - Doctoral dissertation
Jurkiewicz, Tomasz
Danilewski, Piotr
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
Hide details for multicoresmulticores
Gidenstam, Anders
Papatriantafilou, Marina
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
Hide details for Multiobjective OptimizationMultiobjective Optimization
Bringmann, Karl
Friedrich, Tobias
2011Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752
Proceedings Article
Hide details for multiple robotsmultiple robots
Hert, Susan
Richards, Brad
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
Hide details for multipoint evaluationmultipoint evaluation
Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Hide details for MultiprocessorMultiprocessor
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
2012Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Journal Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
2010Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
Proceedings Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
2012Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Journal Article
Hide details for multiprocessorsmultiprocessors
Gidenstam, Anders
Papatriantafilou, Marina
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
Hide details for multithreaded computationsmultithreaded computations
Fatourou, Panagiota
Spirakis, Paul G.
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Journal Article
Hide details for multithreadingmultithreading
Gidenstam, Anders
Papatriantafilou, Marina
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
Hide details for NarrowingNarrowing
Mehlhorn, Kurt
Thiel, Sven
2000Attachment IconFaster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319
Proceedings Article
Hide details for natural adaptive networksnatural adaptive networks
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article
Hide details for natural algorithmnatural algorithm
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article
Hide details for nearest neighbor load balancing algorithmnearest neighbor load balancing algorithm
Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
Hide details for nearest neighborsnearest neighbors
Hagedoorn, Michiel2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
Hide details for network designnetwork design
Garg, Naveen
Konjevod, Goran
Ravi, R.
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
Hide details for Network flowNetwork flow
Althaus, Ernst
Mehlhorn, Kurt
1998Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
Journal Article
Hall, Alex
Hippler, Steffen
Skutella, Martin
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
Martens, Maren
Skutella, Martin
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
Hide details for Network FlowsNetwork Flows
Rauf, Imran2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Network Routing GamesNetwork Routing Games
Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido
2010Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
Hide details for NetworksNetworks
Maggs, Bruce M.
Vöcking, Berthold
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
Meyer, Ulrich
Sibeyn, Jop F.
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Journal Article
Naujoks, Rouven2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for noiseless codingnoiseless coding
Altenkamp, Doris
Mehlhorn, Kurt
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article
Hide details for non-trivial cyclesnon-trivial cycles
Kutz, Martin2006Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437
Proceedings Article
Hide details for nonuniform deterministic simulationnonuniform deterministic simulation
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
Hide details for Normal polynomialsNormal polynomials
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
Hide details for NP-completenessNP-completeness
Krysta, Piotr
Pacholski, Leszek
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
Journal Article
Hide details for NP-hardNP-hard
Bast, Hannah
Hert, Susan
2000The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Proceedings Article
Sitters, Rene2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
Solis-Oba, Roberto19982-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452
Proceedings Article
Hide details for numerical integrationnumerical integration
Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
Hide details for Numerical solverNumerical solver
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article
Hide details for Object ModelingObject Modeling
Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
Hide details for object oriented programmingobject oriented programming
Mehlhorn, Kurt
Näher, Stefan
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
Hide details for observerobserver
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
Hide details for On-line algorithmOn-line algorithm
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
2011Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Journal Article
Hide details for on-line algorithmson-line algorithms
Csaba, Bela
Lodha, Sachin
2001A randomized on-line algorithm for the k-server problem on a lineReport
Hide details for One-Sided Crossing MinimizationOne-Sided Crossing Minimization
Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
Hide details for One variable equationsOne variable equations
Jez, Artur2013Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Proceedings Article
Hide details for online algorithmonline algorithm
Fleischer, Rudolf1998On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Proceedings Article
Mütze, Torsten
Rast, Thomas
Spöhel, Reto
2011Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Proceedings Article
Hide details for Online AlgorithmsOnline Algorithms
Angelopoulos, Spyros2007Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257
Proceedings Article
Angelopoulos, Spyros
Dorrigiv, Reza
López-Ortiz, Alejandro
2007On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237
Proceedings Article
Bein, Wolfgang W.
Fleischer, Rudolf
Larmore, Lawrence L.
2000Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
Journal Article
Epstein, Leah
Imreh, Csanád
van Stee, Rob
2002More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
Proceedings Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
Epstein, Leah
van Stee, Rob
2011Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Journal Article
Epstein, Leah
van Stee, Rob
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Journal Article
Epstein, Leah
van Stee, Rob
2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
Fotakis, Dimitris2004Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Proceedings Article
Fotakis, Dimitris2003Attachment IconOn the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652
Proceedings Article
Sanders, Peter
Singler, Johannes
van Stee, Rob
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
van Stee, Rob2011Attachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
van Stee, Rob2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
van Stee, Rob2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
van Stee, Rob2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
Hide details for online processonline process
Belfrage, Michael
Mütze, Torsten
Spöhel, Reto
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article
Hide details for Operations ResearchOperations Research
Althaus, Ernst
Funke, Stefan
Har-Peled, Sariel
Könemann, Jochen
Ramos, Edgar A.
Skutella, Martin
2005Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
Journal Article
Sanders, Peter
Takkula, Tuomo
Wedelin, Dag
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
Hide details for optimal networksoptimal networks
Mehlhorn, Kurt1983$AT^2$-optimal VLSI for integer division and integer square rootingReport
Mehlhorn, Kurt
Preparata, Franco P.
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeReport
Hide details for OptimizationOptimization
Christof, Thomas
Jünger, Michael
Kececioglu, John
Mutzel, Petra
Reinelt, Gerhard
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Mutzel, Petra
Weiskircher, René
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
Solis-Oba, Roberto
Frederickson, Greg N.
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
Hide details for optimization heuristicsoptimization heuristics
Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
Hide details for Optimization problemsOptimization problems
Beier, René
Vöcking, Berthold
2006Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Journal Article
Beier, Rene
Vöcking, Berthold
2004Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
Proceedings Article
Hide details for orthogonalorthogonal
Klau, Gunnar W.1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Thesis - Master's thesis
Hide details for output maximizationoutput maximization
Wagner, Markus
Veeramachaneni, Kalyan
Neumann, Frank
O'Reilly, Una-May
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
Hide details for packet switchingpacket switching
van Stee, Rob2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
Hide details for PagingPaging
Angelopoulos, Spyros
Dorrigiv, Reza
López-Ortiz, Alejandro
2007On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237
Proceedings Article
Bein, Wolfgang W.
Fleischer, Rudolf
Larmore, Lawrence L.
2000Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
Journal Article
van Stee, Rob2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
Hide details for Pairing HeapsPairing Heaps
Elmasry, Amr2009Attachment IconPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
Proceedings Article
Hide details for ParallelParallel
Bast, Hannah2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Journal Article
Lambert, Oliver
Sibeyn, Jop F.
1999Parallel and External List Ranking and Connected Components on a Cluster of Workstations
In: Proceedings of the 11th International Conference on Parallel and Distributed Computing and Systems (PDCS-99), 454-460
Proceedings Article
Meyer, Ulrich
Sanders, Peter
2000Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
Hide details for parallel algorithm analysisparallel algorithm analysis
Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
Hide details for parallel algorithmsparallel algorithms
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2000Attachment IconAn Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14
Journal Article
Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - Doctoral dissertation
Jurkiewicz, Tomasz
Danilewski, Piotr
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
Meyer, Ulrich2002Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75
Proceedings Article
Hide details for parallel backtrack searchparallel backtrack search
Sanders, Peter1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
Hide details for Parallel ComputationParallel Computation
Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
1998Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
Meyer, Ulrich1995Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Thesis - Master's thesis
Meyer, Ulrich
Sanders, Peter
1998$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
Hide details for Parallel ComputingParallel Computing
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
Sibeyn, Jop F.1999Ultimate Parallel List Ranking?
In: Proceedings of the 6th International Conference on High Performance Computing (HiPC-99), 197-201
Proceedings Article
Hide details for parallel disksparallel disks
Sanders, Peter2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
Sanders, Peter
Egner, Sebastian
Korst, Jan
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
Hide details for Parallel linear algebra. Tridiagonal systems. Alternating direction implicit methodParallel linear algebra. Tridiagonal systems. Alternating direction implicit method
Rathe, Ulrich
Sanders, Peter
Knight, Peter
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
Hide details for Parallel LoopParallel Loop
Bast, Hannah1998Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191
Proceedings Article
Hide details for Parallel LoopsParallel Loops
Bast, Hannah2000Attachment IconProvably Optimal Scheduling of Similar Tasks
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for parallel processingparallel processing
Mehlhorn, Kurt
Preparata, Franco P.
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeReport
Sanders, Peter
Sibeyn, Jop F.
2000A Bandwidth Latency Tradeoff for Broadcast and Reduction
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 918-926
Proceedings Article
Sanders, Peter
Solis-Oba, Roberto
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings Article
Sanders, Peter
Takkula, Tuomo
Wedelin, Dag
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
Hide details for parallel RAMparallel RAM
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
Hide details for parallel random permutationparallel random permutation
Sanders, Peter1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
Hide details for Parameterized AlgorithmsParameterized Algorithms
Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S.
2010Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese
2011Attachment IconPattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193
Proceedings Article
Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese
2011Attachment IconThe Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64
Proceedings Article
Kim, Eun Jung
Paul, Christophe
Philip, Geevarghese
2012Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
Proceedings Article
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2011Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109
Proceedings Article
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
2012Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
Journal Article
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
2010Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280
Proceedings Article
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
Suchy, Ondrej
2012Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
Hide details for Parameterized ComplexityParameterized Complexity
Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket
2010Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
Kratsch, Stefan2009Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612
Electronic Proceedings Article
Kratsch, Stefan
Wahlström, Magnus
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2010Attachment IconThe effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107
Proceedings Article
Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath
2009Attachment IconSolving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705
Proceedings Article
Hide details for Parametric SearchParametric Search
Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
Schwerdt, Jörg
Smid, Michiel
Schirra, Stefan
1997Computing the Minimum Diameter for Moving Points: An Exact Implementation using Parametric Search
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 466-468
Proceedings Article
Hide details for parametric searchingparametric searching
Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
Hide details for Parking FunctionsParking Functions
Cameron, Peter
Johannsen, Daniel
Prellberg, Thomas
Schweitzer, Pascal
2008Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Electronic Journal Article
Hide details for Partition treesPartition trees
Arya, Sunil
Mount, David M.
2000Approximate range searching
In: Computational Geometry [17], 135-152
Journal Article
Hide details for Path planningPath planning
Lee, Jae-Ha
Cheong, Otfried
Kwon, Woo-Cheol
Shin, Sung-Yong
Chwa, Kyung-Yong
2000Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325
Proceedings Article
Hide details for Pathwidth-One DeletionPathwidth-One Deletion
Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
Hide details for pattern matchingpattern matching
Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
Hide details for PerformancePerformance
Bast, Holger
Majumdar, Debapriyo
Weber, Ingmar
2007Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article
Hide details for Periodic Task SystemPeriodic Task System
Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole
2010Attachment IconAlgorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359
Proceedings Article
Hide details for Permutation RoutingPermutation Routing
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
Hide details for PersistencePersistence
Thiel, Sven1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Persistent data structuresPersistent data structures
Thiel, Sven1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Master's thesis
Hide details for PerturbationPerturbation
Comes, Jochen
Ziegelmann, Mark
1999An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Proceedings Article
Hide details for PhysarumPhysarum
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
2012Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
Hide details for Planar AugmentationPlanar Augmentation
Fialko, Sergej
Mutzel, Petra
1998A new approximation algorithm for the planar augmentation problem
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 260-269
Proceedings Article
Hide details for planar graphplanar graph
Kutz, Martin2006Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437
Proceedings Article
Schweitzer, Pascal
Schweitzer, Patrick
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
Hide details for Planar GraphsPlanar Graphs
Panagiotou, Konstantinos
Steger, Angelika
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Proceedings Article
Hide details for PlanarizationPlanarization
Weiskircher, Rene1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Master's thesis
Hide details for plottingplotting
Emeliyanenko, Pavel
Kerber, Michael
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Proceedings Article
Hide details for Point locationPoint location
Thiel, Sven1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Master's thesis
Hide details for pointspoints
Elbassioni, Khaled M.2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
Hide details for Polygon CoveringPolygon Covering
Kumar, V. S. Anil
Ramesh, Hariharan
1999Covering Rectilinear Polygons with Axis-Parallel Rectangles
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 445-454
Proceedings Article
Hide details for polygon partitioningpolygon partitioning
Bast, Hannah
Hert, Susan
2000The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Proceedings Article
Hert, Susan2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
Hert, Susan
Richards, Brad
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
Proceedings Article
Hide details for polygonspolygons
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
2002Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
Hide details for Polyhedral CombinatoricsPolyhedral Combinatorics
De Simone, Caterina
Diehl, Martin
Jünger, Michael
Mutzel, Petra
Reinelt, Gerhard
Rinaldi, Giovanni
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
Jünger, Michael
Lee, E. K.
Mutzel, Petra
Odenthal, Thomas
1997A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24
Proceedings Article
Weiskircher, Rene1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Master's thesis
Hide details for polyline fittingpolyline fitting
Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
Hide details for PolymatroidPolymatroid
Hide details for Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, VladimirBoros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
[Replication or Save Conflict]
Hide details for polymatroid functionpolymatroid function
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
Hide details for polymatroid functionspolymatroid functions
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article
Elbassioni, Khaled M.2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
Hide details for Polynomial-time approximation algorithmsPolynomial-time approximation algorithms
Fotakis, Dimitris
Spirakis, Paul G.
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Journal Article
Hide details for polynomial average time algorithmspolynomial average time algorithms
Dubhashi, Devdatt
Ranjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
Hide details for polynomial average time.polynomial average time.
Subramanian, C. R.1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Journal Article
Hide details for polynomial divisionpolynomial division
Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Hide details for Polynomial gcdPolynomial gcd
Kerber, Michael2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Journal Article
Hide details for polynomial interpolationpolynomial interpolation
Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Hide details for Polynomial KernelsPolynomial Kernels
Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket
2010Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Proceedings Article
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
2012Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Journal Article
Hide details for Polynomial real root isolationPolynomial real root isolation
Eigenwillig, Arno
Sharma, Vikram
Yap, Chee K.
2006Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
Electronic Proceedings Article
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
Hide details for Polynomial systemsPolynomial systems
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article
Hide details for polynomial time approximation schemepolynomial time approximation scheme
Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
Hide details for posetposet
Elbassioni, Khaled M.2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
Hide details for poset.poset.
Elbassioni, Khaled M.2002Attachment IconOn Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
Proceedings Article
Hide details for positional gamepositional game
Kutz, Martin2005Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36
Proceedings Article
Hide details for Power ControlPower Control
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2004Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Proceedings Article
Hide details for power of choicespower of choices
Krivelevich, Michael
Spöhel, Reto
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
Hide details for PRAMPRAM
Alt, Helmut
Hagerup, Torben
Mehlhorn, Kurt
Preparata, Franco P.
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
1998Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
Meyer, Ulrich
Sanders, Peter
2000Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
Hide details for PRAM SimulationPRAM Simulation
Meyer, Ulrich1995Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Thesis - Master's thesis
Hide details for precedence constraintsprecedence constraints
Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
Hide details for precisionprecision
Schirra, Stefan2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
Hide details for Precision ProblemPrecision Problem
Schirra, Stefan1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
Hide details for preemptionpreemption
Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
Sitters, Rene2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
Hide details for Preemptive SchedulingPreemptive Scheduling
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen
2011Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
Hide details for PrefetchingPrefetching
Sanders, Peter
Singler, Johannes
van Stee, Rob
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
Hide details for prefix codesprefix codes
Altenkamp, Doris
Mehlhorn, Kurt
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article
Hide details for PreprocessingPreprocessing
Maue, Jens
Sanders, Peter
Matijevic, Domagoj
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
Hide details for Preprocessing HeuristicsPreprocessing Heuristics
Maue, Jens2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Thesis - Master's thesis
Hide details for price of anarchyprice of anarchy
Epstein, Leah
van Stee, Rob
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
Hide details for Price of fairnessPrice of fairness
Heydrich, Sandy
van Stee, Rob
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
Hide details for price of stabilityprice of stability
Christodoulou, George
Chung, Christine
Ligett, Katrina
Pyrga, Evangelia
van Stee, Rob
2010Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
Proceedings Article
Hide details for Primal-dual algorithms - Approximation algorithms - Min-sum scheduling problemsPrimal-dual algorithms - Approximation algorithms - Min-sum scheduling problems
Gandhi, Rajiv
Mestre, Julián
2009Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
Journal Article
Hide details for Priority DequesPriority Deques
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
Hide details for priority queuespriority queues
Crauser, Andreas
Meyer, Ulrich
Brengel, Klaus
2001An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24
Unpublished/Draft
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
Hide details for probabalistic analysisprobabalistic analysis
Dubhashi, Devdatt
Ranjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
Hide details for probabilistic analysis.probabilistic analysis.
Subramanian, C. R.
Fürer, Martin
Veni Madhavan, C. E.
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Journal Article
Hide details for probabilistic methodsprobabilistic methods
Doerr, Benjamin
Gnewuch, Michael
Srivastav, Anand
2005Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
Journal Article
Hide details for processing modulesprocessing modules
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for Processor Speedup FactorProcessor Speedup Factor
Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
2010Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Journal Article
Hide details for project schedulingproject scheduling
Moehring, Rolf H.
Skutella, Martin
Stork, Frederik
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Journal Article
Hide details for PropagationPropagation
Mehlhorn, Kurt
Thiel, Sven
2000Attachment IconFaster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319
Proceedings Article
Hide details for Pursuit-evasionPursuit-evasion
Lee, Jae-Ha
Park, Sang-Min
Chwa, Kyung-Yong
2000Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220
Journal Article
Hide details for Quadratic Interval RefinementQuadratic Interval Refinement
Kerber, Michael2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
Hide details for QuadricsQuadrics
Berberich, Eric
Meyerovitch, Michal
2007Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Proceedings Article
Berberich, Eric
Sagraloff, Michael
2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar
2007Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
Hemmer, Michael2008Evaluation of different approaches in 3D curved kernel for arrangements of quadricsReport
Hemmer, Michael2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - Doctoral dissertation
Hemmer, Michael2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Thesis - Master's thesis
Hemmer, Michael
Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
Lennerz, Christian
Schömer, Elmar
2002Efficient Distance Computation for Quadratic Curves and Surfaces
In: Proceedings of the 2nd Conference on Geometric Modeling and Processing, 60-69
Proceedings Article
Limbach, Sebastian2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Thesis - Master's thesis
Hide details for QUASARQUASAR
Burkhardt, Stefan
Crauser, Andreas
Ferragina, Paolo
Lenhof, Hans-Peter
Rivals, Eric
Vingron, Martin
1999q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article
Hide details for quasi-polynomial timequasi-polynomial time
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
Hide details for quasi-polynomial.quasi-polynomial.
Elbassioni, Khaled M.2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
Hide details for Quasi-RandomnessQuasi-Randomness
Winzen, Carola2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
Hide details for QuasirandomnessQuasirandomness
Doerr, Benjamin
Friedrich, Tobias
2006Attachment IconQuasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
Journal Article
Hide details for query complexityquery complexity
Doerr, Benjamin
Winzen, Carola
2012Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
Hide details for Ramsey propertyRamsey property
Belfrage, Michael
Mütze, Torsten
Spöhel, Reto
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article
Hide details for Ramsey TheoryRamsey Theory
Doerr, Benjamin
Hebbinghaus, Nils
2005Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
Proceedings Article
Schweitzer, Pascal2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal Article
Hide details for random access machinerandom access machine
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
Hide details for random graphrandom graph
Belfrage, Michael
Mütze, Torsten
Spöhel, Reto
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article
Gao, Pu (Jane)2011Distribution of spanning regular subgraphs in random graphsUnpublished/Draft
Gao, Pu (Jane)
Wormald, Nicholas
Su, Yi
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
Krivelevich, Michael
Spöhel, Reto
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
Mütze, Torsten
Rast, Thomas
Spöhel, Reto
2011Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Proceedings Article
Subramanian, C. R.2000Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77
Journal Article
Hide details for random graphsrandom graphs
Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
1998Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
Dubhashi, Devdatt
Ranjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
Meyer, Ulrich
Sanders, Peter
1998$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
Subramanian, C. R.1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Journal Article
Hide details for random insertions and deletionsrandom insertions and deletions
Mehlhorn, Kurt1982Attachment IconA Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
In: SIAM Journal on Computing [11], 748-760
Journal Article
Hide details for random permutationrandom permutation
Dementiev, Roman
Sanders, Peter
Schultes, Dominik
Sibeyn, Jop F.
2004Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
Hide details for random planar graphs sampling enumerationrandom planar graphs sampling enumeration
Bodirsky, Manuel
Gröpl, Clemens
Johannsen, Daniel
Kang, Mihyun
2007Attachment IconA Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
Journal Article
Johannsen, Daniel2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Thesis - Master's thesis
Hide details for Random StructuresRandom Structures
Panagiotou, Konstantinos
Steger, Angelika
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Proceedings Article
Hide details for Random walkRandom walk
Doerr, Benjamin
Friedrich, Tobias
2006Attachment IconQuasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
Journal Article
Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
2006Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
Hide details for RandomizedRandomized
Baswana, Surender
Sen, Sandeep
2004Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book
Hide details for randomized algorithmrandomized algorithm
Dietzfelbinger, Martin
Karlin, Anna
Mehlhorn, Kurt
Meyer Auf Der Heide, Friedhelm
Rohnert, Hans
Tarjan, Robert E.
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
Sanders, Peter
Egner, Sebastian
Korst, Jan
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
Hide details for Randomized algorithmsRandomized algorithms
Bein, Wolfgang W.
Fleischer, Rudolf
Larmore, Lawrence L.
2000Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162
Journal Article
Karp, Richard
Schindelhauer, Christian
Shenker, Scott
Vöcking, Berthold
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
Mehlhorn, Kurt
Kavitha, T.
Hariharan, R.
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
Winzen, Carola2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
Hide details for randomized load balancing algorithmrandomized load balancing algorithm
Sanders, Peter1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
Hide details for Randomized Local SearchRandomized Local Search
Doerr, Benjamin
Johannsen, Daniel
2007Attachment IconAdjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
Proceedings Article
Hide details for Randomized RoundingRandomized Rounding
Doerr, Benjamin2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Journal Article
Garg, Naveen
Konjevod, Goran
Ravi, R.
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
Martens, Maren
Skutella, Martin
2004Flows on Few Paths: Algorithms and Lower Bounds
In: Algorithms – ESA 2004: 12th Annual European Symposium, 520-531
Proceedings Article
Hide details for Randomized search heuristicsRandomized search heuristics
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Journal Article
Doerr, Benjamin
Winzen, Carola
2011Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
Proceedings Article
Hide details for Range searchingRange searching
Arya, Sunil
Mount, David M.
2000Approximate range searching
In: Computational Geometry [17], 135-152
Journal Article
Hide details for rankrank
Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
Hide details for rank-maximalrank-maximal
Mehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
Hide details for Rapid PrototypingRapid Prototyping
Comes, Jochen
Ziegelmann, Mark
1999An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Proceedings Article
Hide details for Rapid Software PrototypingRapid Software Prototyping
Kohlbacher, Oliver
Lenhof, Hans-Peter
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Proceedings Article
Hide details for ReadabilityReadability
Elbassioni, Khaled
Rauf, Imran
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
Hide details for Real-Time SchedulingReal-Time Scheduling
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2010Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article
Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole
2010Attachment IconAlgorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359
Proceedings Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
2012Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Journal Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
2010Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
Proceedings Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
2012Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Journal Article
Hide details for real algebraic numbersreal algebraic numbers
Schmitt, Susanne2005Attachment IconThe diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366
Proceedings Article
Schmitt, Susanne2003Common Subexpression Search in LEDA_realsReport
Schmitt, Susanne2003The Diamond Operator for Real Algebraic NumbersReport
Hide details for Real Root IsolationReal Root Isolation
Kerber, Michael2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
Hide details for realsreals
Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
1999Attachment IconEfficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350
Proceedings Article
Hide details for RecompressionRecompression
Jez, Artur2013Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Proceedings Article
Hide details for reconfiguration overheadreconfiguration overhead
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for rectangle packingrectangle packing
Harren, Rolf
van Stee, Rob
2009Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Proceedings Article
Harren, Rolf
van Stee, Rob
2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
Hide details for Recursion tree analysisRecursion tree analysis
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
Hide details for redundant assignmentsredundant assignments
Fotakis, Dimitris
Spirakis, Paul G.
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Journal Article
Hide details for regression analysisregression analysis
Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
2006Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116
Journal Article
Hide details for regular discrete functionsregular discrete functions
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
Hide details for regular discrete functions.regular discrete functions.
Boros, Endre
Elbassioni, Khaled M.
Khachiyan, Leonid
Gurvich, Vladimir
Makino, Kazuhisa
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
Hide details for RelaxationRelaxation
Polzin, Tobias
Vahdati Daneshmand, Siavash
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Journal Article
Polzin, Tobias
Vahdati Daneshmand, Siavash
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Journal Article
Polzin, Tobias
Vahdati Daneshmand, Siavash
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Proceedings Article
Hide details for Resource augmentationResource augmentation
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
2011Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Journal Article
Hide details for Resource managementResource management
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for resultantsresultants
Berberich, Eric
Eigenwillig, Arno
Hemmer, Michael
Hert, Susan
Mehlhorn, Kurt
Schömer, Elmar
2002Attachment IconA Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186
Proceedings Article
Hemmer, Michael2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Rigid body simulationsRigid body simulations
El Kahoui, M'hammed2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
Journal Article
Hide details for roboticsrobotics
Bast, Hannah
Hert, Susan
2000The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Proceedings Article
Hert, Susan2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
Sridharan, K
Subramanian, C. R.
Sudha, N
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Journal Article
Hide details for robustnessrobustness
Berberich, Eric
Kerber, Michael
2008Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Proceedings Article
Eigenwillig, Arno
Kettner, Lutz
Schömer, Elmar
Wolpert, Nicola
2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
Funke, Stefan
Mehlhorn, Kurt
2002LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118
Journal Article
Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
Schirra, Stefan2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
Schirra, Stefan1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
Hide details for rolling motionrolling motion
Warken, Thomas
Schömer, Elmar
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
Hide details for Root ApproximationRoot Approximation
Kerber, Michael2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
Hide details for root isolationroot isolation
Eigenwillig, Arno2007Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Journal Article
Hide details for root refinementroot refinement
Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Hide details for root separationroot separation
Eigenwillig, Arno2007Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Journal Article
Hide details for Root separation boundsRoot separation bounds
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
Hide details for Root SolvingRoot Solving
Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis
2008Cross-benchmarks of univariate algebraic kernelsReport
Hide details for RotationRotation
Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
2007Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Proceedings Article
Hide details for RoutingRouting
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2004Attachment IconConstant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111
Proceedings Article
Hall, Alex
Hippler, Steffen
Skutella, Martin
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
Proceedings Article
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
Kaufmann, Michael
Meyer, Ulrich
Sibeyn, Jop F.
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
Maggs, Bruce M.
Vöcking, Berthold
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
Meyer, Ulrich
Sibeyn, Jop F.
1998Gossiping Large Packets on Full-Port Tori
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1040-1046
Proceedings Article
Sibeyn, Jop F.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
Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
Hide details for Row-MajorRow-Major
Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
Hide details for Rumor SpreadingRumor Spreading
Winzen, Carola2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
Hide details for running time analysisrunning time analysis
Doerr, Benjamin
Winzen, Carola
2012Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
Proceedings Article
Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
Hide details for Runtime AnalysisRuntime Analysis
Doerr, Benjamin
Johannsen, Daniel
2007Attachment IconAdjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
Proceedings Article
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Journal Article
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2010Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974
Proceedings Article
Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola
2013Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
Journal Article
Hide details for Safety-Critical SystemsSafety-Critical Systems
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen
2011Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
Hide details for SatisfiabilitySatisfiability
Johannsen, Daniel
Razgon, Igor
Wahlström, Magnus
2009Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Proceedings Article
Hide details for scenescene
Mehlhorn, Kurt
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal Article
Hide details for SchedulabilitySchedulability
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
2010Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article
Hide details for Schedulability testSchedulability test
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
2012Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Journal Article
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
2010Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
Proceedings Article
Hide details for SchedulingScheduling
Bast, Hannah2000On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563
Journal Article
Bast, Hannah2000Attachment IconProvably Optimal Scheduling of Similar Tasks
Universität des Saarlandes
Thesis - Doctoral dissertation
Bast, Hannah1998Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191
Proceedings Article
Epstein, Leah
van Stee, Rob
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
Epstein, Leah
van Stee, Rob
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
Sanders, Peter2000Asynchronous Scheduling of Redundant Disk Arrays
In: Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA-00), 89-98
Proceedings Article
Sanders, Peter
Egner, Sebastian
Korst, Jan
2000Fast Concurrent Access to Parallel Disks
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 849-858
Proceedings Article
Sitters, Rene2005Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48
Journal Article
Solis-Oba, Roberto
Jansen, Klaus
Sviridenko, Maxim
1999Makespan minimization in job shops: a polynomial time approximation scheme
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399
Proceedings Article
van Stee, Rob2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
Hide details for scheduling algorithmsscheduling algorithms
Fatourou, Panagiota
Spirakis, Paul G.
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Journal Article
Hide details for scientific space instrumentscientific space instrument
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for search treesearch tree
Mehlhorn, Kurt
Näher, Stefan
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Journal Article
Hide details for search treessearch trees
Altenkamp, Doris
Mehlhorn, Kurt
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article
Mehlhorn, Kurt
Näher, Stefan
1990Bounded ordered dictionaries in $O(\log \log n)$ time and $O(n)$ space
In: Information Processing Letters [35], 183-189
Journal Article
Hide details for searchingsearching
Mehlhorn, Kurt1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Journal Article
Hide details for Second order unificationSecond order unification
Jez, Artur2014Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Proceedings Article
Hide details for secondary memorysecondary memory
Dementiev, Roman
Sanders, Peter
Schultes, Dominik
Sibeyn, Jop F.
2004Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
Hagedoorn, Michiel2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
Proceedings Article
Hide details for SelectionSelection
Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
Sibeyn, Jop F.1999External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
Proceedings Article
Hide details for Self-Adjusting StructuresSelf-Adjusting Structures
Elmasry, Amr2009Attachment IconPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
Proceedings Article
Hide details for Semi-algebraic SetsSemi-algebraic Sets
Porkolab, Lorant
Khachiyan, Leonid
1997Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171
Proceedings Article
Hide details for semi-random graphssemi-random graphs
Dubhashi, Devdatt
Ranjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
Subramanian, C. R.
Fürer, Martin
Veni Madhavan, C. E.
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Journal Article
Hide details for Semialgebraic geometrySemialgebraic geometry
El Kahoui, M'hammed2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
Journal Article
Hide details for Semidefinite ProgrammingSemidefinite Programming
Porkolab, Lorant
Khachiyan, Leonid
1997Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171
Proceedings Article
Hide details for sensor coversensor cover
Funke, Stefan
Kesselman, Alexander
Lotker, Zvi
Segal, Michael
2004Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
Proceedings Article
Hide details for separation boundseparation bound
Burnikel, Christoph
Fleischer, Rudolf
Mehlhorn, Kurt
Schirra, Stefan
2000Attachment IconA strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99
Journal Article
Hide details for separation boundsseparation bounds
Schmitt, Susanne2003The Diamond Operator for Real Algebraic NumbersReport
Hide details for Set associative cacheSet associative cache
Sanders, Peter1999Accessing Multiple Sequences Through Set Associative Caches
In: Proceedings of the 26th International Colloquium on Automata, Languages and Programming (ICALP-99), 655-664
Proceedings Article
Hide details for set coverset cover
Garg, Naveen
Konjevod, Goran
Ravi, R.
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal Article
Hide details for set cover polytopeset cover polytope
Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
Hide details for set equalityset equality
Katriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
Hide details for shape recognitionshape recognition
Hagedoorn, Michiel
Overmars, Mark H.
Veltkamp, Remco
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
Hide details for shared memoryshared memory
Gidenstam, Anders
Papatriantafilou, Marina
2007LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Proceedings Article
Hide details for shortest-pathshortest-path
Baswana, Surender
Sen, Sandeep
2004Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19
Part of a Book
Hide details for Shortest-PathsShortest-Paths
Meyer, Ulrich2002Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75
Proceedings Article
Hide details for Shortest-Paths ProblemsShortest-Paths Problems
Cooper, Colin
Frieze, Alan M.
Mehlhorn, Kurt
Priebe, Volker
2000Attachment IconAverage-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46
Journal Article
Hide details for Shortest pathShortest path
Baswana, Surender
Goyal, Vishrut
Sen, Sandeep
2005Attachment IconAll-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679
Proceedings Article
Baswana, Surender
Sen, Sandeep
2004Attachment IconApproximate distance oracle for unweighted graphs in Expected O(n²) time
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 271-280
Proceedings Article
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
2012Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
Meyer, Ulrich2001Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 797-806
Proceedings Article
Meyer, Ulrich
Sanders, Peter
2000Parallel Shortest Path for Arbitrary Graphs
In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), 461-470
Proceedings Article
Hide details for Shortest PathsShortest Paths
Maue, Jens2006Attachment IconA Goal-Directed Shortest Path Algorithm Using Precomputed Cluster Distances
Universität des Saarlandes
Thesis - Master's thesis
Maue, Jens
Sanders, Peter
Matijevic, Domagoj
2006Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327
Proceedings Article
Hide details for SIMDSIMD
Jurkiewicz, Tomasz
Danilewski, Piotr
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
Hide details for simplex algorithmsimplex algorithm
Brönnimann, Hervé
Burnikel, Christoph
Pion, Sylvain
1998Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174
Proceedings Article
Hide details for Simulated AnnealingSimulated Annealing
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
Hide details for SimulationSimulation
Schömer, Elmar
Reichel, Joachim
Warken, Thomas
Lennerz, Christian
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
Proceedings Article
Hide details for single-source shortest-path problemsingle-source shortest-path problem
Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
Journal Article
Mehlhorn, Kurt
Schäfer, Guido
2001A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 242-253
Proceedings Article
Hide details for Single Source Shortest PathSingle Source Shortest Path
Crauser, Andreas
Mehlhorn, Kurt
Meyer, Ulrich
Sanders, Peter
1998Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
Meyer, Ulrich
Sanders, Peter
1998$\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 393-404
Proceedings Article
Hide details for ski rental problemski rental problem
Fleischer, Rudolf1998On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Proceedings Article
Hide details for slime moldslime mold
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article
Hide details for sliversslivers
Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281
Proceedings Article
Hide details for SLPSLP
Jez, Artur2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings Article
Jez, Artur2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
Jez, Artur2013Attachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
Hide details for small subgraphsmall subgraph
Krivelevich, Michael
Spöhel, Reto
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
Hide details for Smoothed analysisSmoothed analysis
Beier, René
Vöcking, Berthold
2006Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
Journal Article
Hide details for smoothed analysis}smoothed analysis}
Beier, Rene
Vöcking, Berthold
2004Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
Proceedings Article
Hide details for snap roundingsnap rounding
Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
Hide details for Snippet generationSnippet generation
Celikik, Marjan
Bast, Holger
Manolache, Gabriel
2011Attachment IconEfficient Index-Based Snippet GenerationUnpublished/Draft
Hide details for Social Choice TheorySocial Choice Theory
Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
Hide details for Software LibrariesSoftware Libraries
Boghossian, Nicolas Pascal
Kohlbacher, Oliver
Lenhof, Hans-Peter
1999BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344
Proceedings Article
Brönnimann, Hervé
Kettner, Lutz
Schirra, Stefan
Veltkamp, Remco
2000Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216
Part of a Book
Crauser, Andreas
Mehlhorn, Kurt
1999Attachment IconLEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
Proceedings Article
Kettner, Lutz
Näher, Stefan
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
Kohlbacher, Oliver
Lenhof, Hans-Peter
1999Rapid Software Prototyping in Computational Molecular Biology
In: Proceedings of the German Conference on Bioinformatics (GCB'99), 81-92
Proceedings Article
Hide details for software librarysoftware library
Fabri, Andreas
Giezeman, Geert-Jan
Kettner, Lutz
Schirra, Stefan
Schönherr, Sven
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
Mehlhorn, Kurt
Näher, Stefan
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
Hide details for software reusesoftware reuse
Mehlhorn, Kurt
Näher, Stefan
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
Hide details for solar orbiter PHI instrumentsolar orbiter PHI instrument
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for solidsolid
Miklos, Balint
Giesen, Joachim
Pauly, Mark
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
Hide details for solving NP-hard problem instances to optimalitysolving NP-hard problem instances to optimality
Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
Hide details for SortierenSortieren
Mehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Mehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Hide details for SortingSorting
Maggs, Bruce M.
Vöcking, Berthold
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal Article
Hide details for sorting lower boundsorting lower bound
Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for space curvesspace curves
Berberich, Eric
Sagraloff, Michael
2008Attachment IconA Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182
Proceedings Article
Hide details for Space vehiclesSpace vehicles
Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
Hide details for spanning treespanning tree
Solis-Oba, Roberto19982-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452
Proceedings Article

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