MPI-INF D1 Publications

ok - ch 061004: neue Links gefunden und eingesetzt.

ch 061004: falsche Links entfernt, nur zur Sicherheit hier vermerkt:
URL of the conference:
http://www.cs.unm.edu/Conferences/ALENEX00/
URL for downloading:
http://www.cs.unm.edu/Conferences/ALENEX00/proceedings.html
URL of the table of contents:
http://www.cs.unm.edu/Conferences/ALENEX00/proceedings.html
URL for Reference:
Table of Contents

ok / 060912 ch : http://www.cs.unm.edu/~moret/ALENEX00/proceedings.html

nur im Internet
URL ist falsch!!! und nun? Papers sollen auch in JEA ersch. (Online-Journal von ACM, Zugriff funktioniert nicht)
lt. Ernst Althaus nur online ersch.
URL wird geprueft

Electronic Proceedings Article

2000

TSP-Based Curve Reconstruction in Polynomial Time
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 686-695

Proceedings Article

1998

Berechnung optimaler Steinerbäume in der Ebene
Universität des Saarlandes

Thesis - Masters thesis

1998

Maximum Network Flow with Floating Point Arithmetic
In: Information Processing Letters [66], 109-113

Abgleich über die Internetseite / ch 060828
http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V0F-3TP137J-1-6&_cdi=5645&_user=43521&_orig=browse&_coverDate=05%2F15%2F1998&_sk=999339996&view=c&wchp=dGLzVzz-zSkzV&md5=17c3790dbda005248c45d3174921510f&ie=/sdarticle.pdf

Journal Article

Altmeyer, Sebastian

2010

A New Combinatorial Approach to Parametric Path Analysis

Report

Alt, Helmut

1996

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547

ok - abgeglichen mit download-Datei von Springer / ch 060823
einfügen des pdf's / ch 060918
DB Books: Dokumentnummer: P-96-51

Journal Article

1992

A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27

Journal Article

1992

Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408

Journal Article

1991

A Method for Obtaining Randomized Algorithms with Small Tail Probabilities

ok - mit Papierfassung abgeglichen (dort ist der Titel nicht ganz korrekt) / ch 060925

ok - übertragen des pdf files / ch 060918
übertragen aus der Books-DB / ch 060726

Report

1991

Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240

Journal Article

1990

Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289

(ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/conf/compgeom/compgeom90.html#AltFKMNSU90

Proceedings Article

1988

A Lower Bound on the Complexity of the Union-Split-Find Problem
In: SIAM Journal on Computing [17], 1093-1102

Journal Article

1988

prüfen: http://dblp.uni-trier.de/db/journals/dcg/dcg3.html#AltMWW88

Journal Article

1987

A Lower Bound for the Complexity of the Union-Split-Find Problem
In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, 479-488

ok - in DBLP gefunden, ProcDaten aus Books-DB, aus Papierfassung aufergänzt / ch 060921

Proceedings Article

1987

Report

1987

SCG = Inv. 431
institution = "FU Berlin/U Saarlandes/TU Berlin/TU Graz",
Autoren korrigiert. UB

Proceedings Article

1987

Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15

in DBLP gefunden, aus Papierfassung aufergänzt / ch 060921

http://websok.libris.kb.se/websearch/showrecord;jsessionid=046CC02F4BAA278125C493CE4625A5D2?searchId=22729&nr=1

Proceedings Article

1987

Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835

Journal Article

1986

A Lower Bound for the Complexity of the Union-Split-Find Problem

ok - aus Papierfassung die Seitenzahl aufergänzt / ch 060920

bei der SULB fehlt der 3. Autor ...

übertragen aus Books-DB / ch 060806

Report

1986

Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208

Proceedings Article

1985

Deterministic simulation of idealized parallel computers on more realistic ones

ok - Seitenzahl aus Papierfassung aufergänzt / ch 060920

übertragen aus der Books-DB / ch 060803

Report

1985

Searching Semisorted Tables
In: SIAM Journal on Computing [14], 840-848

Journal Article

1984

On the complexity of partial match retrieval
In: Information Processing Letters [19], 61-65

Journal Article

1984

Partial match retrieval in implicit data structures
In: Information Processing Letters [19], 61-65

Journal Article

1981

Partial Match Retrieval in Implicit Data Structures
In: Mathematical foundations of computer science (MFCS-81) : 10th symposium, ,, 156-161

Proc.Daten aus Books-DB übertragen/ ch 060806

Proceedings Article

1979

Complexity arguments in algebraic language theory
In: Revue française d'automatique, d'informatique et de recherche opérationnelle : RAIRO / Association Française pour la Cybernétique Economique et Technique [13], 217-225

http://dblp.uni-trier.de/db/journals/ita/ita13.html#AltM79 / ch 060807
Titel der Zeitschrift aus der ZDB / ch 060808

Journal Article

1978

Complexity Arguments in Algebraic Language Theory

ok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl & Bericht-Nr aus SULB / ch060919

Report

1976

Lower Bounds for the Space Complexity of Context-Free Recognition
In: Third International Colloquium on Automata, Languages and Programming, 338-354

Proceedings Article

1975

A Language over a One Symbol Alphabet Requiring only O(log log n) Space
In: SIGACT News [7], 31-33

ok - aufergänzt: pdf / ch 061109
- wir haben nicht den entsprechenden Zeitschriftenjahrgang, soweit so ok wie möglich.

ch 29.8.06 : aus computer bibliography ... ; aufergänzt aus: http://portal.acm.org/citation.cfm?id=990506&coll=portal&dl=ACM&CFID=41678957&CFTOKEN=20987220

Journal Article

1975

Untere Schranken für den Platzbedarf bei der kontext-freien Analyse

ok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919

Report

Alvarez, Victor

2013

Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89

Proceedings Article

2012

Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68

Proceedings Article

Amaldi, Edoardo

2009

Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312

Proceedings Article

2009

Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312

Proceedings Article

Amato, Nancy M.

2001

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265

Journal Article

2000

Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706

Proceedings Article

2000

Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212

Proceedings Article

Ambalath, Abhimanyu M.

2010

On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25

Proceedings Article

Ambras, Dirk

1998

AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457

Proceedings Article

Amini, Omid

2010

Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50

Electronic Journal Article

2009

Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42

Proceedings Article

2009

Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760

Journal Article

Anagnostopoulos, Aris

2013

Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),

