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 AbacusAbacus
Weiskircher, Rene1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Above-Guarantee ParameterizationAbove-Guarantee Parameterization
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 absolute worst-case ratioabsolute worst-case ratio
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 abstract data typeabstract data type
Mehlhorn, Kurt
Näher, Stefan
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
Hide details for Achlioptas processAchlioptas process
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 Ad-Hoc and Sensor NetworksAd-Hoc and Sensor Networks
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 adaptive granularity controladaptive granularity control
Sanders, Peter1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
Hide details for Adaptive SortingAdaptive Sorting
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 ADHOC networksADHOC networks
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 Advanced SearchAdvanced Search
Celikik, Marjan
Bast, Holger
Manolache, Gabriel
2011Attachment IconEfficient Index-Based Snippet GenerationUnpublished/Draft
Hide details for Aerospace electronicsAerospace electronics
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 aerospace instrumentationaerospace instrumentation
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 Agebraic curvesAgebraic curves
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
Hide details for Airline Crew SchedulingAirline Crew Scheduling
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 algebraic computation treealgebraic computation tree
Katriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
Hide details for Algebraic curvesAlgebraic curves
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
Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Proceedings Article
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 Algebraic ExtensionAlgebraic Extension
Hemmer, Michael
Hülse, Dominik
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
Hide details for Algebraic GeometryAlgebraic Geometry
Emeliyanenko, Pavel2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Algebraic KernelAlgebraic Kernel
Berberich, Eric
Hemmer, Michael
2006Prototype implementation of the algebraic kernelReport
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
2006Interface specification of algebraic kernelReport
Hide details for algebraic surfacealgebraic surface
Berberich, Eric
Sagraloff, Michael
2009A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal Article
Hide details for Algebraic surfacesAlgebraic surfaces
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2010An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Journal Article
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
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 algorithmalgorithm
Fleischer, Rudolf1999FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
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 Algorithm EngineeringAlgorithm Engineering
Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
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
Hide details for algorithmic game theoryalgorithmic game theory
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
Christodoulou, Giorgos
Ligett, Katrina
Pyrga, Evangelia
2010Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
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
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
Hide details for AlgorithmsAlgorithms
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
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
Althaus, Ernst
Mehlhorn, Kurt
1998Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
Journal Article
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
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
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
Chan, T.-H. Hubert
Gupta, Anupam
2009Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Journal Article
Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
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
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
Elmasry, Amr
Hammad, Abdelrahman
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
Kaufmann, Michael
Mehlhorn, Kurt
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Journal Article
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
Mehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
Meyer, Ulrich
Sibeyn, Jop F.
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Journal Article
Michail, Dimitrios2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - Doctoral dissertation
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
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
Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
Schweitzer, Pascal2009Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
Journal 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.1999Effiziente parallele Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
Sibeyn, Jop F.1999External Selection
In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS-99), 291-301
Proceedings Article
Sibeyn, Jop F.1999Row-Major Sorting on Meshes
In: SIAM Journal on Computing [28], 847-863
Journal 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 Algorithms and Data StructuresAlgorithms and Data Structures
Emeliyanenko, Pavel2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Algorithms for compressed dataAlgorithms for compressed data
Jez, Artur2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
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 algorithms.algorithms.
Subramanian, C. R.2000Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77
Journal Article
Hide details for AlgorithmusAlgorithmus
Mehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Mehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Hide details for AmbiguityAmbiguity
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 Amortized AnalysisAmortized Analysis
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 AnalysisAnalysis
Doerr, Benjamin
Happ, Edda
Klein, Christian
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
Hide details for AND/OR precedence constraintsAND/OR precedence constraints
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 Angel and DevilAngel and Devil
Kutz, Martin2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
Hide details for Ant Colony OptimizationAnt Colony Optimization
Doerr, Benjamin
Johannsen, Daniel
Tang, Ching Hoo
2008Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Proceedings Article
Hide details for Apex-Minor-Free GraphsApex-Minor-Free Graphs
Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
Hide details for approximateapproximate
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 approximate algorithmsapproximate algorithms
Naujoks, Rouven2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for approximate arithmeticapproximate arithmetic
Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Hide details for approximate string matchingapproximate string matching
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
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
2002One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234
Proceedings 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
Celikik, Marjan
Bast, Holger
2009Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
Proceedings Article
Kärkkäinen, Juha2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
Hide details for ApproximationApproximation
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
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
Michail, Dimitrios2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - Doctoral dissertation
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 Approximation AlgorithmApproximation Algorithm
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
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
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
2011Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Journal 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
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
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
Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
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
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
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 Approximation algorithmsApproximation algorithms
Arya, Sunil
Mount, David M.
2000Approximate range searching
In: Computational Geometry [17], 135-152
Journal Article
Bar-Yehuda, Reuven
Flysher, Guy
Mestre, Julián
Rawitz, Dror
2007Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
Baumann, Nadine
Köhler, Ekkehard
2004Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610
Proceedings Article
Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Journal Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Journal Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
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
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
Garg, Naveen
Konjevod, Goran
Ravi, R.
2000Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84
Journal 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
Krysta, Piotr
Lorys, Krzysztof
1999Efficient approximation algorithms for the achromatic number
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 402-413
Proceedings Article
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
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
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
Solis-Oba, Roberto
Frederickson, Greg N.
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
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
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 ArchaeologyArchaeology
Hundack, Christoph
Mutzel, Petra
Pouchkarev, Igor
Thome, Stefan
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
Hide details for Archiving AlgorithmsArchiving Algorithms
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 arithmetic circuit complexityarithmetic circuit complexity
Kayal, Neeraj
Saha, Chandan
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
Hide details for Arithmetic ProgressionsArithmetic Progressions
Hebbinghaus, Nils2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
Hide details for arrangementarrangement
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
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
Limbach, Sebastian2008Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Thesis - Master's thesis
Hide details for ArrangementsArrangements
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
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
Berberich, Eric
Fogel, Efi
Halperin, Dan
Wein, Ron
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Proceedings Article
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
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
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
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
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
Hide details for Art Gallery ProblemArt Gallery Problem
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 AssignmentAssignment
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
2002Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values ConstraintReport
Hide details for assignment problemassignment 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 asynchronous algorithmasynchronous algorithm
Sanders, Peter1999Asynchronous Random Polling Dynamic Load Balancing
In: Algorithms and computation : 10th International Symposium, ISAAC'99, 37-48
Proceedings Article
Hide details for Average-case analysisAverage-case 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
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, 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
Meyer, Ulrich2002Buckets Strike Back: Improved Parallel Shortest-Paths
In: International Parallel and Distributed Processing Symposium (IPDPS-02), 75-75
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
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 Average-Case ComplexityAverage-Case Complexity
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 average caseaverage case
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 Average Case AnalysisAverage Case Analysis
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 average search timeaverage search time
Mehlhorn, Kurt1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
Hide details for AVL-treesAVL-trees
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 BahncardBahncard
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 BALLBALL
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 bandwidth criterionbandwidth criterion
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 Baraff’s algorithmBaraff’s algorithm
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 BaumBaum
Mehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Mehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Hide details for bendbend
Klau, Gunnar W.1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Bernstein basisBernstein basis
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
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
Hide details for Bézier curvesBézier curves
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 Bezout matrixBezout matrix
Kerber, Michael2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Journal Article
Hide details for bin packingbin packing
Epstein, Leah
Levin, Asaf
van Stee, Rob
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Journal Article
Epstein, Leah
Levin, Asaf
van Stee, Rob
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
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
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
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
van Stee, Rob2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
Hide details for binary comparison modelbinary comparison model
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 binary search treebinary search tree
Mehlhorn, Kurt1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
Hide details for binary treesbinary trees
Mehlhorn, Kurt1979Attachment IconDynamic Binary Search
In: SIAM Journal on Computing [8], 175-198
Journal Article
Hide details for Bio-inspired ComputationBio-inspired Computation
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
Hide details for bipartite graphsbipartite graphs
Mehlhorn, Kurt
Michail, Dimitrios
2005Attachment IconNetwork Problems with Non-Polynomial Weights and ApplicationsUnpublished/Draft
Hide details for Black-box complexityBlack-box complexity
Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola
2013Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
Journal Article
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
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
Hide details for black-box modelblack-box model
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 Bollobas-Eldridge conjectureBollobas-Eldridge conjecture
Csaba, Bela2003Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Journal Article
Hide details for Bound-ConsistencyBound-Consistency
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article
Hide details for bounded-degree networkbounded-degree network
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 Bounded Ordered DictionariesBounded Ordered Dictionaries
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 Bounded Priority QueuesBounded Priority Queues
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 Box-decomposition treesBox-decomposition trees
Arya, Sunil
Mount, David M.
2000Approximate range searching
In: Computational Geometry [17], 135-152
Journal Article
Hide details for BoxesBoxes
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 Branch-and-CutBranch-and-Cut
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
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
Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
Hide details for Branch and CutBranch and Cut
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
Mutzel, Petra
Ziegler, Thomas
2000The Constrained Crossing Minimization Problem
In: Graph Drawing, Proceedings of the 7th International Symposium (GD-99), 175-185
Proceedings Article
Hide details for Branch & CutBranch & Cut
Weiskircher, Rene1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Master's thesis
Hide details for BroadcastBroadcast
Meyer, Ulrich
Sibeyn, Jop F.
2002Oblivious Gossiping on Tori
In: Journal of Algorithms [42], 1-19
Journal Article
Hide details for broadcastingbroadcasting
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
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 Broadcasting in NetworksBroadcasting in Networks
Winzen, Carola2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
Hide details for bufferbuffer
van Stee, Rob2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
Hide details for B.7.2 [Integrated Circuits]: Design Aids-placement and routingB.7.2 [Integrated Circuits]: Design Aids-placement and routing
Mehlhorn, Kurt
Preparata, F. P.
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Journal Article
Hide details for cachecache
Sanders, Peter2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
Hide details for CachingCaching
Celikik, Marjan
Bast, Holger
Manolache, Gabriel
2011Attachment IconEfficient Index-Based Snippet GenerationUnpublished/Draft
Hide details for CADCAD
Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
Proceedings Article
Hide details for Cake cuttingCake cutting
Heydrich, Sandy
van Stee, Rob
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
Hide details for Car DesignCar Design
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 Categories and Subject Descriptors: B.7. I [Integrated Circuits]: Types and Design Styles- VLSI (very large scCategories and Subject Descriptors: B.7. I [Integrated Circuits]: Types and Design Styles- VLSI (very large scale integration)
Mehlhorn, Kurt
Preparata, F. P.
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Journal Article
Hide details for Categories and Subject Descriptors: F.I.2 [Computation by Abstract Devices]: Modes of Computation-- alternatioCategories and Subject Descriptors: F.I.2 [Computation by Abstract Devices]: Modes of Computation-- alternation and nondeterminism
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
Hide details for certified computationcertified computation
Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Hide details for Certifying Verification LEDA Isabelle VCCCertifying Verification LEDA Isabelle VCC
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
2011Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
Proceedings Article
Hide details for CGALCGAL
Berberich, Eric
Hemmer, Michael
2006Prototype implementation of the algebraic kernelReport
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
2006Interface specification of algebraic kernelReport
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
Berberich, Eric
Meyerovitch, Michal
2007Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Proceedings Article
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
Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg
2008Voronoi diagram of ellipses: CGAL-based implementationReport
Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis
2008Cross-benchmarks of univariate algebraic kernelsReport
Hemmer, Michael2009Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
Hemmer, Michael2008CGAL package for modular arithmetic operationsReport
Hemmer, Michael2008CGAL package: Algebraic FoundationsReport
Hemmer, Michael
Hülse, Dominik
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
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 Chernoff boundsChernoff bounds
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 Chinese remainderingChinese remaindering
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 Chordal GraphsChordal Graphs
Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
Hide details for circuitscircuits
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 Claw-free graphsClaw-free graphs
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Journal Article
Hide details for CliqueClique
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Journal Article
Hide details for clusteringclustering
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
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
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
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
Hide details for ClustersClusters
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 codescodes
Altenkamp, Doris
Mehlhorn, Kurt
1980Attachment IconCodes: Unequal Probabilities, Unequal Letter Cost
In: Journal of the ACM [27], 412-427
Journal Article
Hide details for Coefficient sign variationsCoefficient sign variations
Krandick, Werner
Mehlhorn, Kurt
2006Attachment IconNew bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66
Journal Article
Hide details for collective communicationcollective communication
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
Hide details for Collision DetectionCollision Detection
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
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
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 Collision responseCollision response
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 Colorful MotifColorful Motif
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
Hide details for Comb graphsComb graphs
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
Hide details for Combinatorial EnumerationCombinatorial Enumeration
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 combinatorial gamecombinatorial 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 Combinatorial gamesCombinatorial games
Kutz, Martin2005Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451
Journal Article
Hide details for Combinatorial OptimizationCombinatorial Optimization
Althaus, Ernst
Altmeyer, Sebastian
Naujoks, Rouven
2010A New Combinatorial Approach to Parametric Path AnalysisReport
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
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
2000A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
Proceedings Article
Doerr, Benjamin
Happ, Edda
Klein, Christian
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
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
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
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
Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
Rauf, Imran2005Attachment IconEarliest Arrival Flows with Multiple Sources
Universität des Saarlandes
Thesis - Master's thesis
Weiskircher, Rene1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Combinatorial problemsCombinatorial problems
Schweitzer, Pascal
Schweitzer, Patrick
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
Hide details for combinatorial reconstructioncombinatorial reconstruction
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 combinatorial surface reconstructioncombinatorial surface reconstruction
Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
2008How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74
Proceedings Article
Hide details for combinatoricscombinatorics
Csaba, Bela2003Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Journal Article
Hide details for CommunicationCommunication
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
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 CompactionCompaction
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
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 competitive analysiscompetitive analysis
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 complexitycomplexity
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
Mehlhorn, Kurt1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
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 complexity classescomplexity classes
Dubhashi, Devdatt
Ranjan, Desh
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
Hide details for complexity of incremental algorithmscomplexity of incremental algorithms
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 Compressed membership problemCompressed membership problem
Jez, Artur2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
Hide details for CompressionCompression
Jez, Artur2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings Article
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 ComputabilityComputability
Jez, Artur
Okhotin, Alexander
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
Hide details for Computation GeometryComputation Geometry
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 computational and structural complexitycomputational and structural complexity
Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Journal Article
Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
Hide details for Computational BiologyComputational Biology
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
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
Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
Lenhof, Hans-Peter
Reinert, Knut
Vingron, Martin
1998A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
Hide details for Computational Biology;Computational Biology;
Vingron, Martin
Lenhof, Hans-Peter
Mutzel, Petra
1997Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Part of a Book
Hide details for Computational ChemistryComputational Chemistry
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 Computational complexityComputational complexity
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
Hoogeveen, Han
Skutella, Martin
Woeginger, Gerhard J.
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
Journal Article
Katriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
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
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 computational complexity idealized parallel computerscomputational complexity idealized parallel computers
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 Computational GeometryComputational Geometry
Agarwal, Pankaj
Hagerup, Torben
Ray, Rahul
Sharir, Micha
Smid, Michiel
Welzl, Emo
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
Proceedings Article
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
Beldiceanu, Nicolas
Guo, Qi
Thiel, Sven
2001Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407
Proceedings Article
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
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
Buchheit, Thomas1999Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes
Thesis - Master's thesis
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
2001Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
Proceedings Article
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
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
Dey, Tamal K.
Funke, Stefan
Ramos, Edgar A.
2001Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132
Electronic Proceedings Article
Dumitriu, Daniel2007Attachment IconGraph-based Conservative Surface Reconstruction
Universität des Saarlandes
Thesis - Master's thesis
Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola
2008How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74
Proceedings Article
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
Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
Schömer, Elmar
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
El Kahoui, M'hammed1996Attachment IconAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
Journal Article
Emeliyanenko, Pavel2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Master's thesis
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
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
2003Attachment IconApproximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241
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
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
Granados, Miguel
Hachenberger, Peter
Hert, Susan
Kettner, Lutz
Mehlhorn, Kurt
Seel, Michael
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
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
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
Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
Kerber, Michael2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Master's thesis
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
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
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
Näher, Stefan
Uhrig, Christian
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
Journal 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
Schirra, Stefan1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
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
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
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 computational modelscomputational models
Katriel, Irit2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
Hide details for Computational Molecular BiologyComputational Molecular Biology
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
2000A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
Proceedings Article
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 computational topologycomputational topology
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 computer cartographycomputer cartography
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 Computer GraphicsComputer Graphics
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 Computer Programming--AlgorithmsComputer Programming--Algorithms
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 computer sciencecomputer science
Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for Computer Science and Game TheoryComputer Science and Game Theory
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
2009Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
Hide details for ConicsConics
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
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 Conjunctive grammarsConjunctive grammars
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 Connected ComponentsConnected Components
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 Connected dominating setConnected dominating set
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Journal Article
Guibas, Leonidas
Milosavljevic, Nikola
Motskin, Arik
2010Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
Proceedings Article
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
Hide details for Connected Feedback Vertex SetConnected Feedback Vertex Set
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
Hide details for Constant FactorsConstant Factors
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
Hide details for constrained shortest pathconstrained shortest path
Mehlhorn, Kurt
Ziegelmann, Mark
2000Attachment IconResource Constrained Shortest Paths
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 326-337
Proceedings Article
Hide details for constrained shortest pathsconstrained shortest paths
Kärkkäinen, Juha2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
Mehlhorn, Kurt
Ziegelmann, Mark
2001Attachment IconCNOP - A Package for Constrained Network Optimization
In: Algorithm engineering and experimentation (ALENEX-01) :Third International Workshop ALENEX 2001 ; revised papers, 17-31
Proceedings Article
Hide details for constraint based simulationconstraint based simulation
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 Constraint ProgrammingConstraint Programming
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
2002Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values ConstraintReport
Beldiceanu, Nicolas
Guo, Qi
Thiel, Sven
2001Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407
Proceedings Article
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
2004Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article
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 Construction of the smallest grammarConstruction of the smallest grammar
Jez, Artur2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings 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 Contention ResolutionContention Resolution
Christodoulou, Giorgos
Ligett, Katrina
Pyrga, Evangelia
2010Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
Proceedings Article
Hide details for Context unificationContext 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 convex hullconvex hull
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 Cooperative gamesCooperative games
Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
Hide details for CoreCore
Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
Hide details for Cost FilteringCost Filtering
Beldiceanu, Nicolas
Carlsson, Mats
Thiel, Sven
2002Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values ConstraintReport
Hide details for cost trade-offscost trade-offs
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
Hide details for covariance matrix adaptationcovariance matrix adaptation
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 covering numbercovering number
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 Covering ProblemsCovering Problems
Bar-Yehuda, Reuven
Flysher, Guy
Mestre, Julián
Rawitz, Dror
2007Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346
Proceedings Article
Hide details for crossing minimizationcrossing minimization
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
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 CrossoverCrossover
Doerr, Benjamin
Happ, Edda
Klein, Christian
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
Hide details for cryptographycryptography
Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
Hide details for CUDACUDA
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 Curvature constraintCurvature constraint
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 curve in generic positioncurve in generic position
El Kahoui, M'hammed1996Attachment IconAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
Journal Article
Hide details for Curved ObjectsCurved Objects
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 Curved SurfacesCurved Surfaces
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
Hide details for cycle basiscycle basis
Michail, Dimitrios2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for cylindrical algebraic decompositioncylindrical algebraic decomposition
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2010An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Journal Article
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
Berberich, Eric
Sagraloff, Michael
2009A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal Article
Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
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 C++C++
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
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 d-dimensional meshd-dimensional mesh
Lee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
Hide details for d-factorsd-factors
Gao, Pu (Jane)2011Distribution of spanning regular subgraphs in random graphsUnpublished/Draft
Hide details for Data CompressionData Compression
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 Data gatheringData gathering
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
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 Data miningData mining
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]
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
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 Data ProcessingData Processing
Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M.
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
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 Data Processing--Data StructuresData Processing--Data Structures
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 data structuredata structure
Sanders, Peter2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
Hide details for data structuresdata structures
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
Ching, Yu-Tai
Mehlhorn, Kurt
Smid, Michiel H. M.
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Journal Article
Dementiev, Roman
Kettner, Lutz
Mehnert, Jens
Sanders, Peter
2004Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings 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
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
Elmasry, Amr2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsReport
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
Krysta, Piotr
Pacholski, Leszek
1999The STO problem is NP-complete
In: Journal of Symbolic Computation [27], 207-219
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
Sanders, Peter1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
Proceedings Article
Hide details for Data Structures and AlgorithmsData Structures and Algorithms
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
2009Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
Hide details for DatenstrukturDatenstruktur
Mehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Mehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Hide details for Davenport-Mahler boundDavenport-Mahler bound
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
Hide details for Deadline MonotonicDeadline Monotonic
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 decision treedecision tree
Fleischer, Rudolf1999Decision trees: old and new results
In: Information and computation [152], 44-61
Journal Article
Hide details for Decrease-Key OperationDecrease-Key Operation
Elmasry, Amr2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsReport
Hide details for Deferred Data StructuresDeferred Data Structures
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 DegeneraciesDegeneracies
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 Degenerate graphsDegenerate graphs
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
Hide details for degree sequencedegree sequence
Gao, Pu (Jane)
Wormald, Nicholas
Su, Yi
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
Hide details for Delaunay graphsDelaunay graphs
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 deletionsdeletions
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 depth-3depth-3
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 depth-4depth-4
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 derandomizationderandomization
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 Descartes' Rule of SignsDescartes' Rule of Signs
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 Descartes-Jacobi RuleDescartes-Jacobi Rule
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 Descartes methodDescartes method
Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Proceedings Article
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
Hide details for Descartes rule of signsDescartes rule of signs
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 DesignDesign
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 Design of algorithmsDesign of 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
Hide details for determinantsdeterminants
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 Deterministic AlgorithmsDeterministic Algorithms
Meyer, Ulrich1995Deterministische Simulation einer PRAM auf Gitterrechnern
Universität des Saarlandes
Thesis - Master's thesis
Hide details for Deterministic tree automatonDeterministic tree automaton
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 DFTDFT
Mehlhorn, Kurt
Preparata, Franco P.
1983Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeReport
Hide details for diamond operatordiamond operator
Schmitt, Susanne2003The Diamond Operator for Real Algebraic NumbersReport
Hide details for DictionariesDictionaries
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 dictionary problemdictionary problem
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
Hide details for diffusion load balancingdiffusion load balancing
Sanders, Peter1999Analysis of nearest neighbor load balancing algorithms for random loads
In: Parallel Computing [25], 1013-1033
Journal Article
Hide details for Dijkstra's algorithmDijkstra's algorithm
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 dilation-costdilation-cost
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
Hide details for dimension reductiondimension reduction
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
Hide details for Directed Feedback Arc SetDirected Feedback Arc Set
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 directed Hamiltonian ringdirected Hamiltonian ring
Lee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
Hide details for DiscrepancyDiscrepancy
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
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 Discrepancy TheoryDiscrepancy Theory
Hebbinghaus, Nils2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
Hide details for discrete algorithm enginieeringdiscrete algorithm enginieering
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
Hide details for discrete algorithmsdiscrete algorithms
Cole, Richard
Ost, Kirstin
Schirra, Stefan
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
Hide details for Discrete GeometryDiscrete Geometry
Pyrga, Evangelia
Ray, Saurabh
2008New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
Proceedings Article
Hide details for Discrete OptimizationDiscrete Optimization
Eisenbrand, Friedrich
Funke, Stefan
Reichel, Joachim
Schömer, Elmar
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
Hide details for distancedistance
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
Hide details for Distance ComputationDistance Computation
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
Hide details for Distributed algorithmDistributed 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 distributed algorithmsdistributed algorithms
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
Hide details for Division of choresDivision of chores
Heydrich, Sandy
van Stee, Rob
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
Hide details for DockingDocking
Althaus, Ernst
Kohlbacher, Oliver
Lenhof, Hans-Peter
Müller, Peter
2000A Combinatorial Approach to Protein Docking with Flexible Side-Chains
In: Proceedings of the 4th Annual International Conference on Computational Molecular Biology (RECOMB-00), 15-24
Proceedings Article
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 Document ExpansionDocument Expansion
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 Dominating SetDominating Set
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Journal 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
Hide details for Dominator ColoringDominator Coloring
Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
Hide details for Double-Ended Priority QueuesDouble-Ended 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 Double RulingDouble Ruling
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 Doubling metricsDoubling metrics
Chan, T.-H. Hubert
Gupta, Anupam
2009Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Journal Article
Hide details for Drift analysisDrift analysis
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Journal Article
Hide details for dualizationdualization
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
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
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
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 Dupin ring cyclideDupin ring cyclide
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
Hide details for Dynamic algorithmsDynamic algorithms
Ajwani, Deepak
Friedrich, Tobias
2007Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475
Proceedings Article
Hide details for Dynamic Computational GeometryDynamic Computational Geometry
Guibas, Leonidas
Milosavljevic, Nikola
Motskin, Arik
2010Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
Proceedings Article
Hide details for dynamic deferred data structuringdynamic deferred data structuring
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 dynamic flowdynamic flow
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
Hide details for dynamic network flowsdynamic network flows
Baumann, Nadine
Köhler, Ekkehard
2004Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610
Proceedings Article
Hide details for dynamic reconfigurationdynamic reconfiguration
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 Dynamical SystemDynamical System
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 Earliest Deadline FirstEarliest Deadline First
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
Stiller, Sebastian
2012Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Journal Article
Hide details for earliest start scheduleearliest start schedule
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 Economic equilibriumEconomic equilibrium
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 EconomicsEconomics
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 EDFEDF
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 edge-disjoint pathsedge-disjoint paths
Kaufmann, Michael
Mehlhorn, Kurt
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Journal Article
Hide details for Edge coloringEdge coloring
Cole, Richard
Ost, Kirstin
Schirra, Stefan
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
Hide details for edgesedges
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 Edmonds' AlgorithmEdmonds' Algorithm
Mehlhorn, Kurt
Schäfer, Guido
2002Attachment IconImplementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
Electronic Journal Article
Hide details for efficient algor ithmsefficient algor ithms
Mehlhorn, Kurt
Näher, Stefan
1995LEDA : A Platform for Combinatorial and Geometric ComputingReport
Hide details for efficient algorithmefficient algorithm
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
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 EffizienzEffizienz
Mehlhorn, Kurt1988Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Mehlhorn, Kurt1986Datenstrukturen und effiziente Algorithmen, Band 1: Sortieren und SuchenBook
Hide details for elliptic curveselliptic curves
Schmitt, Susanne
Zimmer, Horst G.
2003Elliptic Curves : A Computational ApproachBook
Hide details for EmbeddingEmbedding
Lee, Jae-Ha
Shin, Chan-Su
Chwa, Kyung-Yong
2000Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783
Journal Article
Hide details for entropyentropy
Mehlhorn, Kurt1977Attachment IconA best possible bound for the weighted path length of binary search trees
In: SIAM Journal on Computing [6], 235-239
Journal Article
Hide details for EnumerationEnumeration
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 enumeration algorithmsenumeration algorithms
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
Hide details for Enumeration problemsEnumeration problems
Elbassioni, Khaled
Rauf, Imran
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
Hide details for epidemic algorithmsepidemic algorithms
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
Hide details for error-tolerant searcherror-tolerant search
Celikik, Marjan
Bast, Holger
2009Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
Proceedings Article
Hide details for ESA solar orbiter missionESA solar orbiter mission
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 Euler tourEuler tour
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 Eulerian CycleEulerian Cycle
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 Evolutionary AlgorithmEvolutionary Algorithm
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
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 Evolutionary AlgorithmsEvolutionary Algorithms
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
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Journal Article
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
2010Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
Proceedings Article
Hide details for Evolutionary ComputationEvolutionary Computation
Doerr, Benjamin
Happ, Edda
Klein, Christian
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings 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
Johannsen, Daniel
Winzen, Carola
2010Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
Proceedings Article
Hide details for evolutionary strategyevolutionary strategy
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 Exact AlgorithmExact Algorithm
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, 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 Exact AlgorithmsExact Algorithms
Beier, René
Vöcking, Berthold
2004Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Journal Article
Naujoks, Rouven2008NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for exact computationexact computation
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
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
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
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
2001Attachment IconA Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265
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
Hemmer, Michael2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
Thesis - Master's thesis
Schirra, Stefan2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
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 exact geometric computationexact geometric computation
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
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2010An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278
Journal Article
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
Berberich, Eric
Sagraloff, Michael
2009A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal Article
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
Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
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
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
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 Exact Geometric ComputingExact Geometric Computing
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
Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg
2008Voronoi diagram of ellipses: CGAL-based implementationReport
Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis
2008Cross-benchmarks of univariate algebraic kernelsReport
Hemmer, Michael2008CGAL package for modular arithmetic operationsReport
Hemmer, Michael2008CGAL package: Algebraic FoundationsReport
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, Michael
Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
Hide details for EXACUSEXACUS
Berberich, Eric
Hemmer, Michael
2006Prototype implementation of the algebraic kernelReport
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
2006Interface specification of algebraic kernelReport
Berberich, Eric
Meyerovitch, Michal
2007Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
Proceedings Article
Emeliyanenko, Pavel2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Master's thesis
Hide details for expansion-costexpansion-cost
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
Hide details for expectationexpectation
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 ExperimentationExperimentation
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
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 ExperimentsExperiments
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 exponent of periodicityexponent of periodicity
Jez, Artur2013Attachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Proceedings Article
Hide details for external graph algorithmexternal graph algorithm
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 external memoryexternal memory
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
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
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
Crauser, Andreas
Meyer, Ulrich
Brengel, Klaus
2001An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24
Unpublished/Draft
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
Jurkiewicz, Tomasz2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - Doctoral dissertation
Mehlhorn, Kurt
Meyer, Ulrich
2002Attachment IconExternal-Memory Breadth-First Search with Sublinear I/O
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 723-735
Proceedings Article
Sanders, Peter2000Fast Priority Queues for Cached Memory
In: Journal of Experimental Algorithmics [5], 1-25
Electronic Journal Article
Sanders, Peter1999Fast Priority Queues for Cached Memory
In: Selected papers of the International Workshop on Algorithm Engineering and Experimentation (ALENEX-99), 312-327
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 external memory algorithmexternal memory algorithm
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 external memory algorithmsexternal memory algorithms
Kärkkäinen, Juha
Rao, S. Srinivasa
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
Meyer, Ulrich2001External Memory BFS on Undirected Graphs with Bounded Degree
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 87-88
Proceedings Article
Hide details for external memoryJulyexternal memoryJuly
Crauser, Andreas
Ferragina, Paolo
1999On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235
Proceedings Article
Hide details for external priority queueexternal priority queue
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 ExternspeicherExternspeicher
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 extremal graph theoryextremal graph theory
Csaba, Bela2003Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Journal Article
Hide details for E. I [Data]:E. I [Data]:
Data Structures--arrays
Mehlhorn, Kurt
Preparata, F. P.
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Journal Article
Hide details for Face hitting setFace hitting set
Schweitzer, Pascal
Schweitzer, Patrick
2010Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
Journal Article
Hide details for Facility LocationFacility Location
Fotakis, Dimitris2004Attachment IconIncremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358
Proceedings Article
Goemans, Michel X.
Skutella, Martin
2004Attachment IconCooperative facility location games
In: Journal of Algorithms [50], 194-214
Journal Article
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 factorizationfactorization
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 fast arithmeticfast arithmetic
Kobel, Alexander
Sagraloff, Michael
2013Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Electronic Journal Article
Hide details for fast matrix multiplicationfast matrix multiplication
Michail, Dimitrios2006Attachment IconMinimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes
Thesis - Doctoral dissertation
Hide details for fault-tolerancefault-tolerance
Fotakis, Dimitris
Spirakis, Paul G.
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
Journal Article
Hide details for Feasibility TestFeasibility Test
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 feature vectorfeature vector
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 Feedback Vertex Set problemsFeedback Vertex Set problems
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 Fibonacci HeapsFibonacci Heaps
Elmasry, Amr2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsReport
Hide details for field programmable gate arraysfield programmable gate arrays
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 filterfilter
Schmitt, Susanne2003Common Subexpression Search in LEDA_realsReport
Hide details for filter algorithmfilter algorithm
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
Kärkkäinen, Juha2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
Hide details for Filter AlgorithmsFilter Algorithms
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 Finite automataFinite automata
Jez, Artur2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
Hide details for Fixed-Parameter TractabilityFixed-Parameter Tractability
Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
2011Attachment IconAlgorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30
Proceedings Article
Hide details for Fixed parameter tractabilityFixed parameter tractability
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Journal 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 Floating point arithmeticFloating point arithmetic
Althaus, Ernst
Mehlhorn, Kurt
1998Attachment IconMaximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113
Journal Article
Hide details for flow over timeflow over time
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
Hide details for Forbidden minorsForbidden minors
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
Hide details for forestforest
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 Forest ecosystem - Biodiversity - Ecological dispersal model - Forest simulation model - Approximation algoritForest ecosystem - Biodiversity - Ecological dispersal model - Forest simulation model - Approximation algorithms
Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S.
2008Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Journal Article
Hide details for Fourier AnalysisFourier Analysis
Hebbinghaus, Nils2007Attachment IconDiscrepancy of Sums of two Arithmetic ProgressionsReport
Hide details for FPGAFPGA
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 frameworkframework
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 fringe analysisfringe analysis
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 full-text indexfull-text index
Kärkkäinen, Juha
Rao, S. Srinivasa
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
Part of a Book
Hide details for Full Steiner TreesFull Steiner Trees
Althaus, Ernst1998Attachment IconBerechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes
Thesis - Master's thesis
Hide details for funfun
Fleischer, Rudolf1999FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
Hide details for fixed parameter tractabilityfixed parameter tractability
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
Hide details for F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-routing and layoutF.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems-routing and layout

