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

MPI-INF D1 Publications

MPI-INF D1 Publications

Entries sorted by: 5. Year - 8. Counting Publications

Login to this database


 

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

#YAuthor/EditorTitle
2
Hide details for Proceedings ArticleProceedings Article
Bei, XiaohuiSolving 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
Issac, DavisSampling in Space Restricted Settings
In: Computing and Combinatorics 2015,
1
Hide details for Journal ArticleJournal Article
Heydrich, Sandy
van Stee, Rob
Dividing Connected Chores Fairly
In: Theoretical Computer Science [593], 51-61
18
Hide details for 20142014
13
Hide details for Proceedings ArticleProceedings Article
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
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
Croitoru, Cosmina
Kötzing, Timo
A Normal Form for Argumentation Frameworks
In: Theory and Applications of Formal Argumentation (TAFA'13), 32-45
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
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
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
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
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
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
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
Jez, ArturA really Simple Approximation of Smallest Grammar
In: 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 182-191
Jez, ArturContext Unification is in PSPACE
In: 41st International Colloquium on Automata, Languages, and Programming (ICALP 2014), 244-255
Jez, Artur
Lohrey, Markus
Attachment IconApproximation of smallest linear tree grammar
In: 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 445-457
5
Hide details for Journal ArticleJournal Article
Doerr, Benjamin
Winzen, Carola
Ranking-Based Black-Box Complexity
In: Algorithmica [?], ?
Gawrychowski, PawelSimple and efficient LZW-compressed multiple pattern matching
In: Journal of Discrete Algorithms [25], 34-41
Gawrychowski, Pawel
Jez, Artur
Jez, Lukasz
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
In: Theory of Computing Systems [54], 337-372
Jez, ArturThe Complexity of Compressed Membership Problems for Finite Automata
In: Theory of Computing Systems [55], 685-718
Jez, Artur
Okhotin, Alexander
Computational completeness of equations over sets of natural numbers
In: Information and Computation [237], 56-94
101
Hide details for 20132013
2
Hide details for Part of a BookPart of a Book
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
Doerr, Carola
Gnewuch, Michael
Wahlström, Magnus
Calculation of Discrepancy Measures and Applications
In: A Panorama of Discrepancy Theory, 1-55
60
Hide details for Proceedings ArticleProceedings Article
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),
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
Alvarez, Victor
Bringmann, Karl
Ray, Saurabh
Seidel, Raimund
Counting Triangulations Approximately
In: 25th Canadian Conference on Computational Geometry (CCCG-13), 85-89
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),
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
Anshelevich, Elliot
Bhardwaj, Onkar
Hoefer, Martin
Friendship and Stable Matching.
In: 21st European Symposium on Algorithms (ESA-13), 49-60
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
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
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),
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),
Bringmann, KarlBringing Order to Special Cases of Klee’s Measure Problem
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), 207-218
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
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
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
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
Bringmann, Karl
Green Larsen, Kasper
Succinct Sampling from Discrete Distributions
In: 45th ACM Symposium on Theory of Computing (STOC-13), 775-782
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
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
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),
Croitoru, CosminaAbstract Debates
In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 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
Dams, Johannes
Hoefer, Martin
Kesselheim, Thomas
Sleeping Experts in Wireless Networks
In: 27th International Symposium on Distributed Computing (DISC-13), 344-357
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
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
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
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
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
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
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
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
Duan, RanAttachment IconBreaking the $O(n^2.5)$ Deterministic Time Barrier for Undirected Unit-Capacity Maximum Flow
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), 1171-1179
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
Epstein, Leah
Levin, Asaf
van Stee, Rob
Attachment IconA unified approach to truthful scheduling on related machines
In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, 1243-1252
Fekete, Sándor P.
Friedrichs, Stephan
Kröller, Alexander
Schmidt, Christiane
Facets for Art Gallery Problems
In: Computing and Combinatorics, 208-220
Gagie, Travis
Gawrychowski, Pawel
Nekrich, Yakov
Heaviest Induced Ancestors and Longest Common Substrings
In: 25th Canadian Conference on Computational Geometry (CCCG 13), 145-150
Gawrychowski, PawelAlphabetic Minimax Trees in Linear Time
In: 8th International Computer Science Symposium in Russia (CSR 2013), 36-48
Gawrychowski, Pawel
Kucherov, Gregory
Nekrich, Yakov
Starikovskaya, Tatiana
Minimal Discriminating Words Problem Revisited
In: String Processing and Information Retrieval - 20th International Symposium (SPIRE 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
Gawrychowski, Pawel
Manea, Florin
Nowotka, Dirk
Discovering Hidden Repetitions in Words
In: 9th Conference on Computability in Europe (CiE 2013), 210-219
Gawrychowski, Pawel
Straszak, Damian
Beating O(nm) in Approximate LZW-Compressed Pattern Matching
In: Algorithms and Computation - 24th International Symposium (ISAAC 2013), 78-88
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),
Heydrich, Sandy
van Stee, Rob
Attachment IconDividing connected chores fairly
In: 6th International Symposium on Algorithmic Game Theory, 420-433
Hoefer, Martin
Kesselheim, Thomas
Brief Announcement: Universally Truthful Secondary Spectrum Auctions
In: 25th Symposium on Parallelism in Algorithms and Architectures (SPAA-13), 99-101
Hoefer, Martin
Kesselheim, Thomas
Vöcking, Berthold
Truthfulness and Stochastic Dominance with Monetary Transfers.
In: 14th Conf. Electronic Commerce (EC-13), 567-582
Hoefer, Martin
Sauerwald, Thomas
Brief Announcement: Threshold Load Balancing in Networks
In: 32nd Symposium on Principles of Distributed Computing (PODC-13), 54-56
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
Hoefer, Martin
Wagner, Lisa
Locally Stable Marriage with Strict Preferences
In: 40th International Colloquium on Automata, Languages and Programming (ICALP-13), 620-631
Jez, ArturAttachment IconApproximation of Grammar-Based Compression via Recompression
In: 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 165-176
Jez, ArturAttachment IconOne-Variable Word Equations in Linear Time
In: 40th International Colloquium on Automata, Languages, and Programming (ICALP 2013), 324-335
Jez, ArturAttachment IconRecompression: a simple and powerful technique for word equations
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 233-244
Jez, ArturAttachment IconRecompression: Word Equations and Beyond
In: 17th International Conference on Developments in Language Theory (DLT 2013), 12-26
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
Jurkiewicz, Tomasz
Mehlhorn, Kurt
The cost of address translation
In: Proceedings of the Meeting on Algorithm Engineering & Experiments,
Khosla, MeghaBalls into Bins Made Faster
In: Algorithms - ESA 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),
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
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
Panagiotou, Konstantinos
Pourmiri, Ali
Sauerwald, Thomas
Faster Rumor Spreading with Multiple Calls
In: 24th International Symposium on Algorithms and Computation (ISAAC-13), 446-456
Schmidt, Jens M.A Planarity Test via Construction Sequences
In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), 765-776
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),
2
Hide details for Electronic Proceedings ArticleElectronic Proceedings Article
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
Wahlström, MagnusAbusing 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),
26
Hide details for Journal ArticleJournal Article
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact symbolic–numeric computation of planar algebraic curves
In: Theoretical Computer Science [491], 1-32
Bringmann, Karl
Friedrich, Tobias
Approximation Quality of the Hypervolume Indicator
In: Artificial Intelligence [195], 265–290
Bringmann, Karl
Friedrich, Tobias
Igel, Christian
Voß, Thomas
Speeding Up Many-Objective Optimization by Monte Carlo Approximations
In: Artificial Intelligence [204], 22–29
Chen, Xujin
Epstein, Leah
Kleiman, Elena
van Stee, Rob
Attachment IconMaximizing the minimum load: The cost of selfishness
In: Theoretical Computer Science [482], 9-19
Christodoulou, George
Kovacs, Annamaria
van Stee, Rob
Attachment IconA truthful constant approximation for maximizing the minimum load on related machines
In: Theoretical Computer Science [489-490], 88-98
Doerr, BenjaminImproved approximation algorithms for the Min-Max Selecting Items problem
In: Information Processing Letters [113], 747-749
Doerr, Benjamin
Goldberg, Leslie Ann
Adaptive Drift Analysis
In: Algorithmica [65], 224-250
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
Strong robustness of randomized rumor spreading protocols
In: Discrete Applied Mathematics [161], 778-793
Doerr, Benjamin
Jansen, Thomas
Sudholt, Dirk
Winzen, Carola
Zarges, Christine
Mutation rate matters even when optimizing monotonic functions
In: Evolutionary Computation [21], 1-27
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
Doerr, Benjamin
Kötzing, Timo
Lengler, Johannes
Winzen, Carola
Black-Box Complexities of Combinatorial Problems
In: Theoretical Computer Science [471], 84-106
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
Fanghänel, Alexander
Geulen, Sascha
Hoefer, Martin
Vöcking, Berthold
Online Capacity Maximization in Wireless Networks
In: Journal of Scheduling [16], 81-91
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
On the Insertion Time of Cuckoo Hashing
In: SIAM Journal on Computing [?], ?-?
Harks, Tobias
Hoefer, Martin
Klimm, Max
Skopalik, Alexander
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
In: Mathematical Programming [141], 193-215
Hoefer, MartinLocal Matching Dynamics in Social Networks
In: Information & Computation [222], 20-35
Hoefer, MartinStrategic Cooperation in Cost Sharing Games
In: International Journal of Game Theory [42], 29-53
Hoefer, Martin
Skopalik, Alexander
Altruism in Atomic Congestion Games
In: ACM Transactions on Economics and Computation [1], 21
Hoefer, Martin
Skopalik, Alexander
On the Complexity of Pareto-optimal Nash and Strong Equilibria
In: Theory of Computing Systems [53], 441-453
Jez, Artur
Maletti, Andreas
Hyper-minimization for deterministic tree automata
In: International Journal of Foundations of Computer Science [24], 815-830
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
Sanders, Peter
Singler, Johannes
van Stee, Rob
Attachment IconReal-time prefetching and caching
In: Journal of Scheduling [16], 47-58
Schmidt, Jens M.A Simple Test on 2-Vertex- and 2-Edge-Connectivity
In: Information Processing Letters [113], 241-244
Schmidt, Jens M.Contractions, Removals and Certifying 3-Connectivity in Linear Time
In: SIAM Journal on Computing [42], 494-535
van Stee, RobSIGACT News Online Algorithms Column 22
In: SIGACT News [44], 125
Winzen, CarolaDirection-Reversing Quasi-Random Rumor Spreading with Restarts
In: Information Processing Letters [113], 921-926
6
Hide details for Electronic Journal ArticleElectronic Journal Article
Case, John
Kötzing, Timo
Memory-limited non-U-shaped learning with solved open problems
In: Theoretical Computer Science [473], 100-123
Doerr, Benjamin
Doerr, Carola
Spöhel, Reto
Thomas, Henning
Playing Mastermind with Many Colors
In: arXiv [abs/1207.0773], 1-22
Kobel, Alexander
Sagraloff, Michael
Fast Approximate Polynomial Multipoint Evaluation and Applications
In: arXiv [abs/1304.8069], 17
Kollias, KonstantinosNonpreemptive Coordination Mechanisms for Identical Machines
In: Theory of Computing Systems [53], 424-440
Mehlhorn, Kurt
Sagraloff, Michael
Wang, Pengming
From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition
In: arXiv [abs/1301.4870],
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
Attachment IconA Case of Depth-3 Identity Testing, Sparse Factorization and Duality
In: Computational Complexity [22], 39-69
1
Hide details for Thesis - PhD thesisThesis - PhD thesis
Jurkiewicz, TomaszAttachment IconToward Better Computation Models for Modern Machines
Universität des Saarlandes
4
Hide details for Unpublished/DraftUnpublished/Draft
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
A Framework for the Verification of Certifying Computations
Elbassioni, Khaled
Chalermsook, Parinya
Nanongkai, Danupon
Sun, He
Multi-Attribute Profit-Maximizing Pricing
Schmidt, Jens M.Contractions, Removals and How to Certify 3-Connectivity in Linear Time
Yap, Chee
Sagraloff, Michael
Sharma, Vikram
Analytic Root Clustering: A Complete Algorithm using Soft Zero Tests
145
Hide details for 20122012
52
Hide details for Proceedings ArticleProceedings Article
Abed, Fidaa
Huang, Chien-Chung
Preemptive Coordination Mechanisms for Unrelated Machines
In: Algorithms - ESA 2012 : 20th Annual European Symposium, 12-23
Agrawal, Manindra
Saha, Chandan
Saptharishi, Ramprasad
Saxena, Nitin
Attachment IconJacobian 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
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
Alvarez, Victor
Bringmann, Karl
Curticapean, Radu
Ray, Saurabh
Attachment IconCounting Crossing Free Structures
In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), 61-68
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
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
Bringmann, Karl
Friedrich, Tobias
Attachment IconConvergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
In: GECCO'12 : Proceedings of the Fourteenth International Conference on
Genetic and Evolutionary Computation, 457-464
Bringmann, Karl
Panagiotou, Konstantinos
Attachment IconEfficient Sampling Methods for Discrete Distributions
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 133-144
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
Chen, Xujin
Doerr, Benjamin
Hu, Xiaodong
Ma, Weidong
van Stee, Rob
Winzen, Carola
Attachment IconThe Price of Anarchy for Selfish Ring Routing is Two
In: Internet and Network Economics : 8th International Workshop, WINE 2012, 420-433
Croitoru, Cosmina
Kötzing, Timo
Deliberative Acceptability of Arguments
In: STAIRS 2012 - Proceedings of the Sixth Starting AI Researchers' Symposium, 71-82
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
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
Doerr, BenjaminBlack-box complexity: from complexity theory to playing mastermind
In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, 1079-1092
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
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
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
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
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),
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
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
Elbassioni, KhaledA QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 513-524
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
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
Epstein, Leah
Jez, Lukasz
Sgall, Jiri
van Stee, Rob
Attachment IconOnline Scheduling of Jobs with Fixed Start Times on Related Machines
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 15th International Workshop, APPROX 2012 and 16th International Workshop, RANDOM 2012, 134-145
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
Gawrychowski, PawelFaster Algorithm for Computing the Edit Distance between SLP-Compressed Strings
In: String Processing and Information Retrieval : 19th International Symposium, SPIRE 2012, 229-236
Gawrychowski, PawelSimple and efficient LZW-compressed multiple pattern matching
In: Combinatorial Pattern Matching : 23rd Annual Symposium, CPM 2012, 232-242
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
Harren, Rolf
Kern, Walter
Improved Lower Bound for Online Strip Packing
In: Approximation and Online Algorithms : 9th International Workshop ,WAOA 2011, 211-218
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
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
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
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
Huang, Chien-ChungNon-preemptive Speed Scaling
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 249-260
Jain, Sanjay
Kötzing, Timo
Stephan, Frank
Enlarging Learnable Classes
In: Algorithmic Learning Theory : 23rd International Conference, ALT 2012, 36-50
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
Kim, Eun Jung
Paul, Christophe
Philip, Geevarghese
Attachment IconA Single-exponential FPT Algorithm for the K4-Minor Cover Problem
In: Algorithm Theory - SWAT 2012 : 13th Scandinavian Symposium and Workshops, 119-130
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
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
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
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
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
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
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
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
Sagraloff, MichaelWhen 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
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
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
Schmidt, Jens M.Certifying 3-Connectivity in Linear Time
In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, 786-797
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
van Zuylen, AnkeSimpler 3/4-approximation algorithms for MAX SAT
In: Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, 188-197
7
Hide details for Electronic Proceedings ArticleElectronic Proceedings Article
Doerr, Benjamin
Winzen, Carola
Playing Mastermind with Constant-Size Memory
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 441-452
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
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
Gawrychowski, PawelTying up the loose ends in fully LZW-compressed pattern matching
In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, 624-635
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
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
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
Suchy, Ondrej
Attachment IconBeyond Max-Cut: lambda-Extendible Properties
Parameterized Above the Poljak-Turzík Bound
In: 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), 412-423
59
Hide details for Journal ArticleJournal Article
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
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
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
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
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
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
Deconstructing Approximate Offsets
In: Discrete & Computational Geometry [48], 964-989
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
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithmica [63], 763-780
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Attachment IconA Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
In: Algorithmica [62], 1034-1049
Bonifaci, Vincenzo
Mehlhorn, Kurt
Varma, Girish
Physarum Can Compute Shortest Paths
In: Journal of Theoretical Biology [309], 121-133
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
Brightwell, Graham
Panagiotou, Konstantinos
Steger, Angelika
Extremal subgraphs of random graphs
In: Random Structures & Algorithms [41], 147-178
Bringmann, KarlAttachment IconAn improved algorithm for Klee's measure problem on fat boxes
In: Computational Geometry: Theory and Applications [45], 225-233
Bringmann, Karl
Friedrich, Tobias
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Theoretical Computer Science [425], 104-116
Case, John
Kötzing, Timo
Computability-theoretic learning complexity
In: Philosophical Transaction of the Royal Society A [370], 3570-3596
Case, John
Kötzing, Timo
Learning secrets interactively. Dynamic modeling in inductive inference
In: Information and Computation [220-221], 60-73
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
Chan, Ho-Leung
Megow, Nicole
Sitters, René
van Stee, Rob
Attachment IconA note on sorting buffers offline
In: Theoretical Computer Science [423], 11-18
De Sterck, HansA Nonlinear GMRES Optimization Algorithm for Canonical Tensor Decomposition
In: SIAM Journal on Scientific Computing [34], A1351-A1379
De Sterck, HansA Self-learning Algebraic Multigrid Method for Extremal Singular Triplets and Eigenpairs
In: SIAM Journal on Scientific Computing [34], A2092-A2117
Doerr, Benjamin
Fouz, Mahmoud
Friedrich, Tobias
Why Rumors Spread Fast in Social Networks
In: Communications of the ACM [55], 70-75
Doerr, Benjamin
Happ, Edda
Klein, Christian
Crossover can provably be useful in evolutionary computation
In: Theoretical Computer Science [425], 17-33
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
Multiplicative Drift Analysis
In: Algorithmica [64], 673-697
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
Non-existence of linear universal drift functions
In: Theoretical Computer Science [436], 71-86
Doerr, Benjamin
Winzen, Carola
Memory-restricted black-box complexity of OneMax
In: Information Processing Letters [112], 32-34
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
Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
Guarding 1.5D terrains with demands
In: International Journal of Computer Mathematics [89], 2143-2151
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, René
On the complexity of the highway problem
In: Theoretical Computer Science [460], 70-77
Elbassioni, Khaled
Tiwary, Hans Raj
Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Theoretical Computer Science [421], 56-61
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [62], 754-766
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
Epstein, Leah
Levin, Asaf
van Stee, Rob
Attachment IconApproximation Schemes for Packing Splittable Items with Cardinality Constraints
In: Algorithmica [62], 102-129
Epstein, Leah
van Stee, Rob
Attachment IconThe price of anarchy on uniformly related machines revisited
In: Information and Computation [212], 37-54
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
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
Tight Load Thresholds for Cuckoo Hashing
In: Random Structures and Algorithms [41], 306-333
Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
Quasirandom Load Balancing
In: SIAM Journal on Computing [41], 747-771
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
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
Harren, Rolf
van Stee, Rob
Absolute Approximation Ratios for Packing Rectangles into Bins
In: Journal of Scheduling [15], 63-75
Heinz, Jeffrey
Kasprzik, Anna
Kötzing, Timo
Learning in the limit with lattice-structured hypothesis spaces
In: Theoretical Computer Science [457], 111 - 127
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
Kavitha, Telikepalli
Mestre, Julián
Max-coloring paths: tight bounds and extensions
In: Journal of Combinatiorial Optimization [24], 1-14
Kayal, Neeraj
Saha, Chandan
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: The ACM Transactions on Computation Theory [4], 9:1-9:15
Kerber, Michael
Sagraloff, Michael
A worst-case bound for topology computation of algebraic curves
In: Journal of Symbolic Computation [47], 239-258
Knauer, Christian
Schlipf, Lena
Schmidt, Jens M.
Tiwary, Hans Raj
Largest Inscribed Rectangles in Convex Polygons
In: Journal of Discrete Algorithms [13], 78-85
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
Krivelevich, Michael
Spöhel, Reto
Creating small subgraphs in Achlioptas processes with growing parameter
In: SIAM Journal on Discrete Mathematics [26], 670-686
Megow, Nicole
Mehlhorn, Kurt
Schweitzer, Pascal
Online Graph Exploration: New Results on Old and New Algorithms
In: Theoretical Computer Science [463], 62-72
Meyerhenke, Henning
Sauerwald, Thomas
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning
In: Algorithmica [64], 329-361
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Attachment IconOn Parameterized Independent Feedback Vertex Set
In: Theoretical Computer Science [461], 65-75
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
Attachment IconFPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146
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
Panagiotou, Konstantinos
Sinha, Makrand
Vertices of degree k in random unlabeled trees
In: Journal of Graph Theory [69], 114-130
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
Schmidt, Jens M.Construction Sequences and Certifying 3-Connectivity
In: Algorithmica [62], 192-208
Soranzo, Nicola
Ramezani, Fahimeh
Iacono, Giovanni
Altafini, Claudio
Decompositions of large-scale biological systems based on dynamical properties
In: Bioinformatics [28], 76-83
van Stee, RobAttachment IconAn improved algorithm for online rectangle filling
In: Theoretical Computer Science [423], 59-74
van Stee, RobAttachment IconSIGACT News Online Algorithms Column 20: The Power of Harmony
In: SIGACT News [43], 127-136
van Stee, RobAttachment IconSIGACT News Online Algorithms Column 21: APPROX and ALGO
In: SIGACT News [43], 123-129
8
Hide details for Electronic Journal ArticleElectronic Journal Article
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
Agrawal, Manindra
Saha, Chandan
Saxena, Nitin
Attachment IconQuasi-polynomial Hitting-set for Set-depth-Delta Formulas
In: arXiv [abs/1209.2333], 1-13
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Exact Symbolic-Numeric Computation of Planar Algebraic Curves
In: arXiv [abs/1201.1548v1], 1-46
Doerr, Benjamin
Moran, Shay
Moran, Shlomo
Winzen, Carola
Simple and Optimal Fault-Tolerant Rumor Spreading
In: arXiv [abs/1209.6158], 1-18
Doerr, Benjamin
Winzen, Carola
Playing Mastermind with Constant-Size Memory
In: Theory of Computing Systems [Online First], 1-27
Duan, Ran
Mehlhorn, Kurt
A Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
In: arXiv [abs/1212.0979v1], 1-8
Emeliyanenko, PavelAttachment IconComputing resultants on Graphics Processing Units: Towards GPU-accelerated computer algebra
In: Journal of Parallel and Distributed Computing [In press], 1-14
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
3
Hide details for Thesis - Bachelor thesisThesis - Bachelor thesis
Becker, RubenThe Bolzano Method to Isolate the Roots of a Bitstream Polynomial
Universität des Saarlandes
Feldmann, MatthiasStochastic optimization with fitness proportional ant systems