Proceedings Article

Anand, S

2013

Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24

Proceedings Article

Anand, S.

2011

Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243

Proceedings Article

Andersson, Arne

2000

Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578

Journal Article

1995

Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436

Proceedings Article

Andreou, Maria

2002

On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92

Proceedings Article

Angelopoulos, Spyros

2010

On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12

Proceedings Article

2010

Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558

Journal Article

2009

Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386

Proceedings Article

2009

Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48

Proceedings Article

2009

Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145

Proceedings Article

2009

Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19

Electronic Journal Article

2008

A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87

Proceedings Article

2008

List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410

Proceedings Article

2008

Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873

Proceedings Article

2007

Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257

Proceedings Article

2007

On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237

Proceedings Article

Anshelevich, Elliot

2013

Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60

Proceedings Article

Antoniadis, Antonios

2013

How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73

Proceedings Article

Antoniol, Giulio (ed.)

2008

GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation

Proceedings

Aranov, Boris

2004

Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88

ok/ch050501

Proceedings Article

Aref, Walid G.

2004

Scalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509

ch - ok/ch050421

Proceedings Article

Arge, Lars

2004

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157

Proceedings Article

2003

On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129

Journal Article

2001

On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482

Proceedings Article

1999

I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20

Proceedings Article

Arikati, Srinivasa Rao

2001

Approximation algorithms for maximum two-dimensional pattern matching
In: Theoretical Computer Science [255], 51-62

q
wurde im Jahrbuch 2001 noch nicht veröffentlicht

Journal Article

1999

A correctness certificate for the Stoer-Wagner min-cut algorithm
In: Information Processing Letters [70], 251-254

ok - ch 061004 :
- der Titel ist wirklich auch auf der Webseite mit dem Artikel klein gedruckt
- abgeglichen mit Artikel auf der Webseite
- pdf eingesetzt

Aufergänzt aus dem Internet / ch060828

Journal Article

1998

All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110

Journal Article

1997

Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16

gefunden durch Bibliotheksabgleich

Journal Article

1996

Approximation algorithms for maximum two-dimensional pattern matching
In: Combinatorial Pattern Matching: 7th Annual Symposium, CPM96, 348-360

Proceedings Article

1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528

Proceedings Article

1996

Realizing degree sequences in parallel
In: SIAM Journal of Computing [9], 317-338

Journal Article

1995

All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376

Proceedings Article

Aronov, Boris

2007

Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691

Proceedings Article

2006

Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116

ok / ch 070408
Non-MPII-ler gemäß download article.

ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/journals/ijcga/AronovAKMT06
- Abgleich mit Journal-Webseite

Journal Article

Arora, Sanjeev

1999

Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40

Proceedings Article

Arumugam, S.

2011

Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30

Proceedings Article

Arya, Sunil

2007

A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17

Journal Article

2007

Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610

Journal Article

2006

On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573

ok / ch 070201

Proceedings Article

2006

The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20

ok / ch 070201

Proceedings Article

2005

Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544

ch - ok/ch050425
q/ch050411 - ISBN

Proceedings Article

2000

Approximate range searching
In: Computational Geometry [17], 135-152

Journal Article

2000

Hardness of Set Cover with Intersection 1
In: Automata, Languages and Programming, Proceedings of the 27th International Colloquium (ICALP-00), 624-635

Proceedings Article

1999

On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228

gefunden: Collection of Computer Science Bibliographies; vervollständigt aus dem Internet / ch 060828

Journal Article

1997

Efficient construction of a bounded degree spanner with low weight
In: Algorithmica [17], 33-54

Journal Article

1996

Accounting for boundary effects in nearest neighbor searching
In: Discrete & Computational Geometry [16], 155-176

Journal Article

1995

Accounting for boundary effects in nearest neighbor searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 336-344

Proceedings Article

1995

Approximate range searching
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 172-181

Proceedings Article

1995

Euclidean spanners: short, thin, and lanky
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 489-498

Proceedings Article

Asano, Tetsuo

2011

Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319

Proceedings Article

2007

Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691

Proceedings Article

2006

Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356

ok / ch 070207
- aus Webseite aufergänzt

Journal Article

2006

Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116

ok / ch 070408
Non-MPII-ler gemäß download article.

ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/journals/ijcga/AronovAKMT06
- Abgleich mit Journal-Webseite

Journal Article

2004

Polyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88

ok/ch050501

Proceedings Article

Ashoff, Oliver

2000

Agorithmen der modularen Arithmetik
Universität des Saarlandes

Thesis - Masters thesis

Auger, Anne (ed.)

2011

Theory of Randomized Search Heuristics

Book

Auletta, Vincenzo

1999

A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph
In: Journal of Algorithms [32], 21-30

Journal Article

Avigdor-Elgrabli, Noa

2012

Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121

Journal Article

2011

Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36

Proceedings Article

Awerbuch, Baruch

1995

Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391

Proceedings Article

Azar, Yossi

1995

Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391

Proceedings Article

Babenko, Maxim A.

2014

Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39

Proceedings Article

Bacardit, Jaume (ed.)

2009

GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.

Proceedings

Bachrach, Ran

2002

On the competitive theory and practice of online list accessing algorithms
In: Algorithmica [32], 201-246

q
erledigt / bc 09.05.03

Journal Article

Bacik, Roman

1995

Semidefinite programming and its applications to NP problems
In: Computing and Combinatorics: 1st Annual International Conference (COCOON95), 566-575

Proceedings Article

Backes, Werner

1998

Berechnung kürzester Gittervektoren
Univesität des Saarlandes

Gefunden von Christine durch Abgleich mit dem Library System. UB.

Thesis - Masters thesis

