Bäsken, Brönnimann, Frank, Devillers, Ester, Fabri, Flato, Gärtner, Giezeman, Halperin, Hanniel, Har-Peled, Herrmann, Hert, Hirsch, Hoffmann, Kettner, Nechushtan, Neyer, Pasechnik, Pion, Schirra, Schönherr, Seel, Teillaud, Veltkamp, Wein, Wesselink, Yvinec

2001

CGAL Reference and User Manuals

cgal-manual-2001

Banderier

2001

Combinatoire Analytique des chemins et des cartes
Université de Paris 6

Banderier2001_T

2001

Random Maps, Coalescing Saddles, Singularity Analysis, and Airy Phenomena
In: Random Structures & Algorithms [19], 194-246

Banderier2001_2

2000

A Generalized Cover Time for Random Walks on Graphs
In: Proceedings of FPSAC'00, 113-124

Banderier2000

2000

Planar Maps and Airy Phenomena,
In: Proceedings of ICALP'00, 388-402

Banderier-LNCS1853-2000

1999

An Introduction to Analytic Number Theory

Banderier1999a

1999

On Generating Functions of Generating Trees
In: Proceedings of FPSAC'99, 40-52

Banderier1999b

Banderier, Beier, Mehlhorn

2003

Smoothed Analysis of Three Combinatorial Problems
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 198-207

Beier2003a

Banderier, Bousquet-Mélou, Denise, Flajolet, Gardy, Gouyou-Beauchamps

2002

Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55

Banderier2001_3

Banderier, Flajolet

2002

Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80

Banderier2002

Bannai, Gawrychowski, Inenaga, Takeda

2013

Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49

Gawrychowski2013converting

Bansal, Chan

2009

Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244

Chan2008

Bansal, Chan, Pruhs

2011

Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582

Chan2011

2009

Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701

Chan2008b

Bansal, Gupta, Li, Mestre, Nagarajan, Rudra

2010

When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229

Bansal2010

Bar-Yehuda, Flysher, Mestre, Rawitz

2007

Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346

conf/esa/Bar-YehudaFMR2007

Bar-Yehuda, Hermelin, Rawitz

2011

Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364

Bar-YehudaHermelinRawitz2011

2010

Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266

Hermelin2010

Bárány, Doerr

2006

Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469

Mcbg2006

Baraque

2002

Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes

BaraqueDipl02

Barnes, Edmonds

1998

Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
In: SIAM Journal on Computing [27], 1190-1202

BarnesEdmondsSIAMJCOMPUT1998

Bartal, Leonardi, Shallom, Sitters

2006

On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48

Sitters2006d

Baruah, Bonifaci, D'Angelo, Li, Marchetti-Spaccamela, Megow, Stougie

2012

Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152

Megow2011-MCsched

2010

Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101

Bonifaci:2010:c

Baruah, Bonifaci, D'Angelo, Marchetti-Spaccamela, van der Ster, Stougie

2011

Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566

Bonifaci:2011:c

Baruah, Bonifaci, Marchetti-Spaccamela, Stiller

2010

Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24

Baruah:2010

Barve, Grove, Vitter

1995

An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213

Grove-et-al-2-95

Basit, Mustafa, Ray, Raza

2010

Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600

Basit2010

Bast

2009

Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367

Bast2009

2006

Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?],

Bast2006b

2005

Präzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122

bast05hz

2004

Dimension 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

bast04selfstar

2002

Scheduling at Twilight the Easy Way
In: STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, 166-178

Bast2002a

2000

On Scheduling Parallel Tasks at Twilight
In: Theory of Computing Systems [33], 489-563

Bast2000b

2000

Provably Optimal Scheduling of Similar Tasks
Universität des Saarlandes

BastPhD2000

1998

Dynamic Scheduling with Incomplete Information
In: Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-98), 182-191

Bast1998

1994

Fast Parallel Space Allocation, Estimation and Integer Sorting
Universität des Saarlandes

Bast94

Bast, Chitea, Suchanek, Weber

2007

ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678

bastetal07sigir

Bast, Dietzfelbinger, Hagerup

1992

A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141

BastDH92

Bast, Dupret, Majumdar, Piwowarski

2006

Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120

BastDMP06

Bast, Funke, Matijevic

2009

Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192

BastFunkeMatjevic2009

2006

TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path,

BastFM06

Bast, Funke, Matijevic, Sanders, Schultes

2007

In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59

BastFMSS07

Bast, Funke, Sanders, Schultes

2007

Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566

BFSS07

Bast, Hagerup

1995

Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110

Bast-Hagerup95

1991

Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61

BastH91

Bast, Hert

2000

The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171

bh-app-00

Bast, Majumdar

2005

Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18

bastmajumdar05sigir

Bast, Majumdar, Schenkel, Theobald, Weikum

2006

IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5

BastMSTW2006trec

2006

IO-Top-k: Index-Access Optimized Top-k Query Processing

TechReportGDF2006

2006

IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486

BastMSTW2006a

Bast, Majumdar, Weber

2007

Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860

BastMW07

Bast, Mehlhorn, Schäfer, Tamaki

2006

Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14

BMST05

2004

Matching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92

bast04stacs

2003

A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88

BMST03

Bast, Mortensen, Weber

2006

Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162

bastetal06spire

Bast, Weber

2007

Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108

bastweber07gwem

2007

The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95

bastweber07cidr

2006

Type Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371

bastweber06sigir

2006

When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35

bastweber06faceted

2005

Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76

bastweber05wea

2005

Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248

bastweber05wiri

Baswana, Biswas, Doerr, Friedrich, Kurur, Neumann

2009

Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66

BBDFKN09

Baswana, Goyal, Sen

2005

All-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

BGS2005

Baswana, Kavitha, Mehlhorn, Pettie

2011

Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26

MehlhornTALG2011

Baswana, Sen

2007

A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563

BaswanaSen2007

2004

Approximate 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

BS2004

2004

Randomized graph data-structures for approximate shortest path problem
In: Handbook of Data Structures and Applications, 38.1-38.19

