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
1995On the width and roundness of a set of points in the plane
In: 7th Canadian Conference on Computational Geometry, 193-198
Proceedings Article
1995Sequential and parallel algorithms for the k closest pairs problem
In: International Journal of Computational Geometry & Applications [5], 273-288
Journal Article
1995Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27
Journal Article
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal 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
1994An animation of a fixed-radius all-nearest neighbors algorithm
In: Proceedings of the 10th Symposium on Computational Geometry (SCG94), 387
Proceedings Article
1994Using persistent data structures for adding range restrictions to searching problems
In: RAIRO Theoretical Informatics and Applications [28], 25-49
Journal Article
1993An optimal construction method for generalized convex layers
In: International Journal of Computational Geometry & Applications [3], 245-267
Journal Article
1992Enumerating the k closest pairs optimally
In: 33rd Annual Symposium on Foundations of Computer Science (FOCS92), 380-386
Proceedings Article
1992Maintaining the visibility map of speres while moving the viewpoint on a circle at infinity
In: Algorithms Theory - SWAT'92: Third Scandinavian Workshop on Algorithm Theory, 388-398
Proceedings Article
1991An optimal construction method for generalized convex layers
In: ISA'91 Algorithms: 2nd International Symposium on Algorithms, 349-363
Proceedings Article
1
Hide details for Smid, Michiel H. M.Smid, Michiel H. M.
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Journal Article
1
Hide details for Snelting, Gregor (ed.)Snelting, Gregor (ed.)
2000Informatik 2000 : neue Horizonte im neuen Jahrhundert, 30. Jahrestagung der Gesellschaft für Informatikübertragen aus der Book-DB / 060726Proceedings
4
Hide details for Snoeyink, JackSnoeyink, Jack
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
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
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
2
Hide details for Sohler, ChristianSohler, Christian
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
ok - 9.6.04Journal Article
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
qProceedings Article
3
Hide details for Soh, Kian MinSoh, Kian Min
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
Journal Article
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
10
Hide details for Solis-Oba, RobertoSolis-Oba, Roberto
2001Approximation Algorithms for Bounded Facility Location
In: Journal of Combinatorial Optimization [5], 233-247
Journal Article
2001How Helpers Hasten h-Relations
In: Journal of Algorithms [41], 86-98
Journal Article
2000How Helpers Hasten h-Relations
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 392-402
Proceedings 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
1999Approximation algorithms for bounded facility location
In: Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON-99), 241-250
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
19982-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 441-452
Proceedings Article
1998Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518
gefunden in mpi-bibJournal Article
1998Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125
Proceedings Article
1
Hide details for Son, Jung-BaeSon, Jung-Bae
1999Berechnung konvexer Hüllen in erwarteter Linearzeit
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Soranzo, NicolaSoranzo, Nicola
2012Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
Journal Article
1
Hide details for Soranzo, N.Soranzo, N.
2010Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235
Journal Article
1
Hide details for Speckmann, BettinaSpeckmann, Bettina
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
okJournal Article
8
Hide details for Spencer, JoelSpencer, Joel
2010Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
Journal Article
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
Proceedings Article
2008Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
Proceedings Article
2007Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Journal Article
2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
3rd International Conference on Algorithmic Aspects in Information and Management


in press - 0707 / ch (aber sehr guter ansatz!)
- gefunden von Regina / 070626
- Abgleich mit Webseiten
- Abgleich mit DBLP
- Not MPII Author / Editor
- urls
- abstract
- pdf - ? endgültige fassung ? "Article in Press, Corrected Proof - Note to users"
Journal Article
2006Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
ok / ch 070312
- abgeglichen mit BiVIS, Papierfassung und Webseite
Proceedings Article
2006Deterministic Random Walks on the Integers
In: ??? [?], 1-27
Not-MPI-Authors??? / Journal Title etc., s.a. Doerr, Fouz / ch 070309Miscellaneous
2005Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
ok / ch060602

nicht gefunden:
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/search/advancedResults?query=&author=cooper&title=&fullText=&supplementaryFiles=&dateFromMonth=&dateFromDay=&dateFromYear=&dateToMonth=&dateToDay=&dateToYear=&discipline=&subject=&type=&coverage=
Proceedings Article
3
Hide details for Spinrad, Jeremy P.Spinrad, Jeremy P.
2006Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353
ok - abgeglichen mit web-Eintrag / ch 060911Journal Article
2005Certifying Algorithms (draft)Opus in der Entstehungsphase (Telefonat mit Arno Eigenwillig, eigentlich im Zusammenhang mit einem anderen paper mit ihm angesprochen) / ch060420Unpublished/Draft
2003Attachment IconCertifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 158-167
Proc.Daten mit Books-DB abgeglichen + pdf übertragen / ch 060911Proceedings Article
11
Hide details for Spirakis, Paul G.Spirakis, Paul G.
2005Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248
ok / ch060619Journal Article
2003Attachment IconSpace Efficient Hash Tables with Worst Case Constant Access Time
In: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), 271-282
okProceedings Article
2002Attachment IconMinimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422
qJournal Article
2002Attachment IconOn Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92
qProceedings Article
2002Attachment IconRadiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies
In: Graph-Theoretic Concepts in Computer Science : 28th International Workshop, WG 2002, 223-234
qProceedings Article
2002Attachment IconThe Structure and Complexity of Nash Equilibria for a Selfish Routing Game
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 123-134
mit papier abgeglichen 26.8.03Proceedings Article
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Journal Article
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
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
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Journal Article
1
Hide details for Spirakis, Paul G. (ed.)Spirakis, Paul G. (ed.)
1986VLSI algorithms and architectures : Aegean workshop on computingÜbertragenes abgeglichen mit der Books-DB / ch 060804