Bader, David

2002

Algorithm Engineering for Parallel Computation
In: Experimental Algorithmics, 1-23

Part of a Book

Balasundaram, Radheshyam

2010

On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25

Proceedings Article

Baltz, Andreas

2007

On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545

Journal Article

2005

On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26

Proceedings Article

2004

Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133

Journal Article

Banderier, Cyril

2003

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

Proceedings Article

2002

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

Journal Article

2002

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

Journal Article

2001

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

Thesis - PhD thesis

2001

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

Journal Article

2000

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

Proceedings Article

2000

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

Proceedings Article

1999

An Introduction to Analytic Number Theory

Miscellaneous

1999

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

Proceedings Article

Bannai, Hideo

2013

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

Proceedings Article

Bansal, Nikhil

2011

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

Journal Article

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

Proceedings Article

2009

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

Proceedings Article

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

Proceedings Article

Bar-Yehuda, Reuven

2011

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

Journal Article

2010

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

Proceedings Article

2007

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

Proceedings Article

Bárány, Imre

2006

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

ok / ch 070201
- mit webseite abgeglichen
- abstract + download-pfad eingesetzt

Journal Article

Baraque, Raef

2002

Effiziente Multiplikationsverfahren: ein numerischer Vergleich
Universität des Saarlandes

Thesis - Masters thesis

Barnes, Greg

1998

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

Gefunden durch Bibliotheksabgleich. UB.

Journal Article

Bartal, Yair

2006

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

Proceedings Article

Baruah, Sanjoy

2012

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

Sanjoy Baruah, Vincenzo Bonifaci, Gianlorenzo D’Angelo, Haohan Li,
Alberto Marchetti-Spaccamela, Nicole Megow, and Leen Stougie

Journal Article

2011

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

Proceedings Article

2010

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

Journal Article

2010

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

Proceedings Article

Barve, Rakesh D.

1995

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

Proceedings Article

Basit, Abdul

2010

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

Journal Article

Bäsken, Matthias

2001

CGAL Reference and User Manuals

Unknown Form: eBookForm

Bast, Hannah

2009

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

Part of a Book

2009

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

Proceedings Article

2002

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

Proceedings Article

2000

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

Journal Article

2000

Provably Optimal Scheduling of Similar Tasks
Universität des Saarlandes

Thesis - PhD thesis

2000

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

Proceedings Article

1998

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

Proceedings Article

1995

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

Journal Article

1994

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

Thesis - Masters thesis

Bast, Holger

2011

Efficient Index-Based Snippet Generation

Unpublished/Draft

2009

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

Proceedings Article

2009

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

Part of a Book

2007

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

Proceedings Article

2007

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

Proceedings Article

2007

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

Journal Article

2007

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

Proceedings Article

2007

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

korrekter Buchtitel???

ok - exportkorr0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract (war schon)
- pdf nicht im Web gefunden

Proceedings Article

2007

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

woher kommt der Editor? falls das aber stimmt, dass Gerhard der Ed ist, bitte Bescheid sagen - dann muss ich für ein Proceedings Volume anlegen.
Ich vermute allerdings, dass er nicht Ed, sondern Program Chair war.

Publisher?
Publisher's address?

Ansonsten:
exportkorr0707 / ch
- Abgleich mit Web - soweit möglich
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf

Electronic Proceedings Article

2007

Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?

UB: Jahr von 2006 auf 20076 geschoben. Kein Tagungsband in gedruckter Form verfügbar. Website bietet nur Download der Extended Abstracts an. Diese werden aber nicht für die Jahrbuchmeldung akzeptiert.

Proceedings Article

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

achtung: eigentlich nicht 3. bis 7-10, sondern 3. und 7.10 !!!

Proceedings Article

2006

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

Electronic Journal Article

2006

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

ed? publisher?

Electronic Proceedings Article

2006

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

Report

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

ok / ch 070201
- abgeglichen mit http://dblp.uni-trier.de/rec/bibtex/conf/vldb/BastMSTW06
- pdf eingefügt / download verbidden
- abgeglichen mit gleichem Datensatz in der D5

Proceedings Article

2006

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

ok - pdf eingefügt / 061004

ok / ch060416

Journal Article

2006

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

ok / ch 070205
- als LNCS gefunden und aufergänzt
- pdf eingefügt / download verbidden

Proceedings Article

2006

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

Electronic Proceedings Article

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

ok / ch 070205
- aus dblp aufergänzt
- pdf eingesetzt / download verbidden

Proceedings Article

2006

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

Proceedings Article

2005

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

ok / ch051109

Proceedings Article

2005

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

ok / ch051109

Proceedings Article

2005

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

Journal Article

2005

Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24

@inproceedings{DELIS-TR-0287, author = {Gerhard Weikum and Holger Bast and Geoffrey Canright and David Hales and Christian Schindelhauer and Peter Triantafillou}, title = {Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search}, booktitle = {ECCS Workshop on Peer-to-peer data management in the Complex Systems perspective}, year = {2005}, key = {DELIS-TR-0287} }

Proceedings Article

2005

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

ok / ch060320 (aus DB Books aufergänzt)
q / ch051114

Proceedings Article

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

Proceedings Article

2004

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

ok/ch050523

Proceedings Article

2003

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

Journal Article

1992

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

Proceedings Article

1991

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

Proceedings Article

Baswana, Surender

2011

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

Journal Article

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

Proceedings Article

2007

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

Journal Article

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

ch - ok/ch050425

Proceedings Article

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

ok / ch051114
q/ch050425 - seitenzahl ergänzen!

Proceedings Article

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

Proceedings Article

2004

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

Part of a Book

Batra, Prashant

2010

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

Journal Article

Baumann, Nadine

2004

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

ch - ok/ch050426

Proceedings Article

Baumann, Tobias

2007

Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432

Proceedings Article

Baumbach, Jan

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

Proceedings Article

2012

Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764

Journal Article

Baumgarten, Hanna

1994

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

Journal Article

1992

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