Baswana2004b

Baswana, Telikepalli, Mehlhorn, Pettie

2005

New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681

BaswanaEtal2005

Batra, Sharma

2010

Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628

BatraSharma2010

Baumann, Köhler

2004

Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 599-610

Baumann2004

Baumbach, Friedrich, Kötzing, Krohmer, Müller, Pauling

2012

Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176

BaumbachFKKMP2011

Baumgarten, Jung, Mehlhorn

1994

Dynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380

Mehlhorn94f

1992

Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258

Mehlhorn92g

Baus

2005

Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes

BausDipl05

2004

Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes

Baus/Diplom04

Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer

2003

Scheduling to minimize flow time metrics
In: International Parallel and Distributed Processing Symposium (IPDPS-03), 223b-CDROM

Becchetti2003

Becchetti, Leonardi, Marchetti-Spaccamela, Schäfer, Vredeveld

2003

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471

Schäfer2003

Becker

2012

The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes

BachBecker2012

1996

Allgemeine approximative Kongruenz zweier Punktmengen im R³
Universität des Saarlandes

Becker96

Becker, Degenhardt, Doenhardt, Hertel, Kaninke, Kerber, Mehlhorn, Näher, Rohnert, Winter

1982

A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136

mehlhorn82e

Becker, Mehlhorn

1986

Algorithms for Routing in Planar Graphs
In: Acta Informatica [23], 163-176

ACTAI::BeckerM1986

1984

Algorithms for routing in planar graphs

mehlhorn84d

Behle

2007

On threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135

Behle2007

Behle, Jünger, Liers

2007

A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392

Behle2007A

Behrens

2000

Solid Modeling durch Boolesche Operationen
Universität des Saarlandes

Behrens2000

Bei

2015

Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142

Bei2015

Beier

2004

Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes

BeierDiss04

2000

Eine Heuristik für das Gossiping-Problem
Universität des Saarlandes

Beier2000

Beier, Czumaj, Krysta, Vöcking

2006

Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706

Beier2006c

Beier, Funke, Matijevic, Sanders

2011

Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319

Beier2011

Beier, Krysta, Czumaj, Vöcking

2004

Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748

Beier2004b

Beier, Röglin, Vöcking

2007

The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67

Beier2007

Beier, Sanders, Sivadasan

2002

Energy Optimal Routing in Radio Networks Using Geometric Data Structures
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 366-376

Sanders2002h

Beier, Sibeyn

2000

A powerful heuristic for telephone gossiping
In: Proceedings of the 7th International Colloquium on Structural Information and Communication Complexity (SIROCCO-00), 17-36

BeierSibeyn00

Beier, Vöcking

2006

An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136

Beier2006b

2006

Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881

Beier2006

2004

Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470

Beier2004a

2004

Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329

Beier2004e

2004

Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352

Beier2004c

2003

Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241

Beier2003

Bein, Fleischer, Larmore

2000

Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162

BeinFleischerLarmore2000

Beldiceanu, Carlsson, Thiel

2003

Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152

BCT03:SweepSynchro

2002

Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values Constraint

BCT2002:SumOfWeights

Beldiceanu, Guo, Thiel

2001

Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407

BGT01:non-overlap

Beldiceanu, Katriel, Thiel

2007

Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear

Same2005

2005

GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11

KatrielSWC2004

2004

Filtering algorithms for the Same and UsedBy constraints

BeldiceanuKatrielThiel2004

2004

Filtering 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

SameCPAIOR2004

Belfrage, Mütze, Spöhel

2012

Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049

SpoehelBM2012

Ben-Asher, Schuster, Sibeyn

1995

Load balancing: A programmer's approach or the impact of task-length parameter on the load balancing performance of parallel programs
In: International Journal on High-Speed Computing [7], 303-326

Ben-Asher-Schuster-Sibeyn95

Ben-Zwi, Hermelin, Lokshtanov, Newman

2011

Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96

BenZwiHermelinLokshtanovNewman2011

Berberich

2008

Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes

Berberich2008

2004

Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes

Dipl04/Berberich

Berberich, Caroli, Wolpert

2007

Exact Computation of Arrangements of Rotated Conics

acs:bcw-carc-07

2007

Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234

BCW-ECARC2007

Berberich, Ebert, Fogel, Kettner

2006

Web-site with benchmark instances for planar curve arrangements

acs:bek-wbipca-06

Berberich, Ebert, Kettner

2006

Definition of file format for benchmark instances for arrangements of Quadrics

acs:bek-dffbiaq-06

Hide details for Berberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, Teillaud

Berberich, Eigenwillig, Emiris, Fogel, Hemmer, Halperin, Kakargias, Kettner, Mehlhorn, Pion, Schömer, Teillaud, Wein, Wolpert

2004

An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs

beef-ecscaca-04

Berberich, Eigenwillig, Fogel, Halperin, Hert, Kettner, Teillaud, Wein

2003

Specification of the traits classes for CGAL arrangements of curves

ecg:fhw-stcca-03

Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Weber, Wolpert

2004

EXACUS: Efficient and Exact Algorithms for Curves and Surfaces

ecg:beh-eeeac-04

Berberich, Eigenwillig, Hemmer, Hert, Kettner, Mehlhorn, Reichel, Schmitt, Schömer, Wolpert

2005

EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166

Berberich05

Berberich, Eigenwillig, Hemmer, Hert, Mehlhorn, Schömer

2002

A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186

behhms-cbcabocp-2002

Berberich, Emeliyanenko

2008

CGAL's Curved Kernel via Analysis

acs:tr123203-04-08

Berberich, Emeliyanenko, Kobel, Sagraloff

2013

Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32

Berberich20131

2012

Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46

BEKS:GEOTOP:2011

2011

Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],

beks:snc:2011a

2011

Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98

beks:snc:2011

Berberich, Emeliyanenko, Sagraloff

2011

An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47

bes-bisolve-2011

2010

An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16

bes-bisolve-arxiv-2010

