| Year | Author/Editor | | Title | Type |
|---|
| ?? | Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh | | On Enumerating Minimal Transversals of Geometric Hypergraphs | Unpublished/Draft |
| 2015 | Bei, Xiaohui | | Solving Linear Programming with Constraints Unknown
In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I., 129-142 | Proceedings Article |
| 2015 | Heydrich, Sandy
van Stee, Rob | | Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61 | Journal Article |
| 2015 | Issac, Davis | | Sampling in Space Restricted Settings
In: Computing and Combinatorics 2015, | Proceedings Article |
| 2014 | Babenko, Maxim A.
Gawrychowski, Pawel
Kociumaka, Tomasz
Starikovskaya, Tatiana A. | | Computing Minimal and Maximal Suffixes of a Substring Revisited
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 30-39 | Proceedings Article |
| 2014 | Bringmann, Karl
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He | | Balls into bins via local search: cover time and maximum load
In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), accepted | Proceedings Article |
| 2014 | Croitoru, Cosmina
Kötzing, Timo | | A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45 | Proceedings Article |
| 2014 | Diekert, Volker
Jez, Artur
Plandowski, Wojciech | | Finding 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 |
| 2014 | Doerr, Benjamin
Winzen, Carola | | Ranking-Based Black-Box Complexity
In: Algorithmica [?], ? | Journal Article |
| 2014 | Fekete, Sándor P.
Fiethe, Björn
Friedrichs, Stephan
Michalik, Harald
Orlis, Christos | | Efficient reconfiguration of processing modules on FPGAs for space instruments
In: Adaptive Hardware and Systems (AHS), 2014 NASA/ESA Conference on, 15-22 | Proceedings Article |
| 2014 | Friedrichs, Stephan
Kulau, Ulf
Wolf, Lars | | Energy-efficient voltage scheduling of peripheral components on wireless sensor nodes
In: Communications Workshops (ICC), 2014 IEEE International Conference on, 860-865 | Proceedings Article |
| 2014 | Gagie, Travis
Gawrychowski, Pawel
Kärkkäinen, Juha
Nekrich, Yakov
Puglisi, Simon J. | | LZ77-Based Self-indexing with Faster Pattern Matching
In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, 731-742 | Proceedings Article |
| 2014 | Gawrychowski, Pawel | | Simple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41 | Journal Article |
| 2014 | Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz | | Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372 | Journal Article |
| 2014 | Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk | | Testing Generalised Freeness of Words
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 337-349 | Proceedings Article |
| 2014 | Gawrychowski, Pawel
Mozes, Shay
Weimann, Oren | | Improved Submatrix Maximum Queries in Monge Matrices
In: Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, 525-537 | Proceedings Article |
| 2014 | Gawrychowski, Pawel
Uznanski, Przemyslaw | | Order-Preserving Pattern Matching with k Mismatches
In: Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings, 130-139 | Proceedings Article |
| 2014 | Jez, Artur | | A really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191 | Proceedings Article |
| 2014 | Jez, Artur | | Context Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255 | Proceedings Article |
| 2014 | Jez, Artur | | The Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718 | Journal Article |
| 2014 | Jez, Artur
Lohrey, Markus |  | Approximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457 | Proceedings Article |
| 2014 | Jez, Artur
Okhotin, Alexander | | Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94 | Journal Article |
| 2013 | Adamaszek, Anna
Wiese, Andreas | | Approximation Schemes for Maximum Weight Independent Set of Rectangles
In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2013), | Proceedings Article |
| 2013 | Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Doerr, Carola
Larsen, Kasper Green
Mehlhorn, Kurt | | The Query Complexity of Finding a Hidden Permutation
In: Space-Efficient Data Structures, Streams, and Algorithms, 1-11 | Part of a Book |
| 2013 | Agrawal, Manindra
Saha, Chandan
Saxena, Nitin | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: 45th ACM Symposium on the Theory of Computing (STOC-13), toappear | Proceedings Article |
| 2013 | Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine | | A Framework for the Verification of Certifying Computations | Unpublished/Draft |
| 2013 | Alvarez, Victor
Bringmann, Karl
Ray, Saurabh
Seidel, Raimund | | Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89 | Proceedings Article |
| 2013 | Anagnostopoulos, Aris
Grandoni, Fabrizio
Leonardi, Stefano
Wiese, Andreas | | Constant Integrality Gap LP formulations of Unsplittable Flow on a Path
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article |
| 2013 | Anand, S
Bringmann, Karl
Friedrich, Tobias
Garg, Naveen
Kumar, Amit | | Minimizing maximum (weighted) flow-time on related and unrelated machines
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 13-24 | Proceedings Article |
| 2013 | Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin | | Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60 | Proceedings Article |
| 2013 | Antoniadis, Antonios
Huang, Chien-Chung
Ott, Sebastian
Verschae, José | | How to Pack Your Items When You Have to Buy Your Knapsack
In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, 62-73 | Proceedings Article |
| 2013 | Bannai, Hideo
Gawrychowski, Pawel
Inenaga, Shunsuke
Takeda, Masayuki | | Converting SLP to LZ78 in almost Linear Time
In: Combinatorial Pattern Matching, 24th Annual Symposium (CPM 2013), 38-49 | Proceedings Article |
| 2013 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32 | Journal Article |
| 2013 | Bogdan, Paul
Sauerwald, Thomas
Stauffer, Alexandre
Sun, He | | Balls into Bins via Local Search
In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), 16-34 | Electronic Proceedings Article |
| 2013 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Megow, Nicole
Wiese, Andreas | | Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks
In: Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), | Proceedings Article |
| 2013 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Wiese, Andreas | | Feasibility Analysis in the Sporadic DAG Task Model
In: Proceedings of the 25th Euromicro Conference on Real-Time Systems (ECRTS 2013), | Proceedings Article |
| 2013 | Bringmann, Karl | | Bringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218 | Proceedings Article |
| 2013 | Bringmann, Karl
Doerr, Benjamin
Neumann, Adrian
Sliacan, Jakub | | Online Checkpointing with Improved Worst-Case Guarantees
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), 255-266 | Proceedings Article |
| 2013 | Bringmann, Karl
Engels, Christian
Manthey, Bodo
Raghavendra Rao, B. V. | | Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 219-230 | Proceedings Article |
| 2013 | Bringmann, Karl
Friedrich, Tobias | | Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290 | Journal Article |
| 2013 | Bringmann, Karl
Friedrich, Tobias | | Exact and Efficient Generation of Geometric Random Variates and Random Graphs
In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), 267-278 | Proceedings Article |
| 2013 | Bringmann, Karl
Friedrich, Tobias | | Parameterized Average-Case Complexity of the Hypervolume Indicator
In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), 575-582 | Proceedings Article |
| 2013 | Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas | | Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29 | Journal Article |
| 2013 | Bringmann, Karl
Green Larsen, Kasper | | Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782 | Proceedings Article |
| 2013 | Cai, Jin-Yi
Lu, Pinyan
Xia, Mingji | | Dichotomy for Holant* Problems with a Function on Domain Size 3
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1278-1295 | Proceedings Article |
| 2013 | Case, John
Kötzing, Timo | | Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123 | Electronic Journal Article |
| 2013 | Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob | | Maximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19 | Journal Article |
| 2013 | Christodoulou, George
Kovacs, Annamaria
van Stee, Rob | | A truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98 | Journal Article |
| 2013 | Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Isopi, Marc
Panconesi, Alessandro
Pasquale, Francesco
Silvestri, Riccardo | | Rumor Spreading in Random Evolving Graphs
In: Proc. of the 21st European Symposium on Algorithms (ESA 2013), 325-336 | Proceedings Article |
| 2013 | Clementi, Andrea
Crescenzi, Pierluigi
Doerr, Carola
Fraigniaud, Pierre
Pasquale, Francesco
Silvestri, Riccardo | | Diffusion probabiliste dans les reseaux dynamiques
In: Proc. of the 15èmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications (AlgoTel 2013), | Proceedings Article |
| 2013 | Croitoru, Cosmina | | Abstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013, | Proceedings Article |
| 2013 | Curticapean, Radu
Künnemann, Marvin | | A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems
In: 21st Annual European Symposium on Algorithms (ESA 2013), 349-360 | Proceedings Article |
| 2013 | Dams, Johannes
Hoefer, Martin
Kesselheim, Thomas | | Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357 | Proceedings Article |
| 2013 | Doerr, Benjamin | | Improved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749 | Journal Article |
| 2013 | Doerr, Benjamin
Doerr, Carola
Ebel, Franziska | | Lessons From the Black-Box: Fast Crossover-Based Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 781-788 | Proceedings Article |
| 2013 | Doerr, Benjamin
Doerr, Carola
Spöhel, Reto
Thomas, Henning | | Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22 | Electronic Journal Article |
| 2013 | Doerr, Benjamin
Goldberg, Leslie Ann | | Adaptive Drift Analysis
In: Algorithmica [65], 224-250 | Journal Article |
| 2013 | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | | Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793 | Journal Article |
| 2013 | Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine | | Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27 | Journal Article |
| 2013 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine | | More effective crossover operators for the all-pairs shortest path problem
In: Theoretical Computer Science [471], 12-26 | Journal Article |
| 2013 | Doerr, Benjamin
Kodric, Bojana
Voigt, Marco | | Lower bounds for the runtime of a global multi-objective evolutionary algorithm
In: IEEE Congress on Evolutionary Computation, 432-439 | Proceedings Article |
| 2013 | Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola | | Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106 | Journal Article |
| 2013 | Doerr, Benjamin
Künnemann, Marvin | | How the (1+λ) Evolutionary Algorithm Optimizes Linear Functions
In: 15th Annual Conference on Genetic and Evolutionary Computation Conference (GECCO '13), 1589-1596 | Proceedings Article |
| 2013 | Doerr, Benjamin
Künnemann, Marvin | | Royal 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 |
| 2013 | Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola | | Playing Mastermind with many colors
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 695-704 | Proceedings Article |
| 2013 | Doerr, Benjamin
Sudholt, Dirk
Witt, Carsten | | When Do Evolutionary Algorithms Optimize Separable Functions in Parallel?
In: ACM/SIGEVO Foundations of Genetic Algorithms (FOGA 2013), 51-63 | Proceedings Article |
| 2013 | Doerr, Carola
De Rainville, François-Michel | | Constructing Low Star Discrepancy Point Sets with Genetic Algorithms
In: Proc. of Genetic and Evolutionary Computation Conference (GECCO 2013), 789-796 | Proceedings Article |
| 2013 | Doerr, Carola
Gnewuch, Michael
Wahlström, Magnus | | Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55 | Part of a Book |
| 2013 | Doerr, C.
Schmidt, Jens M.
Ramakrishna, G. | | Computing 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 |
| 2013 | Duan, Ran | | Breaking 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 |
| 2013 | Elbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He | | Multi-Attribute Profit-Maximizing Pricing | Unpublished/Draft |
| 2013 | Elbassioni, Khaled M.
Makino, Kazuhisa
Mehlhorn, Kurt
Ramezani, Fahimeh | | On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets
In: 19th Annual International Computing and Combinatorics Conference (COCOON-13), 65-76 | Proceedings Article |
| 2013 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | | Every DFS tree of a 3-connected graph contains a contractible edge
In: Journal of Graph Theory [72], 112-121 | Journal Article |
| 2013 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | A 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 |
| 2013 | Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold | | Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91 | Journal Article |
| 2013 | Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane | | Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220 | Proceedings Article |
| 2013 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-? | Journal Article |
| 2013 | Gagie, Travis
Gawrychowski, Pawel
Nekrich, Yakov | | Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150 | Proceedings Article |
| 2013 | Gawrychowski, Pawel | | Alphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48 | Proceedings Article |
| 2013 | Gawrychowski, Pawel
Kucherov, Gregory
Nekrich, Yakov
Starikovskaya, Tatiana | | Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 2013), | Proceedings Article |
| 2013 | Gawrychowski, Pawel
Manea, Florin
Mercas, Robert
Nowotka, Dirk
Tiseanu, Catalin | | Finding Pseudo-repetitions
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 257-268 | Proceedings Article |
| 2013 | Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk | | Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219 | Proceedings Article |
| 2013 | Gawrychowski, Pawel
Straszak, Damian | | Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88 | Proceedings Article |
| 2013 | Günther, Elisabeth
Maurer, Olaf
Megow, Nicole
Wiese, Andreas | | A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
In: 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), | Proceedings Article |
| 2013 | Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander | | Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215 | Journal Article |
| 2013 | Heydrich, Sandy
van Stee, Rob | | Dividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433 | Proceedings Article |
| 2013 | Hoefer, Martin | | Local Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35 | Journal Article |
| 2013 | Hoefer, Martin | | Strategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53 | Journal Article |
| 2013 | Hoefer, Martin
Kesselheim, Thomas | | Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101 | Proceedings Article |
| 2013 | Hoefer, Martin
Kesselheim, Thomas
Vöcking, Berthold | | Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582 | Proceedings Article |
| 2013 | Hoefer, Martin
Sauerwald, Thomas | | Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56 | Proceedings Article |
| 2013 | Hoefer, Martin
Skopalik, Alexander | | Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21 | Journal Article |
| 2013 | Hoefer, Martin
Skopalik, Alexander | | On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453 | Journal Article |
| 2013 | Hoefer, Martin
Wagner, Lisa | | Designing Profit Shares in Matching and Coalition Formation Games
In: 9th Conference on Web and Internet Economics (WINE-13), 249-262 | Proceedings Article |
| 2013 | Hoefer, Martin
Wagner, Lisa | | Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631 | Proceedings Article |
| 2013 | Jez, Artur | | Approximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176 | Proceedings Article |
| 2013 | Jez, Artur | | One-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335 | Proceedings Article |
| 2013 | Jez, Artur | | Recompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244 | Proceedings Article |
| 2013 | Jez, Artur | | Recompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26 | Proceedings Article |
| 2013 | Jez, Artur
Maletti, Andreas | | Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830 | Journal Article |
| 2013 | Jez, Artur
Okhotin, Alexander | | Unambiguous Conjunctive Grammars over a One-Letter Alphabet
In: 17th International Conference on Developments in Language Theory (DLT 2013), 277-288 | Proceedings Article |
| 2013 | Jurkiewicz, Tomasz | | Toward Better Computation Models for Modern Machines
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2013 | Jurkiewicz, Tomasz
Mehlhorn, Kurt | | The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments, | Proceedings Article |
| 2013 | Khosla, Megha | | Balls into Bins Made Faster
In: Algorithms - ESA 2013, | Proceedings Article |
| 2013 | Kobel, Alexander
Sagraloff, Michael | | Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17 | Electronic Journal Article |
| 2013 | Kollias, Konstantinos | | Nonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440 | Electronic Journal Article |
| 2013 | Megow, Nicole
Mestre, Julian | | Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints
In: 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), | Proceedings Article |
| 2013 | Megow, Nicole
Verschae, Jose | | Dual techniques for scheduling on a machine with varying speed
In: Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), 745–756 | Proceedings Article |
| 2013 | Mehlhorn, Kurt
Neumann, A.
Schmidt, Jens M. | | Certifying 3-Edge-Connectivity
In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'13), 358-369 | Proceedings Article |
| 2013 | Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming | | From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870], | Electronic Journal Article |
| 2013 | Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas | | Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456 | Proceedings Article |
| 2013 | Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning | | Explosive percolation in Erdös-Rényi-like random graph processes
In: Combinatorics, Probability and Computing [22], 133-145 | Journal Article |
| 2013 | Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin | | A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69 | Electronic Journal Article |
| 2013 | Sanders, Peter
Singler, Johannes
van Stee, Rob | | Real-time prefetching and caching
In: Journal of Scheduling [16], 47-58 | Journal Article |
| 2013 | Schmidt, Jens M. | | A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776 | Proceedings Article |
| 2013 | Schmidt, Jens M. | | A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244 | Journal Article |
| 2013 | Schmidt, Jens M. | | Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535 | Journal Article |
| 2013 | Schmidt, Jens M. | | Contractions, Removals and How to Certify 3-Connectivity in Linear Time | Unpublished/Draft |
| 2013 | Sviridenko, Maxim
Wiese, Andreas | | Approximating the Configuration-LP for Minimizing Weighted Sum of Completion Times on Unrelated Machines
In: Proceedings of the 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), | Proceedings Article |
| 2013 | van Stee, Rob | | SIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125 | Journal Article |
| 2013 | Wahlström, Magnus | | Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
In: 29th International Symposium on Theoretical Aspects of Computer Science (STACS-13), | Electronic Proceedings Article |
| 2013 | Winzen, Carola | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926 | Journal Article |
| 2013 | Yap, Chee
Sagraloff, Michael
Sharma, Vikram | | Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests | Unpublished/Draft |
| 2012 | Abed, Fidaa
Huang, Chien-Chung | | Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23 | Proceedings Article |
| 2012 | Afshani, Peyman
Agrawal, Manindra
Doerr, Benjamin
Green Larsen, Kasper
Mehlhorn, Kurt
Winzen, Carola | | The Query Complexity of Finding a Hidden Permutation
In: Electronic Colloquium on Computational Complexity (ECCC): Report Series [87 (Revision 1)], 1-36 | Electronic Journal Article |
| 2012 | Agrawal, Manindra
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin | | Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 599-614 | Proceedings Article |
| 2012 | Agrawal, Manindra
Saha, Chandan
Saxena, Nitin | | Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13 | Electronic Journal Article |
| 2012 | Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Edo
van Zuylen, Anke | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: SIAM Journal on Computing [41], 1110-1121 | Journal Article |
| 2012 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh | | Conflict-free coloring for rectangle ranges using O(n .382) colors
In: Discrete & Computational Geometry [48], 39-52 | Journal Article |
| 2012 | Akbari, Hoda
Berenbrink, Petra
Sauerwald, Thomas | | A simple approach for adapting continuous load balancing processes to discrete settings
In: PODC'12 : Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, 271-280 | Proceedings Article |
| 2012 | Alcaraz, Nicolas
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch
Baumbach, Jan | | Efficient key pathway mining: combining networks and OMICS data
In: Integrative Biology [4], 756-764 | Journal Article |
| 2012 | Alvarez, Victor
Bringmann, Karl
Curticapean, Radu
Ray, Saurabh | | Counting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68 | Proceedings Article |
| 2012 | Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen | | Scheduling Real-Time Mixed-Criticality Jobs
In: IEEE Transactions on Computers [61], 1140-1152 | Journal Article |
| 2012 | Baumbach, Jan
Friedrich, Tobias
Kötzing, Timo
Krohmer, Anton
Müller, Joachim
Pauling, Josch | | Efficient algorithms for extracting biological key pathways with global constraints
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 169-176 | Proceedings Article |
| 2012 | Becker, Ruben | | The Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes | Thesis - Bachelor thesis |
| 2012 | Belfrage, Michael
Mütze, Torsten
Spöhel, Reto | | Probabilistic one-player Ramsey games via deterministic two-player games
In: SIAM Journal on Discrete Mathematics [26], 1031-1049 | Journal Article |
| 2012 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46 | Electronic Journal Article |
| 2012 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | | Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989 | Journal Article |
| 2012 | Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: ACM Transactions on Algorithms [9], 601-619 | Journal Article |
| 2012 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780 | Journal Article |
| 2012 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian | | A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049 | Journal Article |
| 2012 | Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish | | Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133 | Journal Article |
| 2012 | Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish | | Physarum Can Compute Shortest Paths
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 233-240 | Proceedings Article |
| 2012 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | Every Stochastic Game with Perfect Information Admits a Canonical Form
In: 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), | Unpublished/Draft |
| 2012 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | On Nash equilibria and improvement cycles in pure positional strategies for Chess-like and Backgammon-like n-person games
In: Discrete Mathematics [312], 772-788 | Journal Article |
| 2012 | Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika | | Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178 | Journal Article |
| 2012 | Bringmann, Karl | | An improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233 | Journal Article |
| 2012 | Bringmann, Karl
Friedrich, Tobias | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116 | Journal Article |
| 2012 | Bringmann, Karl
Friedrich, Tobias | | Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464 | Proceedings Article |
| 2012 | Bringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian | | Remarks on Category-Based Routing in Social Networks | Unpublished/Draft |
| 2012 | Bringmann, Karl
Panagiotou, Konstantinos | | Efficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144 | Proceedings Article |
| 2012 | Canzar, Stefan
El-Kebir, Mohammed
Pool, Rene
Elbassioni, Khaled
Malde, Alpeshkumar K.
Mark, Alan E.
Geerke, Daan P.
Stougie, Leen
Klau, Gunnar W. | | Charge Group Partitioning in Biomolecular Simulation
In: Research in Computational Molecular Biology : 16th Annual International Conference, RECOMB 2012, 29-43 | Proceedings Article |
| 2012 | Case, John
Kötzing, Timo | | Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596 | Journal Article |
| 2012 | Case, John
Kötzing, Timo | | Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73 | Journal Article |
| 2012 | Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung | | Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
In: Algorithmica [62], 1088-1111 | Journal Article |
| 2012 | Chan, Ho-Leung
Megow, Nicole
Sitters, René
van Stee, Rob | | A note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18 | Journal Article |
| 2012 | Chen, Xujin
Doerr, Benjamin
Hu, Xiaodong
Ma, Weidong
van Stee, Rob
Winzen, Carola | | The Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433 | Proceedings Article |
| 2012 | Croitoru, Cosima | | Algorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes | Thesis - Master's thesis |
| 2012 | Croitoru, Cosmina
Kötzing, Timo | | Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82 | Proceedings Article |
| 2012 | Cygan, Marek
Dell, Holger
Lokshtanov, Daniel
Marx, Daniel
Nederlof, Jesper
Okamoto, Yoshio
Paturi, Ramamohan
Saurabh, Saket
Wahlström, Magnus | | On Problems as Hard as CNF-SAT
In: 2012 IEEE 27th Conference on Computational Complexity (CCC 2012), 74-84 | Proceedings Article |
| 2012 | Cygan, Marek
Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus | | Clique Cover and Graph Separation: New Incompressibility Results
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 254-265 | Proceedings Article |
| 2012 | De Sterck, Hans | | A Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379 | Journal Article |
| 2012 | De Sterck, Hans | | A Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117 | Journal Article |
| 2012 | De Sterck, Hans | | Steepest Descent Preconditioning for Nonlinear GMRES Optimization | Unpublished/Draft |
| 2012 | Doerr, Benjamin | | Black-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 |
| 2012 | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | | Asynchronous rumor spreading in preferential attachment graphs
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 307-315 | Proceedings Article |
| 2012 | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | | Experimental analysis of rumor spreading in social networks
In: Design and Analysis of Algorithms First Mediterranean Conference on Algorithms, MedAlg 2012, 159-173 | Proceedings Article |
| 2012 | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | | Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75 | Journal Article |
| 2012 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33 | Journal Article |
| 2012 | Doerr, Benjamin
Hota, Ashish
Kötzing, Timo | | Ants easily solve stochastic shortest path problems
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 17-24 | Proceedings Article |
| 2012 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Multiplicative Drift Analysis
In: Algorithmica [64], 673-697 | Journal Article |
| 2012 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86 | Journal Article |
| 2012 | Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola | | Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18 | Electronic Journal Article |
| 2012 | Doerr, Benjamin
Pohl, Sebastian | | Run-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 |
| 2012 | Doerr, Benjamin
Spöhel, Reto
Thomas, Henning
Winzen, Carola | | Playing Mastermind with Many Colors
In: Proc. of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), | Proceedings Article |
| 2012 | Doerr, Benjamin
Winzen, Carola | | Black-box complexity: Breaking the O(n logn) barrier of LeadingOnes
In: Artificial Evolution 10th International Conference Evolution Artificielle, EA 2011, 205-216 | Proceedings Article |
| 2012 | Doerr, Benjamin
Winzen, Carola | | Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34 | Journal Article |
| 2012 | Doerr, Benjamin
Winzen, Carola | | Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452 | Electronic Proceedings Article |
| 2012 | Doerr, Benjamin
Winzen, Carola | | Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27 | Electronic Journal Article |
| 2012 | Doerr, Benjamin
Winzen, Carola | | Reducing 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 |
| 2012 | Duan, Ran
Mehlhorn, Kurt | | A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8 | Electronic Journal Article |
| 2012 | Elbassioni, Khaled | | A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524 | Proceedings Article |
| 2012 | Elbassioni, Khaled
Fouad, Mohamed
Bertino, Elisa | | Modeling the Risk & Utility of Information Sharing in Social Networks
In: 2012 ASE/IEEE International Conference on Privacy, Security, Risk and Trust and
2012 ASE/IEEE International Conference on Social Computing : SocialCom/PASSAT 2012, 441-450 | Proceedings Article |
| 2012 | Elbassioni, Khaled
Garg, Naveen
Gupta, Divya
Kumar, Amit
Narula, Vishal
Pal, Arindam | | Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2012, 267-275 | Electronic Proceedings Article |
| 2012 | Elbassioni, Khaled
Jeli´c, Slobodan
Matijevi`c, Domagoj | | The relation of Connected Set Cover and Group Steiner Tree
In: Theoretical Computer Science [438], 96-101 | Journal Article |
| 2012 | Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj | | Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151 | Journal Article |
| 2012 | Elbassioni, Khaled
Paluch, Katarzyna
van Zuylen, Anke | | Simpler 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 |
| 2012 | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René | | On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77 | Journal Article |
| 2012 | Elbassioni, Khaled
Tiwary, Hans Raj | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61 | Journal Article |
| 2012 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | | An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766 | Journal Article |
| 2012 | Emeliyanenko, Pavel | | Computing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14 | Electronic Journal Article |
| 2012 | Emeliyanenko, Pavel | | Harnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2012 | Emeliyanenko, Pavel
Sagraloff, Michael | | On 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 |
| 2012 | Epstein, Leah
Jez, Lukasz
Sgall, Jiri
van Stee, Rob | | Online 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 |
| 2012 | Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen | | Universal sequencing on an unreliable machine
In: SIAM Journal on Computing [41], 565-586 | Journal Article |
| 2012 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Approximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129 | Journal Article |
| 2012 | Epstein, Leah
van Stee, Rob | | The price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54 | Journal Article |
| 2012 | Feldmann, Matthias | | Stochastic optimization with fitness proportional ant systems
Universität des Saarlandes | Thesis - Bachelor thesis |
| 2012 | Fellows, Michael R.
Hermelin, Danny
Rosamond, Fraces A. | | Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications
In: Algorithmica [64], 3-18 | Journal Article |
| 2012 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333 | Journal Article |
| 2012 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Sauerwald, Thomas | | Ultra-fast rumor spreading in social networks
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1642-1660 | Proceedings Article |
| 2012 | Fouz, Mahmoud | | Randomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2012 | Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas | | Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771 | Journal Article |
| 2012 | Friedrich, Tobias
Kroeger, Trent
Neumann, Frank | | Weighted preferences in evolutionary multi-objective optimization
In: International Journal of Machine Learning and Cybernetics [Online First], 1-10 | Electronic Journal Article |
| 2012 | Gawrychowski, Pawel | | Faster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236 | Proceedings Article |
| 2012 | Gawrychowski, Pawel | | Simple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242 | Proceedings Article |
| 2012 | Gawrychowski, Pawel | | Tying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635 | Electronic Proceedings Article |
| 2012 | Giakkoupis, George
Sauerwald, Thomas | | Rumor spreading and vertex expansion
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1623-1641 | Proceedings Article |
| 2012 | Giakkoupis, George
Sauerwald, Thomas
Sun, He
Woelfel, Philipp | | Low Randomness Rumor Spreading via Hashing
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 314-325 | Electronic Proceedings Article |
| 2012 | Giannopoulos, Panos
Knauer, Christian
Wahlström, Magnus
Werner, Daniel | | Hardness of discrepancy computation and ε-net verification in high dimension
In: Journal of Complexity [28], 162-176 | Journal Article |
| 2012 | Gnewuch, Michael
Wahlström, Magnus
Winzen, Carola | | A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting
In: SIAM Journal on Numerical Analysis [50], 781-807 | Journal Article |
| 2012 | Harren, Rolf
Kern, Walter | | Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218 | Proceedings Article |
| 2012 | Harren, Rolf
van Stee, Rob | | Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75 | Journal Article |
| 2012 | Heinz, Jeffrey
Kasprzik, Anna
Kötzing, Timo | | Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127 | Journal Article |
| 2012 | Hermelin, Danny
Mestre, Julian
Rawitz, Dror | | Optimization Problems in Dotted Interval Graphs
In: Graph-Theoretic Concepts in Computer Science : 38th InternationalWorkshop, WG 2012, 46-56 | Proceedings Article |
| 2012 | Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan | | Parameterized complexity of induced H-matching on claw-free graphs
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 624-635 | Proceedings Article |
| 2012 | Hermelin, Danny
Rizzi, Romeo
Vialette, Stephane | | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
In: Algorithms and Computation : 23rd International Symposium, ISAAC 2012, 465-474 | Proceedings Article |
| 2012 | Hermelin, Danny
Wu, Xi | | Weak compositions and their applications to polynomial lower bounds for kernelization
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 104-113 | Proceedings Article |
| 2012 | Heydrich, Sandy | | Dividing connected chores fairly
Universität des Saarlandes | Thesis - Bachelor thesis |
| 2012 | Höhn, Wiebke
Jacobs, Tobias
Megow, Nicole | | On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309 | Journal Article |
| 2012 | Huang, Chien-Chung | | Non-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260 | Proceedings Article |
| 2012 | Jain, Sanjay
Kötzing, Timo
Stephan, Frank | | Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50 | Proceedings Article |
| 2012 | Kane, Daniel
Mehlhorn, Kurt
Sauerwald, Thomas
Sun, He | | Counting Arbitrary Subgraphs in Data Streams
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 598-609 | Proceedings Article |
| 2012 | Kavitha, Telikepalli
Mestre, Julián | | Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14 | Journal Article |
| 2012 | Kayal, Neeraj
Saha, Chandan | | On the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15 | Journal Article |
| 2012 | Kerber, Michael
Sagraloff, Michael | | A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258 | Journal Article |
| 2012 | Kim, Eun Jung
Paul, Christophe
Philip, Geevarghese | | A Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130 | Proceedings Article |
| 2012 | Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj | | Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85 | Journal Article |
| 2012 | Kötzing, Timo
Molter, Hendrik | | ACO beats EA on a dynamic pseudo-Boolean function
In: Parallel Problem Solving from Nature - PPSN XII : 12th International Conference, 113-122 | Proceedings Article |
| 2012 | Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten | | Theoretical analysis of two ACO approaches for the traveling salesman problem
In: Swarm Intelligence [6], 1-21 | Journal Article |
| 2012 | Kötzing, Timo
Sutton, Andrew M.
Neumann, Frank
O'Reilly, Una-May | | The max problem revisited: the importance of mutation in genetic programming
In: GECCO’12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1333-1340 | Proceedings Article |
| 2012 | Kratsch, Stefan
Pilipczuk, Marcin
Pilipczuk, Michał
Wahlström, Magnus | | Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
In: Automata, Languages, and Programming ; 39th International Colloquium, ICALP 2012, 581-593 | Proceedings Article |
| 2012 | Kratsch, Stefan
Wahlström, Magnus | | Compression via matroids: a randomized polynomial kernel for odd cycle transversal
In: Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 94-103 | Proceedings Article |
| 2012 | Kratsch, Stefan
Wahlström, Magnus | | Representative Sets and Irrelevant Vertices: New Tools for Kernelization
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 450-459 | Proceedings Article |
| 2012 | Krivelevich, Michael
Spöhel, Reto | | Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686 | Journal Article |
| 2012 | Krohmer, Anton | | Finding cliques in scale-free networks
Universität des Saarlandes | Thesis - Master's thesis |
| 2012 | Lokshtanov, Daniel
Saurabh, Saket
Wahlström, Magnus | | Subexponential Parameterized Odd Cycle Transversal on Planar Graphs
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 424-434 | Electronic Proceedings Article |
| 2012 | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | | Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72 | Journal Article |
| 2012 | Megow, Nicole
Skutella, Martin
Verschae, Jose
Wiese, Andreas | | The Power of Recourse for Online MST and TSP
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 689-700 | Proceedings Article |
| 2012 | Mehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M. | | Certifying 3-Edge-Connectivity | Unpublished/Draft |
| 2012 | Meyerhenke, Henning
Sauerwald, Thomas | | Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361 | Journal Article |
| 2012 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket | | On Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75 | Journal Article |
| 2012 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath | | FPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146 | Journal Article |
| 2012 | Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
Suchy, Ondrej | | Beyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423 | Electronic Proceedings Article |
| 2012 | Molter, Hendrik | | ACO beats EA on a dynamic pseudo-Boolean function
Universität des Saarlandes | Thesis - Master's thesis |
| 2012 | Moran, Shay | | Shattering extremal systems
Universität des Saarlandes | Thesis - Master's thesis |
| 2012 | Nor, Igor
Hermlin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier
Sagot, Marie-France | | Mod/Resc Parsimony Inference: Theory and application
In: Information and Computation [213], 23-32 | Journal Article |
| 2012 | Ott, Sebastian | | Thou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes | Thesis - Master's thesis |
| 2012 | Panagiotou, Konstantinos
Coja-Oghlan, Amin | | Catching the k-NAESAT Threshold
In: STOC’12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, 899-907 | Proceedings Article |
| 2012 | Panagiotou, Konstantinos
Sinha, Makrand | | Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130 | Journal Article |
| 2012 | Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath | | Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
In: ACM Transactions on Algorithms [9], 23 | Journal Article |
| 2012 | P. Gao | | Distribution of the number of spanning regular subgraphs in random graphs | Unpublished/Draft |
| 2012 | P. Gao | | Distributions of sparse spanning subgraphs in random graphs | Unpublished/Draft |
| 2012 | P. Gao | | Uniform generation of d-factors in dense host graphs | Unpublished/Draft |
| 2012 | Qian, Jiawei
Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke | | On the Integrality Gap of the Subtour LP for the 1,2-TSP
In: LATIN 2012: Theoretical Informatics ; 10th Latin American Symposium, 606-617 | Proceedings Article |
| 2012 | Sagraloff, Michael | | Exaktes geometrisches Rechnen | Miscellaneous |
| 2012 | Sagraloff, Michael | | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 297-304 | Proceedings Article |
| 2012 | Sauerwald, Thomas
Sun, He | | Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), 341-350 | Proceedings Article |
| 2012 | Schalekamp, Frans
Williamson, David P.
van Zuylen, Anke | | A proof of the Boyd-Carr conjecture
In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-12), 1477-1486 | Proceedings Article |
| 2012 | Schmidt, Jens M. | | Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797 | Proceedings Article |
| 2012 | Schmidt, Jens M. | | Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208 | Journal Article |
| 2012 | Schmidt, Jens M.
Valtr, Pavel | | Cubic Plane Graphs on a Given Point Set
In: Proceedings of the Twenty-Eighth Annual Symposium on Computational Geometry (SCG'12), 201-208 | Proceedings Article |
| 2012 | Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio | | Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83 | Journal Article |
| 2012 | van Stee, Rob | | An improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74 | Journal Article |
| 2012 | van Stee, Rob | | SIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136 | Journal Article |
| 2012 | van Stee, Rob | | SIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129 | Journal Article |
| 2012 | van Zuylen, Anke | | Simpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197 | Proceedings Article |
| 2012 | Wang, Pengming | | Certification of Curve Arrangements
Universität des Saarlandes | Thesis - Master's thesis |
| 2011 | Ailon, Nir
Avigdor-Elgrabli, Noa
Liberty, Noa
van Zuylen, Anke | | Improved Approximation Algorithms for Bipartite Correlation Clustering
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 25-36 | Proceedings Article |
| 2011 | Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article |
| 2011 | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian | | Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361 | Journal Article |
| 2011 | Althaus, Ernst
Kupilas, Joschka
Naujoks, Rouven | | On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
In: Theory and Applications of Models of Computation : 8th Annual Conference, TAMC 2011, 308-319 | Proceedings Article |
| 2011 | Anand, S.
Garg, Naveen
Megow, Nicole | | Meeting deadlines: How much speed suffices?
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011. - Pt. I, 232-243 | Proceedings Article |
| 2011 | Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket | | Algorithmic Aspects of Dominator Colorings in Graphs
In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, 19-30 | Proceedings Article |
| 2011 | Asano, Tetsuo
Doerr, Benjamin | | Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319 | Proceedings Article |
| 2011 | Auger, Doerr (ed.) | | Theory of Randomized Search Heuristics | Book |
| 2011 | Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk | | Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582 | Journal Article |
| 2011 | Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror | | Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364 | Journal Article |
| 2011 | Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen | | Mixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566 | Proceedings Article |
| 2011 | Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth | | Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26 | Journal Article |
| 2011 | Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter | | Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319 | Journal Article |
| 2011 | Ben-Zwi, Oren
Hermelin, Danny
Lokshtanov, Daniel
Newman, Ilan | | Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96 | Journal Article |
| 2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Electronic Journal Article |
| 2011 | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article |
| 2011 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47 | Proceedings Article |
| 2011 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Electronic Journal Article |
| 2011 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | | Deconstructing Approximate Offsets
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 187-196 | Proceedings Article |
| 2011 | Berberich, Eric
Hemmer, Michael
Kerber, Michael | | A Generic Algebraic Kernel for Non-linear Geometric Applications
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 179-186 | Proceedings Article |
| 2011 | Berenbrink, Petra
Cooper, Colin
Friedetzky, Tom
Friedrich, Tobias
Sauerwald, Thomas | | Randomized Diffusion for Indivisible Loads
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 429-439 | Proceedings Article |
| 2011 | Berenbrink, Petra
Friedetzky, Tom
Elsaesser, Robert
Nagel, Lars
Sauerwald, Thomas | | Faster Coupon Collecting via Replication with Applications in Gossiping
In: 36th International Symposium on Mathematical Foundations of Computer Science (MFCS-11), 72-83 | Proceedings Article |
| 2011 | Berenbrink, Petra
Hoefer, Martin
Sauerwald, Thomas | | Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497 | Proceedings Article |
| 2011 | Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen | | Minimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20 | Journal Article |
| 2011 | Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen | | The Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641 | Journal Article |
| 2011 | Boros, Endre
Elbassioni, Khaled
Fouz, Mahmoud
Gurvich, Vladimir
Makino, Kazuhisa
Manthey, Bodo | | Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 147-158 | Proceedings Article |
| 2011 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games | Unpublished/Draft |
| 2011 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | | The negative cycles polyhedron and hardness of checking some polyhedral properties
In: Annals of Operations Research [188], 63-76 | Journal Article |
| 2011 | Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese | | Pattern-Guided Data Anonymization and Clustering
In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, 182-193 | Proceedings Article |
| 2011 | Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese | | The Effect of Homogeneity on the Complexity of $k$-Anonymity
In: Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings, 53-64 | Proceedings Article |
| 2011 | Bringmann, Karl
Friedrich, Tobias | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article |
| 2011 | Bringmann, Karl
Friedrich, Tobias
Neumann, Frank
Wagner, Markus | | Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 | Proceedings Article |
| 2011 | Busch, Philip Johannes | | Analysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes | Thesis - Bachelor thesis |
| 2011 | Canzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian | | On Tree-Constrained Matchings and Generalizations | Unpublished/Draft |
| 2011 | Canzar,Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian | | On Tree-Constrained Matchings and Generalizations
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 98-109 | Proceedings Article |
| 2011 | Case, John
Kötzing, Timo | | Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331 | Electronic Proceedings Article |
| 2011 | Celikik, Marjan
Bast, Holger
Manolache, Gabriel | | Efficient Index-Based Snippet Generation | Unpublished/Draft |
| 2011 | Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk | | Nonclairvoyant speed scaling for flow and energy
In: Algorithmica [61], 507-517 | Journal Article |
| 2011 | Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei | | Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403 | Electronic Proceedings Article |
| 2011 | Chan, T.-H. Hubert
Elbassioni, Khaled | | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Discrete & Computational Geometry [46], 704-723 | Journal Article |
| 2011 | Chin, Francis Y. L.
Guo, Zeyu
Sun, He | | Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722 | Journal Article |
| 2011 | Christodoulou, George
Mehlhorn, Kurt
Pyrga, Evangelia | | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Proceedings Article |
| 2011 | Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry | | Dominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000 | Journal Article |
| 2011 | De Sterck, Hans
Henson, Van Emden
Sanders, Geoff | | Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking | Unpublished/Draft |
| 2011 | De Sterck, Hans
Miller, Killian
Sanders, Geoff
Winlaw, Manda | | Recursively accelerated multilevel aggregation for Markov chains
In: SIAM Journal on Scientific Computing [32], 1652-1671 | Journal Article |
| 2011 | Doerr, Benjamin | | Drift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320 | Proceedings Article |
| 2011 | Doerr, Benjamin
Eremeev, Anton
Neumann, Frank
Theile, Madeleine
Thyssen, Christian | | Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035 | Journal Article |
| 2011 | Doerr, Benjamin
Fouz, Mahmoud | | Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513 | Proceedings Article |
| 2011 | Doerr, Benjamin
Fouz, Mahmoud | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | Electronic Journal Article |
| 2011 | Doerr, Benjamin
Fouz, Mahmoud | | Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230 | Journal Article |
| 2011 | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | | Social Networks Spread Rumors in Sublogarithmic Time
In: STOC'11 : Proceedings of the 43rd ACM Symposium on Theory of Computing, 21-30 | Proceedings Article |
| 2011 | Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias | | Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308 | Electronic Proceedings Article |
| 2011 | Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten | | Sharp bounds by probability-generating functions and variable drift
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2083-2090 | Proceedings Article |
| 2011 | Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas | | Quasirandom Rumor Spreading: An Experimental Analysis
In: ACM Journal of Experimental Algorithmics [16], Article No. 3.3 | Journal Article |
| 2011 | Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian | | Stabilizing consensus with the power of two choices
In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA-11), 149-158 | Proceedings Article |
| 2011 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
In: Evolutionary Computation [19], 673-691 | Journal Article |
| 2011 | Doerr, Benjamin
Jansen, Thomas | | Theory of Evolutionary Computation
In: Algorithmica [59], 299-300 | Journal Article |
| 2011 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Lehre, Per Christian
Wagner, Markus
Winzen, Carola | | Faster 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 |
| 2011 | Doerr, Benjamin
Johannsen, Daniel
Schmidt, Martin | | Runtime 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 |
| 2011 | Doerr, Benjamin
Kötzing, Timo
Winzen, Carola | | Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article |
| 2011 | Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus | | Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | Proceedings Article |
| 2011 | Doerr, Benjamin
Lengler, Johannes
Kötzing, Timo
Winzen, Carola | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article |
| 2011 | Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten | | Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644 | Journal Article |
| 2011 | Doerr, Benjamin
Winzen, Carola | | Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7 | Electronic Journal Article |
| 2011 | Doerr, Benjamin
Winzen, Carola | | Towards 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 |
| 2011 | Durrett, Greg
Neumann, Frank
O'Reilly, Una-May | | Computational 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 |
| 2011 | Elbassioni, Khaled
Elmasry, Amr
Makino, Kazuhisa | | Finding Simplices containing the Origin in Two and Three Dimensions
In: International Journal of Computational Geometry & Applications [21], 495-506 | Journal Article |
| 2011 | Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463 | Journal Article |
| 2011 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | | On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304 | Journal Article |
| 2011 | Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh | | Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Electronic Proceedings Article |
| 2011 | Elbassioni, Khaled
Tiwary, Hans Raj | | On a cone covering problem
In: Computational Geometry [44], 129-134 | Journal Article |
| 2011 | Elsaesser, Robert
Sauerwald, Thomas | | Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641 | Journal Article |
| 2011 | Emeliyanenko, Pavel | | High-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 |
| 2011 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Max-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250 | Journal Article |
| 2011 | Epstein, Leah
van Stee, Rob | | Improved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92 | Journal Article |
| 2011 | Epstein, Leah
van Stee, Rob | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1 | Journal Article |
| 2011 | Farzan, Arash
Munro, J. Ian | | Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678 | Journal Article |
| 2011 | Fellows, Michael R.
Fertin, Guillaume
Hermelin, Danny
Vialette, Stephane | | Upper and lower bounds for finding connected motifs in vertex-colored graphs
In: Journal of Computer and System Sciences [77], 799-811 | Journal Article |
| 2011 | Fellows, Michael R.
Friedrich, Tobias
Hermelin, Danny
Narodytska, Nina
Rosamond, Frances A. | | Constraint Satisfaction Problems: Convexity Makes All Different Constraints Tractable
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 522-527 | Proceedings Article |
| 2011 | Fellows, Michael R.
Hartman, Tzvika
Hermelin, Danny
Landau, Gad M.
Rosamond, Frances A.
Rozenberg, Liat | | Haplotype Inference Constrained by Plausible Haplotype Data
In: IEEE/ACM Transactions on Computational Biology and Bioinformatics [8], 1692-1699 | Journal Article |
| 2011 | Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket | | Ranking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, | Proceedings Article |
| 2011 | Fomin, Fedor V.
Lokshtanov, Daniel
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket | | Hitting forbidden minors: Approximation and Kernelization
In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 189-200 | Proceedings Article |
| 2011 | Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve | | Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175 | Proceedings Article |
| 2011 | Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny | | Average Case Parameterized Complexity | Unpublished/Draft |
| 2011 | Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos | | The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236 | Proceedings Article |
| 2011 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | 3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412 | Journal Article |
| 2011 | Friedrich, Tobias
Bringmann, Karl
Voss, Thomas
Igel, Christian | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | Proceedings Article |
| 2011 | Friedrich, Tobias
Hebbinghaus, Nils | | Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758 | Journal Article |
| 2011 | Friedrich, Tobias
Horoba, Christian
Neumann, Frank | | Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556 | Journal Article |
| 2011 | Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre | | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
In: 22nd International Symposium on Algorithms and Computation (ISAAC-11), 190-199 | Proceedings Article |
| 2011 | Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan | | Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138 | Journal Article |
| 2011 | Funke, Stefan
Laue, Soeren
Lotker, Zvi
Naujoks, Rouven | | Power assignment problems in wireless communication: Covering points by disks, reaching few receivers quickly, and energy-efficient travelling salesman tours
In: Ad Hoc Networks [9], 1028-1035 | Journal Article |
| 2011 | Gao, Pu (Jane) | | Distribution of spanning regular subgraphs in random graphs | Unpublished/Draft |
| 2011 | Gugelmann, Luca
Spöhel, Reto | | On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 | Electronic Proceedings Article |
| 2011 | Guo, Zeyu
Sun, He
Zhu, Hong | | Greedy Construction of 2-Approximate Minimum Manhattan Networks
In: International Journal of Computational Geometry and Applications [21], 331-350 | Journal Article |
| 2011 | Harren, Rolf
Jansen, Klaus
Prädel, Lars
van Stee, Rob | | A (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487 | Proceedings Article |
| 2011 | Hemmer, Michael
Dupon, Laurent
Petitjean, Sylvain
Schomer, Elmar | | A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
In: Journal of Symbolic Computation [46], 467-494 | Journal Article |
| 2011 | Hermelin, Danny
Huang, Chien-Chung
Kratsch, Stefan
Wahlström, Magnus | | Parameterized Two-Player Nash Equilibrium
In: Graph-Theoretic Concepts in Computer Science : 37th International Workshop, WG 2011, 215-226 | Proceedings Article |
| 2011 | Hermelin, Danny
Levy, Avivit
Weimann, Oren
Yuster, Raphael | | Distance Oracles for Vertex-Labeled Graphs
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 490-501 | Proceedings Article |
| 2011 | Hermelin, Danny
Mnich, Matthias
van Leeuwen, Erik Jan
Woeginger, Gerhard J. | | Domination When the Stars Are Out
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 462-473 | Proceedings Article |
| 2011 | Hermelin, Danny
Rawitz, Dror | | Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594 | Journal Article |
| 2011 | Huang, Chien-Chung
Kavitha, Telikepalli | | Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA), | Proceedings Article |
| 2011 | Huang, Chien-Chung
Kavitha, Telikepalli | | Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP), | Proceedings Article |
| 2011 | Huang, Chien-Chung
Kavitha, Telikepalli
Michael, Dimitrios
Nasr, Meghana | | Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757 | Journal Article |
| 2011 | Ingalalli, Vijay | | Evolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes | Thesis - Master's thesis |
| 2011 | Jurkiewicz, Tomasz
Danilewski, Piotr | | Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Unpublished/Draft |
| 2011 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488 | Journal Article |
| 2011 | Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana | | Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690 | Journal Article |
| 2011 | Kayal, Neeraj
Saha, Chandan | | On the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299 | Proceedings Article |
| 2011 | Kerber, Michael
Sagraloff, Michael | | A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430 | Journal Article |
| 2011 | Kerber, Michael
Sagraloff, Michael | | Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216 | Proceedings Article |
| 2011 | Kobel, Alexander | | Certified numerical root finding
Universität des Saarlandes | Thesis - Master's thesis |
| 2011 | Kötzing, Timo | | Iterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54 | Proceedings Article |
| 2011 | Kötzing, Timo
Neumann, Frank
Spöhel, Reto | | PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096 | Proceedings Article |
| 2011 | Kötzing, Timo
Neumann, Frank
Sudholt, Dirk
Wagner, Markus | | Simple max-min ant systems and the optimization of linear pseudo-Boolean functions
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 209-218 | Proceedings Article |
| 2011 | Kötzing, Timo
Sudholt, Dirk
Theile, Madeleine | | How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996 | Proceedings Article |
| 2011 | Mainberger, Markus
Hoffmann, Sebastian
Weickert, Joachim
Tang, Ching Hoo
Johannsen, Daniel
Neumann, Frank
Doerr, Benjamin | | Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 | Proceedings Article |
| 2011 | Manjunath, Madhusudan
Mehlhorn, Kurt
Panagiotou, Konstantinos
Sun, He | | Approximate Counting of Cycles in Streams
In: 19th Annual European Symposium on Algorithms (ESA-11), 677-688 | Proceedings Article |
| 2011 | Manjunath, Madhusudan
Sharma, Vikram | | Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649 | Journal Article |
| 2011 | Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal | | Online Graph Exploration: New Results on Old and New Algorithms
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 478-489 | Proceedings Article |
| 2011 | Megow, Nicole
Möhring, Rolf H.
Schulz, Jens | | Decision Support and Optimization in Shutdown and Turnaround Scheduling
In: INFORMS Journal on Computing [23], 189 - 204 | Journal Article |
| 2011 | Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | | Certifying algorithms
In: Computer Science Review [5], 119-161 | Journal Article |
| 2011 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528 | Journal Article |
| 2011 | Mehlhorn, Kurt
Sagraloff, Michael | | A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90 | Journal Article |
| 2011 | Milosavljevic, Nikola
Morozov, Dmitriy
Skraba, Primoz | | Zigzag Persistent Homology in Matrix Multiplication Time
In: Proceedings of the 27th Annual Symposium on Computational Geometry (SCG'11), 216-225 | Proceedings Article |
| 2011 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket | | On Parameterized Independent Feedback Vertex Set
In: Computing and Combinatorics - 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings, 98-109 | Proceedings Article |
| 2011 | Müller, Tobias
Perez-Gimenez, Xavier
Wormald, Nicholas | | Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322 | Journal Article |
| 2011 | Mütze, Torsten
Rast, Thomas
Spöhel, Reto | | Coloring random graphs online without creating monochromatic subgraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 145-158 | Proceedings Article |
| 2011 | Mütze, Torsten
Spöhel, Reto | | On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33 | Electronic Journal Article |
| 2011 | Mütze, Torsten
Spöhel, Reto | | On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 | Electronic Proceedings Article |
| 2011 | Neumann, Adrian | | Implementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes | Thesis - Master's thesis |
| 2011 | Neumann, Frank
Reichel, Joachim
Skutella, Martin | | Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342 | Journal Article |
| 2011 | Panagiotou, Konstantinos
Spöhel, Reto
Steger, Angelika
Thomas, Henning | | Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704 | Electronic Proceedings Article |
| 2011 | Panagiotou, Konstantinos
Steger, Angelika | | On the Degree Sequence of Random Planar Graphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1198-1210 | Proceedings Article |
| 2011 | Pemmaraju, Sriram V.
Raman, Rajiv
Varadarajan, Kasturi | | Max-coloring and online coloring with bandwidths on interval graphs
In: ACM Transactions on Algorithms [7], 35:1-35:21 | Journal Article |
| 2011 | Philip, Geevarghese | | The Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute | Thesis - Doctoral dissertation |
| 2011 | Rizkallah, Christine | | Glivenko and Kuroda for Simple Type Theory | Unpublished/Draft |
| 2011 | Rizkallah, Christine | | Maximum Cardinality Matching
In: Archive of Formal Proofs, | Electronic Journal Article |
| 2011 | Sagraloff, Michael | | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21 | Electronic Journal Article |
| 2011 | Sagraloff, Michael
Yap, Chee | | A Simple But Exact and Efficient Algorithm for Complex Root Isolation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 353-360 | Proceedings Article |
| 2011 | Sauerwald, Thomas
Stauffer, Alexandre | | Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475 | Proceedings Article |
| 2011 | Shervashidze, Nino
Schweitzer, Pascal
van Leeuwen, Erik Jan
Mehlhorn, Kurt
Borgwardt, Karsten M. | | Weisfeiler-Lehman graph kernels
In: Journal of Machine Learning Research [12], 2539-2561 | Journal Article |
| 2011 | van Stee, Rob | | An improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260 | Proceedings Article |
| 2011 | van Zuylen, Anke | | An improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427 | Journal Article |
| 2011 | van Zuylen, Anke | | Deterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151 | Journal Article |
| 2011 | van Zuylen, Anke | | Linear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561 | Journal Article |
| 2011 | van Zuylen, Anke
Schalekamp, Frans
Williamson, David P. | | Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | Electronic Proceedings Article |
| 2011 | Wagner, Markus
Veeramachaneni, Kalyan
Neumann, Frank
O'Reilly, Una-May | | Optimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10 | Proceedings Article |
| 2011 | Wahlström, Magnus | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282 | Journal Article |
| 2011 | Winzen, Carola | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts | Unpublished/Draft |
| 2011 | Winzen, Carola | | Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2010 | Ajwani, Deepak
Friedrich, Tobias | | Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250 | Journal Article |
| 2010 | Althaus, Ernst
Altmeyer, Sebastian
Naujoks, Rouven | | A New Combinatorial Approach to Parametric Path Analysis | Report |
| 2010 | Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S. | | On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25 | Proceedings Article |
| 2010 | Amini, Omid
Manjunath, Madhusudan | | Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Electronic Journal Article |
| 2010 | Angelopoulos, Spyros | | On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12 | Proceedings Article |
| 2010 | Angelopoulos, Spyros
Borodin, Allan | | Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558 | Journal Article |
| 2010 | Bansal, Nikhil
Gupta, Anupam
Li, Jian
Mestre, Julián
Nagarajan, Viswanath
Rudra, Atri | | When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings (Extended Abstract)
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 218-229 | Proceedings Article |
| 2010 | Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror | | Minimum Vertex Cover in Rectangle Graphs
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 255-266 | Proceedings Article |
| 2010 | Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen | | Scheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101 | Proceedings Article |
| 2010 | Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian | | Improved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24 | Journal Article |
| 2010 | Basit, Abdul
Mustafa, Nabil H.
Ray, Saurabh
Raza, Sarfraz | | Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | Journal Article |
| 2010 | Batra, Prashant
Sharma, Vikram | | Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628 | Journal Article |
| 2010 | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16 | Electronic Journal Article |
| 2010 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Kerber, Michael
Setter, Ophir | | Arrangements on Parametric Surfaces II: Concretizations and Applications
In: Mathematics in Computer Science [4], 67-91 | Journal Article |
| 2010 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron | | Arrangements on Parametric Surfaces I: General Framework and Infrastructure
In: Mathematics in Computer Science [4], 45-66 | Journal Article |
| 2010 | Berberich, Eric
Hagen, Matthias
Hiller, Benjamin
Moser, Hannes | | Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388 | Part of a Book |
| 2010 | Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article |
| 2010 | Berberich, Eric
Hemmer, Michael
Kerber, Michael | | A Generic Algebraic Kernel for Non-linear Geometric Applications | Report |
| 2010 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278 | Journal Article |
| 2010 | Berghammer, Rudolf
Friedrich, Tobias
Neumann, Frank | | Set-based Multi-Objective Optimization, Indicators, and Deteriorative Cycles
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 495-502 | Proceedings Article |
| 2010 | Blelloch, Guy E.
Farzan, Arash | | Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150 | Proceedings Article |
| 2010 | Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole | | Algorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359 | Proceedings Article |
| 2010 | Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido | | Stackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346 | Journal Article |
| 2010 | Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto | | Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241 | Proceedings Article |
| 2010 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 341-354 | Proceedings Article |
| 2010 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531 | Journal Article |
| 2010 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | On Nash Equilibria and Improvement Cycles in Pure Positional Strategies for Chess-like and Backgammon-like $n$-person Games | Unpublished/Draft |
| 2010 | Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa | | Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439 | Journal Article |
| 2010 | Böttcher, Süntje
Doerr, Benjamin
Neumann, Frank | | Optimal fixed and adaptive mutation rates for the LeadingOnes problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 1-10 | Proceedings Article |
| 2010 | Bradonjić, Milan
Elsässer, Robert
Friedrich, Tobias
Sauerwald, Thomas
Stauffer, Alexandre | | Efficient Broadcast on Random Geometric Graphs
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1412-1421 | Proceedings Article |
| 2010 | Bringmann, Karl
Friedrich, Tobias | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | Journal Article |
| 2010 | Bringmann, Karl
Friedrich, Tobias | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Journal Article |
| 2010 | Bringmann, Karl
Friedrich, Tobias | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | Proceedings Article |
| 2010 | Bringmann, Karl
Friedrich, Tobias | | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | Proceedings Article |
| 2010 | Butman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror | | Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18 | Journal Article |
| 2010 | Canzar, Stefan
Elbassioni, Khaled
Elmasry, Amr
Raman, Rajiv | | On the Approximability of the Maximum Interval Constrained Coloring Problem
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 168-179 | Proceedings Article |
| 2010 | Canzar, Stefan
Elbassioni, Khaled
Mestre, Julian | | A polynomial delay algorithm for enumerating approximate solutions to the interval coloring problem
In: Workshop on Algorithm Engineering and Experiments 2010 (ALENEX10), 23-33 | Proceedings Article |
| 2010 | Case, John
Kötzing, Timo | | Solutions to Open Questions for Non-U-Shaped Learning with Memory Limitations
In: Algorithmic Learning Theory : 21st International Conference, ALT 2010, 285-299 | Proceedings Article |
| 2010 | Case, John
Kötzing, Timo | | Strongly Non-U-Shaped Learning Results by General Techniques
In: COLT 2010 : The 23rd Conference on Learning Theory, 181-193 | Proceedings Article |
| 2010 | Chan, Ho-Leung
Lam, Tak-Wah
Lee, Lap-Kei
Ting, Hing-Fung | | Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190 | Electronic Proceedings Article |
| 2010 | Chan, Sze-Hang
Lam, Tak-Wah
Lee, Lap-Kei | | Non-clairvoyant speed scaling for weighted flow time
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 23-35 | Proceedings Article |
| 2010 | Christodoulou, George
Chung, Christine
Ligett, Katrina
Pyrga, Evangelia
van Stee, Rob | | On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | Proceedings Article |
| 2010 | Christodoulou, George
Elbassioni, Khaled
Fouz, Mahmoud | | Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181 | Proceedings Article |
| 2010 | Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária | | Mechanism Design for Fractional Scheduling on Unrelated Machines
In: ACM Transactions on Algorithms [6], 38:1-38:18 | Journal Article |
| 2010 | Christodoulou, George
Kovács, Annamária | | A deterministic truthful PTAS for scheduling related machines
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1005-1016 | Proceedings Article |
| 2010 | Christodoulou, George
Kovacs, Annamaria
van Stee, Rob | | A truthful constant approximation for maximizing the minimum load on related machines
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 182-193 | Proceedings Article |
| 2010 | Christodoulou, Giorgos
Ligett, Katrina
Pyrga, Evangelia | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article |
| 2010 | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | | Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366 | Journal Article |
| 2010 | Doerr, Benjamin
Fouz, Mahmoud | | Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213 | Journal Article |
| 2010 | Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten | | Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464 | Proceedings Article |
| 2010 | Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | Journal Article |
| 2010 | Doerr, Benjamin
Goldberg, Leslie Ann | | Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41 | Proceedings Article |
| 2010 | Doerr, Benjamin
Goldberg, Leslie Ann | | Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183 | Proceedings Article |
| 2010 | Doerr, Benjamin
Goldberg, Leslie Ann
Minder, Lorenz
Sauerwald, Thomas
Scheideler, Christian | | Brief Announcement: Stabilizing Consensus with the Power of Two Choices
In: Distributed Computing : 24th International Symposium, DISC 2010, 528-530 | Proceedings Article |
| 2010 | Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine | | Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | Proceedings Article |
| 2010 | Doerr, Benjamin
Johannsen, Daniel | | Edge-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 |
| 2010 | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
Theile, Madeleine | | More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193 | Proceedings Article |
| 2010 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Proceedings Article |
| 2010 | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article |
| 2010 | Doerr, Benjamin
Künnemann, Marvin
Wahlström, Magnus | | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | Proceedings Article |
| 2010 | Doerr, Benjamin
Neumann, Frank | | In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542 | Journal Article |
| 2010 | Doerr, Benjamin
Neumann, Frank
Wegener, Ingo | | Editorial
In: Algorithmica [57], 119-120 | Journal Article |
| 2010 | Elbassioni, Khaled
Chan, Hubert | | A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 256-267 | Proceedings Article |
| 2010 | Elbassioni, Khaled
Fouz, Mahmoud
Swamy, Chaitanya | | Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 462-472 | Proceedings Article |
| 2010 | Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj | | Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136 | Proceedings Article |
| 2010 | Elbassioni, Khaled
Rauf, Imran | | Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363 | Journal Article |
| 2010 | Elbassioni, Khaled
Rauf, Imran | | Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry | Unpublished/Draft |
| 2010 | Elmasry, Amr | | Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110 | Journal Article |
| 2010 | Elmasry, Amr | | The longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658 | Journal Article |
| 2010 | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | | Strictly-regular number system and data structures
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 26-37 | Proceedings Article |
| 2010 | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | | The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165 | Proceedings Article |
| 2010 | Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M. | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
| 2010 | Emeliyanenko, Pavel | | A 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 |
| 2010 | Emeliyanenko, Pavel | | Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), - | Poster |
| 2010 | Emeliyanenko, Pavel | | Modular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440 | Proceedings Article |
| 2010 | Epstein, Leah
Levin, Asaf
Marchetti-Spaccamela, Alberto
Megow, Nicole
Mestre, Julian
Skutella, Martin
Stougie, Leen | | Universal sequencing on a single machine
In: Integer Programming and Combinatorial Optimization : 14th International Conference, IPCO 2010, 230-243 | Proceedings Article |
| 2010 | Epstein, Leah
Levin, Asaf
Mestre, Julian
Segev, Danny | | Improved 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 |
| 2010 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Max-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347 | Proceedings Article |
| 2010 | Epstein, Leah
van Stee, Rob | | Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57 | Journal Article |
| 2010 | Epstein, Leah
van Stee, Rob | | On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18 | Journal Article |
| 2010 | Farzan, Arash
Gagie, Travis
Navarro, Gonzalo | | Entropy-Bounded Representation of Point Grids
In: Algorithms and Computation : 21st International Symposium, ISAAC 2010. - Pt. II, 327-338 | Proceedings Article |
| 2010 | Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket | | The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 | Proceedings Article |
| 2010 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | | Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560 | Proceedings Article |
| 2010 | Fountoulakis, Nikolaos
Kang, Ross
McDiarmid, Colin | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | Electronic Journal Article |
| 2010 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | Orientability of random hypergraphs and the power of multiple choices
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. 1, 348-359 | Proceedings Article |
| 2010 | Fountoulakis, Nikolaos
Panagiotou, Konstantinos | | Rumor spreading on random regular graphs and expanders
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th Internationa lWorkshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 560-573 | Proceedings Article |
| 2010 | Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas | | Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629 | Proceedings Article |
| 2010 | Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank | | Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864 | Journal Article |
| 2010 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | | Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models
In: Evolutionary Computation [18], 617 - 633 | Journal Article |
| 2010 | Friedrich, Tobias
Neumann, Frank | | When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294 | Journal Article |
| 2010 | Friedrich, Tobias
Sauerwald, Thomas | | The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139 | Proceedings Article |
| 2010 | Friedrich, Tobias
Sauerwald, Thomas | | The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30 | Electronic Journal Article |
| 2010 | Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan | | Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24 | Electronic Journal Article |
| 2010 | Gao, Pu (Jane)
Wormald, Nicholas
Su, Yi | | Induced subgraphs in sparse random graphs with given degree sequence | Unpublished/Draft |
| 2010 | Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees
In: Algorithmica [58], 119-136 | Journal Article |
| 2010 | Giannopoulos, Panos
Klein, Rolf
Kutz, Martin
Marx, Daniel | | Computing geometric minimum-dilation graphs is NP-hard
In: International Journal of Computational Geometry & Applications [20], 147-173 | Journal Article |
| 2010 | Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Philippas | | NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338 | Journal Article |
| 2010 | Gotthilf, Zvi
Hermelin, Danny
Landau, Gad M.
Lewenstein, Moshe | | Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257 | Proceedings Article |
| 2010 | Guibas, Leonidas
Milosavljevic, Nikola
Motskin, Arik | | Connected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30 | Proceedings Article |
| 2010 | Günther, Elisabeth
König, Felix
Megow, Nicole | | Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 170-181 | Proceedings Article |
| 2010 | Hajiaghayi, MohammadTaghi
Khandekar, Rohit
Kortsarz, Guy
Mestre, Julian | | The Checkpoint Problem
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 13th International Workshop, APPROX 2010 and 14th International Workshop, RANDOM 2010, 219-231 | Proceedings Article |
| 2010 | Han, Xin
Lam, Tak-Wah
Lee, Lap-Kei
To, Isaac K. K.
Wong, Prudence W. H. | | Deadline scheduling and power management for speed bounded processors
In: Theoretical Computer Science [411], 3587-3600 | Journal Article |
| 2010 | Harren, Rolf | | Two-dimensional packing problems
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2010 | Huang, Chien-Chung | | Circular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150 | Journal Article |
| 2010 | Huang, Chien-Chung | | Classified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253 | Proceedings Article |
| 2010 | Huber, Anna | | Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2010 | Iacono, G.
Ramezani, Fahimeh
Soranzo, N.
Altafani, C. | | Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | Journal Article |
| 2010 | Jansen, Klaus
Kratsch, Stefan
Marx, Dániel
Schlotter, Ildikó | | Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272 | Proceedings Article |
| 2010 | Jansen, Thomas
Neumann, Frank | | Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334 | Journal Article |
| 2010 | Johannsen, Daniel | | Random combinatorial structures and randomized search heuristics
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2010 | Johannsen, Daniel
Lengler, Johannes | | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 | Proceedings Article |
| 2010 | Johannsen, Daniel
Panagiotou, Konstantinos | | Vertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 | Proceedings Article |
| 2010 | Kao, Ming-Yang
Leung, Henry C. M.
Sun, He
Zhang, Yong | | Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, 308-319 | Proceedings Article |
| 2010 | Kasprzik, Anna
Kötzing, Timo | | String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391 | Proceedings Article |
| 2010 | Kavitha, Telikepalli
Mestre, Julian | | Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14 | Electronic Journal Article |
| 2010 | Kötzing, Timo
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro S. | | Ant Colony Optimization and the Minimum Cut Problem
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1393-1400 | Proceedings Article |
| 2010 | Kötzing, Timo
Neumann, Frank
Röglin, Heiko
Witt, Carsten | | Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
In: Swarm Intelligence : 7th International Conference, ANTS 2010, 324-335 | Proceedings Article |
| 2010 | Kratsch, Stefan | | Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2010 | Kratsch, Stefan
Lehre, Per Kristian
Neumann, Frank
Oliveto, Pietro Simone | | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 | Proceedings Article |
| 2010 | Kratsch, Stefan
Marx, Dániel
Wahlström, Magnus | | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500 | Proceedings Article |
| 2010 | Kratsch, Stefan
Schweitzer, Pascal | | Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92 | Proceedings Article |
| 2010 | Kratsch, Stefan
Wahlström, Magnus | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article |
| 2010 | Kuhn, Fabian
Panagiotou, Konstantinos
Spencer, Joel
Steger, Angelika | | Synchrony and Asynchrony in Neural Networks
In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 949-964 | Proceedings Article |
| 2010 | McConnella, Ross M.
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | Electronic Journal Article |
| 2010 | Megow, Nicole | | Keller oder Dach zuerst
In: Besser als Mathe, 111-116 | Part of a Book |
| 2010 | Mehlhorn, Kurt | | Reliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11 | Proceedings Article |
| 2010 | Mehlhorn, Kurt
Ray, Saurabh | | Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683 | Journal Article |
| 2010 | Mehlhorn, Kurt
Schweitzer, Pascal | | Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5 | Proceedings Article |
| 2010 | Mestre, Julian | | Adaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057 | Journal Article |
| 2010 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket | | The effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107 | Proceedings Article |
| 2010 | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath | | FPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280 | Proceedings Article |
| 2010 | Mörig, Marc
Scholz, Sven
Tscheuschner, Tobias
Berberich, Eric | | Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289 | Part of a Book |
| 2010 | Mustafa, Nabil H.
Ray, Saurabh | | Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895 | Journal Article |
| 2010 | Neumann, Frank
Witt, Carsten | | Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413 | Journal Article |
| 2010 | Neumann, Frank
Witt, Carsten | | Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity | Book |
| 2010 | Nor, Igor
Hermelin, Danny
Charlat, Sylvain
Engelstadter, Jan
Reuter, Max
Duron, Olivier Sagot, Marie-France | | Mod/Resc Parsimony Inference
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 202-213 | Proceedings Article |
| 2010 | Panagiotou, Konstantinos
Steger, Angelika | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21 | Journal Article |
| 2010 | Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve | | A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 | Proceedings Article |
| 2010 | Pountourakis, Emmanouil
Vidali, Angelina | | A complete characterization of group-strategyproof mechanisms of cost-sharing.
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. I, 146-157 | Proceedings Article |
| 2010 | Pyrga, Evangelia | | Algorithmic Game Theory and Networks
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2010 | Rusinov, Momchil
Schweitzer, Pascal | | Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262 | Journal Article |
| 2010 | Sagraloff, Michael | | A General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506 | Journal Article |
| 2010 | Sagraloff, Michael | | On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33 | Electronic Journal Article |
| 2010 | Schweitzer, Pascal
Schweitzer, Patrick | | Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | Journal Article |
| 2009 | Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly | | Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Part of a Book |
| 2009 | Althaus, Ernst
Dumitriu, Daniel | | Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | Proceedings Article |
| 2009 | Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article |
| 2009 | Amaldi, Edoardo
Iuliano, Claudio
Jurkiewicz, Tomasz
Mehlhorn, Kurt
Rizzi, Romeo | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | Proceedings Article |
| 2009 | Amini, Omid
Peleg, David
Pérennes, Stéphane
Sau, Ignasi
Saurabh, Saket | | Degree-Constrained Subgraph Problems: Hardness and Approximation Results
In: Approximation and Online Algorithms : 6th International Workshop, WAOA 2008, 29-42 | Proceedings Article |
| 2009 | Amini, Omid
Pérennes, Stéphane
Sau, Ignasi | | Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760 | Journal Article |
| 2009 | Angelopoulos, Spyros | | Online Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48 | Proceedings Article |
| 2009 | Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos | | Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19 | Electronic Journal Article |
| 2009 | Angelopoulos, Spyros
Lopez-Ortiz, Alejandro | | Intertruptible Algorithms for Multi Problem Solving
In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 09), 380-386 | Proceedings Article |
| 2009 | Angelopoulos, Spyros
Schweitzer, Pascal | | Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145 | Proceedings Article |
| 2009 | Bansal, Nikhil
Chan, Ho-Leung | | Weighted flow time does not admit O(1)-competitive algorithms
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1238-1244 | Proceedings Article |
| 2009 | Bansal, Nikhil
Chan, Ho-Leung
Pruhs, Kirk | | Speed Scaling with an Arbitrary Power Function
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 693-701 | Proceedings Article |
| 2009 | Bast, Hannah | | Car or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367 | Part of a Book |
| 2009 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192 | Part of a Book |
| 2009 | Baswana, Surender
Biswas, Somenath
Doerr, Benjamin
Friedrich, Tobias
Kurur, Piyush P.
Neumann, Frank | | Computing Single Source Shortest Paths using Single-Objective Fitness Functions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 59-66 | Proceedings Article |
| 2009 | Berberich, Eric
Sagraloff, Michael | | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Computer Aided Geometric Design (CAGD) [26], 627-647 | Journal Article |
| 2009 | Bhaskar, Umang
Fleischer, Lisa
Hoy, Darrell
Huang, Chien-Chung | | Equilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757 | Proceedings Article |
| 2009 | Böcker, Sebastian
Hüffner, Falk
Truss, Anke
Wahlström, Magnus | | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | Proceedings Article |
| 2009 | Bringmann, Karl
Friedrich, Tobias | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | Proceedings Article |
| 2009 | Bringmann, Karl
Friedrich, Tobias | | Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112 | Proceedings Article |
| 2009 | Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | Journal Article |
| 2009 | Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Journal Article |
| 2009 | Celikik, Marjan
Bast, Hannah | | Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205 | Proceedings Article |
| 2009 | Celikik, Marjan
Bast, Holger | | Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article |
| 2009 | Chan, Ho-Leung
Edmonds, Jeff
Lam, Tak-Wah
Lee, Lap-Kei
Marchetti-Spaccamela, Alberto
Pruhs, Kirk | | Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264 | Electronic Proceedings Article |
| 2009 | Chan, Ho-Leung
Edmonds, Jeff
Pruhs, Kirk | | Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10 | Proceedings Article |
| 2009 | Chan, T-H. Hubert
Dhamdhere, Kedar
Gupta, Anupam
Kleinberg, Jon
Slivkins, Aleksandrs | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | Journal Article |
| 2009 | Chan, T.-H. Hubert
Gupta, Anupam | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | Journal Article |
| 2009 | Christodoulou, George
Koutsoupias, Elias | | Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | Journal Article |
| 2009 | Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash | | Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | Journal Article |
| 2009 | Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina | | A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | Journal Article |
| 2009 | Cilleruelo, Javier
Hebbinghaus, Nils | | Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611 | Journal Article |
| 2009 | Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | Journal Article |
| 2009 | Correa, Jose R.
Megow, Nicole
Raman, Rajiv
Suchan, Karol | | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | Proceedings Article |
| 2009 | Doerr, Benjamin | | Introducing 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 |
| 2009 | Doerr, Benjamin
Eremeev, Anton
Horoba, Christian
Neumann, Frank
Theile, Madeleine | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Proceedings Article |
| 2009 | Doerr, Benjamin
Fouz, Mahmoud | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Journal Article |
| 2009 | Doerr, Benjamin
Fouz, Mahmoud
Schmidt, Martin
Wahlström, Magnus | | BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246 | Proceedings Article |
| 2009 | Doerr, Benjamin
Friedrich, Tobias | | Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | Journal Article |
| 2009 | Doerr, Benjamin
Friedrich, Tobias
Künnemann, Marvin
Sauerwald, Thomas | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | Proceedings Article |
| 2009 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | Journal Article |
| 2009 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | Proceedings Article |
| 2009 | Doerr, Benjamin
Gnewuch, Michael
Wahlström, Magnus | | Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338 | Proceedings Article |
| 2009 | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | | Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821 | Proceedings Article |
| 2009 | Doerr, Benjamin
Theile, Madeleine | | Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254 | Proceedings Article |
| 2009 | Doerr, Benjamin
Wahlström, Magnus | | Randomized 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 |
| 2009 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | | How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17 | Electronic Journal Article |
| 2009 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | Journal Article |
| 2009 | Elbassioni, Khaled | | Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510 | Journal Article |
| 2009 | Elbassioni, Khaled
Fishkin, Aleksei V.
Sitters, René | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | Journal Article |
| 2009 | Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj | | Improved 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 |
| 2009 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | | On the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 | Proceedings Article |
| 2009 | Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran | | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | Proceedings Article |
| 2009 | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene | | On 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 |
| 2009 | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene | | On 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 |
| 2009 | Elbassioni, Khaled
Tiwary, Hans Raj | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Proceedings Article |
| 2009 | Elbassioni, Khaled M.
Krohn, Erik
Matijevic, Domagoj
Mestre, Julián
Severdija, Domagoj | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13 | Electronic Journal Article |
| 2009 | Elmasry, Amr | | Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086 | Journal Article |
| 2009 | Elmasry, Amr | | Pairing 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 |
| 2009 | Elmasry, Amr
Manjunath, Madhusudan | | Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103 | Proceedings Article |
| 2009 | Emeliyanenko, Pavel | | Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article |
| 2009 | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article |
| 2009 | Epstein, Leah
Kleiman, Elena
Mestre, Julian | | Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78 | Proceedings Article |
| 2009 | Epstein, Leah
Kleiman, Elena
van Stee, Rob | | Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | Proceedings Article |
| 2009 | Epstein, Leah
van Stee, Rob
Tamir, Tami | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | Journal Article |
| 2009 | Fountoulakis, Nikolaos
Huber, Anna | | Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991 | Journal Article |
| 2009 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | | Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530 | Proceedings Article |
| 2009 | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | | The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530 | Proceedings Article |
| 2009 | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | Journal Article |
| 2009 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | | Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462 | Journal Article |
| 2009 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | Journal Article |
| 2009 | Friedrich, Tobias
Horoba, Christian
Neumann, Frank | | Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 | Proceedings Article |
| 2009 | Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | Journal Article |
| 2009 | Friedrich, Tobias
Sauerwald, Thomas | | Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130 | Proceedings Article |
| 2009 | Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan | | Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | Proceedings Article |
| 2009 | Gandhi, Rajiv
Mestre, Julián | | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | Journal Article |
| 2009 | Gärtner, Tobias
Hotz, Günter | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | Proceedings Article |
| 2009 | Gidenstam, Anders
Papatriantafilou, Marina
Sundell, Håkan
Tsigas, Philippas | | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Journal Article |
| 2009 | Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Phillipas | | NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35 | Electronic Journal Article |
| 2009 | Giesen, Joachim
Manjunath, Madhusudan | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article |
| 2009 | Happ, Edda | | Analyses of Evolutionary Algorithms
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2009 | Harren, Rolf | | Approximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532 | Journal Article |
| 2009 | Harren, Rolf
van Stee, Rob | | Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189 | Proceedings Article |
| 2009 | Helwig, Sabine
Neumann, Frank
Wanka, Rolf | | Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | Proceedings Article |
| 2009 | Hemmer, Michael | | Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual |
| 2009 | Hemmer, Michael | | Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual |
| 2009 | Hemmer, Michael
Hülse, Dominik | | Generic implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324 | Proceedings Article |
| 2009 | Hemmer, Michael
Limbach, Sebastian
Schömer, Elmar | | Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | Proceedings Article |
| 2009 | Hemmer, Michael
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
Emiris, Ioannis Z.
Karavelas, Menelaos I.
Mourrain, Bernard | | Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | Proceedings Article |
| 2009 | Horoba, Chrisitian
Neumann, Frank | | Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86 | Proceedings Article |
| 2009 | Johannsen, Daniel
Razgon, Igor
Wahlström, Magnus | | Solving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85 | Proceedings Article |
| 2009 | Jurkiewicz, Tomasz | | Cycle Bases in Graphs
Universität des Saarlandes | Thesis - Master's thesis |
| 2009 | Kavitha, Telikepalli
Mestre, Julian | | Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | Proceedings Article |
| 2009 | Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K. | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | Journal Article |
| 2009 | Kavitha, T.
Mestre, Julián
Nasre, M. | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article |
| 2009 | Kerber, Michael | | Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | Journal Article |
| 2009 | Kerber, Michael | | Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2009 | Kerber, Michael | | On the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article |
| 2009 | Kowalik, Lukasz | | Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742 | Journal Article |
| 2009 | Kratsch, Stefan | | Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612 | Electronic Proceedings Article |
| 2009 | Kratsch, Stefan
Neumann, Frank | | Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300 | Proceedings Article |
| 2009 | Kratsch, Stefan
Wahlström, Magnus | | Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article |
| 2009 | Krumke, Sven
van Stee, Rob
Westphal, Stefan | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book |
| 2009 | Larsson, Andreas
Gidenstam, Anders
Ha, Phuong H.
Papatriantafilou, Marina
Tsigas, Philippas | | Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30 | Electronic Journal Article |
| 2009 | Mehlhorn, Kurt
Sagraloff, Michael | | Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254 | Proceedings Article |
| 2009 | Mehlhorn, K.
Michail, D. | | Minimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13 | Electronic Journal Article |
| 2009 | Neumann, Frank
Oliveto, Pietro Simone
Witt, Carsten | | Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842 | Proceedings Article |
| 2009 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | | Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68 | Journal Article |
| 2009 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | | Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120 | Part of a Book |
| 2009 | Neumann, Frank
Witt, Carsten | | Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255 | Journal Article |
| 2009 | Oliveto, Pietro Simone
Lehre, Per Kristian
Neumann, Frank | | Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 | Proceedings Article |
| 2009 | Panagiotou, Konstantinos | | Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article |
| 2009 | Panagiotou, Konstantinos | | The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681 | Journal Article |
| 2009 | Panagiotou, Konstantinos | | Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45 | Proceedings Article |
| 2009 | Panagiotou, Konstantinos
Steger, Angelika | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 | Proceedings Article |
| 2009 | Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath | | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705 | Proceedings Article |
| 2009 | Pyrga, Evangelia
Chung, Christine | | Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195 | Proceedings Article |
| 2009 | Raidl, Alba, Bacardit, Beyer, Birattari, Blum, Bosman, Congdon, Corne, Cotta, Di Penta, Doerr, Drechsle, Ebner, Grahl, Jansen, Knowles, Lenaerts, Middendorf, Miller, O'Neill, Poli, Squillero, Stanley, Stützle, van Hemert (ed.) | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings |
| 2009 | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article |
| 2009 | Sanders, Peter
Sivadasan, Naveen
Skutella, Martin | | Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498 | Journal Article |
| 2009 | Schwarz, Karsten
Karrenbauer, Andreas
Schehr, Gregory
Rieger, H. | | Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | Electronic Journal Article |
| 2009 | Schweitzer, Pascal | | Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2009 | Schweitzer, Pascal | | Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232 | Journal Article |
| 2009 | Shervashidze, Nino
Vishwanathan, S .V. N.
Petri, Tobias H.
Mehlhorn, Kurt
Borgwardt, Karsten M. | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Electronic Proceedings Article |
| 2009 | Vidali, Angelina | | The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350 | Proceedings Article |
| 2009 | Wahlström, Magnus | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355 | Proceedings Article |
| 2008 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Journal Article |
| 2008 | Ajwani, Deepak
Malinger, Itay
Meyer, Ulrich
Toledo, Sivan | | Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219 | Proceedings Article |
| 2008 | Albrecht, Marc
Karrenbauer, Andreas
Xu, Chihao | | A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289 | Proceedings Article |
| 2008 | Althaus, Ernst
Canzar, Stefan | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | Journal Article |
| 2008 | Althaus, Ernst
Canzar, Stefan | | LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498 | Proceedings Article |
| 2008 | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián | | Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article |
| 2008 | Althaus, Ernst
Canzar, Stefan
Emmett, Mark
Karrenbauer, Andreas
Marshall, Alan
Meyer-Bäse, Anke
Zhang, Huimin | | Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | Proceedings Article |
| 2008 | Althaus, Ernst
Naujoks, Rouven | | Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 | Proceedings Article |
| 2008 | Angelopoulos, Spyros | | A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87 | Proceedings Article |
| 2008 | Angelopoulos, Spyros
Dorrigiv, Reza
Lopez-Ortiz, Alejandro | | List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | Proceedings Article |
| 2008 | Angelopoulos, Spyros
Lopez-Ortiz, Alejandro
Hamel,Angele | | Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | Proceedings Article |
| 2008 | Berberich, Eric | | Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2008 | Berberich, Eric
Emeliyanenko, Pavel | | CGAL's Curved Kernel via Analysis | Report |
| 2008 | Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias | | Prototype implementation of the algebraic kernel | Report |
| 2008 | Berberich, Eric
Kerber, Michael | | Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 | Proceedings Article |
| 2008 | Berberich, Eric
Kerber, Michael | | Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Proceedings Article |
| 2008 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article |
| 2008 | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 | Proceedings Article |
| 2008 | Berberich, Eric
Sagraloff, Michael | | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182 | Proceedings Article |
| 2008 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Oudalov, Vladimir | | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109 | Proceedings Article |
| 2008 | Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Tiwary, Hans Raj | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | Journal Article |
| 2008 | Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article |
| 2008 | Bringmann, Karl
Friedrich, Tobias | | Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447 | Proceedings Article |
| 2008 | Brockhoff, Dimo
Friedrich, Tobias
Neumann, Frank | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | Proceedings Article |
| 2008 | Cameron, Peter
Johannsen, Daniel
Prellberg, Thomas
Schweitzer, Pascal | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article |
| 2008 | Chang, Kevin
Johnson, Aaron | | Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Proceedings Article |
| 2008 | Christodoulou, George | | Price of Anarchy
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| 2008 | Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina | | A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307 | Proceedings Article |
| 2008 | Christodoulou, George
Kovács, Annamária
Schapira, Michael | | Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | Proceedings Article |
| 2008 | Cole, Richard
Kowalik, Lukasz | | New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368 | Journal Article |
| 2008 | Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | Journal Article |
| 2008 | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | | Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | Proceedings Article |
| 2008 | Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | Journal Article |
| 2008 | Diedrich, Florian
Kehden, Britta
Neumann, Frank | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article |
| 2008 | Diedrich, Florian
Neumann, Frank | | Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 | Proceedings Article |
| 2008 | Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | Proceedings Article |
| 2008 | Doerr, Benjamin
Gnewuch, Michael | | Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312 | Proceedings Article |
| 2008 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Friedrich | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | Journal Article |
| 2008 | Doerr, Benjamin
Gnewuch, Michael
Kritzer, Peter
Pillichshammer, Peter | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | Journal Article |
| 2008 | Doerr, Benjamin
Happ, Edda | | Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613 | Proceedings Article |
| 2008 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Proceedings Article |
| 2008 | Doerr, Benjamin
Jansen, Thomas
Klein, Christian | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article |
| 2008 | Doerr, Benjamin
Johannsen, Daniel
Tang, Ching Hoo | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article |
| 2008 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | | How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74 | Proceedings Article |
| 2008 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | | On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | Proceedings Article |
| 2008 | Dumitriu, Daniel
Funke, Stefan
Kutz, Martin
Milosavljevic, Nikola | | On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208 | Proceedings Article |
| 2008 | Eigensatz, Michael
Giesen, Joachim
Manjunath, Madhusudan | | The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214 | Proceedings Article |
| 2008 | Eigenwillig, Arno | | Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2008 | Eigenwillig, Arno
Kerber, Michael | | Exact 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 |
| 2008 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article |
| 2008 | El Kahoui, M'hammed | | Computing with algebraic curves in generic position | Miscellaneous |
| 2008 | El Kahoui, M'hammed | | Polynomial parametrization of nonsingular algebraic curves | Miscellaneous |
| 2008 | Elbassioni, Khaled | | A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277 | Journal Article |
| 2008 | Elbassioni, Khaled | | On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123 | Journal Article |
| 2008 | Elbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim | | Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529 | Part of a Book |
| 2008 | Elbassioni, Khaled
Hagen, Matthias
Rauf, Imran | | Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102 | Proceedings Article |
| 2008 | Elbassioni, Khaled
Tiwary, Hans Raj | | On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174 | Proceedings Article |
| 2008 | Elbassioni, Khaled
Tiwary, Hans Raj | | On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x | Journal Article |
| 2008 | Elmasry, Amr | | Violation Heaps: A Better Substitute for Fibonacci Heaps | Report |
| 2008 | Elmasry, Amr
Hammad, Abdelrahman | | Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18 | Journal Article |
| 2008 | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | | Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19 | Journal Article |
| 2008 | Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki | | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204 | Journal Article |
| 2008 | Emeliyanenko, Pavel
Kerber, Michael | | An implementation of the 2D Algebraic Kernel | Report |
| 2008 | Emeliyanenko, Pavel
Kerber, Michael | | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings Article |
| 2008 | Emeliyanenko, Pavel
Kerber, Michael | | Visualizing and Exploring Planar Algebraic Arrangements - a Web Application | Report |
| 2008 | Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg | | Voronoi diagram of ellipses: CGAL-based implementation | Report |
| 2008 | Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis | | Experimental evaluation and cross-benchmarking of univariate real solvers | Report |
| 2008 | Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis | | Cross-benchmarks of univariate algebraic kernels | Report |
| 2008 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Online unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96 | Journal Article |
| 2008 | Epstein, Leah
Levin, Asaf
van Stee, Rob | | Two-dimensional packing with conflicts
In: Acta Informatica [45], 155-175 | Journal Article |
| 2008 | Epstein, Leah
van Stee, Rob | | Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | Proceedings Article |
| 2008 | Epstein, Leah
van Stee, Rob | | Maximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 | Proceedings Article |
| 2008 | Epstein, Leah
van Stee, Rob | | On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | Proceedings Article |
| 2008 | Epstein, Leah
van Stee, Rob | | The price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57 | Proceedings Article |
| 2008 | Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk | | The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141 | Journal Article |
| 2008 | Fountoulakis, Nikolaos
Reed, Bruce | | The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86 | Journal Article |
| 2008 | Friedrich, Tobias
Hebbinghaus, Nils | | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704 | Proceedings Article |
| 2008 | Friedrich, Tobias
Horoba, Christian
Neumann, Frank | | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680 | Proceedings Article |
| 2008 | Friedrich, Tobias
Neumann, Frank | | When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003 | Proceedings Article |
| 2008 | Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten | | Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952 | Proceedings Article |
| 2008 | Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard | | Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75 | Journal Article |
| 2008 | Funke, Stefan
Laue, Sören
Naujoks, Rouven
Lotker, Zvi | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article |
| 2008 | Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián | | Assigning Papers to Referees | Unpublished/Draft |
| 2008 | Giesen, Joachim | | Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | Journal Article |
| 2008 | Giesen, Joachim | | Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | Journal Article |
| 2008 | Giesen, Joachim | | The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190 | Journal Article |
| 2008 | Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S. | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | Journal Article |
| 2008 | Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article |
| 2008 | Harren, Rolf
van Stee, Rob | | Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | Proceedings Article |
| 2008 | Hemmer, Michael | | CGAL package for modular arithmetic operations | Report |
| 2008 | Hemmer, Michael | | CGAL package: Algebraic Foundations | Report |
| 2008 | Hemmer, Michael | | Evaluation of different approaches in 3D curved kernel for arrangements of quadrics | Report |
| 2008 | Hemmer, Michael | | Exact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz | Thesis - Doctoral dissertation |
| 2008 | Hemmer, Michael
Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics | Report |
| 2008 | Hemmer, Michael
Limbach, Sebastian | | Arrangements of quadrics in 3D: continued work on experimental implementation | Report |
| 2008 | Horoba, Christian
Neumann, Frank | | Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680 | Proceedings Article |
| 2008 | Huang, Chien-Chung
Kavitha, Telikepalli
Michail, Dimitrios
Nasre, Meghana | | Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 | Proceedings Article |
| 2008 | Kavitha, Telikepalli | | On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354 | Proceedings Article |
| 2008 | Kavitha, Telikepalli
Nasre, Meghana | | Optimal Popular Matchings | Miscellaneous |
| 2008 | Keizer, Antoniol, Congdon, Deb, Doerr, Hansen, Holmes, Hornby, Howard, Kennedy, Kumar, Lobo, Miller, Moore, Neumann, Pelikan, Pollack, Sastry, Stanley, Stoica, Talbi, Wegener (ed.) | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings |
| 2008 | Kerber, Michael | | On filter methods in CGAL's 2D curved kernel | Report |
| 2008 | Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article |
| 2008 | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article |
| 2008 | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article |
| 2008 | Khachiyan, Leonid
Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Rudolf, Gabor
Zhao, Jihui | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article |
| 2008 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | Journal Article |
| 2008 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article |
| 2008 | Khuller, Samir
Mestre, Julián | | An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610 | Proceedings Article |
| 2008 | Kobel, Alexander | | Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes | Thesis - Bachelor thesis |
| 2008 | Kroeske, Jense
Ghandar, Adam
Michalewicz, Zbigniew
Neumann, Frank | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article |
| 2008 | Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | Journal Article |
| 2008 | Kutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena | | Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897 | Journal Article |
| 2008 | Limbach, Sebastian | | Continued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes | Thesis - Master's thesis |
| 2008 | Malamatos, Theocharis | | Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103 | Journal Article |
| 2008 | Manjunath, Madhusudan | | Two topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes | Thesis - Master's thesis |
| 2008 | Mehlhorn, Kurt
Kavitha, T.
Hariharan, R. | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | Journal Article |
| 2008 | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | A General Approach to the Analysis of Controlled Perturbation Algorithms | Report |
| 2008 | Mehlhorn, Kurt
Sagraloff, Michael | | A deterministic Bitstream Descartes Algorithm | Report |
| 2008 | Mehlhorn, Kurt
Sanders, Peter | | Algorithms and Data Structures: The Basic Toolbox | Book |
| 2008 | Mestre, Julián | | Adaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160 | Proceedings Article |
| 2008 | Mestre, Julián | | Lagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550 | Proceedings Article |
| 2008 | Meyer, Ulrich | | On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560 | Proceedings Article |
| 2008 | Meyer, Ulrich | | On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy | Proceedings Article |
| 2008 | Naujoks, Rouven | | NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2008 | Neumann, Frank | | Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759 | Journal Article |
| 2008 | Neumann, Frank
Reichel, Joachim | | Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81 | Proceedings Article |
| 2008 | Neumann, Frank
Reichel, Joachim
Skutella, Martin | | Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786 | Proceedings Article |
| 2008 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article |
| 2008 | Neumann, Frank
Witt, Carsten | | Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166 | Proceedings Article |
| 2008 | Philip, Geevarghese | | Fixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute | Thesis - Master's thesis |
| 2008 | Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat | | Speed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80 | Journal Article |
| 2008 | Pyrga, Evangelia
Ray, Saurabh | | New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207 | Proceedings Article |
| 2008 | Sharma, Vikram | | Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310 | Electronic Journal Article |
| 2008 | Tiwary, Hans Raj
Elbassioni, Khaled | | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198 | Proceedings Article |
| 2008 | van Stee, Rob | | Combinatorial algorithms for packing and scheduling problems
Universität Karlsruhe | Thesis - Habilitation thesis |
| 2008 | van Stee, Rob | | Packet Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| 2008 | van Stee, Rob | | Paging
In: Encyclopedia of Algorithms, 1-99 | Part of a Book |
| 2008 | Wahlström, Magnus | | A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213 | Proceedings Article |
| 2008 | Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Codrea, Cosmin | | Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219 | Journal Article |
| 2008 | Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa | | Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x | Journal Article |
| 2007 | Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article |
| 2007 | Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article |
| 2007 | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
Ray, Saurabh | | Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187 | Proceedings Article |
| 2007 | Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
Ray, Saurabh | | Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear) | Proceedings Article |
| 2007 | Ajwani, Deepak
Friedrich, Tobias | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article |
| 2007 | Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly | | Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 | Proceedings Article |
| 2007 | Ajwani, Deepak
Ray, Saurabh
Seidel, Raimund
Tiwary, Hans Raj | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article |
| 2007 | Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai | | Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432 | Proceedings Article |
| 2007 | Althaus, Ernst
Canzar, Stefan | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278 | Proceedings Article |
| 2007 | Angelopoulos, Spyros | | Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257 | Proceedings Article |
| 2007 | Angelopoulos, Spyros
Dorrigiv, Reza
López-Ortiz, Alejandro | | On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237 | Proceedings Article |
| 2007 | Aronov, Boris
Asano, Tetsuo
Funke, Stefan | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article |
| 2007 | Arya, Sunil
Malamatos, Theocharis
Mount, David M. | | A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17 | Journal Article |
| 2007 | Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun | | Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610 | Journal Article |
| 2007 | Bar-Yehuda, Reuven
Flysher, Guy
Mestre, Julián
Rawitz, Dror | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article |
| 2007 | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | | ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Proceedings Article |
| 2007 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Schultes, Dominik | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | Proceedings Article |
| 2007 | Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article |
| 2007 | Bast, Holger
Majumdar, Debapriyo
Weber, Ingmar | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article |
| 2007 | Bast, Holger
Weber, Ingmar | | Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108 | Proceedings Article |
| 2007 | Bast, Holger
Weber, Ingmar | | The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95 | Electronic Proceedings Article |
| 2007 | Baswana, Surender
Sen, Sandeep | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Journal Article |
| 2007 | Behle, Markus | | On threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135 | Proceedings Article |
| 2007 | Behle, Markus
Jünger, Michael
Liers, Frauke | | A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392 | Proceedings Article |
| 2007 | Beier, René
Röglin, Heiko
Vöcking, Berthold | | The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67 | Proceedings Article |
| 2007 | Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article |
| 2007 | Berberich, Eric
Caroli, Manuel
Wolpert, Nicola | | Exact Computation of Arrangements of Rotated Conics | Report |
| 2007 | Berberich, Eric
Caroli, Manuel
Wolpert, Nicola | | Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234 | Proceedings Article |
| 2007 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report |
| 2007 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article |
| 2007 | Berberich, Eric
Fogel, Efi
Halperin, Dan
Wein, Ron | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | Proceedings Article |
| 2007 | Berberich, Eric
Fogel, Efi
Meyer, Andreas | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | Report |
| 2007 | Berberich, Eric
Hemmer, Michael | | Definition of the 3D Quadrical Kernel Content | Report |
| 2007 | Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos I.
Teillaud, Monique | | Revision of interface specification of algebraic kernel | Report |
| 2007 | Berberich, Eric
Kettner, Lutz | | Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point | Report |
| 2007 | Berberich, Eric
Meyerovitch, Michal | | Computing Envelopes of Quadrics | Report |
| 2007 | Berberich, Eric
Meyerovitch, Michal | | Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238 | Proceedings Article |
| 2007 | Bodirsky, Manuel
Gröpl, Clemens
Johannsen, Daniel
Kang, Mihyun | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article |
| 2007 | Bodirsky, Manuel
Kutz, Martin | | Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | Journal Article |
| 2007 | Boros, Endre
Borys, Konrad
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
Rudolf, Gabor | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article |
| 2007 | Boros, Endre
Elbassioni, Khaled M.
Gurvich, Vladimir
Makino, Kazuhisa | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft |
| 2007 | Brockhoff, Dimo
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
Zitzler, Eckart | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | Proceedings Article |
| 2007 | Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | Journal Article |
| 2007 | Caragiannis, Ioannis
Fishkin, Aleksei V.
Kaklamanis, Christos
Papaioannou, Evi | | Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 | Proceedings Article |
| 2007 | Caroli, Manuel | | Evaluation of a Generic Method for Analyzing Controlled-Perturbation Algorithms
Universität des Saarlandes | Thesis - Master's thesis |
| 2007 | Chang, Kevin | | Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16 | Proceedings Article |
| 2007 | Christodoulou, George
Gourves, Laurent
Pascual, Fanny | | Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197 | Proceedings Article |
| 2007 | Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article |
| 2007 | Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina | | A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170 | Proceedings Article |
| 2007 | Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R. | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | Journal Article |
| 2007 | Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste | | A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | Journal Article |
| 2007 | Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel | | Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | Journal Article |
| 2007 | Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor | | Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090 | Journal Article |
| 2007 | Csaba, Bela | | On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31 | Journal Article |
| 2007 | Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | Proceedings Article |
| 2007 | Doerr, Benjamin | | Lp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666 | Journal Article |
| 2007 | Doerr, Benjamin | | Matrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995 | Journal Article |
| 2007 | Doerr, Benjamin | | Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363 | Journal Article |
| 2007 | Doerr, Benjamin | | Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452 | Proceedings Article |
| 2007 | Doerr, Benjamin | | Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483 | Journal Article |
| 2007 | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | Journal Article |
| 2007 | Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
Neumann, Frank | | A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | Proceedings Article |
| 2007 | Doerr, Benjamin
Happ, Edda
Klein, Christian | | A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895 | Proceedings Article |
| 2007 | Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank | | Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410 | Journal Article |
| 2007 | Doerr, Benjamin
Johannsen, Daniel | | Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Proceedings Article |
| 2007 | Doerr, Benjamin
Johannsen, Daniel | | Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507 | Proceedings Article |
| 2007 | Doerr, Benjamin
Klein, Christian
Storch, Tobias | | Faster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250 | Proceedings Article |
| 2007 | Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten | | On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40 | Proceedings Article |
| 2007 | Dumitriu, Daniel | | Graph-based Conservative Surface Reconstruction
Universität des Saarlandes | Thesis - Master's thesis |
| 2007 | Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644 | Proceedings Article |
| 2007 | Eigenwillig, Arno | | On 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 |
| 2007 | Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola | | Fast 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 |
| 2007 | Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola | | Snap Rounding of Bézier Curves | Report |
| 2007 | Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola | | Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167 | Proceedings Article |
| 2007 | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Reichel, Joachim
Schömer, Elmar | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article |
| 2007 | Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao | | Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351 | Proceedings Article |
| 2007 | El Kahoui, M'hammed
Rakrak, Said | | Structure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187 | Journal Article |
| 2007 | Elbassioni, Khaled
Sitters, Rene
Zhang, Yan | | A 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 |
| 2007 | Elbassioni, Khaled M.
Sitters, Rene
Zhang, Yan | | A Quasi-PTAS for Envy-free Pricing on Line Graphs | Unpublished/Draft |
| 2007 | Emeliyanenko, Pavel | | Visualization of Points and Segments of Real Algebraic Plane Curves
Universität des Saarlandes | Thesis - Master's thesis |
| 2007 | Fogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book |
| 2007 | Fountoulakis, Nikolaos | | Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356 | Journal Article |
| 2007 | Fountoulakis, Nikolaos
Reed, Bruce | | Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486 | Journal Article |
| 2007 | Friedrich, Tobias | | Use and Avoidance of Randomness
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2007 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | | Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629 | Proceedings Article |
| 2007 | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | | Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225 | Proceedings Article |
| 2007 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | | Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804 | Proceedings Article |
| 2007 | Friedrich, Tobias
He, Jun
Hebbinghaus, Nils
Neumann, Frank
Witt, Carsten | | On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621 | Proceedings Article |
| 2007 | Funke, Stefan
Kesselman, Alexander
Kuhn, Fabian
Lotker, Zvi
Segal, Michael | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | Journal Article |
| 2007 | Funke, Stefan
Laue, Sören | | Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283 | Proceedings Article |
| 2007 | Funke, Stefan
Laue, Sören
Naujoks, Rouven | | Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 | Proceedings Article |
| 2007 | Funke, Stefan
Milosavljevic, Nikola | | Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252 | Proceedings Article |
| 2007 | Funke, Stefan
Milosavljevic, Nikola | | Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967 | Proceedings Article |
| 2007 | Funke, Stefan
Rauf, Imran | | Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100 | Proceedings Article |
| 2007 | Gidenstam, Anders
Papatriantafilou, Marina | | LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231 | Proceedings Article |
| 2007 | Giesen, Joachim | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124 | Proceedings Article |
| 2007 | Giesen, Joachim | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book |
| 2007 | Giesen, Joachim
Mitsche, Dieter
Schuberth, Eva | | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Proceedings Article |
| 2007 | Giesen, Joachim
Schuberth, Eva
Simon, Klaus
Zolliker, Peter
Zweifel, Oliver | | Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410 | Journal Article |
| 2007 | Gotsman, Craig
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | Journal Article |
| 2007 | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Journal Article |
| 2007 | Harren, Rolf | | Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme | Book |
| 2007 | Hebbinghaus, Nils | | Discrepancy of Sums of two Arithmetic Progressions | Report |
| 2007 | Hemmer, Michael | | Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual |
| 2007 | Hemmer, Michael
Hert, Susan
Kettner, Lutz
Pion, Sylvain
Schirra, Stefan | | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual |
| 2007 | Hemmer, Michael
Hülse, Dominik | | Traits classes for polynomial gcd computation over algebraic extensions | Report |
| 2007 | Hemmer, Michael
Limbach, Sebastian | | Benchmarks on a generic univariate algebraic kernel | Report |
| 2007 | Hert, Susan
Hoffmann, Michael
Kettner, Lutz
Pion, Sylvain
Seel, Michael | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | Journal Article |
| 2007 | Karrenbauer, Andreas | | Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2007 | Kavitha, Telikepalli
Mehlhorn, Kurt | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Journal Article |
| 2007 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | Proceedings Article |
| 2007 | Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Paluch, Katarzyna E. | | Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18 | Journal Article |
| 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article |
| 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article |
| 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | Journal Article |
| 2007 | Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article |
| 2007 | Khuller, Samir
Malekian, Azarakhsh
Mestre, Julián | | To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545 | Proceedings Article |
| 2007 | Klein, Rolf
Kutz, Martin | | Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | Proceedings Article |
| 2007 | Kovács, Annamária | | Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2007 | Kowalik, Lukasz | | Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | Journal Article |
| 2007 | Kutz, Martin
Schweitzer, Pascal | | ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157 | Proceedings Article |
| 2007 | Lehnert, Jörg
Schweitzer, Pascal | | The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241 | Journal Article |
| 2007 | Matijevic, Domagoj | | Geometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2007 | Mehlhorn, Kurt | | Matchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2 | Proceedings Article |
| 2007 | Mehlhorn, Kurt | | Minimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | Proceedings Article |
| 2007 | Mehlhorn, Kurt
Michail, Dimitrios | | Implementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14 | Electronic Journal Article |
| 2007 | Michail, Dimitrios | | Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132 | Journal Article |
| 2007 | Miklos, Balint
Giesen, Joachim
Pauly, Mark | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124 | Proceedings Article |
| 2007 | Mourrain, Bernard
Pion, Sylvain
Schmitt, Susanne
Técourt, Jean-Pierre
Tsigaridas, Elias
Wolpert, Nicola | | Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155 | Part of a Book |
| 2007 | Mustafa, Nabil H.
Ray, Saurabh | | An Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141 | Proceedings Article |
| 2007 | Neumann, Frank
Sudholt, Dirk
Witt, Carsten | | Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75 | Proceedings Article |
| 2007 | Neumann, Frank
Wegener, Ingo | | Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40 | Journal Article |
| 2007 | Pyrga, Evangelia
Schulz, Frank
Wagner, Dorothea
Zaroliagis, Christos | | Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39 | Journal Article |
| 2007 | Ray, Saurabh
Mustafa, Nabil H. | | Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244 | Proceedings Article |
| 2007 | Thierens, Beyer, Bongard, Branke, Clark, Cliff, Congdon, Deb, Doerr, Kovacs, Kumar, Miller, Moore, Neumann, Pelikan, Poli, Sastry, Stanley, Stützle, Watson, Wegener (ed.) | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings |
| 2007 | Weber, Ingmar | | Efficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes | Thesis - Doctoral dissertation |
| 2007 | Weikum, Gerhard
Bast, Holger
Canright, Geoffrey
Hales, David
Schindelhauer, Christian
Triantafillou, Peter | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | Proceedings Article |
| 2007 | Xu, Chihao
Karrenbauer, Andreas
Soh, Kian Min
Wahl, Jürgen | | A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | Proceedings Article |
| 2006 | Ajwani, Deepak
Dementiev, Roman
Meyer, Ulrich | | A computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610 | Proceedings Article |
| 2006 | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | Proceedings Article |
| 2006 | Althaus, Ernst
Calinescu, Gruia
Mandoiu, Ion
Prasad, Sushil
Tchervenski, Nickolay
Zelikovsly, Alexander | | Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299 | Journal Article |
| [Replication or Save Conflict] | | | | |
| 2006 | Althaus, Ernst
Caprara, Alberto
Lenhof, Hans-Peter
Reinert, Knut | | Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425 | Journal Article |
| 2006 | Althaus, Ernst
Naujoks, Rouven | | Computing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181 | Proceedings Article |
| 2006 | Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article |
| 2006 | Arya, Sunil
Malamatos, Theocharis
Mount, David M. | | On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573 | Proceedings Article |
| 2006 | Arya, Sunil
Malamatos, Theocharis
Mount, David M. | | The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20 | Proceedings Article |
| 2006 | Bárány, Imre
Doerr, Benjamin | | Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | Journal Article |
| 2006 | Bartal, Yair
Leonardi, Stefano
Shallom, Gill
Sitters, Rene | | On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48 | Proceedings Article |
| 2006 | Bast, Holger | | Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?], | Electronic Journal Article |
| 2006 | Bast, Holger
Dupret, Georges
Majumdar, Debapriyo
Piwowarski, Benjamin | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article |
| 2006 | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article |
| 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5 | Electronic Proceedings Article |
| 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report |
| 2006 | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article |
| 2006 | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
Tamaki, Hisao | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article |
| 2006 | Bast, Holger
Mortensen, Christian Worm
Weber, Ingmar | | Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162 | Proceedings Article |
| 2006 | Bast, Holger
Weber, Ingmar | | Type Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371 | Proceedings Article |
| 2006 | Bast, Holger
Weber, Ingmar | | When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35 | Proceedings Article |
| 2006 | Beier, René
Czumaj, Artur
Krysta, Piotr
Vöcking, Berthold | | Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | Journal Article |
| 2006 | Beier, René
Vöcking, Berthold | | An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | Journal Article |
| 2006 | Beier, René
Vöcking, Berthold | | Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881 | Journal Article |
| 2006 | Berberich, Eric
Ebert, Franziska
Fogel, Efi
Kettner, Lutz | | Web-site with benchmark instances for planar curve arrangements | Report |
| 2006 | Berberich, Eric
Ebert, Franziska
Kettner, Lutz | | Definition of file format for benchmark instances for arrangements of Quadrics | Report |
| 2006 | Berberich, Eric
Hemmer, Michael | | Prototype implementation of the algebraic kernel | Report |
| 2006 | Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias | | Interface specification of algebraic kernel | Report |
| 2006 | Bodlaender, Hans L.
Feremans, Corinne
Grigoriev, Alexander
Penninkx, Eelko
Sitters, Rene
Wolle, Thomas | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | Proceedings Article |
| 2006 | Brodal, Gerth Stølting
Kaligosi, Kanela
Katriel, Irit
Kutz, Martin | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article |
| 2006 | Brönnimann, Hervé
Kettner, Lutz
Pocchiola, Michel
Snoeyink, Jack | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | Journal Article |
| 2006 | Brown, Christopher
El Kahoui, M'hammed
Novotni, Dominik
Weber, Andreas | | Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | Journal Article |
| 2006 | Bundy, David
Hebbinghaus, Nils
Stellmacher, Bernd | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | Journal Article |