Proceedings Article

Baus, Andreas

2005

Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes

ok / ch060321

Thesis - Masters thesis

2004

Symbolic Constraints in Linear Integer Programming
Universität des Saarlandes

q/ch050426 - nachtragen: referees, supervisor

Thesis - Masters thesis

Becchetti, Luca

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

Proceedings Article

2003

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

Proceedings Article

Becker, Jörg

1996

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

Thesis - Masters thesis

Becker, Michael

1986

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

Journal Article

1984

Algorithms for routing in planar graphs

ok - aus Papierfassung Number korrigiert + Seitenzahl ergänzt / ch 060920

übertragen aus der Books-DB / ch 060803

Report

1982

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

Journal Article

Becker, Ruben

2012

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

Thesis - Bachelor thesis

Behle, Markus

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

Proceedings Article

2007

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

Proceedings Article

Behrens, Christian

2000

Solid Modeling durch Boolesche Operationen
Universität des Saarlandes

modeling oder modelling?

Thesis - Masters thesis

Beier, Rene

2011

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

Journal Article

2007

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

Proceedings Article

2006

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

ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden

Journal Article

2006

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

ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden

Journal Article

2006

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

ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden

Journal Article

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

Proceedings Article

2004

Probabilistic Analysis of Discrete Optimization Problems
Universität des Saarlandes

q/ch050421 - fehlt: referees + supervisor

Thesis - PhD thesis

2004

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

Proceedings Article

2004

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

Journal Article

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

ok/ch050523

Proceedings Article

2003

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

Proceedings Article

2003

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

Proceedings Article

2002

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

Proceedings Article

2000

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

Proceedings Article

2000

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

Thesis - Masters thesis

Bein, Wolfgang W.

2000

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

Journal Article

Bei, Xiaohui

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

Proceedings Article

Beldiceanu, Nicolas

2007

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

Da noch nicht erschienen: Jahr 2006 in Jahr 2007 geändert

Journal Article

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

ok/ch050501

Proceedings Article

2004

Filtering algorithms for the Same and UsedBy constraints

12.8.05: aus RR-DB kopiert / ch

Report

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

Proceedings Article

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

ok
Datum korrigiert und Referenz URL auf das Paper gestellt. UB.

Electronic Proceedings Article

2002

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

Report

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

Proceedings Article

Belfrage, Michael

2012

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

Journal Article

Ben-Asher, Y.

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

Journal Article

Ben-Zwi, Oren

2011

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

Journal Article

Bender, Michael A. (ed.)

2005

Cache-Oblivious and Cache-Aware Algorithms

ch 060927: pdf - s. Email: Angelika Mueller <angelika.mueller@dagstuhl.de> wrote on 02.08.2006 11:55:22
Die Seitenzahl bezieht sich auf die Abstract Collection der Webseite

Report

Berberich, Eric

2013

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

Journal Article

2012

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

Journal Article

2012

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

Electronic Journal Article

2011

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

Proceedings Article

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

Proceedings Article

2011

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

Electronic Journal Article

2011

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

Proceedings Article

2011

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

Electronic Journal Article

2011

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

Proceedings Article

2010

A Generic Algebraic Kernel for Non-linear Geometric Applications

Report

2010

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