Berberich, Fogel, Halperin, Kerber, Setter

2010

Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91

bfhks-aos2-2010

Berberich, Fogel, Halperin, Mehlhorn, Wein

2010

Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66

bfhmw-aos1-2010

2007

Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics

acs:bfhmw-smtaoq-07

2007

Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656

bfhmw-samtdaosafs-07

Berberich, Fogel, Halperin, Wein

2007

Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226

BFHW-SMTDAS2007

Berberich, Fogel, Meyer

2007

Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves

acs:bfm-uwibaqpac-07

Berberich, Hagen, Hiller, Moser

2010

Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388

bhhm-giae-exp-2010

Berberich, Halperin, Kerber, Pogalnikova

2012

Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989

bhkp-deconstruct-journal-2012

2011

Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],

bhkp-minkowksideconstructiondcg-2011a

2011

Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196

bhkp-minkowksideconstruction-2011

2010

Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68

bhkp-reconstruction-eurocg-2010

Berberich, Hemmer

2007

Definition of the 3D Quadrical Kernel Content

acs:bh-dtqkc-07

2006

Prototype implementation of the algebraic kernel

ACS-TR-121202-01

Berberich, Hemmer, Karavelas, Pion, Teillaud, Tsigaridas

2008

Prototype implementation of the algebraic kernel

ACS-TR-121202-01

2006

Interface specification of algebraic kernel

ACS-TR-123101-01

Berberich, Hemmer, Karavelas, Teillaud

2007

Revision of interface specification of algebraic kernel

acs:bhkt-risak-06

Berberich, Hemmer, Kerber

2011

A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186

bhk-ak2-2011

2010

A Generic Algebraic Kernel for Non-linear Geometric Applications

bhk-ak2-inria-2010

Berberich, Hemmer, Kettner, Schömer, Wolpert

2005

An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106

bhksw-eceicpmqic-05

Berberich, Kerber

2008

Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212

bk-aosogo-08

2008

Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66

bk-eatdc-08

Berberich, Kerber, Sagraloff

2010

An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278

bks-cgta-2009

2008

Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173

bks-egtaas-08

2008

Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32

bks-gaoasbopa-08

Berberich, Kettner

2007

Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point

bk-reorder-07

Berberich, Meyerovitch

2007

Computing Envelopes of Quadrics

acs:bm-ceq-07

2007

Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238

BM-CEQ2007

Berberich, Sagraloff

2009

A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647

bs-agffgtaas-cagd-09

2008

A 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

bs-agffgtaas-08

Berenbrink, Cooper, Friedetzky, Friedrich, Sauerwald

2011

Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439

Berenbrink2011b

Berenbrink, Friedetzky, Elsaesser, Nagel, Sauerwald

2011

Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83

BerenbrinkEFNS11

Berenbrink, Hoefer, Sauerwald

2011

Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497

Berenbrink2011

Berghammer, Friedrich, Neumann

2010

Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502

BFN2010

Berg, Kreveld, Schirra

1995

A new approach to subdivision simplification
In: ACSM/ASPRS Annual Convention & Exposition Technical Papers, 79-88

deBerg-vanKreveld-Schirra95

Berman, Krysta

2003

Optimizing Misdirection
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 192-201

Berman2003+

Berthomé, Duboux, Hagerup, Newman, Schuster

1995

Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380

Hagerup-et-al95

Bhaskar, Fleischer, Hoy, Huang

2009

Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757

Huang2008

Biedl, Kaufmann, Mutzel

1998

Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136

BiedlKaufmannMutzel1998

Bifet, Castillo, Chirita, Weber

2005

An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10

weberetal05airweb

Bilardi, Chaudhuri, Dubhashi, Mehlhorn

1994

A lower bound for area-universal graphs
In: Information Processing Letters [51], 101-105

Mehlhorn94e

Birk

1997

Lösung von Varianten des Post-Office-Problems mit Hilfe von Skip List Range Trees
Universität des Saarlandes

Birk97

Blanchebarbe

1996

Untersuchung zur Implementierung eines parallelen Algorithmus mit guter asymptotischer Laufzeit auf einem Rechner mit verteiltem Speicher und Message-Passing
Universität des Saarlandes

Blanchebarbe96

Blelloch, Farzan

2010

Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150

Farzan2010a

Blum, Mehlhorn

1980

On the Average Number of Rebalancing Operations in Weight-Balanced Trees
In: Theoretical Computer Science [11], 303-320

mehlhorn80c

1979

Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen
In: Theoretical Computer Science, 4th GI-Conference, 67-78

mehlhorn79g

1978

On the Average Number of Rebalancing Operations in Weight-Balanced Trees

mehlhorn78t

Bodirsky, Gröpl, Johannsen, Kang

2007

A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15

BodirskyGroeplJohannsenKang2007a

Bodirsky, Kutz

2007

Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196

BodirskyKutz2007

Bodlaender, Deogun, Jansen, Kloks, Kratsch, Müller, Tuza

1998

Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181

BodlaenderDeogunJansenKloksKratschMüllerTuza98

Bodlaender, Feremans, Grigoriev, Penninkx, Sitters, Wolle

2006

On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82

Sitters2006

Bodlaender, Hagerup

1998

Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746

BodlaenderHagerup98

1995

Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279

Bodlaender-Hagerup95

Böcker, Hüffner, Truss, Wahlström

2009

A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49

BHTWahlstroem2009

Böttcher, Doerr, Neumann

2010

Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10

BDN2010

Bogdan, Sauerwald, Stauffer, Sun

2013

Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34

BogdanSSS2012

Boghossian, Kohlbacher, Lenhof

1999

BALL: Biochemical Algorithms Library
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 330-344

BoghossianKohlbacherLenhof1999

Bonifaci, Chan, Marchetti-Spaccamela, Megow

2012

Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619

BonifaciCMM2012

2010

Algorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359

Bonifaci:2010:b

Bonifaci, Harks, Schäfer

2010

Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346

Bonifaci:2009:a

Bonifaci, Korteweg, Marchetti-Spaccamela, Stougie

