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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 1. by Individual - 3. A..Z Index-Comment

Login to this database


 

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

#YearTitleAG Editor CommentType
6
Hide details for Hachenberger, PeterHachenberger, Peter
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
2006Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes
Thesis - PhD thesis
2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
ok / ch051031Proceedings Article
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
okProceedings Article
1999Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Hagedoorn, MichielHagedoorn, Michiel
2003Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454
okProceedings Article
2000A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370
Proceedings Article
2
Hide details for Hagen, MatthiasHagen, Matthias
2010Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
37
Hide details for Hagerup, TorbenHagerup, Torben
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
erledigt / bc 09.05.03Proceedings Article
2000Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315
Journal Article
2000Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28
Journal Article
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
Proceedings Article
1998More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
Gefunden durch den Abgleich mit der BibliothekJournal Article
1998Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746
gefunden in mpi-bibJournal Article
1998Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90
Gefunden durch Bibliotheksabgleich. UBProceedings Article
1998Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398
gefunden in mpi-bibProceedings Article
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
1997Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197
Journal Article
1997Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302
Proceedings Article
1997Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66
Journal Article
1997Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51
Journal Article
1996Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33
Proceedings Article
1996An 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
1996More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140
Proceedings Article
1995A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128
Journal Article
1995A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
Journal Article
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
1995Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649
Journal Article
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Journal Article
1995Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110
Journal Article
1995More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Proceedings Article
1995Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279
Proceedings Article
1995Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
1995Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380
Proceedings Article
1995Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436
Proceedings Article
1995The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64
Journal Article
1993Attachment IconMaintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264
Proceedings Article
1992A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141
Proceedings Article
1991Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61
Proceedings Article
1990Can 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 060912Proceedings Article
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?Report
1987Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835
Journal Article
1986Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208
Proceedings Article
1985Deterministic simulation of idealized parallel computers on more realistic onesok - Seitenzahl aus Papierfassung aufergänzt / ch 060920

übertragen aus der Books-DB / ch 060803
Report
1
Hide details for Hagerup,TorbenHagerup,Torben
1987Attachment IconDeterministic 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
1
Hide details for Hajiaghayi, MohammadTaghiHajiaghayi, MohammadTaghi
2010The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
2
Hide details for Hales, DavidHales, David
2007Towards 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
2005Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24
@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
2
Hide details for Hall, AlexHall, Alex
2003An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82
okProceedings Article
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
okProceedings Article
13
Hide details for Halperin, DanHalperin, Dan
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article
2011Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article
2011Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
2010Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
Journal Article
2010Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- no abstract
- pdf