Special Issue on 24th Annual Symposium on Computational Geometry (SoCG'08)

Journal Article

2010

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

Electronic Journal Article

2010

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

Journal Article

2010

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

Journal Article

2010

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

Part of a Book

2010

Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289

Part of a Book

2010

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

Electronic Proceedings Article

2009

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

Journal Article

2009

Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619

Proceedings Article

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

Proceedings Article

2008

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

Proceedings Article

2008

CGAL's Curved Kernel via Analysis

Report

2008

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

Proceedings Article

2008

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

Proceedings Article

2008

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

Proceedings Article

2008

Prototype implementation of the algebraic kernel

Report

2008

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

Thesis - PhD thesis

2007

Computing Envelopes of Quadrics

Report

2007

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

Proceedings Article

2007

Definition of the 3D Quadrical Kernel Content

Report

2007

Exact Computation of Arrangements of Rotated Conics

Report

2007

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

Proceedings Article

2007

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

Report

2007

Revision of interface specification of algebraic kernel

Report

2007

Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics

Report

2007

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

Proceedings Article

2007

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

Proceedings Article

2007

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

Report

2006

Definition of file format for benchmark instances for arrangements of Quadrics

Report

2006

Interface specification of algebraic kernel

Report

2006

Prototype implementation of the algebraic kernel

Report

2006

Web-site with benchmark instances for planar curve arrangements

Report

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

ok / ch051116

Proceedings Article

2005

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

ok / ch051116

STATUS: accepted (01.08.05)
Copyright muss noch geklaert werden!
Botz, 22.07.05:
Die im CTA genannte URL der LNCS ist gar nicht mehr aktuell. Wahrscheinlich
handelt es sich auch um eine alte Copyright Form. Der Link zu LNCS lautet:
http://www.springerlink.com/openurl.asp?genre=journal&issn=0302-9743
Die von mir gefundene Copyright Policy von Springer ist hier
http://www.springeronline.com/sgw/cda/pageitems/document/cda_downloaddocumen
t/0,11996,0-0-45-69724-0,00.pdf
zu finden.
Dort steht ausdrücklich:
"An author may self-archive an author-created version of his/her article on
his/her own website and his/her institution’s repository, including his/her final
version"
Ich werde das Thema aber beim Treffen mit den Springer-Leuten nächste Woche
ansprechen.
Bib 01.08.05:
welche Version? - Springer will Link auf Orig.?
Bestimmungen fuer LNCS sind nicht identisch mit Journal CTA
Angegebene URL ist aktuell!!! (Mail an Herrn Botz 01.08.05)

Proceedings Article

2004

An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs

Report

2004

Exact Arrangements of Quadric Intersection Curves
Universität des Saarlandes

Thesis - Masters thesis

2004

EXACUS: Efficient and Exact Algorithms for Curves and Surfaces

Report

2003

Specification of the traits classes for CGAL arrangements of curves

Report

2002

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

erledigt / bc 09.05.03

Proceedings Article

Berenbrink, Petra

2012

A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280

Proceedings Article

2011

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

Proceedings Article

2011

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

Proceedings Article

2011

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

Proceedings Article

Berghammer, Rudolf

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

Proceedings Article

Berg, Marc de

1995

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

Proceedings Article

Berman, Piotr

2003

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

Proceedings Article

Berthomé, P.

1995

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

Proceedings Article

Bertino, Elisa

2012

Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450

Proceedings Article

Beyer, Hans-Georg (ed.)

2009

GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.

Proceedings

2007

GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation

Proceedings

Bhardwaj, Onkar

2013

Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60

Proceedings Article

Bhaskar, Umang

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

Proceedings Article

Biedl, Therese

1998

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

Proceedings Article

Bifet, Albert

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

ok

nach dieser email habe ich auf der entsprechenden Seite zwar keine "absoluten" Seitenzahlen gefunden, aber Seite 1-10 angenommen. / ch060612

"Ingmar Weber" <iweber@mpi-inf.mpg.de> wrote on 31.05.2006 15:37:46:

> Hallo Christine,
>
> ich dachte, das Problem mit dem folgenden Veröffentlichugnseintrag wäre
> gelöst. Leider war dann noch einmal Petra (Mayer) da, und wieß mich darauf
> hin, dass das offenbar noch Probleme macht.
>
> Titel: An Analysis of Factors Used in Search Engine Ranking
> ----
> Authoren: Bifet, Albert and Castillo, Carlos and Chirita, Paul-Elexandru
> and Weber, Ingmar
> ----
> BibTeX cite key*: weberetal05airweb
> ----
> Kategorie: @InProceedings Internet-Beitrag in Tagungsband, Workshop
> ----
>
> Wie erwähnt, gibt es da keine Seitenzahlen (!).
>
> Die kompletten Infos stehen auf:
> http://airweb.cse.lehigh.edu/2005/#proceedings
>
> Das Paper selbst auf:
> http://airweb.cse.lehigh.edu/2005/bifet.pdf
>
> Als Publisher könnte man höchsten den PC Chair angeben:
> Program Chair
> Brian D. Davison, Lehigh University
>
> Das restliche PC findest du hier:
> Program Committee Members
> http://airweb.cse.lehigh.edu/2005/#pc
>
> Mehr Infos habe ich leider auch nicht. Fehlende Felder kann ich daher
> nicht ergänzen. Das kannst du gerne nach Ermessen ausfüllen.
>
> Schöne Grüße,
> Ingmar

Electronic Proceedings Article

Bilardi, Gianfranco

1994

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

Journal Article

Birattari, Mauro (ed.)

2009

GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.

Proceedings

Birk, Rüdiger

1997

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

Thesis - Masters thesis

Biswas, Somenath

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

Proceedings Article

Blanchebarbe, Markus

1996

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

Thesis - Masters thesis

Blelloch, Guy E.

2010

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

Proceedings Article

Blum, Christian (ed.)

2009

GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.

Proceedings

Blum, Norbert

1991

Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5 \sqrtm/\log n)$
In: Information Processing Letters [37], 237-240

Journal Article

1980

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

Journal Article

1979

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

http://dblp.uni-trier.de/db/conf/tcs/tcs1979.html#BlumM79 / ch 060807

Proceedings Article

1978

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

ok - mit Papierfassung abgeglichen / ch 060921

aus BiVis übertragen, Seitenzahl aus SULB / ch060919

Report

Böcker, Sebastian

2009

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

Proceedings Article

Bockmayr, Alexander

2002

SCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87

Proceedings Article

Bodirsky, Manuel

2007

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

exportkorr0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf

Frage:
Was für eine Art Publikation ist es?
Journal Article oder Research Report?
Volume?
Publisher?

Journal Article

2007

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

Journal Article

Bodlaender, Hans L.

2006

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

Proceedings Article

2005

Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450

ch - ok/ch050425

Proceedings Article

1998

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

gefunden in mpi-bib

Journal Article

1998

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

aus bib; not-mpi pruefen!

Journal Article

1995

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

Proceedings Article

Bogdan, Paul

2013

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

Juli 2012 in arXiv:1207.2125 [math.PR] / 6.2.13 sm

Electronic Proceedings Article

Boghossian, Nicolas Pascal

1999

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

Proceedings Article

Böhme, Sascha

2013

A Framework for the Verification of Certifying Computations

noch nicht erschienen 4.2.13 sm

Unpublished/Draft

2011

Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82

Proceedings Article

Bongard, Joshua (ed.)

2007

GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation

Proceedings

Bonifaci, Vincenzo

2013

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

Proceedings Article

2013

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

Proceedings Article

2012

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

Journal Article

2012

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

Journal Article

2012

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

Journal Article

2012

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

Journal Article

2012

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

Proceedings Article

2012

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

Sanjoy Baruah, Vincenzo Bonifaci, Gianlorenzo D’Angelo, Haohan Li,
Alberto Marchetti-Spaccamela, Nicole Megow, and Leen Stougie

Journal Article

2011

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

Journal Article

2011

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

Proceedings Article

2011

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

Journal Article

2010

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

Proceedings Article

2010

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

Proceedings Article

2010

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

Journal Article

2010

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

Proceedings Article

2010

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

Journal Article

Borgwardt, Karsten M.

2011

Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561

Journal Article

2009

Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495

Electronic Proceedings Article

Borodin, Allan

2010

Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558

Journal Article

Boros, Endre

2012

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

Unpublished/Draft

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

Journal Article

2011

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

Unpublished/Draft

2011

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

Proceedings Article

2011

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

Journal Article

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

Proceedings Article

2010

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

Journal Article

2010

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

Journal Article

2010

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

Unpublished/Draft

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

Proceedings Article

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

Journal Article

2008

Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034

Journal Article

2008

Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190