2011

Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20

Bonifaci:2011:b

2011

The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641

Bonifaci:2011:a

Bonifaci, Marchetti-Spaccamela

2012

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780

Bonifaci2011:b

2010

Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241

Bonifaci:2010:d

Bonifaci, Marchetti-Spaccamela, Megow, Wiese

2013

Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),

Bonifaci2013b

Bonifaci, Marchetti-Spaccamela, Stiller

2012

A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049

Bonifaci2012b

Bonifaci, Marchetti-Spaccamela, Stiller, Wiese

2013

Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),

Bonifaci2013

Bonifaci, Mehlhorn, Varma

2012

Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133

Bonifaci2012c

2012

Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240

Bonifaci2012a

Boros, Borys, Elbassioni, Gurvich, Makino, Rudolf

2007

Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231

Elbassioni2007e

Boros, Elbassioni, Fouz, Gurvich, Makino, Manthey

2011

Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158

Elbassioni2011e

Boros, Elbassioni, Gurvich

2004

Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133

Elbassioni2004g

Boros, Elbassioni, Gurvich, Khachiyan

2004

An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128

Elbassioni2004a

2004

Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162

Elbassioni2004e

2004

Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498

Elbassioni2004d

2003

Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494

Elbassioni2003c

Boros, Elbassioni, Gurvich, Khachiyan, Makino

2004

Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309

Elbassioni2004b

2003

An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555

Elbassioni2003d

Boros, Elbassioni, Gurvich, Makino

2012

Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011),

Elbassioni2011h

2012

On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788

Elbassioni2011n

2011

A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games

Elbassioni2011d

2010

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354

Elbassioni2009d

2010

On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531

BorosElbassioniGurvich2010

2010

On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games

Elbassioni2010h

2007

Generating Vertices of Polyhedra and Related Monotone Generation Problems

Elbassioni2007c

Boros, Elbassioni, Gurvich, Makino, Oudalov

2008

A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109

Elbassioni2008d

Boros, Elbassioni, Gurvich, Tiwary

2011

The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76

Elbassioni2011k

2008

Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x

Elbassioni2008

Boros, Elbassioni, Khachiyan, Gurvich

2003

An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567

Elbassioni2003e

2003

An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27

Elbassioni2003a

2003

Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14

Elbassioni2003b

2002

Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33

Elbassioni2002bz

[Replication or Save Conflict]

2002

Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154

Elbassioni2002b

2000

An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14

Elbassioni2000

Boros, Elbassioni, Khachiyan, Gurvich, Makino

2002

Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20

Elbassioni2002a

2001

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103

Elbassioni2001

Boros, Elbassioni, Makino

2010

Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439

BorosElabassioniMakino2010

2008

On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59

Elbassioni2008c

Boullay

1996

Eine parallelisierbare Heuristik für das Min-Cost-Flow Problem
Universität des Saarlandes

Boullay96

Bouziane, El Kahoui

2002

Computation of the dual of a plane projective curve
In: Journal of Symbolic Computation [34], 105-117

ElKahoui2002a

Bradford, Capoyleas

1997

Weak epsilon-Nets for Points on a Hypersphere
In: Discrete & Computational Geometry [18], 83-91

Bradford-Capoyleas97

Bradford, Choppela, Rawlins

1995

Lower Bounds for the Matrix Chain Ordering Problem
In: LATIN'95: Theoretical Informatics, 2nd Latin American Symposium, 112-130

Bradford-et-al95

Bradford, Fleischer

1995

Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408

Bradford-Fleischer95

Bradford, Fleischer, Smid

1997

More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400

BrFlSm97

Bradford, Golin, Larmore

2002

Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303

BradfordGolinLarmore2002

Bradford, Golin, Larmore, Rytter

1998

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54

BradfordGolinLarmoreRytter1998

Bradford, Rawlins, Shannon

1998

Efficient Matrix Chain Ordering in Polylog Time
In: SIAM Journal on Computing [27], 466-490

Bradford-et-al.98

Bradford, Reinert

1996

