| # |  | Year | | Title | AG Editor Comment | Type | |
|---|
| 4 |
 | Fellows, Michael R. |
| |
| | 2012 | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | | Journal Article | |
| | 2011 | | Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527 | | Proceedings Article | |
| | 2011 | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | | Journal Article | |
| | 2011 | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | | Journal Article | |
| 2 |
| |
| | 2006 | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | | Proceedings Article | |
| | 2006 | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | | Journal Article | |
| 2 |
| Fernandes, Cristina G. |
| |
| | 1998 | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Soll 1997 werden - jedoch noch nicht veröffentlicht. | Journal Article | |
| | 1996 | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | | Proceedings Article | |
| 2 |
| |
| | 2011 |  | Ranking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, | KEIn MPI-Autor auf VÖ.sm | Proceedings Article | |
| | 2010 | | The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 | | Proceedings Article | |
| 9 |
| Ferragina, Paolo |
| |
| | 2002 | | A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35 | q | Journal Article | |
| | 2001 | | Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337 | | Journal Article | |
| | 1999 | | An Experimental Study of Priority Queues in External Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 345-359 | | Proceedings Article | |
| | 1999 | | I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138 | | Proceedings Article | |
| | 1999 | | On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235 | | Proceedings Article | |
| | 1999 | | q-gram Based Database Searching Using a Suffix Array (QUASAR)
In: Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB-99), 77-83 | | Proceedings Article | |
| | 1998 | | Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736 | Gefunden durch Bibliotheksabgleich. UB | Journal Article | |
| | 1998 | | Randomized External-Memory Algorithms for some Geometric Problems
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 259-268 | | Proceedings Article | |
| | 1997 | | The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176 | | Proceedings Article | |
| 1 |
| Fertin, Guillaume |
| |
| | 2011 | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | | Journal Article | |
| 3 |
| Fialko, Sergej |
| |
| | 1998 | | A new approximation algorithm for the planar augmentation problem
In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-98), 260-269 | | Proceedings Article | |
| | 1998 | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | | Proceedings Article | |
| | 1997 | | Das planare Augmentierungsproblem
Universität des Saarlandes | | Thesis - Masters thesis | |
| 1 |
| Fiethe, Björn |
| |
| | 2014 | | Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | | Proceedings Article | |
| 5 |
| Finkler, Ulrich |
| |
| | 1999 | | Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902 | Proc.Daten aus der Books-DB / ch 060828 | Proceedings Article | |
| | 1998 | | A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302 | Soll 1997 werden - jedoch noch nicht veröffentlicht. | Journal Article | |
| | 1997 | | Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 1997 | | Runtime Prediction of Real Programs on Real Machines
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 380-389 | | Proceedings Article | |
| | 1996 | | A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25 | | Proceedings Article | |
| 2 |
| Fink, Christian |
| |
| | 2002 | | A Polyhedral Approach to Surface Reconstruction from Planar Contours.
In: Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization, 258-272 | q | Proceedings Article | |
| | 2001 | | Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes | | Thesis - Masters thesis | |
| 5 |
| |
| | 2009 | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | | Journal Article | |
| | 2007 | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | 12th International Colloquium on Structural Information and Communication Complexity | Journal Article | |
| | 2007 | | Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 | | Proceedings Article | |
| | 2006 | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | ok / ch 070207
- aufergänzt via Webseite (Achtung: DBLP enthält falschen LNCS-Band!) | Proceedings Article | |
| | 2005 | | Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 | ok / ch051109 | Proceedings Article | |
| 2 |
| |
| | 2002 | | Basic analytic combinatorics of directed lattice paths
In: Theoretical Computer Science [281], 37-80 | q | Journal Article | |
| | 2002 | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | q | Journal Article | |
| 1 |
| Flato, Eyal |
| |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 2 |
| Fleischer, Lisa |
| |
| | 2009 | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | | Proceedings Article | |
| | 2003 | | Minimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75 | ok | Proceedings Article | |
| 23 |
| |
| | 2004 | | The LEDA class real number -- extended version | | Report | |
| | 2002 | | Using Finite Experiments to Study Asymptotic Performance
In: Experimental Algorithmics, 93-126 | q | Part of a Book | |
| | 2000 | | A strong and easily computable separation bound for arithmetic expressions involving radicals
In: Algorithmica [27], 87-99 | | Journal Article | |
| | 2000 | | Limited bookmark randomized online algorithms for the paging problem
In: Information Processing Letters [76], 155-162 | | Journal Article | |
| | 2000 | | Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210 | | Proceedings Article | |
| | 1999 | | Decision trees: old and new results
In: Information and computation [152], 44-61 | | Journal Article | |
| | 1999 | | Efficient exact geometric computation made easy
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 341-350 | | Proceedings Article | |
| | 1999 | | Effiziente und Online-Algorithmen
Universität des Saarlandes | | Thesis - Habilitation thesis | |
| | 1999 | | FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98 | | Proceedings Article | |
| | 1998 | | On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74 | | Proceedings Article | |
| | 1997 | | A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Square Roots
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 702-709 | | Proceedings Article | |
| | 1997 | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Autorenreihenfolge geändert und Vornamen ausgeschrieben | Proceedings Article | |
| | 1997 | | More efficient parallel totally monotone matrix searching
In: Journal of Algorithms [23], 386-400 | | Journal Article | |
| | 1996 | | A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149 | | Journal Article | |
| | 1996 | | Matching nuts and bolts faster
In: Information Processing Letters [59], 123-127 | | Journal Article | |
| | 1995 | | A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161 | | Journal Article | |
| | 1995 | | Matching nuts and bolts faster
In: Algorithms and Computation: 6th International Symposium (ISAAC'95), 402-408 | | Proceedings Article | |
| | 1992 | | Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
In: Algorithmica [8], 391-408 | | Journal Article | |
| | 1992 | | Selected 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 | |
| | 1992 | | Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389 | | Journal Article | |
| | 1991 | | A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401 | | Proceedings Article | |
| | 1990 | | Approximate Motion Planning and the Complexity of the Boundary of the Union of Simple Geometric Figures
In: Computational geometry (SCG-90) : 6th annual symposium, 281-289 | (ch 060324) noch zu prüfen: http://purl.org/CITIDEL/DBLP/db/conf/compgeom/compgeom90.html#AltFKMNSU90 | Proceedings Article | |
| | 1990 | | On 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 | |
| 1 |
| |
| | 2007 | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | | Proceedings Article | |
| 9 |
| |
| | 2010 | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | | Journal Article | |
| | 2010 | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | | Journal Article | |
| | 2007 | | Arrangements
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 | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | | Report | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | | Proceedings Article | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | | Proceedings Article | |
| | 2007 | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | | Report | |
| | 2006 | | Web-site with benchmark instances for planar curve arrangements | | Report | |
| | 2003 | | Specification of the traits classes for CGAL arrangements of curves | | Report | |
| 1 |
| |
| | 2004 | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | | Report | |
| 2 |
| |
| | 1997 | | Computing the largest empty anchored cylinder, and related problems
In: International Journal of Computational Geometry and Applications [7], 563-580 | | Journal Article | |
| | 1995 | | Computing a largest empty anchored cylinder, and related problems
In: Foundations of Software Technology and Theoretical Computer Science: 15th Conference, 428-442 | | Proceedings Article | |
| 4 |
| Fomin, Fedor V. |
| |
| | 2011 | | Hitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200 | | Proceedings Article | |
| | 2011 | | Minimum 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 | |
| | 2011 | | Ranking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, | KEIn MPI-Autor auf VÖ.sm | Proceedings Article | |
| | 2010 | | The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 | | Proceedings Article | |
| 1 |
| |
| | 2003 | | Computing the Filtration Efficiency of Shape-Index-Filters for Approximate String Matching
Universität des Saarlandes | ok | Thesis - Masters thesis | |
| 1 |
| |
| | 1984 | | Theoretical aspects of computer science (STACS-84) : [1st] symposium | übertragen aus der Books-DB / ch 060803 | Proceedings | |
| 8 |
| |
| | 2005 | | Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248 | ok / ch060619 | Journal Article | |
| | 2004 | | Incremental Algorithms for Facility Location and k-Median
In: Algorithms – ESA 2004: 12th Annual European Symposium, 347-358 | ch - ok/ch050422 | Proceedings Article | |
| | 2003 | | On the Competitive Ratio for Online Facility Location
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 637-652 | ok | Proceedings Article | |
| | 2003 | | Space 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 | ok | Proceedings Article | |
| | 2002 | | Minimum Congestion Redundant Assignments to Tolerate Random Faults
In: Algorithmica [32], 396-422 | q | Journal Article | |
| | 2002 | | On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 81-92 | q | Proceedings Article | |
| | 2002 | | Radiocolorings 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 | q | Proceedings Article | |
| | 2002 | | The 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.03 | Proceedings Article | |
| 1 |
| Fouad, Mohamed |
| |
| | 2012 | | Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450 | | Proceedings Article | |
| 20 |
| Fountoulakis, Nikolaos |
| |
| | 2013 | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | noch nicht erschienen 4.2.13 | Journal Article | |
| | 2012 | | Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333 | | Journal Article | |
| | 2012 | | Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660 | | Proceedings Article | |
| | 2011 | | 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | | Journal Article | |
| | 2011 | | Average Case Parameterized Complexity | | Unpublished/Draft | |
| | 2011 | | The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236 | | Proceedings Article | |
| | 2010 | | Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359 | | Proceedings Article | |
| | 2010 | | Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560 | | Proceedings Article | |
| | 2010 | | Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573 | | Proceedings Article | |
| | 2010 | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | | Electronic Journal Article | |
| | 2009 | | Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530 | | Proceedings Article | |
| | 2009 | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | | Journal Article | |
| | 2009 | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | | Journal Article | |
| | 2009 | | Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991 | | Journal Article | |
| | 2009 | | The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530 | | Proceedings Article | |
| | 2008 | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | | Journal Article | |
| | 2008 | | The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86 | | Journal Article | |
| | 2008 | | The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141 | | Journal Article | |
| | 2007 | | Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486 | | Journal Article | |
| | 2007 | | Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356 | | Journal Article | |
| 1 |
| |
| | 2004 | | A comparison of polynomial evaluation schemes | 12.8.05: aus RR-DB kopiert / ch | Report | |
| 19 |
| |
| | 2012 | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | | Proceedings Article | |
| | 2012 | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | | Proceedings Article | |
| | 2012 | | Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 2012 | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | | Journal Article | |
| | 2011 | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | | Proceedings Article | |
| | 2011 | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | | Electronic Journal Article | |
| | 2011 | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | | Journal Article | |
| | 2011 | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | | Proceedings Article | |
| | 2011 | | Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | | Proceedings Article | |
| | 2011 | | Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308 | The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011
Budapest, Hungary
Edited by Jarik Nešetřil, Ervin Győri and Attila Sa | Electronic Proceedings Article | |
| | 2011 | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | | Proceedings Article | |
| | 2010 | | Approximation 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 | |
| | 2010 | | Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | | Journal Article | |
| | 2010 | | Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | | Proceedings Article | |
| | 2010 | | Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | | Proceedings Article | |
| | 2009 | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009) | Journal Article | |
| | 2009 | | BBOB: 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 | |
| | 2006 | | Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19 | Title of Journal? Vol/No/Publisher ... / ch 070309 | Miscellaneous | |
| | 2006 | | Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes | | Thesis - Bachelor thesis | |
| 5 |
| |
| | 2013 | | Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), | | Proceedings Article | |
| | 2013 | | Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 | | Proceedings Article | |
| | 2006 | | Deterministic rendezvous in graphs | ch 070205: da Algorithmica _und_ Isaac 2004 erwähnt wird, dupliziere ich diesen Datensatz und bastel damit den Algorithmica-Datensatz.
to appear/ch050501 | Unpublished/Draft | |
| | 2006 | | Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | ok / ch 070205
- unpublished/draft kopiert, aus Webseite aufergänzt
- pdf eingesetzt / download verbidden
ch 070205: da Algorithmica _und_ Isaac 2004 erwähnt wird, dupliziere ich diesen Datensatz und bastel damit den Algorithmica-Datensatz.
to appear/ch050501 | Journal Article | |
| | 2004 | | Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151 | | Proceedings Article | |
| 1 |
| |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 2 |
| |
| | 1998 | | Algorithms for Measuring Perturbability in Matroid Optimization
In: Combinatorica [18], 503-518 | gefunden in mpi-bib | Journal Article | |
| | 1998 | | Rooted Spanning Trees with Small Weight and Average Length
In: Theoretical Computer Science, 114-125 | | Proceedings Article | |
| 1 |
| Fredman, Michael |
| |
| | 1996 | | On the Complexity of Dualization of Monotone Disjunctive Normal Forms
In: J. Algorithms [21], 618-628 | | Journal Article | |
| 2 |
| Friedetzky, Tom |
| |
| | 2011 | | Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 | | Proceedings Article | |
| | 2011 | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | | Proceedings Article | |
| 3 |
| |
| | 2014 | | Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | | Proceedings Article | |
| | 2014 | | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | | Proceedings Article | |
| | 2013 | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | | Proceedings Article | |
| 80 |
| |
| | 2013 | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | | Journal Article | |
| | 2013 | | Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278 | | Proceedings Article | |
| | 2013 | | Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | | Proceedings Article | |
| | 2013 | | Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | | Proceedings Article | |
| | 2013 | | Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29 | | Journal Article | |
| | 2012 | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | | Journal Article | |
| | 2012 | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | | Proceedings Article | |
| | 2012 | | Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464 | | Proceedings Article | |
| | 2012 | | Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | | Proceedings Article | |
| | 2012 | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | | Journal Article | |
| | 2012 | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | | Proceedings Article | |
| | 2012 | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | | Journal Article | |
| | 2012 | | Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 | Tobias Friedrich • Trent Kroeger • Frank Neumann | Electronic Journal Article | |
| | 2012 | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | | Journal Article | |
| | 2011 | | Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 | | Proceedings Article | |
| | 2011 | | Average Case Parameterized Complexity | | Unpublished/Draft | |
| | 2011 | | Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758 | | Journal Article | |
| | 2011 | | Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527 | | Proceedings Article | |
| | 2011 | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | | Proceedings Article | |
| | 2011 | | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | | Proceedings Article | |
| | 2011 | | Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556 | | Journal Article | |
| | 2011 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | | Journal Article | |
| | 2011 | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | | Proceedings Article | |
| | 2011 | | Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138 | | Journal Article | |
| | 2011 | | Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | | Proceedings Article | |
| | 2011 | | Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308 | The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011
Budapest, Hungary
Edited by Jarik Nešetřil, Ervin Győri and Attila Sa | Electronic Proceedings Article | |
| | 2011 | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | | Proceedings Article | |
| | 2010 | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | | Journal Article | |
| | 2010 | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | | Journal Article | |
| | 2010 | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | | Journal Article | |
| | 2010 | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | | Journal Article | |
| | 2010 | | Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | | Journal Article | |
| | 2010 | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | | Proceedings Article | |
| | 2010 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864 | | Journal Article | |
| | 2010 | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | | Proceedings Article | |
| | 2010 | | Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 | | Proceedings Article | |
| | 2010 | | Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24 | | Electronic Journal Article | |
| | 2010 | | The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139 | | Proceedings Article | |
| | 2010 | | The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30 | | Electronic Journal Article | |
| | 2010 | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | | Proceedings Article | |
| | 2010 | | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | | Proceedings Article | |
| | 2010 | | When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294 | ersch. als Online First 2008 | Journal Article | |
| | 2009 | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | | Journal Article | |
| | 2009 | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | | Journal Article | |
| | 2009 | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | | Proceedings Article | |
| | 2009 | | Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462 | | Journal Article | |
| | 2009 | | Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66 | | Proceedings Article | |
| | 2009 | | Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | | Journal Article | |
| | 2009 | | Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112 | | Proceedings Article | |
| | 2009 | | Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 | | Proceedings Article | |
| | 2009 | | Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130 | | Proceedings Article | |
| | 2009 | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | | Journal Article | |
| | 2009 | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | | Journal Article | |
| | 2009 | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | | Proceedings Article | |
| | 2009 | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | | Proceedings Article | |
| | 2009 | | Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | | Proceedings Article | |
| | 2008 | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | | Journal Article | |
| | 2008 | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | | Proceedings Article | |
| | 2008 | | Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447 | | Proceedings Article | |
| | 2008 | | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704 | | Proceedings Article | |
| | 2008 | | Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | | Proceedings Article | |
| | 2008 | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | | Proceedings Article | |
| | 2008 | | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680 | | Proceedings Article | |
| | 2008 | | Theoretical 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 | |
| | 2008 | | When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003 | | Proceedings Article | |
| | 2007 | | Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804 | | Proceedings Article | |
| | 2007 | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | | Proceedings Article | |
| | 2007 | | Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | | Journal Article | |
| | 2007 | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | | Proceedings Article | |
| | 2007 | | On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621 | | Proceedings Article | |
| | 2007 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629 | | Proceedings Article | |
| | 2007 | | Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225 | | Proceedings Article | |
| | 2007 | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | | Journal Article | |
| | 2007 | | Use and Avoidance of Randomness
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 2006 | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | ok / ch 070201 | Proceedings Article | |
| | 2006 | | Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | ok / ch 070206
- aufergänzt via Webseite (Achtung: DBLP enthält falschen LNCS-Band!) | Proceedings Article | |
| | 2006 | | Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64 | ok - exportkorr0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf | Journal Article | |
| | 2006 | | Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 | ok / ch 070201 | Proceedings Article | |
| | 2005 | | Deterministic Random Walks on Infinite Grids
Friedrich-Schiller-Universität Jena | ok / ch060420 | Thesis - Masters thesis | |
| | 2005 | | Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 | | Proceedings Article | |
| 2 |
| Fries, Markus |
| |
| | 2001 | | Implementation of a Dynamic Convex Hall Algorithm in Arbitrary Dimension
Universität des Saarlandes | | Thesis - Masters thesis | |
| | 2000 | | Implementation of a Dynamic Convex Hull Algorithm in Arbitrary Dimension
Universität des Saarlandes | | Thesis - Masters thesis | |
| 1 |
| |
| | 1992 | | Selected 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 | |
| 3 |
| |
| | 1987 | | A $\log \log n$ data structure for three-sided range queries
In: Information Processing Letters [25], 269-273 | | Journal Article | |
| | 1985 | | Dynamization of geometric data structures | ok - gefunden via Dagstuhl - Suche nach Mehlhorn als Verfasser / ch 060927 | Report | |
| | 1985 | | Dynamization of geometric data structures
In: Computational geometry (SCG-85) : 1st symposium, 168-176 | 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 | |
| 2 |
| |
| | 2000 | | Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46 | | Journal Article | |
| | 1997 | | Average-case complexity of shortest-paths problems in the vertex-potential model
In: International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-97), 15-26 | | Proceedings Article | |
| 1 |
| Frigioni, Daniele |
| |
| | 1998 | | An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 | | Proceedings Article | |
| 1 |
| Froyland, Gary |
| |
| | 2008 | | Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75 | | Journal Article | |
| 1 |
| Fuhrmann, Artur |
| |
| | 2001 | | A General Method for Computing the Reachable Space of Mechanisms
In: Proceedings of the 2001 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference. - Vol. 2, 27th Design Automation Conference (DETC'01), DAC-21057 | http://members.asme.org/catalog/ItemView.cfm?ItemNumber=I499CD | Proceedings Article | |
| 57 |
| Funke, Stefan |
| |
| | 2011 | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | | Journal Article | |
| | 2011 | | Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035 | | Journal Article | |
| | 2009 | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | | Journal Article | |
| | 2009 | | How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17 | | Electronic Journal Article | |
| | 2009 | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | | Part of a Book | |
| | 2008 | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | | Journal Article | |
| | 2008 | | How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74 | | Proceedings Article | |
| | 2008 | | On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | | Proceedings Article | |
| | 2008 | | On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208 | | Proceedings Article | |
| | 2008 | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | | Proceedings Article | |
| | 2007 | | Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283 | ok - export0707 / ch
- Abgleich mit BiVis
- Abgleich mit Papierfassung
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf | Proceedings Article | |
| | 2007 | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | | Journal Article | |
| | 2007 | | Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252 | | Proceedings Article | |
| | 2007 | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | 3rd International Conference on Ad-Hoc, Mobile and Wireless Networks | Journal Article | |
| | 2007 | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | | Proceedings Article | |
| | 2007 | | Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100 | | Proceedings Article | |
| | 2007 | | Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 | | Proceedings Article | |
| | 2007 | | Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967 | | Proceedings Article | |
| | 2007 | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | | Proceedings Article | |
| | 2007 | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | | Journal Article | |
| | 2006 | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | ok / ch 070316
- neu gefunden via ira
- aus webseiten aufergänzt | Journal Article | |
| | 2006 | | Controlled Perturbation for Delaunay Triangulations | | Report | |
| | 2006 | | Distance-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 | |
| | 2006 | | Hole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385 | ok / ch 070207
- aus Webseite aufergänzt | Proceedings Article | |
| | 2006 | | Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14 | Journal Title etc., s.a. Doerr, Fouz / ch 070316 | Miscellaneous | |
| | 2006 | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | | Electronic Proceedings Article | |
| | 2006 | | (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26 | | Proceedings Article | |
| | 2005 | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223 | ok / ch051105 | Proceedings Article | |
| | 2005 | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | ok / ch051109 | Journal Article | |
| | 2005 | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | ch - ok/ch050425 | Proceedings Article | |
| | 2005 | | Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | ok / ch051116 | Proceedings Article | |
| | 2005 | | Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367 | ok / ch051116 | Proceedings Article | |
| | 2005 | | Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206 | ok / ch051109 | Proceedings Article | |
| | 2005 | | Structural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194 | ch 060922:
- http://dblp.uni-trier.de/rec/bibtex/journals/comgeo/FunkeMN05 | Journal Article | |
| | 2005 | | Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53 | to appear? q / ch051116 - prüfen: editors?
nicht mehr to appear, s. Seitenzahlen. fertigstellen! ch / 060413 | Proceedings Article | |
| | 2004 | | Constant Time Queries for Energy Efficient Paths in Multi-Hop Wireless Networks
In: First International Workshop on Algorithms for Wireless and Mobile Networks, 97-111 | | Proceedings Article | |
| | 2004 | | Finding Planar Regions in a Terrain
In: 20th European Workshop on Computational Geometry (EWCG), 1-4 | | Proceedings Article | |
| | 2004 | | Finding Planar Regions in a Terrain: In Practice and with a Guarantee
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 96-105 | | Proceedings Article | |
| | 2004 | | Improved Approximation Algorithms for Connected Sensor Cover
In: Ad-hoc, mobil and wireless networks : Third International Conference, ADHOC-NOW 2004, 56-69 | | Proceedings Article | |
| | 2004 | | Point Containment in the Integer Hull of a Polyhedron
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 929-933 | | Proceedings Article | |
| | 2004 | | The LEDA class real number -- extended version | | Report | |
| | 2003 | | A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522 | ok | Proceedings Article | |
| | 2003 | | Approximating Energy Efficient Paths in Wireless Multi-hop Networks
In: Algorithms - ESA 2003: 11th Annual European Symposium, 230-241 | ok | Proceedings Article | |
| | 2003 | | Certifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256 | ok | Proceedings Article | |
| | 2003 | | Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429 | ok | Proceedings Article | |
| | 2003 | | Packing a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629 | ok | Proceedings Article | |
| | 2002 | | LOOK - A Lazy Object-Oriented Kernel for Geometric Computation
In: Computational Geometry - Theory and Applications [22], 99-118 | q | Journal Article | |
| | 2002 | | Smooth-Surface Reconstruction in Near-Linear Time
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 781-790 | q | Proceedings Article | |
| | 2001 | | A Separation Bound for Real Algebraic Expressions
In: Proceedings of the 9th Annual European Symposium on Algorithms (ESA-01), 254-265 | | Proceedings Article | |
| | 2001 | | Combinatorial Curve Reconstruction and the Efficient Exact Implementation of Geometric Algorithms
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 2001 | | Exact geometric computation using Cascading
In: International Journal of Computational Geometry & Applications [11], 245-266 | | Journal Article | |
| | 2001 | | Reconstructing a Collection of Curves with Corners and Endpoints
In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), 344-353 | | Proceedings Article | |
| | 2001 | | Surface Reconstruction in almost Linear Time under Locally Uniform Sampling
In: Proceedings of the 17th European Workshop on Computational Geometry (EWCG-01), 129-132 | | Electronic Proceedings Article | |
| | 2000 | | LOOK - a Lazy Object-Oriented Kernel for Geometric Computation
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 156-165 | | Proceedings Article | |
| | 1999 | | Structural Filtering: a Paradigm for Efficient and Exact Geometric Programs
In: Abstracts for the 11th Canadian Conference on Computational Geometry (CCCG-99), 39-42 | | Proceedings Article | |
| | 1998 | | Exact Geometric Predicates using Cascaded Computation
In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), 175-183 | | Proceedings Article | |
| | 1997 | | Exact Arithmetic using Cascaded Computation
Universität des Saarlandes | | Thesis - Masters thesis | |
| 5 |
| Fürer, Martin |
| |
| | 1998 | | Algorithms for Coloring Semi-random Graphs
In: Random Structures & Algorithms [13], 125-158 | | Journal Article | |
| | 1989 | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: IEEE Transactions on Computers [38], 1333-1336 | | Journal Article | |
| | 1986 | | AT$^2$-Optimal Galois Field Multiplier for VLSI
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 217-225 | http://dblp.uni-trier.de/db/conf/awoc/awoc86.html#FurerM86 | Proceedings Article | |
| | 1986 | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | | Proceedings | |
| | 1986 | | VLSI Algorithms and Architectures, Aegean Workshop on Computing - >> Dublette
In: VLSI Algorithms and Architectures, Aegean Workshop on Computing, 328 | | Proceedings | |
| 3 |
| Gagie, Travis |
| |
| | 2014 | | LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742 | | Proceedings Article | |
| | 2013 | | Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150 | | Proceedings Article | |
| | 2010 | | Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 | | Proceedings Article | |
| 2 |
| Gairing, Martin |
| |
| | 2012 | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | | Journal Article | |
| | 2010 | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | | Proceedings Article | |
| 3 |
| |
| | 1997 | | Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960 | | Journal Article | |
| | 1976 | | Monotone Switching Circuits and Boolean Matrix Product
In: Computing [16], 99-111 | ok / ch 061123 :
- mit webseiten abgeglichen rsp. aufergänzt:
-- pdf
-- abstract
-- alle Angaben
DB Books: P-76-01 /ch
http://www.springerlink.com/(5pyiyv554nrm4ieujaupllee)/app/home/contribution.asp?referrer=parent&backto=issue,9,14;journal,217,268;linkingpublicationresults,1:103076,1 | Journal Article | |
| | 1975 | | Monotone Switching Circuits and Boolean Matrix Product
In: Mathematical foundations of computer science (MFCS-75) : 4th symposium, 315-319 | ok - Proc.Daten aus Books DB übertragen; Artikel Daten aus DBLP / ch 060918 | Proceedings Article | |
| 1 |
| |
| | 2009 | | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | | Journal Article | |
| 2 |
| |
| | 2011 | | Distribution of spanning regular subgraphs in random graphs | | Unpublished/Draft | |
| | 2010 | | Induced subgraphs in sparse random graphs with given degree sequence | | Unpublished/Draft | |
| 2 |
| Gao, Shaodi |
| |
| | 1988 | | On Continuous Homotopic One Layer Routing
In: Computational geometry (SCG-88) : 4th symposium, 392-402 | ok - ch 061004 ; ProcDaten mit Books-DB abgeglichen.
Prüfen: Editor?
prüfen:
http://dblp.uni-trier.de/db/conf/compgeom/compgeom88.html#GaoJKMR89",
URL = "http://doi.acm.org/10.1145/73393.73433",
| Proceedings Article | |
| | 1988 | | On Continuous Homotopic One Layer Routing (Extended Abstract)
In: Computational geometry and its applications (CG-88) : international workshop, 55-70 | Proc aus Books-DB | Proceedings Article | |
| 1 |
| |
| | 2002 | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | q | Journal Article | |
| 15 |
| |
| | 2013 | | Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | | Proceedings Article | |
| | 2012 | | Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275 | | Electronic Proceedings Article | |
| | 2011 | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | | Proceedings Article | |
| | 2010 | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Online First Januar 2010 | Journal Article | |
| | 2008 | | Assigning Papers to Referees | | Unpublished/Draft | |
| | 2003 | | A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-perfect Graph
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 517-522 | ok | Proceedings Article | |
| | 2000 | | Approximation algorithm for the group Steiner tree problem
In: Journal of Algorithms [37], 66-84 | Achtung "Steiner" wird in MPG-Jahrbuch-Format klein geschrieben | Journal Article | |
| | 2000 | | Minimizing stall time in single and parallel disk systems
In: Journal of the ACM [47], 969-986 | | Journal Article | |
| | 1999 | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | | Journal Article | |
| | 1998 | | Minimizing stall time in single and parallel disk systems
In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), 454-462 | | Proceedings Article | |
| | 1998 | | The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134 | gefunden in mpi-bib | Journal Article | |
| | 1996 | | A 3-approximation for the minimum tree spanning with k-vertices
In: Foundations of computer science (FOCS-96) : 37th annual symposium, 302-309 | | Proceedings Article | |
| | 1996 | | Approximate max-flow min-(multi)cut theorems and their applications
In: SIAM Journal on Computing [25], 235-251 | | Journal Article | |
| | 1996 | | Distributed 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 | |
| | 1995 | | A polyhedron with all s-t cuts as vertices, and adjacency of cuts
In: Mathematical Programming (A) [70], 17-25 | | Journal Article | |
| 1 |
| |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 1 |
| |
| | 2009 | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | | Proceedings Article | |
| 18 |
| |
| | 2007 | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | | Journal Article | |
| | 2004 | | Collective Tree Exploration
In: LATIN 2004: Theoretical informatics, 6th Latin American Symposium, 141-151 | | Proceedings Article | |
| | 2004 | | The Wake-Up problem in multi-hop radio networks
In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), 985-993 | | Proceedings Article | |
| | 1998 | | A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681 | Gefunden durch Bibliotheksabgleich. UB | Journal Article | |
| | 1998 | | Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239 | gefunden am 9.9.03 via google:
M. Crochemore, L. Gasieniec and W. Rytter, Constant-space string matching in sublinear average time, in Compression and Complexity of Sequences, B. Carpentieri, A. De Santis, U. Vaccaro and J.A. Storer, eds., IEEE Computer Society, 1998, 230--239.
Noch nicht erschienen. Eingetragen für 1997 | Proceedings Article | |
| | 1997 | | Broadcasting with a bounded fraction of faulty nodes
In: Journal of Parallel and Distributed Computing [42], 11-20 | gefunden durch Bibliotheksabgleich | Journal Article | |
| | 1997 | | Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960 | | Journal Article | |
| | 1997 | | Efficient Parallel Computing with Memory Faults
In: Proceedings of the 11th Symposium on Fundamentals of Computation Theory (FCT-97), 188-197 | gefunden durch Bibliotheksabgleich | Proceedings Article | |
| | 1997 | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Autorenreihenfolge geändert und Vornamen ausgeschrieben | Proceedings Article | |
| | 1997 | | External inverse pattern matching
In: Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM-97), 90-101 | | Proceedings Article | |
| | 1997 | | On the complexity of computing evolutionary trees
In: Proceedings of the 3rd International Conference on Computing and Combinatorics (COCOON-97), 134-145 | gefunden durch Bibliotheksabgleich | Proceedings Article | |
| | 1997 | | The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176 | | Proceedings Article | |
| | 1996 | | Adaptive Broadcasting with Faulty Nodes
In: Parallel Computing [22], 903-912 | | Journal Article | |
| | 1996 | | Approximate Dictionary Queries
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 65-74 | Reihenfolge der Autoren war vertauscht! UB | Proceedings Article | |
| | 1996 | | Efficient Algorithms for Lempel-Ziv Encoding
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 392-403 | | Proceedings Article | |
| | 1996 | | Minimizing Congestion of Layouts for ATM Networks with Faulty Links
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 392-403 | | Proceedings Article | |
| | 1996 | | Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266 | | Proceedings Article | |
| | 1996 | | Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach
In: Combinatorial Pattern Matching: 7th Annual Symposium (CPM'96), 39-49 | | Proceedings Article | |
| 1 |
| Gast, Christoph |
| |
| | 1997 | | Das Maximum-Weight-Trace-Problem bei multiplem Sequenz-Alignment
Universität des Saarlandes | | Thesis - Masters thesis | |
| 17 |
| Gawrychowski, Pawel |
| |
| | 2014 | | Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 | | Proceedings Article | |
| | 2014 | | Improved 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 | |
| | 2014 | | LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742 | | Proceedings Article | |
| | 2014 | | Order-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 | |
| | 2014 | | Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41 | | Journal Article | |
| | 2014 | | Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349 | | Proceedings Article | |
| | 2014 | | Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372 | | Journal Article | |
| | 2013 | | Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48 | | Proceedings Article | |
| | 2013 | | Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | | Proceedings Article | |
| | 2013 | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | | Proceedings Article | |
| | 2013 | | Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | | Proceedings Article | |
| | 2013 | | Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 | | Proceedings Article | |
| | 2013 | | Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150 | | Proceedings Article | |
| | 2013 | | Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), | | Proceedings Article | |
| | 2012 | | Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236 | | Proceedings Article | |
| | 2012 | | Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242 | | Proceedings Article | |
| | 2012 | | Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635 | | Electronic Proceedings Article | |
| 1 |
| Geerke, Daan P. |
| |
| | 2012 | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | | Proceedings Article | |
| 1 |
| Geffert, Viliam |
| |
| | 1992 | | A lower bound for the nondeterministic space complexity of context-free recognition
In: Information Processing Letters [42], 25-27 | | Journal Article | |
| 2 |
| Geismann, Nicola |
| |
| | 2001 | | Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273 | | Proceedings Article | |
| | 2001 | | The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322 | | Proceedings Article | |
| 2 |
| |
| | 2005 | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | to appear/ch050501
in press / ch 051103
ok / ch060602 | Journal Article | |
| | 2003 | | Efficient Gossip and Robust Distributed Computation
In: Distributed Computing, 17th International Conference (DISC 2003), 224-238 | ok/ch050501 | Proceedings Article | |
| 4 |
| Gergov, Jordan |
| |
| | 2000 | | Algorithms for Interval Coloring, Geometric Packing and Memory Optimization
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 1996 | | Approximation Algorithms for Dynamic Storage Allocation
In: Algorithms - ESA '96: 4th Annual European Symposium, 52-61 | | Proceedings Article | |
| | 1996 | | Mod-2-OBDDs - a Date Structure that generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams
In: Formal Methods in System Design [8], 273-282 | | Journal Article | |
| | 1995 | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | | Proceedings Article | |
| 1 |
| |
| | 2013 | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | | Journal Article | |
| 1 |
| |
| | 2008 | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | | Proceedings Article | |
| 2 |
| |
| | 2012 | | Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | | Electronic Proceedings Article | |
| | 2012 | | Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641 | | Proceedings Article | |
| 2 |
| Giannopoulos, Panos |
| |
| | 2012 | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | | Journal Article | |
| | 2010 | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | | Journal Article | |
| 5 |
| |
| | 2010 | | NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338 | | Journal Article | |
| | 2009 | | Efficient 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 2008 | Journal Article | |
| | 2009 | | Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30 | | Electronic Journal Article | |
| | 2009 | | NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35 | Online First 22.01.2009
Springer Choice | Electronic Journal Article | |
| | 2007 | | LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231 | | Proceedings Article | |
| 10 |
| |
| | 2009 | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | | Electronic Proceedings Article | |
| | 2008 | | Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | | Journal Article | |
| | 2008 | | Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | | Journal Article | |
| | 2008 | | The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190 | | Journal Article | |
| | 2008 | | The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214 | | Proceedings Article | |
| | 2007 | | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | | Proceedings Article | |
| | 2007 | | Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410 | | Journal Article | |
| | 2007 | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124 | | Proceedings Article | |
| | 2007 | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124 | ok - export0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf | Proceedings Article | |
| | 2007 | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | | Part of a Book | |
| 3 |
| Giezeman, Geert-Jan |
| |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| | 2000 | | On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202 | | Journal Article | |
| | 1996 | | The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202 | | Proceedings Article | |
| 11 |
| Gnewuch, Michael |
| |
| | 2013 | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | noch nicht erschienen 4.2.13 sm | Part of a Book | |
| | 2012 | | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | | Journal Article | |
| | 2010 | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | | Journal Article | |
| | 2009 | | Implementation 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 | |
| | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | | Journal Article | |
| | 2008 | | Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312 | | Proceedings Article | |
| | 2008 | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | | Journal Article | |
| | 2007 | | A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | | Proceedings Article | |
| | 2006 | | Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding | | Report | |
| | 2006 | | Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | ok / ch 070207
- aufergänzt aus
- - http://www.citebase.org/abstract?id=oai%3AarXiv.org%3Amath%2F0604438
- - http://arxiv.org/abs/math/0604438
- publisher'name und address habe ich nicht so gefunden, wie es Mathias Bader (s. history) geschrieben hat; ich lasse es aber so. | Electronic Journal Article | |
| | 2005 | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | ok / ch051116 | Journal Article | |
| 2 |
| Goemans, Michel X. |
| |
| | 2004 | | Cooperative facility location games
In: Journal of Algorithms [50], 194-214 | | Journal Article | |
| | 1999 | | On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41 | | Journal Article | |
| 1 |
| |
| | 2002 | | 7th ACM Symposium on Solid Modeling and Applications; Tutorial T1: Geometric Algorithms for Planning and Simulation Tasks in Virtual Prototyping | q (komplett neu erstellt am 11.9.03 / ch) | Proceedings | |
| 6 |
| |
| | 2013 | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | | Journal Article | |
| | 2011 | | Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158 | | Proceedings Article | |
| | 2010 | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | | Proceedings Article | |
| | 2010 | | Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | | Proceedings Article | |
| | 2010 | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | | Proceedings Article | |
| | 2000 | | Contention resolution with constant expected delay
In: Journal of the ACM [42], 1048-1096 | | Journal Article | |
| 7 |
| Golin, Mordecai J. |
| |
| | 2003 | | Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429 | ok | Proceedings Article | |
| | 2002 | | Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
In: Journal of Algorithms [42], 277-303 | erledigt / bc 09.05.03 | Journal Article | |
| | 1999 | | On the Expected Depth of Random Circuits
In: Combinatorics, Probability and Computing [8], 209-228 | gefunden: Collection of Computer Science Bibliographies; vervollständigt aus dem Internet / ch 060828 | Journal Article | |
| | 1998 | | Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 43-54 | Gefunden durch Abgleich mit Bibliothek. UB | Proceedings Article | |
| | 1998 | | Randomized Data Structures for the Dynamic Closest-Pair Problem
In: SIAM Journal on Computing [27], 1036-1072 | Gefunden durch Bibliotheksabgleich. UB. | Journal Article | |
| | 1996 | | Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327 | | Journal Article | |
| | 1995 | | Simple randomized algorithms for closest pair problems
In: Nordic Journal of Computing [2], 3-27 | | Journal Article | |
| 1 |
| Golumbic, Martin Charles |
| |
| | 2006 | | Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477 | | Journal Article | |
| 1 |
| Gonnet, Gaston H. |
| |
| | 1982 | | The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174 | | Journal Article | |
| 6 |
| Goodrich, Michael T. |
| |
| | 2001 | | A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
In: Discrete and Computational Geometry [26], 246-265 | | Journal Article | |
| | 2000 | | Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling
In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00), 705-706 | | Proceedings Article | |
| | 2000 | | Linear-Time Triangulation of a Simple Polygon Made Easier Via Randomization
In: Proceedings of the 16th Annual Symposium on Computational Geometry (SCG-00), 201-212 | | Proceedings Article | |
| | 1997 | | Bounded-independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
In: Discrete and Computational Geometry [18], 397-420 | | Journal Article | |
| | 1997 | | Efficient approximation and optimization algorithms for computational metrology
In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-97), 121-130 | | Proceedings Article | |
| | 1995 | | External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149 | | Proceedings Article | |
| 1 |
| |
| | 2007 | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | | Journal Article | |
| 1 |
| |
| | 2010 | | Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | | Proceedings Article | |
| 1 |
| |
| | 1998 | | Parallel Crew Scheduling in PAROS
In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), 1104-1113 | | Proceedings Article | |
| 1 |
| |
| | 2007 | | Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197 | | Proceedings Article | |
| 1 |
| Gouyou-Beauchamps, Dominique |
| |
| | 2002 | | Generating Functions for Generating Trees
In: Discrete Mathematics [246], 29-55 | q | Journal Article | |
| 4 |
| |
| | 2012 | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | | Journal Article | |
| | 2008 | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | | Journal Article | |
| | 2007 | | Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187 | | Proceedings Article | |
| | 2007 | | Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear) | | Proceedings Article | |
| 1 |
| Goyal, Vishrut |
| |
| | 2005 | | All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679 | ch - ok/ch050425 | Proceedings Article | |
| 1 |
| Grahl, Jörn (ed.) |
| |
| | 2009 | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | | Proceedings | |
| 1 |
| Grammatikakis, M.D. |
| |
| | 1998 | | Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132 | | Journal Article | |
| 2 |
| Granados, Miguel |
| |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | | Report | |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | ok | Proceedings Article | |
| 1 |
| |
| | 2013 | | Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | | Proceedings Article | |
| 2 |
| |
| | 2013 | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | | Proceedings Article | |
| | 2012 | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | | Electronic Journal Article | |
| 3 |
| Grigoriev, Alexander |
| |
| | 2006 | | How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136 | | Proceedings Article | |
| | 2006 | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | | Proceedings Article | |
| | 2006 | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | | Journal Article | |
| 1 |
| Gröpl, Clemens |
| |
| | 2007 | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | exportkorr0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
Frage:
Was für eine Art Publikation ist es?
Journal Article oder Research Report?
Volume?
Publisher? | Journal Article | |
| 1 |
| Gross, Roberto |
| |
| | 1998 | | Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736 | Gefunden durch Bibliotheksabgleich. UB | Journal Article | |
| 5 |
| Grove, Edward |
| |
| | 1995 | | An Application-Controlled Paging Algorithm for a Shared Cache
In: 36th Annual Symposium on Foundations of Computer Science, 204-213 | | Proceedings Article | |
| | 1995 | | External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149 | | Proceedings Article | |
| | 1995 | | Load Balancing in the Euclidean Norm
In: 36th Annual Symposium on Foundations of Computer Science, 383-391 | | Proceedings Article | |
| | 1995 | | On-line Bin Packing with Lookahead
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 430-436 | | Proceedings Article | |
| | 1995 | | Online Perfect Matching and Mobile Computing
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 194-205 | | Proceedings Article | |
| 1 |
| Guez, Dan |
| |
| | 2004 | | Packet-Mode Policies for Input-Queued Switches
In: Sixteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA-04), 93-102 | | Proceedings Article | |
| 1 |
| Gugelmann, Luca |
| |
| | 2011 | | On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 | | Electronic Proceedings Article | |
| 2 |
| Guibas, Leonidas |
| |
| | 2010 | | Connected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 | | Proceedings Article | |
| | 2006 | | Distance-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 | |
| 2 |
| |
| | 1996 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities
In: Algorithmica [16], 543-547 | ok - abgeglichen mit download-Datei von Springer / ch 060823
einfügen des pdf's / ch 060918
DB Books: Dokumentnummer: P-96-51 | Journal Article | |
| | 1991 | | A Method for Obtaining Randomized Algorithms with Small Tail Probabilities | ok - mit Papierfassung abgeglichen (dort ist der Titel nicht ganz korrekt) / ch 060925
ok - übertragen des pdf files / ch 060918
übertragen aus der Books-DB / ch 060726 | Report | |
| 3 |
| Guillaume, Frank |
| |
| | 1999 | | Practical Parallel List Ranking
In: Journal of Parallel and Distributed Computing [56], 156-180 | gefunden in mpi-bib; not-mpi ergaenzen | Journal Article | |
| | 1997 | | Practical Parallel List Ranking
In: Proceedings of the 4th Symposium on Solving Irregularly Structured Problems in Parallel (IRREGULAR-97), 25-36 | | Proceedings Article | |
| | 1997 | | Praktisches Paralleles Paralleles List Ranking
Universität des Saarlandes | | Thesis - Masters thesis | |
| 3 |
| Gunopulos, Dimitrios |
| |
| | 1997 | | Discovering all most specific sentences by randomized algorithms
In: Proceedings of the 6th International Conference on Database Theory (ICDT-97), 215-229 | | Proceedings Article | |
| | 1997 | | Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27 | Autorenreihenfolge geändert und Vornamen ausgeschrieben | Proceedings Article | |
| | 1996 | | Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132 | | Proceedings Article | |
| 2 |
| Günther, Elisabeth |
| |
| | 2013 | | A 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 sm | Proceedings Article | |
| | 2010 | | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | | Proceedings Article | |
| 1 |
| |
| | 2001 | | Non-overlapping Constraints between Convex Polytopes
In: Proceedings of the 7th International Symposium on Principles and Practice of Constraint Programming (CP-01), 392-407 | | Proceedings Article | |
| 2 |
| |
| | 2011 | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | | Journal Article | |
| | 2011 | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | | Journal Article | |
| 3 |
| Gupta, Anupam |
| |
| | 2010 | | When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229 | | Proceedings Article | |
| | 2009 | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | T.-H. HUBERT CHAN†, KEDAR DHAMDHERE‡, ANUPAM GUPTA§ , JON KLEINBERG¶,
AND ALEKSANDRS SLIVKINS | Journal Article | |
| | 2009 | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | | Journal Article | |
| 2 |
| Gupta, Arvind |
| |
| | 1997 | | Using amplification to compute majority with small majority gates
In: Computational Complexity [6], 46-63 | | Journal Article | |
| | 1996 | | Vertex partitioning problems on partial k-trees
In: Algorithm Theory - SWAT'96: 5th Scandinavian Workshop on Algorithm Theory, 161-172 | | Proceedings Article | |
| 1 |
| |
| | 2012 | | Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275 | | Electronic Proceedings Article | |
| 8 |
| |
| | 1999 | | Efficient algorithms for counting and reporting pairwise intersections between convex polygons
In: Information Processing Letters [69], 7-13 | in mpi-bib gefunden
not-mpi authors bitte noch eintragen | Journal Article | |
| | 1997 | | The rectangle enclosure and point-dominance problems revisited
In: International Journal of Computational Geometry and Applications [7], 437-456 | | Journal Article | |
| | 1996 | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [5], 321-340 | gleiches paper auch in vol 6(1) erschienen // ch:14.12.04 | Journal Article | |
| | 1996 | | Algorithms for generalized halfspace range searching and other intersection searching problems
In: Computational Geometry [6], 1-19 | gleiches paper auch in vol 5(6) erschienen // ch:14.12.04 | Journal Article | |
| | 1996 | | Fast algorithms for collision and proximity problems involving moving geometric objects
In: Computational Geometry [6], 371-391 | | Journal Article | |
| | 1995 | | Further results on generalized intersection searching problems:
counting, reporting, and dynamization
In: Journal of Algorithms [19], 282-317 | | Journal Article | |
| | 1995 | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual ACM Symposium on Computing Geometry, 162-171 | | Proceedings Article | |
| | 1995 | | The rectangle enclosure and point-dominance problems revisited
In: 11th Annual !CM Symposium on Computational Geometry, 162-171 | | Proceedings Article | |
| 45 |
| Gurvich, Vladimir |
| |
| | 2012 | | Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | | Unpublished/Draft | |
| | 2012 | | On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788 | | Journal Article | |
| | 2011 | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | | Unpublished/Draft | |
| | 2011 | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | | Proceedings Article | |
| | 2011 | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | | Journal Article | |
| | 2010 | | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354 | | Proceedings Article | |
| | 2010 | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | | Journal Article | |
| | 2010 | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | | Unpublished/Draft | |
| | 2008 | | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109 | | Proceedings Article | |
| | 2008 | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | | Journal Article | |
| | 2008 | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | | Journal Article | |
| | 2008 | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | | Journal Article | |
| | 2008 | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | | Journal Article | |
| | 2008 | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | | Journal Article | |
| | 2008 | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | | Journal Article | |
| | 2007 | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | | Journal Article | |
| | 2007 | | Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | 30th International Colloquium on Automata, Languages and Programming (ICALP 2003) | Journal Article | |
| | 2007 | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | 29th International Symposium on Mathematical Foundations of Computer Science, Special Issue: MFCS 2004 | Journal Article | |
| | 2007 | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | | Proceedings Article | |
| | 2007 | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | | Unpublished/Draft | |
| | 2007 | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | 6th Latin American Symposium on Theoretical Informatics (LATIN 2004) | Journal Article | |
| | 2006 | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | ok / ch 070207
- aus Webseite aufergänzt | Proceedings Article | |
| | 2006 | | Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765 | ok / ch 070207
- aus Webseite aufergänzt | Proceedings Article | |
| | 2005 | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | ok / ch060420 | Proceedings Article | |
| | 2005 | | Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567 | ok / ch060420 | Proceedings Article | |
| | 2005 | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | ok / ch060420 | Proceedings Article | |
| | 2005 | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | ok / ch060420 | Journal Article | |
| | 2004 | | Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems
In: Algorithms – ESA 2004: 12th Annual European Symposium, 122-133 | ch - ok/ch050421 | Proceedings Article | |
| | 2004 | | An Efficient Implementation of a Joint Generation Algorithm
In: Experimental and efficient algorithms : Third International Workshop, WEA 2004, 114-128 | ch - ok/ch050421 | Proceedings Article | |
| | 2004 | | Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
In: Integer programming and combinatorial optimization : 10th International IPCO Conference, 152-162 | ch - ok/ch050421 | Proceedings Article | |
| | 2004 | | Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, 488-498 | ch - ok/ch050421 | Proceedings Article | |
| | 2004 | | Generating Paths and Cuts in Multi-pole (Di)graphs
In: Mathematical foundations of computer science 2004 : 29th International Symposium, MFCS 2004, 298-309 | ch - ok/ch050421 | Proceedings Article | |
| | 2003 | | Algorithms for Enumerating Circuits in Matroids.
In: Algorithms and Computation, 14th International Symposium, ISAAC 2003, 485-494 | | Proceedings Article | |
| | 2003 | | An Efficient Implementation of a Quasi-polynomial Algorithm for Generating Hypergraph Transversals
In: Algorithms - ESA 2003, 11th Annual European Symposium, 556-567 | | Proceedings Article | |
| | 2003 | | An Inequality for Polymatroid Functions and its Applications
In: Discrete Applied mathematics [131], 27 | | Journal Article | |
| | 2003 | | An Intersection Inequality for Discrete Distributions and Related Generation Problems
In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, 543-555 | | Proceedings Article | |
| | 2003 | | Extending the Balas-Yu Bounds on the Number of Maximal Independent Sets in Graphs to Hypergraphs and Lattices
In: Mathematical Programming, Ser. B [98], 14 | | Journal Article | |
| | 2002 | | Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: SIAM Journal on Computing [31], 20 | | Journal Article | |
| | 2002 | | Generating Dual-Bounded Hypergraphs
In: Optimization Methods and Software [17], 33 | | Electronic Journal Article | |
| | | | | | | |
| | 2002 | | Matroid Intersections, Polymatroid Inequalities, and Related Problems
In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 143-154 | | Proceedings Article | |
| | 2001 | | On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, 92-103 | | Proceedings Article | |
| | 2000 | | An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension
In: Parallel Processing Letters [10], 14 | q/ch050421 - allerdings für 2000 ... | Journal Article | |
| | 1991 | | Criteria for repetition-freeness of functions in the algebra of logic
In: Soviet Math. Dokl. [43], 721-726 | | Journal Article | |
| | 1977 | | On repetition-free Boolean functions
In: Uspekhi Mat. Nauk. (Russian Math. Surveys) [32], 183-184 | | Journal Article | |
| 3 |
| Güttler, Reiner |
| |
| | 1980 | | Binary Search Trees: Average and Worst Case Behavior
In: Elektronische Informationsverarbeitung und Kybernetik [16], 41-61 | | Journal Article | |
| | 1976 | | Binary Search Trees: Average and Worst Case Behavior | ok - mit Papierfassung abgeglichen / ch 060921
erg!!! (Seitenzahl, Berichtnummer) - aus BiVis übertragen / ch060919 | Report | |
| | 1976 | | Binary 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 060807 | Proceedings Article | |
| 4 |
| Gutwenger, Carsten |
| |
| | 1999 | | Design und Implementierung einer Algorithmen-Bibliothek zum Zeichnen von Graphen
Universität des Saarlandes | | Thesis - Masters thesis | |
| | 1998 | | AGD: A Library of Algorithms for Graph Drawing
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 456-457 | | Proceedings Article | |
| | 1998 | | Planar Polyline Drawings with Good Angular Resolution
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 167-182 | | Proceedings Article | |
| | 1997 | | AGD-Library: A Library of Algorithms for Graph Drawing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 112-123 | Stefan Naeher --> Näher (UB) | Proceedings Article | |
| 6 |
| |
| | 2007 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | | Journal Article | |
| | 2006 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 2005 | | Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174 | ok / ch051031 | Proceedings Article | |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | | Report | |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | ok | Proceedings Article | |
| | 1999 | | Dynamic shortest Path Algorithms for Planar and Outerplanar Graphs
Universität des Saarlandes | | Thesis - Masters thesis | |
| 2 |
| Hagedoorn, Michiel |
| |
| | 2003 | | Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size
In: Database Theory - ICDT 2003 : 9th International Conference, 440-454 | ok | Proceedings Article | |
| | 2000 | | A New Visibility Partition for Affine Pattern Matching
In: Discrete Geometry for Computer Imagery, Proceedings of the 9th International Conference (DGCI-00), 358-370 | | Proceedings Article | |
| 2 |
| |
| | 2010 | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | | Part of a Book | |
| | 2008 | | Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102 | | Proceedings Article | |
| 37 |
| Hagerup, Torben |
| |
| | 2002 | | Translating a Planar Object to Maximize Point Containment
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 42-53 | erledigt / bc 09.05.03 | Proceedings Article | |
| | 2000 | | Dynamic algorithms for graphs of bounded treewidth
In: Algorithmica [27], 292-315 | | Journal Article | |
| | 2000 | | Parallel preprocessing for path queries without concurrent reading
In: Information and Computation [158], 18-28 | | Journal Article | |
| | 2000 | | Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578 | | Journal Article | |
| | 1998 | | An Implementation of the Binary Blocking Flow Algorithm
In: Proceedings of the 2nd Workshop on Algorithm Engineering (WAE-98), 143-154 | | Proceedings Article | |
| | 1998 | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29 | Gefunden durch den Abgleich mit der Bibliothek | Journal Article | |
| | 1998 | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: SIAM Journal on Computing [27], 1725-1746 | gefunden in mpi-bib | Journal Article | |
| | 1998 | | Simpler and Faster Dictionaries on the AC° RAM
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 79-90 | Gefunden durch Bibliotheksabgleich. UB | Proceedings Article | |
| | 1998 | | Sorting and Searching on the Word RAM
In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), 366-398 | gefunden in mpi-bib | Proceedings Article | |
| | 1997 | | A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51 | | Journal Article | |
| | 1997 | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Journal of Parallel and Distributed Computing [47], 185-197 | | Journal Article | |
| | 1997 | | Dynamic algorithms for graphs of bounded treewidth
In: Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP-97), 292-302 | | Proceedings Article | |
| | 1997 | | Fast integer merging on the EREW PRAM
In: Algorithmica [17], 55-66 | | Journal Article | |
| | 1997 | | Improved Parallel Integer Sorting without Concurrent Writing
In: Information and Computation [136], 25-51 | | Journal Article | |
| | 1996 | | Allocating Independent Tasks to Parallel Processors: An Experimental Study
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 1-33 | | Proceedings Article | |
| | 1996 | | An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170 | | Journal Article | |
| | 1996 | | More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140 | | Proceedings Article | |
| | 1995 | | A Lower Bound for the Emulation of PRAM Memories on Processor Networks
In: Information and Computation [119], 124-128 | | Journal Article | |
| | 1995 | | A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226 | | Journal Article | |
| | 1995 | | Characterizations of k-Terminal Flow Networks and Computing Network Flows in
Partial k-Trees
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 641-649 | | Proceedings Article | |
| | 1995 | | Fast Deterministic Processor Allocation
In: Journal of Algorithms [18], 629-649 | | Journal Article | |
| | 1995 | | Fast Parallel Permutation Algorithms
In: Parallel Processing Letters [5], 139-148 | | Journal Article | |
| | 1995 | | Fast Parallel Space Allocation, Estimation, and Integer Sorting
In: Information and Computation [123], 72-110 | | Journal Article | |
| | 1995 | | More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243 | | Proceedings Article | |
| | 1995 | | Parallel Algorithms with Optimal Speedup for Bounded Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 268-279 | | Proceedings Article | |
| | 1995 | | Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218 | | Proceedings Article | |
| | 1995 | | Self-Simulation for the Passive Optical Star Model
In: Algorithms-ESA'95: 3rd Annual European Symposium, 268-380 | | Proceedings Article | |
| | 1995 | | Sorting in Linear Time?
In: 27th Annual ACM Symposium on Theory of Computing (STOC95), 427-436 | | Proceedings Article | |
| | 1995 | | The Parallel Complexity of Integer Prefix Summation
In: Information Processing Letters [56], 59-64 | | Journal Article | |
| | 1993 | | Maintaining Discrete Probability Distributions Optimally
In: Automata, languages and programming (ICALP-93) : 20th international colloquium, 253-264 | | Proceedings Article | |
| | 1992 | | A Perfect Parallel Dictionary
In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), 133-141 | | Proceedings Article | |
| | 1991 | | Fast and Reliable Parallel Hashing
In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), 50-61 | | Proceedings Article | |
| | 1990 | | Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248 | ProcDaten mit BooksDB abgeglichen / ch 060912 | Proceedings Article | |
| | 1990 | | Can a maximum flow be computed in $o(nm)$ time? | | Report | |
| | 1987 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: SIAM Journal on Computing [16], 808-835 | | Journal Article | |
| | 1986 | | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
In: Mathematical Foundations of Computer Science, 12th Symposium (MFCS 1986), 199-208 | | Proceedings Article | |
| | 1985 | | Deterministic simulation of idealized parallel computers on more realistic ones | ok - Seitenzahl aus Papierfassung aufergänzt / ch 060920
übertragen aus der Books-DB / ch 060803 | Report | |
| 1 |
| Hagerup,Torben |
| |
| | 1987 | | Deterministic Simulation of Idealized Parallel Computers on more Realistic Ones
In: Parallel Algorithms and Architectures : International Workshop, 11-15 | in DBLP gefunden, aus Papierfassung aufergänzt / ch 060921
http://websok.libris.kb.se/websearch/showrecord;jsessionid=046CC02F4BAA278125C493CE4625A5D2?searchId=22729&nr=1 | Proceedings Article | |
| 1 |
| Hajiaghayi, MohammadTaghi |
| |
| | 2010 | | The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231 | | Proceedings Article | |
| 2 |
| Hales, David |
| |
| | 2007 | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | UB: Jahr von 2006 auf 20076 geschoben. Kein Tagungsband in gedruckter Form verfügbar. Website bietet nur Download der Extended Abstracts an. Diese werden aber nicht für die Jahrbuchmeldung akzeptiert. | Proceedings Article | |
| | 2005 | | Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24 | @inproceedings{DELIS-TR-0287, author = {Gerhard Weikum and Holger Bast and Geoffrey Canright and David Hales and Christian Schindelhauer and Peter Triantafillou}, title = {Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search}, booktitle = {ECCS Workshop on Peer-to-peer data management in the Complex Systems perspective}, year = {2005}, key = {DELIS-TR-0287} } | Proceedings Article | |
| 2 |
| |
| | 2003 | | An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, 71-82 | ok | Proceedings Article | |
| | 2003 | | Multicommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409 | ok | Proceedings Article | |
| 13 |
| Halperin, Dan |
| |
| | 2012 | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | | Journal Article | |
| | 2011 | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | | Electronic Journal Article | |
| | 2011 | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | | Proceedings Article | |
| | 2010 | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | | Journal Article | |
| | 2010 | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | | Journal Article | |
| | 2010 | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | | Electronic Proceedings Article | |
| | 2007 | | Arrangements
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 | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | | Report | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | | Proceedings Article | |
| | 2007 | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | | Proceedings Article | |
| | 2004 | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | | Report | |
| | 2003 | | Specification of the traits classes for CGAL arrangements of curves | | Report | |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 1 |
| Haltner, Eleonore |
| |
| | 2000 | | Modeling the Sugar Lectin Interaction by Computational Chemistry Relevant to Drug Design
In: Proceedings of the 3rd World Meeting on Pharmaceutics, Biopharmaceutics and Pharmaceutical Technology, 233 | verifizieren! | Proceedings Article | |
| 1 |
| Haltner, Elleonore |
| |
| | 1998 | | Investigating the Sugar-Lectin Interaction by Computational Chemistry: Tunneling the Epithelial Barrier
In: Proceedings of the 18th Interlec Meeting, 549 | | Proceedings Article | |
| 1 |
| Hamel,Angele |
| |
| | 2008 | | Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | | Proceedings Article | |
| 1 |
| Hammad, Abdelrahman |
| |
| | 2008 | | Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18 | | Journal Article | |
| 1 |
| Hammerschmidt, Frank |
| |
| | 1999 | | Konzeption und Entwicklung des streng strukturierten und erweiterbaren Datentyps html_page für LEDA
Universität des Saarlandes | | Thesis - Masters thesis | |
| 1 |
| Hanniel, Iddo |
| |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 1 |
| Hansen, Nikolaus (ed.) |
| |
| | 2008 | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | | Proceedings | |
| 1 |
| Han, Xiaofeng |
| |
| | 1995 | | Computing minimal spanning subgraphs in linear time
In: SIAM Journal on Computing [24], 1332-1358 | | Journal Article | |
| 1 |
| Han, Xin |
| |
| | 2010 | | Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | | Journal Article | |
| 7 |
| Happ, Edda |
| |
| | 2012 | | Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | | Journal Article | |
| | 2011 | | Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691 | | Journal Article | |
| | 2009 | | Analyses of Evolutionary Algorithms
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 2008 | | Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | | Proceedings Article | |
| | 2008 | | Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613 | | Proceedings Article | |
| | 2008 | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | | Proceedings Article | |
| | 2007 | | A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895 | | Proceedings Article | |
| 2 |
| Har-Peled, Sariel |
| |
| | 2005 | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | ok / ch051109 | Journal Article | |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 9 |
| |
| | 2006 | | A 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 | |
| | 2000 | | An 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.03 | Journal Article | |
| | 1998 | | A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681 | Gefunden durch Bibliotheksabgleich. UB | Journal Article | |
| | 1996 | | An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332 | | Proceedings Article | |
| | 1996 | | Coloring 2-colorable hypergraphs with a sublinear number of colors
In: Scandinavian Workshop on Algorithm Theory (SWAT96), 41-52 | | Proceedings Article | |
| | 1995 | | Algorithms for Enumerating all Spanning Trees of an Undirected Graph
In: SIAM Journal on Computing [24], 247-265 | | Journal Article | |
| | 1995 | | Derandomizing semidefinite programming based approximation algorithms
In: 36th IEEE Symposium on Foundations of Computer Science, 162-16 | | Proceedings Article | |
| | 1995 | | String Matching over a General Matching Relation
In: Information and Computation [122], 140-148 | | Journal Article | |
| | 1995 | | Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45 | | Journal Article | |
| 1 |
| |
| | 2008 | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | | Journal Article | |
| 2 |
| |
| | 2013 | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | | Journal Article | |
| | 2010 | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | | Journal Article | |
| 12 |
| Harren, Rolf |
| |
| | 2012 | | Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75 | | Journal Article | |
| | 2012 | | Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | | Proceedings Article | |
| | 2011 | | A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | | Proceedings Article | |
| | 2010 | | Two-dimensional packing problems
Universität des Saarlandes | | Thesis - PhD thesis | |
| | 2009 | | Approximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532 | | Journal Article | |
| | 2009 | | Improved 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 | |
| | 2008 | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | | Journal Article | |
| | 2008 | | Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | | Proceedings Article | |
| | 2007 | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | | Proceedings Article | |
| | 2007 | | Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme | | Book | |
| | 2006 | | Approximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249 | | Proceedings Article | |
| | 2006 | | Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund | | Thesis - other | |
| 1 |
| |
| | 2011 | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | | Journal Article | |
| 1 |
| |
| | 2000 | | Tight bounds for searching a sorted array of strings
In: SIAM Journal on Computing [30], 1552-1578 | | Journal Article | |
| 1 |
| |
| | 1999 | | Molekül-Docking-Reaktionen
Universität des Saarlandes | | Thesis - Masters thesis | |
| 1 |
| |
| | 2009 | | Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30 | | Electronic Journal Article | |
| 20 |
| |
| | 2011 | | Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758 | | Journal Article | |
| | 2010 | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | | Journal Article | |
| | 2009 | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | | Journal Article | |
| | 2009 | | Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462 | | Journal Article | |
| | 2009 | | Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611 | | Journal Article | |
| | 2009 | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | | Journal Article | |
| | 2008 | | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704 | | Proceedings Article | |
| | 2007 | | A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | | Proceedings Article | |
| | 2007 | | Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804 | | Proceedings Article | |
| | 2007 | | Discrepancy of Sums of two Arithmetic Progressions | exportkorr0707 / ch
- Abgleich mit Webseiten
- Not MPII Author / Editor
- urls
- abstract
- pdf
Frage:
Was für eine Art Publikation ist es?
Nils Hebbinghaus: Tech Report
oder Article:
http://adsabs.harvard.edu/cgi-bin/nph-bib_query?bibcode=2007math......3108H&data_type=BIBTEX&db_key=PRE&nocookieset=1
@ARTICLE{2007math......3108H,
author = {{Hebbinghaus}, N.},
title = "{Discrepancy of Sums of two Arithmetic Progressions}",
journal = {ArXiv Mathematics e-prints},
eprint = {math/0703108},
year = 2007,
month = mar,
adsurl = {http://adsabs.harvard.edu/abs/2007math......3108H},
adsnote = {Provided by the Smithsonian/NASA Astrophysics Data System}
}
| Report | |
| | 2007 | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | | Proceedings Article | |
| | 2007 | | On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621 | | Proceedings Article | |
| | 2007 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629 | | Proceedings Article | |
| | 2007 | | Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225 | | Proceedings Article | |
| | 2007 | | Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410 | 9th International Conference on Parallel Problem Solving from Nature (PPSK IX) | Journal Article | |
| | 2006 | | Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | ok / ch 070207
- aufergänzt aus
- - http://www.citebase.org/abstract?id=oai%3AarXiv.org%3Amath%2F0604438
- - http://arxiv.org/abs/math/0604438
- publisher'name und address habe ich nicht so gefunden, wie es Mathias Bader (s. history) geschrieben hat; ich lasse es aber so. | Electronic Journal Article | |
| | 2006 | | Improved 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 | |
| | 2006 | | Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987 | ok / ch 070205
- aus Webseite + Bivis aufergänzt
- pdf eingesetzt / download verbidden | Proceedings Article | |
| | 2006 | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | ok / ch 070205
- aus Webseite aufergänzt
- pdf eingesetzt / download verbidden
- kein abstract vorhanden | Journal Article | |
| | 2005 | | Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328 | ok / ch060606
ok / ch060420 bis auf Publisher & Address
http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/about
per Fernleihe bestellt am 060602 | Proceedings Article | |
| 1 |
| Hebbinhaus, Nils |
| |
| | 2010 | | Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864 | | Journal Article | |
| 1 |
| Heinz, Jeffrey |
| |
| | 2012 | | Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127 | | Journal Article | |
| 1 |
| Helwig, Sabine |
| |
| | 2009 | | Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | | Proceedings Article | |
| 37 |
| Hemmer, Michael |
| |
| | 2011 | | A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494 | | Journal Article | |
| | 2011 | | A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186 | | Proceedings Article | |
| | 2010 | | A Generic Algebraic Kernel for Non-linear Geometric Applications | | Report | |
| | 2009 | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | | Proceedings Article | |
| | 2009 | | Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | | Proceedings Article | |
| | 2009 | | Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | | Proceedings Article | |
| | 2009 | | Generic implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324 | | Proceedings Article | |
| | 2009 | | Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4 | | Manual | |
| | 2009 | | Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4 | | Manual | |
| | 2008 | | Arrangements of quadrics in 3D: continued work on experimental implementation | | Report | |
| | 2008 | | CGAL package for modular arithmetic operations | | Report | |
| | 2008 | | CGAL package: Algebraic Foundations | | Report | |
| | 2008 | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics | | Report | |
| | 2008 | | Cross-benchmarks of univariate algebraic kernels | | Report | |
| | 2008 | | Evaluation of different approaches in 3D curved kernel for arrangements of quadrics | | Report | |
| | 2008 | | Exact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz | | Thesis - PhD thesis | |
| | 2008 | | Experimental evaluation and cross-benchmarking of univariate real solvers | | Report | |
| | 2008 | | Prototype implementation of the algebraic kernel | | Report | |
| | 2008 | | Voronoi diagram of ellipses: CGAL-based implementation | | Report | |
| | 2007 | | Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3 | | Manual | |
| | 2007 | | Benchmarks on a generic univariate algebraic kernel | | Report | |
| | 2007 | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644 | | Proceedings Article | |
| | 2007 | | Definition of the 3D Quadrical Kernel Content | | Report | |
| | 2007 | | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | | Manual | |
| | 2007 | | Revision of interface specification of algebraic kernel | | Report | |
| | 2007 | | Traits classes for polynomial gcd computation over algebraic extensions | | Report | |
| | 2006 | | Interface specification of algebraic kernel | | Report | |
| | 2006 | | Prototype implementation of the algebraic kernel | | Report | |
| | 2005 | | An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106 | ok / ch051116 | Proceedings Article | |
| | 2005 | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | ok / ch051116
STATUS: accepted (01.08.05)
Copyright muss noch geklaert werden!
Botz, 22.07.05:
Die im CTA genannte URL der LNCS ist gar nicht mehr aktuell. Wahrscheinlich
handelt es sich auch um eine alte Copyright Form. Der Link zu LNCS lautet:
http://www.springerlink.com/openurl.asp?genre=journal&issn=0302-9743
Die von mir gefundene Copyright Policy von Springer ist hier
http://www.springeronline.com/sgw/cda/pageitems/document/cda_downloaddocumen
t/0,11996,0-0-45-69724-0,00.pdf
zu finden.
Dort steht ausdrücklich:
"An author may self-archive an author-created version of his/her article on
his/her own website and his/her institution’s repository, including his/her final
version"
Ich werde das Thema aber beim Treffen mit den Springer-Leuten nächste Woche
ansprechen.
Bib 01.08.05:
welche Version? - Springer will Link auf Orig.?
Bestimmungen fuer LNCS sind nicht identisch mit Journal CTA
Angegebene URL ist aktuell!!! (Mail an Herrn Botz 01.08.05) | Proceedings Article | |
| | 2004 | | An Empirical Comparison of Software for Constructing Arrangements of Curved Arcs | | Report | |
| | 2004 | | Effects of a Modular Filter on Geometric Applications | | Report | |
| | 2004 | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | | Report | |
| | 2002 | | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186 | erledigt / bc 09.05.03 | Proceedings Article | |
| | 2002 | | Reliable computation of planar and spatial arrangements of quadrics
Universität des Saarlandes | q - bis auf "date of colloquium" | Thesis - Masters thesis | |
| | 2001 | | Computing a 3-dimensional Cell in an Arrangement of Quadrics: Exactly and Actually!
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 264-273 | | Proceedings Article | |
| | 2001 | | The Convex Hull of Ellipsoids (Video)
In: Proceedings of the 17th Annual Symposium on Computational Geometry (SCG-01), 321-322 | | Proceedings Article | |
| 1 |
| Henson, Van Emden |
| |
| | 2011 | | Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking | | Unpublished/Draft | |
| 2 |
| Henzinger, Monika R. |
| |
| | 2003 | | Scheduling multicasts on unit-capacity trees and meshes
In: Journal of Computer and System Sciences [66], 567-611 | | Journal Article | |
| | 1997 | | Exploring Unknown Environments
In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC-97), 416-425 | | Proceedings Article | |
| 1 |
| |
| | 2004 | | Global constraints for round robin tournament scheduling
In: European Journal of Operational Research [153], 92-101 | | Journal Article | |
| 19 |
| |
| | 2012 | | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474 | | Proceedings Article | |
| | 2012 | | Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | | Proceedings Article | |
| | 2012 | | Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635 | | Proceedings Article | |
| | 2012 | | Weak 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 | |
| | 2012 | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | | Journal Article | |
| | 2011 | | Average Case Parameterized Complexity | | Unpublished/Draft | |
| | 2011 | | Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527 | | Proceedings Article | |
| | 2011 | | Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | | Proceedings Article | |
| | 2011 | | Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | | Proceedings Article | |
| | 2011 | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | | Journal Article | |
| | 2011 | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | | Journal Article | |
| | 2011 | | Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594 | | Journal Article | |
| | 2011 | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | | Proceedings Article | |
| | 2011 | | Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96 | | Journal Article | |
| | 2011 | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | | Journal Article | |
| | 2010 | | Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | | Proceedings Article | |
| | 2010 | | Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 | | Proceedings Article | |
| | 2010 | | Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18 | | Journal Article | |
| | 2010 | | Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | | Proceedings Article | |
| 1 |
| |
| | 2012 | | Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32 | | Journal Article | |
| 1 |
| |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 4 |
| |
| | 1985 | | Fast Triangulation of the Plane with Respect to Simple Polygons
In: Information and Control [64], 52-76 | | Journal Article | |
| | 1984 | | Space Sweep Solves Intersection of Convex Polyhedra
In: Acta Informatica [21], 501-519 | ok - aus Journal aufergänzt und pdf eingefügt / ch 060907 | Journal Article | |
| | 1984 | | Space sweep solves intersection of two convex polyhedra elegantly | | Report | |
| | 1983 | | Fast Triangulation of Simple Polygons
In: Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference (FCT 1983), 207-218 | Proc.Daten aus DBLP übertragen / ch 060806 | Proceedings Article | |
| 1 |
| Hertel, S. |
| |
| | 1982 | | A Probabilistic Algorithm for Vertex Connectivity of Graphs
In: Information Processing Letters [15], 135-136 | | Journal Article | |
| 14 |
| Hert, Susan |
| |
| | 2007 | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | | Journal Article | |
| | 2007 | | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | | Manual | |
| | 2005 | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | ok / ch051116
STATUS: accepted (01.08.05)
Copyright muss noch geklaert werden!
Botz, 22.07.05:
Die im CTA genannte URL der LNCS ist gar nicht mehr aktuell. Wahrscheinlich
handelt es sich auch um eine alte Copyright Form. Der Link zu LNCS lautet:
http://www.springerlink.com/openurl.asp?genre=journal&issn=0302-9743
Die von mir gefundene Copyright Policy von Springer ist hier
http://www.springeronline.com/sgw/cda/pageitems/document/cda_downloaddocumen
t/0,11996,0-0-45-69724-0,00.pdf
zu finden.
Dort steht ausdrücklich:
"An author may self-archive an author-created version of his/her article on
his/her own website and his/her institution’s repository, including his/her final
version"
Ich werde das Thema aber beim Treffen mit den Springer-Leuten nächste Woche
ansprechen.
Bib 01.08.05:
welche Version? - Springer will Link auf Orig.?
Bestimmungen fuer LNCS sind nicht identisch mit Journal CTA
Angegebene URL ist aktuell!!! (Mail an Herrn Botz 01.08.05) | Proceedings Article | |
| | 2004 | | EXACUS: Efficient and Exact Algorithms for Curves and Surfaces | | Report | |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation | | Report | |
| | 2003 | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
In: Algorithms - ESA 2003: 11th Annual European Symposium, 654-666 | ok | Proceedings Article | |
| | 2003 | | Specification of the traits classes for CGAL arrangements of curves | | Report | |
| | 2002 | | A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
In: Algorithms - ESA 2002 : 10th Annual European Symposium, 174-186 | erledigt / bc 09.05.03 | Proceedings Article | |
| | 2002 | | Multiple Robot Motion Planning = Parallel Processing + Geometry
In: Sensor Based Intelligent Robots, 183-205 | q
lt. Springer ersch. der Band erst 2002!!! (Susan oder Anja, Datum unbekannt) | Proceedings Article | |
| | 2001 | | An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90 | | Proceedings Article | |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| | 2001 | | Connected Area Partitioning
In: Proceedings of the 17th European Workshop on Computational Geometry (CG-01), 35-38 | | Proceedings Article | |
| | 2000 | | The Area Partitioning Problem
In: Proceedings of the 12th Annual Canadian Conference on Computational Geometry (CCCG-00), 163-171 | | Proceedings Article | |
| | 1999 | | Motion Planning in R^3 for Multiple Tethered Robots
In: IEEE Transactions on Robotics and Automation [15], 623-639 | | Journal Article | |
| 3 |
| |
| | 2015 | | Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61 | | Journal Article | |
| | 2013 | | Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433 | | Proceedings Article | |
| | 2012 | | Dividing connected chores fairly
Universität des Saarlandes | | Thesis - Bachelor thesis | |
| 2 |
| |
| | 1976 | | Top Down Parsing of Macro Grammars
In: GI - 6. Jahrestagung, 95-108 | http://dblp.uni-trier.de/db/conf/gi/gi76.html#HeydthausenM76 / ch 060807 | Proceedings Article | |
| | 1976 | | Top down parsing of macro grammars (preliminary report) | ok - Abgleich mit Papierfassung / ch 060921
ok - aus BiVis übertragen, aus SULB Seitenzahl ergänzt / ch060919 | Report | |
| 4 |
| He, Jun |
| |
| | 2010 | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | | Journal Article | |
| | 2009 | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | | Journal Article | |
| | 2007 | | Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804 | | Proceedings Article | |
| | 2007 | | On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621 | | Proceedings Article | |
| 1 |
| |
| | 2010 | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | | Part of a Book | |
| 1 |
| |
| | 1996 | | Heuristiken fur das euklidische Travelling Salesman Problem
Universitat des Saarlandes | | Thesis - Masters thesis | |
| 1 |
| |
| | 2003 | | Multicommodity Flows Over Time: Efficient Algorithms and Complexity
In: Automata, languages and programming : 30th International Colloquium, ICALP 2003, 397-409 | ok | Proceedings Article | |
| 1 |
| |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 1 |
| |
| | 2005 | | Verfahren zur Ansteuerung von Matrixanzeigen | | Miscellaneous | |
| 15 |
| |
| | 2013 | | Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21 | | Journal Article | |
| | 2013 | | Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56 | | Proceedings Article | |
| | 2013 | | Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | | Proceedings Article | |
| | 2013 | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | | Journal Article | |
| | 2013 | | Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262 | | Proceedings Article | |
| | 2013 | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | | Proceedings Article | |
| | 2013 | | Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35 | | Journal Article | |
| | 2013 | | Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631 | | Proceedings Article | |
| | 2013 | | On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453 | | Journal Article | |
| | 2013 | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | | Journal Article | |
| | 2013 | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | | Proceedings Article | |
| | 2013 | | Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53 | | Journal Article | |
| | 2013 | | Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582 | | Proceedings Article | |
| | 2011 | | Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | | Proceedings Article | |
| | 2003 | | Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location
In: 2nd International Workshop on Experimental and Efficient Algorithms (WEA-03), 165-178 | | Proceedings Article | |
| 1 |
| |
| | 1995 | | Self-Stabilization in Wait-Free Shared Memory Objects
In: Distributed Algorithms: 9th International Workshop (WDAG95), 273-287 | | Proceedings Article | |
| 1 |
| |
| | 1984 | | Intersecting a line and a simple polygon
In: EATCS Bulletin [22], 120-121 | | Journal Article | |
| 3 |
| |
| | 1986 | | Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
In: Information and Control [68], 170-184 | | Journal Article | |
| | 1985 | | Sorting 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 | |
| | 1984 | | Sorting Jordan sequences in linear time | Seitenzahl fehlt !!! / 060920
übertragen aus der Books-DB / ch 060803 | Report | |
| 3 |
| |
| | 2007 | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | | Journal Article | |
| | 2001 | | An Adaptable and Extensible Geometry Kernel
In: Proceedings of the 5th International Workshop on Algorithm Engineering (WAE-01), 79-90 | | Proceedings Article | |
| | 2001 | | CGAL Reference and User Manuals | | Unknown Form: eBookForm | |
| 1 |
| |
| | 2011 | | Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 | | Proceedings Article | |
| 1 |
| |
| | 2012 | | On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309 | | Journal Article | |
| 1 |
| |
| | 2008 | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | | Proceedings | |
| 3 |
| |
| | 1983 | | Cost Trade-offs in Graph Embeddings, with Applications
In: Journal of the ACM [30], 709-728 | ok - abgeglichen mit dem Volume/paper-Form / ch 060912
ok - ch 061109 :
- abgeglichen mit http://portal.acm.org/citation.cfm?doid=2157.322401
- pdf eingesetzt
- abstract + keywords eingesetzt + umformatiert | Journal Article | |
| | 1982 | | Cost tradeoffs in graph embeddings, with applications | | Report | |
| | 1981 | | Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version)
In: Automata, languages and programming (ICALP-81) : 8th international colloquium, 41-55 | Proc.Daten aus Books-DB übertragen / ch 060806 | Proceedings Article | |
| 1 |
| |
| | 2003 | | Preemptive scheduling with rejection
In: Mathematical Programming [94], 361-374 | ok | Journal Article | |
| 1 |
| |
| | 2008 | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | | Proceedings | |
| 1 |
| |
| | 2009 | | Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86 | | Proceedings Article | |
| 5 |
| |
| | 2011 | | Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556 | | Journal Article | |
| | 2009 | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | | Proceedings Article | |
| | 2009 | | Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 | | Proceedings Article | |
| | 2008 | | Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680 | | Proceedings Article | |
| | 2008 | | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680 | | Proceedings Article | |
| 1 |
| |
| | 2012 | | Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24 | | Proceedings Article | |
| 1 |
| |
| | 2009 | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | | Proceedings Article | |
| 1 |
| |
| | 2008 | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | | Proceedings | |
| 1 |
| |
| | 2009 | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | | Proceedings Article | |
| 1 |
| |
| | 1998 | | Packet Routing in Fixed-Connection Networks: A Survey
In: Journal of Parallel and Distributed Computing [54], 77-132 | | Journal Article | |
| 11 |
| |
| | 2013 | | How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 | | Proceedings Article | |
| | 2012 | | Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | | Proceedings Article | |
| | 2012 | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | | Proceedings Article | |
| | 2011 | | Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | | Journal Article | |
| | 2011 | | Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA), | | Proceedings Article | |
| | 2011 | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | | Proceedings Article | |