s. auch Bivis etc. / ch 070214
Part of a Book
2007Sweeping and Maintaining Two-Dimensional Arrangements on QuadricsReport
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Proceedings Article
2007Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Proceedings Article
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2003Specification of the traits classes for CGAL arrangements of curvesReport
2001CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Haltner, EleonoreHaltner, Eleonore
2000Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233
verifizieren!Proceedings Article
1
Hide details for Haltner, ElleonoreHaltner, Elleonore
1998Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549
Proceedings Article
1
Hide details for Hamel,AngeleHamel,Angele
2008Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873
Proceedings Article
1
Hide details for Hammad, AbdelrahmanHammad, Abdelrahman
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
1
Hide details for Hammerschmidt, FrankHammerschmidt, Frank
1999Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Hanniel, IddoHanniel, Iddo
2001CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Hansen, Nikolaus (ed.)Hansen, Nikolaus (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Han, XiaofengHan, Xiaofeng
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
1
Hide details for Han, XinHan, Xin
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
7
Hide details for Happ, EddaHapp, Edda
2012Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Journal Article
2011Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Journal Article
2009Analyses of Evolutionary Algorithms
Universität des Saarlandes
Thesis - PhD thesis
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
2008Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Proceedings Article
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
2007A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Proceedings Article
2
Hide details for Har-Peled, SarielHar-Peled, Sariel
2005Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120
ok / ch051109Journal Article
2001CGAL Reference and User ManualsUnknown Form: eBookForm
9
Hide details for Hariharan, RameshHariharan, Ramesh
2006Attachment IconA Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261
ok / ch 070604
- abgeglichen + pdf eingesetzt

Non-Mpi-ler? (von mir aber auch bereits gemäß Springer-Webseite eingetragen)
ansonsten ok / ch 070207
- aus Webseite aufergänzt

übertragen von Springer-Sites und Books-DB / ch 060814
Proceedings Article
2000An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
erledigt / bc 09.05.03Journal Article
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Gefunden durch Bibliotheksabgleich. UBJournal Article
1996An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332
Proceedings Article
1996Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Proceedings Article
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Journal Article
1995Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16
Proceedings Article
1995String Matching over a General Matching Relation
In: Information and Computation [122], 140-148
Journal Article
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
1
Hide details for Hariharan, R.Hariharan, R.
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
2
Hide details for Harks, TobiasHarks, Tobias
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
2010Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Journal Article
12
Hide details for Harren, RolfHarren, Rolf
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
2012Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
2010Two-dimensional packing problems
Universität des Saarlandes
Thesis - PhD thesis
2009Attachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Journal Article
2009Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189
Proceedings Article
2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Journal Article
2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
2007Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer PackungsproblemeBook
2006Attachment IconApproximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249
Proceedings Article
2006Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund
Thesis - other
1
Hide details for Hartman, TzvikaHartman, Tzvika
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
1
Hide details for Hastad, JohanHastad, Johan
2000Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578
Journal Article
1
Hide details for Hazboun, JackHazboun, Jack
1999Molekül-Docking-Reaktionen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Ha, Phuong H.Ha, Phuong H.
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
20
Hide details for Hebbinghaus, NilsHebbinghaus, Nils
2011Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Journal Article
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
2009Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
Journal Article
2009Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Journal Article
2009On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article
2008Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704
Proceedings Article
2007A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Proceedings Article
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
2007Attachment IconDiscrepancy of Sums of two Arithmetic Progressionsexportkorr0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf

Frage:
Was für eine Art Publikation ist es?
Nils Hebbinghaus: Tech Report
oder Article:
http://adsabs.harvard.edu/cgi-bin/nph-bib_query?bibcode=2007math......3108H&data_type=BIBTEX&db_key=PRE&nocookieset=1
@ARTICLE{2007math......3108H,
author = {{Hebbinghaus}, N.},
title = "{Discrepancy of Sums of two Arithmetic Progressions}",
journal = {ArXiv Mathematics e-prints},
eprint = {math/0703108},
year = 2007,
month = mar,
adsurl = {http://adsabs.harvard.edu/abs/2007math......3108H},
adsnote = {Provided by the Smithsonian/NASA Astrophysics Data System}
}
Report
2007Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
2007Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Proceedings Article
2007Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
Proceedings Article
2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
9th International Conference on Parallel Problem Solving from Nature (PPSK IX)Journal Article
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
ok / ch 070207
- aufergänzt aus
- - http://www.citebase.org/abstract?id=oai%3AarXiv.org%3Amath%2F0604438
- - http://arxiv.org/abs/math/0604438
- publisher'name und address habe ich nicht so gefunden, wie es Mathias Bader (s. history) geschrieben hat; ich lasse es aber so.
Electronic Journal Article
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
ok / ch 070206
- aus Webseite + Bivis aufergänzt
- pdf eingesetzt / download verbidden
Journal Article
2006Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
ok / ch 070205
- aus Webseite + Bivis aufergänzt
- pdf eingesetzt / download verbidden
Proceedings Article
2006Attachment IconThe 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
2005Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
ok / ch060606

ok / ch060420 bis auf Publisher & Address
http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/about
per Fernleihe bestellt am 060602
Proceedings Article
1
Hide details for Hebbinhaus, NilsHebbinhaus, Nils
2010Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
Journal Article
1
Hide details for Heinz, JeffreyHeinz, Jeffrey
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Journal Article
1
Hide details for Helwig, SabineHelwig, Sabine
2009Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
37
Hide details for Hemmer, MichaelHemmer, Michael
2011A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494
Journal Article
2011A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article
2010A Generic Algebraic Kernel for Non-linear Geometric ApplicationsReport
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
2009Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
Proceedings Article
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
2009Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2009Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4Manual
2008Arrangements of quadrics in 3D: continued work on experimental implementationReport
2008CGAL package for modular arithmetic operationsReport
2008CGAL package: Algebraic FoundationsReport
2008Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of QuadricsReport
2008Cross-benchmarks of univariate algebraic kernelsReport
2008Evaluation of different approaches in 3D curved kernel for arrangements of quadricsReport
2008Attachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Thesis - PhD thesis
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
2008Prototype implementation of the algebraic kernelReport
2008Voronoi diagram of ellipses: CGAL-based implementationReport
2007Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2007Benchmarks on a generic univariate algebraic kernelReport
2007Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
2007Definition of the 3D Quadrical Kernel ContentReport
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2007Revision of interface specification of algebraic kernelReport
2007Traits classes for polynomial gcd computation over algebraic extensionsReport
2006Interface specification of algebraic kernelReport
2006Prototype implementation of the algebraic kernelReport
2005An 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 / ch051116Proceedings Article
2005Attachment IconEXACUS: 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
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Effects of a Modular Filter on Geometric ApplicationsReport
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2002Attachment IconA 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.03Proceedings Article
2002Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes
q - bis auf "date of colloquium"Thesis - Masters thesis
2001Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273
Proceedings Article
2001The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322
Proceedings Article
1
Hide details for Henson, Van EmdenHenson, Van Emden
2011Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
2
Hide details for Henzinger, Monika R.Henzinger, Monika R.
2003Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611
Journal Article
1997Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425
Proceedings Article
1
Hide details for Henz, MartinHenz, Martin
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
19
Hide details for Hermelin, DannyHermelin, Danny
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings Article
2012Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56
Proceedings Article
2012Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
2012Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113
Proceedings Article
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
2011Average Case Parameterized ComplexityUnpublished/Draft
2011Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
Proceedings Article
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
2011Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Journal Article
2011Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Journal Article
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
2011Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Journal Article
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
2010Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266
Proceedings Article
2010Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213
Proceedings Article
2010Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
Journal Article
2010Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
Proceedings Article
1
Hide details for Hermlin, DannyHermlin, Danny
2012Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32
Journal Article
1
Hide details for Herrmann, ThomasHerrmann, Thomas
2001CGAL Reference and User ManualsUnknown Form: eBookForm
4
Hide details for Hertel, StefanHertel, Stefan
1985Attachment IconFast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76
Journal Article
1984Attachment IconSpace Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519
ok - aus Journal aufergänzt und pdf eingefügt / ch 060907Journal Article
1984Attachment IconSpace sweep solves intersection of two convex polyhedra elegantlyReport
1983Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218
Proc.Daten aus DBLP übertragen / ch 060806Proceedings Article
1
Hide details for Hertel, S.Hertel, S.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
14
Hide details for Hert, SusanHert, Susan
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2005Attachment IconEXACUS: 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
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
okProceedings Article
2003Specification of the traits classes for CGAL arrangements of curvesReport
2002Attachment IconA 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.03Proceedings Article
2002Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205
q
lt. Springer ersch. der Band erst 2002!!! (Susan oder Anja, Datum unbekannt)
Proceedings Article
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
2001CGAL Reference and User ManualsUnknown Form: eBookForm
2001Attachment IconConnected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38
Proceedings Article
2000The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171
Proceedings Article
1999Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639
Journal Article
3
Hide details for Heydrich, SandyHeydrich, Sandy
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
2012Dividing connected chores fairly
Universität des Saarlandes
Thesis - Bachelor thesis
2
Hide details for Heydthausen, ManfredHeydthausen, Manfred
1976Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108
http://dblp.uni-trier.de/db/conf/gi/gi76.html#HeydthausenM76 / ch 060807Proceedings Article
1976Top down parsing of macro grammars (preliminary report)ok - Abgleich mit Papierfassung / ch 060921
ok - aus BiVis übertragen, aus SULB Seitenzahl ergänzt / ch060919
Report
4
Hide details for He, JunHe, Jun
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
2007Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804
Proceedings Article
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
1
Hide details for Hiller, BenjaminHiller, Benjamin
2010Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Part of a Book
1
Hide details for Hilpert, PeterHilpert, Peter
1996Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes
Thesis - Masters thesis
1
Hide details for Hippler, SteffenHippler, Steffen
2003Attachment IconMulticommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409
okProceedings Article
1
Hide details for Hirsch, ShaiHirsch, Shai
2001CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Hitzelberger, ChristophHitzelberger, Christoph
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
15
Hide details for Hoefer, MartinHoefer, Martin
2013Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Journal Article
2013Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
Proceedings Article
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
2013Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
Proceedings Article
2013Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Journal Article
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
2013On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Journal Article
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
2013Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
Proceedings Article
2013Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Journal Article
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
2011Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
Proceedings Article
2003Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178
Proceedings Article
1
Hide details for Hoepman, Jaap-HenkHoepman, Jaap-Henk
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1
Hide details for Hoffmann, KHoffmann, K
1984Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121
Journal Article
3
Hide details for Hoffmann, KurtHoffmann, Kurt
1986Attachment IconSorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184
Journal Article
1985Sorting Jordan sequences in linear time
In: Computational geometry (SCG-85) : 1st symposium, 196-203
Proc.Daten aus Book-DB übertragen/ ch 060721

allerdings steht -im Gegensatz zur Books-DB- in dblp ein editor:
editor = "Joseph O'Rourke"
Proceedings Article
1984Sorting Jordan sequences in linear timeSeitenzahl fehlt !!! / 060920
übertragen aus der Books-DB / ch 060803
Report
3
Hide details for Hoffmann, MichaelHoffmann, Michael
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
2001CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Hoffmann, SebastianHoffmann, Sebastian
2011Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37
Proceedings Article
1
Hide details for Höhn, WiebkeHöhn, Wiebke
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
1
Hide details for Holmes, John (ed.)Holmes, John (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
3
Hide details for Hong, Jia-WeiHong, Jia-Wei
1983Attachment IconCost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728
ok - abgeglichen mit dem Volume/paper-Form / ch 060912

ok - ch 061109 :
- abgeglichen mit http://portal.acm.org/citation.cfm?doid=2157.322401
- pdf eingesetzt
- abstract + keywords eingesetzt + umformatiert
Journal Article
1982Cost tradeoffs in graph embeddings, with applicationsReport
1981Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55
Proc.Daten aus Books-DB übertragen / ch 060806Proceedings Article
1
Hide details for Hoogeveen, HanHoogeveen, Han
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
okJournal Article
1
Hide details for Hornby, Gergory (ed.)Hornby, Gergory (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Horoba, ChrisitianHoroba, Chrisitian
2009Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86
Proceedings Article
5
Hide details for Horoba, ChristianHoroba, Christian
2011Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Journal Article
2009Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
2009Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578
Proceedings Article
2008Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680
Proceedings Article
2008Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680
Proceedings Article
1
Hide details for Hota, AshishHota, Ashish
2012Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24
Proceedings Article
1
Hide details for Hotz, GünterHotz, Günter
2009Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259
Proceedings Article
1
Hide details for Howard, Daniel (ed.)Howard, Daniel (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Hoy, DarrellHoy, Darrell
2009Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article
1
Hide details for Hsu, D.F.Hsu, D.F.
1998Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132
Journal Article
11
Hide details for Huang, Chien-ChungHuang, Chien-Chung
2013How 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
2012Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Proceedings Article
2012Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Proceedings Article
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Journal Article
2011Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Proceedings Article
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
2011Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Proceedings Article
2010Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
Journal Article
2010Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
Proceedings Article
2009Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
Proceedings Article
2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
8
Hide details for Huber, AnnaHuber, Anna
2013Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
noch nicht erschienen 4.2.13 smJournal Article
2010Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Thesis - PhD thesis
2010Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
Proceedings Article
2009Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530
Proceedings Article
2009Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991
Journal Article
2009Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
Proceedings Article
2009The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530
Proceedings Article
2009Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19
Electronic Journal Article
1
Hide details for Huddleston, ScottHuddleston, Scott
1982A New Data Structure for Representing Sorted Lists
In: Acta Informatica [17], 157-184
http://springerlink.metapress.com/openurl.asp?genre=article&issn=0001-5903&volume=17&issue=2&spage=157Journal Article
1
Hide details for Huddleston, S.Huddleston, S.
1981Attachment IconRobust balancing in B-trees
In: Theoretical computer science : 5th GI-conference, 234-244
Proc.Daten aus Books-DB übertragen / ch 060806Proceedings Article
1
Hide details for Hüffner, FalkHüffner, Falk
2009A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
2
Hide details for Hülse, DominikHülse, Dominik
2009Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Proceedings Article
2007Traits classes for polynomial gcd computation over algebraic extensionsReport
1
Hide details for Humble, MonikaHumble, Monika
1997Die Berechnung maximaler Flüsse in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
2
Hide details for Hundack, ChristophHundack, Christoph
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
1997Extremal Graph Problems for Graphs with a Color-Critical Vertex
In: Combinatorics, Geometry and Probability, 421-433
aus bib; not-mpi pruefen!Part of a Book
3
Hide details for Hutchinson, David A.Hutchinson, David A.
2005Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463
ok / ch060619Journal Article
2001Duality Between Prefetching and Queued Writing with Parallel Disks
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 62-73
Proceedings Article
2001The Power of Duality for Prefetching and Sorting with Parallel Disks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 334-335
Proceedings Article
1
Hide details for Hu, XiaodongHu, Xiaodong
2012Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
1
Hide details for H., Chintan RaoH., Chintan Rao
2010Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Proceedings Article
1
Hide details for Iacono, GiovanniIacono, Giovanni
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
1
Hide details for Iacono, G.Iacono, G.
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
2
Hide details for Igel, ChristianIgel, Christian
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
2011The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92
Proceedings Article
1
Hide details for Immich, StefanImmich, Stefan
2001Berechnung der Momente von quadratischen Komplexen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Imreh, CsanádImreh, Csanád
2002More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
qProceedings Article
2
Hide details for Indyk, PiotrIndyk, Piotr
1997Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197
gefunden durch BibliotheksabgleichProceedings Article
1997External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101
Proceedings Article
1
Hide details for Inenaga, ShunsukeInenaga, Shunsuke
2013Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49
Proceedings Article
1
Hide details for Ingalalli, VijayIngalalli, Vijay
2011Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Thesis - Masters thesis
4
Hide details for Irving, Robert W.Irving, Robert W.
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
ok / ch 070312
- mit Webseite abgeglichen
Journal Article
2005Attachment IconPopular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432
ch - ok/ch-050425Proceedings Article
2004Attachment IconRank-Maximal Matchings
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 68-75
Proceedings Article
1
Hide details for Isopi, MarcIsopi, Marc
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
1
Hide details for Issac, DavisIssac, Davis
2015Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
Proceedings Article
1
Hide details for Italiano, GiuseppeItaliano, Giuseppe
1998A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136
Proceedings Article
2
Hide details for Iuliano, ClaudioIuliano, Claudio
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article
1
Hide details for Jacobs, TobiasJacobs, Tobias
2012On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309
Journal Article
1
Hide details for Jain, SanjayJain, Sanjay
2012Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
Proceedings Article
9
Hide details for Janardan, RaviJanardan, Ravi
1999Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13
in mpi-bib gefunden
not-mpi authors bitte noch eintragen
Journal Article
1997The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456
Journal Article
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340
gleiches paper auch in vol 6(1) erschienen // ch:14.12.04Journal Article
1996Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19
gleiches paper auch in vol 5(6) erschienen // ch:14.12.04Journal Article
1996Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391
Journal Article
1995Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317
Journal Article
1995On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Proceedings Article
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171
Proceedings Article
1995The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171
Proceedings Article
11
Hide details for Jansen, KlausJansen, Klaus
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
2010Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272
Proceedings Article
2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Journal Article
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
2002Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
In: Algorithmica [32], 507-520
erledigt - frisch aus der ZeitschriftJournal Article
2000Linear time approximation schemes for shop scheduling problems
In: Approximation and complexity in numerical optimization, 338-346
Part of a Book
1999A linear time approximation scheme for the job shop scheduling problem
In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), 177-188
Proceedings Article
1999Makespan minimization in job shops: a polynomial time approximation scheme
In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), 394-399
Proceedings Article
1998A New Characterization for Parity Graphs and a Coloring Problem with Costs
In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), 249-260
gefunden in mpi-bibProceedings Article
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
aus bib; not-mpi pruefen!Journal Article
1998The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 287-297
gefunden in mpi-bibProceedings Article
5
Hide details for Jansen, ThomasJansen, Thomas
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
noch nicht erschienen 4.2.13 smJournal Article
2011Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
Journal Article
2010Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
Journal Article
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
2008Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Proceedings Article
1
Hide details for Jansen, Thomas (ed.)Jansen, Thomas (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Jansson, JesperJansson, Jesper
1997On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145
gefunden durch BibliotheksabgleichProceedings Article
1
Hide details for Jawor, WojciechJawor, Wojciech
2006A 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
1
Hide details for Jeli´c, SlobodanJeli´c, Slobodan
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Khaled Elbassioni, Slobodan Jelić, Domagoj MatijevićJournal Article
4
Hide details for Jensen, ClausJensen, Claus
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Proceedings Article
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
2
Hide details for Jerrum, MarkJerrum, Mark
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
ok - ch 061004 ; ProcDaten mit Books-DB abgeglichen.

Prüfen: Editor?

prüfen:
http://dblp.uni-trier.de/db/conf/compgeom/compgeom88.html#GaoJKMR89",
URL = "http://doi.acm.org/10.1145/73393.73433",
Proceedings Article
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proc aus Books-DBProceedings Article
13
Hide details for Jez, ArturJez, Artur
2014A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Proceedings Article
2014Attachment IconApproximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
Proceedings Article
2014Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
Journal Article
2014Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Proceedings Article
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
2014The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Journal Article
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
2013Attachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Proceedings Article
2013Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
Journal Article
2013Attachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Proceedings Article
2013Attachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Proceedings Article
2013Attachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
Proceedings Article
2013Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288
Proceedings Article
2
Hide details for Jez, LukaszJez, Lukasz
2014Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Journal Article
2012Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
1
Hide details for Jiang, TaoJiang, Tao
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
gefunden durch BibliotheksabgleichJournal Article
1
Hide details for Jiang, ZhigenJiang, Zhigen
1997Rotations of periodic strings and short superstrings
In: Journal of Algorithms [24], 340-353
gefunden durch BibliotheksabgleichJournal Article
21
Hide details for Johannsen, DanielJohannsen, Daniel
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Journal Article
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Journal Article
2012Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Journal Article
2011Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Proceedings Article
2011Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37
Proceedings Article
2011Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
Proceedings Article
2010Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
Proceedings Article
2010Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974
Proceedings Article
2010Attachment IconEdge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
Proceedings Article
2010More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Proceedings Article
2010Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
Proceedings Article
2010Attachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
Thesis - PhD thesis
2010Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
Proceedings Article
2009Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Proceedings Article
2008Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Electronic Journal Article
2008Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Proceedings Article
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
2007Attachment IconA 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
2007Attachment IconAdjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
Proceedings Article
2007Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
Proceedings Article
2006Attachment IconSampling Rooted 3-Connected Planar Graphs in Deterministic Polynomial Time
Humboldt-Universität zu Berlin
Thesis - Masters thesis
1
Hide details for Johnson, AaronJohnson, Aaron
2008Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Proceedings Article
19
Hide details for Jünger, MichaelJünger, Michael
2007Attachment IconA 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
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
qProceedings Article
1999Graph Drawing Contest Report
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 400-409
Proceedings Article
1998A Note on Computing a Maximal Planar Subgraph using PQ-Trees
In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems [17], 609-612
Journal Article
1998AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article
1998Level Planarity Testing in Linear Time
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 224-237
Proceedings Article
1998The thickness of a minor-excluded class of graphs
In: Discrete Mathematics [182], 169-176
Journal Article
19972-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
In: Journal of Graph Algorithms and Applications [1], 1-25
Journal Article
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
1997A 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
1997A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 13-24
Proceedings Article
1997Algorithmen zum automatischen Zeichnen von Graphen
In: Informatik Spektrum [20], 199-207
Juenger --> Jünger (UB)Journal Article
1997Pitfalls of using PQ-Trees in Automatic graph Drawing
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 193-204
Juenger eingetragen --> Jünger, UBProceedings Article
1997SPP 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 BibliotheksabgleichProceedings Article
1996Exact and heuristic algorithms for 2-layer straightline crossing minimization
In: Graph Drawing (GD95), -
Proceedings Article
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
1996Maximum planar subgraphs and nice embeddings: Practical layout tools
In: Algorithmica [16], 33-59
Journal Article
1995Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Journal Article
1995The Polyhedral Approach to the Maximum Planar Subgraph Problem:
New Chances for Related Problems
In: Graph Drawing: DIMACS International Workshop (GD94), 119-130
Proceedings Article
4
Hide details for Jung, BerndJung, Bernd
2000Simulating synthetic polymer chains in parallel
In: Future Generation Computer Systems [16], 513-522
Journal Article
1999Simulating synthetic polymer chains in parallel
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 13-22
Proceedings Article
1997Langevin dynamics simulations of macromolecules on parallel computers
In: Macromolecular Theory and Simulation [6], 507-521
Journal Article
1997Parallel MD-simulations of synthetic polymers
In: Parallel processing for scientific computing (PPSC-97) : 8th SIAM conference, CD-ROM
Proceedings Article
6
Hide details for Jung, HermannJung, Hermann
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Journal Article
1994Attachment IconDynamic point location in general subdivisions
In: Journal of Algorithms [3], 342-380
Journal Article
1992Dynamic Point Location in General Subdivisions
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 250-258
Proceedings Article
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
1988Attachment IconParallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
In: Information Processing Letters [27], 227-236
Journal Article
1987Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning treesübertragen aus der SULB / ch 060806Report
2
Hide details for Jung, Hermann (ed.)Jung, Hermann (ed.)
1987Parallel algorithms and architectures (WPAA-87) : international workshopProceedings
1987Parallel algorithms and architectures : International Workshophttp://websok.libris.kb.se/websearch/showrecord;jsessionid=046CC02F4BAA278125C493CE4625A5D2?searchId=22729&nr=1Proceedings
1
Hide details for Jung, KarinJung, Karin
1996Die hierarchische Darstellung konvexer Polyeder und einige Anwendungen
Universität des Saarlandes
Thesis - Masters thesis
6
Hide details for Jurkiewicz, TomaszJurkiewicz, Tomasz
2013The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
noch nicht erschienen 4.2.13 smProceedings Article
2013Attachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
Thesis - PhD thesis
2011Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.Unpublished/Draft
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312
Proceedings Article
2009Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312
Proceedings Article
2009Cycle Bases in Graphs
Universität des Saarlandes
Thesis - Masters thesis
4
Hide details for Juurlink, BenJuurlink, Ben
1998Gossiping on Meshes and Tori
In: IEEE Transactions on Parallel and Distributed Systems [9], 513-525
Journal Article
1996Worm-Hole Gossiping on Meshes and Tori
In: 2nd Euro-Par Conference, 361-369
Proceedings Article
1995Fast Routing on Weak Hypercubes: Making the Valiant-Brebner Algorithm More Practical
In: Conference on High-Performance Computing, 755-760
Proceedings Article
1995?
In: Conference on High-Performance Computing, 125-130
gefunden in bibliotheks-listeProceedings Article
3
Hide details for Kagaris, DimitriosKagaris, Dimitrios
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
q / ch 8.9.03Journal Article
1995On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302
Proceedings Article
1995Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44
Proceedings Article
1
Hide details for Kakargias, AthanasiosKakargias, Athanasios
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2
Hide details for Kaklamanis, ChristosKaklamanis, Christos
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
12th International Colloquium on Structural Information and Communication ComplexityJournal Article
2007Randomized 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
6
Hide details for Kaligosi, KanelaKaligosi, Kanela
2007Attachment IconCycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464
Journal Article
2006Faster 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
2006How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791
ok / ch 070312
- mit Webseite und auch den übrigen bereits eingetragenen ESA-Datensätzen abgeglichen.
Proceedings Article
2005Certifying Algorithms (draft)Opus in der Entstehungsphase (Telefonat mit Arno Eigenwillig, eigentlich im Zusammenhang mit einem anderen paper mit ihm angesprochen) / ch060420Unpublished/Draft
2005Attachment IconTowards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114
ok - ProcDaten aus Books-DB übertragen, abstract + pdf-File übertragen / ch061004Proceedings Article
2003Length bounded network flows
Universität des Saarlandes
ok
ch - ok/ch050426
Thesis - Masters thesis
1
Hide details for Kaller, DamonKaller, Damon
1996Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172
Proceedings Article
4
Hide details for Kamel, IbrahimKamel, Ibrahim
2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Part of a Book
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
ok / ch060420Journal Article
2004Attachment IconScalable Multimedia Disk Scheduling
In: 20th International Conference on Data Engineering, ICDE 2004, 498-509
ch - ok/ch050421Proceedings Article
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Proceedings Article
1
Hide details for Kammenhuber, NilsKammenhuber, Nils
2003An 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
1
Hide details for Kamran Azam, MuhammadKamran Azam, Muhammad
2005Branch-and-Cut Techniques for Generalized Asymmetric Traveling Salesman Problem
Universität des Saarlandes
ok / ch051109Thesis - Masters thesis
1
Hide details for Kane, DanielKane, Daniel
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
1
Hide details for Kang, MihyunKang, Mihyun
2007Attachment IconA 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
1
Hide details for Kang, RossKang, Ross
2010The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29
Electronic Journal Article
1
Hide details for Kaninke, G.Kaninke, G.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
1
Hide details for Kannan, RaviKannan, Ravi
2006Attachment IconThe Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166
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
3
Hide details for Kao, Ming-YangKao, Ming-Yang
2010Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319
Proceedings Article
1995Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391
Proceedings Article
1995Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205
Proceedings Article
5
Hide details for Kapoor, SanjivKapoor, Sanjiv
1997On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460
eintrag durch bib-abgleichJournal Article
1996New techniques for exact and approximate dynamic closest-point problems
In: SIAM Journal on Computing [25], 775-796
Journal Article
1996On minimum 3-cuts and approximating k-cuts using cut trees
In: Integer Programming and Combinatorial Optimization : International Conference (IPCO-5), 132-146
Proceedings Article
1996On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75
Proceedings Article
1995Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265
Journal Article
1
Hide details for Kappel, HolgerKappel, Holger
1998Eine Methode zur Berechnung von Vorzeichen ganzzahliger Determinanten
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Karamanis, NikiforosKaramanis, Nikiforos
2004Computing Locally Coherent Discourses.
In: Proceedings of the conference and workshops, 42nd annual meeting of the Association for Computational Linguistics, 399-406
ok/ch050501Proceedings Article
4
Hide details for Karavelas, MenelaosKaravelas, Menelaos
2008Cross-benchmarks of univariate algebraic kernelsReport
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
2008Prototype implementation of the algebraic kernelReport
2006Interface specification of algebraic kernelReport
2
Hide details for Karavelas, Menelaos I.Karavelas, Menelaos I.
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
2007Revision of interface specification of algebraic kernelReport
10
Hide details for Kärkkäinen, JuhaKärkkäinen, Juha
2014LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742
Proceedings Article
2005Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
to appear ?? / ch051031

isbn und alles, aber kein content zu finden :-( /ch060602

ok / ch060616 - per Fernleihbestllung Restdaten erhalten.
Proceedings Article
2003Better Filtering with Gapped q-Grams
In: Fundamenta Informaticae [56], 51-70
okJournal Article
2003Attachment IconFast Lightweight Suffix Array Construction and Checking
In: Combinatorial Pattern Matching: 14th Annual Symposium, CPM 2003, 55-69
okProceedings Article
2003Full-Text Indexes in External Memory
In: Algorithms for Memory Hierarchies, 149-170
okPart of a Book
2003Simple Linear Work Suffix Array Construction
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 943-955
okProceedings Article
2002Computing the threshold for q-gram filters
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 348-357
qProceedings Article
2002One-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
2001Better Filtering with Gapped q-Grams
In: Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, 73-85
Proceedings Article
1997Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Autorenreihenfolge geändert und Vornamen ausgeschriebenProceedings Article
3
Hide details for Karlin, AnnaKarlin, Anna
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
1991Dynamic Perfect Hashing: Upper and Lower Boundsok - aus dem Internet übertragen; kein pdf gefunden / ch 060918Report
1988Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
prüfen: wirklich ohne editor?Proceedings Article
2
Hide details for Karloff, HowardKarloff, Howard
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Soll 1997 werden - jedoch noch nicht veröffentlicht.Journal Article
1996A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Proceedings Article
3
Hide details for Karpinski, MarekKarpinski, Marek
2002Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83
qProceedings Article
1996Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403
Proceedings Article
1996Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49
Proceedings Article
1
Hide details for Karp, RichardKarp, Richard
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
2
Hide details for Karp, Richard M.Karp, Richard M.
1996Attachment IconA 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
1991Attachment IconA Method for Obtaining Randomized Algorithms with Small Tail Probabilitiesok - 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
17
Hide details for Karrenbauer, AndreasKarrenbauer, Andreas
2011Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Journal Article
2009Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23
Electronic Journal Article
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
2008A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289
Proceedings Article
2008Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221
Proceedings Article
2008Computing 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
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Journal Article
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Journal Article
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
Proceedings Article
2007Attachment IconEngineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes
Thesis - PhD thesis
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
ok / ch 070304
- aus Webseite aufergänzt
Proceedings Article
2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
ok / ch051116Proceedings Article
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
ok / ch051109Proceedings Article
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
2004Packing Boxes with Arbitrary Rotations
Universität des Saarlandes
Thesis - other
1
Hide details for Kasan, BinamanKasan, Binaman
1995Die Beschreibung der Design Features fr die rechnerunterstützte Konstruktion und ihre formale Repräsentation
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kasper, ThomasKasper, Thomas
2002Attachment IconSCIL - Symbolic Constraints in Integer Linear Programming.
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 75-87
qProceedings Article
2
Hide details for Kasprzik, AnnaKasprzik, Anna
2012Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
Journal Article
2010String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
Proceedings Article
8
Hide details for Katajainen, JyrkiKatajainen, Jyrki
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Proceedings Article
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
1998Worst-Case Efficient External-Memory Priority Queues
In: Proceedings of the 6th Scandinavian Workshop on Algorithm Theory (SWAT-98), 107-118
Proceedings Article
1997A meticulous analysis of mergesort programs
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 217-228
Proceedings Article
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
1995Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649
Proceedings Article
3
Hide details for Katoh, NaokiKatoh, Naoki
2006Inserting 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
2006Polyline 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
2004Attachment IconPolyline Fitting of Planar Points Under Min-sum Criteria
In: Algorithms and Computation: 15th International Symposium, ISAAC 2004, 77-88
ok/ch050501Proceedings Article
18
Hide details for Katriel, IritKatriel, Irit
2008Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Journal Article
2007Filtering 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ändertJournal Article
2006Faster 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
2005Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217
okJournal Article
2005GCC-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/ch050501Proceedings Article
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
okJournal Article
2005Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182
ok / ch051102Proceedings Article
2005Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450
ch - ok/ch050425Proceedings Article
2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
ok / ch060420Proceedings Article
2004Constraints and Changes
Universität des Saarlandes
q/ch050412 - noch kein exemplar in der bib - dann noch daten (referees + supervisor) aufergänzen!Thesis - PhD thesis
2004Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 190-199
ok/ch050525 - ISBN fehlt, das ist aber fürs Jahrbuch irrelevant.Proceedings Article
2004Attachment IconFiltering algorithms for the Same and UsedBy constraints12.8.05: aus RR-DB kopiert / chReport
2004Filtering algorithms for the Same constraint
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : First International Conference, CPAIOR 2004, 65-79
Proceedings Article
2004Attachment IconOn Algorithms for Online Topological Ordering and Sorting12.8.05: aus RR-DB kopiert / chReport
2004On the Algebraic Complexity of Set Equality and Inclusion
In: Information Processing Letters [92], 175-178
Journal Article
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
okProceedings Article
2003Elementary Graph Algorithms in External Memory
In: Algorithms for Memory Hierarchies, 62-84
okPart of a Book
2003Fast Bound-Consistency for the Global Cardinality Constraint
In: Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, 437-451
okProceedings Article
26
Hide details for Kaufmann, MichaelKaufmann, Michael
1998Drawing Planar Partitions II: HH-Drawings
In: Proceedings of the 24th Workshop on Graph-Theoretic Concepts in Computer Science (WG-98), 124-136
Proceedings Article
1997BSP-Like External-Memory Computation
In: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC-97), 229-240
Proceedings Article
1997Deterministic Permutation Routing on Meshes
In: Journal of Algorithms [22], 111-141
Journal Article
1997Matrix Transpose on Meshes: Theory and Practice
In: Computers and Artificial Intelligence [16], 107-140
Journal Article
1997Matrix Transpose on Meshes: Theory and Practice
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 315-319
Proceedings Article
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1997Randomized Multipacket Routing and Sorting on Meshes
In: Algorithmica [17], 224-244
Journal Article
1997Routing on Meshes with Buses
In: Algorithmica [18], 417-444
Journal Article
1995Asymptotically Optimal and Practical Routing on the Reconfigurable Mesh
In: Parallel Processing Letters [5], 81-95
Journal Article
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
1995Solving Cheap Graph Problems on Meshes
In: Mathematical Foundations of Computer Science 1995: 20th International Symposium (MFCS95), 412-422
Proceedings Article
1994Attachment IconA linear-time algorithm for the homotopic routing problem in grid graphs
In: SIAM Journal on Computing [23], 227-246
Journal Article
1994Towards Practical Permutation Routing on Meshes
In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, 656-663
Proceedings Article
1992Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408
Journal Article
1992Attachment IconOn local routing of two-terminal nets
In: Journal of Combinatorial Theory / Series B [55], 33-72
Journal Article
1990Approximate 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#AltFKMNSU90Proceedings Article
1989Routing Problems in Grid Graphsok - aus BiVis / Papierfassung / ch 060920Report
1989Routing problems in grid graphsch 061103:
- gefunden via BVB
- aufergänzt via KOBV (nach Suche im KVK)
Report
1988A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphsok - aus BIVis / der Papierfassung / ch 060920Report
1988Attachment IconOn Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402
ok - ch 061004 ; ProcDaten mit Books-DB abgeglichen.

Prüfen: Editor?

prüfen:
http://dblp.uni-trier.de/db/conf/compgeom/compgeom88.html#GaoJKMR89",
URL = "http://doi.acm.org/10.1145/73393.73433",
Proceedings Article
1988On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70
Proc aus Books-DBProceedings Article
1987On Local Routing of Two-Terminal Nets
In: STACS '87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, 40-52
Proceedings Article
1986On Local Routing of Two-Terminal Netsok - aus Papierfassung aufergänzt / ch 060922

aus BiVis übertragen / ch060920
Report
1986Attachment IconRouting through a Generalized Switchbox
In: Journal of Algorithms [7], 510-531
Journal Article
1984Attachment IconLocal routing of two-terminal nets is easyReport
1984Attachment IconRouting through a generalized switchboxok - mit Papierfassung abgeglichen / ch 060921

Achtung!! Fachbereich und MPI / SULB unterschiedliche Report Nummern ! / ch 060919

übertragen aus der Books-DB / ch 060804
Report
1
Hide details for Kaufmann, MorganKaufmann, Morgan
1990Routing problems in grid graphs
In: Paths, Flows, and VLSI-Layout, 165–184
ok - aus Books-DB aufergänzt / ch 060918

Quelle: Kurts Literaturliste und http://www.springerlink.com/content/q047v021m52863h3/ ansonsten nicht via google zu finden, also auch kein pdf-file / ch 060912
Part of a Book
1
Hide details for Kautz, JanKautz, Jan
20027th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototypingq (komplett neu erstellt am 11.9.03 / ch)Proceedings
19
Hide details for Kavitha, TelikepalliKavitha, Telikepalli
2012Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Journal Article
2011Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Journal Article
2011Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Journal Article
2011Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Proceedings Article
2011New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Journal Article
2011Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Proceedings Article
2011Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Journal Article
2010Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
Electronic Journal Article
2009Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Proceedings Article
2008Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Proceedings Article
2008On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Proceedings Article
2008Optimal Popular MatchingsMiscellaneous
2007Attachment IconAlgorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505
Journal Article
2007Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf

ok / ch 070604
Proceedings Article
2007Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Journal Article
2007Attachment IconStrongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18
Journal Article
2005Attachment IconA Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665
ch - ok/ch050425Proceedings Article
2004Attachment IconA Faster Algorithm for Minimum Cycle Basis of Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 846-857
Proceedings Article
2004Attachment IconStrongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 222-233
Proceedings Article
5
Hide details for Kavitha, T.Kavitha, T.
2010Assigning Papers to Referees
In: Algorithmica [58], 119-136
Online First Januar 2010Journal Article
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
2009Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
Proceedings Article
2008Attachment IconAssigning Papers to RefereesUnpublished/Draft
2008Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Journal Article
1
Hide details for Kavvadias, Dimitris J.Kavvadias, Dimitris J.
1996Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154
Journal Article
2
Hide details for Kayal, NeerajKayal, Neeraj
2012Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Journal Article
2011Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Proceedings Article
4
Hide details for Kececioglu, JohnKececioglu, John
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
1997Attachment IconA Branch-And-Cut algorithm for multiple sequence alignment
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 241-250
Proceedings Article
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
1997A 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
1
Hide details for Kedem, KlaraKedem, Klara
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
1
Hide details for Kehden, BrittaKehden, Britta
2008Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98
Proceedings Article
1
Hide details for Keizer, Marten (ed.)Keizer, Marten (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Keller, JörgKeller, Jörg
1995Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148
Journal Article
4
Hide details for Kelsen, PierreKelsen, Pierre
1996Approximate hypergraph coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 41-52
Old: Editors wrong: Mahajan, Sanjeev; Ramesh, Hariharan. UB.Proceedings Article
1996Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52
Proceedings Article
1996Neighborhood graphs and distributed "^" + 1-coloring
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 223-233
Proceedings Article
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
1
Hide details for Kennedy, John (ed.)Kennedy, John (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
26
Hide details for Kerber, MichaelKerber, Michael
2012A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Journal Article
2012Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
Journal Article
2011A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186
Proceedings Article
2011A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
This issue features 14 papers selected from “The Japan Conference on Computational
Geometry and Graphs (JCCGG2009),” held at Kanazawa Culture Hall, Kanazawa,
Japan, November 11–13, 2009.
Journal Article
2011Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Electronic Journal Article
2011Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196
Proceedings Article
2011Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
NOTE = {An extended version has been submitted to Journal of Symbolic Computation}Proceedings Article
2010A Generic Algebraic Kernel for Non-linear Geometric ApplicationsReport
2010An 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
2010Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91
Journal Article
2010Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
Electronic Proceedings Article
2009Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166
Proceedings Article
2009Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Journal Article
2009Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Thesis - PhD thesis
2009Attachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
Proceedings Article
2008Attachment IconAn implementation of the 2D Algebraic KernelReport
2008Attachment IconArrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
Proceedings Article
2008Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
Proceedings Article
2008Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Proceedings Article
2008Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Proceedings Article
2008Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Proceedings Article
2008Attachment IconOn filter methods in CGAL's 2D curved kernelReport
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Proceedings Article
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationReport
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Proceedings Article
2006Attachment IconAnalysis of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Kerber, W.Kerber, W.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
1
Hide details for Kern, WalterKern, Walter
2012Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
Proceedings Article
1
Hide details for Kerzmann, AndreasKerzmann, Andreas
2000Zwangsbasierte Dynamiksimulationen im R2 unter Verwendung von Kreiskanten
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Kesselheim, ThomasKesselheim, Thomas
2013Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Proceedings Article
2013Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
Proceedings Article
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
11
Hide details for Kesselman, AlexanderKesselman, Alexander
2007Attachment IconImproved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164
3rd International Conference on Ad-Hoc, Mobile and Wireless NetworksJournal Article
2006A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453
ok / ch 070316
- neu gefunden via ira
- aus webseiten aufergänzt
Journal Article
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Journal Article
2005A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223
ok / ch051105Proceedings Article
2005Attachment IconEnergy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26
okJournal Article
2005Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124
ok / ch051114Proceedings Article
2005Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844
ch - ok/ch050421Proceedings Article
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
ok/ch050411Journal Article
2004Harmonic Buffer Management for Shared-Memory Switches
In: Theoretical Computer Science [324], 161-182
ok/ch050411Journal Article
2004Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69
Proceedings Article
2004Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102
Proceedings Article
1
Hide details for Kessler, HaraldKessler, Harald
2002Robust Computation of Visibility Maps
Universität des Saarlandes
qThesis - Masters thesis
2
Hide details for Keßler, Christoph W.Keßler, Christoph W.
1997Language and library support for practical PRAM programming
In: Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP-97), 216-221
Proceedings Article
1996A Library of basic PRAM Algorithms and its Implementation in FORK
In: 8th Annual ACM Symposium on Parallel Algorithms and Architechtures (SPAA'96), 193-195
Proceedings Article
1
Hide details for Kettner, BjörnKettner, Björn
1998Eine Implementation von k-Server-Algorithmen
Universität des Saarlandes
Thesis - Masters thesis
40
Hide details for Kettner, LutzKettner, Lutz
2008Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
in Press, online bereits ersch. 05.02.08/bcJournal Article
2007An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36
Journal Article
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- no abstract
- pdf

s. auch Bivis etc. / ch 070214
Part of a Book
2007Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99
Journal Article
2007Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common PointReport
2007Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3Manual
2007Attachment IconSnap Rounding of Bézier CurvesReport
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
ok - export0707 / ch
- Abgleich mit Webseiten
- Abgleich mit DBLP
- Not MPII Author / Editor
- urls
- abstract
- pdf
Proceedings Article
2006Attachment IconCounting 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
2006Definition of file format for benchmark instances for arrangements of QuadricsReport
2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
ok / ch 070207
- aus Webseite aufergänzt
Journal Article
2006Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43
Proceedings Article
2006Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60
ch 061004: pdf nicht möglich herunterzuladen, login wird verlangt

ok - ch 060922: http://dblp.uni-trier.de/rec/bibtex/conf/iccsa/KettnerMPSY06
Proc.Daten aus Books-DB
Proceedings Article
2006Web-site with benchmark instances for planar curve arrangementsReport
2005Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
ok / ch051114
paper eingefügt / ch061109
Proceedings Article
2005An 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 / ch051116Proceedings Article
2005Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174
ok / ch051031Proceedings Article
2005Counting 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
2005Attachment IconEXACUS: 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
2005Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10
ok / ch060420Electronic Proceedings Article
2005STXXL: Standard Template Library for XXL Data SetsReport
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
ok / ch060420Proceedings Article
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Classroom Examples of Robustness Problems in Geometric ComputationsReport
2004Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: ESA 2004: 12th Annual European Symposium on Algorithms, 702-713
ch - ok/ch050422Proceedings Article
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
2004Effects of a Modular Filter on Geometric ApplicationsReport
2004Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2004Two Computational Geometry Libraries: LEDA and CGAL
In: Handbook of Discrete and Computational Geometry, 1435-1463
Part of a Book
2003Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and ImplementationReport
2003Attachment IconBoolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666
okProceedings Article
2003Specification of the traits classes for CGAL arrangements of curvesReport
2003The Safari Interface for Visualizing Time-dependent Volume Data Using Iso-surfaces and Contour Spectra
In: Computational Geometry - Theory and Applications [25], 97-116
okJournal Article
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
okJournal Article
2001An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90
Proceedings Article
2001CGAL Reference and User ManualsUnknown Form: eBookForm
2000Applications of the Generic Programming Paradigm in the Design of CGAL
In: Generic programming - International Seminar on Generic Programming Dagstuhl Castle, Germany, April 27 - May 1, 1998, selected papers, 206-216
oder Inproc.?Part of a Book
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
1996The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
1
Hide details for Kettner, Lutz (ed.)Kettner, Lutz (ed.)
200521st Annual Symposium on Computational Geometry (SCG'05)ok / ch060420Proceedings
33
Hide details for Khachiyan, LeonidKhachiyan, Leonid
2008Generating 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
2008Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190
Journal Article
2008Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263
Journal Article
2008On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Journal Article
2008On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233
Journal Article
2007A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155
Journal Article
2007Dual-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
2007Enumerating 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 2004Journal Article
2007On 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
2006Enumerating 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
2006Generating 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
2005A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776
ok / ch060420Proceedings Article
2005Generating 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 / ch060420Proceedings Article
2005Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165
ok / ch060420Proceedings Article
2005On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984
ok / ch060420Journal Article
2004Attachment IconAn Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128
ch - ok/ch050421Proceedings Article
2004Attachment IconEnumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162
ch - ok/ch050421Proceedings Article
2004Attachment IconGenerating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498
ch - ok/ch050421Proceedings Article
2004Attachment IconGenerating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309
ch - ok/ch050421Proceedings Article
2003Attachment IconAlgorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494
Proceedings Article
2003Attachment IconAn Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567
Proceedings Article
2003Attachment IconAn Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27
Journal Article
2003Attachment IconAn Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555
Proceedings Article
2003Attachment IconExtending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14
Journal Article
2002Attachment IconDual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20
Journal Article
2002Attachment IconGenerating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33
Electronic Journal Article
2002Attachment IconMatroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154
Proceedings Article
2001Attachment IconOn Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103
Proceedings Article
2000Attachment IconAn 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
2000Integer optimization on convex semialgebraic sets
In: Discrete & Computational Geometry [23], 207-224
Journal Article
1997Computing Integral Points in Convex Semi-algebraic Sets
In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), 162-171
Proceedings Article
1996On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628
Journal Article
1
Hide details for Khandekar, RohitKhandekar, Rohit
2010The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231
Proceedings Article
1
Hide details for Khanna, SanjeevKhanna, Sanjeev
1999Page replacement for general caching problems
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 31-40
Proceedings Article
2
Hide details for Khosla, MeghaKhosla, Megha
2013Balls into Bins Made Faster
In: Algorithms - ESA 2013,
Proceedings Article
2011The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236
Proceedings Article
2
Hide details for Khuller, SamirKhuller, Samir
2008An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610
Proceedings Article
2007To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545
Proceedings Article
1
Hide details for Kim, Eun JungKim, Eun Jung
2012Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
Proceedings Article
1
Hide details for Kirkpatrick, DavidKirkpatrick, David
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
okJournal Article
1
Hide details for Kirousis, LefterisKirousis, Lefteris
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
1
Hide details for Klär, GerhardKlär, Gerhard
1994Verdrahtungsproblem auf planaren Graphen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Klauk, MathiasKlauk, Mathias
2004Ein Algorithmus zur Konstruktion des Voronoidiagramms von Kreisbögen
Universität des Saarlandes
q/ch050426 - nachtragen: referees, supervisorThesis - Masters thesis
13
Hide details for Klau, Gunnar W.Klau, Gunnar W.
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
2011On Tree-Constrained Matchings and GeneralizationsUnpublished/Draft
2011On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
2003Automatic Layout and Labelling of State Diagrams
In: Mathematics: Key Technology for the Future : Joint Projects Between Universities and Industry, 584-608
okPart of a Book
2002A Combinatorial Approach to Orthogonal Placement Problems
Universität des Saarlandes
qThesis - PhD thesis
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
Proceedings Article
2001Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
Part of a Book
2000Optimal Labelling of Point Features in the Slider Model
In: Computing and Combinatorics, Proceedings of the 6th Annual International Conference (COCOON-00), 340-350
Proceedings Article
1999Combining Graph Labeling and Compaction
In: Proceedings of the 7th International Symposium on Graph Drawing (GD-99), 27-37
Proceedings Article
1999Optimal Compaction of Orthogonal Grid Drawings
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 304-319
Proceedings Article
1998AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457
Proceedings Article
1998Attachment IconVisuelle Zeitenwende: Bilder - Technik - Reflexionen. Quasi-orthogonales ZeichnenMiscellaneous
1997Attachment IconQuasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Kleiman, ElenaKleiman, Elena
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Journal Article
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
2009Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
Proceedings Article
1
Hide details for Kleinberg, JonKleinberg, Jon
2009Metric 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
19
Hide details for Klein, ChristianKlein, Christian
2012Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Journal Article
2011Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Journal Article
2009On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603
Journal Article
2008Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Proceedings Article
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
2008Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Proceedings Article
2007A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Proceedings Article
2007Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772
Proceedings Article
2007Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
Proceedings Article
2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Journal Article
2006Attachment IconControlled Perturbation for Delaunay TriangulationsReport
2006Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40
ok / ch 070207
- mit webseite abgeglichen
- in elektronischen Artikel umgewandelt, da laut ZDB keine Druckausgabe
- keine abstract vorhanden
Electronic Journal Article
2006Attachment IconHole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385
ok / ch 070207
- aus Webseite aufergänzt
Proceedings Article
2006Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
ok / ch 070201Proceedings Article
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
ok / ch 070205
- aus Webseite + paperfassung aufergänzt
- pdf eingesetzt / download verbidden
Proceedings Article
2005Attachment IconControlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056
ch - ok/ch050425Proceedings Article
2005Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
Proceedings Article
2004Attachment IconA Fast Root Checking AlgorithmReport
2004Attachment IconControlled Perturbation for Voronoi Diagrams
Universität des Saarlandes
ok/chThesis - Masters thesis
2
Hide details for Klein, KarstenKlein, Karsten
2001An Experimental Comparison of Orthogonal Compaction Algorithms
In: Proceedings of the 8th International Symposium on Graph Drawing (GD-00), 37-51
Proceedings Article
2000Flußbasierte orthogonale Zeichenverfahren für Graphen mit variablen Knotengrößen
Universität des Saarlandes
Thesis - Masters thesis
5
Hide details for Klein, RolfKlein, Rolf
2010Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173
Journal Article
2007Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf

ok / ch 070312
- mit BiVIS + vorliegender Papierfassung abgeglichen
Proceedings Article
2006Attachment IconThe Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272
es waren als Eds eingetragen, sind aber meiner Meinung nach Chairs, nicht Eds:
Amenta, Nina
Cheong, Otfried
vgl übrige SCG'06-Einträge

ok - exportkorr0707 / ch
- Abgleich mit BiVis, SWB
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
Proceedings Article
1993Attachment IconRandomized incremental construction of abstract Voronoi diagrams
In: Computational Geometry: Theory and Applications [3], 157-184
Journal Article
1992Randomized incremental construction of abstract Voronoi diagrams
In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 283-308
series = "Teubner-Texte zur Informatik",Part of a Book
2
Hide details for Klein, R.Klein, R.
1990On the Construction of Abstract Voronoi Diagrams, II
In: Algorithms (ISA-90) : 1st international symposium (SIGAL-90), 138-154
ok / ch060324Proceedings Article
1989Attachment IconOn the construction of abstract Voronoi diagrams, II.Report
1
Hide details for Klimm, MaxKlimm, Max
2013Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Journal Article
1
Hide details for Kloks, TonKloks, Ton
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
aus bib; not-mpi pruefen!Journal Article
2
Hide details for Knauer, ChristianKnauer, Christian
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
1
Hide details for Knight, PeterKnight, Peter
1999A case study in scalability: an ADI method for the two-dimensional time-dependent Dirac equation
In: Parallel Computing [25], 525-534
Journal Article
1
Hide details for Knowles, Joshua D. (ed.)Knowles, Joshua D. (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
7
Hide details for Kobel, AlexanderKobel, Alexander
2013Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Journal Article

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