Lower Bounds for Row Minima Searching
In: Automata Languages and Programming: 23rd International Colloquium (ICALP'96), 454-465

Bradford-Reinert-96

Bradonjić, Elsässer, Friedrich, Sauerwald, Stauffer

2010

Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421

FriedrichRGG2010

Bramer

2003

Zwei Algorithmen zur Bestimmung kostenminimaler Flüsse in Netzwerken
Universität des Saarlandes

BramerDipl03

Brandenburg, Jünger, Mutzel

1997

Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207

BJM97

Brandenburg, Jünger, Mutzel, Lengauer

1997

SPP 731 : Algorithmen zum automatischen Zeichnen von Graphen im Rahmen des DFG-Schwerpunkts "Effiziente Algorithmen für diskrete Probleme und ihre Anwendungen"
In: Informatik '97 : Informatik als Innovationsmotor : 27. Jahrestagung der Gesellschaft für Informatik, 58-67

BrandenburgJuengerMutzelLengauer97

Brandenburg, Schreiber, Jünger, Marks, Mutzel

1999

Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409

GDCompRep1999

Braun

2000

Entwicklung und Test von für statische Graphen optimierte Datentypen
Universität des Saarlandes

Braun2000

Bredereck, Nichterlein, Niedermeier, Philip

2011

Pattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193

brederecknichterleinniedermeierphilip2011a

2011

The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64

BredereckNichterleinNiedermeierPhilip2011b

Bremer

1995

Analyse und Simulation eines Maximum-Flow Algorithmus für das Gitter
Universität des Saarlandes

Bremer95

Brengel

2000

Externe Prioritätswarteschlangen
Universität des Saarlandes

Brengel2000

Brengel, Crauser, Meyer, Ferragina

1999

An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359

BCMP1999

Breslauer, Jiang, Jiang

1997

Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353

BrelauerJiangJiang97

Breslauer, Ramesh

1996

Optimal Parallel Construction of Minimal Suffix and Factor Automata
In: Parallel Processing Letters [6], 35-44

BreslauerRamesh96

Brightwell, Panagiotou, Steger

2012

Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178

Brightwell2012

Bringmann

2013

Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218

Bringmann13

2012

An improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233

BringmannCGTA12

Bringmann, Doerr, Neumann, Sliacan

2013

Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266

BringmannDoerrNeumannSliacan2013

Bringmann, Engels, Manthey, Raghavendra Rao

2013

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230

BringmannEMR13

Bringmann, Friedrich

2013

Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290

BringmannFjournal13

2013

Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278

BringmannF13-2

2013

Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582

BringmannF13

2012

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116

Bringmann2012d

2012

Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464

BringmannF12

2011

Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752

BringmannF2011

2010

An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402

TF_ECJ4

2010

Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610

TF_CGTA1

2010

The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518

BF2010GECCO

2010

Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616

BF2010PPSN

2009

Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20

BF09b

2009

Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112

BF09a

2008

Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447

BF08

Bringmann, Friedrich, Igel, Voß

2013

Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29

BringmannFIV13

Bringmann, Friedrich, Neumann, Wagner

2011

Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203

BringmannFNW2011

Bringmann, Green Larsen

2013

Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782

BringmannGL

Bringmann, Mehlhorn, Neumann

2012

Remarks on Category-Based Routing in Social Networks

category_based_routing_2012

Bringmann, Panagiotou

2012

Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144

BringmannP12

Bringmann, Sauerwald, Stauffer, Sun

2014

Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted

BringmannSSS14

Brockenauer

1997

Separierung von Kuratowski-Ungleichungen für das größte planare Untergraphenproblem
Universität des Saarlandes

Brockenauer97

Brockhoff, Friedrich, Hebbinghaus, Klein, Neumann, Zitzler

2009

On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603

BroetalTEC2009

2007

Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772

addobj07

Brockhoff, Friedrich, Neumann

2008

Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660

BroFriNeuPPSN2008

Brodal

1998

Finger Search Trees with Constant Update Time
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 540-549

Brodal98a

1997

Predecessor Queries in Dynamic Integer Sets
In: Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS-97), 21-32

Brodal97a

1996

Priority queues on parallel machines
In: 5th Scandinavian Workshop on Algorithm Theory (SWAT96), 416-427

Brodal96

Brodal, Chaudhuri, Radhakrishnan

1996

The randomized complexity of maintaining the minimum
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 4-15

BrodalChaudhuriRadhakrishnan96-CPM-7

1996

The randomized complexity of maintaining the minimum
In: Nordic Journal of Computing [3], 337-351

Brodal-Chaudhuri-Radhakrishnan

Brodal, Fagerberg, Meyer, Zeh

2004

Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, 480-492

BFMZ04

Brodal, Gasieniec

1996

Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74

Gasieniec2-96

Brodal, Kaligosi, Katriel, Kutz

2006

Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341

Kaligosi2006b

Brodal, Katajainen

1998

Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118

Brodal1998b

Brodal, Pinotti

1998

Comparator Networks for Binary Heap Construction
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 158-168

Brodal1998c

Brodal, Träff, Zaroliagis

1998

A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21

Brodal1998d

1997

A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693

Brodal-Traeff-Zaro97

Brönnimann, Burnikel, Pion

2001

Interval arithmetic yields efficient dynamic filters for computational geometry
In: Discrete Applied Mathematics [109], 25-47

BrönnimannBurnikelPion2001

1998

Interval analysis yields efficient dynamic filters for computational geometry
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 165-174

BBP:SCG98

Brönnimann, Kettner, Pocchiola, Snoeyink

2006

Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739

Kettner2006PseudoTEnum

2005

Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110

Kettner2005PseudoTriangEnum

Brönnimann, Kettner, Schirra, Veltkamp

2000

Applications 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

Schirra2000GenericProgramming

Brown, El Kahoui, Novotni, Weber

2006

Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173

ElKahoui2005d

Buchberger, Mehlhorn, Näher, Nievergelt (ed.)

1994

Special issue on “algorithms: implementation, libraries and use”

mehlhorn94

Buchheit

1999

Oberflächenrekonstruktion mithilfe von Voronoi-Diagrammen
Universität des Saarlandes

Buchheit1999

Bundy, Hebbinghaus, Stellmacher

2006

The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789

Hebbinghaus2006a

Burkhardt

2002

Filter Algorithms for Approximate String Matching
Universität des Saarlandes

BurkhardtDiss02

Burkhardt, Crauser, Ferragina, Lenhof, Rivals, Vingron

1999

q-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

Burkhardt1999/1

Burkhardt, Kärkkäinen

2003

Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70

BurkhardtKarkkainen2003

2003

Fast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69

Burkhardt2003

2002

One-Gapped q-Gram Filters for Levenshtein Distance
In: Combinatorial Pattern Matching : 13th Annual Symposium, CPM 2002, 225-234

Burkhardt2002

2001

Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85

Burkhardt2001

Burnikel

1996

Exact Computation of Voronoi Diagrams and Line Segment Intersections
Universität des Saarlandes

Burnikel-Diss96

Burnikel, Fleischer, Mehlhorn, Schirra

2000

A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99

BFMS2000

1999

Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350

BFMS1999

Burnikel, Funke, Mehlhorn, Schirra, Schmitt

2009

A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28

Burnikel2009

2001

A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265

BFMSS2001

Burnikel, Funke, Seel

2001

Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266

BurnikelFunkeSeel2001

1998

Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183

Funke1998

Burnikel, Könemann, Mehlhorn, Näher, Schirra, Uhrig

1995

Exact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19

Burnikel-et-al95

Burnikel, Mehlhorn, Schirra

1994

How to Compute the Voronoi Diagram of Line Segments:
Theoretical and Experimental Results
In: Algorithms (ESA-94) : 2nd annual European symposium, 227-239

Mehlhorn94b

1994

On degeneracy in geometric computations
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 16-23

Mehlhorn94gz

Busch

2011

Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes

BuschBach2011

Butman, Hermelin, Lewenstein, Rawitz

2010

Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18

Hermelin2010b

Butz

1997

Robuste Implementierung eines Algorithmus zur Berechnung eines Voronoi-Diagramms für Polygone
Universitaet des Saarlandes

Butz98

Cai, Lu, Xia

2013

Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295

Xia2013-soda-clx

Calinescu, Fernandes, Finkler, Karloff

1998

A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302

Finkler-et-al97

1996

A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25

Finkler-et-al96

Cameron, Johannsen, Prellberg, Schweitzer

2008

Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92

CameronJohannsenPrellbergSchweitzer2008

Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau

2012

Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43

Elbassioni2012c

Canzar, Elbassioni, Elmasry, Raman

2010

On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179

Elbassioni2010

Canzar, Elbassioni, Klau, Mestre

2011

On Tree-Constrained Matchings and Generalizations

Elbassioni2012j

2011

On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109

Elbassioni2011f

Canzar, Elbassioni, Mestre

2010

A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33

Mestre2010a

Canzar, Remy

2006

Shape Distributions and Protein Similarity
In: GCB, 1-10

Canzar2006

Caragiannis, Fishkin, Kaklamanis, Papaioannou

2007

A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160

Caragioannis2007

2007

Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136

CaragiannisFishkin2007

Caroli

2007

Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes

Caroli07Evaluation

2006

Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes

BachCaroli06

Case, Kötzing

2013

Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123

CaseKoetzing2012:MemLim

2012

Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596

CaseKoetzing2012:PhilTrans

2012

Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73

CaseKoetzing2012:DynMod

2011

Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331

Cas-Koe:c:11:StacsEpit

2010

Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299

Koetzing2010NUMemLimited

2010

Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193

Koetzing2010NUTechniques

Celikik, Bast

2009

Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731

bastcelikik2009sac

2009

Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205

celikikbast2009spire

Celikik, Bast, Manolache

2011

Efficient Index-Based Snippet Generation

bastcelikikmanolache2009-snippets

Chandran, Sivadasan

2004

On the Hadwiger's Conjecture for Graph Products

ChandranSivadasan2004

Chang

2007

Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16

Chang2007

Chang, Johnson

2008

Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52

Chang2008a

Chang, Kannan

2006

The Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166

Chang2006

Chan, Dhamdhere, Gupta, Kleinberg, Slivkins

2009

Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329

CDGKS2009

Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs

2011

Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517

Lee2010d

2009

Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264

Chan2008c

Chan, Edmonds, Pruhs

2009

Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10

ChanSPAA2009

Chan, Elbassioni

2011

A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723

Elbassioni2011j

Chan, Gupta

2009

Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44

ChanGupta2009

Chan, Lam, Lee

2011

Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403

Lee2011b

2010

Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35

Lee2010b

Chan, Lam, Lee, Ting

2012

Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111

LeeLK2012

2010

Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190

Lee2010a

Chan, Megow, Sitters, van Stee

2012

A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18

ChMeSS12

Chaudhuri

1996

Sensitive functions and approximate problems
In: Information and Computation [126], 161-168

Chaudhuri96

Chaudhuri, Dimopoulos, Zaroliagis

1996

On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230

Chaudhuri-Zaroliagis-96

Chaudhuri, Dubhashi

1997

Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56

ChaudhuriDubhashi97

1995

Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219

Shiva-Dubhashi95

Chaudhuri, Garg, Ravi

1998

The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134

ChaudhuriGargRavi

Chaudhuri, Hagerup

1995

Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218

Shiva-Hagerup95

Chaudhuri, Radhakrishnan

1997

The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22

Chaudhuri-Radhakrishnan97

1996

Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36

ChaudhuriRadhakrishnan96

Chaudhuri, Subrahmanyam, Wagner, Zaroliagis

2000

Computing mimicking networks
In: Algorithmica [26], 31-49

ChaudhuriSubrahmanyamWagnerZaroliagis2000

1998

Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567

Chauduri-Subrahmanyam-Wagner-Zaroliagis-98

Chaudhuri, Zaroliagis

2000

Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226

ChaudhuriZaroliagis2000

1998

Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223

Chaudhuri-Zaroliagis-2-97

1995

Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45

Shiva-Zaro-2-95

1995

Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255

Shiva-Zaro-1-95

Cheng, Funke, Golin, Kumar, Poon, Ramos

2003

Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429

CFGKPR2003

Chen, Das, Smid

1996

Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160

Chen-Das-Smid96

Chen, Doerr, Hu, Ma, van Stee, Winzen

2012

The Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433

CDHMSW12

Chen, Epstein, Kleiman, van Stee

2013

Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19

ChEpKS13

Cheriyan, Hagerup

1995

A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226

Cheriyan-Hagerup95

Cheriyan, Hagerup, Mehlhorn

1996

An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170

Cheriyan-Hagerup-Mehlhorn96

1990

Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248

Mehlhorn90c

1990

Can a maximum flow be computed in $o(nm)$ time?

mehlhorn86e

Cheriyan, Mehlhorn

1999

An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242

Cheriyan-Mehlhorn99

1996

Algorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549

Cheriyan-Mehlhorn96

Chian, Goodrich, Grove, Tamassia, Vengroff, Vitter

1995

External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149

Grove-et-al-1-95b

Ching, Mehlhorn, Smid

1990

Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40

Ching:1990:DDD

Chin, Guo, Sun

2011

Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722

Sun2011b

Chlebus, Czumaj, Gasieniec, Kowaluk, Plandowski

1996

Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266

Gasieniec4-96

Chlebus, Czumaj, Sibeyn

1997

Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279

ChlebusCzumajSibeyn97

Chlebus, Kowalski

2005

Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739

CK-STOC

2004

A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274

CK-PODC

2004

Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41

Kowalski2003a

Chlebus, Kowalski, Shvartsman

2004

Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330

Kowalski-STOC-2004

Chong

1996

Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14

Chong-1-96

Chong, Lam

1998

Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410

Chong1998

1996

Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232