Universität des Saarlandes
Heydrich, SandyDividing connected chores fairly
Universität des Saarlandes
6
Hide details for Thesis - Masters thesisThesis - Masters thesis
Croitoru, CosimaAlgorithmic aspects of abstract argumentation frameworks
Universität des Saarlandes
Krohmer, AntonFinding cliques in scale-free networks
Universität des Saarlandes
Molter, HendrikACO beats EA on a dynamic pseudo-Boolean function
Universität des Saarlandes
Moran, ShayShattering extremal systems
Universität des Saarlandes
Ott, SebastianThou shalt not lie : on truthfully maximizing the minimum load on selfish related machines
Universität des Saarlandes
Wang, PengmingCertification of Curve Arrangements
Universität des Saarlandes
2
Hide details for Thesis - PhD thesisThesis - PhD thesis
Emeliyanenko, PavelHarnessing the Power of GPUs for Problems in Real Algebraic Geometry
Universität des Saarlandes
Fouz, MahmoudRandomized Rumor Spreading in Social Networks & Complete Graphs
Universität des Saarlandes
7
Hide details for Unpublished/DraftUnpublished/Draft
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),
Bringmann, Karl
Mehlhorn, Kurt
Neumann, Adrian
Attachment IconRemarks on Category-Based Routing in Social Networks
De Sterck, HansSteepest Descent Preconditioning for Nonlinear GMRES Optimization
Mehlhorn, Kurt
Neumann, Adrian
Schmidt, Jens M.
Attachment IconCertifying 3-Edge-Connectivity
P. GaoDistribution of the number of spanning regular subgraphs in random graphs
P. GaoDistributions of sparse spanning subgraphs in random graphs
P. GaoUniform generation of d-factors in dense host graphs
1
Hide details for MiscellaneousMiscellaneous
Sagraloff, MichaelExaktes geometrisches Rechnen
151
Hide details for 20112011
1
Hide details for BookBook
Auger, Doerr (ed.)Theory of Randomized Search Heuristics
64
Hide details for Proceedings ArticleProceedings Article
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
Alkassar, Eyad
Böhme, Sascha
Mehlhorn, Kurt
Rizkallah, Christine
Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82
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
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
Arumugam, S.
Chandrasekar, K. Raja
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
Attachment IconAlgorithmic 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
Asano, Tetsuo
Doerr, Benjamin
Memory-constrained algorithms for shortest path problem
In: 23rd Annual Canadian Conference on Computational Geometry (CCCG 2011), 315-319
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Marchetti-Spaccamela, Alberto
van der Ster, Suzanne
Stougie, Leen
Attachment IconMixed-criticality scheduling of sporadic task systems
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 555-566
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
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
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
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
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
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
Berenbrink, Petra
Hoefer, Martin
Sauerwald, Thomas
Distributed Selfish Load Balancing on Networks
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 1487-1497
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
Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese
Attachment IconPattern-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
Bredereck, Robert
Nichterlein, Andr{\'e}
Niedermeier, Rolf
Philip, Geevarghese
Attachment IconThe 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
Bringmann, Karl
Friedrich, Tobias
Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752
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
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
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
Doerr, BenjaminDrift analysis
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 1311-1320
Doerr, Benjamin
Fouz, Mahmoud
Asymptotically Optimal Randomized Rumor Spreading
In: Automata, Languages and Programming : 38th International Colloquium, ICALP 2011, 502-513
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
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
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
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
Doerr, Benjamin
Johannsen, Daniel
Schmidt, Martin
Attachment IconRuntime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 119-126
Doerr, Benjamin
Kötzing, Timo
Winzen, Carola
Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050
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
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
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
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
Emeliyanenko, PavelAttachment IconHigh-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224
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
Fernau, Henning
Fomin, Fedor V.
Lokshtanov, Daniel
Mnich, Matthias
Philip, Geevarghese
Saurabh, Saket
Attachment IconRanking and Drawing in Subexponential Time
In: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers,
Fomin, Fedor V.
Lokshtanov, Daniel
Misra, Neeldhara
Philip, Geevarghese
Saurabh, Saket
Attachment IconHitting 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
Fomin, Fedor V.
Philip, Geevarghese
Villanger, Yngve
Attachment IconMinimum Fill-in of Sparse Graphs: Kernelization and Approximation
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, December 12-14, 2011, Mumbai, India, 164-175
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
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
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
Harren, Rolf
Jansen, Klaus
Prädel, Lars
van Stee, Rob
Attachment IconA (5/3 + ε)-Approximation for Strip Packing
In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, 475-487
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
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
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
Huang, Chien-Chung
Kavitha, Telikepalli
Near-popular matchings in the Roommates problem
In: 19th European Symposium on Algorithms (ESA),
Huang, Chien-Chung
Kavitha, Telikepalli
Popular Matchings in the Stable Marriage Problem
In: 38th International Colloquium on Automata, Languages and Programming (ICALP),
Kayal, Neeraj
Saha, Chandan
Attachment IconOn the Sum of Square Roots of Polynomials and Related Problems
In: 26th IEEE Conference on Computational Complexity (CCC), 292-299
Kerber, Michael
Sagraloff, Michael
Efficient Real Root Approximation
In: ISSAC 2011 : Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 209-216
Kötzing, TimoIterative Learning from Positive Data and Counters
In: Algorithmic Learning Theory : 22nd International Conference, ALT 2011, 40-54
Kötzing, Timo
Neumann, Frank
Spöhel, Reto
PAC learning and genetic programming
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2091-2096
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
Kötzing, Timo
Sudholt, Dirk
Theile, Madeleine
How crossover helps in pseudo-Boolean optimization
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 989-996
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
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
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
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
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Attachment IconOn 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
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
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
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
Sauerwald, Thomas
Stauffer, Alexandre
Rumor Spreading and Vertex Expansion on Regular Graphs
In: 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA-11), 462-475
van Stee, RobAttachment IconAn improved algorithm for online rectangle filling
In: Approximation and Online Algorithms : 8th International Workshop, WAOA 2010, 249-260
Wagner, Markus
Veeramachaneni, Kalyan
Neumann, Frank
O'Reilly, Una-May
Attachment IconOptimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10
8
Hide details for Electronic Proceedings ArticleElectronic Proceedings Article
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
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
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
Elbassioni, Khaled
Rauf, Imran
Ray, Saurabh
Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442
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
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
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
van Zuylen, Anke
Schalekamp, Frans
Williamson, David P.
Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270
56
Hide details for Journal ArticleJournal Article
Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julian
Approximation Algorithms for the Interval Constrained Coloring Problem
In: Algorithmica [61], 342-361
Bansal, Nikhil
Chan, Ho-Leung
Pruhs, KIrk
Competitive Algorithms for Due Date Schedulin
In: Algorithmica [59], 569-582
Bar-Yehuda, Reuven
Hermelin, Danny
Rawitz, Dror
Minimum vertex cover in rectangle graphs
In: Computational Geometry [44], 356-364
Baswana, Surender
Kavitha, Telikepalli
Mehlhorn, Kurt
Pettie, Seth
Additive Spanners and (α, β)-Spanners
In: ACM Transactions on Algorithms [7], 5:1-5:26
Beier, Rene
Funke, Stefan
Matijevic, Domagoj
Sanders, Peter
Energy-Efficient Paths in Radio Networks
In: Algorithmica [61], 298-319
Ben-Zwi, Oren
Hermelin, Danny
Lokshtanov, Daniel
Newman, Ilan
Treewidth governs the complexity of target set selection
In: Discrete Optimization [8], 87-96
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
Attachment IconMinimizing Flow Time in the Wireless Gathering Problem
In: ACM Transactions on Algorithms [7], 33:1-33:20
Bonifaci, Vincenzo
Korteweg, Peter
Marchetti-Spaccamela, Alberto
Stougie, Leen
Attachment IconThe Distributed Wireless Gathering Problem
In: Theoretical Computer Science [412], 633-641
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
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
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
Chin, Francis Y. L.
Guo, Zeyu
Sun, He
Minimum Manhattan Network is NP-Complete
In: Discrete & Computational Geometry [45], 701-722
Cygan, Marek
Philip, Geevarghese
Pilipczuk, Marcin
Pilipczuk, Micha\l{}
Wojtaszczyk, Jakub Onufry
Attachment IconDominating set is fixed parameter tractable in claw-free graphs
In: Theoretical Computer Science [412], 6982-7000
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
Doerr, Benjamin
Eremeev, Anton
Neumann, Frank
Theile, Madeleine
Thyssen, Christian
Evolutionary algorithms and dynamic programming
In: Theoretical Computer Science [412], 6020-6035
Doerr, Benjamin
Fouz, Mahmoud
Quasi-random rumor spreading: Reducing randomness can be costly
In: Information Processing Letters [111], 227-230
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
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
Doerr, Benjamin
Jansen, Thomas
Theory of Evolutionary Computation
In: Algorithmica [59], 299-300
Doerr, Benjamin
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
Runtime analysis of the 1-ANT ant colony optimizer
In: Theoretical Computer Science [412], 1629-1644
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
Elbassioni, Khaled
Krohn, Erik
Matijevic, Domagoj
Mestre, Julian
Severdija, Domagoj
Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [60], 451-463
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304
Elbassioni, Khaled
Tiwary, Hans Raj
On a cone covering problem
In: Computational Geometry [44], 129-134
Elsaesser, Robert
Sauerwald, Thomas
Tight bounds for the cover time of multiple random walks
In: Theoretical Computer Science [412], 2623-2641
Epstein, Leah
Levin, Asaf
van Stee, Rob
Attachment IconMax-min online allocations with a reordering buffer
In: SIAM Journal on Discrete Mathematics [25], 1230-1250
Epstein, Leah
van Stee, Rob
Attachment IconImproved results for a memory allocation problem
In: Theory of Computing Systems [48], 79-92
Epstein, Leah
van Stee, Rob
On the online unit clustering problem
In: ACM Transactions on Algorithms [7], 7:1-7:1
Farzan, Arash
Munro, J. Ian
Succinct representation of dynamic trees
In: Theoretical Computer Science [412], 2668-2678
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
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
Fountoulakis, Nikolaos
Panagiotou, Konstantinos
3-Connected Cores In Random Planar Graphs
In: Combinatorics, Probability & Computing [20], 381-412
Friedrich, Tobias
Hebbinghaus, Nils
Average update times for fully-dynamic all-pairs shortest paths
In: Discrete Applied Mathematics [159], 1751-1758
Friedrich, Tobias
Horoba, Christian
Neumann, Frank
Illustration of fairness in evolutionary multi-objective optimization
In: Theoretical Computer Science [412], 1546-1556
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
Smoothed analysis of balancing networks
In: Random Structures & Algorithms [39], 115-138
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
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
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
Hermelin, Danny
Rawitz, Dror
Optimization problems in multiple subtree graphs
In: Discrete Applied Mathematics [159], 588-594
Huang, Chien-Chung
Kavitha, Telikepalli
Michael, Dimitrios
Nasr, Meghana
Bounded Unpopularity Matchings
In: Algorithmica [61], 738-757
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: Algorithmica [59], 471-488
Kavitha, Telikepalli
Mestre, Julian
Nasre, Meghana
Popular mixed matchings
In: Theoretical Computer Science [412], 2679-2690
Kerber, Michael
Sagraloff, Michael
A Note on the Complexity of Real Algebraic Hypersurfaces
In: Graphs and Combinatorics [27], 419-430
Manjunath, Madhusudan
Sharma, Vikram
Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649
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
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
Certifying algorithms
In: Computer Science Review [5], 119-161
Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528
Mehlhorn, Kurt
Sagraloff, Michael
A deterministic algorithm for isolating real roots of a real polynomial
In: Journal of Symbolic Computation [46], 70-90
Müller, Tobias
Perez-Gimenez, Xavier
Wormald, Nicholas
Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322
Neumann, Frank
Reichel, Joachim
Skutella, Martin
Computing Minimum Cuts by Randomized Search Heuristics
In: Algorithmica [59], 323-342
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
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
van Zuylen, AnkeAn improved monotone algorithm for scheduling related machines with precedence constraints
In: Operations Research Letters [39], 423-427
van Zuylen, AnkeDeterministic Sampling Algorithms for Network Design
In: Algorithmica [60], 110-151
van Zuylen, AnkeLinear programming based approximation algorithms for feedback set problems in bipartite tournaments.
In: Theoretical Computer Science [412], 2556-2561
Wahlström, MagnusNew Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282
7
Hide details for Electronic Journal ArticleElectronic Journal Article
Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael
Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697],
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158],
Doerr, Benjamin
Fouz, Mahmoud
Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302
Doerr, Benjamin
Winzen, Carola
Memory-Restricted Black-Box Complexity
In: Electronic Colloquium on Computational Complexity [18], 7
Mütze, Torsten
Spöhel, Reto
On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33
Rizkallah, ChristineMaximum Cardinality Matching
In: Archive of Formal Proofs,
Sagraloff, MichaelWhen Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21
1
Hide details for Thesis - Bachelor thesisThesis - Bachelor thesis
Busch, Philip JohannesAnalysis of the KIT email graph, with an application of randomized rumour spreading protocols
Universität des Saarlandes
3
Hide details for Thesis - Masters thesisThesis - Masters thesis
Ingalalli, VijayEvolutionary algorithms to compute lower bounds for the star discrepancy
Universität des Saarlandes
Kobel, AlexanderCertified numerical root finding
Universität des Saarlandes
Neumann, AdrianImplementation of Schmidt's algorithm for certifying triconnectivity testing
Universität des Saarlandes
2
Hide details for Thesis - PhD thesisThesis - PhD thesis
Philip, GeevargheseAttachment IconThe Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute
Winzen, CarolaToward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes
9
Hide details for Unpublished/DraftUnpublished/Draft
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
A lower bound for discounting algorithms solving two-person zero-sum limit average payoff stochastic games
Canzar, Stefan
Elbassioni, Khaled
Klau, Gunnar W.
Mestre, Julian
On Tree-Constrained Matchings and Generalizations
Celikik, Marjan
Bast, Holger
Manolache, Gabriel
Attachment IconEfficient Index-Based Snippet Generation
De Sterck, Hans
Henson, Van Emden
Sanders, Geoff
Multilevel Aggregation Methods for Small-World Graphs with Application to Random-Walk Ranking
Fountoulakis, Nikolaos
Friedrich, Tobias
Hermelin, Danny
Average Case Parameterized Complexity
Gao, Pu (Jane)Distribution of spanning regular subgraphs in random graphs
Jurkiewicz, Tomasz
Danilewski, Piotr
Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations.
Rizkallah, ChristineAttachment IconGlivenko and Kuroda for Simple Type Theory
Winzen, CarolaDirection-Reversing Quasi-Random Rumor Spreading with Restarts
144
Hide details for 20102010
1
Hide details for BookBook
Neumann, Frank
Witt, Carsten
Bioinspired Computation in Combinatorial Optimization : Algorithms and Their Computational Complexity
3
Hide details for Part of a BookPart of a Book
Berberich, Eric
Hagen, Matthias
Hiller, Benjamin
Moser, Hannes
Experiments
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 325-388
Megow, NicoleKeller oder Dach zuerst
In: Besser als Mathe, 111-116
Mörig, Marc
Scholz, Sven
Tscheuschner, Tobias
Berberich, Eric
Implementation aspects
In: Algorithm Engineering : Bridging the Gap between Algorithm Theory and Practice, 237-289
74
Hide details for Proceedings ArticleProceedings Article
Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S.
Attachment IconOn the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25
Angelopoulos, SpyrosOn the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12
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
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
Baruah, Sanjoy
Bonifaci, Vincenzo
D'Angelo, Gianlorenzo
Li, Haohan
Marchetti-Spaccamela, Alberto
Megow, Nicole
Stougie, Leen
Attachment IconScheduling Real-Time Mixed-Criticality Jobs
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 90-101
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
Blelloch, Guy E.
Farzan, Arash
Succinct Representations of Separable Graphs
In: Combinatorial Pattern Matching : 21st Annual Symposium, CPM 2010, 138-150
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
Bonifaci, Vincenzo
Chan, Ho-Leung
Marchetti-Spaccamela, Alberto
Megow, Nicole
Attachment IconAlgorithms and Complexity for Periodic Real-Time Scheduling
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1350-1359
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Attachment IconFeasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems
In: Algorithms - ESA 2010 : 18th Annual European Symposium. - Pt. II, 230-241
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
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
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
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
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
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
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
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
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
Christodoulou, George
Chung, Christine
Ligett, Katrina
Pyrga, Evangelia
van Stee, Rob
Attachment IconOn the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97
Christodoulou, George
Elbassioni, Khaled
Fouz, Mahmoud
Truthful Mechanisms for Exhibitions
In: Internet and Network Economics : 6th International Workshop, WINE 2010, 170-181
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
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
Christodoulou, Giorgos
Ligett, Katrina
Pyrga, Evangelia
Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441
Doerr, Benjamin
Fouz, Mahmoud
Witt, Carsten
Quasirandom Evolutionary Algorithms
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1457-1464
Doerr, Benjamin
Goldberg, Leslie Ann
Adaptive Drift Analysis
In: Parallel Problem Solving from Nature -- PPSN XI. -- Pt. 1, 32-41
Doerr, Benjamin
Goldberg, Leslie Ann
Drift Analysis with Tail Bounds
In: Parallel Problem Solving from Nature – PPSN XI. - Pt. 1, 174-183
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
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
Doerr, Benjamin
Johannsen, Daniel
Attachment IconEdge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766
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
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
Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola
Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456
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
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
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
Elbassioni, Khaled
Matijevic, Domagoj
Severdija, Domagoj
Guarding 1.5-Dimensional with Demands
In: 26th European Workshop on Computational Geometry (EuroCG 2010), 133-136
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
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
The Magic of a Number System
In: Fun with Algorithms : 5th International Conference, FUN 2010, 156-165
Emeliyanenko, PavelAttachment IconA complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43
Emeliyanenko, PavelAttachment IconModular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440
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
Epstein, Leah
Levin, Asaf
van Stee, Rob
Attachment IconMax-min online allocations with a reordering buffer
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 336-347
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
Fernau, Henning
Fomin, Fedor V.
Philip, Geevarghese
Saurabh, Saket
Attachment IconThe Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43
Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos
Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560
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
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
Friedrich, Tobias
Gairing, Martin
Sauerwald, Thomas
Quasirandom Load Balancing
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1620-1629
Friedrich, Tobias
Sauerwald, Thomas
The Cover Time of Deterministic Random Walks
In: Computing and Combinatorics : 16th Annual International Conference, COCOON 2010, 130-139
Gotthilf, Zvi
Hermelin, Danny
Landau, Gad M.
Lewenstein, Moshe
Restricted LCS
In: 17th International Symposium on String Processing and Information Retrieval, 250-257
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
Guibas, Leonidas
Milosavljevic, Nikola
Motskin, Arik
Attachment IconConnected Dominating Sets on Dynamic Geometric Graphs
In: Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG2010), 27-30
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
Huang, Chien-ChungClassified stable matching
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1235-1253
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
Johannsen, Daniel
Lengler, Johannes
Attachment IconCan Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440
Johannsen, Daniel
Panagiotou, Konstantinos
Attachment IconVertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447
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
Kasprzik, Anna
Kötzing, Timo
String Extension Learning Using Lattices
In: Language and Automata Theory and Applications : 4th International Conference, LATA 2010, 380-391
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
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
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
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
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
Kratsch, Stefan
Wahlström, Magnus
Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665
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
Mehlhorn, KurtReliable and Efficient Geometric Computing
In: Mathematical Software, ICMS 2010 : Third International Congress
on Mathematical Software, 10-11
Mehlhorn, Kurt
Schweitzer, Pascal
Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Attachment IconThe 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
Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath
Attachment IconFPT 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
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
Philip, Geevarghese
Raman, Venkatesh
Villanger, Yngve
Attachment IconA Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207
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
3
Hide details for Electronic Proceedings ArticleElectronic Proceedings Article
Berberich, Eric
Halperin, Dan
Kerber, Michael
Pogalnikova, Roza
Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68
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
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
1
Hide details for PosterPoster
Emeliyanenko, PavelAccelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), -
43
Hide details for Journal ArticleJournal Article
Ajwani, Deepak
Friedrich, Tobias
Average-case Analysis of Incremental Topological Ordering
In: Discrete Applied Mathematics [158], 240-250
Angelopoulos, Spyros
Borodin, Allan
Randomized Priority Algorithms
In: Theoretical Computer Science [411], 2542-2558
Baruah, Sanjoy
Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Attachment IconImproved Multiprocessor Global Schedulability Analysis
In: Real-Time Systems [46], 3-24
Basit, Abdul
Mustafa, Nabil H.
Ray, Saurabh
Raza, Sarfraz
Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600
Batra, Prashant
Sharma, Vikram
Bounds on absolute positiveness of multivariate polynomials
In: Journal of Symbolic Computation [45], 617-628
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
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
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
Bonifaci, Vincenzo
Harks, Tobias
Schäfer, Guido
Attachment IconStackelberg Routing in Arbitrary Networks
In: Mathematics of Operations Research [35], 330 - 346
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
Makino, Kazuhisa
On effectivity functions of game forms
In: Games and Economic Behavior [68], 512-531
Boros, Endre
Elbassioni, Khaled
Makino, Kazuhisa
Left-to-right multiplication for monotone Boolean dualization
In: SIAM Journal on Computing [39], 3424-3439
Bringmann, Karl
Friedrich, Tobias
An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402
Bringmann, Karl
Friedrich, Tobias
Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610
Butman, Ayelet
Hermelin, Danny
Lewenstein, Moshe
Rawitz, Dror
Optimization problems in multiple-interval graphs
In: ACM Transactions on Algorithms [6], 40,1-40,18
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
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
Deterministic Random Walks on Regular Trees
In: Random Structures and Algorithms [37], 353-366
Doerr, Benjamin
Fouz, Mahmoud
Hereditary Discrepancies in Different Numbers of Colors II
In: SIAM Journal on Discrete Mathematics [24], 1205-1213
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
Doerr, Benjamin
Neumann, Frank
In Memoriam: Ingo Wegener
In: Algorithmica [58], 541-542
Doerr, Benjamin
Neumann, Frank
Wegener, Ingo
Editorial
In: Algorithmica [57], 119-120
Elbassioni, Khaled
Rauf, Imran
Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363
Elmasry, AmrPairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110
Elmasry, AmrThe longest almost-increasing subsequence
In: Information Processing Letters [110], 655-658
Epstein, Leah
van Stee, Rob
Maximizing the minimum load for selfish agents
In: Theoretical Computer Science [411], 44-57
Epstein, Leah
van Stee, Rob
Attachment IconOn the online unit clustering problem
In: ACM Transactions on Algorithms [7], 1-18
Friedrich, Tobias
Hebbinhaus, Nils
Neumann, Frank
Plateaus Can Be Harder in Multi-Objective Optimization
In: Theoretical Computer Science [411], 854-864
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
Friedrich, Tobias
Neumann, Frank
When to Use Bit-Wise Neutrality
In: Natural Computing [9], 283 - 294
Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
Assigning Papers to Referees
In: Algorithmica [58], 119-136
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
Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Philippas
NBmalloc: Allocating Memory in a Lock-Free Manner
In: Algorithmica [58], 304-338
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
Huang, Chien-ChungCircular stable matching and 3-way kidney transplant
In: Algorithmica [58], 137-150
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
Jansen, Thomas
Neumann, Frank
Editorial for the Special Issue on Theoretical Aspects of Evolutionary Multi-Objective Optimization
In: Evolutionary Computation [18], 333-334
Mehlhorn, Kurt
Ray, Saurabh
Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683
Mestre, JulianAdaptive local ratio
In: SIAM Journal on Computing [39], 3038-3057
Mustafa, Nabil H.
Ray, Saurabh
Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895
Neumann, Frank
Witt, Carsten
Ant Colony Optimization and the minimum spanning tree problem
In: Theoretical Computer Science [411], 2406-2413
Panagiotou, Konstantinos
Steger, Angelika
Maximal Biconnected Subgraphs of Random Planar Graphs
In: ACM Transactions on Algorithms [6], 31,1-31,21
Rusinov, Momchil
Schweitzer, Pascal
Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262
Sagraloff, MichaelA General Approach to Isolating Roots of a Bitstream Polynomial
In: Mathematics in Computer Science [4], 481-506
Schweitzer, Pascal
Schweitzer, Patrick
Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15
9
Hide details for Electronic Journal ArticleElectronic Journal Article
Amini, Omid
Manjunath, Madhusudan
Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50
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
Elmasry, Amr
Mehlhorn, Kurt
Schmidt, Jens M.
An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13
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
Friedrich, Tobias
Sauerwald, Thomas
The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24
Kavitha, Telikepalli
Mestre, Julian
Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14
McConnella, Ross M.
Mehlhorn, Kurt
Näher, Stefan
Schweitzer, Pascal
Certifying algorithms
In: Computer Science Review [Article in Press], 1-43
Sagraloff, MichaelOn the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33
2
Hide details for ReportReport
Althaus, Ernst
Altmeyer, Sebastian
Naujoks, Rouven
A New Combinatorial Approach to Parametric Path Analysis
Berberich, Eric
Hemmer, Michael
Kerber, Michael
A Generic Algebraic Kernel for Non-linear Geometric Applications
5
Hide details for Thesis - PhD thesisThesis - PhD thesis
Harren, RolfTwo-dimensional packing problems
Universität des Saarlandes
Huber, AnnaRandomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes
Johannsen, DanielAttachment IconRandom combinatorial structures and randomized search heuristics
Universität des Saarlandes
Kratsch, StefanKernelization of generic problems : upper and lower bounds
Universität des Saarlandes
Pyrga, EvangeliaAlgorithmic Game Theory and Networks
Universität des Saarlandes
3
Hide details for Unpublished/DraftUnpublished/Draft
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
Elbassioni, Khaled
Rauf, Imran
Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry
Gao, Pu (Jane)
Wormald, Nicholas
Su, Yi
Attachment IconInduced subgraphs in sparse random graphs with given degree sequence
126
Hide details for 20092009
6
Hide details for Part of a BookPart of a Book
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307
Bast, HannahCar or Public Transport -- Two Worlds
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 355-367
Bast, Holger
Funke, Stefan
Matijevic, Domagoj
Ultrafast shortest-path queries via transit nodes
In: The shortest path problem : ninth DIMACS implemenation challenge, 175-192
Doerr, BenjaminIntroducing 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
Krumke, Sven
van Stee, Rob
Westphal, Stefan
Attachment IconOnline job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454
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
1
Hide details for ProceedingsProceedings
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.
65
Hide details for Proceedings ArticleProceedings Article
Althaus, Ernst
Dumitriu, Daniel
Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50
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
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
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
Angelopoulos, SpyrosOnline Priority Steiner Tree Problems
In: Algorithms and Data Structures : 11th International Symposium, WADS 2009, 37-48
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
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
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
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
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
Bhaskar, Umang
Fleischer, Lisa
Hoy, Darrell
Huang, Chien-Chung
Attachment IconEquilibria of Atomic Flow Games are not Unique
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 748-757
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
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
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
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
Celikik, Marjan
Bast, Holger
Attachment IconFast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731
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
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
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
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
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
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
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
Doerr, Benjamin
Huber, Anna
Levavi, Ariel
Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821
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
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
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
Attachment IconOn the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505
Elbassioni, Khaled
Makino, Kazuhisa
Rauf, Imran
Attachment IconOutput-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154
Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
Sitters, Rene
Attachment IconOn Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286
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
Elbassioni, Khaled
Tiwary, Hans Raj
Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422
Elmasry, AmrAttachment IconPairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476
Elmasry, Amr
Manjunath, Madhusudan
Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103
Emeliyanenko, PavelAttachment IconEfficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149
Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael
Attachment IconVisualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619
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
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
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
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
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
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
Friedrich, Tobias
Sauerwald, Thomas
Vilenchik, Dan
Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483
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
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
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
Hemmer, Michael
Hülse, Dominik
Attachment IconGeneric implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324
Hemmer, Michael
Limbach, Sebastian
Schömer, Elmar
Attachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316
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
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
Johannsen, Daniel
Razgon, Igor
Wahlström, Magnus
Attachment IconSolving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85
Kavitha, Telikepalli
Mestre, Julian
Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96
Kavitha, T.
Mestre, Julián
Nasre, M.
Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584
Kerber, MichaelAttachment IconOn the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167
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
Kratsch, Stefan
Wahlström, Magnus
Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275
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
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
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
Panagiotou, KonstantinosVertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45
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
Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath
Attachment IconSolving 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
Pyrga, Evangelia
Chung, Christine
Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195
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
Vidali, AngelinaThe Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350
Wahlström, MagnusNew Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355
6
Hide details for Electronic Proceedings ArticleElectronic Proceedings Article
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
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
Giesen, Joachim
Manjunath, Madhusudan
Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16
Kratsch, StefanPolynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612
Panagiotou, KonstantinosBlocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744
Shervashidze, Nino
Vishwanathan, S .V. N.
Petri, Tobias H.
Mehlhorn, Kurt
Borgwardt, Karsten M.
Attachment IconEfficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495
35
Hide details for Journal ArticleJournal Article
Amini, Omid
Pérennes, Stéphane
Sau, Ignasi
Hardness and approximation of traffic grooming
In: Theoretical Computer Science [410], 3751-3760
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
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
Burnikel, Christoph
Funke, Stefan
Mehlhorn, Kurt
Schirra, Stefan
Schmitt, Susanne
A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28
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
Chan, T.-H. Hubert
Gupta, Anupam
Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44
Christodoulou, George
Koutsoupias, Elias
Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59
Christodoulou, George
Koutsoupias, Elias
Nanavati, Akash
Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740
Cilleruelo, Javier
Hebbinghaus, Nils
Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611
Cooley, Oliver
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297
Doerr, Benjamin
Fouz, Mahmoud
A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339
Doerr, Benjamin
Friedrich, Tobias
Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144
Doerr, Benjamin
Friedrich, Tobias
Sauerwald, Thomas
Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247
Eisenbrand, Friedrich
Karrenbauer, Andreas
Skutella, Martin
Xu, Chihao
Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596
Elbassioni, KhaledAlgorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510
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
Elmasry, AmrComputing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086
Epstein, Leah
van Stee, Rob
Tamir, Tami
Attachment IconPaging with request sets
In: Theory of Computing Systems [44], 67-81
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
Fountoulakis, Nikolaos
Kühn, Daniela
Osthus, Deryk
Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462
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
Friedrich, Tobias
Oliveto, Pietro
Sudholt, Dirk
Witt, Carsten
Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476
Gandhi, Rajiv
Mestre, Julián
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71
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
Harren, RolfAttachment IconApproximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532
Kavitha, T.
Liebchen, Ch.
Mehlhorn, K.
Michail, D.
Rizzi, R.
Ueckerdt, T.
Zweig, K.
Attachment IconCycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243
Kerber, MichaelDivision-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200
Kowalik, LukaszImproved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68
Neumann, Frank
Witt, Carsten
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255
Panagiotou, KonstantinosThe Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681
Sanders, Peter
Sivadasan, Naveen
Skutella, Martin
Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498
Schweitzer, PascalUsing the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232
7
Hide details for Electronic Journal ArticleElectronic Journal Article
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
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
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
Gidenstam, Anders
Papatriantafilou, Marina
Tsigas, Phillipas
NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35
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
Mehlhorn, K.
Michail, D.
Attachment IconMinimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13
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
1
Hide details for Thesis - Masters thesisThesis - Masters thesis
Jurkiewicz, TomaszCycle Bases in Graphs
Universität des Saarlandes
3
Hide details for Thesis - PhD thesisThesis - PhD thesis
Happ, EddaAnalyses of Evolutionary Algorithms
Universität des Saarlandes
Kerber, MichaelGeometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes
Schweitzer, PascalProblems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes
2
Hide details for ManualManual
Hemmer, MichaelModular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4
Hemmer, MichaelPolynomials, CGAL - Computational Geometry Algorithms Library, release 3.4
140
Hide details for 20082008
1
Hide details for BookBook
Mehlhorn, Kurt
Sanders, Peter
Algorithms and Data Structures: The Basic Toolbox
4
Hide details for Part of a BookPart of a Book
Christodoulou, GeorgePrice of Anarchy
In: Encyclopedia of Algorithms, 1-99
Elbassioni, Khaled
Elmasry, Amr
Kamel, Ibrahim
Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529
van Stee, RobAttachment IconPacket Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99
van Stee, RobAttachment IconPaging
In: Encyclopedia of Algorithms, 1-99
1
Hide details for ProceedingsProceedings
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
65
Hide details for Proceedings ArticleProceedings Article
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
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
Althaus, Ernst
Canzar, Stefan
LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498
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
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
Althaus, Ernst
Naujoks, Rouven
Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288
Angelopoulos, SpyrosA 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
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
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
Berberich, Eric
Kerber, Michael
Attachment IconArrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212
Berberich, Eric
Kerber, Michael
Attachment IconExact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconExact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173
Berberich, Eric
Kerber, Michael
Sagraloff, Michael
Attachment IconGeometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32
Berberich, Eric
Sagraloff, Michael
Attachment IconA 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
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
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
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
Brockhoff, Dimo
Friedrich, Tobias
Neumann, Frank
Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660
Chang, Kevin
Johnson, Aaron
Attachment IconOnline and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52
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
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
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
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
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
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
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
Doerr, Benjamin
Happ, Edda
Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613
Doerr, Benjamin
Happ, Edda
Klein, Christian
Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546
Doerr, Benjamin
Jansen, Thomas
Klein, Christian
Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936
Doerr, Benjamin
Johannsen, Daniel
Tang, Ching Hoo
Attachment IconHow Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388
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
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
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
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
Eigenwillig, Arno
Kerber, Michael
Attachment IconExact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131
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
Elbassioni, Khaled
Tiwary, Hans Raj
On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174
Emeliyanenko, Pavel
Kerber, Michael
Attachment IconVisualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225
Epstein, Leah
van Stee, Rob
Attachment IconApproximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245
Epstein, Leah
van Stee, Rob
Attachment IconMaximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275
Epstein, Leah
van Stee, Rob
Attachment IconOn the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206
Epstein, Leah
van Stee, Rob
Attachment IconThe price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57
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
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
Friedrich, Tobias
Neumann, Frank
When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003
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
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
Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank
Attachment IconRigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960
Harren, Rolf
van Stee, Rob
Attachment IconPacking Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318
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
Huang, Chien-Chung
Kavitha, Telikepalli
Michail, Dimitrios
Nasre, Meghana
Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137
Kavitha, TelikepalliOn a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354
Khuller, Samir
Mestre, Julián
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610
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
Mestre, JuliánAdaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160
Mestre, JuliánLagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550
Meyer, UlrichOn Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560
Meyer, UlrichOn Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy
Neumann, Frank
Reichel, Joachim
Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81
Neumann, Frank
Reichel, Joachim
Skutella, Martin
Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786
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
Neumann, Frank
Witt, Carsten
Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166
Pyrga, Evangelia
Ray, Saurabh
New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207
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
Wahlström, MagnusA Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213
38
Hide details for Journal ArticleJournal Article
Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich
An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14
Althaus, Ernst
Canzar, Stefan
A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154
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
Cole, Richard
Kowalik, Lukasz
New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368
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
Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762
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
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
Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj
Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129
Elbassioni, KhaledA note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277
Elbassioni, KhaledOn the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123
Elbassioni, Khaled
Tiwary, Hans Raj
On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x
Elmasry, Amr
Hammad, Abdelrahman
Attachment IconInversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
Attachment IconMultipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19
Elmasry, Amr
Jensen, Claus
Katajainen, Jyrki
Attachment IconTwo New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204
Epstein, Leah
Levin, Asaf
van Stee, Rob
Attachment IconOnline unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96
Epstein, Leah
Levin, Asaf
van Stee, Rob
Attachment IconTwo-dimensional packing with conflicts
In: Acta Informatica [45], 155-175
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
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
Froyland, Gary
Koch, Thorsten
Megow, Nicole
Duane, Emily
Wren, Howard
Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75
Giesen, JoachimConjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671
Giesen, JoachimDelaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143
Giesen, JoachimThe Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190
Govindarajan, Sathish
Dietze, Michael C.
Agarwal, Pankaj K.
Clark, James S.
Attachment IconA scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61
Kettner, Lutz
Mehlhorn, Kurt
Pion, Sylvain
Schirra, Stefan
Yap, Chee
Attachment IconClassroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78
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
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
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
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
Khachiyan, Leonid
Boros, Endre
Elbassioni, Khaled
Gurvich, Vladimir
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172
Krumke, Sven Oliver
Schwahn, Anne
van Stee, Rob
Westphal, Stephan
Attachment IconA monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249
Kutz, Martin
Elbassioni, Khaled
Katriel, Irit
Mahajan, Meena
Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897
Malamatos, TheocharisLower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103
Mehlhorn, Kurt
Kavitha, T.
Hariharan, R.
Attachment IconFaster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447
Neumann, FrankExpected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759
Pruhs, Kirk
van Stee, Rob
Uthaisombut, Patchrawat
Attachment IconSpeed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80
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
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
2
Hide details for Electronic Journal ArticleElectronic Journal Article
Cameron, Peter
Johannsen, Daniel
Prellberg, Thomas
Schweitzer, Pascal
Attachment IconCounting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92
Sharma, VikramComplexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310
16
Hide details for ReportReport
Berberich, Eric
Emeliyanenko, Pavel
CGAL's Curved Kernel via Analysis
Berberich, Eric
Hemmer, Michael
Karavelas, Menelaos
Pion, Sylvain
Teillaud, Monique
Tsigaridas, Elias
Prototype implementation of the algebraic kernel
Elmasry, AmrAttachment IconViolation Heaps: A Better Substitute for Fibonacci Heaps
Emeliyanenko, Pavel
Kerber, Michael
Attachment IconAn implementation of the 2D Algebraic Kernel
Emeliyanenko, Pavel
Kerber, Michael
Attachment IconVisualizing and Exploring Planar Algebraic Arrangements - a Web Application
Emiris, Ioannis
Hemmer, Michael
Tsigaridas, Elias
Tzoumas, Georg
Voronoi diagram of ellipses: CGAL-based implementation
Emiris, Ioannis Z.
Hemmer, Michael
Karavelas, Menelaos
Mourrain, Bernard
Tsigaridas, Elias P.
Zafeirakopoulos, Zafeirakis
Attachment IconExperimental evaluation and cross-benchmarking of univariate real solvers
Emiris,Ioannis
Hemmer, Michael
Karavelas, Menelaos
Limbach, Sebastian
Mourrain, Bernard
Tsigaridas, Elias
Zafeirakopoulos,Zafeirakis
Cross-benchmarks of univariate algebraic kernels
Hemmer, MichaelCGAL package for modular arithmetic operations
Hemmer, MichaelCGAL package: Algebraic Foundations
Hemmer, MichaelEvaluation of different approaches in 3D curved kernel for arrangements of quadrics
Hemmer, Michael
Dupont, Laurent
Petitjean, Sylvain
Schömer, Elmar
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics
Hemmer, Michael
Limbach, Sebastian
Arrangements of quadrics in 3D: continued work on experimental implementation
Kerber, MichaelAttachment IconOn filter methods in CGAL's 2D curved kernel
Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael
A General Approach to the Analysis of Controlled Perturbation Algorithms
Mehlhorn, Kurt
Sagraloff, Michael
A deterministic Bitstream Descartes Algorithm
1
Hide details for Thesis - Bachelor thesisThesis - Bachelor thesis
Kobel, AlexanderAutomated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes
3
Hide details for Thesis - Masters thesisThesis - Masters thesis
Limbach, SebastianAttachment IconContinued Work on the Computation of an Exact Arrangement of Quadrics
Universität des Saarlandes
Manjunath, MadhusudanTwo topics in Geometry: Minimizing absolute Gaussian Curvature over meshes and Solution Path of the Slab Support Vector Machine
Universität des Saarlandes
Philip, GeevargheseAttachment IconFixed-Parameter Algorithms for Graph Problems Using Graph Minor Theory
Homi Bhabha National Institute
4
Hide details for Thesis - PhD thesisThesis - PhD thesis
Berberich, EricRobust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes
Eigenwillig, ArnoReal Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes
Hemmer, MichaelAttachment IconExact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz
Naujoks, RouvenNP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes
1
Hide details for Thesis - Habilitation thesisThesis - Habilitation thesis
van Stee, RobAttachment IconCombinatorial algorithms for packing and scheduling problems
Universität Karlsruhe
1
Hide details for Unpublished/DraftUnpublished/Draft
Garg, Naveen
Kavitha, T.
Kumar, Amit
Mehlhorn, Kurt
Mestre, Julián
Attachment IconAssigning Papers to Referees
3
Hide details for MiscellaneousMiscellaneous
El Kahoui, M'hammedAttachment IconComputing with algebraic curves in generic position
El Kahoui, M'hammedAttachment IconPolynomial parametrization of nonsingular algebraic curves
Kavitha, Telikepalli
Nasre, Meghana
Optimal Popular Matchings
138
Hide details for 20072007
1
Hide details for BookBook
Harren, RolfMehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme
3
Hide details for Part of a BookPart of a Book
Fogel, Efi
Halperin, Dan
Kettner, Lutz
Teillaud, Monique
Wein, Ron
Wolpert, Nicola
Attachment IconArrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66
Giesen, JoachimThe Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271
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
1
Hide details for ProceedingsProceedings
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
66
Hide details for Proceedings ArticleProceedings Article
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
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)
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
Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly
Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12
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
Althaus, Ernst
Baumann, Tobias
Schömer, Elmar
Werth, Kai
Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432
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
Angelopoulos, SpyrosImproved 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
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
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
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
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
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
Bast, Holger
Majumdar, Debapriyo
Weber, Ingmar
Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860
Bast, Holger
Weber, Ingmar
Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108
Behle, MarkusAttachment IconOn threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135
Behle, Markus
Jünger, Michael
Liers, Frauke
Attachment IconA Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392
Beier, René
Röglin, Heiko
Vöcking, Berthold
Attachment IconThe Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67
Berberich, Eric
Caroli, Manuel
Wolpert, Nicola
Attachment IconExact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234
Berberich, Eric
Fogel, Efi
Halperin, Dan
Mehlhorn, Kurt
Wein, Ron
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656
Berberich, Eric
Fogel, Efi
Halperin, Dan
Wein, Ron
Attachment IconSweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226
Berberich, Eric
Meyerovitch, Michal
Attachment IconComputing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238
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
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
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
Chang, KevinAttachment IconMultiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16
Christodoulou, George
Gourves, Laurent
Pascual, Fanny
Attachment IconScheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197
Christodoulou, George
Koutsoupias, Elias
Kovács, Annamária
Attachment IconMechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52
Christodoulou, George
Koutsoupias, Elias
Vidali, Angelina
A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170
Diedrich, Florian
Harren, Rolf
Jansen, Klaus
Thöle, Ralf
Thomas, Henning
Attachment IconApproximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45
Doerr, BenjaminAttachment IconRandomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452
Doerr, Benjamin
Gnewuch, Michael
Hebbinghaus, Nils
Neumann, Frank
A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597
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
Doerr, Benjamin
Johannsen, Daniel
Attachment IconAdjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210
Doerr, Benjamin
Johannsen, Daniel
Attachment IconRefined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507
Doerr, Benjamin
Klein, Christian
Storch, Tobias
Attachment IconFaster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250
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
Dupont, Laurent
Hemmer, Michael
Petitjean, Sylvain
Schömer, Elmar
Attachment IconComplete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644
Eigenwillig, Arno
Kerber, Michael
Wolpert, Nicola
Attachment IconFast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158
Eigenwillig, Arno
Kettner, Lutz
Wolpert, Nicola
Attachment IconSnap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167
Eisenbrand, Friedrich
Karrenbauer, Andreas
Xu, Chihao
Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351
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
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629
Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank
Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225
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
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
Funke, Stefan
Laue, Sören
Attachment IconBounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283
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
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
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
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
Gidenstam, Anders
Papatriantafilou, Marina
LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231
Giesen, JoachimMedial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124
Giesen, Joachim
Mitsche, Dieter
Schuberth, Eva
Attachment IconCollaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67
Kavitha, Telikepalli
Mehlhorn, Kurt
Michail, Dimitrios
Attachment IconNew Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523
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
Klein, Rolf
Kutz, Martin
Attachment IconComputing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207
Kutz, Martin
Schweitzer, Pascal
ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157
Mehlhorn, KurtAttachment IconMatchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2
Mehlhorn, KurtAttachment IconMinimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14
Miklos, Balint
Giesen, Joachim
Pauly, Mark
Attachment IconMedial 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
Mustafa, Nabil H.
Ray, Saurabh
Attachment IconAn Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141
Neumann, Frank
Sudholt, Dirk
Witt, Carsten
Attachment IconComparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75
Ray, Saurabh
Mustafa, Nabil H.
Attachment IconWeak $\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
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, ?
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
1
Hide details for Electronic Proceedings ArticleElectronic Proceedings Article
Bast, Holger
Weber, Ingmar
Attachment IconThe CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95
42
Hide details for Journal ArticleJournal Article
Abraham, David J.
Irving, Robert W.
Kavitha, Telikepalli
Mehlhorn, Kurt
Attachment IconPopular Matchings
In: SIAM Journal on Computing [37], 1030-1045
Ahuja, Nitin
Baltz, Andreas
Doerr, Benjamin
Privetivy, Ales
Srivastav, Anand
On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17
Arya, Sunil
Malamatos, Theocharis
Mount, David M.
Wong, Ka Chun
Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610
Bast, Holger
Funke, Stefan
Sanders, Peter
Schultes, Dominik
Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566
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
Beldiceanu, Nicolas
Katriel, Irit
Thiel, Sven
Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear
Bodirsky, Manuel
Gröpl, Clemens
Johannsen, Daniel
Kang, Mihyun
Attachment IconA Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15
Bodirsky, Manuel
Kutz, Martin
Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196
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
Chrobak, Marek
Gasieniec, Leszek
Kowalski, Dariusz R.
The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471
Cole, Richard
Kowalik, Lukasz
Skrekovski, Riste
A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106
Cooper, Joshua
Doerr, Benjamin
Friedrich, Tobias
Spencer, Joel
Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513
Cooper, Joshua
Doerr, Benjamin
Spencer, Joel
Tardos, Gábor
Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090
Csaba, BelaOn the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31
Doerr, BenjaminAttachment IconLp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666
Doerr, BenjaminAttachment IconMatrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995
Doerr, BenjaminPartial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363
Doerr, BenjaminRoundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483
Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf
Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46
Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank
Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410
Eigenwillig, ArnoAttachment IconOn Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230
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
El Kahoui, M'hammed
Rakrak, Said
Attachment IconStructure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187
Fountoulakis, NikolaosPercolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356

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