Journal Article

2008

Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263

Journal Article

2008

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

Proceedings Article

2008

On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172

Journal Article

2008

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233

Journal Article

2007

A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155

Journal Article

2007

Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376

30th International Colloquium on Automata, Languages and Programming (ICALP 2003)

Journal Article

2007

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149

29th International Symposium on Mathematical Foundations of Computer Science, Special Issue: MFCS 2004

Journal Article

2007

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

Proceedings Article

2007

Generating Vertices of Polyhedra and Related Monotone Generation Problems

Unpublished/Draft

2007

On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150

6th Latin American Symposium on Theoretical Informatics (LATIN 2004)

Journal Article

2006

Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455

ok / ch 070207
- aus Webseite aufergänzt

Proceedings Article

2006

Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765

ok / ch 070207
- aus Webseite aufergänzt

Proceedings Article

2005

A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776

ok / ch060420

Proceedings Article

2005

Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567

ok / ch060420

Proceedings Article

2005

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165

ok / ch060420

Proceedings Article

2005

On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984

ok / ch060420

Journal Article

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

ch - ok/ch050421

Proceedings Article

2004

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

ch - ok/ch050421

Proceedings Article

2004

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

ch - ok/ch050421

Proceedings Article

2004

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

ch - ok/ch050421

Proceedings Article

2004

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

ch - ok/ch050421

Proceedings Article

2003

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

Proceedings Article

2003

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

Proceedings Article

2003

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

Journal Article

2003

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

Proceedings Article

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

Journal Article

2002

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

Journal Article

2002

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

Electronic Journal Article

2002

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

Proceedings Article

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

Proceedings Article

2000

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

q/ch050421 - allerdings für 2000 ...

Journal Article

Borys, Konrad

2008

Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190

Journal Article

2008

Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263

Journal Article

2008

On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233

Journal Article

2007

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

Proceedings Article

2006

Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455

ok / ch 070207
- aus Webseite aufergänzt

Proceedings Article

2006

Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765

ok / ch 070207
- aus Webseite aufergänzt

Proceedings Article

2005

Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165

ok / ch060420

Proceedings Article

Bosman, Peter A.N. (ed.)

2009

GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.

Proceedings

Böttcher, Süntje

2010

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

Proceedings Article

Boullay, Johannes

1996

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

Thesis - Masters thesis

Bousquet-Mélou, Mireille

2002

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

Journal Article

Bouziane, Driss

2002

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

q/ch050422

Journal Article

Bradford, Phillip Gnassi

2002

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

erledigt / bc 09.05.03

Journal Article

1998

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

Journal Article

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

Gefunden durch Abgleich mit Bibliothek. UB

Proceedings Article

1997

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

Journal Article

1997

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

Journal Article

1996

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

Proceedings Article

1996

Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127

Journal Article

1995

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

Proceedings Article

1995

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

Proceedings Article

Bradonjić, Milan

2010

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

Proceedings Article

Bramer, Andreas

2003

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

Thesis - Masters thesis

Brandenburg, Franz J.

1999

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

Proceedings Article

1997

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

Juenger --> Jünger (UB)

Journal Article

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

gefunden durch Bibliotheksabgleich

Proceedings Article

Branke, Juergen (ed.)

2007

GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation

Proceedings

Braun, Sebastian

2000

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

Thesis - Masters thesis

Bredereck, Robert

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

Proceedings Article

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

Proceedings Article

Bremer, Dirk

1995

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

Thesis - Masters thesis

Brengel, Klaus

2001

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

akzeptiert lt. Uli 04.04.01
aber noch nicht erschienen

Unpublished/Draft

2000

Externe Prioritätswarteschlangen
Universität des Saarlandes

Thesis - Masters thesis

1999

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

Proceedings Article

Breslauer, Dany

1997

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

gefunden durch Bibliotheksabgleich

Journal Article

1996

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

pruefen, wer not-MPI ist; in MPI-Bib gefunden

Journal Article

Brightwell, Graham

2012

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

Journal Article

Bringmann, Karl

2014

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

Proceedings Article

2013

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

Journal Article

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

Proceedings Article

2013

Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89

Proceedings Article

2013

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

Proceedings Article

2013

Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24

Proceedings Article

2013

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

Proceedings Article

2013

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

Proceedings Article

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

Proceedings Article

2013

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

Journal Article

2013

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

Proceedings Article

2012

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

Journal Article

2012

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

Journal Article

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

Proceedings Article

2012

Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68

Proceedings Article

2012

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

Proceedings Article

2012

Remarks on Category-Based Routing in Social Networks

Unpublished/Draft

2011

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

Proceedings Article

2011

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

Proceedings Article

2011

The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92

Proceedings Article

2010

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

Journal Article

2010

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

Journal Article

2010

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

Proceedings Article

2010

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

Proceedings Article

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

Proceedings Article

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

Proceedings Article

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

Proceedings Article

Brockenauer, Ralf

1998

AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457

Proceedings Article

1997

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

Thesis - Masters thesis

Brockhoff, Dimo

2009

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

Journal Article

2008

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

Proceedings Article

2007

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

Proceedings Article

Brodal, Gerth Stølting

2006

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

ok / ch 070312
- abgeglichen mit der Webseite

Proceedings Article

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

Proceedings Article

1999

I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20

Proceedings Article

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

Journal Article

1998

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

Proceedings Article

1998

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

Proceedings Article

1998

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

Proceedings Article

1997

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

Proceedings Article

1997

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

Proceedings Article

1996

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

Reihenfolge der Autoren war vertauscht! UB

Proceedings Article

1996

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

Proceedings Article

1996

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

Proceedings Article

1996

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

Journal Article

Brönnimann, Hervé

2006

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

ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden

Journal Article

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

auch hier nicht gefunden:
http://www.ec-securehost.com/cgi-bin/SIAM/search.cgi

s.: Dementiev, Kärkkäinen, Mehnert, Sanders / ch060619

ok / ch060621 - per Fernleihbestllung Restdaten erhalten.