Chong-Lam96

Chong, Ramos

1998

Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416

Chong-Ramos1998

Christodoulou

2008

Price of Anarchy
In: Encyclopedia of Algorithms, 1-99

Christodoulou2008

Christodoulou, Chung, Ligett, Pyrga, van Stee

2010

On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97

CCLPS2009

Christodoulou, Elbassioni, Fouz

2010

Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181

Elbassioni2010i

Christodoulou, Gourves, Pascual

2007

Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197

CGP2007

Christodoulou, Koutsoupias

2009

Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59

CK2009

Christodoulou, Koutsoupias, Kovács

2010

Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18

CKK2009

2007

Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52

CKK07

Christodoulou, Koutsoupias, Nanavati

2009

Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336

CKV2009

Christodoulou, Koutsoupias, Vidali

2009

A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740

CKValgorithmica2008

2008

A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307

ChristodoulouKV2008

2007

A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170

CKV07

Christodoulou, Kovács

2010

A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016

ChristodoulouKavacs2010

Christodoulou, Kovács, Schapira

2008

Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832

ChristodoulouKS2008

Christodoulou, Kovacs, van Stee

2013

A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98

ChKoSt2013

2010

A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193

ChKoSt10

Christodoulou, Ligett, Pyrga

2010

Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441

CPL2010

Christodoulou, Mehlhorn, Pyrga

2011

Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130

Becker2011

Christof, Jünger, Kececioglu, Mutzel, Reinelt

1997

A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447

CJKMR97

1997

A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92

Mutzel-et-al-97

Chrobak, Dürr, Jawor, Kowalik, Kurowski

2006

A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73

Kowalik2006

Chrobak, Gasieniec, Kowalski

2007

The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471

Chrobak2007

2004

The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993

Kowalski-SODA-2004

Cilleruelo, Hebbinghaus

2009

Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611

Cilleruelo2009

Clanget

1999

Plattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI)
Universität des Saarlandes

Clanget1999

Clarkson, Mehlhorn, Seidel

1993

Four Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212

Mehlhorn1993h

1992

Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474

Mehlhorn92f

Clementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri

2013

Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336

Winzen2013z

Clementi, Crescenzi, Doerr, Fraigniaud, Pasquale, Silvestri

2013

Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013),

DynamicGraphRumor

Cole, Farach-Colton, Hariharan, Przytycka, Thorup

2000

An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404

ColeFarachetal2000

Cole, Hariharan

1996

An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332

Cole-Hariharan96

Cole, Hariharan, Paterson, Zwick

1995

Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45

Hariharan-et-al95

Cole, Kowalik

2008

New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368

KowalikEdgeColoring

Cole, Kowalik, Skrekovski

2007

A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106

KowalikKotzig

Cole, Ost, Schirra

2001

Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12

Schirra2001EdgeColoring

Comes, Ziegelmann

1999

An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182

Ziegelmann1999

Cooley, Fountoulakis, Kühn, Osthus

2009

Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297

Fountoulakis2009

2008

3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505

Fountoulakis2008a

Cooper, Doerr, Friedrich, Spencer

2010

Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366

DCFS2010

2008

Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772

Doerr2008-SODAb

2007

Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513

Doerr2007-ENDMa

Cooper, Doerr, Spencer, Tardos

2007

Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090

CDoerrST2007

2006

Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197

DoerrANALCO06

2006

Deterministic Random Walks on the Integers
In: ??? [?], 1-27

CDoerrSP2006

2005

Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76

Doerr2005EurocombPropp

Cooper, Frieze, Mehlhorn, Priebe

2000

Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46

CooperFriezeMehlhornPriebe00

1997

Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26

CooperFriezeMehlhornPriebe97

Correa, Megow, Raman, Suchan

2009

Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350

CorreaMRS2009

Crauser

2001

LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes

Crauser2001

Crauser, Ferragina

2002

A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35

Crauser-Ferragina2001

1999

On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235

Crauser1999

Crauser, Ferragina, Mehlhorn, Meyer, Ramos

2001

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337

CFMMR2001

1999

I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138

CFMMR1999

1998

Randomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268

CFMMR98

Crauser, Mehlhorn

1999

LEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242

Crauser1999a

Crauser, Mehlhorn, Meyer

1997

Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132

CraMehMey97

Crauser, Mehlhorn, Meyer, Sanders

1998

A 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

CMMS1998a

Crauser, Meyer, Brengel

2001

An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24

Crauser2000

Crochemore, Galil, Gasieniec, Park, Rytter

1997

Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960

Crochemore-et-al.97

Crochemore, Gasieniec, Hariharan, Muthukrishnan, Rytter

1998

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681

CromemoreGasienicHariharanMuthukrishnanRytterSIAMJCOMPUT1998

Crochemore, Gasieniec, Rytter

1998

Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239

Crochemore-Gasieniec-Rytter97

Croitoru

2013

Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013,

croi13

2012

Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes

CroitoruMaster2012

Croitoru, Kötzing

2014

A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45

croikotzi13

2012

Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82

croikotzi12

Csaba

2007

On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31

Csaba07

2003

Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72

Csaba2003a

Csaba, Krysta, Karpinski

2002

Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83

Krysta2002a

Csaba, Lodha

2006

A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104

Csaba06

2001

A randomized on-line algorithm for the k-server problem on a line

Csaba2001

Curticapean, Künnemann

2013

A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360

CurticapeanK2013

Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, Wahlström

2012

On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84

DLMNOPSW2012

Cygan, Kratsch, Pilipczuk, Pilipczuk, Wahlström

2012

Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265

CyganKratschPilipczukPilipczukWahlstroem2012

Cygan, Philip, Pilipczuk, Pilipczuk, Wojtaszczyk

2011

Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000

CyganPhilipPilipczukPilipczukWojtaszczyk2011

Czumaj, Ferragina, Gasieniec, Muthukrishnan, Träff

1997

The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176

Traff97:string

Czumaj, Krysta, Vöcking

2002

Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296

Krysta2002b

Czumaj, Vöcking