General Terms: Design
Mehlhorn, Kurt
Preparata, F. P.
1986Attachment IconRouting through a Rectangle
In: Journal of the ACM [33], 60-85
Journal Article
Hide details for F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerieal Algorithms and Problems--computations on dF.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerieal Algorithms and Problems--computations on discrete structures
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
Hide details for F.2.3 [Analysis of Algolithms and Problem Complexity]: Trade-offs among Complexity MeasuresF.2.3 [Analysis of Algolithms and Problem Complexity]: Trade-offs among Complexity Measures
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
Hide details for Galois ringsGalois rings
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 Game TheoryGame Theory
Bhaskar, Umang
Fleischer, Lisa
Hoy, Darrell
Huang, Chien-Chung
2009Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article
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 GamesGames
Adler, Micah
Räcke, Harald
Sivadasan, Naveen
Sohler, Christian
Vöcking, Berthold
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
Proceedings Article
Hide details for gapped q-gramsgapped q-grams
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
2002One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234
Proceedings 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
Kärkkäinen, Juha2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
Proceedings Article
Hide details for General MatchingGeneral Matching
Mehlhorn, Kurt
Schäfer, Guido
2002Attachment IconImplementation of $O(nm \log n)$ Weighted Matchings in General Graphs: The Power of Data Structures
In: Proceedings of the n?th Conference on,
In: Journal of Experimental Algorithmics [7],
Electronic Journal Article
Hide details for Generating FunctionsGenerating 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 generic graphsgeneric graphs
Hong, Jia-Wei
Mehlhorn, Kurt
Rosenberg, Arnold L.
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
Journal Article
Hide details for generic programminggeneric programming
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
Berberich, Eric
Sagraloff, Michael
2009A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647
Journal 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
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
Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg
2008Voronoi diagram of ellipses: CGAL-based implementationReport
Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis
2008Cross-benchmarks of univariate algebraic kernelsReport
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
Hemmer, Michael2008CGAL package for modular arithmetic operationsReport
Hemmer, Michael2008CGAL package: Algebraic FoundationsReport
Hemmer, Michael2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - Doctoral dissertation
Hemmer, Michael
Hülse, Dominik
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
Hide details for Geographic Information SystemsGeographic Information Systems
Schirra, Stefan1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
Hide details for geometric algorithmsgeometric algorithms
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
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 Geometric ComputationGeometric Computation
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
Schirra, Stefan1997Precision and Robustness in Geometric Computations
In: Algorithmic Foundations of Geographic Information Systems, 255-287
Part of a Book
Hide details for geometric computinggeometric computing
Mehlhorn, Kurt
Schirra, Stefan
2000Attachment IconGeometric Computing with CGAL and LEDA
In: Curve and surface design, Saint-Malo 1999, 277-286
Proceedings Article
Schirra, Stefan2000Robustness and Precision Issues in Geometric Computation
In: Handbook of Computational Geometry, 597-632
Part of a Book
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

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