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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 1. Author,Editor - 2. by Group - 3. by Names Including [Non Members]

Login to this database


 

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

#YearTitleType
2
Hide details for Calinescu, Fernandes, Finkler, Karloff [Calinescu, Fernandes, Karloff]Calinescu, Fernandes, Finkler, Karloff [Calinescu, Fernandes, Karloff]
1998A Better Approximation Algorithm for Finding Planar Subgraphs
In: Journal of Algorithms [27], 269-302
Journal Article
1996A better approximation algorithm for finding planar subgraphs
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 16-25
Proceedings Article
1
Hide details for Cameron, Johannsen, Prellberg, Schweitzer [Cameron, Prellberg]Cameron, Johannsen, Prellberg, Schweitzer [Cameron, Prellberg]
2008Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Electronic Journal Article
1
Hide details for Canzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau [Canzar, El-Kebir, Pool, Malde, Mark, GCanzar, El-Kebir, Pool, Elbassioni, Malde, Mark, Geerke, Stougie, Klau [Canzar, El-Kebir, Pool, Malde, Mark, Geerke, Stougie, Klau, Chor]
2012Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43
Proceedings Article
1
Hide details for Canzar, Elbassioni, Elmasry, Raman [Canzar, Elmasry, Raman, Cheong, Chwa, Park]Canzar, Elbassioni, Elmasry, Raman [Canzar, Elmasry, Raman, Cheong, Chwa, Park]
2010On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179
Proceedings Article
1
Hide details for Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre, Aceto, Henzinger, Sgall]Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre, Aceto, Henzinger, Sgall]
2011On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109
Proceedings Article
1
Hide details for Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre]Canzar, Elbassioni, Klau, Mestre [Canzar, Klau, Mestre]
2011On Tree-Constrained Matchings and GeneralizationsUnpublished/Draft
1
Hide details for Canzar, Elbassioni, Mestre [Canzar]Canzar, Elbassioni, Mestre [Canzar]
2010A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33
Proceedings Article
1
Hide details for Canzar, Remy [Remy]Canzar, Remy [Remy]
2006Shape Distributions and Protein Similarity
In: GCB, 1-10
Proceedings Article
1
Hide details for Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou, Kratochvíl, Díaz, Fiala ]Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou, Kratochvíl, Díaz, Fiala ]
2007Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136
Proceedings Article
1
Hide details for Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou]Caragiannis, Fishkin, Kaklamanis, Papaioannou [Caragiannis, Kaklamanis, Papaioannou]
2007A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160
Journal Article
2
Hide details for Caroli [-]Caroli [-]
2007Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes
Thesis - Masters thesis
2006Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Case, Kötzing [Case, Hutter, Stephan, Vovk, Zeugmann]Case, Kötzing [Case, Hutter, Stephan, Vovk, Zeugmann]
2010Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299
Proceedings Article
1
Hide details for Case, Kötzing [Case, Kalai, Mohri]Case, Kötzing [Case, Kalai, Mohri]
2010Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193
Proceedings Article
1
Hide details for Case, Kötzing [Case, Schwentick, Dürr]Case, Kötzing [Case, Schwentick, Dürr]
2011Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331
Electronic Proceedings Article
3
Hide details for Case, Kötzing [Case]Case, Kötzing [Case]
2013Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
Electronic Journal Article
2012Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
Journal Article
2012Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
Journal Article
1
Hide details for Celikik, Bast [Karlgren, Tarhio, Hyyrö]Celikik, Bast [Karlgren, Tarhio, Hyyrö]
2009Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205
Proceedings Article
1
Hide details for Celikik, Bast [Shin]Celikik, Bast [Shin]
2009Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
Proceedings Article
1
Hide details for Celikik, Bast, Manolache [-]Celikik, Bast, Manolache [-]
2011Attachment IconEfficient Index-Based Snippet GenerationUnpublished/Draft
1
Hide details for Chandran, Sivadasan [-]Chandran, Sivadasan [-]
2004Attachment IconOn the Hadwiger's Conjecture for Graph ProductsReport
1
Hide details for Chang [-]Chang [-]
2007Attachment IconMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
Proceedings Article
1
Hide details for Chang, Johnson [Johnson]Chang, Johnson [Johnson]
2008Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
Proceedings Article
1
Hide details for Chang, Kannan [Kannan]Chang, Kannan [Kannan]
2006Attachment IconThe Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166
Proceedings Article
1
Hide details for Chan, Dhamdhere, Gupta, Kleinberg, Slivkins [Dhamdhere, Gupta, Kleinberg, Slivkins]Chan, Dhamdhere, Gupta, Kleinberg, Slivkins [Dhamdhere, Gupta, Kleinberg, Slivkins]
2009Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329
Journal Article
1
Hide details for Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Chan, Edmonds, Lam, Marchetti-Spaccamela, Pruhs]Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Chan, Edmonds, Lam, Marchetti-Spaccamela, Pruhs]
2011Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517
Journal Article
1
Hide details for Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs, Albers, Chan, Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs [Edmonds, Lam, Lee, Marchetti-Spaccamela, Pruhs, Albers, Marion]
2009Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264
Electronic Proceedings Article
1
Hide details for Chan, Edmonds, Pruhs [Edmonds, Pruhs]Chan, Edmonds, Pruhs [Edmonds, Pruhs]
2009Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10
Proceedings Article
1
Hide details for Chan, Elbassioni [-]Chan, Elbassioni [-]
2011A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723
Journal Article
1
Hide details for Chan, Gupta [Gupta]Chan, Gupta [Gupta]
2009Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Journal Article
1
Hide details for Chan, Lam, Lee [Chan, Lam, de Berg, Meyer]Chan, Lam, Lee [Chan, Lam, de Berg, Meyer]
2010Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35
Proceedings Article
1
Hide details for Chan, Lam, Lee [Chan, Lam, Schwentick, Dürr]Chan, Lam, Lee [Chan, Lam, Schwentick, Dürr]
2011Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403
Electronic Proceedings Article
1
Hide details for Chan, Lam, Lee, Ting [Chan, Lam, Ting, Marion, Schwentick]Chan, Lam, Lee, Ting [Chan, Lam, Ting, Marion, Schwentick]
2010Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190
Electronic Proceedings Article
1
Hide details for Chan, Lam, Lee, Ting [Chan, Lam, Ting]Chan, Lam, Lee, Ting [Chan, Lam, Ting]
2012Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111
Journal Article
1
Hide details for Chan, Megow, Sitters, van Stee [Chan, Sitters]Chan, Megow, Sitters, van Stee [Chan, Sitters]
2012Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
Journal Article
1
Hide details for Chaudhuri [-]Chaudhuri [-]
1996Sensitive functions and approximate problems
In: Information and Computation [126], 161-168
Journal Article
1
Hide details for Chaudhuri, Dimopoulos, Zaroliagis [-]Chaudhuri, Dimopoulos, Zaroliagis [-]
1996On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230
Journal Article
1
Hide details for Chaudhuri, Dubhashi [Baeza-Yates, Dubhashi, Goles, Poblete]Chaudhuri, Dubhashi [Baeza-Yates, Dubhashi, Goles, Poblete]
1995Probabilistic Recurrence Relations Revisited
In: LATIN'95: Theoretical Informatics, Second Latin American Symposium, 207-219
Proceedings Article
1
Hide details for Chaudhuri, Dubhashi [Dubhashi]Chaudhuri, Dubhashi [Dubhashi]
1997Probabilistic recurrence relations revisited
In: Theoretical Computer Science [181], 45-56
Journal Article
1
Hide details for Chaudhuri, Garg, Ravi [Ravi]Chaudhuri, Garg, Ravi [Ravi]
1998The $p$-neighbor $k$-center problem
In: Information Processing Letters [65], 131-134
Journal Article
1
Hide details for Chaudhuri, Hagerup [Mayr, Schmidt, Tinhofer]Chaudhuri, Hagerup [Mayr, Schmidt, Tinhofer]
1995Prefix Graphs and their Applications
In: Graph-theoretic Concepts in Computer Science: 20th International Workshop (WG94), 206-218
Proceedings Article
2
Hide details for Chaudhuri, Radhakrishnan [Radhakrishnan]Chaudhuri, Radhakrishnan [Radhakrishnan]
1997The Complexity of Parallel Prefix Problems on Small Domains
In: Information and Computation [138], 1-22
Journal Article
1996Deterministic restrictions in circuit complexity
In: Theory of Computing : 28th Annual ACM Symposium (STOC-28), 30-36
Proceedings Article
1
Hide details for Chaudhuri, Subrahmanyam, Wagner, Zaroliagis [Subrahmanyam, Wagner, Larsen, Skyum, Winskel]Chaudhuri, Subrahmanyam, Wagner, Zaroliagis [Subrahmanyam, Wagner, Larsen, Skyum, Winskel]
1998Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567
Proceedings Article
1
Hide details for Chaudhuri, Subrahmanyam, Wagner, Zaroliagis [Subrahmanyam, Wagner, Zaroliagis]Chaudhuri, Subrahmanyam, Wagner, Zaroliagis [Subrahmanyam, Wagner, Zaroliagis]
2000Computing mimicking networks
In: Algorithmica [26], 31-49
Journal Article
2
Hide details for Chaudhuri, Zaroliagis [-]Chaudhuri, Zaroliagis [-]
2000Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226
Journal Article
1998Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223
Journal Article
1
Hide details for Chaudhuri, Zaroliagis [Fülöp, Gecseg]Chaudhuri, Zaroliagis [Fülöp, Gecseg]
1995Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255
Proceedings Article
1
Hide details for Chaudhuri, Zaroliagis [Spirakis]Chaudhuri, Zaroliagis [Spirakis]
1995Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45
Proceedings Article
1
Hide details for Cheng, Funke, Golin, Kumar, Poon, Ramos [Cheng, Golin, Kumar, Poon, Ramos]Cheng, Funke, Golin, Kumar, Poon, Ramos [Cheng, Golin, Kumar, Poon, Ramos]
2003Curve Reconstruction from Noisy Samples
In: Proceedings of the 19th Annual Symposium on Computational Geometry (SCG-03), 420-429
Proceedings Article
1
Hide details for Chen, Das, Smid [Chen, Das]Chen, Das, Smid [Chen, Das]
1996Lower bounds for computing geometric spanners and approximate shortest paths
In: 8th Canadian Conference on Computing, 155-160
Proceedings Article
1
Hide details for Chen, Doerr, Hu, Ma, van Stee, Winzen [Chen, Hu, Ma, Goldberg]Chen, Doerr, Hu, Ma, van Stee, Winzen [Chen, Hu, Ma, Goldberg]
2012Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Proceedings Article
1
Hide details for Chen, Epstein, Kleiman, van Stee [Chen, Epstein, Kleiman]Chen, Epstein, Kleiman, van Stee [Chen, Epstein, Kleiman]
2013Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Journal Article
1
Hide details for Cheriyan, Hagerup [Cheriyan]Cheriyan, Hagerup [Cheriyan]
1995A Randomized Maximum-Flow Algorithm
In: SIAM Journal on Computing [24], 203-226
Journal Article
1
Hide details for Cheriyan, Hagerup, Mehlhorn [-]Cheriyan, Hagerup, Mehlhorn [-]
1990Attachment IconCan a maximum flow be computed in $o(nm)$ time?Report
1
Hide details for Cheriyan, Hagerup, Mehlhorn [Cheriyan]Cheriyan, Hagerup, Mehlhorn [Cheriyan]
1996An o(n³)-Time Maximum-Flow-Algorithm: Can a Maximum Flow be Computed in o(nm) Time?
In: SIAM Journal on Computing [25], 1144-1170
Journal Article
1
Hide details for Cheriyan, Hagerup, Mehlhorn [, ]Cheriyan, Hagerup, Mehlhorn [, ]
1990Can A Maximum Flow be Computed in o(nm) Time?
In: Automata, languages and programming (ICALP-90) : 17th international colloquium, 235-248
Proceedings Article
2
Hide details for Cheriyan, Mehlhorn [Cheriyan]Cheriyan, Mehlhorn [Cheriyan]
1999Attachment IconAn analysis of the highest-level selection rule in the preflow-push max-flow algorithm
In: Information Processing Letters [69], 239-242
Journal Article
1996Attachment IconAlgorithms for Dense Graphs and Networks on the Random Access Computer
In: Algorithmica [15], 521-549
Journal Article
1
Hide details for Chian, Goodrich, Grove, Tamassia, Vengroff, Vitter [Chian, Goodrich, Tamassia, Vengroff, Vitter]Chian, Goodrich, Grove, Tamassia, Vengroff, Vitter [Chian, Goodrich, Tamassia, Vengroff, Vitter]
1995External-Memory Graph Algorithms
In: 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA95), 139-149
Proceedings Article
1
Hide details for Ching, Mehlhorn, Smid []Ching, Mehlhorn, Smid []
1990Dynamic deferred data structuring
In: Information Processing Letters [35], 37-40
Journal Article
1
Hide details for Chin, Guo, Sun [Chin, Guo]Chin, Guo, Sun [Chin, Guo]
2011Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Journal Article
1
Hide details for Chlebus, Czumaj, Gasieniec, Kowaluk, Plandowski [Chlebus, Czumaj, Kowaluk, Penczek, Szalas, Plandowski]Chlebus, Czumaj, Gasieniec, Kowaluk, Plandowski [Chlebus, Czumaj, Kowaluk, Penczek, Szalas, Plandowski]
1996Parallel Alternating-Direction Access Machine
In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), 255-266
Proceedings Article
1
Hide details for Chlebus, Czumaj, Sibeyn [-]Chlebus, Czumaj, Sibeyn [-]
1997Routing on the PADAM: Degrees of Optimality
In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), 272-279
Proceedings Article
1
Hide details for Chlebus, Kowalski [Chlebus, Chaudhuri, Kutten]Chlebus, Kowalski [Chlebus, Chaudhuri, Kutten]
2004A better wake-up in radio networks
In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, 266-274
Proceedings Article
1
Hide details for Chlebus, Kowalski [Chlebus, Gabow, Fagin]Chlebus, Kowalski [Chlebus, Gabow, Fagin]
2005Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739
Proceedings Article
1
Hide details for Chlebus, Kowalski [Chlebus]Chlebus, Kowalski [Chlebus]
2004Randomization helps to perform independent tasks reliably
In: Random Structures and Algorithms [24], 11-41
Journal Article
1
Hide details for Chlebus, Kowalski, Shvartsman [Chlebus, Shvartsman]Chlebus, Kowalski, Shvartsman [Chlebus, Shvartsman]
2004Collective asynchronous reading with polylogarithmic worst-case overhead
In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), 321-330
Proceedings Article
1
Hide details for Chong [-]Chong [-]
1996Finding minimum spanning trees on the EREW PRAM
In: International Computer Symposium, 7-14
Proceedings Article
2
Hide details for Chong, Lam [Lam]Chong, Lam [Lam]
1998Approximating Biconnectivity in Parallel
In: Algorithmica [21], 395-410
Journal Article
1996Towards more precise parallel biconnectivity approximation
In: 7th Annual International Symposium on Algorithms and Computation, 223-232
Proceedings Article
1
Hide details for Chong, Ramos [Bilardi, Italiano, Pietracaprina, Pucci]Chong, Ramos [Bilardi, Italiano, Pietracaprina, Pucci]
1998Improved deterministic parallel padded sorting
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 405-416
Proceedings Article
1
Hide details for Christodoulou [Kao]Christodoulou [Kao]
2008Price of Anarchy
In: Encyclopedia of Algorithms, 1-99
Part of a Book
1
Hide details for Christodoulou, Chung, Ligett, Pyrga, van Stee [Chung, Ligett, Bampis, Jansen]Christodoulou, Chung, Ligett, Pyrga, van Stee [Chung, Ligett, Bampis, Jansen]
2010Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
Proceedings Article
1
Hide details for Christodoulou, Elbassioni, Fouz [Christodoulou, Fouz, Saberi]Christodoulou, Elbassioni, Fouz [Christodoulou, Fouz, Saberi]
2010Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
Proceedings Article
1
Hide details for Christodoulou, Gourves, Pascual [Gourves, Pascual, Lin]Christodoulou, Gourves, Pascual [Gourves, Pascual, Lin]
2007Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Proceedings Article
1
Hide details for Christodoulou, Koutsoupias [Koutsoupias]Christodoulou, Koutsoupias [Koutsoupias]
2009Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
Journal Article
1
Hide details for Christodoulou, Koutsoupias, Kovács [Koutsoupias, Arge, Cachin, Jurdzi´nski, Tarlecki]Christodoulou, Koutsoupias, Kovács [Koutsoupias, Arge, Cachin, Jurdzi´nski, Tarlecki]
2007Attachment IconMechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
Proceedings Article
1
Hide details for Christodoulou, Koutsoupias, Kovács [Koutsoupias, Kovács]Christodoulou, Koutsoupias, Kovács [Koutsoupias, Kovács]
2010Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18
Journal Article
1
Hide details for Christodoulou, Koutsoupias, Nanavati [Koutsoupias, Nanavati]Christodoulou, Koutsoupias, Nanavati [Koutsoupias, Nanavati]
2009Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
Journal Article
1
Hide details for Christodoulou, Koutsoupias, Vidali [Koutsoupias, Vidali, Halperin]Christodoulou, Koutsoupias, Vidali [Koutsoupias, Vidali, Halperin]
2008A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307
Proceedings Article
2
Hide details for Christodoulou, Koutsoupias, Vidali [Koutsoupias, Vidali]Christodoulou, Koutsoupias, Vidali [Koutsoupias, Vidali]
2009A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Journal Article
2007A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
Proceedings Article
1
Hide details for Christodoulou, Kovács [Kovács, Charikar]Christodoulou, Kovács [Kovács, Charikar]
2010A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016
Proceedings Article
1
Hide details for Christodoulou, Kovács, Schapira [Kovács, Schapira, Aceto, Damg{Christodoulou, Kovács, Schapira [Kovács, Schapira, Aceto, Damg{
1
Hide details for aa}rd, Goldberg, Halldórsson, Ingólfsdóttir, Walukiewicz]aa}rd, Goldberg, Halldórsson, Ingólfsdóttir, Walukiewicz]
2008Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832
Proceedings Article
1
Hide details for Christodoulou, Kovacs, van Stee [Christodoulou, Kovacs, Saberi]Christodoulou, Kovacs, van Stee [Christodoulou, Kovacs, Saberi]
2010A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193
Proceedings Article
1
Hide details for Christodoulou, Kovacs, van Stee [Christodoulou, Kovacs]Christodoulou, Kovacs, van Stee [Christodoulou, Kovacs]
2013Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Journal Article
1
Hide details for Christodoulou, Ligett, Pyrga [Christodoulou, Ligett, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, SpirakChristodoulou, Ligett, Pyrga [Christodoulou, Ligett, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]
2010Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
Proceedings Article
1
Hide details for Christodoulou, Mehlhorn, Pyrga [Christodoulou, Pyrga, Demetrescu, Halldórsson]Christodoulou, Mehlhorn, Pyrga [Christodoulou, Pyrga, Demetrescu, Halldórsson]
2011Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130
Proceedings Article
1
Hide details for Christof, Jünger, Kececioglu, Mutzel, Reinelt [Christof, Jünger, Kececioglu, Reinelt]Christof, Jünger, Kececioglu, Mutzel, Reinelt [Christof, Jünger, Kececioglu, Reinelt]
1997A Branch-And-Cut Approach to Physical Mapping of Chromosomes by Unique End-Probes
In: Journal of Computational Biology [4], 433-447
Journal Article
1
Hide details for Christof, Jünger, Kececioglu, Mutzel, Reinelt [Christoph, Jünger, Kececiolgu, Reinelt]Christof, Jünger, Kececioglu, Mutzel, Reinelt [Christoph, Jünger, Kececiolgu, Reinelt]
1997A branch-and-cut approach to physical mapping with end-probes
In: Proceedings of the 1st Annual International Conference on Computational Molecular Biology (RECOMB-97), 84-92
Proceedings Article
1
Hide details for Chrobak, Dürr, Jawor, Kowalik, Kurowski [Chrobak, Dürr, Jawor, Kurowski]Chrobak, Dürr, Jawor, Kowalik, Kurowski [Chrobak, Dürr, Jawor, Kurowski]
2006A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73
Journal Article
2
Hide details for Chrobak, Gasieniec, Kowalski [Chrobak, Gasieniec]Chrobak, Gasieniec, Kowalski [Chrobak, Gasieniec]
2007The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Journal Article
2004The 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
1
Hide details for Cilleruelo, Hebbinghaus [-]Cilleruelo, Hebbinghaus [-]
2009Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Journal Article
1
Hide details for Clanget [-]Clanget [-]
1999Attachment IconPlattformunabhängiges Toolkit für Grafische Benutzerschnittstellen (GUI)
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Clarkson, Mehlhorn, Seidel [-]Clarkson, Mehlhorn, Seidel [-]
1992Four Results on Randomized Incremental Constructions
In: Theoretical aspects of computer science (STACS-92) : 9th annual symposium, 463-474
Proceedings Article
1
Hide details for Clarkson, Mehlhorn, Seidel []Clarkson, Mehlhorn, Seidel []
1993Attachment IconFour Results on Randomized Incremental Constructions
In: Computational Geometry: Theory and Applications [3], 185-212
Journal Article
1
Hide details for Clementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri [Clementi, Crescenzi, FraigniaudClementi, Crescenzi, Doerr, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri [Clementi, Crescenzi, Fraigniaud, Isopi, Panconesi, Pasquale, Silvestri]
2013Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336
Proceedings Article
1
Hide details for Clementi, Crescenzi, Doerr, Fraigniaud, Pasquale, Silvestri [Clementi, Crescenzi, Fraigniaud, Pasquale, SilvesClementi, Crescenzi, Doerr, Fraigniaud, Pasquale, Silvestri [Clementi, Crescenzi, Fraigniaud, Pasquale, Silvestri]
2013Diffusion 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
1
Hide details for Cole, Farach-Colton, Hariharan, Przytycka, Thorup [Cole, Farach-Colton, Przytycka, Thorup]Cole, Farach-Colton, Hariharan, Przytycka, Thorup [Cole, Farach-Colton, Przytycka, Thorup]
2000An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: SIAM Journal on Computing [30], 1385-1404
Journal Article
1
Hide details for Cole, Hariharan [Cole]Cole, Hariharan [Cole]
1996An O(n log n) algorithm for the maximum agreement subtree problem for binary trees
In: 7th ACM-SIAM Symposium on Discrete Algorithms (SODA96), 323-332
Proceedings Article
1
Hide details for Cole, Hariharan, Paterson, Zwick [Cole, Paterson, Zwick]Cole, Hariharan, Paterson, Zwick [Cole, Paterson, Zwick]
1995Tighter Lower Bounds on the Exact Complexity of String Matching
In: SIAM Journal on Computing [24], 30-45
Journal Article
1
Hide details for Cole, Kowalik [-]Cole, Kowalik [-]
2008New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
Journal Article
1
Hide details for Cole, Kowalik, Skrekovski [Cole, Skrekovski]Cole, Kowalik, Skrekovski [Cole, Skrekovski]
2007A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Journal Article
1
Hide details for Cole, Ost, Schirra [Cole, Ost]Cole, Ost, Schirra [Cole, Ost]
2001Edge-Coloring Bipartite Multigraphs in O(E log D) Time
In: Combinatorica [21], 5-12
Journal Article
1
Hide details for Comes, Ziegelmann [Comes, Vitter, Zaroliagis]Comes, Ziegelmann [Comes, Vitter, Zaroliagis]
1999An Easy to Use Implementation of Linear Perturbations within CGAL
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 169-182
Proceedings Article
1
Hide details for Cooley, Fountoulakis, Kühn, Osthus [Cooley, Fountoulakis, Kühn, Osthus]Cooley, Fountoulakis, Kühn, Osthus [Cooley, Fountoulakis, Kühn, Osthus]
2009Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Journal Article
1
Hide details for Cooley, Fountoulakis, Kühn, Osthus [Cooley, Kühn, Osthus]Cooley, Fountoulakis, Kühn, Osthus [Cooley, Kühn, Osthus]
20083-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505
Journal Article
3
Hide details for Cooper, Doerr, Friedrich, Spencer [Cooper, Spencer]Cooper, Doerr, Friedrich, Spencer [Cooper, Spencer]
2010Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
Journal Article
2008Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772
Proceedings Article
2007Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Journal Article
1
Hide details for Cooper, Doerr, Spencer, Tardos [Cooper, Spencer, Tardos, Felsner]Cooper, Doerr, Spencer, Tardos [Cooper, Spencer, Tardos, Felsner]
2005Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76
Proceedings Article
1
Hide details for Cooper, Doerr, Spencer, Tardos [Cooper, Spencer, Tardos, Raman, Sedgewick, Stallmann]Cooper, Doerr, Spencer, Tardos [Cooper, Spencer, Tardos, Raman, Sedgewick, Stallmann]
2006Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197
Proceedings Article
2
Hide details for Cooper, Doerr, Spencer, Tardos [Cooper, Spencer, Tardos]Cooper, Doerr, Spencer, Tardos [Cooper, Spencer, Tardos]
2007Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
Journal Article
2006Deterministic Random Walks on the Integers
In: ??? [?], 1-27
Miscellaneous
2
Hide details for Cooper, Frieze, Mehlhorn, Priebe [Cooper, Frieze]Cooper, Frieze, Mehlhorn, Priebe [Cooper, Frieze]
2000Attachment IconAverage-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model
In: Random Structures & Algorithms [16], 33-46
Journal Article
1997Average-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
Hide details for Correa, Megow, Raman, Suchan [Correa, Suchan, Cafieri, Mucherino, Nannicini, Tarissan, Liberti]Correa, Megow, Raman, Suchan [Correa, Suchan, Cafieri, Mucherino, Nannicini, Tarissan, Liberti]
2009Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350
Proceedings Article
1
Hide details for Crauser [-]Crauser [-]
2001LEDA-SM:External Memory Algorithms and Data Structures in Theory and Practice
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Crauser, Ferragina [-]Crauser, Ferragina [-]
2002A theoretical and experimental study on the construction of suffix arrays in external memory
In: Algorithmica [32], 1-35
Journal Article
1
Hide details for Crauser, Ferragina [Ferragina, Nesetril]Crauser, Ferragina [Ferragina, Nesetril]
1999On Constructing Suffix Arrays in External Memory
In: Proceedings of the 7th Annual European Symposium on Algorithms (ESA-99), 224-235
Proceedings Article
1
Hide details for Crauser, Ferragina, Mehlhorn, Meyer, Ramos [-]Crauser, Ferragina, Mehlhorn, Meyer, Ramos [-]
1998Attachment IconRandomized 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
1
Hide details for Crauser, Ferragina, Mehlhorn, Meyer, Ramos [Ferragina, Abello, Scott]Crauser, Ferragina, Mehlhorn, Meyer, Ramos [Ferragina, Abello, Scott]
1999I/O-optimal computation of segment intersections
In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, 131-138
Proceedings Article
1
Hide details for Crauser, Ferragina, Mehlhorn, Meyer, Ramos [Ferragina]Crauser, Ferragina, Mehlhorn, Meyer, Ramos [Ferragina]
2001Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
In: International Journal of Computational Geometry & Applications [11], 305-337
Journal Article
1
Hide details for Crauser, Mehlhorn [Vitter, Zaroliagis]Crauser, Mehlhorn [Vitter, Zaroliagis]
1999Attachment IconLEDA-SM : Extending LEDA to Secondary Memory
In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, 228-242
Proceedings Article
1
Hide details for Crauser, Mehlhorn, Meyer [-]Crauser, Mehlhorn, Meyer [-]
1997Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", 113-132
Proceedings Article
1
Hide details for Crauser, Mehlhorn, Meyer, Sanders [Brim, Gruska, Zlatuska]Crauser, Mehlhorn, Meyer, Sanders [Brim, Gruska, Zlatuska]
1998Attachment IconA Parallelization of Dijkstra's Shortest Path Algorithm
In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), 722-731
Proceedings Article
1
Hide details for Crauser, Meyer, Brengel [Ferragina]Crauser, Meyer, Brengel [Ferragina]
2001An experimental study of priority queues in external memory
In: Journal of Experimental Algorithmics [5], 24
Unpublished/Draft
1
Hide details for Crochemore, Galil, Gasieniec, Park, Rytter [Crochemore, Galil, Park, Rytter]Crochemore, Galil, Gasieniec, Park, Rytter [Crochemore, Galil, Park, Rytter]
1997Constant-time Randomized Parallel String Matching
In: SIAM Journal on Computing [26], 950-960
Journal Article
1
Hide details for Crochemore, Gasieniec, Hariharan, Muthukrishnan, Rytter [Crochemore, Hariharan, Muthukrishnan, Rytter]Crochemore, Gasieniec, Hariharan, Muthukrishnan, Rytter [Crochemore, Hariharan, Muthukrishnan, Rytter]
1998A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
In: SIAM Journal on Computing [27], 668-681
Journal Article
1
Hide details for Crochemore, Gasieniec, Rytter [Carpentieri, De Santis, Vaccaro, Storer, Crochemore, Rytter]Crochemore, Gasieniec, Rytter [Carpentieri, De Santis, Vaccaro, Storer, Crochemore, Rytter]
1998Constant-space string-matching in sublinear average time
In: Compression and Complexity of SEQUENCES 1997, 230-239
Proceedings Article
2
Hide details for Croitoru [-]Croitoru [-]
2013Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013,
Proceedings Article
2012Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Croitoru, Kötzing [-]Croitoru, Kötzing [-]
2014A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45
Proceedings Article
1
Hide details for Croitoru, Kötzing [Croitoru, Kersting, Toussaint]Croitoru, Kötzing [Croitoru, Kersting, Toussaint]
2012Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82
Proceedings Article
1
Hide details for Csaba [-]Csaba [-]
2007On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Journal Article
1
Hide details for Csaba [Shokoufandeh, Szemeredi]Csaba [Shokoufandeh, Szemeredi]
2003Proof of a conjecture of Bollobas and Eldridge for graphs of maximum degree three
In: Combinatorica [23], 35-72
Journal Article
1
Hide details for Csaba, Krysta, Karpinski [Karpinski]Csaba, Krysta, Karpinski [Karpinski]
2002Approximability of Dense and Sparse Instances of Minimum 2-Connectivity, TSP and Path Problems
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 74-83
Proceedings Article
2
Hide details for Csaba, Lodha [Lodha]Csaba, Lodha [Lodha]
2006A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104
Journal Article
2001A randomized on-line algorithm for the k-server problem on a lineReport
1
Hide details for Curticapean, Künnemann [Curticapean, Bodlaender, Italiano]Curticapean, Künnemann [Curticapean, Bodlaender, Italiano]
2013A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360
Proceedings Article
1
Hide details for Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, Wahlström [Cygan, Dell, Lokshtanov, Marx, NCygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh, Wahlström [Cygan, Dell, Lokshtanov, Marx, Nederlof, Okamoto, Paturi, Saurabh]
2012On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84
Proceedings Article
1
Hide details for Cygan, Kratsch, Pilipczuk, Pilipczuk, Wahlström [Cygan, Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, WattenhoCygan, Kratsch, Pilipczuk, Pilipczuk, Wahlström [Cygan, Kratsch, Pilipczuk, Pilipczuk, Czumaj, Pitts, Wattenhofer]
2012Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265
Proceedings Article
1
Hide details for Cygan, Philip, Pilipczuk, Pilipczuk, Wojtaszczyk [Cygan, Pilipczuk, Pilipczuk, Wojtaszczyk]Cygan, Philip, Pilipczuk, Pilipczuk, Wojtaszczyk [Cygan, Pilipczuk, Pilipczuk, Wojtaszczyk]
2011Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
Journal Article
1
Hide details for Czumaj, Ferragina, Gasieniec, Muthukrishnan, Träff [Italiano, Orlando, Muthukrishnan]Czumaj, Ferragina, Gasieniec, Muthukrishnan, Träff [Italiano, Orlando, Muthukrishnan]
1997The Architecture of a Software Library for String Processing
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 166-176
Proceedings Article
1
Hide details for Czumaj, Krysta, Vöcking [Czumaj]Czumaj, Krysta, Vöcking [Czumaj]
2002Selfish Traffic Allocation for Server Farms
In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC-02), 287-296
Proceedings Article
1
Hide details for Czumaj, Vöcking [Czumaj]Czumaj, Vöcking [Czumaj]
2002Tight bounds for worst-case equilibria
In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-02), 413-420
Proceedings Article
2
Hide details for Czyzowicz, Kowalski, Markou, Pelc [Czyzowicz, Markou, Pelc]Czyzowicz, Kowalski, Markou, Pelc [Czyzowicz, Markou, Pelc]
2006Complexity of searching for a black holeUnpublished/Draft
2005Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80
Proceedings Article
1
Hide details for Dams, Hoefer, Kesselheim [Dams, Kesselheim, Afek]Dams, Hoefer, Kesselheim [Dams, Kesselheim, Afek]
2013Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
Proceedings Article
1
Hide details for Das, Fleischer, Gasieniec, Gunopulos, Kärkkäinen [Apostolico, Hein, Das, Karkkainen]Das, Fleischer, Gasieniec, Gunopulos, Kärkkäinen [Apostolico, Hein, Das, Karkkainen]
1997Episode matching
In: Combinatorial pattern matching : 8th annual symposium (CPM-97), 12-27
Proceedings Article
1
Hide details for Das, Kapoor, Smid [Chandru, Das, Kapoor, Vinay]Das, Kapoor, Smid [Chandru, Das, Kapoor, Vinay]
1996On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: Foundations of software technology and theoretical computer science (FSTTCS-96) : 16th conference, 64-75
Proceedings Article
1
Hide details for Das, Kapoor, Smid [Das, Kapoor]Das, Kapoor, Smid [Das, Kapoor]
1997On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, 447-460
In: Algorithmica [19], 447-460
Journal Article
1
Hide details for Datta, Lenhof, Schwarz, Smid [Datta]Datta, Lenhof, Schwarz, Smid [Datta]
1995Static and dynamic algorithms for k-point clustering problems
In: Journal of Algorithms [19], 474-503
Journal Article
1
Hide details for de Berg, Schirra (ed.) [de Berg]de Berg, Schirra (ed.) [de Berg]
2002Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00)Proceedings
1
Hide details for de Berg, Schirra [de Berg, de Berg]de Berg, Schirra [de Berg, de Berg]
2002Guest Editors' Foreword
In: Selected papers from the 16th Annual Symposium on Computational Geometry (SoCG-00), 1-2
Proceedings Article
1
Hide details for de Berg, van Kreveld, Schirra [de Berg, van Kreveld]de Berg, van Kreveld, Schirra [de Berg, van Kreveld]
1998Topologically correct subdivision simplification using the bandwidth criterion
In: Cartography and Geographic Information Systems [25], 243-257
Journal Article
1
Hide details for De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi [De Simone, Diehl, Jünger, Reinelt, Rinaldi]De Simone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi [De Simone, Diehl, Jünger, Reinelt, Rinaldi]
1996Exact Ground States of Two-Dimensional +-J Ising Spin Glasses
In: Journal of Statistical Physics [84], 1363-1371
Journal Article
3
Hide details for De Sterck [-]De Sterck [-]
2012A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379
Journal Article
2012A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117
Journal Article
2012Steepest Descent Preconditioning for Nonlinear GMRES OptimizationUnpublished/Draft
1
Hide details for De Sterck, Henson, Sanders [Henson, Sanders]De Sterck, Henson, Sanders [Henson, Sanders]
2011Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk RankingUnpublished/Draft
1
Hide details for De Sterck, Miller, Sanders, Winlaw [Miller, Sanders, Winlaw]De Sterck, Miller, Sanders, Winlaw [Miller, Sanders, Winlaw]
2011Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671
Journal Article
1
Hide details for Dedorath, Gergov, Hagerup [Dedorath, Staples, Eades, Katoh, Moffat]Dedorath, Gergov, Hagerup [Dedorath, Staples, Eades, Katoh, Moffat]
1995More Efficient Parallel Flow Algorithms
In: Algorithms and Computation: 6th International Symposium (ISAAC95), 234-243
Proceedings Article
1
Hide details for Dementiev [-]Dementiev [-]
2006Algorithm Engineering for Large Data Sets
Universität des Saarlandes
Thesis - PhD thesis
1
Hide details for Dementiev, Kärkkäinen, Mehnert, Sanders [Kärkkäinen]Dementiev, Kärkkäinen, Mehnert, Sanders [Kärkkäinen]
2005Attachment IconBetter External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97
Proceedings Article
1
Hide details for Dementiev, Kettner, Mehnert, Sanders [Arge, Italiano, Sedgewick]Dementiev, Kettner, Mehnert, Sanders [Arge, Italiano, Sedgewick]
2004Engineering a Sorted List Data Structure for 32 Bit Key
In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (ALENEX-04), 142-151
Proceedings Article
1
Hide details for Dementiev, Kettner, Sanders [Dementiev, Sanders, Brodal, Leonardi]Dementiev, Kettner, Sanders [Dementiev, Sanders, Brodal, Leonardi]
2005STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651
Proceedings Article
1
Hide details for Dementiev, Kettner, Sanders [Dementiev, Sanders]Dementiev, Kettner, Sanders [Dementiev, Sanders]
2005STXXL: Standard Template Library for XXL Data SetsReport
1
Hide details for Dementiev, Sanders [-]Dementiev, Sanders [-]
2003Asynchronous Parallel Disk Sorting
In: Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA-03), 138-148
Proceedings Article
1
Hide details for Dementiev, Sanders, Schultes, Sibeyn [Sibeyn, Lévy, Mayr, Mitchell]Dementiev, Sanders, Schultes, Sibeyn [Sibeyn, Lévy, Mayr, Mitchell]
2004Attachment IconEngineering an External Memory Minimum Spanning Tree Algorithm
In: 3rd IFIP International Conference on Theoretical Computer Science (TSC2004), 195-208
Proceedings Article
1
Hide details for Deng, Mahajan [Deng]Deng, Mahajan [Deng]
1997The Cost of Derandomization: Computability or Competitiveness
In: SIAM Journal on Computing [26], 786-802
Journal Article
1
Hide details for Denny [-]Denny [-]
1994Monotones Häufen und Token Distribution auf dem Hypercube
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Denny [Brunet, Fellner]Denny [Brunet, Fellner]
2003Solving geometric optimization problems using graphics hardware
In: EUROGRAPHICS 2003 : the European Association for Computer Graphics 24th Annual Conference, 441-451
Proceedings Article
1
Hide details for DeSimone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi [DeSimone, Diehl, Jünger, Reinelt, Rinaldi]DeSimone, Diehl, Jünger, Mutzel, Reinelt, Rinaldi [DeSimone, Diehl, Jünger, Reinelt, Rinaldi]
1995Exact Ground States of Ising Spin Glasses: New Experimental Results With a Branch and Cut Algorithm
In: Journal of Statistical Physics [80], 487-496
Journal Article
2
Hide details for Dessmark, Fraigniaud, Kowalski, Pelc [Dessmark, Fraigniaud, Pelc]Dessmark, Fraigniaud, Kowalski, Pelc [Dessmark, Fraigniaud, Pelc]
2006Deterministic rendezvous in graphsUnpublished/Draft
2006Attachment IconDeterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96
Journal Article
1
Hide details for Deussen, Mehlhorn [-]Deussen, Mehlhorn [-]
1977Attachment IconVan Wijngaarden Grammars and Space Complexity Class EXSPACE
In: Acta Informatica [8], 193-199
Journal Article
1
Hide details for Devillers, Golin, Kedem, Schirra [Devillers, Golin, Kedem]Devillers, Golin, Kedem, Schirra [Devillers, Golin, Kedem]
1996Queries on Voronoi Diagrams of Moving Points
In: Computational Geometry. Theory and Applications [5], 315-327
Journal Article
1
Hide details for Dey, Funke, Ramos [Dey]Dey, Funke, Ramos [Dey]
2001Surface 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
2
Hide details for Dey, Mehlhorn, Ramos [Dey]Dey, Mehlhorn, Ramos [Dey]
2000Attachment IconCurve reconstruction: Connecting dots with good reason
In: Computational Geometry [15], 229-244
Journal Article
1999Curve reconstruction: Connecting dots with good reason
In: Proceedings of the 15th Annual Symposium on Computational Geometry (SCG-99), 197-206
Proceedings Article
1
Hide details for Dhiflaoui, Funke, Kwappik, Mehlhorn, Seel, Schömer, Schulte, Weber [-]Dhiflaoui, Funke, Kwappik, Mehlhorn, Seel, Schömer, Schulte, Weber [-]
2003Attachment IconCertifying and Repairing Solutions to Large LPs - How Good are LP-Solvers?
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 255-256
Proceedings Article
1
Hide details for Dickert [-]Dickert [-]
2000Berechnung von Einfach-und Zweifachzusammenhangskomponenten auf einer PRAM
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Diedrich, Harren, Jansen, Thöle, Thomas [Diedrich, Jansen, Thöle, Thomas, Cai, Cooper, Zhu]Diedrich, Harren, Jansen, Thöle, Thomas [Diedrich, Jansen, Thöle, Thomas, Cai, Cooper, Zhu]
2007Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Proceedings Article
1
Hide details for Diedrich, Harren, Jansen, Thöle, Thomas [Diedrich, Jansen, Thöle, Thomas]Diedrich, Harren, Jansen, Thöle, Thomas [Diedrich, Jansen, Thöle, Thomas]
2008Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
Journal Article
1
Hide details for Diedrich, Kehden, Neumann [Diedrich, Kehden, Berghammer, Möller, Struth]Diedrich, Kehden, Neumann [Diedrich, Kehden, Berghammer, Möller, Struth]
2008Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98
Proceedings Article
1
Hide details for Diedrich, Neumann [Diedrich]Diedrich, Neumann [Diedrich]
2008Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833
Proceedings Article
1
Hide details for Diekert, Jez, Plandowski [Diekert, Plandowski, Hirsch, Kuznetsov, Pin, Vereshchagin]Diekert, Jez, Plandowski [Diekert, Plandowski, Hirsch, Kuznetsov, Pin, Vereshchagin]
2014Finding All Solutions of Equations in Free Groups and Monoids with Involution
In: 9th International Computer Science Symposium in Russia (CSR 2014), 1-15
Proceedings Article
1
Hide details for Diete [-]Diete [-]
1995Berechnung der Kontaktoberfläche eines Moleküls
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Dietzfelbinger, Hagerup, Katajainen, Penttonen [Dietzfelbinger, Katajainen, Penttonen]Dietzfelbinger, Hagerup, Katajainen, Penttonen [Dietzfelbinger, Katajainen, Penttonen]
1997A reliable randomized algorithm for the closest-pair problem
In: Journal of Algorithms [25], 19-51
Journal Article
1
Hide details for Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan [Dietzfelbinger, Karlin, Meyer Auf Der Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan [Dietzfelbinger, Karlin, Meyer Auf Der Heide, Rohnert, Tarjan]
1994Attachment IconDynamic Perfect Hashing: Upper and Lower Bounds
In: SIAM Journal on Computing [23], 738-761
Journal Article
2
Hide details for Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan []Dietzfelbinger, Karlin, Mehlhorn, Meyer Auf Der Heide, Rohnert, Tarjan []
1991Dynamic Perfect Hashing: Upper and Lower BoundsReport
1988Dynamic Perfect Hashing: Upper and Lower Bounds
In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), 524-531
Proceedings Article
1
Hide details for Dietzfelbinger, Mehlhorn, Meyer auf der Heide, Rohnert [-]Dietzfelbinger, Mehlhorn, Meyer auf der Heide, Rohnert [-]
1988Upper and Lower Bounds for the Dictionary Problem
In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, 214-215
Proceedings Article
1
Hide details for Dietz, Mehlhorn, Raman, Uhrig [Dietz, Raman]Dietz, Mehlhorn, Raman, Uhrig [Dietz, Raman]
1995Attachment IconLower bounds for set intersection queries
In: Algorithmica [14], 154-168
Journal Article
1
Hide details for Dietz, Mehlhorn, Raman, Uhrig []Dietz, Mehlhorn, Raman, Uhrig []
1993Lower Bounds for Set Intersection queries
In: Discrete algorithms (SODA-93) : 4th annual ACM-SIAM symposium, 194-201
Proceedings Article
2
Hide details for Diks, Hagerup [Diks]Diks, Hagerup [Diks]
1998More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Theoretical Computer Science [203], 3-29
Journal Article
1996More general parallel tree contraction: Register allocation and broadcasting in a tree
In: Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, Cadenabbia, Italy,Graph-theoretic concepts in computer science (WG-96) : 22nd international workshop, 126-140
Proceedings Article
1
Hide details for Ding [-]Ding [-]
2003Geometric Rounding without changing the Topology
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Dinitz, Garg, Goemans [Dinitz, Goemans]Dinitz, Garg, Goemans [Dinitz, Goemans]
1999On the single-source unsplittable flow problem
In: Combinatorica [19], 17-41
Journal Article
1
Hide details for Dinitz, Nutov [Dinitz]Dinitz, Nutov [Dinitz]
1999A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs
In: Journal of Algorithms [32], 21-30
Journal Article
1
Hide details for Djidjev, Pantziou, Zaroliagis [Djidjev, Mayr, Pantziou, Puech]Djidjev, Pantziou, Zaroliagis [Djidjev, Mayr, Pantziou, Puech]
1995On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204
Proceedings Article
1
Hide details for Djidjev, Pantziou, Zaroliagis [Djidjev, Pantziou, Reichel]Djidjev, Pantziou, Zaroliagis [Djidjev, Pantziou, Reichel]
1995Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200
Proceedings Article
1
Hide details for Djidjev, Pantziou, Zaroliagis [Djidjev, Pantziou]Djidjev, Pantziou, Zaroliagis [Djidjev, Pantziou]
2000Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389
Journal Article
1
Hide details for Dobkin, Gunopulos [Dobkin, Lin, Manocha]Dobkin, Gunopulos [Dobkin, Lin, Manocha]
1996Geometric problems in machine learning
In: Applied Computational Geometry: Towards Geometric Engineering (FCRC96 Workshop, WACG96), 121-132
Proceedings Article
2
Hide details for Dobrindt, Mehlhorn, Yvinec [-]Dobrindt, Mehlhorn, Yvinec [-]
1993A Complete and Efficient Algorithm for the Intersection of a General and a Convex PolyhedronReport
1993Attachment IconA Complete and Efficient Algorithm for the Intersection of a General and a Convex Polyhedron
In: Algorithms and data structures (WADS-93) : 3rd workshop, 314-324
Proceedings Article
12
Hide details for Doerr [-]Doerr [-]
2013Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Journal Article
2007Attachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Journal Article
2007Attachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
Journal Article
2007Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Journal Article
2007Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
Journal Article
2006Attachment IconMatrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112
Journal Article
2006Attachment IconNon-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659
Journal Article
2006Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99
Journal Article
2005Integral Approximation
Christian-Albrechts-Universität zu Kiel
Thesis - Habilitation thesis
2005Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068
Proceedings Article
2004Multi-color discrepancies
In: Oberwolfach Reports [1], 683-685
Journal Article
2001Vector Balancing Games with Aging
In: Electronic Notes in Discrete Mathematics [10], xx-xx
Journal Article
1
Hide details for Doerr [Albers, Alt, Näher]Doerr [Albers, Alt, Näher]
2009Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111
Part of a Book
1
Hide details for Doerr [Diekert, Durand]Doerr [Diekert, Durand]
2005Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628
Proceedings Article
1
Hide details for Doerr [Durand, Thomas]Doerr [Durand, Thomas]
2006Attachment IconGenerating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583
Proceedings Article
1
Hide details for Doerr [Krasnogor, Lanzi]Doerr [Krasnogor, Lanzi]
2011Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320
Proceedings Article
1
Hide details for Doerr [Soule, Moore]Doerr [Soule, Moore]
2012Black-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092
Proceedings Article
1
Hide details for Doerr [Thomas, Weil]Doerr [Thomas, Weil]
2007Attachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Proceedings Article
1
Hide details for Doerr, De Rainville [De Rainville]Doerr, De Rainville [De Rainville]
2013Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796
Proceedings Article
1
Hide details for Doerr, Doerr, Ebel [-]Doerr, Doerr, Ebel [-]
2013Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788
Proceedings Article
1
Hide details for Doerr, Doerr, Spöhel, Thomas [Doerr, Doerr, Spöhel, Thomas]Doerr, Doerr, Spöhel, Thomas [Doerr, Doerr, Spöhel, Thomas]
2013Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Electronic Journal Article
1
Hide details for Doerr, Eremeev, Horoba, Neumann, Theile [Eremeev, Horoba, Theile, Raidl, Rothlauf]Doerr, Eremeev, Horoba, Neumann, Theile [Eremeev, Horoba, Theile, Raidl, Rothlauf]
2009Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777
Proceedings Article
1
Hide details for Doerr, Eremeev, Neumann, Theile, Thyssen [Eremeev, Theile, Thyssen]Doerr, Eremeev, Neumann, Theile, Thyssen [Eremeev, Theile, Thyssen]
2011Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Journal Article
1
Hide details for Doerr, Fouz [-]Doerr, Fouz [-]
2006Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19
Miscellaneous
1
Hide details for Doerr, Fouz [Fouz, Aceto, Henzinger, Sgall]Doerr, Fouz [Fouz, Aceto, Henzinger, Sgall]
2011Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513
Proceedings Article
4
Hide details for Doerr, Fouz [Fouz]Doerr, Fouz [Fouz]
2011Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302
Electronic Journal Article
2011Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230
Journal Article
2010Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213
Journal Article
2009A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339
Journal Article
1
Hide details for Doerr, Fouz, Friedrich [Fouz, Friedrich, Even, Rawitz]Doerr, Fouz, Friedrich [Fouz, Friedrich, Even, Rawitz]
2012Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173
Proceedings Article
1
Hide details for Doerr, Fouz, Friedrich [Fouz, Friedrich, Fomin, Kaski]Doerr, Fouz, Friedrich [Fouz, Friedrich, Fomin, Kaski]
2012Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315
Proceedings Article
1
Hide details for Doerr, Fouz, Friedrich [Fouz, Nešetřil, Győri, Sali]Doerr, Fouz, Friedrich [Fouz, Nešetřil, Győri, Sali]
2011Social 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
Electronic Proceedings Article
2
Hide details for Doerr, Fouz, Friedrich [Fouz]Doerr, Fouz, Friedrich [Fouz]
2012Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
Journal Article
2011Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30
Proceedings Article
1
Hide details for Doerr, Fouz, Schmidt, Wahlström [Schmidt, Rothlauf]Doerr, Fouz, Schmidt, Wahlström [Schmidt, Rothlauf]
2009BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246
Proceedings Article
1
Hide details for Doerr, Fouz, Witt [Fouz, Witt, Krasnogor, Lanzi]Doerr, Fouz, Witt [Fouz, Witt, Krasnogor, Lanzi]
2011Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090
Proceedings Article
1
Hide details for Doerr, Fouz, Witt [Witt, Pelikan, Branke]Doerr, Fouz, Witt [Witt, Pelikan, Branke]
2010Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
Proceedings Article
2
Hide details for Doerr, Friedrich [-]Doerr, Friedrich [-]
2009Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
Journal Article
2006Attachment IconQuasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64
Journal Article
1
Hide details for Doerr, Friedrich [Asano]Doerr, Friedrich [Asano]
2006Attachment IconDeterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483
Proceedings Article
1
Hide details for Doerr, Friedrich, Klein, Osbild [-]Doerr, Friedrich, Klein, Osbild [-]
2007Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Journal Article
1
Hide details for Doerr, Friedrich, Klein, Osbild [Arge, Freivalds]Doerr, Friedrich, Klein, Osbild [Arge, Freivalds]
2006Attachment IconUnbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112
Proceedings Article
1
Hide details for Doerr, Friedrich, Klein, Osbild [Erlebach, Persiano]Doerr, Friedrich, Klein, Osbild [Erlebach, Persiano]
2005Attachment IconRounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109
Proceedings Article
1
Hide details for Doerr, Friedrich, Künnemann, Sauerwald [Friedrich, Künnemann, Sauerwald, Finocchi, Hershberger]Doerr, Friedrich, Künnemann, Sauerwald [Friedrich, Künnemann, Sauerwald, Finocchi, Hershberger]
2009Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153
Proceedings Article
1
Hide details for Doerr, Friedrich, Künnemann, Sauerwald [Künnemann]Doerr, Friedrich, Künnemann, Sauerwald [Künnemann]
2011Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3
Journal Article
1
Hide details for Doerr, Friedrich, Sauerwald [Sauerwald, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas]Doerr, Friedrich, Sauerwald [Sauerwald, Albers, Marchetti-Spaccamela, Matias, Nikoletseas, Thomas]
2009Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377
Proceedings Article
2
Hide details for Doerr, Friedrich, Sauerwald [Sauerwald]Doerr, Friedrich, Sauerwald [Sauerwald]
2009Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Journal Article
2008Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781
Proceedings Article
1
Hide details for Doerr, Gnewuch [Gnewuch, Keller, Heinrich, Niederreiter]Doerr, Gnewuch [Gnewuch, Keller, Heinrich, Niederreiter]
2008Construction 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
1
Hide details for Doerr, Gnewuch [Gnewuch]Doerr, Gnewuch [Gnewuch]
2006Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized roundingReport
1
Hide details for Doerr, Gnewuch, Hebbinghaus [Gnewuch]Doerr, Gnewuch, Hebbinghaus [Gnewuch]
2006Attachment IconDiscrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12
Electronic Journal Article
1
Hide details for Doerr, Gnewuch, Hebbinghaus, Neumann [Gnewuch]Doerr, Gnewuch, Hebbinghaus, Neumann [Gnewuch]
2007A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
Proceedings Article
2
Hide details for Doerr, Gnewuch, Kritzer, Pillichshammer [Gnewuch, Kritzer, Pillichshammer]Doerr, Gnewuch, Kritzer, Pillichshammer [Gnewuch, Kritzer, Pillichshammer]
2008Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149
Journal Article
2008 Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150
Journal Article
1
Hide details for Doerr, Gnewuch, Srivastav [Gnewuch, Srivastav]Doerr, Gnewuch, Srivastav [Gnewuch, Srivastav]
2005Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709
Journal Article
1
Hide details for Doerr, Gnewuch, Wahlström [Gnewuch, Chen, Srivastav, Travaglini]Doerr, Gnewuch, Wahlström [Gnewuch, Chen, Srivastav, Travaglini]
2013Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
Part of a Book
1
Hide details for Doerr, Gnewuch, Wahlström [Gnewuch, L'Ecuyer, Owen]Doerr, Gnewuch, Wahlström [Gnewuch, L'Ecuyer, Owen]
2009Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338
Proceedings Article
1
Hide details for Doerr, Gnewuch, Wahlström [Gnewuch]Doerr, Gnewuch, Wahlström [Gnewuch]
2010Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507
Journal Article
2
Hide details for Doerr, Goldberg [Goldberg, Schaefer, Cotta, Kolodziej, Rudolph]Doerr, Goldberg [Goldberg, Schaefer, Cotta, Kolodziej, Rudolph]
2010Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Proceedings Article
2010Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
Proceedings Article
1
Hide details for Doerr, Goldberg [Goldberg]Doerr, Goldberg [Goldberg]
2013Adaptive Drift Analysis
In: Algorithmica [65], 224-250
Journal Article
1
Hide details for Doerr, Goldberg, Minder, Sauerwald, Scheideler [Goldberg, Minder, Sauerwald, Scheideler, Lynch, Shvartsman]Doerr, Goldberg, Minder, Sauerwald, Scheideler [Goldberg, Minder, Sauerwald, Scheideler, Lynch, Shvartsman]
2010Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530
Proceedings Article
1
Hide details for Doerr, Goldberg, Minder, Sauerwald, Scheideler [Goldberg, Minder, Scheideler]Doerr, Goldberg, Minder, Sauerwald, Scheideler [Goldberg, Minder, Scheideler]
2011Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158
Proceedings Article
1
Hide details for Doerr, Happ [-]Doerr, Happ [-]
2008Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Proceedings Article
3
Hide details for Doerr, Happ, Klein [-]Doerr, Happ, Klein [-]
2012Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Journal Article
2011Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691
Journal Article
2007A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895
Proceedings Article
1
Hide details for Doerr, Happ, Klein [Ryan, Keijzer]Doerr, Happ, Klein [Ryan, Keijzer]
2008Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Proceedings Article
1
Hide details for Doerr, Hebbinghaus [Gnewuch, Felsner]Doerr, Hebbinghaus [Gnewuch, Felsner]
2005Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328
Proceedings Article
1
Hide details for Doerr, Hebbinghaus, Neumann [-]Doerr, Hebbinghaus, Neumann [-]
2007Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Journal Article
1
Hide details for Doerr, Hebbinghaus, Neumann [Runarsson, Beyer, Burke, Merelo-Guervós, Whitley, Yao]Doerr, Hebbinghaus, Neumann [Runarsson, Beyer, Burke, Merelo-Guervós, Whitley, Yao]
2006Attachment IconSpeeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987
Proceedings Article
1
Hide details for Doerr, Hebbinghaus, Werth [Werth]Doerr, Hebbinghaus, Werth [Werth]
2006Attachment IconImproved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132
Journal Article
1
Hide details for Doerr, Hota, Kötzing [Hota, Soule, Moore]Doerr, Hota, Kötzing [Hota, Soule, Moore]
2012Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24
Proceedings Article
1
Hide details for Doerr, Huber, Levavi [Dong, Du, Ibarra]Doerr, Huber, Levavi [Dong, Du, Ibarra]
2009Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
Proceedings Article
1
Hide details for Doerr, Huber, Levavi [Huber, Levavi]Doerr, Huber, Levavi [Huber, Levavi]
2013Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Journal Article
1
Hide details for Doerr, Jansen [Jansen]Doerr, Jansen [Jansen]
2011Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
Journal Article
1
Hide details for Doerr, Jansen, Klein [Jansen, Klein, Ryan, Keijzer]Doerr, Jansen, Klein [Jansen, Klein, Ryan, Keijzer]
2008Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Proceedings Article
1
Hide details for Doerr, Jansen, Sudholt, Winzen, Zarges [Jansen, Sudholt, Zarges, Schaefer, Cotta, Kolodziej, Rudolph]Doerr, Jansen, Sudholt, Winzen, Zarges [Jansen, Sudholt, Zarges, Schaefer, Cotta, Kolodziej, Rudolph]
2010Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51
Proceedings Article
1
Hide details for Doerr, Jansen, Sudholt, Winzen, Zarges [Jansen, Sudholt, Zarges]Doerr, Jansen, Sudholt, Winzen, Zarges [Jansen, Sudholt, Zarges]
2013Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
Journal Article
1
Hide details for Doerr, Johannsen [-]Doerr, Johannsen [-]
2007Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
Proceedings Article
1
Hide details for Doerr, Johannsen [Johannsen, Pelikan, Branke]Doerr, Johannsen [Johannsen, Pelikan, Branke]
2010Attachment IconEdge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
Proceedings Article
1
Hide details for Doerr, Johannsen [Thierens]Doerr, Johannsen [Thierens]
2007Attachment IconAdjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
Proceedings Article
1
Hide details for Doerr, Johannsen, Kötzing, Lehre, Wagner, Winzen [Lehre, Beyer, Langdon]Doerr, Johannsen, Kötzing, Lehre, Wagner, Winzen [Lehre, Beyer, Langdon]
2011Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172
Proceedings Article
1
Hide details for Doerr, Johannsen, Kötzing, Neumann, Theile [Johannsen, Neumann, Theile]Doerr, Johannsen, Kötzing, Neumann, Theile [Johannsen, Neumann, Theile]
2013More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26
Journal Article
1
Hide details for Doerr, Johannsen, Kötzing, Neumann, Theile [Theile, Schaefer, Cotta, Kolodziej, Rudolph]Doerr, Johannsen, Kötzing, Neumann, Theile [Theile, Schaefer, Cotta, Kolodziej, Rudolph]
2010More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193
Proceedings Article
1
Hide details for Doerr, Johannsen, Schmidt [Schmidt, Beyer, Langdon]Doerr, Johannsen, Schmidt [Schmidt, Beyer, Langdon]
2011Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
Proceedings Article
1
Hide details for Doerr, Johannsen, Tang [Tang, , , , , ]Doerr, Johannsen, Tang [Tang, , , , , ]
2008Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
Proceedings Article
1
Hide details for Doerr, Johannsen, Winzen [-]Doerr, Johannsen, Winzen [-]
2010Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974
Proceedings Article
2
Hide details for Doerr, Johannsen, Winzen [Johannsen]Doerr, Johannsen, Winzen [Johannsen]
2012Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Journal Article
2012Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Journal Article
1
Hide details for Doerr, Johannsen, Winzen [Pelikan, Branke]Doerr, Johannsen, Winzen [Pelikan, Branke]
2010Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
Proceedings Article
1
Hide details for Doerr, Klein [-]Doerr, Klein [-]
2006Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40
Electronic Journal Article
1
Hide details for Doerr, Klein [Arun-Kumar]Doerr, Klein [Arun-Kumar]
2006Attachment IconUnbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211
Proceedings Article
1
Hide details for Doerr, Klein, Storch [Storch]Doerr, Klein, Storch [Storch]
2007Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
Proceedings Article
1
Hide details for Doerr, Kodric, Voigt [-]Doerr, Kodric, Voigt [-]
2013Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439
Proceedings Article
1
Hide details for Doerr, Kötzing, Lengler, Winzen [Lengler]Doerr, Kötzing, Lengler, Winzen [Lengler]
2013Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
Journal Article
1
Hide details for Doerr, Kötzing, Winzen [Krasnogor, Lanzi]Doerr, Kötzing, Winzen [Krasnogor, Lanzi]
2011Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
Proceedings Article
1
Hide details for Doerr, Künnemann [-]Doerr, Künnemann [-]
2013Royal Road Functions and the (1 + λ) Evolutionary Algorithm: Almost no Speed-up from Larger Offspring Populations
In: 2013 IEEE Congress on Evolutionary Computation (CEC 2013), 424-431
Proceedings Article
1
Hide details for Doerr, Künnemann [Blum]Doerr, Künnemann [Blum]
2013How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596
Proceedings Article
1
Hide details for Doerr, Künnemann, Wahlström [Künnemann, Festa]Doerr, Künnemann, Wahlström [Künnemann, Festa]
2010Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201
Proceedings Article
1
Hide details for Doerr, Künnemann, Wahlström [Künnemann, Müller-Hannemann, Werneck]Doerr, Künnemann, Wahlström [Künnemann, Müller-Hannemann, Werneck]
2011Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106
Proceedings Article
1
Hide details for Doerr, Lengler, Kötzing, Winzen [Lengler, Krasnogor, Lanzi]Doerr, Lengler, Kötzing, Winzen [Lengler, Krasnogor, Lanzi]
2011Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988
Proceedings Article
1
Hide details for Doerr, Lengler, Steurer [Lengler, Steurer, Asano]Doerr, Lengler, Steurer [Lengler, Steurer, Asano]
2006Attachment IconThe Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327
Proceedings Article
1
Hide details for Doerr, Lorenz [Lorenz]Doerr, Lorenz [Lorenz]
2006Attachment IconError Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93
Journal Article
1
Hide details for Doerr, Moran, Moran, Winzen [-]Doerr, Moran, Moran, Winzen [-]
2012Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Electronic Journal Article
1
Hide details for Doerr, Neumann [-]Doerr, Neumann [-]
2010In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
Journal Article
1
Hide details for Doerr, Neumann, Sudholt, Witt [Neumann, Sudholt, Witt]Doerr, Neumann, Sudholt, Witt [Neumann, Sudholt, Witt]
2011Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
Journal Article
1
Hide details for Doerr, Neumann, Sudholt, Witt [Sudholt, Witt, Thierens]Doerr, Neumann, Sudholt, Witt [Sudholt, Witt, Thierens]
2007On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40
Proceedings Article
1
Hide details for Doerr, Neumann, Wegener [Wegener]Doerr, Neumann, Wegener [Wegener]
2010Editorial
In: Algorithmica [57], 119-120
Journal Article
1
Hide details for Doerr, Pohl [Soule, Moore]Doerr, Pohl [Soule, Moore]
2012Run-time analysis of the (1+1) evolutionary algorithm optimizing linear functions over a finite alphabet
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1317-1324
Proceedings Article
1
Hide details for Doerr, Schmidt, Ramakrishna [-]Doerr, Schmidt, Ramakrishna [-]
2013Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 225-236
Proceedings Article
2
Hide details for Doerr, Spöhel, Thomas, Winzen [Thomas]Doerr, Spöhel, Thomas, Winzen [Thomas]
2013Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704
Proceedings Article
2012Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012),
Proceedings Article
2
Hide details for Doerr, Srivastav [Srivastav]Doerr, Srivastav [Srivastav]
2001Multi-Color Discrepancies
In: Electronic Notes in Discrete Mathematics [7], xx-xx
Journal Article
2001Multi-Color Discrepancy of Arithmetic Progressions
In: Electronic Notes in Discrete Mathematics [8], 27-30
Journal Article
1
Hide details for Doerr, Sudholt, Witt [Sudholt, Witt]Doerr, Sudholt, Witt [Sudholt, Witt]
2013When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63
Proceedings Article
1
Hide details for Doerr, Theile [Theile, Raidl, Rothlauf]Doerr, Theile [Theile, Raidl, Rothlauf]
2009Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254
Proceedings Article
1
Hide details for Doerr, Wahlström [Finocchi, Hershberger]Doerr, Wahlström [Finocchi, Hershberger]
2009Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174
Proceedings Article
4
Hide details for Doerr, Winzen [-]Doerr, Winzen [-]
2014Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Journal Article
2012Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
Journal Article
2012Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Electronic Journal Article
2011Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Electronic Journal Article
1
Hide details for Doerr, Winzen [Dürr, Wilke]Doerr, Winzen [Dürr, Wilke]
2012Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
Electronic Proceedings Article
1
Hide details for Doerr, Winzen [Hao, Legrand, Collet, Monmarché, Lutton, Schoenauer]Doerr, Winzen [Hao, Legrand, Collet, Monmarché, Lutton, Schoenauer]
2012Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216
Proceedings Article
1
Hide details for Doerr, Winzen [Kulikov, Vereshchagin]Doerr, Winzen [Kulikov, Vereshchagin]
2011Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28
Proceedings Article
1
Hide details for Doerr, Winzen [Soule, Moore]Doerr, Winzen [Soule, Moore]
2012Reducing the arity in unbiased black-box complexity
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1309-1316
Proceedings Article
1
Hide details for Donato, Laura, Leonardi, Millozzi, Meyer, Sibeyn [Donato, Laura, Leonardi, Millozzi, Sibeyn]Donato, Laura, Leonardi, Millozzi, Meyer, Sibeyn [Donato, Laura, Leonardi, Millozzi, Sibeyn]
2006Attachment IconAlgorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236
Electronic Journal Article
1
Hide details for Dorchain [-]Dorchain [-]
1996An Implementation of a Convex Hull Algorithm Version 2.0
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Duan [-]Duan [-]
2013Attachment IconBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
Proceedings Article
1
Hide details for Duan, Mehlhorn [-]Duan, Mehlhorn [-]
2012A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8
Electronic Journal Article
1
Hide details for Dubhashi, Pantziou, Spirakis, Zaroliagis [Dubhashi, Pantziou, Spirakis]Dubhashi, Pantziou, Spirakis, Zaroliagis [Dubhashi, Pantziou, Spirakis]
1995The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140
Journal Article
1
Hide details for Dubhashi, Ranjan [Dubhashi, Ranjan]Dubhashi, Ranjan [Dubhashi, Ranjan]
1998Balls and Bins: A Study in Negative Dependence
In: Random Structures & Algorithms [13], 99-124
Journal Article
1
Hide details for Dubhashi, Ranjan, Mehlhorn, Thiel []Dubhashi, Ranjan, Mehlhorn, Thiel []
1993Attachment IconSearching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets
In: Foundations of software technology and theoretical computer science (FSTTCS-93) : 13th conference, 436-443
Proceedings Article
1
Hide details for Dumitriu [-]Dumitriu [-]
2007Attachment IconGraph-based Conservative Surface Reconstruction
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Dumitriu, Funke, Kutz, Milosavljevic]Dumitriu, Funke, Kutz, Milosavljevic [Dumitriu, Funke, Kutz, Milosavljevic]
2009How 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
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic, Gudmundsson]Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic, Gudmundsson]
2008On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281
Proceedings Article
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic]Dumitriu, Funke, Kutz, Milosavljevic [Funke, Kutz, Milosavljevic]
2008How 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
1
Hide details for Dumitriu, Funke, Kutz, Milosavljevic [Funke, Milosavljevic, Petitjean]Dumitriu, Funke, Kutz, Milosavljevic [Funke, Milosavljevic, Petitjean]
2008On 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
1
Hide details for Duncan, Goodrich, Ramos [Duncan, Goodrich]Duncan, Goodrich, Ramos [Duncan, Goodrich]
1997Efficient 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
1
Hide details for Dupont, Hemmer, Petitjean, Schömer [Dupont, Petitjean, Schömer, Arge, Hoffmann, Welzl]Dupont, Hemmer, Petitjean, Schömer [Dupont, Petitjean, Schömer, Arge, Hoffmann, Welzl]
2007Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Proceedings Article
1
Hide details for Durrett, Neumann, O'Reilly [Durrett, Neumann, O'Reilly, Beyer, Langdon]Durrett, Neumann, O'Reilly [Durrett, Neumann, O'Reilly, Beyer, Langdon]
2011Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 69-80
Proceedings Article
1
Hide details for Eades, Marks, Mutzel, North [Eades, Marks, North, Whitesides]Eades, Marks, Mutzel, North [Eades, Marks, North, Whitesides]
1998Graph Drawing Contest Report
In: Proceedings of the 6th International Symposium on Graph Drawing (GD-98), 423-435
Proceedings Article
1
Hide details for Eades, Mutzel [Eades, Atallah]Eades, Mutzel [Eades, Atallah]
1998Graph Drawing Algorithms
In: Algorithms and Theory of Computation Handbook, 9-26
Part of a Book
1
Hide details for Ebert [-]Ebert [-]
2005Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Edelkamp, Meyer [Edelkamp, Baader, Brewka, Eiter]Edelkamp, Meyer [Edelkamp, Baader, Brewka, Eiter]
2001Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), 169-184
Proceedings Article
1
Hide details for Edelsbrunner, Ramos [Edelsbrunner]Edelsbrunner, Ramos [Edelsbrunner]
1997Inclusion-exclusion complexes for pseudo-disk collections
In: Discrete and Computational Geometry [17], 287-306
Journal Article
1
Hide details for Eigensatz, Giesen, Manjunath [Giesen, Eigensatz, Morin]Eigensatz, Giesen, Manjunath [Giesen, Eigensatz, Morin]
2008The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214
Proceedings Article
3
Hide details for Eigenwillig [-]Eigenwillig [-]
2008Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Thesis - PhD thesis
2007Attachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
Journal Article
2003Attachment IconExact Arrangement Computation for Cubic Curves
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Eigenwillig, Kerber [-]Eigenwillig, Kerber [-]
2008Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
Proceedings Article
1
Hide details for Eigenwillig, Kerber, Wolpert [Wolpert, Brown]Eigenwillig, Kerber, Wolpert [Wolpert, Brown]
2007Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Proceedings Article
1
Hide details for Eigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, Wolpert [Krandick]Eigenwillig, Kettner, Krandick, Mehlhorn, Schmitt, Wolpert [Krandick]
2005Attachment IconA Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149
Proceedings Article
2
Hide details for Eigenwillig, Kettner, Schömer, Wolpert [Schömer]Eigenwillig, Kettner, Schömer, Wolpert [Schömer]
2006Attachment IconExact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73
Journal Article
2004Complete, Exact and Efficient Computations with Cubic Curves
In: Proceedings of the Twentieth Annual Symposium on Computational Geometry : (SCG'04), 409-418
Proceedings Article
2
Hide details for Eigenwillig, Kettner, Wolpert [Wolpert]Eigenwillig, Kettner, Wolpert [Wolpert]
2007Attachment IconSnap Rounding of Bézier CurvesReport
2007Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Proceedings Article
1
Hide details for Eigenwillig, Schömer, Wolpert [Schömer]Eigenwillig, Schömer, Wolpert [Schömer]
2002Sweeping Arrangements of Cubic Segments Exactly and EfficientlyReport
1
Hide details for Eigenwillig, Sharma, Yap [Sharma, Yap, Dumas]Eigenwillig, Sharma, Yap [Sharma, Yap, Dumas]
2006Attachment IconAlmost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78
Electronic Proceedings Article
1
Hide details for Eiglsperger, Fekete, Klau [Eiglsperger, Fekete, Kaufmann, Wagner]Eiglsperger, Fekete, Klau [Eiglsperger, Fekete, Kaufmann, Wagner]
2001Orthogonal Graph Drawing
In: Drawing Graphs: Methods and Models, 121-171
Part of a Book
1
Hide details for Eisenbarth, Ziviani, Gonnet, Mehlhorn, Wood [-]Eisenbarth, Ziviani, Gonnet, Mehlhorn, Wood [-]
1982Attachment IconThe Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees
In: Information and Control [55], 125-174
Journal Article
1
Hide details for Eisenbrand, Funke, Garg, Könemann [Garg, Könemann]Eisenbrand, Funke, Garg, Könemann [Garg, Könemann]
2003A 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
Proceedings Article
2
Hide details for Eisenbrand, Funke, Karrenbauer, Matijevic [-]Eisenbrand, Funke, Karrenbauer, Matijevic [-]
2008Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Journal Article
2005Attachment IconEnergy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346
Proceedings Article
1
Hide details for Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer, Spencer]Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer, Spencer]
2005Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206
Proceedings Article
1
Hide details for Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer]Eisenbrand, Funke, Karrenbauer, Reichel, Schömer [Funke, Schömer]
2007Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527
Journal Article
1
Hide details for Eisenbrand, Funke, Reichel, Schömer [Schömer, Di Battista, Zwick]Eisenbrand, Funke, Reichel, Schömer [Schömer, Di Battista, Zwick]
2003Attachment IconPacking a Trunk
In: Algorithms - ESA 2003: 11th Annual European Symposium, 618-629
Proceedings Article
1
Hide details for Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu, Azar, Erlebach]Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu, Azar, Erlebach]
2006Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755
Proceedings Article
1
Hide details for Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu]Eisenbrand, Karrenbauer, Skutella, Xu [Eisenbrand, Skutella, Xu]
2009Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Journal Article
1
Hide details for Eisenbrand, Karrenbauer, Xu [Eisenbrand, Xu, ]Eisenbrand, Karrenbauer, Xu [Eisenbrand, Xu, ]
2007Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
Proceedings Article
8
Hide details for El Kahoui [-]El Kahoui [-]
2008Attachment IconComputing with algebraic curves in generic positionMiscellaneous
2005Attachment IconBirational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71
Journal Article
2005Attachment IconUFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452
Journal Article
2005Attachment Icon$D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199
Journal Article
2004Attachment IconContants of derivations in polynomial rings over unique factorization domains
In: Proceedings of the Amercian Mathematical Society [132], 2537-2541
Journal Article
2004Attachment IconSubresultants and locally nilpotent derivations
In: Linear Algebra and its Applications [380], 253-261
Journal Article
2003Attachment IconAn elementary approach to subresultants theory
In: Journal of Symbolic Computation [35], 281-292
Journal Article
2002Attachment IconOn plane polynomial vector fields and the Poincar\'e problem
In: Electronic Journal of Differential Equations [2002], 1-23
Journal Article
1
Hide details for El Kahoui [BenBouziane, El Houari]El Kahoui [BenBouziane, El Houari]
2008Attachment IconPolynomial parametrization of nonsingular algebraic curvesMiscellaneous
1
Hide details for El Kahoui [El Houari, Gutierrez]El Kahoui [El Houari, Gutierrez]
2004Attachment IconAlgorithms for recognizing coordinates in two variables over UFD's
In: Proceedings of the 2004 International Symposium Symbolic and Algebraic Computation (ISSAC-04), 135-140
Proceedings Article
1
Hide details for El Kahoui [Gonzalez-Vega]El Kahoui [Gonzalez-Vega]
1996Attachment IconAn Improved Upper Complexity Bound for the Topology Computation of a Real Algebraic Plane Curve
In: Journal of Complexity [12], 527-544
Journal Article
1
Hide details for El Kahoui [Weber, Eberhardt]El Kahoui [Weber, Eberhardt]
2001Attachment IconImproved algorithms for linear complementarity problems arising from collision response
In: Mathematics and Computers in Simulation [56], 69-93
Journal Article
1
Hide details for El Kahoui [Weber]El Kahoui [Weber]
2000Attachment IconDeciding Hopf bifurcations by quantifier elimination in a software-component architecture
In: Journal of Symbolic Computation [30], 161-179
Journal Article
1
Hide details for El Kahoui, Rakrak [Rakrak]El Kahoui, Rakrak [Rakrak]
2007Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Journal Article
5
Hide details for Elbassioni [-]Elbassioni [-]
2009Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
Journal Article
2008A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Journal Article
2008On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Journal Article
2006On the Complexity of Monotone Boolean Duality TestingReport
2002Attachment IconOn Dualization in Products of Forests.
In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 142-153
Proceedings Article
1
Hide details for Elbassioni [Azar, Erlebach]Elbassioni [Azar, Erlebach]
2006On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351
Proceedings Article
1
Hide details for Elbassioni [Correa, Hevia, Kiwi]Elbassioni [Correa, Hevia, Kiwi]
2006Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434
Proceedings Article
1
Hide details for Elbassioni [Czumaj, Pitts, Wattenhofer]Elbassioni [Czumaj, Pitts, Wattenhofer]
2012A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
Proceedings Article
1
Hide details for Elbassioni [Katriel]Elbassioni [Katriel]
2006Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352
Journal Article
1
Hide details for Elbassioni [Rolf H. Möhring, ]Elbassioni [Rolf H. Möhring, ]
2002Attachment IconAn Algorithm for Dualization in Products of Lattices and Its Applications
In: Algorithms - ESA 2002, 10th Annual European Symposium, 424-435
Proceedings Article
1
Hide details for Elbassioni, Chalermsook, Nanongkai, Sun [Chalermsook, Nanongkai]Elbassioni, Chalermsook, Nanongkai, Sun [Chalermsook, Nanongkai]
2013Multi-Attribute Profit-Maximizing PricingUnpublished/Draft
1
Hide details for Elbassioni, Chan [Chan, Charikar]Elbassioni, Chan [Chan, Charikar]
2010A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267
Proceedings Article
1
Hide details for Elbassioni, Elmasry, Kamel [Elmasry, Kamel, Diego Calvanese, Maurizio Lenzerini, ]Elbassioni, Elmasry, Kamel [Elmasry, Kamel, Diego Calvanese, Maurizio Lenzerini, ]
2003Attachment IconAn Efficient Indexing Scheme for Multi-dimensional Moving Objects
In: Database Theory - ICDT 2003, 9th International Conference, 425-439
Proceedings Article
1
Hide details for Elbassioni, Elmasry, Kamel [Elmasry, Kamel]Elbassioni, Elmasry, Kamel [Elmasry, Kamel]
2005An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249
Journal Article
1
Hide details for Elbassioni, Elmasry, Kamel [Kamel]Elbassioni, Elmasry, Kamel [Kamel]
2008Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
Part of a Book
1
Hide details for Elbassioni, Elmasry, Makino [Makino]Elbassioni, Elmasry, Makino [Makino]
2011Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506
Journal Article
1
Hide details for Elbassioni, Fishkin, Mustafa, Sitters [Caires, Italiano, Monteiro, Palamidessi, Yung]Elbassioni, Fishkin, Mustafa, Sitters [Caires, Italiano, Monteiro, Palamidessi, Yung]
2005Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126
Proceedings Article
1
Hide details for Elbassioni, Fishkin, Sitters [Fishkin, Asano]Elbassioni, Fishkin, Sitters [Fishkin, Asano]
2006On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222
Proceedings Article
1
Hide details for Elbassioni, Fishkin, Sitters [Fishkin, Sitters]Elbassioni, Fishkin, Sitters [Fishkin, Sitters]
2009Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193
Journal Article
1
Hide details for Elbassioni, Fouad, Bertino [Fouad, Bertino]Elbassioni, Fouad, Bertino [Fouad, Bertino]
2012Modeling 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
1
Hide details for Elbassioni, Fouz, Swamy [Fouz, Swamy, Saberi]Elbassioni, Fouz, Swamy [Fouz, Swamy, Saberi]
2010Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472
Proceedings Article
1
Hide details for Elbassioni, Garg, Gupta, Kumar, Narula, Pal [Garg, Gupta, Kumar, Narula, Pal, D'Souza, Kavitha, Radhakrishnan]Elbassioni, Garg, Gupta, Kumar, Narula, Pal [Garg, Gupta, Kumar, Narula, Pal, D'Souza, Kavitha, Radhakrishnan]
2012Approximation 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
1
Hide details for Elbassioni, Hagen, Rauf [Hagen]Elbassioni, Hagen, Rauf [Hagen]
2008Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102
Proceedings Article
1
Hide details for Elbassioni, Jeli´c, Matijevi`c [Jeli´c, Matijevi`c]Elbassioni, Jeli´c, Matijevi`c [Jeli´c, Matijevi`c]
2012The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101
Journal Article
1
Hide details for Elbassioni, Katriel [Barták, Milano]Elbassioni, Katriel [Barták, Milano]
2005Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182
Proceedings Article
1
Hide details for Elbassioni, Katriel, Kutz, Mahajan [Katriel, Mahajan, Deng, Du]Elbassioni, Katriel, Kutz, Mahajan [Katriel, Mahajan, Deng, Du]
2005Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115
Proceedings Article
1
Hide details for Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija, Albers, Marion]Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija, Albers, Marion]
2009Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371
Electronic Proceedings Article
2
Hide details for Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija]Elbassioni, Krohn, Matijevic, Mestre, Severdija [Krohn, Matijevic, Severdija]
2011Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Journal Article
2009Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13
Electronic Journal Article
1
Hide details for Elbassioni, Lotker, Seidel [Lotker, Seidel]Elbassioni, Lotker, Seidel [Lotker, Seidel]
2006Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71
Journal Article
1
Hide details for Elbassioni, Makino, Mehlhorn, Ramezani [-]Elbassioni, Makino, Mehlhorn, Ramezani [-]
2013On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76
Proceedings Article
1
Hide details for Elbassioni, Makino, Rauf [Makino, Fiat, Sanders]Elbassioni, Makino, Rauf [Makino, Fiat, Sanders]
2009Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Proceedings Article
1
Hide details for Elbassioni, Makino, Rauf [Makino, Ngo]Elbassioni, Makino, Rauf [Makino, Ngo]
2009Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Proceedings Article
1
Hide details for Elbassioni, Makino, Rauf [Makino]Elbassioni, Makino, Rauf [Makino]
2011On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Journal Article
1
Hide details for Elbassioni, Matijevic, Severdija [Matijevic, Severdija, Vahrenhold]Elbassioni, Matijevic, Severdija [Matijevic, Severdija, Vahrenhold]
2010Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
Proceedings Article
1
Hide details for Elbassioni, Matijevic, Severdija [Matijevic, Severdija]Elbassioni, Matijevic, Severdija [Matijevic, Severdija]
2012Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Journal Article
1
Hide details for Elbassioni, Mustafa [-]Elbassioni, Mustafa [-]
2005Attachment IconConflict-Free Colorings of Rectangle Ranges for Wireless NetworksUnpublished/Draft
1
Hide details for Elbassioni, Mustafa [Durand, Thomas]Elbassioni, Mustafa [Durand, Thomas]
2006Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263
Proceedings Article
1
Hide details for Elbassioni, Paluch, van Zuylen [Paluch, Dürr, Wilke]Elbassioni, Paluch, van Zuylen [Paluch, Dürr, Wilke]
2012Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 501-506
Electronic Proceedings Article
1
Hide details for Elbassioni, Raman, Ray, Sitters [Raman, Sitters]Elbassioni, Raman, Ray, Sitters [Raman, Sitters]
2012On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Journal Article
1
Hide details for Elbassioni, Raman, Ray, Sitters [Ray, Sitters, Matthieu]Elbassioni, Raman, Ray, Sitters [Ray, Sitters, Matthieu]
2009On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219
Proceedings Article
1
Hide details for Elbassioni, Raman, Ray, Sitters [Sitters, Mavronicolas, Papadopoulou]Elbassioni, Raman, Ray, Sitters [Sitters, Mavronicolas, Papadopoulou]
2009Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
Proceedings Article
1
Hide details for Elbassioni, Rauf [-]Elbassioni, Rauf [-]
2010Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in GeometryUnpublished/Draft
1
Hide details for Elbassioni, Rauf [Rauf]Elbassioni, Rauf [Rauf]
2010Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Journal Article
1
Hide details for Elbassioni, Rauf, Ray [Rauf, Collette]Elbassioni, Rauf, Ray [Rauf, Collette]
2011Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
Electronic Proceedings Article
1
Hide details for Elbassioni, Rauf, Ray [Rauf]Elbassioni, Rauf, Ray [Rauf]
??On Enumerating Minimal Transversals of Geometric HypergraphsUnpublished/Draft
1
Hide details for Elbassioni, Sitters, Zhang [Sitters, Zhang, Arge, Hoffmann, Welzl]Elbassioni, Sitters, Zhang [Sitters, Zhang, Arge, Hoffmann, Welzl]
2007A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462
Proceedings Article
1
Hide details for Elbassioni, Sitters, Zhang [Sitters, Zhang]Elbassioni, Sitters, Zhang [Sitters, Zhang]
2007Attachment IconA Quasi-PTAS for Envy-free Pricing on Line GraphsUnpublished/Draft
5
Hide details for Elbassioni, Tiwary [Tiwary]Elbassioni, Tiwary [Tiwary]
2012Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Journal Article
2011On a cone covering problem
In: Computational Geometry [44], 129-134
Journal Article
2009Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Proceedings Article
2008On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Proceedings Article
2008On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Journal Article
4
Hide details for Elmasry [-]Elmasry [-]
2010Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Journal Article
2010The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Journal Article
2009Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Journal Article
2008Attachment IconViolation Heaps: A Better Substitute for Fibonacci HeapsReport
1
Hide details for Elmasry [Matthieu]Elmasry [Matthieu]
2009Attachment IconPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
Proceedings Article
1
Hide details for Elmasry, Elbassioni [-]Elmasry, Elbassioni [-]
2005Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251
Electronic Proceedings Article
1
Hide details for Elmasry, Hammad [Hammad]Elmasry, Hammad [Hammad]
2008Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Journal Article
1
Hide details for Elmasry, Jensen, Katajainen [Jensen, Katajainen, Boldi, Gargano]Elmasry, Jensen, Katajainen [Jensen, Katajainen, Boldi, Gargano]
2010The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Proceedings Article
1
Hide details for Elmasry, Jensen, Katajainen [Jensen, Katajainen, Kaplan]Elmasry, Jensen, Katajainen [Jensen, Katajainen, Kaplan]
2010Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37
Proceedings Article
2
Hide details for Elmasry, Jensen, Katajainen [Jensen, Katajainen]Elmasry, Jensen, Katajainen [Jensen, Katajainen]
2008Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Journal Article
2008Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Journal Article
1
Hide details for Elmasry, Manjunath [-]Elmasry, Manjunath [-]
2009Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Proceedings Article
1
Hide details for Elmasry, Mehlhorn, Schmidt [-]Elmasry, Mehlhorn, Schmidt [-]
2013Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121
Journal Article
1
Hide details for Elmasry, Mehlhorn, Schmidt [Elmasry]Elmasry, Mehlhorn, Schmidt [Elmasry]
2012An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
Journal Article
1
Hide details for Elmasry, Mehlhorn, Schmidt [Schmidt]Elmasry, Mehlhorn, Schmidt [Schmidt]
2010An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
Electronic Journal Article
1
Hide details for Elsaesser, Sauerwald [Elsaesser]Elsaesser, Sauerwald [Elsaesser]
2011Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Journal Article
4
Hide details for Emeliyanenko [-]Emeliyanenko [-]
2012Attachment IconComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
Electronic Journal Article
2012Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
Thesis - PhD thesis
2010Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), -
Poster
2007Attachment IconVisualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Emeliyanenko [Dou, Gruber, Joller]Emeliyanenko [Dou, Gruber, Joller]
2009Attachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Proceedings Article
1
Hide details for Emeliyanenko [Hsu, Yang, Park, Yeo]Emeliyanenko [Hsu, Yang, Park, Yeo]
2010Attachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
Proceedings Article
1
Hide details for Emeliyanenko [Moreno Maza, Roch]Emeliyanenko [Moreno Maza, Roch]
2010Attachment IconA complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43
Proceedings Article
1
Hide details for Emeliyanenko [Smari, McIntire]Emeliyanenko [Smari, McIntire]
2011Attachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
Proceedings Article
1
Hide details for Emeliyanenko, Berberich, Sagraloff [Bebis, Boyle, Parvin, Koracin, Kuno, Wang, Pajarola, Lindstrom, HinkenjannEmeliyanenko, Berberich, Sagraloff [Bebis, Boyle, Parvin, Koracin, Kuno, Wang, Pajarola, Lindstrom, Hinkenjann, Encarnação, Silva, Coming]
2009Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
Proceedings Article
2
Hide details for Emeliyanenko, Kerber [-]Emeliyanenko, Kerber [-]
2008Attachment IconAn implementation of the 2D Algebraic KernelReport
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web ApplicationReport
1
Hide details for Emeliyanenko, Kerber [Teillaud, Welzl]Emeliyanenko, Kerber [Teillaud, Welzl]
2008Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Proceedings Article
1
Hide details for Emeliyanenko, Sagraloff [van der Hoeven, van Hoeij]Emeliyanenko, Sagraloff [van der Hoeven, van Hoeij]
2012On the Complexity of Solving a Bivariate Polynomial System
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 154-161
Proceedings Article
1
Hide details for Emiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Limbach, MourraiEmiris, Hemmer, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Limbach, Mourrain, Tsigaridas, Zafeirakopoulos]
2008Cross-benchmarks of univariate algebraic kernelsReport
1
Hide details for Emiris, Hemmer, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Mourrain, Tsigaridas, ZafEmiris, Hemmer, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos [Emiris, Karavelas, Mourrain, Tsigaridas, Zafeirakopoulos]
2008Attachment IconExperimental evaluation and cross-benchmarking of univariate real solversReport
1
Hide details for Emiris, Hemmer, Tsigaridas, Tzoumas [Emiris, Tsigaridas, Tzoumas]Emiris, Hemmer, Tsigaridas, Tzoumas [Emiris, Tsigaridas, Tzoumas]
2008Voronoi diagram of ellipses: CGAL-based implementationReport
1
Hide details for Emminghaus [-]Emminghaus [-]
1995Effiziente Sortieralgorithmen für den d-dimensionalen Hypercube
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Epstein, Imreh, van Stee [Epstein, van Stee, Diks, Rytter]Epstein, Imreh, van Stee [Epstein, van Stee, Diks, Rytter]
2002More on weighted servers or FIFO is better than LRU
In: Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, 257-268
Proceedings Article
1
Hide details for Epstein, Jez, Sgall, van Stee [Epstein, Jez, Sgall, Gupta, Jansen, Rolim, Servedio]Epstein, Jez, Sgall, van Stee [Epstein, Jez, Sgall, Gupta, Jansen, Rolim, Servedio]
2012Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
Proceedings Article
1
Hide details for Epstein, Kesselman [Epstein]Epstein, Kesselman [Epstein]
2006On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285
Journal Article
1
Hide details for Epstein, Kleiman, Mestre [Epstein, Kleiman, Leonardi]Epstein, Kleiman, Mestre [Epstein, Kleiman, Leonardi]
2009Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78
Proceedings Article
1
Hide details for Epstein, Kleiman, van Stee [Epstein, Kleiman, Leonardi]Epstein, Kleiman, van Stee [Epstein, Kleiman, Leonardi]
2009Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243
Proceedings Article
1
Hide details for Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Stougie, Eisenbrand, Shepherd]
2010Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243
Proceedings Article
1
Hide details for Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Epstein, Levin, Marchetti-Spaccamela, Megow, Mestre, Skutella, Stougie [Epstein, Levin, Marchetti-Spaccamela, Stougie]
2012Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586
Journal Article
1
Hide details for Epstein, Levin, Mestre, Segev [Epstein, Levin, Segev, Marion, Schwentick]Epstein, Levin, Mestre, Segev [Epstein, Levin, Segev, Marion, Schwentick]
2010Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358
Electronic Proceedings Article
1
Hide details for Epstein, Levin, van Stee [Epstein, Levin, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]Epstein, Levin, van Stee [Epstein, Levin, Abramsky, Gavoille, Kirchner, Meyer auf der Heide, Spirakis]
2010Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
Proceedings Article
1
Hide details for Epstein, Levin, van Stee [Epstein, Levin, ]Epstein, Levin, van Stee [Epstein, Levin, ]
2013Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Proceedings Article
4
Hide details for Epstein, Levin, van Stee [Epstein, Levin]Epstein, Levin, van Stee [Epstein, Levin]
2012Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Journal Article
2011Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Journal Article
2008Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Journal Article
2008Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
Journal Article
2
Hide details for Epstein, van Stee [Epstein, Kaklamanis, Skutella]Epstein, van Stee [Epstein, Kaklamanis, Skutella]
2008Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Proceedings Article
2008Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Proceedings Article
1
Hide details for Epstein, van Stee [Epstein, Laber, Bornstein, Noguiera, Faria]Epstein, van Stee [Epstein, Laber, Bornstein, Noguiera, Faria]
2008Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Proceedings Article
1
Hide details for Epstein, van Stee [Epstein, Monien, Schroeder]Epstein, van Stee [Epstein, Monien, Schroeder]
2008Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
Proceedings Article
5
Hide details for Epstein, van Stee [Epstein]Epstein, van Stee [Epstein]
2012Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
Journal Article
2011Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Journal Article
2011On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Journal Article
2010Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Journal Article
2010Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Journal Article
1
Hide details for Epstein, van Stee, Tamir [Epstein, Tamir]Epstein, van Stee, Tamir [Epstein, Tamir]
2009Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
Journal Article
1
Hide details for Evans, Schwarz, Teich [Evans, Teich]Evans, Schwarz, Teich [Evans, Teich]
1995Automated design of two-dimensional rational decimation systems
In: Proceedings of IEEE Asilomar Conference on Signals, Systems, and Computers, 498-502
Proceedings Article
1
Hide details for Evans, Schwarz, Teich, Vainshtein, Welzl [Teich, Vainshtein, Welzl, Evans]Evans, Schwarz, Teich, Vainshtein, Welzl [Teich, Vainshtein, Welzl, Evans]
1995Minimal enclosing parallelogram with application
In: 11th Annual ACM Symposium on Computational Geometry (SCG95), C34-C35
Proceedings Article
1
Hide details for Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Lin, Manocha, Schönherr]Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Lin, Manocha, Schönherr]
1996The CGAL Kernel: A Basis for Geometric Computation
In: Applied Computational Geometry: Towards Geometric Engineering Proceedings (WACG'96), 191-202
Proceedings Article
1
Hide details for Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Schönherr]Fabri, Giezeman, Kettner, Schirra, Schönherr [Fabri, Giezeman, Kettner, Schönherr]
2000On the Design of CGAL, a computational geometry algorithms library
In: Software - Practice and Experience [30], 1167-1202
Journal Article
1
Hide details for Fanghänel, Geulen, Hoefer, Vöcking [Fanghänel, Geulen, Vöcking]Fanghänel, Geulen, Hoefer, Vöcking [Fanghänel, Geulen, Vöcking]
2013Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Journal Article
1
Hide details for Farzan, Gagie, Navarro [Gagie, Navarro, Cheong, Chwa, Park]Farzan, Gagie, Navarro [Gagie, Navarro, Cheong, Chwa, Park]
2010Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338
Proceedings Article
1
Hide details for Farzan, Munro [Munro]Farzan, Munro [Munro]
2011Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
Journal Article
1
Hide details for Fatourou, Spirakis [Spirakis]Fatourou, Spirakis [Spirakis]
2000Attachment IconEfficient Scheduling of Strict Multithreaded Computations
In: Theory of Computing Systems [33], 173-232
Journal Article
1
Hide details for Fekete, Fiethe, Friedrichs, Michalik, Orlis [Fekete, Fiethe, Friedrichs, Michalik, Orlis]Fekete, Fiethe, Friedrichs, Michalik, Orlis [Fekete, Fiethe, Friedrichs, Michalik, Orlis]
2014Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22
Proceedings Article
1
Hide details for Fekete, Friedrichs, Kröller, Schmidt [Fekete, Friedrichs, Kröller, Schmidt, Du, Zhang]Fekete, Friedrichs, Kröller, Schmidt [Fekete, Friedrichs, Kröller, Schmidt, Du, Zhang]
2013Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Proceedings Article
1
Hide details for Fekete, Skutella, Woeginger [Fekete, Woeginger]Fekete, Skutella, Woeginger [Fekete, Woeginger]
2003Attachment IconThe complexity of economic equilibria for house allocation markets
In: Information Processing Letters [88], 219-223
Journal Article
1
Hide details for Feld [-]Feld [-]
1998Analyse und Implementierung von Algorithmen zum Minimum Cost Circulation Problem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Feldmann [-]Feldmann [-]
2012Stochastic optimization with fitness proportional ant systems