2002

Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420

CzumajBV02+

Czyzowicz, Kowalski, Markou, Pelc

2006

Complexity of searching for a black hole

CKMP-manus

2005

Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80

CKMP-OPODIS

Dams, Hoefer, Kesselheim

2013

Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357

DamsHK2013

Das, Fleischer, Gasieniec, Gunopulos, Kärkkäinen

1997

Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27

Das-et-al97

Das, Kapoor, Smid

1997

On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460

Das-Kapoor-Smid97

1996

On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75

Das-Kapoor-Smid96

Datta, Lenhof, Schwarz, Smid

1995

Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503

Lenhof-et-al95

de Berg, Schirra

2002

Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2

deBergSchirraSoCG2002

de Berg, Schirra (ed.)

2002

Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)

deBergSchirra2002

de Berg, van Kreveld, Schirra

1998

Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257

deBerg-vanKreveld-Schirra1998

De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi

1996

Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371

DDJMRR96

De Sterck

2012

A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379

DeSterckNGMRES

2012

A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117

DeSterckSVD

2012

Steepest Descent Preconditioning for Nonlinear GMRES Optimization

DeSterckDescent

De Sterck, Henson, Sanders

2011

Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking

DHS2011

De Sterck, Miller, Sanders, Winlaw

2011

Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671

DMSW2010

Dedorath, Gergov, Hagerup

1995

More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243

Dedo-Gergov-Hagerup95

Dementiev

2006

Algorithm Engineering for Large Data Sets
Universität des Saarlandes

Diss06Dementiev

Dementiev, Kärkkäinen, Mehnert, Sanders

2005

Better External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97

DKMS05

Dementiev, Kettner, Mehnert, Sanders

2004

Engineering 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

Dementiev2004SearchTree

Dementiev, Kettner, Sanders

2005

STXXL: Standard Template Library for XXL Data Sets

Kettner2005StxxlReport

2005

STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651

Kettner2005Stxxl

Dementiev, Sanders

2003

Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148

DemSan03

Dementiev, Sanders, Schultes, Sibeyn

2004

Engineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208

DSSS04

Deng, Mahajan

1997

The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802

Deng-Mahajan97

Denny

2003

Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451

Denny03

1994

Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes

Denny94

DeSimone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi

1995

Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496

Mutzel-et-al-95

Dessmark, Fraigniaud, Kowalski, Pelc

2006

Deterministic rendezvous in graphs

DFKP

2006

Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96

DFKP2006

Deussen, Mehlhorn

1977

Van Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199

mehlhorn77d

Devillers, Golin, Kedem, Schirra

1996

Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327

Schirra-et-al-1-96

Dey, Funke, Ramos

2001

Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132

DFR2001

Dey, Mehlhorn, Ramos

2000

Curve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244

Ramos2000b

1999

Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206

DeMeRa1999

Dhiflaoui, Funke, Kwappik, Mehlhorn, Seel, Schömer, Schulte, Weber

2003

Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256

dfkmsssw2003

Dickert

2000

Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes

Dickert2000

Diedrich, Harren, Jansen, Thöle, Thomas

2008

Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762

DiedrichHarrenJansenThoeleThomas2008

2007

Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45

Harren2007

Diedrich, Kehden, Neumann

2008

Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98

DieKehNeu2008

Diedrich, Neumann

2008

Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833

DieNeuCEC2008

Diekert, Jez, Plandowski

2014

Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15

Jez2014CSR

Diete

1995

Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes

Diete95

Dietzfelbinger, Hagerup, Katajainen, Penttonen

1997

A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51

Hagerup-et-al97

Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan

1994

Dynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761

Mehlhorn94c

1991

Dynamic Perfect Hashing: Upper and Lower Bounds

mehlhorn91d

1988

Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531

FOCS::DietzfelbingerKMHRT1988

Dietzfelbinger, Mehlhorn, Meyer auf der Heide, Rohnert

1988

Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215

SWAT::DietzfelbingerMHR1988

Dietz, Mehlhorn, Raman, Uhrig

1995

Lower bounds for set intersection queries
In: Algorithmica [14], 154-168

Mehlhorn-Uhrig95

1993

Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201

Mehlhorn93f

Diks, Hagerup

1998

More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29

DiksHagerup1998

1996

More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140

Diks-Hagerup96

Ding

2003

Geometric Rounding without changing the Topology
Universität des Saarlandes

Dipl03/Ding

Dinitz, Garg, Goemans

1999

On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41

DinitzGargGoemans1999

Dinitz, Nutov

1999

A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30

DinitzZeev1999

Djidjev, Pantziou, Zaroliagis

2000

Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389

DjidjevPantziouZaroliagis2000

1995

Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200

Djidjev-Pantziou-Zaro-2-95

1995

On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204

Djidjev-Pantziou-Zaro-1-95

Dobkin, Gunopulos

1996

Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132

Dobkin-Gunopulos96

Dobrindt, Mehlhorn, Yvinec

1993

A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron

mehlhorn93j

1993

A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324

Mehlhorn93b

Doerr

2013

Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749

Doerr2013AppAlg

2012

Black-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092

Doerr12GECCO

2011

Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320

Doerr11

2009

Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111

Doerr2009

2007

Lp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666

LpDisc2006

2007

Matrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995

DoerrTusnady

2007

Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363

Doerr2007partial

2007

Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452

stacs07_rand

2007

Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483

DoerrTCS2007

2006

Generating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583

DoerrStacs2006

2006

Matrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112

RoundSmSub2006

2006

Non-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659

RandCol2006

2006

Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99

DigHalf2003

2005

Integral Approximation
Christian-Albrechts-Universität zu Kiel

Doerr2005Habil

2005

Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068

Doerr2005

2005

Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628

DoerrSTACS2005

2004

Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685

MultiColor2004

2001

Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx

GameAging2001

Doerr, De Rainville

2013

Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796

DoerrDR2013

Doerr, Doerr, Ebel

2013

Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788

DoerrDE13

Doerr, Doerr, Spöhel, Thomas

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