http://dblp.uni-trier.de/db/conf/awoc/awoc86.html#FurerM86
Proceedings
12
Hide details for Spöhel, RetoSpöhel, Reto
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Online 3.10.12 smJournal Article
2013Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Electronic Journal Article
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
noch nicht erschienen 4.2.13 smProceedings Article
2012Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Journal Article
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Proceedings Article
2012Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049
Journal Article
2011Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158
Proceedings Article
2011Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Electronic Proceedings Article
2011On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430
Electronic Proceedings Article
2011On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33
Electronic Journal Article
2011On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662
Electronic Proceedings Article
2011PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
Proceedings Article
1
Hide details for Squillero, Giovanni (ed.)Squillero, Giovanni (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Sridharan, KSridharan, K
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Journal Article
1
Hide details for Srinivasan, AravindSrinivasan, Aravind
2000Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096
Journal Article
1
Hide details for Srivastava, SatanandSrivastava, Satanand
1996Entwicklung und Implementierung eines Entscheidungsalgorithmus zur Zuordnung von Probleminstanzen an Hierarchieebenen
Universität des Saarlandes
Thesis - Masters thesis
6
Hide details for Srivastav, AnandSrivastav, Anand
2007On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
Journal Article
2005Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
ok / ch051116Journal Article
2005Attachment IconOn the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26
Proceedings Article
2004Coloring Graphs with Minimal Load
In: Electronic Notes in Discrete Mathematics [17], 129-133
Journal Article
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Journal Article
2001Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
Journal Article
2
Hide details for Stanley, Ken (ed.)Stanley, Ken (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Stanley, Kenneth O. (ed.)Stanley, Kenneth O. (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Starikovskaya, TatianaStarikovskaya, Tatiana
2013Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013),
Proceedings Article
1
Hide details for Starikovskaya, Tatiana A.Starikovskaya, Tatiana A.
2014Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39
Proceedings Article
5
Hide details for Stauffer, AlexandreStauffer, Alexandre
2014Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Juli 2012 in arXiv:1207.2125 [math.PR] / 6.2.13 smElectronic Proceedings Article
2011Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199
Proceedings Article
2011Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
Proceedings Article
2010Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421
Proceedings Article
8
Hide details for Steger, AngelikaSteger, Angelika
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Online 3.10.12 smJournal Article
2012Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Journal Article
2011Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Electronic Proceedings Article
2011On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210
Proceedings Article
2010Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
Journal Article
2010Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964
Proceedings Article
2009Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440
Proceedings Article
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
1
Hide details for Stellmacher, BerndStellmacher, Bernd
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
1
Hide details for Stephan, AnneStephan, Anne
2000Implementierung eines heuristischen und eines exakten Ansatzes zur Berechnung minimaler Steinerbäume in Netzwerken
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Stephan, FrankStephan, Frank
2012Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
Proceedings Article
1
Hide details for Steurer, DanielSteurer, Daniel
2006Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
ok / ch 070205
- aus Webseite / Paperfassung aufergänzt
- pdf eingesetzt / download verbidden
Proceedings Article
3
Hide details for Steurer, DavidSteurer, David
2006An Asymptomic Approximation Scheme for Multigraph Edge Coloring
Universität des Saarlandes
Thesis - Masters thesis
2006Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes
Thesis - Bachelor thesis
2005An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906
ch - ok/ch050419Proceedings Article
3
Hide details for Stiller, SebastianStiller, Sebastian
2013Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Proceedings Article
2012Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Journal Article
2010Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Journal Article
1
Hide details for Stoica, Adrian (ed.)Stoica, Adrian (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Storb, ChristophStorb, Christoph
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
1
Hide details for Storch, TobiasStorch, Tobias
2007Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
Proceedings Article
1
Hide details for Stork, FrederikStork, Frederik
2004Attachment IconScheduling with AND/OR Precedence Constraints
In: SIAM Journal on Computing [33], 393-415
Journal Article
1
Hide details for Stormer, HenrikStormer, Henrik
1998Ein Programm zum visuellen Erlernen von Graphalgorithmen
Universität des Saarlandes
Thesis - Masters thesis
9
Hide details for Stougie, LeenStougie, Leen
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
2012Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152
Sanjoy Baruah, Vincenzo Bonifaci, Gianlorenzo D’Angelo, Haohan Li,
Alberto Marchetti-Spaccamela, Nicole Megow, and Leen Stougie
Journal Article
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
2011Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Journal Article
2011Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
2011Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
Journal Article
2010Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
Proceedings Article
2010Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
2006The general two-server problem
In: Journal of the ACM [53], 437-458
Journal Article
1
Hide details for Straszak, DamianStraszak, Damian
2013Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
Proceedings Article
2
Hide details for Stützle, Thomas (ed.)Stützle, Thomas (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
3
Hide details for Subrahmanyam, K. V.Subrahmanyam, K. V.
2000Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
1998Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
1997Solving some discrepancy problems in NC
In: Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS-97), 22-36
Proceedings Article
7
Hide details for Subramanian, C. R.Subramanian, C. R.
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
okProceedings Article
2000Algorithms for Colouring Random k-colourable Graphs
In: Combinatorics, Probability and Computing [9], 45-77
Journal Article
1999A Generalization of Janson inequalities and its application to finding shortest paths
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 795-804
Proceedings Article
1999Minimum Coloring k-Colorable Graphs in Polynomial Average Time
In: Journal of Algorithms [33], 112-123
Journal Article
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Journal Article
1998Almost optimal (on the average) algorithms for boolean matrix product witnesses, computing the diameter
In: Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-98), 218-231
Proceedings Article
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Journal Article
1
Hide details for Suchanek, FabianSuchanek, Fabian
2007ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
Proceedings Article
1
Hide details for Suchan, KarolSuchan, Karol
2009Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
Proceedings Article
1
Hide details for Suchy, OndrejSuchy, Ondrej
2012Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
Electronic Proceedings Article
1
Hide details for Sudha, NSudha, N
1998Some Properties of Touching Distances for Polygons and Polyhedra
In: Applied Mathematics Letters [11], 1-7
Journal Article
13
Hide details for Sudholt, DirkSudholt, Dirk
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
noch nicht erschienen 4.2.13 smJournal Article
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
noch nicht erschienen 4.2.13 smProceedings Article
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
Proceedings Article
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Journal Article
2011Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218
Proceedings Article
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
2009Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
Journal Article
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Journal Article
2009Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120
Part of a Book
2008Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143
Proceedings Article
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
Proceedings Article
2007Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Proceedings Article
2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Proceedings Article
1
Hide details for Suel, TorstenSuel, Torsten
1995Beyond the Worst-Case Bisection Bound:
Fast Ranking and Counting on Meshes
In: Algorithms - ESA'95: 3rd Annual European Symposium, 75-88
Proceedings Article
2
Hide details for Sundar, R.Sundar, R.
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
1994Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Proceedings Article
1
Hide details for Sundell, HåkanSundell, Håkan
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Online ersch. im August 2008Journal Article
10
Hide details for Sun, HeSun, He
2014Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted
Proceedings Article
2013Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34
Juli 2012 in arXiv:1207.2125 [math.PR] / 6.2.13 smElectronic Proceedings Article
2013Multi-Attribute Profit-Maximizing PricingMulti-Attribute Profit-Maximizing Pricing (Extended Abstract)
By: Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun In: CoRR, 2012 Vol. abs/1202.2840(), p. /6.2.13 sm
Unpublished/Draft
2012Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609
Proceedings Article
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
2012Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350
Proceedings Article
2011Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688
Proceedings Article
2011Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350
Journal Article
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Journal Article
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
1
Hide details for Sutton, Andrew M.Sutton, Andrew M.
2012The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340
Proceedings Article
1
Hide details for Su, YiSu, Yi
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
5
Hide details for Sviridenko, MaximSviridenko, Maxim
2013Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Seitenangaben fehlen noch 4.2.13 smProceedings Article
2004Buffer Overflow Management in QoS Switches
In: SIAM Journal on Computing [33], 563-583
ok/ch050411Journal 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
1
Hide details for Swamy, ChaitanyaSwamy, Chaitanya
2010Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472
Proceedings Article
1
Hide details for Takeda, MasayukiTakeda, Masayuki
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 Takeuchi, FumihikoTakeuchi, Fumihiko
2003Tight Degree Bounds for Pseudo-triangulations of Points
In: Computational Geometry - Theory and Applications [25], 3-12
okJournal Article
2
Hide details for Takkula, TuomoTakkula, Tuomo
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
1
Hide details for Talbi, El Ghazli (ed.)Talbi, El Ghazli (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
3
Hide details for Tamaki, HisaoTamaki, Hisao
2006Attachment IconMatching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14
ok - pdf eingefügt / 061004

ok / ch060416
Journal Article
2004Attachment IconMatching Algorithms Are Fast in Sparse Random Graphs
In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), 81-92
ok/ch050523Proceedings Article
2003Attachment IconA Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
In: Algorithmica [36], 75-88
okJournal Article
1
Hide details for Tamassia, RobertoTamassia, Roberto
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
1
Hide details for Tamir, TamiTamir, Tami
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
2
Hide details for Tang, Ching HooTang, Ching Hoo
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
2008Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Proceedings Article
4
Hide details for Tardos, GáborTardos, Gábor
2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
3rd International Conference on Algorithmic Aspects in Information and Management


in press - 0707 / ch (aber sehr guter ansatz!)
- gefunden von Regina / 070626
- Abgleich mit Webseiten
- Abgleich mit DBLP
- Not MPII Author / Editor
- urls
- abstract
- pdf - ? endgültige fassung ? "Article in Press, Corrected Proof - Note to users"
Journal Article
2006Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
ok / ch 070312
- abgeglichen mit BiVIS, Papierfassung und Webseite
Proceedings Article
2006Deterministic Random Walks on the Integers
In: ??? [?], 1-27
Not-MPI-Authors??? / Journal Title etc., s.a. Doerr, Fouz / ch 070309Miscellaneous
2005Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
ok / ch060602

nicht gefunden:
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/search/advancedResults?query=&author=cooper&title=&fullText=&supplementaryFiles=&dateFromMonth=&dateFromDay=&dateFromYear=&dateToMonth=&dateToDay=&dateToYear=&discipline=&subject=&type=&coverage=
Proceedings Article
10
Hide details for Tarjan, Robert E.Tarjan, Robert E.
1995Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358
Journal Article
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
1990Attachment IconFaster algorithms for the shortest path problem
In: Journal of the ACM [37], 213-223
Journal Article
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
1988Faster Algorithms for the Shortest Path Problemok - aufergänzt aus Papierfassung / ch 060920

übertragen aus der Book -DB / ch 060803
Report
1988Faster Algorithms for the Shortest Path Problemok - 060927:
- gefunden via http://liinwww.ira.uka.de/bibliography/index.html
- http://72.14.221.104/search?q=cache:gXfS6FAu490J:www.mit.edu/~orc/research/reports/tr_1980s.html+193+%22Faster+Algorithms+for+the+Shortest+Path+Problem%22+Massachusetts&hl=de&gl=de&ct=clnk&cd=1
Report
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 Tchervenski, NickolayTchervenski, Nickolay
2006Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299
Journal Article
2003Power Efficient Range Assignment in Ad-hoc Wireless
In: Proceedings of the IEEE Wireless Communications and Networking Conference (WCNC-03), 1889-1894
okProceedings Article
1
Hide details for Técourt, Jean-PierreTécourt, Jean-Pierre
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- no abstract
- pdf nur mit Login


s. auch Bivis etc. / ch 070214
Part of a Book
2
Hide details for Teich, JürgenTeich, Jürgen
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
7
Hide details for Teillaud, MoniqueTeillaud, Monique
2008Prototype implementation of the algebraic kernelReport
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
2007Revision of interface specification of algebraic kernelReport
2006Interface specification of algebraic kernelReport
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
8
Hide details for Telikepalli, KavithaTelikepalli, Kavitha
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
2006Attachment IconRank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610
ok / ch 070312
- mit Webseite abgeglichen
Journal Article
2005Attachment IconNew Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681
ok / ch051114
q/ch050425 - seitenzahl ergänzen!
Proceedings Article
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
2003Efficient Algorithms for Abelian group isomorphism and related problems
In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, 277-288
okProceedings Article
2003Isoperimetric Inequalities and Width Parameters of Graphs
In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, 385-393
okProceedings Article
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
okProceedings Article
1
Hide details for Teramoto, SachioTeramoto, Sachio
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
6
Hide details for Theile, MadeleineTheile, Madeleine
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Journal Article
2011Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Journal Article
2011How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
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
2009Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
2009Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Proceedings Article
3
Hide details for Theobald, MartinTheobald, Martin
2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
ed? publisher?Electronic Proceedings Article
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
ok / ch 070201
- abgeglichen mit http://dblp.uni-trier.de/rec/bibtex/conf/vldb/BastMSTW06
- pdf eingefügt / download verbidden
- abgeglichen mit gleichem Datensatz in der D5
Proceedings Article
5
Hide details for Thiel, ChristianThiel, Christian
1997Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580
Journal Article
1996Effiziente Algorithmen für Probleme der Kollisionserkennung und der geometrischen Optimierung
Universität des Saarlandes
Thesis - PhD thesis
1995Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442
Proceedings Article
1995Efficient Collision Detection for Moving Polyhedra
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), 51-60
Proceedings Article
1993Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Proceedings Article
15
Hide details for Thiel, SvenThiel, Sven
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
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
2004Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions
Universität des Saarlandes
ch/ok050501 - referees + supervisor aufergänzen!Thesis - PhD thesis
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
2004Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101
Journal Article
2003Attachment IconAn Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Journal of Algorithms [48], 194-219
ok - 9.6.04Journal Article
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
2003Sweep Synchronization as a Global Propagation Mechanism
In: Fifth International Workshop on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems, 139-152
ok
Datum korrigiert und Referenz URL auf das Paper gestellt. UB.
Electronic Proceedings Article
2002Cost-Filtering Algorithms for the two Sides of the Sum of Weights of Distinct Values ConstraintReport
2001An Efficient Algorithm for the Configuration Problem of Dominance Graphs
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 815-824
Proceedings Article
2001Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407
Proceedings Article
2000Attachment IconFaster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint
In: Principles and practice of constraint programming - CP 2000 (CP-00) : 6th international conference, CP 2000, 306-319
Proceedings Article
1999Attachment IconPersistente Suchbäume
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Thierens, Dirk (ed.)Thierens, Dirk (ed.)
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
2
Hide details for Thöle, RalfThöle, Ralf
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
7
Hide details for Thomas, HenningThomas, Henning
2013Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145
Online 3.10.12 smJournal Article
2013Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Electronic Journal Article
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
noch nicht erschienen 4.2.13 smProceedings Article
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Proceedings Article
2011Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704
Electronic 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
1
Hide details for Thomas, WolfgangThomas, Wolfgang
1996Komplexitätstheorie und Algorithmik
In: Informatik : Grundlagen - Anwendungen - Perspektiven, 113-116
Proceedings Article
2
Hide details for Thome, StefanThome, Stefan
2000Erweiterung des hierarchischen Zeichenmodells in ArchEd
Universität des Saarlandes
Thesis - Masters thesis
1997ArchE: A Graph Drawing System for Archaeology
In: Proceedings of the 5th Symposium on Graph Drawing (GD-97), 297-302
Proceedings Article
2
Hide details for Thorup, MikkelThorup, Mikkel
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
2000Floats, Integers, and Single Source Shortest Paths
In: Journal of Algorithms [35], 189 -201
Journal Article
1
Hide details for Thyssen, ChristianThyssen, Christian
2011Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Journal Article
2
Hide details for Ting, Hing-FungTing, Hing-Fung
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
Journal Article
2010Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190
Electronic Proceedings Article
1
Hide details for Tiseanu, CatalinTiseanu, Catalin
2013Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268
Proceedings Article
10
Hide details for Tiwary, Hans RajTiwary, Hans Raj
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Journal Article
2012Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
Journal Article
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Journal Article
2011The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76
Journal Article
2009Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Proceedings Article
2008Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x
Journal Article
2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Proceedings Article
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Journal Article
2008On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198
Proceedings Article
2007On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528
Proceedings Article
2
Hide details for Tokuyama, TakeshiTokuyama, Takeshi
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
1
Hide details for Toledo, SivanToledo, Sivan
2008Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219
Proceedings Article
1
Hide details for Tolhuizen, LudoTolhuizen, Ludo
2003Polynomial Time Algorithms For Network Information Flow
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 286-294
okProceedings Article
3
Hide details for Toma, LauraToma, Laura
2004External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, 146-157
Proceedings Article
2003On external-memory planar depth first search
In: Journal of Graph Algorithms and Applications [7], 105-129
okJournal Article
2001On External-Memory Planar Depth First Search
In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), 471-482
Proceedings Article
1
Hide details for Tönnies, Klaus-DietzTönnies, Klaus-Dietz
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
q
erledigt / bc 09.05.03
Journal Article
1
Hide details for To, Isaac K. K.To, Isaac K. K.
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
13
Hide details for Träff, Jesper LarssonTräff, Jesper Larsson
2003A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
In: Algorithms - ESA 2003: 11th Annual European Symposium, 679-690
okProceedings Article
2002The factor algorithm for regular all-to-all communication on clusters of SMP nodes
In: Proceedings of the 8th International Euro-Par Conference, 799-803
q
Volume statt Number - und die auch noch falsch!
Proceedings Article
2000A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124
Journal Article
1998A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21
Journal Article
1998An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154
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 parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693
Proceedings Article
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
1997The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Proceedings Article
1996A Heuristic for Blocking Flow Algorithms
In: European Journal of Operational Research [89], 564-569
Journal 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
1996A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194
Proceedings Article
1995An Experimental Comparison of two Distributed Singel-Source Shortest Path Algorithm
In: Parallel Computing [21], 1505-1532
Journal Article
3
Hide details for Tragoudas, SpyrosTragoudas, Spyros
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 Trajan, Robert E. (ed.)Trajan, Robert E. (ed.)
1991Effiziente Algorithmen - Tagungsberichtok - aus Papierfassung aufergänzt / ch 060920