Universität des Saarlandes
Thesis - Bachelor thesis
1
Hide details for Fellows, Fertin, Hermelin, Vialette [Fellows, Fertin, Vialette]Fellows, Fertin, Hermelin, Vialette [Fellows, Fertin, Vialette]
2011Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811
Journal Article
1
Hide details for Fellows, Friedrich, Hermelin, Narodytska, Rosamond [Fellows, Narodytska, Rosamond, Walsh]Fellows, Friedrich, Hermelin, Narodytska, Rosamond [Fellows, Narodytska, Rosamond, Walsh]
2011Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527
Proceedings Article
1
Hide details for Fellows, Hartman, Hermelin, Landau, Rosamond, Rozenberg [Fellows, Hartman, Landau, Rosamond, Rozenberg]Fellows, Hartman, Hermelin, Landau, Rosamond, Rozenberg [Fellows, Hartman, Landau, Rosamond, Rozenberg]
2011Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699
Journal Article
1
Hide details for Fellows, Hermelin, Rosamond [Fellows, Rosamond]Fellows, Hermelin, Rosamond [Fellows, Rosamond]
2012Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18
Journal Article
1
Hide details for Feremans, Grigoriev, Sitters [Feremans, Grigoriev]Feremans, Grigoriev, Sitters [Feremans, Grigoriev]
2006The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329
Journal Article
1
Hide details for Fernau, Fomin, Lokshtanov, Mnich, Philip, Saurabh [Fernau, Fomin, Lokshtanov, Mnich, Saurabh, Iliopoulos, F. SFernau, Fomin, Lokshtanov, Mnich, Philip, Saurabh [Fernau, Fomin, Lokshtanov, Mnich, Saurabh, Iliopoulos, F. Smyth]
2011Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Proceedings Article
1
Hide details for Fernau, Fomin, Philip, Saurabh [Fernau, Fomin, Saurabh, Thai, Sahni]Fernau, Fomin, Philip, Saurabh [Fernau, Fomin, Saurabh, Thai, Sahni]
2010Attachment IconThe 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
Hide details for Ferragina, Gross [Gross]Ferragina, Gross [Gross]
1998Optimal On-Line Search and Sublinear Time Update in String Matching
In: SIAM Journal on Computing [27], 713-736
Journal Article
1
Hide details for Fialko [-]Fialko [-]
1997Das planare Augmentierungsproblem
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Fialko, Mutzel [-]Fialko, Mutzel [-]
1998A 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
1
Hide details for Fink [-]Fink [-]
2001Oberflächenrekonstruktion von planaren Konturen
Universität des Saarlandes
Thesis - Masters thesis
1
Hide details for Finkler [-]Finkler [-]
1997Design of Efficient and Correct Algorithms: Theoretical Results and Runtime Prediction of Implementations in Practice
Universität des Saarlandes
Thesis - PhD thesis
2
Hide details for Finkler, Mehlhorn [-]Finkler, Mehlhorn [-]
1999Checking Priority Queues
In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-99), 901-902
Proceedings Article
1997Runtime 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
3
Hide details for Fleischer [-]Fleischer [-]
1999Decision trees: old and new results
In: Information and computation [152], 44-61
Journal Article
1999Effiziente und Online-Algorithmen
Universität des Saarlandes
Thesis - Habilitation thesis
1996A simple balanced search tree with $O(1)$ worst-case update time
In: International Journal of Foundations of Computer Science [7], 137-149
Journal Article
1
Hide details for Fleischer [Hsu, Kao]Fleischer [Hsu, Kao]
1998On the Bahncard problem
In: Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON-98), 65-74
Proceedings Article
1
Hide details for Fleischer [Lodi, Pagli, Santoro]Fleischer [Lodi, Pagli, Santoro]
1999FUN with implementing algorithms
In: Proceedings of the International Conference on FUN with Algorithms (FUN-98), 88-98
Proceedings Article
1
Hide details for Fleischer, Fries, Mehlhorn, Meiser, Näher, Rohnert, Schirra, Simon, Tsakalidis, Uhrig [, ]Fleischer, Fries, Mehlhorn, Meiser, Näher, Rohnert, Schirra, Simon, Tsakalidis, Uhrig [, ]
1992Selected Topics from Computational Geometry, Data Structures and Motion Planning
In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 25-43
Part of a Book
1
Hide details for Fleischer, Jung, Mehlhorn [Jung]Fleischer, Jung, Mehlhorn [Jung]
1995A communication-randomness tradeoff for two-processor systems
In: Information and Computation [116], 155-161
Journal Article
1
Hide details for Fleischer, Jung, Mehlhorn [, ]Fleischer, Jung, Mehlhorn [, ]
1991A Time-Randomness Tradeoff for Communication Complexity
In: Distributed Algorithms, 4th International Workshop, 390-401
Proceedings Article
2
Hide details for Fleischer, Mehlhorn, Rote, Welzl, Yap []Fleischer, Mehlhorn, Rote, Welzl, Yap []
1992Simultaneous Inner and Outer Approximation of Shapes
In: Algorithmica [8], 365-389
Journal Article
1990On Simultaneous Inner and Outer Approximation of Shapes
In: Computational geometry (SCG-90) : 6th annual symposium, 216-224
Proceedings Article
1
Hide details for Fleischer, Skutella [Fleischer]Fleischer, Skutella [Fleischer]
2003Attachment IconMinimum Cost Flows Over Time without Intermediate Storage
In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03), 66-75
Proceedings Article
1
Hide details for Fleischer, Wahl [Paterson]Fleischer, Wahl [Paterson]
2000Online scheduling revisited
In: Algorithms - ESA 2000, Proceedings of the 8th Annual European Symposium (ESA-00), 202-210
Proceedings Article
1
Hide details for Fogel, Halperin, Kettner, Teillaud, Wein, Wolpert [Fogel, Halperin, Teillaud, Wein, Boissonnat, Teillaud]Fogel, Halperin, Kettner, Teillaud, Wein, Wolpert [Fogel, Halperin, Teillaud, Wein, Boissonnat, Teillaud]
2007Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Part of a Book
1
Show details for Follert, Schömer, Sellen, Smid, Thiel [Follert, Schömer, Sellen, Thiagarajan]Follert, Schömer, Sellen, Smid, Thiel [Follert, Schömer, Sellen, Thiagarajan]

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