Proceedings Article

2001

CGAL Reference and User Manuals

Unknown Form: eBookForm

2001

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

Journal Article

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

oder Inproc.?

Part of a Book

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

Proceedings Article

Brown, Christopher

2006

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

ok / ch 070207
- aus Webseite aufergänzt

2005 -> 2006, da nicht gefunden / ch060612

Journal Article

Buchberger, Bruno (ed.)

1994

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

Achtung! es handelt sich eigentlich um ein Journal Issue!!! ansonsten aber ok / ch 061002 ;
- gefunden via http://liinwww.ira.uka.de/bibliography/index.html
- aufergänzt via ACM-Webseite http://portal.acm.org/citation.cfm?id=184101&dl=GUIDE&dl=GUIDE&CFID=15151515&CFTOKEN=6184618#

Book

Buchheim, Christoph

1998

AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457

Proceedings Article

Buchheit, Thomas

1999

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

Thesis - Masters thesis

Bundy, David

2006

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

ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden
- kein abstract vorhanden

Journal Article

Burkhardt, Stefan

2003

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

Journal Article

2003

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

Proceedings Article

2002

Filter Algorithms for Approximate String Matching
Universität des Saarlandes

Thesis - PhD thesis

2002

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

q / ch 8.9.03
erledigt / bc 09.05.03

Proceedings Article

2001

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

Proceedings Article

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

Proceedings Article

Burnikel, Christoph

2009

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

Journal Article

2004

The LEDA class real number -- extended version

Report

2001

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

Proceedings Article

2001

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

Journal Article

2001

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

Journal Article

2000

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

Journal Article

1999

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

Proceedings Article

1998

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

Proceedings Article

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

Proceedings Article

1997

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709

Proceedings Article

1996

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

Thesis - PhD thesis

1995

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

http://doi.acm.org/10.1145/220279.220330

Proceedings Article

1994

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

booktitle = "",
editor = "Jan van Leeuwen",
address = "Utrecht, The Netherlands",
month = "26--28~" # sep,
year = "1994",
ISBN = "ISBN ",
pages = ""

Proceedings Article

1994

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

Proceedings Article

Busch, Philip Johannes

2011

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

Thesis - Bachelor thesis

Butman, Ayelet

2010

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

Journal Article

Butz, Bernd

1997

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

Thesis - Masters thesis

Cai, Jin-Yi

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

Konferenz laut ACM 2011?? sm

Proceedings Article

Calinescu, Gruia

2006

Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299

Journal Article

2003

Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894

Proceedings Article

1998

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

Soll 1997 werden - jedoch noch nicht veröffentlicht.

Journal Article

1996

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

Proceedings Article

Cameron, Peter

2008

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

Electronic Journal Article

Canright, Geoffrey

2007

Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ?

Proceedings Article

2005

Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24

Proceedings Article

Canzar, Stefan

2012

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

Proceedings Article

2011

Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361

Journal Article

2011

On Tree-Constrained Matchings and Generalizations

Unpublished/Draft

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

Proceedings Article

2010

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

Proceedings Article

2008

A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154

Journal Article

2008

Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221

Proceedings Article

2008

Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277

Proceedings Article

2008

LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498

Proceedings Article

2007

A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278

Proceedings Article

2006

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

Proceedings Article

Canzar,Stefan

2011

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

Proceedings Article

Capoyleas, Vasilis

1997

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

Journal Article

Caprara, Alberto

2006

Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425

Journal Article

2002

Proceedings Article

Caragiannis, Ioannis

2007

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

12th International Colloquium on Structural Information and Communication Complexity

Journal Article

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

Proceedings Article

Carlsson, Mats

2003

ok
Datum korrigiert und Referenz URL auf das Paper gestellt. UB.

Electronic Proceedings Article

2002

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

Report

Caroli, Manuel

2007

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

Thesis - Masters thesis

2007

Exact Computation of Arrangements of Rotated Conics

Report

2007

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

Proceedings Article

2006

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

Thesis - Bachelor thesis

Case, John

2013

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

Electronic Journal Article

2012

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

Journal Article

2012

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

Journal Article

2011

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

Electronic Proceedings Article

2010

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

Proceedings Article

2010

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

Proceedings Article

Castillo, Carlos

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

Electronic Proceedings Article

Cattaneo, G

1998

A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136

Proceedings Article

Cechlárová, Katarína

2005

Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175

ok - ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/conf/isaac/AbrahamCMM05
- gemäß Papierfassung korrigiert

Proceedings Article

2004

Pareto-optimality in house allocation problems
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 3-15

to appear/ch050501
restl. daten eingetragen - ok / ch051103

Proceedings Article

Celikik, Marjan

2011

Efficient Index-Based Snippet Generation

Unpublished/Draft

2009

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

Proceedings Article

2009

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

Proceedings Article

Chalermsook, Parinya

2013

Multi-Attribute Profit-Maximizing Pricing

Multi-Attribute Profit-Maximizing Pricing (Extended Abstract)
By: Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun In: CoRR, 2012 Vol. abs/1202.2840(), p. /6.2.13 sm

Unpublished/Draft

Chandran, L. Sunil

2004

On the Hadwiger's Conjecture for Graph Products

12.8.05: aus RR-DB kopiert / ch

Report

Chandran, Sunil

2003

Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393

Proceedings Article

Chandrasekar, K. Raja

2011

Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30

Proceedings Article

Chang, Kevin

2008

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

Proceedings Article

2007

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

Proceedings Article

Chang, Kevin L.

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

ok / ch 070310
katastrophaler Eintrag, selbst der Titel stimmt nicht, die Abkürzung des eigenen 2. Vornamens weggelassen, falsche Seitenzahlen etc.
- ProcTitel abgeglichen mit den anderen, bereits vorhandenen und korrigierten Einträgen
- Artikel abgeglichen mit der hier vorhandenen Papierfassung.

Proceedings Article

Chan, Ho-Leung

2012

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

Journal Article

2012

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

Journal Article

2012

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

