| # | Y |  | Author/Editor | | Title | |
|---|
| 1 |
 | ?? |
| |
| 3 |
| |
| 18 |
| 2014 |
| |
| 101 |
| |
| 145 |
| 2012 |
| |
| 151 |
| |
| 144 |
 | 2010 |
| |
| 1 |
|
| |
| 3 |
|
| Part of a Book |
| |
| 74 |
|
| |
| 3 |
|
| Electronic Proceedings Article |
| |
| 1 |
|
| |
| 43 |
|
| Journal 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 |  | Improved 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 | | Stackelberg 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, Amr | | Pairing heaps, scrambled pairing and square-root trees
In: International Journal of Computer Mathematics [87], 3096-3110 | |
| | | Elmasry, Amr | | The 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 | | On 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-Chung | | Circular 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, Julian | | Adaptive 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, Michael | | A 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 |
|
| Electronic Journal Article |
| |
| 2 |
|
| |
| 5 |
|
| Thesis - PhD thesis |
| |
| 3 |
|
| |
| 126 |
| 2009 |
| |
| 140 |
| |
| 138 |
| 2007 |
| |
| 121 |
| |
| 98 |
| 2005 |
| |
| 99 |
| |
| 88 |
| 2003 |
| |
| 74 |
| |
| 74 |
| 2001 |
| |
| 96 |
| |
| 88 |
| 1999 |
| |
| 104 |
| |
| 109 |
| 1997 |
| |
| 84 |
| |
| 91 |
| 1995 |
| |
| 26 |
| |
| 11 |
| 1993 |
| |
| 15 |
| |
| 10 |
| 1991 |
| |
| 19 |
| |
| 12 |
| 1989 |
| |
| 17 |
| |
| 14 |
| 1987 |
| |
| 20 |
| |
| 13 |
| 1985 |
| |
| 21 |
| |
| 13 |
| 1983 |
| |
| 7 |
| |
| 7 |
| 1981 |
| |
| 8 |
| |
| 11 |
| 1979 |
| |
| 10 |
| |
| 5 |
| 1977 |
| |
| 13 |
| |
| 7 |
| 1975 |
| |
| 4 |
| |
| 3 |
| 1973 |
| |
| 2359 |
| |
