# | Y |  | Author/Editor | | Title | |
1 |
 | ?? |
|  |
3 |
|  |
18 |
 | 2014 |
|  |
101 |
|  |
145 |
 | 2012 |
|  |
151 |
|  |
144 |
 | 2010 |
|  |
1 |
|
|  |
3 |
|
 | Part of a Book |
|  |
74 |
|
|  |
| | | Ambalath, Abhimanyu M.
Balasundaram, Radheshyam
H., Chintan Rao
Koppula, Venkata
Misra, Neeldhara
Philip, Geevarghese
Ramanujan, M. S. |  | On the Kernelization Complexity of Colorful Motifs
In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, 14-25 |  |
 |  |  | Angelopoulos, Spyros | | On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 1-12 |  |
| | | 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 |  | Scheduling 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 |  | Algorithms 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 |  | Feasibility 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 |  | On 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 |  | Edge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766 |  |
| | | 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, Pavel |  | A complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43 |  |
| | | Emeliyanenko, Pavel |  | Modular 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 |  | Max-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 |  | The Curse of Connectivity: $t$-Total Vertex (Edge) Cover
In: Computing and Combinatorics, 16th Annual International Conference, COCOON 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings, 34-43 |  |
 |  |  | 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 |  | Connected 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-Chung | | Classified 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 |  | Can Quantum Search Accelerate Evolutionary Algorithms?
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1433-1440 |  |
 |  |  | Johannsen, Daniel
Panagiotou, Konstantinos |  | Vertices 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, Kurt | | Reliable 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 |  | The effect of girth on the kernelization complexity of Connected Dominating Set
In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, 96-107 |  |
| | | Misra, Neeldhara
Philip, Geevarghese
Raman, Venkatesh
Saurabh, Saket
Sikdar, Somnath |  | FPT Algorithms for Connected Feedback Vertex Set
In: WALCOM: Algorithms and Computation, 4th International Workshop, WALCOM 2010, Dhaka, Bangladesh, February 10-12, 2010. Proceedings, 269-280 |  |
 |  |  | 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 |  | A Quartic Kernel for Pathwidth-One Vertex Deletion
In: Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zar\'os, Crete, Greece, June 28-30, 2010 Revised Papers, 196-207 |  |
 |  |  | 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 |
|
 | Electronic Proceedings Article |
|  |
1 |
|
|  |
43 |
|
 | Journal Article |
|  |
9 |
|
  | Electronic Journal Article |
|  |
2 |
|
 | Report |
|  |
5 |
|
|  |
3 |
|
 | Unpublished/Draft |
|  |
126 |
|  |
140 |
 | 2008 |
|  |
138 |
|  |
121 |
 | 2006 |
|  |
98 |
|  |
99 |
 | 2004 |
|  |
88 |
|  |
74 |
 | 2002 |
|  |
74 |
|  |
96 |
 | 2000 |
|  |
88 |
|  |
104 |
 | 1998 |
|  |
109 |
|  |
84 |
 | 1996 |
|  |
91 |
|  |
26 |
 | 1994 |
|  |
11 |
|  |
15 |
 | 1992 |
|  |
10 |
|  |
19 |
 | 1990 |
|  |
12 |
|  |
17 |
 | 1988 |
|  |
14 |
|  |
20 |
 | 1986 |
|  |
13 |
|  |
21 |
 | 1984 |
|  |
13 |
|  |
7 |
 | 1982 |
|  |
7 |
|  |
8 |
 | 1980 |
|  |
11 |
|  |
10 |
 | 1978 |
|  |
5 |
|  |
13 |
 | 1976 |
|  |
7 |
|  |
4 |
 | 1974 |
|  |
3 |
|  |
2359 |
|  |