übertragen aus der Books-DB / ch 060806
Achtung: Proceedings-Report!!!
Proceedings
2
Hide details for Triantafillou, PeterTriantafillou, Peter
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
1
Hide details for Truss, AnkeTruss, Anke
2009A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
1
Hide details for Tsagarakis, M.Tsagarakis, M.
1979On the isomorphism of two algorithms: Hu/Tucker and Garsia/Wachs
In: Colloque de Lille `Les Arbres en Algebre et en Programmation' [??], ??
nur in Kurts Literaturverzeichnis gefunden / ch 060808Journal Article
1
Hide details for Tsakalidis, AthanasiosTsakalidis, Athanasios
1992Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
5
Hide details for Tsakalidis, Athanasios K.Tsakalidis, Athanasios K.
1993Dynamic Interpolation Search
In: Journal of the ACM [40], 621-634
Journal Article
1989Attachment IconData structuresgefunden via BVB / ch 061102Report
1986Attachment IconAn Amortized Analysis of Insertions into AVL-Trees
In: SIAM Journal on Computing [15], 22-33
Journal Article
1985Attachment IconDynamic Interpolation Search
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 424-434
lncs-angaben aus books-DB übertragen / ch 200706Proceedings Article
1985Routing Through a Generalized Switchbox
In: Automata, languages and programming (ICALP-85) : 12th international colloquium, 328-337
lncs-angaben aus books-DB übertragen / ch 200706Proceedings Article
2
Hide details for Tsakalidis, A.Tsakalidis, A.
1990Data Structures
In: Handbook of Theoretical Computer Science, 301-341
wie einzusortieren? (ch 060324)

@InCollection{Mehlhorn$^+$90,
author = "Kurt Mehlhorn and A. Tsakalidis",
title = "Data Structures",
pages = "301--341",
>> booktitle = "Handbook of Theoretical Computer Science",
editor = "Jan van Leeuwen",
>> volume = "A: Algorithms and Complexity",
publisher = "Elsevier/MIT Press",
address = "Amsterdam",
year = "1990",
chapter = "6",
refersto = "See \cite{Leeuwen90}.",
}
Part of a Book
1987A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273
Journal Article
1
Hide details for Tscheuschner, TobiasTscheuschner, Tobias
2010Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
Part of a Book
5
Hide details for Tsigaridas, EliasTsigaridas, Elias
2008Cross-benchmarks of univariate algebraic kernelsReport
2008Prototype implementation of the algebraic kernelReport
2008Voronoi diagram of ellipses: CGAL-based implementationReport
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- no abstract
- pdf nur mit Login


s. auch Bivis etc. / ch 070214
Part of a Book
2006Interface specification of algebraic kernelReport
2
Hide details for Tsigaridas, Elias P.Tsigaridas, Elias P.
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
10
Hide details for Tsigas, PhilippasTsigas, Philippas
2010NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
Journal Article
2009Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187
Online ersch. im August 2008Journal Article
2009Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30
Electronic Journal Article
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Angaben via link.springer-ny.com gefunden. UB.Journal Article
1997Self-Stabilizing Wait-Free Clock Synchronization
In: Parallel Processing Letters [7], 321-328
Journal Article
1997The impact of timing on linearizability in counting networks
In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), 684-688
Proceedings Article
1996Distributed List Coloring: How to Dynamically Allocate Frequencies to Mobile Base Stations
In: 8th Annual IEEE Symposium on Parallel and Distributed Processing (SPDP '96), 18-25
Proceedings Article
1996Simple Atomic Snapshots: A Linear Complexity Solution with Unbounded Time-Stamps
In: Information Processing Letters [58], 47-53
Journal Article
1995Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287
Proceedings Article
1995Wait-Free Consensus in ``In-Phase'' Multiprocessor Systems
In: Seventh IEEE Symposium on Parallel and Distributed Processing, 312-319
Proceedings Article
1
Hide details for Tsigas, PhillipasTsigas, Phillipas
2009NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
Online First 22.01.2009
Springer Choice
Electronic Journal Article
1
Hide details for Tuza, ZsoltTuza, Zsolt
1998Ranking of Graphs
In: SIAM Journal on Discrete Mathematics [11], 168-181
aus bib; not-mpi pruefen!Journal Article
1
Hide details for Tzoumas, GeorgTzoumas, Georg
2008Voronoi diagram of ellipses: CGAL-based implementationReport
1
Hide details for Ueckerdt, T.Ueckerdt, T.
2009Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Journal Article
1
Hide details for Uetz, MarcUetz, Marc
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
1
Hide details for Uhrig, CUhrig, C
1992Attachment Icon$k$ versus $k+1$ Index Registers and Modifiable versus Non-modifiable Programs
In: Information and Computation [101], 123-129
Journal Article
16
Hide details for Uhrig, ChristianUhrig, Christian
1999Attachment IconChecking geometric programs or verification of geometric structures
In: Computational Geometry: Theory and Applications [12], 85-104
Journal Article
1998A computational basis for higher-dimensional computational geometry and applications
In: Computational Geometry: Theory and Applications [10], 289-304
Journal Article
1997A Computational Basis for Higher-dimensional Computational Geometry and Applications
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 254-263
Proceedings Article
1997Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time
In: Algorithmica [17], 183-198
Journal Article
1997The LEDA platform for combinatorial and geometric computing
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 7-16
ch 060828 : http://dblp.uni-trier.de/db/conf/icalp/icalp97.html#MehlhornNU97
http://dblp.uni-trier.de/rec/bibtex/conf/icalp/MehlhornNU97

(uwe (?) : )
gefunden durch Bibliotheksabgleich
Proceedings Article
1996Checking Geometric Programs or Verification of Geometric Structures
In: 12th Annual ACM Symposium on Computational Geometry (SCG 96), 159-165
Proceedings Article
1996The LEDA Platform for Combinatorial and Geometric Computing
In: Beherrschung von Informationssystemen : Tagungsband der Informatik '96 ; GI - 26. Jahrestagung, 43-50
ok (nach bestem Wissen und Gewissen, soweit das bei verschiedenen Angaben möglich ist, ohne ein Papierfassung vorligen zu haben ... ) - ch 060925
Quellen:
- http://dblp.uni-trier.de/rec/bibtex/conf/gi/MehlhornNU96
- http://www.informatik.uni-trier.de/~ley/db/conf/gi/gi96.html
- GBV und SWB
Proceedings Article
1995Attachment IconExact Geometric Computation in LEDA
In: 11th ACM Symposium on Computational Geometry (SCG95), C18-C19
http://doi.acm.org/10.1145/220279.220330Proceedings Article
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
1994Maintaining dynamic sequences under equality-tests in polylogarithmic time
In: Discrete algorithms (SODA-94) : 5th annual ACM-SIAM symposium, 213-222
Proceedings Article
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
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
1992Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
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
1990Attachment IconHidden line elimination for isooriented rectanglesgefunden via BVB / ch 061102Report
1990Attachment IconHidden line elimination for isooriented rectangles
In: Information Processing Letters [35], 137-143
(ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/journals/ipl/ipl35.html#MehlhornNU90Journal Article
1
Hide details for Urrutia, JorgUrrutia, Jorg
1999Editorial
In: Computational Geometry [12], 153-154
Journal Article
1
Hide details for Uthaisombut, PatchrawatUthaisombut, Patchrawat
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
1
Hide details for Uznanski, PrzemyslawUznanski, Przemyslaw
2014Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139
Proceedings Article
6
Hide details for Vahdati Daneshmand, SiavashVahdati Daneshmand, Siavash
2003Improving Linear Programming Approaches for the Steiner Tree Problem
In: Experimental and efficient algorithms : Second International Workshop, WEA 2003, 1-14
okProceedings Article
2003On Steiner trees and minimum spanning trees in hypergraphs
In: Operations Research Letters [31], 12-20
okJournal Article
2002Extending Reduction Techniques for the Steiner Tree Problem
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 795-807
erledigt / bc 09.05.03Proceedings Article
2001A Comparison of Steiner Tree Relaxations
In: Discrete Applied Mathematics [112], 241-261
Journal Article
2001Improved Algorithms for the Steiner Problem in Networks
In: Discrete Applied Mathematics [112], 263-300
Journal Article
2000Primal-Dual Approaches to the Steiner Problem
In: Approximation Algorithms for Combinatorial Optimization, 214-225
Proceedings Article
1
Hide details for Vainshtein, AlekVainshtein, Alek
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
1
Hide details for Valtr, PavelValtr, Pavel
2012Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208
Proceedings Article
1
Hide details for van der Ster, Suzannevan der Ster, Suzanne
2011Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
Proceedings Article
1
Hide details for van Hemert, Jano (ed.)van Hemert, Jano (ed.)
2009GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation.Proceedings
1
Hide details for Van Hentenryck, PascalVan Hentenryck, Pascal
2005Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183
okJournal Article
1
Hide details for van Kreveld, Marcvan Kreveld, Marc
1998Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
Journal Article
3
Hide details for van Leeuwen, Erik Janvan Leeuwen, Erik Jan
2012Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635
Proceedings Article
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2011Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561
Journal Article
1
Hide details for van Leeuwen, Jan (ed.)van Leeuwen, Jan (ed.)
1994Attachment IconIncremental Computation and Dynamic Algorithms 02.05.-06.05.94ok - mit Papierfassung abgeglichen / ch 061002

ch 060927: pdf - file s. Email: Angelika Mueller <angelika.mueller@dagstuhl.de> wrote on 02.08.2006 11:55:22

übertragen aus der Books-DB / ch 060801
Report
1
Hide details for van Loon, Joycevan Loon, Joyce
2006How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136
Proceedings Article
43
Hide details for van Stee, Robvan Stee, Rob
2015Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
Journal Article
2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Journal Article
2013Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
noch nicht erschienen 4.2.13 smProceedings Article
2013Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Proceedings Article
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Journal Article
2013Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Journal Article
2013SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Journal Article
2012Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
Journal Article
2012Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Journal Article
2012Attachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
Journal Article
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
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
2012Attachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
Journal Article
2012Attachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
Journal Article
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
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Journal Article
2011Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
Proceedings Article
2011Attachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Proceedings Article
2011Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Journal Article
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Journal Article
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
2010A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193
Proceedings Article
2010Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Journal Article
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Journal Article
2010Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
Proceedings 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
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
2008Attachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
Thesis - Habilitation thesis
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
2008Attachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
Part of a Book
2008Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
Proceedings Article
2008Attachment IconPaging
In: Encyclopedia of Algorithms, 1-99
Part of a Book
2008Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
Journal Article
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Journal Article
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
10
Hide details for van Zuylen, Ankevan Zuylen, Anke
2012A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
2012Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121
Journal Article
2012On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
2012Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
Proceedings Article
2012Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
2011An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
Journal Article
2011Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
Journal Article
2011Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36
Proceedings Article
2011Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Journal Article
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
2
Hide details for Varadarajan, KasturiVaradarajan, Kasturi
2011Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21
Journal Article
2003On Shortest Paths in Line Arrangements
In: 15th Canadian Conference in Computational Geometry (CCCG-03), 170-173
okProceedings Article
2
Hide details for Varma, GirishVarma, Girish
2012Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
Journal Article
2012Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240
Proceedings Article
2
Hide details for Vazirani, Vijay V.Vazirani, Vijay V.
1996Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251
Journal Article
1995A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25
Journal Article
1
Hide details for Veeramachaneni, KalyanVeeramachaneni, Kalyan
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
3
Hide details for Veltkamp, RemcoVeltkamp, Remco
2001CGAL Reference and User ManualsUnknown Form: eBookForm
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
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
1
Hide details for Vengroff, Darren ErikVengroff, Darren Erik
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
1
Hide details for Veni Madhavan, C. E.Veni Madhavan, C. E.
1998Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158
Journal Article
1
Hide details for Verbeek, RutgerVerbeek, Rutger
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
kein Zugriff auf das pdf-file / ch 060912Journal Article
3
Hide details for Verschae, JoseVerschae, Jose
2013Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756
Proceedings Article
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
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
2
Hide details for Vialette, StephaneVialette, Stephane
2012Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474
Proceedings 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
5
Hide details for Vidali, AngelinaVidali, Angelina
2010A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157
Proceedings Article
2009A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Online First 2008 ersch. - MPG Jahrbuch 2009Journal Article
2009The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Proceedings Article
2008A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
Proceedings Article
2007A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
Proceedings Article
1
Hide details for Vijaykumar, P.I.Vijaykumar, P.I.
1996Velocity planning for a robot moving along the shortest straight line path among moving obstacles
In: Canadian Conference on Computational Geometry (CCCG '96), 149-154
Proceedings Article
3
Hide details for Vilenchik, DanVilenchik, Dan
2011Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
Journal Article
2010Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Electronic Journal Article
2009Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
Proceedings Article
2
Hide details for Villanger, YngveVillanger, Yngve
2011Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
Proceedings Article
2010Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
Proceedings Article
5
Hide details for Vingron, MartinVingron, Martin
2000Attachment IconA polyhedral approach to sequence alignment problems
In: Discrete Applied Mathematics [104], 143-186
Journal Article
1999q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83
Proceedings Article
1998A Polyhedral Approach to RNA Sequence Structure Alignment
In: Journal of Computational Biology [5], 517-530
Journal Article
1998A polyhedral approach to RNA sequence structure alignment
In: Proceedings of the 2nd Annual International Conference on Computational Molecular Biology (RECOMB-98), 153-162
Proceedings Article
1997Computational Molecular Biology
In: Annotated Bibliographies in Combinatorial Optimization, 445-471
Part of a Book
2
Hide details for Vishkin, UziVishkin, Uzi
1984Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
In: Acta Informatica [21], 339-374
ok - mit Verlags-Webseite abgeglichen / ch060921Journal Article
1983Granularity of parallel memoriesok - mit Papierfassung abgeglichen / ch 060921
(Titel ist wirklich komplett klein geschrieben)

Number gemäß BiVis angepasst, Seitenzahl aus der SULB aufergänzt / ch 060919

übertragen aus der Books-DB / ch 060806
Report
1
Hide details for Vishwanathan, S .V. N.Vishwanathan, S .V. N.
2009Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
Electronic Proceedings Article
1
Hide details for Vitanyi, PaulVitanyi, Paul
1998Randomized Naming Using Wait-Free Shared Variables
In: Distributed Computing [11], 113-124
Angaben via link.springer-ny.com gefunden. UB.Journal Article
8
Hide details for Vitter, Jeffrey ScottVitter, Jeffrey Scott
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
1999I/O-Efficient Dynamic Point Location in Monotone Subdivisions
In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 11-20
Proceedings Article
1995An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213
Proceedings Article
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
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
25
Hide details for Vöcking, BertholdVöcking, Berthold
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
2013Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Proceedings Article
2007Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Proceedings Article
2006Attachment IconAn Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136
ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden
Journal Article
2006Attachment IconComputing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706
ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden
Journal Article
2006Attachment IconTypical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881
ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden
Journal Article
2004Computing Equilibria for Congestion Games with (Im)perfect Information
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 739-748
Proceedings Article
2004Probabilistic Analysis of Knapsack Core Algorithms
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 461-470
Proceedings Article
2004Random knapsack in expected polynomial time
In: Journal of Computer and System Sciences [69], 306-329
Journal Article
2004Typical Properties of Winners and Losers in Discrete Optimization
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 343-352
ok/ch050523Proceedings Article
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
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
okJournal Article
2003Random Knapsack in Expected Polynomial Time
In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC-03), 232-241
okProceedings Article
2003Attachment IconRandomized Pursuit-Evasion in Graphs
In: Combinatorics, Probability and Computing [12], 225-244
ok - 9.6.04Journal Article
2003Scheduling and Traffic Allocation for Tasks with Bounded Splittability
In: Mathematical foundations of computer science 2003 : 28th International Symposium, MFCS 2003, 500-510
okProceedings Article
2003Tail bounds and expectations for random arc allocation and applications
In: Combinatorics, Probability and Computing [12], 225-244
okJournal Article
2002Random Arc Allocation and Applications to Disks, Drums and DRAMs
In: Algorithm theory, SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, 121-130
qProceedings Article
2002Randomized Pursuit-Evasion in Graphs
In: Automata, Languages and Programming : 29th International Colloquium, ICALP 2002, 901-912
qProceedings Article
2002Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
qProceedings Article
2002Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420
q
"series 1018" herausgenommen, da ich weder eine quelle sehe noch einen sinn (ch / 28.8.03)
Proceedings Article
2001A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
2001Almost Optimal Permutation Routing on Hypercubes
In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-01), 530-539
Proceedings Article
2001Symmetric vs. Asymmetric Multiple-Choice Algorithms
In: Proceedings of the 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), 1-10
Proceedings Article
2000Improved Routing and Sorting on Multibutterflies
In: Algorithmica [28], 438-464
Journal Article
2000Randomized Rumor Spreading
In: 41th Annual Symposium on Foundations of Computer Science (FOCS-00), 565-574
Proceedings Article
1
Hide details for Voigt, MarcoVoigt, Marco
2013Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Proceedings Article
1
Hide details for Vollmar, R.Vollmar, R.
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
qJournal Article
1
Hide details for von Braunmühl, Burchardvon Braunmühl, Burchard
1983The Recognition of Deterministic CFL's in Small Time and Space
In: Information and Control [56], 34-51
kein Zugriff auf das pdf-file / ch 060912Journal Article
1
Hide details for von Stengel, Bernhardvon Stengel, Bernhard
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
1
Hide details for von Zülow, Max Henningvon Zülow, Max Henning
1994Das k-Closest-Pair-Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Voss, ThomasVoss, Thomas
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 Voß, ThomasVoß, Thomas
2013Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Journal Article
1
Hide details for Vredeveld, TjarkVredeveld, Tjark
2003Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
In: 44th Annual Symposium on Foundations of Computer Science (FOCS-03), 462-471
okProceedings Article
1
Hide details for Vuppuluri, GayathriVuppuluri, Gayathri
2001A Data Tracking Scheme for General Networks
In: Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-01), 247-254
Proceedings Article
3
Hide details for Wagener, HubertWagener, Hubert
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
prüfen: http://dblp.uni-trier.de/db/journals/dcg/dcg3.html#AltMWW88Journal Article
1987Attachment IconCongruence, similarity and symmetries of geometric objectsReport
1987Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
SCG = Inv. 431
institution = "FU Berlin/U Saarlandes/TU Berlin/TU Graz",
Autoren korrigiert. UB
Proceedings Article
1
Hide details for Wagner, DorotheaWagner, Dorothea
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
2
Hide details for Wagner, FrankWagner, Frank
2000Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
1998Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
2
Hide details for Wagner, LisaWagner, Lisa
2013Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262
Proceedings Article
2013Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Proceedings Article
4
Hide details for Wagner, MarkusWagner, Markus
2011Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203
Proceedings Article
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
2011Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
Proceedings Article
2011Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218
Proceedings Article
25
Hide details for Wahlström, MagnusWahlström, Magnus
2013Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13),
Electronic Proceedings Article
2013Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
noch nicht erschienen 4.2.13 smPart of a Book
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
2012Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
2012Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103
Proceedings Article
2012Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593
Proceedings Article
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
2012Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459
Proceedings Article
2012Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434
Electronic Proceedings Article
2011Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
Proceedings Article
2011New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
Journal Article
2011Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226
Proceedings Article
2010Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
Journal Article
2010Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500
Proceedings Article
2010Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
Proceedings Article
2010Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201
Proceedings Article
2009A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49
Proceedings Article
2009BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
Proceedings Article
2009Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
Proceedings Article
2009New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
Proceedings Article
2009Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
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
2009Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
Proceedings Article
2008A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
Proceedings Article
2
Hide details for Wahl, JürgenWahl, Jürgen
2007A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100
Proceedings Article
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
2
Hide details for Wahl, MichaelaWahl, Michaela
2000Ein neuer Algorithmus für Online-Scheduling
Universität des Saarlandes
Thesis - Masters thesis
2000Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Proceedings Article
1
Hide details for Waldmann, UweWaldmann, Uwe
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
ch 061031 :
Achtung: mir lag das Jahrbuch noch nicht vor!
Quelle: http://bvba2.bib-bvb.de/V/P5AXT9U4MAAXL1PAPL261APFCPLI3XULQNYGXNBUSVJ1UDG2II-19380?func=full&set_number=039321&set_entry=000002&format=999
Part of a Book
2
Hide details for Wang, PengmingWang, Pengming
2013From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Electronic Journal Article
2012Certification of Curve Arrangements
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Wang, YusuWang, Yusu
2006Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251
ok / ch 070207
- aus Webseite aufergänzt
Proceedings Article
1
Hide details for Wanka, RolfWanka, Rolf
2009Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151
Proceedings Article
3
Hide details for Warken, ThomasWarken, Thomas
2004Collision detection for Curved Rigid Objects in the Context of Dynamics Simulations
Universität des Saarlandes
ch - ok/ch050419Thesis - PhD thesis
2002Efficient Collision Detection for Curved Solid Objects
In: Proceedings of the Seventh ACM Symposium on Solid Modeling and Applications, 321-328
qProceedings Article
2001Rolling Rigid Objects
In: Proceedings of the 9th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG-01), 57-62
Proceedings Article
1
Hide details for Watson, Richard (ed.)Watson, Richard (ed.)
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Weber, AndreasWeber, Andreas
2006Attachment IconAlgorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173
ok / ch 070207
- aus Webseite aufergänzt

2005 -> 2006, da nicht gefunden / ch060612
Journal Article
3
Hide details for Weber, DennisWeber, Dennis
2006Solving large Sparse Linear Systems exactly
Universität des Saarlandes
Thesis - Masters thesis
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
okProceedings Article
12
Hide details for Weber, IngmarWeber, Ingmar
2007Attachment IconEfficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes
Thesis - PhD thesis
2007Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Proceedings Article
2007ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678
Proceedings Article
2007Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
korrekter Buchtitel???

ok - exportkorr0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract (war schon)
- pdf nicht im Web gefunden
Proceedings Article
2007Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
woher kommt der Editor? falls das aber stimmt, dass Gerhard der Ed ist, bitte Bescheid sagen - dann muss ich für ein Proceedings Volume anlegen.
Ich vermute allerdings, dass er nicht Ed, sondern Program Chair war.

Publisher?
Publisher's address?

Ansonsten:
exportkorr0707 / ch
- Abgleich mit Web - soweit möglich
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
Electronic Proceedings Article
2006Attachment IconOutput-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162
ok / ch 070205
- als LNCS gefunden und aufergänzt
- pdf eingefügt / download verbidden
Proceedings Article
2006Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225
ok / ch 070207
- aus Webseite aufergänzt
Proceedings Article
2006Attachment IconType Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371
ok / ch 070205
- aus dblp aufergänzt
- pdf eingesetzt / download verbidden
Proceedings Article
2006When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35
Proceedings Article
2005An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10
ok


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

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

> Hallo Christine,
>
> ich dachte, das Problem mit dem folgenden Veröffentlichugnseintrag wäre
> gelöst. Leider war dann noch einmal Petra (Mayer) da, und wieß mich darauf
> hin, dass das offenbar noch Probleme macht.
>
> Titel: An Analysis of Factors Used in Search Engine Ranking
> ----
> Authoren: Bifet, Albert and Castillo, Carlos and Chirita, Paul-Elexandru
> and Weber, Ingmar
> ----
> BibTeX cite key*: weberetal05airweb
> ----
> Kategorie: @InProceedings Internet-Beitrag in Tagungsband, Workshop
> ----
>
> Wie erwähnt, gibt es da keine Seitenzahlen (!).
>
> Die kompletten Infos stehen auf:
> http://airweb.cse.lehigh.edu/2005/#proceedings
>
> Das Paper selbst auf:
> http://airweb.cse.lehigh.edu/2005/bifet.pdf
>
> Als Publisher könnte man höchsten den PC Chair angeben:
> Program Chair
> Brian D. Davison, Lehigh University
>
> Das restliche PC findest du hier:
> Program Committee Members
> http://airweb.cse.lehigh.edu/2005/#pc
>
> Mehr Infos habe ich leider auch nicht. Fehlende Felder kann ich daher
> nicht ergänzen. Das kannst du gerne nach Ermessen ausfüllen.
>
> Schöne Grüße,
> Ingmar
Electronic Proceedings Article
2005Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76
ok / ch051109Proceedings Article
2005Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248
ok / ch051109Proceedings Article
1
Hide details for Wechner, RalphWechner, Ralph
1995A combined BIT and TIMESTAMP algorithm for the list update problem
In: Information Processing Letters [56], 135-139
Journal Article
2
Hide details for Wedelin, DagWedelin, Dag
1999High performance integer optimization for crew scheduling
In: Proceedings of the 7th International Conference on High-Performance Computing and Networking Europe (HPCN Europe-99), 3-12
Proceedings Article
1998Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113
Proceedings Article
2
Hide details for Wegener, IngoWegener, Ingo
2010Editorial
In: Algorithmica [57], 119-120
Journal Article
2007Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40
Journal Article
2
Hide details for Wegener, Ingo (ed.)Wegener, Ingo (ed.)
2008GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary ComputationProceedings
2007GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary ComputationProceedings
1
Hide details for Weickert, JoachimWeickert, Joachim
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
5
Hide details for Weikum, GerhardWeikum, Gerhard
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
2006IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5
ed? publisher?Electronic Proceedings Article
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query ProcessingReport
2006Attachment IconIO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486
ok / ch 070201
- abgeglichen mit http://dblp.uni-trier.de/rec/bibtex/conf/vldb/BastMSTW06
- pdf eingefügt / download verbidden
- abgeglichen mit gleichem Datensatz in der D5
Proceedings Article
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 Weimann, OrenWeimann, Oren
2014Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537
Proceedings Article
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
1
Hide details for Weinand, CarolineWeinand, Caroline
2005Fill-in Reduction while Solving large, sparse Linear Systems with Graph Theoretical Methods
Universität des Saarlandes
ok / ch051109Thesis - Masters thesis
8
Hide details for Wein, RonWein, Ron
2010Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66
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
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
4
Hide details for Weiskircher, ReneWeiskircher, Rene
2002New Applications of SPQR-Trees in Graph Drawing
Universität des Saarlandes
qThesis - PhD thesis
1999Optimizing Over All Combinatorial Embeddings of a Planar Graph
In: Proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization (IPCO-99), 361-376
Proceedings Article
1998Attachment IconTwo-Layer Planarization in Graph Drawing
In: Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC-98), 69-78
Proceedings Article
1997Attachment Icon2-Schicht-Planarisierung bipartiter Graphen
Universität des Saarlandes
Thesis - Masters thesis
9
Hide details for Welzl, EmoWelzl, Emo
2002Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53
erledigt / bc 09.05.03Proceedings Article
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
1993Attachment IconTail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection
In: Computational Geometry: Theory and Applications [3], 235-246
Journal Article
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1992Tail Estimates for the Space Complexity of Randomised Incremental Algorithms
In: Discrete algorithms (SODA-92) : 3rd annual ACM-SIAM symposium, 89-93
Proceedings Article
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
(ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/conf/compgeom/compgeom90.html#FleischerMRWY90",Proceedings Article
1988Attachment IconCongruence, Similarity, and Symmetries of Geometric Objects
In: Discrete and Computational Geometry [3], 237-256
prüfen: http://dblp.uni-trier.de/db/journals/dcg/dcg3.html#AltMWW88Journal Article
1987Attachment IconCongruence, similarity and symmetries of geometric objectsReport
1987Convergence, Similarity and Symmetries of Geometric Objects
In: Computational geometry (SCG-87) : 3rd symposium, 308-315
SCG = Inv. 431
institution = "FU Berlin/U Saarlandes/TU Berlin/TU Graz",
Autoren korrigiert. UB
Proceedings Article
4
Hide details for Wendt, UlrichWendt, Ulrich
2004Computing Large Planar Regions in Terrains, with an Application to Fracture Surface
In: Discrete Applied Mathematics [139], 253-264
ok/ch050501Journal Article
2002Attachment IconComputing Large Planar Regions in Terrains
In: IWCIA 2001, 8th International Workshop on Combinatorial Image Analysis (IWCIA-01), 139-152
Proceedings Article
2002Surface Topography Quantification by Integral and Feature-related Parameters
In: Materialwissenschaft und Werkstofftechnik [33], 621-627
q
erledigt / bc 09.05.03
Journal Article
2001Surface Topography Quantification using Computational GeometryMiscellaneous
1
Hide details for Werner, DanielWerner, Daniel
2012Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176
Journal Article
1
Hide details for Wernet, NorbertWernet, Norbert
1976Binary Search Trees: Average and Worst Case Behavior
In: GI - 6. Jahrestagung, 301-313
http://dblp.uni-trier.de/db/conf/gi/gi76.html#GuttlerMSW76 / ch 060807Proceedings Article
1
Hide details for Werth, KaiWerth, Kai
2007Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
Proceedings Article
1
Hide details for Werth, SörenWerth, Sören
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
1
Hide details for Wesselink, WiegerWesselink, Wieger
2001CGAL Reference and User ManualsUnknown Form: eBookForm
1
Hide details for Westbrook, JefferyWestbrook, Jeffery
1998Self-organizing data structures
In: Online Algorithms: The State of the Art, 13-51
Part of a Book
1
Hide details for Westermann, MatthiasWestermann, Matthias
2003Data Management in Networks: Experimental Evaluation of a Provably Good Strategy
In: Theory of Computing Systems [35], 217-245
okJournal Article
1
Hide details for Westphal, StefanWestphal, Stefan
2009Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
Part of a Book
1
Hide details for Westphal, StephanWestphal, Stephan
2008Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Journal Article
1
Hide details for Wetzel, SusanneWetzel, Susanne
2006Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282
regina angemailt - kann gelöscht werden.

ok / ch 070308
- neu - gefunden via "ira"
- aus Webseite aufergänzt
Proceedings Article
7
Hide details for Wiese, AndreasWiese, Andreas
2013A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013),
noch nicht erschienen 4.2.13 smProceedings Article
2013Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Seitenangaben fehlen noch 4.2.13 smProceedings Article
2013Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013),
Proceedings Article
2013Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013),
Proceedings Article
2013Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013),
Proceedings Article
2013Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013),
Proceedings Article
2012The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700
Proceedings Article
2
Hide details for Wigderson, A.Wigderson, A.
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
1
Hide details for Wilhelmi, HaraldWilhelmi, Harald
1995Erzeugung von Pseudozufallszahlen gemäß einer veränderbaren Verteilung
Universität des Saarlandes
Thesis - Masters thesis
3
Hide details for Wilhelm, ReinhardWilhelm, Reinhard
2005Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108
ch 061031 :
Achtung: mir lag das Jahrbuch noch nicht vor!
Quelle: http://bvba2.bib-bvb.de/V/P5AXT9U4MAAXL1PAPL261APFCPLI3XULQNYGXNBUSVJ1UDG2II-19380?func=full&set_number=039321&set_entry=000002&format=999
Part of a Book
1989Foundations of Programming Languagesprüfen: URL = "http://www.mpi-sb.mpg.de/~mehlhorn/ProgLangBooks.htmlBook
1986Grundlagen der Programmiersprachenaus Books-DB übertragen / ch060724Book
3
Hide details for Williamson, David P.Williamson, David P.
2012A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486
Proceedings Article
2012On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617
Proceedings Article
2011Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
Electronic Proceedings Article
1
Hide details for Winlaw, MandaWinlaw, Manda
2011Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
1
Hide details for Winter, T.Winter, T.
1982Attachment IconA Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136
Journal Article
27
Hide details for Winzen, CarolaWinzen, Carola
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Journal Article
2013Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
Journal Article
2013Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
Journal Article
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
noch nicht erschienen 4.2.13 smJournal Article
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
noch nicht erschienen 4.2.13 smProceedings Article
2012A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807
Journal Article
2012Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
2012Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
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
2012Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
2012Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Electronic Journal Article
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Proceedings Article
2012Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
Proceedings Article
2012Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Electronic Journal Article
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
2012The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36
Electronic Journal Article
2011Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988
Proceedings Article
2011Direction-Reversing Quasi-Random Rumor Spreading with RestartsUnpublished/Draft
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
2011Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Electronic Journal Article
2011Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
Proceedings Article
2011Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
Thesis - PhD thesis
2011Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
Proceedings Article
2010Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974
Proceedings Article
2010Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
Proceedings Article
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
1
Hide details for Wissen, MichaelWissen, Michael
1998Automatisiertes Zeichnen von Zustandsdiagrammen
Universität des Saarlandes
Thesis - Masters thesis
23
Hide details for Witt, CarstenWitt, Carsten
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
noch nicht erschienen 4.2.13 smProceedings Article
2012Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21
Journal Article
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Journal Article
2011Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090
Proceedings Article
2010Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
Journal Article
2010Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633
Journal Article
2010Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational ComplexityBook
2010Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
Proceedings Article
2010Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335
Proceedings Article
2009Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19
Journal Article
2009Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
Journal Article
2009Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Journal Article
2009Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120
Part of a Book
2009Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Journal Article
2009Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842
Proceedings Article
2008Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
Proceedings Article
2008Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143
Proceedings Article
2008Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952
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 IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Proceedings Article
2007On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621
Proceedings Article
2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Proceedings Article
2006Ant Colony Optimization and the Minimum Spanning Tree ProblemReport
3
Hide details for Woeginger, Gerhard J.Woeginger, Gerhard J.
2011Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473
Proceedings Article
2003Attachment IconPreemptive scheduling with rejection
In: Mathematical Programming [94], 361-374
okJournal Article
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
okJournal Article
1
Hide details for Woelfel, PhilippWoelfel, Philipp
2012Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325
Electronic Proceedings Article
1
Hide details for Wojtaszczyk, Jakub OnufryWojtaszczyk, Jakub Onufry
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Kein MPI-Autor auf VÖ.smJournal Article
1
Hide details for Wolf, LarsWolf, Lars
2014Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865
Proceedings Article
1
Hide details for Wolle, ThomasWolle, Thomas
2006On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82
Proceedings Article
20
Hide details for Wolpert, NicolaWolpert, Nicola
2007Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155
ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- no abstract
- pdf nur mit Login


s. auch Bivis etc. / ch 070214
Part of a Book
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
2007Exact Computation of Arrangements of Rotated ConicsReport
2007Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Proceedings Article
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
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
2006An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97
ok / ch 070207
- aus Webseite aufergänzt
Journal Article
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
2006Attachment Icon(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26
Proceedings Article
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
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
2005On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115
ok / ch060612Proceedings Article
2004Attachment IconAn Empirical Comparison of Software for Constructing Arrangements of Curved ArcsReport
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
2004EXACUS: Efficient and Exact Algorithms for Curves and SurfacesReport
2003Jacobi Curves: Computing the Exact Topology of Arrangements of Non-Singular Algebraic CurvesReport
2002An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
Universität des Saarlandes
qThesis - PhD thesis
2002Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
1
Hide details for Wong, Ka ChunWong, Ka Chun
2007Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Journal Article
1
Hide details for Wong, Prudence W. H.Wong, Prudence W. H.
2010Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600
Journal Article
1
Hide details for Wood, DerickWood, Derick
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
2
Hide details for Wormald, NicholasWormald, Nicholas
2011Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
Journal Article
2010Attachment IconInduced subgraphs in sparse random graphs with given degree sequenceUnpublished/Draft
1
Hide details for Worsch, T.Worsch, T.
2002Feasible models of computation: Three-dimensionality and energy consumption
In: Fundamenta Informaticae [52], 233-248
qJournal Article
1
Hide details for Wren, HowardWren, Howard
2008Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Journal Article
1
Hide details for Wu, XiWu, Xi
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
1
Hide details for Xia, MingjiXia, Mingji
2013Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295
Konferenz laut ACM 2011?? smProceedings Article
7
Hide details for Xu, ChihaoXu, Chihao
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
2008Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219
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
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
ok / ch 070304
- aus Webseite aufergänzt
Proceedings Article
2005Verfahren zur Ansteuerung von MatrixanzeigenMiscellaneous
7
Hide details for Yap, CheeYap, Chee
2013Analytic Root Clustering: A Complete Algorithm using Soft Zero TestsUnpublished/Draft
2011A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360
Proceedings Article
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
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
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
1997Attachment IconA complete roundness classification procedure
In: Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), 129-138
Proceedings Article
5
Hide details for Yap, Chee-KengYap, Chee-Keng
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1991Constructive Whitney-Graustein theorem, or how to untangle closed planar curves
In: SIAM Journal on Computing [20], 603-621
Journal Article
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
(ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/conf/compgeom/compgeom90.html#FleischerMRWY90",Proceedings Article
1988Constructive Hopf's theorem: or how to untangle closed planar curvesok - aus der Papierfassung aufergänzt / ch 060918

übertragen aus Books-DB / ch 060806
Report
1988Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves
In: Automata, languages and programming (ICALP-88) : 15th international colloquium, 410-423
Proceedings Article
1
Hide details for Yap, Chee K.Yap, Chee K.
2006Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
ok / ch 070207
- aus Webseite aufergänzt
Electronic Proceedings Article
1
Hide details for Yung, MotiYung, Moti
2000Attachment IconRobust Parallel Computations through Randomization
In: Theory of Computing Systems [33], 427-464
Journal Article
1
Hide details for Yuster, RaphaelYuster, Raphael
2011Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501
Proceedings Article
3
Hide details for Yvinec, MarietteYvinec, Mariette
2001CGAL Reference and User ManualsUnknown Form: eBookForm
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedronok - Papierfassung / ch 060920
übertragen aus der Books-DB / ch060726
Report
1993Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
2
Hide details for Zafeirakopoulos, ZafeirakisZafeirakopoulos, Zafeirakis
2009Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54
Proceedings Article
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
1
Hide details for Zafeirakopoulos,ZafeirakisZafeirakopoulos,Zafeirakis
2008Cross-benchmarks of univariate algebraic kernelsReport
2
Hide details for Zarges, ChristineZarges, Christine
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
noch nicht erschienen 4.2.13 smJournal Article
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
28
Hide details for Zaroliagis, ChristosZaroliagis, Christos
2007Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39
Journal Article
2000A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124
Journal Article
2000Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
2000Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
Journal Article
2000Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
Not MPII Authors: Christos herausgelöscht.Journal Article
1999Transmissions in a network with capacities and delays
In: Networks [33
], 167-174
q / ch 8.9.03Journal Article

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