Journal Article

2011

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

Journal Article

2011

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

Journal Article

2010

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

Proceedings Article

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

Electronic Proceedings Article

2009

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

Electronic Proceedings Article

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

Proceedings Article

2009

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

Proceedings Article

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

Proceedings Article

Chan, Hubert

2010

A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267

Proceedings Article

Chan, Sze-Hang

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

Electronic Proceedings Article

2010

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

Proceedings Article

Chan, T-H. Hubert

2009

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

T.-H. HUBERT CHAN†, KEDAR DHAMDHERE‡, ANUPAM GUPTA§ , JON KLEINBERG¶,
AND ALEKSANDRS SLIVKINS

Journal Article

Chan, T.-H. Hubert

2011

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

Journal Article

2009

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

Journal Article

Charikar, Moses

1998

On delayed information and action in on-line algorithms
In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS-98), 71-80

Proceedings Article

Charlat, Sylvain

2012

Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32

Journal Article

2010

Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213

Proceedings Article

Chaudhuri, Shiva

2000

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

Journal Article

2000

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

Not MPII Authors: Christos herausgelöscht.

Journal Article

1998

All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110

Journal Article

1998

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

Proceedings Article

1998

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

Noch nicht erschienen. Für 1997 eingetragen

Journal Article

1998

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

gefunden in mpi-bib

Journal Article

1997

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

gefunden durch Bibliotheksabgleich

Journal Article

1997

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

Journal Article

1996

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

Proceedings Article

1996

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

Journal Article

1996

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

Journal Article

1996

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

Proceedings Article

1996

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

Journal Article

1995

All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376

Proceedings Article

1995

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

Proceedings Article

1995

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

Proceedings Article

1995

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

Proceedings Article

1995

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

Proceedings Article

1994

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

Journal Article

Cheng, Siu-Wing

2003

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

Proceedings Article

Chen, Danny Z.

1996

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

Proceedings Article

1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528

Proceedings Article

Chen, Xujin

2013

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

Journal Article

2012

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

Proceedings Article

Cheong, Otfried

2000

Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325

Proceedings Article

Cheriyan, Joseph

1999

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

ok - ch 061004

Eintrag nun korrekt; pdf ausgetauscht / ch 060831

Aufergänzt aus dem Internet / ch 060828

Mehlhorn_a_1999_b.pdf=Verlagsversion
140.pdf=Autorenversion

Journal Article

1996

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

Journal Article

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

Journal Article

1995

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

Journal Article

1990

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

ProcDaten mit BooksDB abgeglichen / ch 060912

Proceedings Article

1990

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

Report

Chew, L. Paul

1996

Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528

Proceedings Article

Chian, Yi-Feng

1995

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

Proceedings Article

Ching, Yu-Tai

1990

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

Journal Article

Chin, Francis Y. L.

2011

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

Journal Article

Chirita, Paul-Elexandru

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

Electronic Proceedings Article

Chitea, Alexandru

2007

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

Proceedings Article

Chlebus, Bogdan S.

2005

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

ok / ch051105

Proceedings Article

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

ok/ch050501

Proceedings Article

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

Proceedings Article

2004

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

q/ch050411

Journal Article

1997

Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141

Journal Article

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

Autoren waren falsch angegeben. Jop hatte nur sich selbst genannt. Danke :-(

Proceedings Article

1996

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

Proceedings Article

Chong, Ka Wong

1998

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

Gefunden durch Bibliotheksabgleich

Journal Article

1998

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

Proceedings Article

1996

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

Proceedings Article

1996

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

Proceedings Article

Choppela, Venkatesh

1995

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

Proceedings Article

Chopra, Sumit

2003

An experimental study of k-splittable scheduling for DNS-based traffic allocation
In: Euro-Par 2003 parallel processing : 9th International Euro-Par Conference ; proceedings, 230-235

Proceedings Article

Christodoulou, George

2013

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

Journal Article

2011

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

Falsch: Halldórsson, Mangús M. - richtig: Halldórsson, Magnús M.

Proceedings Article

2010

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

Proceedings Article

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

Proceedings Article

2010

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

Journal Article

2010

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

Proceedings Article

2010

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

Proceedings Article

2009

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

Online First 2008 ersch. - MPG Jahrbuch 2009

Journal Article

2009

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

Journal Article

2009

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

Journal Article

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

Proceedings Article

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

Proceedings Article

2008

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

Part of a Book

2007

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

Proceedings Article

2007

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

Proceedings Article

2007

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

Proceedings Article

Christodoulou, Giorgos

2010

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

Proceedings Article

Christof, Thomas

1997

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

Journal Article

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

Proceedings Article

Chrobak, Marek

2007

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

Journal Article

2006

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

ok / ch 070207
- via DBLP neu gefunden
- aus Webseite aufergänzt
- kein abstract vorhanden

Journal Article

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

Proceedings Article

Chung, Christine

2010

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

Proceedings Article

2009

Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195

Proceedings Article

Chwa, Kyung-Yong

2001

Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
In: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP-01), 456-468

Proceedings Article

2000

Approximation of Curvature-constrained Shortest Paths through a Sequence of Points
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 314-325

Proceedings Article

2000

Characterization of Rooms Searchable by Two Guards
In: Proceedings of the 11th Conference on Algorithms and Computation, 515-526

Proceedings Article

2000

Optimal Embedding of Multiple Directed Hamiltonian Rings into d-dimensional Meshes
In: Journal of Parallel and Distributed Computing [60], 775-783

Eigenname in Titel!! gross schreiben

Journal Article

2000

Searching a polygonal room with one door by a 1-searcher
In: International Journal of Computational Geometry and Applications [10], 201-220

Journal Article

Cilleruelo, Javier

2009

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

Journal Article

Clanget, Ulrich

1999

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

Thesis - Masters thesis

Clarkson, Kenneth L.

1993

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

Journal Article

1992

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

Proceedings Article

Clark, James S.

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

Imprint / Impressum | Data Protection / Datenschutzhinweis