| # |  | Year | edoc | Lck | Author(s) [non member] | Editor(s) [non member] | | | Title | Type | |
|---|
| 601 |
 | Veröffentlichungen der Mitarbeiter |
| |
| | 2012 | |  | [Höhn, Wiebke]
[Jacobs, Tobias]
Megow, Nicole | | | | On Eulerian extensions and their application to no-wait flowshop scheduling
In: Journal of Scheduling [15], 295-309 | Journal Article | |
| | 2012 | | | [Misra, Neeldhara]
Philip, Geevarghese
[Raman, Venkatesh]
[Saurabh, Saket]
[Sikdar, Somnath] | | |  | FPT Algorithms for Connected Feedback Vertex Set
In: Journal of Combinatorial Optimization [24], 131-146 | Journal Article | |
| | 2011 | | | [Alkassar, Eyad]
[Böhme, Sascha]
Mehlhorn, Kurt
Rizkallah, Christine | [Gopalakrishnan, Ganesh]
[Qadeer, Shaz] | | | Verification of Certifying Computations
In: Computer Aided Verification : 23rd International Conference, CAV 2011, 67-82 | Proceedings Article | |
| | 2011 | | | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | [Moreno Maza, Marc] | | | Arrangement Computation for Planar Algebraic Curves
In: Proceedings of the 4th Internal Workshop on Symbolic-Numeric Computation, 88-98 | Proceedings Article | |
| | 2011 | | | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | [Müller-Hannemann, Matthias]
[Werneck, Renato] | | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 35-47 | Proceedings Article | |
| | 2011 | | | Bringmann, Karl
Friedrich, Tobias | [Krasnogor, Natalio]
[Lanzim, Pier Luca] | | | Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 745-752 | Proceedings Article | |
| | 2011 | | | Bringmann, Karl
Friedrich, Tobias
[Neumann, Frank]
[Wagner, Markus] | [Walsh, Toby] | | | Approximation-guided evolutionary multi-objective optimization
In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), 1198-1203 | Proceedings Article | |
| | 2011 |  | | Celikik, Marjan
Bast, Holger
Manolache, Gabriel | | | | Efficient Index-Based Snippet Generation | Unpublished/Draft | |
| | 2011 | | | [Christodoulou, George]
Mehlhorn, Kurt
[Pyrga, Evangelia] | [Demetrescu, Camil]
[Halldórsson, Magnús M.] | | | Improving the Price of Anarchy for Selfish Routing via Coordination Mechanisms
In: Algorithms - ESA 2011 : 19th Annual European Symposium, 119-130 | Proceedings Article | |
| | 2011 | | | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
[Lehre, Per Christian]
Wagner, Markus
Winzen, Carola | [Beyer, Hans- Georg]
[Langdon, William] | | | Faster black-box algorithms through higher arity operators
In: Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI (FOGA 2011), 163-172 | Proceedings Article | |
| | 2011 | | | Doerr, Benjamin
Kötzing, Timo
Winzen, Carola | [Krasnogor, Natalio]
[Lanzi, Pier Luca] | | | Too fast unbiased black-box algorithms
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 2043-2050 | Proceedings Article | |
| | 2011 | | | Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus | [Müller-Hannemann, Matthias]
[Werneck, Renato] | | | Dependent Randomized Rounding: The Bipartite Case
In: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX), 96-106 | Proceedings Article | |
| | 2011 | | | Doerr, Benjamin
[Lengler, Johannes]
Kötzing, Timo
Winzen, Carola | [Krasnogor, Natalio]
[Lanzi, Pier Luca] | | | Black-box complexities of combinatorial problems
In: GECCO 2011 : Genetic and Evolutionary Computation Conference, 981-988 | Proceedings Article | |
| | 2011 | | | Doerr, Benjamin
Winzen, Carola | [Kulikov, Alexande]
[Vereshchagin, Nikolay] | | | Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
In: Computer Science - Theory and Applications : 6th International Computer Science Symposium in Russia (CSR 2011), 15-28 | Proceedings Article | |
| | 2011 | | | Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran | | | | On the readability of monotone Boolean formulae
In: Journal of Combinatorial Optimization [22], 293-304 | Journal Article | |
| | 2011 | | | Emeliyanenko, Pavel | [Smari, Waleed W.]
[McIntire, John P.] | | | High-performance polynomial GCD computations on graphics processors
In: Proceedings of the 2011 International Conference on High Performance Computing & Simulation (HPCS 2011), 215-224 | Proceedings Article | |
| | 2011 | | | Fountoulakis, Nikolaos
Khosla, Megha
Panagiotou, Konstantinos | [Randall, Dana] | | | The Multiple-orientability Thresholds for Random Hypergraphs
In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), 1222-1236 | Proceedings Article | |
| | 2011 | | | Friedrich, Tobias
[Bringmann, Karl]
[Voss, Thomas]
[Igel, Christian] | [Beyer, Hans- Georg]
[Langdon, William] | | | The Logarithmic Hypervolume Indicator
In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, 81-92 | Proceedings Article | |
| | 2011 | | | Jurkiewicz, Tomasz
Danilewski, Piotr | | | | Efficient Quicksort and 2D Convex Hull for CUDA, and MSIMD as a Realistic Model of Massively Parallel Computations. | Unpublished/Draft | |
| | 2011 | | | [Mainberger, Markus]
[Hoffmann, Sebastian]
[Weickert, Joachim]
Tang, Ching Hoo
[Johannsen, Daniel]
[Neumann, Frank]
Doerr, Benjamin | [Bruckstein, Alfred M.]
[ter Haar Romeny, Bart M.]
[Bronstein, Alexander M.]
[Bronstein, Michael M.] | | | Optimising Spatial and Tonal Data for Homogeneous Diffusion Inpainting
In: Scale Space and Variational Methods in Computer Vision : Third International Conference, SSVM 2011, 26-37 | Proceedings Article | |
| | 2011 | | | Manjunath, Madhusudan
[Sharma, Vikram] | | | | Applications of dimensionality reduction and exponential sums to graph automorphism
In: Theoretical Computer Science [412], 3639-3649 | Journal Article | |
| | 2011 | | | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | | | A General Approach to the Analysis of Controlled Perturbation Algorithms
In: Computational Geometry [44], 507-528 | Journal Article | |
| | 2011 | | | [Müller, Tobias]
Perez-Gimenez, Xavier
[Wormald, Nicholas] | | | | Disjoint Hamilton cycles in the random geometric graph
In: Journal of Graph Theory [68], 299-322 | Journal Article | |
| | 2011 | | | Rizkallah, Christine | | | | Glivenko and Kuroda for Simple Type Theory | Unpublished/Draft | |
| | 2011 | | | Wagner, Markus
[Veeramachaneni, Kalyan]
[Neumann, Frank]
[O'Reilly, Una-May] | | | | Optimizing the Layout of 1000 Wind Turbines
In: European Wind Energy Association Annual Event, 1-10 | Proceedings Article | |
| | 2011 | | | Wahlström, Magnus | | | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Theory of Computing Systems [49], 273-282 | Journal Article | |
| | 2011 | | | Winzen, Carola | | | | Direction-Reversing Quasi-Random Rumor Spreading with Restarts | Unpublished/Draft | |
| | 2010 | | | [Basit, Abdul]
[Mustafa, Nabil H.]
Ray, Saurabh
[Raza, Sarfraz] | | | | Centerpoints and Tverberg's technique
In: Computational Geometry [43], 593-600 | Journal Article | |
| | 2010 | | | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | | | | An efficient algorithm for the stratification and triangulation of an algebraic surface
In: Computational Geometry: Theory and Applications (CGTA) [43], 257-278 | Journal Article | |
| | 2010 | | | [Bringmann, Karl]
Friedrich, Tobias | | | | An Efficient Algorithm for Computing Hypervolume Contributions
In: Evolutionary Computation [18], 383-402 | Journal Article | |
| | 2010 | | | Bringmann, Karl
Friedrich, Tobias | | | | Approximating the volume of unions and intersections of high-dimensional geometric objects
In: Computational Geometry [43], 601-610 | Journal Article | |
| | 2010 | | | [Bringmann, Karl]
Friedrich, Tobias | | | | The Maximum Hypervolume Set Yields Near-optimal Approximation
In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), 511-518 | Proceedings Article | |
| | 2010 | | | [Bringmann, Karl]
Friedrich, Tobias | [Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter] | | | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 607-616 | Proceedings Article | |
| | 2010 | | | Christodoulou, George
[Chung, Christine]
[Ligett, Katrina]
Pyrga, Evangelia
van Stee, Rob | [Bampis, Evripidis]
[Jansen, Klaus] | | | On the price of stability for undirected network design
In: Approximation and Online Algorithms : 7th International Workshop, WAOA 2009, 86-97 | Proceedings Article | |
| | 2010 | | | [Christodoulou, Giorgos]
[Ligett, Katrina]
Pyrga, Evangelia | [Abramsky, Samson]
[Gavoille, Cyril]
[Kirchner, Claude]
[Meyer auf der Heide, Friedhelm]
[Spirakis, Paul] | | | Contention Resolution under Selfishness
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010. - Pt. II, 430-441 | Proceedings Article | |
| | 2010 | | | Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus | | | | Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
In: Journal of Complexity [26], 490-507 | Journal Article | |
| | 2010 | | | Doerr, Benjamin
[Jansen, Thomas]
[Sudholt, Dirk]
Winzen, Carola
[Zarges, Christine] | [Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter] | | | Optimizing Monotone Functions Can Be Difficult
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 42-51 | Proceedings Article | |
| | 2010 | | | Doerr, Benjamin
Johannsen, Daniel
Kötzing, Timo
Neumann, Frank
[Theile, Madeleine] | [Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter] | | | More Effective Crossover Operators for the All-Pairs Shortest Path Problem
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 184-193 | Proceedings Article | |
| | 2010 | | | Doerr, Benjamin
[Johannsen, Daniel] | [Pelikan, Martin]
[Branke, Jürgen] | | | Edge-based representation beats vertex-based representation in shortest path problems
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 759-766 | Proceedings Article | |
| | 2010 | | | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | | | | Drift Analysis and Linear Functions Revisited
In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2010). - Pt. 3, 1967-1974 | Proceedings Article | |
| | 2010 | | | Doerr, Benjamin
Johannsen, Daniel
Winzen, Carola | [Pelikan, Martin]
[Branke, Jürgen] | | | Multiplicative Drift Analysis
In: Proceedings of 12th Annual Conference on Genetic and Evolutionary Computation (GECCO-2010), 1449-1456 | Proceedings Article | |
| | 2010 | | | Doerr, Benjamin
[Künnemann, Marvin]
Wahlström, Magnus | [Festa, Paola] | | | Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
In: Experimental Algorithms : 9th International Symposium, SEA 2010, 190-201 | Proceedings Article | |
| | 2010 | | | Elbassioni, Khaled
[Rauf, Imran] | | | | Polynomial-time dualization of r-exact hypergraphs with applications in geometry
In: Discrete Mathematics [310], 2356-2363 | Journal Article | |
| | 2010 | | | Elbassioni, Khaled
Rauf, Imran | | | | Polynomial-time Dualization of $r$-Exact Hypergraphs with Applications in Geometry | Unpublished/Draft | |
| | 2010 | | | Emeliyanenko, Pavel | | | | Accelerating Symbolic Computations on NVIDIA Fermi
In: Poster presentation at GTC'10 (NVIDIA research summit), - | Poster | |
| | 2010 | | | Emeliyanenko, Pavel | [Hsu, Ching-Hsien]
[Yang, Laurence T.]
[Park, Jong Hyuk]
[Yeo, Sang-Soo] | | | Modular Resultant Algorithm for Graphics Processors
In: Algorithms and Architectures for Parallel Processing : 10th International Conference, ICA3PP 2010. - Pt. 1, 427-440 | Proceedings Article | |
| | 2010 | | | Emeliyanenko, Pavel | [Moreno Maza, Marc]
[Roch, Jean-Louis] | | | A complete modular resultant algorithm targeted for realization on graphics hardware
In: PASCO '10 : Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, 35-43 | Proceedings Article | |
| | 2010 | | | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | | | | Reliable broadcasting in random networks and the effect of density
In: 2010 Proceedings IEEE INFOCOM, 2552-2560 | Proceedings Article | |
| | 2010 | | | [Iacono, G.]
Ramezani, Fahimeh
[Soranzo, N.]
[Altafani, C.] | | | | Determining the distance to monotonicity of a biological network: a graph-theoretical approach
In: IET Systems Biology [4], 223-235 | Journal Article | |
| | 2010 | | | [Jansen, Klaus]
Kratsch, Stefan
[Marx, Dániel]
[Schlotter, Ildikó] | [Kaplan, Haim] | | | Bin Packing with Fixed Number of Bins Revisited
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 260-272 | Proceedings Article | |
| | 2010 | | | Johannsen, Daniel
Panagiotou, Konstantinos | [Charikar, Moses] | | | Vertices of Degree k in Random Maps
In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), 1436-1447 | Proceedings Article | |
| | 2010 | | | Kratsch, Stefan
[Lehre, Per Kristian]
[Neumann, Frank]
[Oliveto, Pietro Simone] | [Schaefer, Robert]
[Cotta, Carlos]
[Kolodziej, Joanna]
[Rudolph, Günter] | | | Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, 204-213 | Proceedings Article | |
| | 2010 | | | Kratsch, Stefan
[Marx, Dániel]
Wahlström, Magnus | [Hlinený, Petr]
[Kucera, Antonín] | | | Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
In: Mathematical Foundations of Computer Science 2010 : 35th International Symposium, MFCS 2010, 489-500 | Proceedings Article | |
| | 2010 | | | Kratsch, Stefan
Schweitzer, Pascal | [Kaplan, Haim] | | | Isomorphism for Graphs of Bounded Feedback Vertex Set Number
In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops
on Algorithm Theory, 81-92 | Proceedings Article | |
| | 2010 | | | Kratsch, Stefan
Wahlström, Magnus | [Abramsky, Samson]
[Gavoille, Cyril]
[Kirchner, Claude]
[Meyer auf der Heide, Friedhelm]
[Spirakis, Paul G.] | | | Preprocessing of Min Ones Problems: A Dichotomy
In: Automata, Languages and Programming : 37th International Colloquium, ICALP 2010, 653-665 | Proceedings Article | |
| | 2010 | | | Mehlhorn, Kurt
Ray, Saurabh | | | | Faster algorithms for computing Hong's bound on absolute positiveness
In: Journal of Symbolic Computation [45], 677-683 | Journal Article | |
| | 2010 | | | Mehlhorn, Kurt
Schweitzer, Pascal | [Lee, Der-Tsai]
[Chen, Danny Z.]
[Ying, Shi] | | | Progress on Certifying Algorithms
In: Frontiers in Algorithmics : 4th International Workshop, FAW 2010, 1-5 | Proceedings Article | |
| | 2010 | | | Mustafa, Nabil H.
Ray, Saurabh | | | | Improved Results on Geometric Hitting Set Problems
In: Discrete & Computational Geometry [44], 883-895 | Journal Article | |
| | 2010 | | | [Rusinov, Momchil]
Schweitzer, Pascal | | | | Homomorphism -- homogeneous graphs
In: Journal of Graph Theory [65], 253-262 | Journal Article | |
| | 2010 | | | Schweitzer, Pascal
[Schweitzer, Patrick] | | | | Connecting face hitting sets in planar graphs
In: Information Processing Letters [111], 11-15 | Journal Article | |
| | 2009 | | | Ajwani, Deepak
[Meyer, Ulrich]
[Osipov, Vitaly] | [Demetrescu, Camil]
[Goldberg, Andrew V.]
[Johnson, David S.] | | | Breadth first search on massive graphs
In: The shortest path problem : ninth DIMACS implemenation challenge, 291-307 | Part of a Book | |
| | 2009 | | | [Althaus, Ernst]
[Dumitriu, Daniel] | [Vahrenhold, Jan] | | | Fast and Accurate Bounds on Linear Programs
In: Experimental Algorithms : 8th International Symposium on Experimental Algorithms (SEA 2009), 40-50 | Proceedings Article | |
| | 2009 | | | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | [Fiat, Amos]
[Sanders, Peter] | | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 301-312 | Proceedings Article | |
| | 2009 | | | [Amaldi, Edoardo]
[Iuliano, Claudio]
Jurkiewicz, Tomasz
Mehlhorn, Kurt
[Rizzi, Romeo] | [Fiat, Amos]
[Sanders, Peter] | | | Breaking the $O(m^2n)$ Barrier for Minimum Cycle Bases
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 301-312 | Proceedings Article | |
| | 2009 | | | Angelopoulos, Spyros
Schweitzer, Pascal | [Mathieu, Claire] | | | Paging and List Update under Bijective Analysis
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1136-1145 | Proceedings Article | |
| | 2009 | | | [Böcker, Sebastian]
[Hüffner, Falk]
[Truss, Anke]
Wahlström, Magnus | [Chen, Jianer]
[Fomin, Fedor V.] | | | A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 38-49 | Proceedings Article | |
| | 2009 | | | [Bringmann, Karl]
[Friedrich, Tobias] | [Ehrgott, Matthias]
[Fonseca, Carlos M.]
[Gandibleux, Xavier]
[Hao, Kin-Kao]
[Sevaux, Marc] | | | Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, 6-20 | Proceedings Article | |
| | 2009 | | | [Bringmann, Karl]
[Friedrich, Tobias] | [Jansen, Thomas]
[Garibay, Ivan]
[Paul, Wiegand R.]
[Wu, Annie S.] | | | Don't be greedy when calculating hypervolume contributions
In: FOGA'09 : revised selected papers from ACM SIGEVO
Foundations of Genetic Algorithms X, 103-112 | Proceedings Article | |
| | 2009 | | | [Brockhoff, Dimo]
[Friedrich, Tobias]
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart] | | | | On the Effects of Adding Objectives to Plateau Functions
In: IEEE Transactions on Evolutionary Computation [13], 591-603 | Journal Article | |
| | 2009 | | | [Burnikel, Christoph]
[Funke, Stefan]
Mehlhorn, Kurt
[Schirra, Stefan]
Schmitt, Susanne | | | | A Separation Bound for Real Algebraic Expressions
In: Algorithmica [55], 14-28 | Journal Article | |
| | 2009 | | | Celikik, Marjan
Bast, Hannah | [Karlgren, Jussi]
[Tarhio, Jorma]
[Hyyrö, Heikki] | | | Fast Single-Pass Construction of a Half-Inverted Index
In: String processing and information retrieval : 16th International Symposium, SPIRE 2009, 194-205 | Proceedings Article | |
| | 2009 | | | Celikik, Marjan
Bast, Holger | [Shin, Dongwan] | | | Fast Error-Tolerant Search on Very Large Texts
In: The 24th Annual ACM Symposium on Applied Computing, 1724-1731 | Proceedings Article | |
| | 2009 | | | Chan, Ho-Leung
[Edmonds, Jeff]
[Pruhs, Kirk] | | | | Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, 1-10 | Proceedings Article | |
| | 2009 | | | Chan, T-H. Hubert
[Dhamdhere, Kedar]
[Gupta, Anupam]
[Kleinberg, Jon]
[Slivkins, Aleksandrs] | | | | Metric Embeddings with Relaxed Guarantees
In: SIAM Journal on Computing [38], 2303-2329 | Journal Article | |
| | 2009 | | | Chan, T.-H. Hubert
[Gupta, Anupam] | | | | Small Hop-diameter Sparse Spanners for Doubling Metrics
In: Discrete and Computational Geometry [41], 28-44 | Journal Article | |
| | 2009 | | | Christodoulou, George
[Koutsoupias, Elias] | | | | Mechanism Design for Scheduling
In: Bulletin of European Association for Theoretical Computer Science [97], 40-59 | Journal Article | |
| | 2009 | | | Christodoulou, George
[Koutsoupias, Elias]
[Nanavati, Akash] | | | | Coordination Mechanisms
In: Theoretical Computer Science [410], 3327-3336 | Journal Article | |
| | 2009 | | | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | | | | A lower bound for scheduling mechanisms
In: Algorithmica [85], 729-740 | Journal Article | |
| | 2009 | | | Cilleruelo, Javier
Hebbinghaus, Nils | | | | Discrepancy in generalized arithmetic progressions
In: European Journal of Combinatorics [30], 1607-1611 | Journal Article | |
| | 2009 | | | [Cooley, Oliver]
[Fountoulakis, Nikolaos]
[Kühn, Daniela]
[Osthus, Deryk] | | | | Embeddings and Ramsey numbers of sparse k-uniform hypergraphs
In: Combinatorica [29], 263-297 | Journal Article | |
| | 2009 | | | [Correa, Jose R.]
Megow, Nicole
Raman, Rajiv
[Suchan, Karol] | [Cafieri, Sonia]
[Mucherino, Antonio]
[Nannicini, Giacomo]
[Tarissan, Fabien]
[Liberti, Leo] | | | Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
In: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 347-350 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin | [Albers, Susanne]
[Alt, Helmut]
[Näher, Stefan] | | | Introducing Quasirandomness to Computer Science
In: Efficient Algorithms : Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, 99-111
In: Lecture Notes in Computer Science [5760], 99-111 | Part of a Book | |
| | 2009 | | | Doerr, Benjamin
[Eremeev, Anton]
[Horoba, Christian]
Neumann, Frank
[Theile, Madeleine] | [Raidl, Günther]
[Rothlauf, Frank] | | | Evolutionary Algorithms and Dynamic Programming
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 771-777 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin
[Fouz, Mahmoud] | | | | A Time-Randomness Tradeoff for Quasi-Random Rumour Spreading
In: Electronic Notes in Discrete Mathematics [34], 335 - 339 | Journal Article | |
| | 2009 | | | Doerr, Benjamin
Fouz, Mahmoud
[Schmidt, Martin]
Wahlström, Magnus | [Rothlauf, Franz] | | | BBOB: Nelder-Mead with resize and halfruns
In: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference (GECCO 2009), 2239-2246 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin
Friedrich, Tobias | | | | Deterministic Random Walks on the Two-Dimensional Grid
In: Combinatorics, Probability and Computing [18], 123-144 | Journal Article | |
| | 2009 | | | Doerr, Benjamin
[Friedrich, Tobias]
[Künnemann, Marvin]
[Sauerwald, Thomas] | [Finocchi, Irene]
[Hershberger, John] | | | Quasirandom Rumor Spreading: An Experimental Analysis
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 145-153 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas] | | | | Quasirandom Rumor Spreading on Expanders
In: Electronic Notes in Discrete Mathematics [34], 243 - 247 | Journal Article | |
| | 2009 | | | Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas] | [Albers, Susanne]
[Marchetti-Spaccamela, Alberto]
[Matias, Yossi]
[Nikoletseas, Sotiris]
[Thomas, Wolfgang] | | | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 366-377 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin
[Gnewuch, Michael]
Wahlström, Magnus | [L'Ecuyer, P.]
[Owen, A. B.] | | | Implementation of a component-by-component algorithm to generate small low-discrepancy samples
In: Monte Carlo and Quasi-Monte Carlo Methods 2008, 323-338 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin
Huber, Anna
Levavi, Ariel | [Dong, Yingfei]
[Du, Ding-Zhu]
[Ibarra, Oscar] | | | Strong robustness of randomized rumor spreading protocols
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 812-821 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin
[Theile, Madeleine] | [Raidl, Günther]
[Rothlauf, Frank] | | | Improved Analysis Methods for Crossover-Based Algorithms
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 247-254 | Proceedings Article | |
| | 2009 | | | Doerr, Benjamin
Wahlström, Magnus | [Finocchi, Irene]
[Hershberger, John] | | | Randomized Rounding in the Presence of a Cardinality Constraint
In: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX), 162-174 | Proceedings Article | |
| | 2009 | | | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao] | | | | Multiline Addressing by Network Flow
In: Algorithmica [53], 583-596 | Journal Article | |
| | 2009 | | | Elbassioni, Khaled | | | | Algorithms for Dualization over Products of Partially Ordered Sets
In: SIAM Journal on Discrete Mathematics [23], 487-510 | Journal Article | |
| | 2009 | | | Elbassioni, Khaled
[Fishkin, Aleksei V.]
[Sitters, René] | | | | Approximation algorithms for the Euclidean traveling salesman problem with discrete and continuous neighborhoods
In: International Journal of Computational Geometry & Applications [19], 173-193 | Journal Article | |
| | 2009 | | | Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran | [Fiat, Amos]
[Sanders, Peter] | | | Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
In: Algorithms - ESA 2009 : 17th Annual European Symposium, 143-154 | Proceedings Article | |
| | 2009 | | | Elbassioni, Khaled
[Makino, Kazuhisa]
Rauf, Imran | [Ngo, Hung Q.] | | | On the Readability of Monotone Boolean Formulae
In: Computing and Combinatorics :15th Annual International Conference, COCOON 2009, 496-505 | Proceedings Article | |
| | 2009 | | | Elbassioni, Khaled
Raman, Rajiv
[Ray, Saurabh]
[Sitters, Rene] | [Matthieu, Claire] | | | On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 1210-1219 | Proceedings Article | |
| | 2009 | | | Elbassioni, Khaled
Raman, Rajiv
Ray, Saurabh
[Sitters, Rene] | [Mavronicolas, Marios]
[Papadopoulou, Vicky G.] | | | On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 275-286
In: ArXiv.org [5814], 275-286 | Proceedings Article | |
| | 2009 | | | Elbassioni, Khaled
[Tiwary, Hans Raj] | | | | Complexity of Approximating the Vertex Centroid of a Polyhedron
In: Algorithms and Computation, 20th International Symposium (ISAAC), 413-422 | Proceedings Article | |
| | 2009 | | | Elmasry, Amr | | | | Computing the subset partial order for dense families of sets
In: Information Processing Letters [109], 1082-1086 | Journal Article | |
| | 2009 | | | Elmasry, Amr
Manjunath, Madhusudan | Asano, Tetsuo | | | Enumerating Trichromatic Triangles Containing the Origin in Linear Time
In: Japanese Conference in Computational Geometry and Graphs 2009, 101-103 | Proceedings Article | |
| | 2009 | | | Elmasry, Amr | [Matthieu, Claire] | | | Pairing Heaps with O(log log n) decrease Cost
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 471-476 | Proceedings Article | |
| | 2009 | | | Emeliyanenko, Pavel
Berberich, Eric
Sagraloff, Michael | [Bebis, George]
[Boyle, Richard]
[Parvin, Bahram]
[Koracin, Darko]
[Kuno, Yoshinori]
[Wang, Junxian]
[Pajarola, Renato]
[Lindstrom, Peter]
[Hinkenjann, André]
[Encarnação, Miguel L.]
[Silva, Cláudio T.]
[Coming, Daniel] | | | Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
In: Advances in Visual Computing : 5th International Symposium, ISVC 2009, 608-619 | Proceedings Article | |
| | 2009 | | | Emeliyanenko, Pavel | [Dou, Yong]
[Gruber, Ralf]
[Joller, Josef] | | | Efficient Multiplication of Polynomials on Graphics Hardware
In: Advanced Parallel Processing Technologies : 8th International Symposium, APPT 2009, 134-149 | Proceedings Article | |
| | 2009 | | | [Epstein, Leah]
[Kleiman, Elena]
Mestre, Julian | [Leonardi, Stefano] | | | Parametric Packing of Selfish Items and the Subset Sum Algorithm
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 67-78 | Proceedings Article | |
| | 2009 | | | [Epstein, Leah]
[Kleiman, Elena]
van Stee, Rob | [Leonardi, Stefano] | | | Maximizing the Minimum Load: The Cost of Selfishness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 232-243 | Proceedings Article | |
| | 2009 | | | [Epstein, Leah]
van Stee, Rob
[Tamir, Tami] | | | | Paging with request sets
In: Theory of Computing Systems [44], 67-81 | Journal Article | |
| | 2009 | | | Fountoulakis, Nikolaos
Huber, Anna | | | | Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading
In: SIAM Journal on Discrete Mathematics [23], 1964-1991 | Journal Article | |
| | 2009 | | | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | | | | The Speed of Broadcasting in Random Networks: Density Does Not Matter
In: 23rd International Symposium on Distributed Computing (DISC '09), 529-530 | Proceedings Article | |
| | 2009 | | | Fountoulakis, Nikolaos
Huber, Anna
Panagiotou, Konstantinos | [Keidar, Idit] | | | Brief Announcement: The Speed of Broadcasting in Random Networks - Density Does Not Matter
In: Distributed Computing : 23rd International Symposium, DISC 2009, 529-530 | Proceedings Article | |
| | 2009 | | | Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk] | | | | Minors in random regular graphs
In: Random Structures and Algorithms [35], 444-463 | Journal Article | |
| | 2009 | | | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | | | | Comparison of Simple Diversity Mechanisms on Plateau Functions
In: Theoretical Computer Science [410], 2455-2462 | Journal Article | |
| | 2009 | | | Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten] | | | | Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem
In: Evolutionary Computation, [17], 3-19 | Journal Article | |
| | 2009 | | | Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank | [Raidl, Günther]
[Rothlauf, Franz] | | | Multiplicative Approximations and the Hypervolume Indicator
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 571-578 | Proceedings Article | |
| | 2009 | | | [Friedrich, Tobias]
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten] | | | | Analysis of Diversity-Preserving Mechanisms for Global Exploration
In: Evolutionary Computation [17], 455-476 | Journal Article | |
| | 2009 | | | [Friedrich, Tobias]
[Sauerwald, Thomas] | | | | Near-Perfect Load Balancing by Randomized Rounding
In: STOC09 : Proceedings of the 2009 ACM International Symposium on Theory of Computing, 121-130 | Proceedings Article | |
| | 2009 | | | Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan] | [Albers, Susanne]
[Marchetti-Spaccamela, Alberto]
[Matias, Yossi]
[Nikoletseas, Sotiris]
[Thomas, Wolfgang] | | | Smoothed Analysis of Balancing Networks
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 472-483 | Proceedings Article | |
| | 2009 | | | [Gandhi, Rajiv]
Mestre, Julián | | | | Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
In: Algorithmica [54], 54-71 | Journal Article | |
| | 2009 | | | Gärtner, Tobias
[Hotz, Günter] | [Ambos-Spies, Klaus]
[Löwe, Benedikt]
[Merkle, Wolfgang] | | | Computability of Analytic Functions with Analytic Machines
In: Mathematical Theory and Computational Practice : 5th Conference on Computability in Europe, CiE 2009, 250-259 | Proceedings Article | |
| | 2009 | | | Gidenstam, Anders
[Papatriantafilou, Marina]
[Sundell, Håkan]
[Tsigas, Philippas] | | | | Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
In: IEEE Transactions on Parallel and Distributed Systems [20], 1173-1187 | Journal Article | |
| | 2009 | | | Harren, Rolf | | | | Approximation Algorithms for Orthogonal Packing Problems for Hypercubes
In: Theoretical Computer Science [410], 4504-4532 | Journal Article | |
| | 2009 | | | Harren, Rolf
van Stee, Rob | [Dinur, Irit]
[Jansen, Klaus]
[Naor, Joseph]
[Rolim, José] | | | Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
In: Approximation, Randomization, and Combinatorial Optimization : Algorithms and Techniques ; 12th International Workshop, APPROX 2009 and 13th International Workshop, RANDOM 2009, 177-189 | Proceedings Article | |
| | 2009 | | | [Helwig, Sabine]
Neumann, Frank
[Wanka, Rolf] | [Bouchachia, Abdelhamid]
[Nedjah, Nadia]
[de Macedo Mourelle, Luiza]
[Pedrycz, Witold] | | | Particle Swarm Optimization with Velocity Adaptation
In: 2009 International Conference on Adaptive and Intelligent Systems ICAIS 2009 : proceedings, 146-151 | Proceedings Article | |
| | 2009 | | | Hemmer, Michael | | | | Modular Arithmetic, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual | |
| | 2009 | | | Hemmer, Michael | | | | Polynomials, CGAL - Computational Geometry Algorithms Library, release 3.4 | Manual | |
| | 2009 | | | Hemmer, Michael
[Hülse, Dominik] | | | | Generic implementation of a modular GCD over Algebraic Extension Fields
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 321-324 | Proceedings Article | |
| | 2009 | | | Hemmer, Michael
Limbach, Sebastian
[Schömer, Elmar] | | | | Continued Work on the Computation of an Exact Arrangement of Quadrics
In: EuroCG'09 : 25th European Workshop on Computational Geometry, 313-316 | Proceedings Article | |
| | 2009 | | | Hemmer, Michael
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis]
[Emiris, Ioannis Z.]
[Karavelas, Menelaos I.]
[Mourrain, Bernard] | | | | Experimental evaluation and cross-benchmarking of univariate real solvers
In: Symbolic Numeric Computation 2009 (SNC 2009), 45-54 | Proceedings Article | |
| | 2009 | | | [Horoba, Chrisitian]
Neumann, Frank | | | | Additive Approximations of Pareto-Optimal Sets by Evolutionary Multi-Objective Algorithms
In: FOGA'09 : Revised Selected Papers from ACM SIGEVO Foundations of Genetic Algorithms X, 79-86 | Proceedings Article | |
| | 2009 | | | Johannsen, Daniel
[Razgon, Igor]
Wahlström, Magnus | [Kullmann, Oliver] | | | Solving SAT for CNF formulas with a one-sided variable occurrence restriction
In: Theory and Applications of Satisfiability Testing, SAT 2009 : 12th International Conference, SAT 2009, 80-85 | Proceedings Article | |
| | 2009 | | | [Kavitha, Telikepalli]
Mestre, Julian | [Dong, Yingfei]
[Du, Ding-Zhu]
[Ibarra, Oscar] | | | Max-coloring paths: Tight bounds and extensions
In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, 87-96 | Proceedings Article | |
| | 2009 | | | [Kavitha, T.]
[Liebchen, Ch.]
Mehlhorn, K.
Michail, D.
[Rizzi, R.]
[Ueckerdt, T.]
[Zweig, K.] | | | | Cycle Bases in Graphs: Characterization, Algorithms, Complexity, and Applications
In: Computer Science Review [3], 199-243 | Journal Article | |
| | 2009 | | | [Kavitha, T.]
Mestre, Julián
[Nasre, M.] | [Albers, Susanne]
[Marchetti-Spaccamela, Alberto]
[Matias, Yossi]
[Nikoletseas, Sotiris]
[Thomas, Wolfgang] | | | Popular Mixed Matchings
In: Automata, Languages and Programming : 36th International Colloquium, ICALP 2009, 574-584 | Proceedings Article | |
| | 2009 | | | Kerber, Michael | | | | Division-Free Computation of Subresultants Using Bezout Matrices
In: International Journal of Computer Mathematics [86], 2186-2200 | Journal Article | |
| | 2009 | | | Kerber, Michael | [Gerdt, Vladimir]
[Mayr, Ernst]
[Vorozhtsov, Evgenii] | | | On the Complexity of Reliable Root Approximation
In: Computer Algebra in Scientific Computing : 11th International Workshop, CASC 2009, 155-167 | Proceedings Article | |
| | 2009 | | | Kowalik, Lukasz | | | | Improved edge-coloring with three colors
In: Theoretical Computer Science [410], 3733-3742 | Journal Article | |
| | 2009 | | | Kratsch, Stefan
Neumann, Frank | [Raidl, Günther]
[Rothlauf, Franz] | | | Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 293-300 | Proceedings Article | |
| | 2009 | | | Kratsch, Stefan
Wahlström, Magnus | [Chen, Jianer]
[Fomin, Fedor V.] | | | Two Edge Modification Problems without Polynomial Kernels
In: Parameterized and Exact Computation : 4th International Workshop, IWPEC 2009, 264-275 | Proceedings Article | |
| | 2009 | | | [Krumke, Sven]
van Stee, Rob
[Westphal, Stefan] | [Ravi, S.S.]
[Shukla, Sandeep K.] | | | Online job admissions
In: Fundamental Problems in Computing : Essays in Honor of Professor Daniel J. Rosenkrantz, 435-454 | Part of a Book | |
| | 2009 | | | Mehlhorn, Kurt
Sagraloff, Michael | | | | Isolating real roots of real polynomials
In: Proceedings of the 2009 international symposium on Symbolic and algebraic computation (ISSAC), 247-254 | Proceedings Article | |
| | 2009 | | | Neumann, Frank
[Oliveto, Pietro Simone]
[Witt, Carsten] | [Raidl, Günther]
[Rothlauf, Franz] | | | Theoretical Analysis of Fitness-Proportional Selection: Landscapes and Efficiency
In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO 2009), 835-842 | Proceedings Article | |
| | 2009 | | | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | | | | Analysis of Different MMAS ACO Algorithms on Unimodal Functions and Plateaus
In: Swarm Intelligence [3], 35-68 | Journal Article | |
| | 2009 | | | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | [Lim, Chee Peng]
[Jain, Lakhmi C.]
[Dehuri, Satchidananda] | | | Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
In: Innovations in Swarm Intelligence, 91-120 | Part of a Book | |
| | 2009 | | | Neumann, Frank
[Witt, Carsten] | | | | Runtime Analysis of a Simple Ant Colony Optimization Algorithm
In: Algorithmica [54], 243-255 | Journal Article | |
| | 2009 | | | [Oliveto, Pietro Simone]
[Lehre, Per Kristian]
Neumann, Frank | | | | Theoretical Analysis of Rank-Based Mutation - Combining Exploration and Exploitation
In: 2009 IEEE Congress on Evolutionary Computation : CEC, 1455-1462 | Proceedings Article | |
| | 2009 | | | Panagiotou, Konstantinos | | | | The Degree Sequence of Random Graphs from Subcritical Classes
In: Combinatorics, Probability and Computing [18], 647-681 | Journal Article | |
| | 2009 | | | Panagiotou, Konstantinos | | | | Vertices of Degree k in Random Unlabeled Trees
In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb '09), 41-45 | Proceedings Article | |
| | 2009 | | | Panagiotou, Konstantinos
[Steger, Angelika] | [Matthieu, Claire] | | | Maximal Biconnected Subgraphs of Random Planar Graphs
In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), 432-440 | Proceedings Article | |
| | 2009 | | | Philip, Geevarghese
[Raman, Venkatesh]
[Sikdar, Somnath] | [Fiat, Amos]
[Sanders, Peter] | | | Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, 694-705 | Proceedings Article | |
| | 2009 | | | Pyrga, Evangelia
[Chung, Christine] | [Mavronicolas, Marios]
[Papadopoulou, Vicky G.] | | | Stochastic Stability in Internet Router Congestion Games
In: Algorithmic Game Theory : Second International Symposium, SAGT 2009, 183-195 | Proceedings Article | |
| | 2009 | | | | [Raidl, Günther R.]
[Alba, Enrique]
[Bacardit, Jaume]
[Beyer, Hans-Georg]
[Birattari, Mauro]
[Blum, Christian]
[Bosman, Peter A.N.]
[Congdon, Clare B.]
[Corne, David W.]
[Cotta, Carlos]
[Di Penta, Massimiliano]
Doerr, Benjamin
[Drechsle, Rolf]
[Ebner, Marc]
[Grahl, Jörn]
[Jansen, Thomas]
[Knowles, Joshua D.]
[Lenaerts, Tom]
[Middendorf, Martin]
[Miller, Julian F.]
[O'Neill, Michael]
[Poli, Riccardo]
[Squillero, Giovanni]
[Stanley, Kenneth O.]
[Stützle, Thomas]
[van Hemert, Jano] | | | GECCO 2009: Proceedings of the 11th Annual conference on Genetic and evolutionary computation. | Proceedings | |
| | 2009 | | | Sagraloff, Michael
Kerber, Michael
Hemmer, Michael | [Suzuki, Masakazu]
[Hong, Hoon]
[Anai, Hirokazu]
[Yap, Chee]
[Sato, Yosuke]
[Yoshida, Hiroshi] | | | Certified Complex Root Isolation via Adaptive Root Separation Bounds
In: The Joint Conference of ASCM 2009 and MACIS 2009, 151-166 | Proceedings Article | |
| | 2009 | | | [Sanders, Peter]
Sivadasan, Naveen
[Skutella, Martin] | | | | Online scheduling with bounded migration
In: Mathematics of Operations Research [34], 481-498 | Journal Article | |
| | 2009 | | | Schweitzer, Pascal | | | | Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
In: Information Processing Letters [109], 229-232 | Journal Article | |
| | 2009 | | | Vidali, Angelina | [Leonardi, Stefano] | | | The Geometry of Truthfulness
In: Internet and Network Economics : 5th International Workshop, WINE 2009, 340-350 | Proceedings Article | |
| | 2009 | | | Wahlström, Magnus | [Frid, Anna]
[Morozov, Andrey]
[Rybalchenko, Andrey]
[Wagner, Klaus W.] | | | New Plain-Exponential Time Classes for Graph Homomorphism
In: Computer Science – Theory and Applications : 4th International Computer Science Symposium in Russia, CSR 2009, 346-355 | Proceedings Article | |
| | 2008 | | | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | | | | An $O(n^2.75)$ algorithm for incremental topological ordering
In: ACM Transactions on Algorithms [4], 1-14 | Journal Article | |
| | 2008 | | | Ajwani, Deepak
[Malinger, Itay]
[Meyer, Ulrich]
[Toledo, Sivan] | [McGeoch, Catherine] | | | Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), 208-219 | Proceedings Article | |
| | 2008 | | | [Albrecht, Marc]
Karrenbauer, Andreas
[Xu, Chihao] | | | | A clipper-free Algorithm for efficient HW-Implementation of local dimming LED-Backlight
In: Proceedings of the 28th International Display Research Conference (IDRC), 286-289 | Proceedings Article | |
| | 2008 | | | Althaus, Ernst
Canzar, Stefan | | | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Journal of Combinatorial Optimization [16], 127-154 | Journal Article | |
| | 2008 | | | Althaus, Ernst
Canzar, Stefan | | | | LASA: A tool for non-heuristic alignment of multiple sequences
In: Bioinformatics Research and Development (BIRD’08), 489-498 | Proceedings Article | |
| | 2008 | | | Althaus, Ernst
Canzar, Stefan
Elbassioni, Khaled
Karrenbauer, Andreas
Mestre, Julián | | | | Approximating the Interval Constrained Coloring Problem
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 210-221 | Proceedings Article | |
| | 2008 | | | Althaus, Ernst
Canzar, Stefan
[Emmett, Mark]
Karrenbauer, Andreas
[Marshall, Alan]
[Meyer-Bäse, Anke]
[Zhang, Huimin] | | | | Computing H/D-exchange speeds of single residues from data of peptic fragments
In: 23rd Annual ACM Symposium on Applied Computing (SAC), 1273-1277 | Proceedings Article | |
| | 2008 | | | Althaus, Ernst
Naujoks, Rouven | [McGeoch, Catherine C.] | | | Reconstructing Phylogenetic Networks with One Recombination
In: Experimental Algorithms, 7th International Workshop, WEA 2008, 275-288 | Proceedings Article | |
| | 2008 | | | Angelopoulos, Spyros | | | | A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
In: 16th Annual European Symposium on Algorithms (ESA 2008), 76-87 | Proceedings Article | |
| | 2008 | | | Angelopoulos, Spyros
[Dorrigiv, Reza]
[Lopez-Ortiz, Alejandro] | | | | List Update with Locality of Reference
In: 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), 399-410 | Proceedings Article | |
| | 2008 | | | Angelopoulos, Spyros
[Lopez-Ortiz, Alejandro]
[Hamel,Angele] | | | | Optimal Scheduling of Contract Algorithms with Soft Deadlines
In: 23rd National Conference on Artificial Intelligence (AAAI 2008), 868-873 | Proceedings Article | |
| | 2008 | | | Berberich, Eric
Emeliyanenko, Pavel | | | | CGAL's Curved Kernel via Analysis | Report | |
| | 2008 | | | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | | | | Prototype implementation of the algebraic kernel | Report | |
| | 2008 | | | Berberich, Eric
Kerber, Michael | [Haines, Eric]
[McGuire, Morgan] | | | Exact Arrangements on Tori and Dupin Cyclides
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 59-66 | Proceedings Article | |
| | 2008 | | | Berberich, Eric
Kerber, Michael | [Petitjean, Sylvain] | | | Arrangements on Surfaces of Genus One: Tori and Dupin Cyclides
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 209-212 | Proceedings Article | |
| | 2008 | | | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | [Petitjean, Sylvain] | | | Geometric Analysis of Algebraic Surfaces Based on Planar Arrangements
In: 24th European Workshop on Computational Geometry - Collection of Abstracts, 29-32 | Proceedings Article | |
| | 2008 | | | Berberich, Eric
Kerber, Michael
Sagraloff, Michael | [Teillaud, Monique]
[Welzl, Emo] | | | Exact Geometric-Topological Analysis of Algebraic Surfaces
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 164-173 | Proceedings Article | |
| | 2008 | | | Berberich, Eric
Sagraloff, Michael | [Haines, Eric]
[McGuire, Morgan] | | | A Generic and Flexible Framework for the Geometrical and Topological Analysis of (Algebraic) Surfaces
In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, 171-182 | Proceedings Article | |
| | 2008 | | | [Boros, Endre]
Elbassioni, Khaled
Gurvich, Vladimir
[Makino, Kazuhisa]
[Oudalov, Vladimir] | | | | A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2x2 subgames
In: Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, 99-109 | Proceedings Article | |
| | 2008 | | | [Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Tiwary, Hans Raj] | | | | Characterization of the vertices and extreme directions of the negative cycle polyhedron and hardness of generating vertices of 0/1-polyhedra
In: CoRR [abs/0801.3790], x-x | Journal Article | |
| | 2008 | | | [Boros, Endre]
Elbassioni, Khaled
[Makino, Kazuhisa] | | | | On Berge Multiplication for Monotone Boolean Dualization
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, 48-59 | Proceedings Article | |
| | 2008 | | | Bringmann, Karl
Friedrich, Tobias | [Hong, Seok-Hee]
[Nagamochi, Hiroshi]
[Fukunaga, Takuro] | | | Approximating the volume of unions and intersections of high-dimensional geometric objects.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 436-447 | Proceedings Article | |
| | 2008 | | | [Brockhoff, Dimo]
Friedrich, Tobias
Neumann, Frank | [Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola] | | | Analyzing Hypervolume Indicator Based Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 651-660 | Proceedings Article | |
| | 2008 | | | Chang, Kevin
[Johnson, Aaron] | | | | Online and offline selling in limit order markets
In: 4th International Workshop on Internet and Network Economics (WINE 2008), 41-52 | Proceedings Article | |
| | 2008 | | | Christodoulou, George | [Kao, Ming-Yang] | | | Price of Anarchy
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| | 2008 | | | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | [Halperin, Dan]
Mehlhorn, Kurt | | | A Characterization of 2-Player Mechanisms for Scheduling
In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings., 297-307 | Proceedings Article | |
| | 2008 | | | Christodoulou, George
[Kovács, Annamária]
[Schapira, Michael] | [Aceto, Luca]
[Damg{\aa}rd, Ivan]
[Goldberg, Leslie Ann]
[Halldórsson, Magnús M.]
[Ingólfsdóttir, Anna]
[Walukiewicz, Igor] | | | Bayesian Combinatorial Auctions
In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I, 820-832 | Proceedings Article | |
| | 2008 | | | Cole, Richard
Kowalik, Lukasz | | | | New Linear-Time Algorithms for Edge-Coloring Planar Graphs
In: Algorithmica [50], 351-368 | Journal Article | |
| | 2008 | | | [Cooley, Oliver]
Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk] | | | | 3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
In: Journal of Combinatorial Theory B [98], 484-505 | Journal Article | |
| | 2008 | | | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | | | Deterministic Random Walks on Regular Trees
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 766-772 | Proceedings Article | |
| | 2008 | | | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | | | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Journal of Science and Technology [23], 749-762 | Journal Article | |
| | 2008 | | | [Diedrich, Florian]
[Kehden, Britta]
Neumann, Frank | [Berghammer, Rudolf]
[Möller, Bernhard]
[Struth, Georg] | | | Multi-objective Problems in Terms of Relational Algebra
In: Relations and Kleene Algebra in Computer Science 2008, 84-98 | Proceedings Article | |
| | 2008 | | | [Diedrich, Florian]
Neumann, Frank | | | | Using Fast Matrix Multiplication in Bio-Inspired Computation for Complex Optimization Problems
In: IEEE Congress on Evolutionary Computation 2008, 3828-3833 | Proceedings Article | |
| | 2008 | | | Doerr, Benjamin
Friedrich, Tobias
[Sauerwald, Thomas] | | | | Quasirandom Rumor Spreading
In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, 773-781 | Proceedings Article | |
| | 2008 | | | Doerr, Benjamin
[Gnewuch, Michael] | [Keller, Alexander]
[Heinrich, Stefan]
[Niederreiter, Harald] | | | Construction of Low-Discrepancy Point Sets of Small Size by Bracketing Covers and Dependent Randomized Rounding
In: Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312 | Proceedings Article | |
| | 2008 | | | Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Friedrich] | | | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods and Applications [14], 129-149 | Journal Article | |
| | 2008 | | | Doerr, Benjamin
[Gnewuch, Michael]
[Kritzer, Peter]
[Pillichshammer, Peter] | | | | Component-by-component construction of low-discrepancy point sets of small size
In: Monte Carlo Methods Applications [14], 129-150 | Journal Article | |
| | 2008 | | | Doerr, Benjamin
Happ, Edda | | | | Directed trees: A Powerful Representation for Sorting and Ordering Problems
In: Proceedings of CEC 2008, 3606-3613 | Proceedings Article | |
| | 2008 | | | Doerr, Benjamin
Happ, Edda
Klein, Christian | [Ryan, Conor]
[Keijzer, Maarten] | | | Crossover Can Provably be Useful in Evolutionary Computation
In: Genetic and Evolutionary Computation Conference 2008, 539-546 | Proceedings Article | |
| | 2008 | | | Doerr, Benjamin
[Jansen, Thomas]
[Klein, Christian] | [Ryan, Conor]
[Keijzer, Maarten] | | | Comparing local and global mutations on bit-strings.
In: Genetic and Evolutionary Computation Conference 2008, 929-936 | Proceedings Article | |
| | 2008 | | | Doerr, Benjamin
Johannsen, Daniel
[Tang, Ching Hoo] | [Günter Rudolph]
[Thomas Jansen]
[Simon M. Lucas]
[Carlo Poloni]
[Nicola Beume] | | | How Single Ant ACO Systems Optimize Pseudo-Boolean Functions
In: Parallel Problem Solving from Nature – PPSN X, 378-388 | Proceedings Article | |
| | 2008 | | | Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola] | | | | How much Geometry it takes to Reconstruct a 2-Manifold in $R^3$
In: 10th Workshop on Algorithm Engineering and Experiments (ALENEX-2008), 65-74 | Proceedings Article | |
| | 2008 | | | Dumitriu, Daniel
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola] | [Gudmundsson, Joachim] | | | On the Locality of Extracting a 2-Manifold in $R^3$
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT-2008), 270-281 | Proceedings Article | |
| | 2008 | | | Dumitriu, Daniel
[Funke, Stefan]
Kutz, Martin
[Milosavljevic, Nikola] | [Petitjean, Sylvain] | | | On the Locality of Extracting a 2-Manifold in $R^3$
In: Collection of abstracts of the 24th European Workshop on Computational Geometry, 205-208 | Proceedings Article | |
| | 2008 | | | [Eigensatz, Michael]
[Giesen, Joachim]
Manjunath, Madhusudan | [Morin, Pat] | | | The Solution Path of the Slab Support Vector Machine
In: The 20th Canadian Conference on Computational Geometry, 211-214 | Proceedings Article | |
| | 2008 | | | Eigenwillig, Arno
Kerber, Michael | | | | Exact and Efficient 2D-Arrangements of Arbitrary Algebraic Curves
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), 122-131 | Proceedings Article | |
| | 2008 | | | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | | | Energy-Aware Stage Illumination
In: International Journal of Computational Geometry and Applications [18], 107-129 | Journal Article | |
| | 2008 | | | El Kahoui, M'hammed | | | | Computing with algebraic curves in generic position | Miscellaneous | |
| | 2008 | | | El Kahoui, M'hammed | | | | Polynomial parametrization of nonsingular algebraic curves | Miscellaneous | |
| | 2008 | | | Elbassioni, Khaled | | | | A note on systems with max-min and max-product constraints
In: Fuzzy Sets and Systems [159], 2272-2277 | Journal Article | |
| | 2008 | | | Elbassioni, Khaled | | | | On the complexity of monotone dualization and generating minimal hypergraph transversals
In: Discrete Applied Mathematics [156], 2109-2123 | Journal Article | |
| | 2008 | | | Elbassioni, Khaled
Elmasry, Amr
[Kamel, Ibrahim] | | | | Indexing Schemes for Multi-dimensional Moving Objects
In: Encyclopedia of GIS, 523-529 | Part of a Book | |
| | 2008 | | | Elbassioni, Khaled
[Hagen, Matthias]
Rauf, Imran | | | | Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems
In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, 91-102 | Proceedings Article | |
| | 2008 | | | Elbassioni, Khaled
[Tiwary, Hans Raj] | | | | On a Cone Covering Problem
In: Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 171-174 | Proceedings Article | |
| | 2008 | | | Elbassioni, Khaled
[Tiwary, Hans Raj] | | | | On Computing the Vertex Centroid of a Polyhedron
In: CoRR [abs/0806.3456], x-x | Journal Article | |
| | 2008 | | | Elmasry, Amr | Elmasry, Amr | | | Violation Heaps: A Better Substitute for Fibonacci Heaps | Report | |
| | 2008 | | | Elmasry, Amr
[Hammad, Abdelrahman] | | | | Inversion-Sensitive Sorting Algorithms in Practice
In: ACM Journal of Experimental Algorithmics [13], 1-18 | Journal Article | |
| | 2008 | | | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | | | Multipartite Priority Queues
In: ACM Transactions on Algorithms [5], 1-19 | Journal Article | |
| | 2008 | | | Elmasry, Amr
[Jensen, Claus]
[Katajainen, Jyrki] | | | | Two New Methods for Constructing Double-Ended Priority Queues from Priority Queues
In: Computing [83], 193-204 | Journal Article | |
| | 2008 | | | Emeliyanenko, Pavel
Kerber, Michael | | | | An implementation of the 2D Algebraic Kernel | Report | |
| | 2008 | | | Emeliyanenko, Pavel
Kerber, Michael | | | | Visualizing and Exploring Planar Algebraic Arrangements - a Web Application | Report | |
| | 2008 | | | Emeliyanenko, Pavel
Kerber, Michael | [Teillaud, Monique]
[Welzl, Emo] | | | Visualizing and Exploring Planar Algebraic Arrangements -- a Web Application
In: Proceedings of the 24th ACM Symposium on Computational Geometry, 224-225 | Proceedings Article | |
| | 2008 | | | [Emiris, Ioannis]
Hemmer, Michael
[Tsigaridas, Elias]
[Tzoumas, Georg] | | | | Voronoi diagram of ellipses: CGAL-based implementation | Report | |
| | 2008 | | | [Emiris, Ioannis Z.]
Hemmer, Michael
[Karavelas, Menelaos]
[Mourrain, Bernard]
[Tsigaridas, Elias P.]
[Zafeirakopoulos, Zafeirakis] | | | | Experimental evaluation and cross-benchmarking of univariate real solvers | Report | |
| | 2008 | | | [Emiris,Ioannis]
Hemmer, Michael
[Karavelas, Menelaos]
[Limbach, Sebastian]
[Mourrain, Bernard]
[Tsigaridas, Elias]
[Zafeirakopoulos,Zafeirakis] | | | | Cross-benchmarks of univariate algebraic kernels | Report | |
| | 2008 | | | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | | | | Online unit clustering: Variations on a theme
In: Theoretical Computer Science [407], 85-96 | Journal Article | |
| | 2008 | | | [Epstein, Leah]
[Levin, Asaf]
van Stee, Rob | | | | Two-dimensional packing with conflicts
In: Acta Informatica [45], 155-175 | Journal Article | |
| | 2008 | | | [Epstein, Leah]
van Stee, Rob | [Kaklamanis, Christos]
[Skutella, Martin] | | | Approximation schemes for packing splittable items with cardinality constraints
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 232-245 | Proceedings Article | |
| | 2008 | | | [Epstein, Leah]
van Stee, Rob | [Kaklamanis, Christos]
[Skutella, Martin] | | | On the Online Unit Clustering Problem
In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, 193-206 | Proceedings Article | |
| | 2008 | | | [Epstein, Leah]
van Stee, Rob | [Laber, Eduardo Sany]
[Bornstein, Claudson]
[Noguiera, Loana Tito]
[Faria, Luerbio] | | | Maximizing the minimum load for selfish agents
In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, 264-275 | Proceedings Article | |
| | 2008 | | | [Epstein, Leah]
van Stee, Rob | [Monien, Burkhard]
[Schroeder, Ulf-Peter] | | | The price of anarchy on uniformly related machines revisited
In: Algorithmic Game Theory, First International Symposium, SAGT 2008, 46-57 | Proceedings Article | |
| | 2008 | | | Fountoulakis, Nikolaos
[Kühn, Daniela]
[Osthus, Deryk] | | | | The order of the largest complete minor in a random graph
In: Random Structures and Algorithms [33], 127-141 | Journal Article | |
| | 2008 | | | Fountoulakis, Nikolaos
[Reed, Bruce] | | | | The evolution of the mixing rate of a simple random walk on the giant component of a random graph
In: Random Structures and Algorithms [33], 68-86 | Journal Article | |
| | 2008 | | | Friedrich, Tobias
Hebbinghaus, Nils | [Hong, Seok-Hee]
[Nagamochi, Hiroshi]
[Fukunaga, Takuro] | | | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.
In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), 693-704 | Proceedings Article | |
| | 2008 | | | Friedrich, Tobias
[Horoba, Christian]
Neumann, Frank | [Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola] | | | Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
In: Parallel Problem Solving from Nature (PPSN X), 671-680 | Proceedings Article | |
| | 2008 | | | Friedrich, Tobias
Neumann, Frank | | | | When to Use Bit-wise Neutrality
In: IEEE Congress on Evolutionary Computation 2008, 997-1003 | Proceedings Article | |
| | 2008 | | | Friedrich, Tobias
[Oliveto, Pietro]
[Sudholt, Dirk]
[Witt, Carsten] | [Keijzer, Maarten] | | | Theoretical Analysis of Diversity Mechanisms for Global Exploration
In: Proceedings of the 10th annual conference on Genetic and evolutionary computation (GECCO 2008), 945-952 | Proceedings Article | |
| | 2008 | | | [Froyland, Gary]
[Koch, Thorsten]
Megow, Nicole
[Duane, Emily]
[Wren, Howard] | | | | Optimizing the Landside Operation of a Container Terminal
In: OR Spectrum [30], 53-75 | Journal Article | |
| | 2008 | | | Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi] | [Sotiris E. Nikoletseas]
[Bogdan S. Chlebus]
[David B. Johnson]
[Bhaskar Krishnamachari] | | | Power Assignment Problems in Wireless Communication: Covering Points by Disks, Reaching few Receivers Quickly, and Energy-Efficient Travelling Salesman Tours
In: Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, 282-295 | Proceedings Article | |
| | 2008 | | | [Garg, Naveen]
[Kavitha, T.]
[Kumar, Amit]
Mehlhorn, Kurt
Mestre, Julián | | | | Assigning Papers to Referees | Unpublished/Draft | |
| | 2008 | | | Giesen, Joachim | | | | Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering
In: IEEE Transactions on Visualization and Computer Graphics [13], 1664-1671 | Journal Article | |
| | 2008 | | | Giesen, Joachim | | | | Delaunay Triangulation Approximates Anchor Hull
In: Computational Geometry - Theory and Applications [36], 131-143 | Journal Article | |
| | 2008 | | | Giesen, Joachim | | | | The Flow Complex: A Data Structure for Geometric Modeling
In: Computational Geometry - Theory and Applications [39], 178-190 | Journal Article | |
| | 2008 | | | Govindarajan, Sathish
[Dietze, Michael C.]
[Agarwal, Pankaj K.]
[Clark, James S.] | | | | A scalable algorithm for dispersing population
In: Journal of Intellingent Information Systems [29], 39-61 | Journal Article | |
| | 2008 | | | Happ, Edda
Johannsen, Daniel
Klein, Christian
Neumann, Frank | [Ryan, Conor]
[Keijzer, Maarten] | | | Rigorous Analyses of Fitness-Proportional Selection for Optimizing Linear Functions
In: Genetic and Evolutionary Computation Conference 2008, 953-960 | Proceedings Article | |
| | 2008 | | | Harren, Rolf
van Stee, Rob | [Gudmundsson, Joachim] | | | Packing Rectangles into 2 OPT Bins using Rotations
In: 11th Scandinavian Workshop on Algorithm Theory, 306-318 | Proceedings Article | |
| | 2008 | | | Hemmer, Michael | | | | CGAL package for modular arithmetic operations | Report | |
| | 2008 | | | Hemmer, Michael | | | | CGAL package: Algebraic Foundations | Report | |
| | 2008 | | | Hemmer, Michael | | | | Evaluation of different approaches in 3D curved kernel for arrangements of quadrics | Report | |
| | 2008 | | | Hemmer, Michael
[Dupont, Laurent]
[Petitjean, Sylvain]
[Schömer, Elmar] | | | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics | Report | |
| | 2008 | | | Hemmer, Michael
[Limbach, Sebastian] | | | | Arrangements of quadrics in 3D: continued work on experimental implementation | Report | |
| | 2008 | | | [Horoba, Christian]
Neumann, Frank | [Ryan, Conor]
[Keijzer, Maarten] | | | Benefits and Drawbacks for the Use of epsilon-Dominance in Evolutionary Multi-Objective Optimization
In: Genetic and Evolutionary Computation Conference 2008, 641-680 | Proceedings Article | |
| | 2008 | | | [Huang, Chien-Chung]
Kavitha, Telikepalli
[Michail, Dimitrios]
[Nasre, Meghana] | | | | Bounded Unpopularity Matchings
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 127-137 | Proceedings Article | |
| | 2008 | | | Kavitha, Telikepalli | | | | On a Special Co-cycle Basis of Graphs
In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), 343-354 | Proceedings Article | |
| | 2008 | | | Kavitha, Telikepalli
[Nasre, Meghana] | | | | Optimal Popular Matchings | Miscellaneous | |
| | 2008 | | | | [Keizer, Marten]
[Antoniol, Giulio]
[Congdon, Clare]
[Deb, Kalyanmoy]
Doerr, Benjamin
[Hansen, Nikolaus]
[Holmes, John]
[Hornby, Gergory]
[Howard, Daniel]
[Kennedy, John]
[Kumar, Sanjeev]
[Lobo, Ferdinando]
[Miller, Julian]
[Moore, Jason]
Neumann, Frank
[Pelikan, Martin]
[Pollack, Jordan]
[Sastry, Kumara]
[Stanley, Ken]
[Stoica, Adrian]
[Talbi, El Ghazli]
[Wegener, Ingo] | | | GECCO 2008: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| | 2008 | | | Kerber, Michael | | | | On filter methods in CGAL's 2D curved kernel | Report | |
| | 2008 | | | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | | | | Classroom Examples of Robustness Problems in Geometric Computations
In: Computational Geometry: Theory and Applications [40], 61-78 | Journal Article | |
| | 2008 | | | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir] | | | | Generating All Vertices of a Polyhedron Is Hard
In: Discrete & Computational Geometry [39], 174-190 | Journal Article | |
| | 2008 | | | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | | | Generating Cut Conjunctions in Graphs and Related Problems
In: Algorithmica [51], 239-263 | Journal Article | |
| | 2008 | | | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Rudolf, Gabor]
[Zhao, Jihui] | | | | On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
In: Theory Comput. Syst. [43], 204-233 | Journal Article | |
| | 2008 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | | | Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
In: Discrete Applied Mathematics [156], 2020-2034 | Journal Article | |
| | 2008 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | | | On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
In: Algorithmica [50], 159-172 | Journal Article | |
| | 2008 | | | [Khuller, Samir]
Mestre, Julián | | | | An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
In: 16th Annual European Symposium on Algorithms (ESA), 601-610 | Proceedings Article | |
| | 2008 | | | Kobel, Alexander | | | | Automated Generation of Kempe Linkages for Algebraic Curves in a Dynamic Geometry System
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 2008 | | | [Kroeske, Jense]
[Ghandar, Adam]
[Michalewicz, Zbigniew]
Neumann, Frank | [Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola] | | | Learning Fuzzy Rules with Evolutionary Algorithms - An Analytic Approach
In: Parallel Problem Solving from Nature (PPSN X), 1051-1060 | Proceedings Article | |
| | 2008 | | | [Krumke, Sven Oliver]
[Schwahn, Anne]
van Stee, Rob
[Westphal, Stephan] | | | | A monotone approximation algorithm for scheduling with precedence constraints
In: Operations Research Letters [36], 247-249 | Journal Article | |
| | 2008 | | | [Kutz, Martin]
Elbassioni, Khaled
[Katriel, Irit]
[Mahajan, Meena] | | | | Simultaneous matchings: Hardness and approximation
In: J. Comput. Syst. Sci. [74], 884-897 | Journal Article | |
| | 2008 | | | Malamatos, Theocharis | | | | Lower Bounds for expected-case planar point location
In: Computational Geometry Theory and Applications [39], 91-103 | Journal Article | |
| | 2008 | | | Mehlhorn, Kurt
[Kavitha, T.]
[Hariharan, R.] | | | | Faster Deterministic and Randomized Algorithms for Minimum Cycle Basis in Directed Graphs
In: SIAM Journal of Computing [38], 1430-1447 | Journal Article | |
| | 2008 | | | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | | | | A General Approach to the Analysis of Controlled Perturbation Algorithms | Report | |
| | 2008 | | | Mehlhorn, Kurt
Sagraloff, Michael | | | | A deterministic Bitstream Descartes Algorithm | Report | |
| | 2008 | | | Mehlhorn, Kurt
[Sanders, Peter] | | | | Algorithms and Data Structures: The Basic Toolbox | Book | |
| | 2008 | | | Mestre, Julián | | | | Adaptive Local Ratio
In: 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 152-160 | Proceedings Article | |
| | 2008 | | | Mestre, Julián | | | | Lagrangian Relaxation and Partial Cover (Extended Abstract)
In: 25th International Symposium on Theoretical Aspects of Computer Science (STACS), 539-550 | Proceedings Article | |
| | 2008 | | | [Meyer, Ulrich] | | | | On Trade-Offs in External-Memory Diameter Approximation
In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), xxx-yyyy | Proceedings Article | |
| | 2008 | | | [Meyer, Ulrich] | [Albers, Susanne]
[Weil, Pascal]
[Rochange, Christine] | | | On Dynamic Breadth-First Search in External-Memory
In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), 551-560 | Proceedings Article | |
| | 2008 | | | Neumann, Frank | | | | Expected Runtimes of Evolutionary Algorithms for the Eulerian Cycle Problem
In: Computers and Operations Research [35], 2750-2759 | Journal Article | |
| | 2008 | | | Neumann, Frank
[Reichel, Joachim] | [Rudolph, Günter]
[Jansen, Thomas]
[Lucas, Simon M.]
[Poloni, Carlo]
[Beume, Nicola] | | | Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms
In: Parallel Problem Solving from Nature (PPSN X), 72-81 | Proceedings Article | |
| | 2008 | | | Neumann, Frank
[Reichel, Joachim]
[Skutella, Martin] | [Ryan, Conor]
[Keijzer, Maarten] | | | Computing Minimum Cuts by Randomized Search Heuristics
In: Genetic and Evolutionary Computation Conference 2008, 779-786 | Proceedings Article | |
| | 2008 | | | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | [Dorigo, Marco]
[Birattari, Mauro]
[Blum, Christian]
[Clerc, Maurice]
[Stützle, Thomas]
[Winfield, Alan F. T.] | | | Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
In: International Conference on Ant Colony Optimization and Swarm Intelligence 2008, 132-143 | Proceedings Article | |
| | 2008 | | | Neumann, Frank
[Witt, Carsten] | [Maniezzo, Vittorio]
[Battiti, Roberto and]
[Watson, Jean-Paul] | | | Ant Colony Optimization and the Minimum Spanning Tree Problem
In: International Conference on Learning and Intelligent Optimization 2007, 153-166 | Proceedings Article | |
| | 2008 | | | [Pruhs, Kirk]
van Stee, Rob
[Uthaisombut, Patchrawat] | | | | Speed Scaling of Tasks with Precedence Constraints
In: Theory of Computing Systems [43], 67-80 | Journal Article | |
| | 2008 | | | Pyrga, Evangelia
[Ray, Saurabh] | | | | New existence Proofs for epsilon-nets
In: Proceedings of the twenty-fourth annual symposium on Computational geometry, 199-207 | Proceedings Article | |
| | 2008 | | | [Tiwary, Hans Raj]
Elbassioni, Khaled | | | | On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
In: Symposium on Computational Geometry 2008, 192-198 | Proceedings Article | |
| | 2008 | | | van Stee, Rob | [Kao, Ming-Yang] | | | Packet Switching in Single Buffer
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| | 2008 | | | van Stee, Rob | [Kao, Ming-Yang] | | | Paging
In: Encyclopedia of Algorithms, 1-99 | Part of a Book | |
| | 2008 | | | Wahlström, Magnus | [Grohe, Martin]
[Niedermeier, Rolf] | | | A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
In: 3rd International Workshop on Parameterized and Exact Computation (IWPEC 2008), 202-213 | Proceedings Article | |
| | 2008 | | | [Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Codrea, Cosmin] | | | | Consecutive multiline addressing: A scheme for addressing PMOLEDs
In: Journal of the Society for Information Display [16], 211-219 | Journal Article | |
| | 2008 | | | Zotenko, Elena
Mestre, Julián
O'Leary, Dianne
Przytyzka, Teresa | | | | Essential Complex Biological Modules Explain the Centrality-Lethality Rule
In: PLoS Computational Biology [x], x-x | Journal Article | |
| | 2007 | | | [Abraham, David J.]
[Irving, Robert W.]
[Kavitha, Telikepalli]
Mehlhorn, Kurt | | | | Popular Matchings
In: SIAM Journal on Computing [37], 1030-1045 | Journal Article | |
| | 2007 | | | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | | | | On the Minimum Load Coloring Problem
In: Journal of Discrete Algorithms [5], 533-545 | Journal Article | |
| | 2007 | | | Ajwani, Deepak
Elbassioni, Khaled
Govindarajan, Sathish
[Ray, Saurabh] | [Gibbons, Phillip B.]
[Scheideler, Christian] | | | Conflict-free coloring for rectangle ranges using $n^.382$ colors
In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, 181-187 | Proceedings Article | |
| | 2007 | | | Ajwani, Deepak
Elbassioni, Khaled M.
Govindarajan, Sathish
[Ray, Saurabh] | | | | Conflict-Free Coloring for Rectangle Ranges Using $\tildeO(n^.382+\epsilon)$ Colors
In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 07), (to-appear) | Proceedings Article | |
| | 2007 | | | Ajwani, Deepak
Friedrich, Tobias | [Tokuyama, Takeshi] | | | Average-Case Analysis of Online Topological Ordering
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 464-475 | Proceedings Article | |
| | 2007 | | | Ajwani, Deepak
Meyer, Ulrich
Osipov, Vitaly | [Applegate, David]
[Brodal, Gerth] | | | Improved external memory BFS implementations
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), 3-12 | Proceedings Article | |
| | 2007 | | | Ajwani, Deepak
[Ray, Saurabh]
[Seidel, Raimund]
[Tiwary, Hans Raj] | [Dehne, Frank]
[Sack, Joerg-Ruediger]
[Zeh, Norbert] | | | On Computing the Centroid of the Vertices of an Arrangement and Related Problems
In: 10th Workshop on Algorithms and Data Structures (WADS), 519-528 | Proceedings Article | |
| | 2007 | | | Althaus, Ernst
[Baumann, Tobias]
[Schömer, Elmar]
[Werth, Kai] | | | | Trunk Packing Revisited
In: Experimental Algorithms, 6th International Workshop, 420-432 | Proceedings Article | |
| | 2007 | | | Althaus, Ernst
[Canzar, Stefan] | [Dress, Andreas]
[Xu, Yinfeng]
[Zhu, Binhai] | | | A Lagrangian relaxation approach for the multiple sequence alignment problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 267-278 | Proceedings Article | |
| | 2007 | | | Angelopoulos, Spyros | | | | Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 248-257 | Proceedings Article | |
| | 2007 | | | Angelopoulos, Spyros
[Dorrigiv, Reza]
[López-Ortiz, Alejandro] | | | | On the separation and equivalence of paging strategies
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, 229-237 | Proceedings Article | |
| | 2007 | | | [Aronov, Boris]
[Asano, Tetsuo]
Funke, Stefan | [Tokuyama, Takeshi] | | | Optimal Triangulation with Steiner Points
In: Algorithms and Computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007. Proceedings, 681-691 | Proceedings Article | |
| | 2007 | | | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | | | | A simple entropy-based algorithm for planar point location
In: ACM Transactions on Algorithms [3], 17 | Journal Article | |
| | 2007 | | | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.]
[Wong, Ka Chun] | | | | Optimal expected-case planar point location
In: SIAM Journal on Computing [37], 584-610 | Journal Article | |
| | 2007 | | | [Bar-Yehuda, Reuven]
[Flysher, Guy]
Mestre, Julián
[Rawitz, Dror] | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | | | Approximation of Partial Capacitated Vertex Cover
In: 15th Annual European Symposium on Algorithms, 335-346 | Proceedings Article | |
| | 2007 | | | Bast, Holger
Chitea, Alexandru
Suchanek, Fabian
Weber, Ingmar | [Clarke, Charlie]
[Fuhr, Norbert]
[Kando, Noriko] | | | ESTER: Efficient Search in Text, Entities, and Relations
In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), 671-678 | Proceedings Article | |
| | 2007 | | | Bast, Holger
Funke, Stefan
Matijevic, Domagoj
[Sanders, Peter]
[Schultes, Dominik] | [Applegate, David]
[Brodal, Gerth] | | | In Transit to Constant Time Shortest-Path Queries in Road Networks
In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), 46-59 | Proceedings Article | |
| | 2007 | | | Bast, Holger
Funke, Stefan
[Sanders, Peter]
[Schultes, Dominik] | | | | Fast Routing in Road Networks using Transit Nodes
In: Science [316], 566 | Journal Article | |
| | 2007 | | | Bast, Holger
[Majumdar, Debapriyo]
Weber, Ingmar | [Mário J. Silva]
[Alberto H. F. Laender]
[Ricardo A. Baeza-Yates]
[Deborah L. McGuinness]
[Bj{\o}rn Olstad]
[{\O}ystein Haug Olsen]
[André O. Falc{\~a}o] | | | Efficient interactive query expansion with CompleteSearch
In: 16th Conference on Information and Knowledge Management (CIKM'07), 857-860 | Proceedings Article | |
| | 2007 | | | Bast, Holger
Weber, Ingmar | [Gronau, Norbert] | | | Managing Helpdesk Tasks with CompleteSearch: A Case Study
In: 4th Conference on Professional Knowledge Management (WM'07), 101-108 | Proceedings Article | |
| | 2007 | | | Baswana, Surender
[Sen, Sandeep] | | | | A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
In: Random Structures & Algorithms [30], 532-563 | Journal Article | |
| | 2007 | | | Behle, Markus | [Dress, Andreas]
[Xu, Yinfeng]
[Zhu, Binhai] | | | On threshold BDDs and the optimal variable ordering problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 124-135 | Proceedings Article | |
| | 2007 | | | Behle, Markus
[Jünger, Michael]
[Liers, Frauke] | [Demetrescu, Camil] | | | A Primal Branch-and-Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
In: Experimental Algorithms : 6th International Workshop, WEA 2007, 379-392 | Proceedings Article | |
| | 2007 | | | Beier, René
[Röglin, Heiko]
[Vöcking, Berthold] | [Fischettim, Matteo]
[Williamson, David P.] | | | The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
In: Integer Programming and Combinatorial Optimization : 12th International IPCO Conference, 53-67 | Proceedings Article | |
| | 2007 | | | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | | | | Filtering Algorithms for the Same and UsedBy Constraints
In: Archives of Control Sciences [to appear], to appear | Journal Article | |
| | 2007 | | | Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola] | | | | Exact Computation of Arrangements of Rotated Conics | Report | |
| | 2007 | | | Berberich, Eric
Caroli, Manuel
[Wolpert, Nicola] | | | | Exact Computation of Arrangements of Rotated Conics
In: Proceedings of 23rd European Workshop on Computational Geometry, 231-234 | Proceedings Article | |
| | 2007 | | | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | | | | Sweeping and Maintaining Two-Dimensional Arrangements on Quadrics | Report | |
| | 2007 | | | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
Mehlhorn, Kurt
[Wein, Ron] | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
In: Algorithms - ESA 2007, 15th Annual European Symposium, 645-656 | Proceedings Article | |
| | 2007 | | | Berberich, Eric
[Fogel, Efi]
[Halperin, Dan]
[Wein, Ron] | | | | Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces
In: Proceedings of 23rd European Workshop on Computational Geometry, 223-226 | Proceedings Article | |
| | 2007 | | | Berberich, Eric
[Fogel, Efi]
Meyer, Andreas | | | | Updated Website to include Benchmark Instances for Arrangements of Quadrics and Planar Algebraic Curves | Report | |
| | 2007 | | | Berberich, Eric
[Hemmer, Michael] | | | | Definition of the 3D Quadrical Kernel Content | Report | |
| | 2007 | | | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos I.]
[Teillaud, Monique] | | | | Revision of interface specification of algebraic kernel | Report | |
| | 2007 | | | Berberich, Eric
Kettner, Lutz | | | | Linear-Time Reordering in a Sweep-line Algorithm for Algebraic Curves Intersecting in a Common Point | Report | |
| | 2007 | | | Berberich, Eric
[Meyerovitch, Michal] | | | | Computing Envelopes of Quadrics | Report | |
| | 2007 | | | Berberich, Eric
[Meyerovitch, Michal] | | | | Computing Envelopes of Quadrics
In: Proceedings of 23rd European Workshop on Computational Geometry, 235-238 | Proceedings Article | |
| | 2007 | | | [Bodirsky, Manuel]
[Gröpl, Clemens]
Johannsen, Daniel
[Kang, Mihyun] | | | | A Direct Decomposition of 3-connected Planar Graphs
In: Séminaire Lotharingien de Combinatoire [B54Ak], 15 | Journal Article | |
| | 2007 | | | [Bodirsky, Manuel]
Kutz, Martin | | | | Determining the consistency of partial tree descriptions
In: Artificial Intelligence [171], 185-196 | Journal Article | |
| | 2007 | | | [Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa]
[Rudolf, Gabor] | [Lin, Guohui] | | | Generating Minimal k-Vertex Connected Spanning Subgraphs
In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Proceedings, 222-231 | Proceedings Article | |
| | 2007 | | | [Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | | | Generating Vertices of Polyhedra and Related Monotone Generation Problems | Unpublished/Draft | |
| | 2007 | | | [Brockhoff, Dimo]
Friedrich, Tobias
Hebbinghaus, Nils
Klein, Christian
Neumann, Frank
[Zitzler, Eckart] | [Dirk Thierens] | | | Do Additional Objectives Make a Problem Harder?
In: Genetic and Evolutionary Computation Conference 2007, 765-772 | Proceedings Article | |
| | 2007 | | | [Caragiannis, Ioannis]
Fishkin, Aleksei V.
[Kaklamanis, Christos]
[Papaioannou, Evi] | | | | A tight bound for online colouring of disk graphs
In: Theoretical Computer Science [384], 152-160 | Journal Article | |
| | 2007 | | | [Caragiannis, Ioannis]
Fishkin, Aleksei V.
[Kaklamanis, Christos]
[Papaioannou, Evi] | [Kratochvíl, Jan]
[Díaz, Josep]
[Fiala , Jiří] | | | Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
In: 29th Symposium on Mathematical Foundations of Computer Science MFCS 2004, 119-136 | Proceedings Article | |
| | 2007 | | | Chang, Kevin | | | | Multiple pass streaming algorithms for learning mixtures of distributions in $R^d$
In: Algorithmic Learning Theory, 18th International Conference, Proceedings, 16 | Proceedings Article | |
| | 2007 | | | Christodoulou, George
[Gourves, Laurent]
[Pascual, Fanny] | [Lin, Guohui] | | | Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
In: Computing and Combinatorics : 13th Annual International Conference, COCOON 2007, 187-197 | Proceedings Article | |
| | 2007 | | | Christodoulou, George
[Koutsoupias, Elias]
Kovács, Annamária | [Arge, Lars]
[Cachin, Christian]
[Jurdzi´nski, Tomasz]
[Tarlecki, Andrzej] | | | Mechanism design for fractional scheduling on unrelated machines
In: Automata, Languages and Programming : 34th International Colloquium, ICALP 2007, 40-52 | Proceedings Article | |
| | 2007 | | | Christodoulou, George
[Koutsoupias, Elias]
[Vidali, Angelina] | | | | A lower bound for scheduling mechanisms
In: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1163-1170 | Proceedings Article | |
| | 2007 | | | [Chrobak, Marek]
[Gasieniec, Leszek]
Kowalski, Dariusz R. | | | | The wake-up problem in multihop radio networks
In: SIAM Journal on Computing [36], 1453-1471 | Journal Article | |
| | 2007 | | | [Cole, Richard]
Kowalik, Lukasz
[Skrekovski, Riste] | | | | A Generalization of Kotzig's Theorem and Its Application
In: SIAM Journal on Discrete Mathematics [21], 93-106 | Journal Article | |
| | 2007 | | | [Cooper, Joshua]
Doerr, Benjamin
Friedrich, Tobias
[Spencer, Joel] | | | | Deterministic Random Walks on Regular Trees
In: Electronic Notes in Discrete Mathematics [29], 509-513 | Journal Article | |
| | 2007 | | | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor] | | | | Deterministic random walks on the integers
In: European Journal of Combinatorics [28], 2072-2090 | Journal Article | |
| | 2007 | | | Csaba, Bela | | | | On the Bollobas-Eidrigde conjecture for bipartite graphs
In: Combinatorics, Probability and Computing [16], 1-31 | Journal Article | |
| | 2007 | | | [Diedrich, Florian]
Harren, Rolf
[Jansen, Klaus]
[Thöle, Ralf]
[Thomas, Henning] | [Cai, Jin-Yi]
[Cooper, S. Barry]
[Zhu, Hong] | | | Approximation Algorithms for 3D Orthogonal Knapsack
In: Theory and Applications of Models of Computation, 34-45 | Proceedings Article | |
| | 2007 | | | Doerr, Benjamin | | | | Lp Linear discrepancy of totally unimodular matrices
In: Linear Algebra and Its Applications [420], 663-666 | Journal Article | |
| | 2007 | | | Doerr, Benjamin | | | | Matrix approximation and Tusnády's problem
In: European Journal of Combinatorics [28], 990-995 | Journal Article | |
| | 2007 | | | Doerr, Benjamin | | | | Partial Colorings of Unimodular Hypergraphs
In: Electronic Notes in Discrete Mathematics [29], 359-363 | Journal Article | |
| | 2007 | | | Doerr, Benjamin | | | | Roundings respecting hard constraints
In: Theory of Computing Systems [40], 467-483 | Journal Article | |
| | 2007 | | | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | | | | Unbiased Matrix Rounding
In: Electronic Notes in Discrete Mathematics [28], 41-46 | Journal Article | |
| | 2007 | | | Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils
Neumann, Frank | | | | A Rigorous View On Neutrality
In: IEEE Congress on Evolutionary Computation 2007, 2591-2597 | Proceedings Article | |
| | 2007 | | | Doerr, Benjamin
Happ, Edda
Klein, Christian | | | | A Tight Bound for the (1+1)-EA on the Single Source Shortest Path Problem
In: IEEE Congress on Evolutionary Computation 2007, 1890-1895 | Proceedings Article | |
| | 2007 | | | Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank | | | | Speeding up Evolutionary Algorithms Through Asymmetric Mutation Operators
In: Evolutionary Computation [15], 401-410 | Journal Article | |
| | 2007 | | | Doerr, Benjamin
Johannsen, Daniel | | | | Refined Runtime Analysis of a Basic Ant Colony Optimization Algorithm
In: IEEE Congress on Evolutionary Computation 2007, 501-507 | Proceedings Article | |
| | 2007 | | | Doerr, Benjamin
Johannsen, Daniel | [Thierens, Dirk] | | | Adjacency List Matchings --- An Ideal Genotype for Cycle Covers
In: Genetic and Evolutionary Computation Conference (GECCO-2007), 1203-1210 | Proceedings Article | |
| | 2007 | | | Doerr, Benjamin
Klein, Christian
[Storch, Tobias] | | | | Faster Evolutionary Algorithms by Superior Graph Representation
In: First IEEE Symposium on Foundations of Computational Intelligence (FOCI-2007), 245-250 | Proceedings Article | |
| | 2007 | | | Doerr, Benjamin
Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | [Thierens, Dirk] | | | On the Runtime Analysis of the 1-ANT ACO algorithm
In: Genetic and Evolutionary Computation Conference 2007, 33-40 | Proceedings Article | |
| | 2007 | | | Doerr, Benjamin | [Thomas, Wolfgang]
[Weil, Pascal] | | | Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 441-452 | Proceedings Article | |
| | 2007 | | | [Dupont, Laurent]
Hemmer, Michael
[Petitjean, Sylvain]
[Schömer, Elmar] | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | | | Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
In: 15th Annual European Symposium on Algorithms, 633-644 | Proceedings Article | |
| | 2007 | | | Eigenwillig, Arno | | | | On Multiple Roots in Descartes' Rule and Their Distance to Roots of Higher Derivatives
In: Journal of Computational and Applied Mathematics [200], 226-230 | Journal Article | |
| | 2007 | | | Eigenwillig, Arno
Kerber, Michael
[Wolpert, Nicola] | [Brown, Christopher W.] | | | Fast and Exact Geometric Analysis of Real Algebraic Plane Curves
In: Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, 151-158 | Proceedings Article | |
| | 2007 | | | Eigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola] | | | | Snap Rounding of Bézier Curves | Report | |
| | 2007 | | | Eigenwillig, Arno
Kettner, Lutz
[Wolpert, Nicola] | | | | Snap rounding of Bézier curves
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 158-167 | Proceedings Article | |
| | 2007 | | | Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar] | | | | Packing a truck - Now with a twist!
In: International Journal of Computational Geometry & Applications [17], 505-527 | Journal Article | |
| | 2007 | | | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Xu, Chihao] | [Camil Demetrescu] | | | Algorithms for longer OLED Lifetime
In: WEA 2007, 338-351 | Proceedings Article | |
| | 2007 | | | El Kahoui, M'hammed
[Rakrak, Said] | | | | Structure of Groebner bases with respect to block orders
In: Mathematics of Computation [76], 2181-2187 | Journal Article | |
| | 2007 | | | Elbassioni, Khaled
[Sitters, Rene]
[Zhang, Yan] | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | | | A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, 451-462 | Proceedings Article | |
| | 2007 | | | Elbassioni, Khaled M.
[Sitters, Rene]
[Zhang, Yan] | | | | A Quasi-PTAS for Envy-free Pricing on Line Graphs | Unpublished/Draft | |
| | 2007 | | | [Fogel, Efi]
[Halperin, Dan]
Kettner, Lutz
[Teillaud, Monique]
[Wein, Ron]
Wolpert, Nicola | [Boissonnat, Jean-Daniel]
[Teillaud, Monique] | | | Arrangements
In: Effective Computational Geometry for Curves and Surfaces, 1-66 | Part of a Book | |
| | 2007 | | | [Fountoulakis, Nikolaos] | | | | Percolation on sparse random graphs with given degree sequence
In: Internet Mathematics [4], 329-356 | Journal Article | |
| | 2007 | | | Fountoulakis, Nikolaos
[Reed, Bruce] | | | | Faster Mixing and Small Bottlenecks
In: Probability Theory and Related Fields [137], 475-486 | Journal Article | |
| | 2007 | | | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | | | | Plateaus Can Be Harder in Multi-Objective Optimization
In: IEEE Congress on Evolutionary Computation 2007, 2622-2629 | Proceedings Article | |
| | 2007 | | | Friedrich, Tobias
Hebbinghaus, Nils
Neumann, Frank | [Dirk Thierens] | | | Rigorous Analyses of Simple Diversity Mechanisms
In: Genetic and Evolutionary Computation Conference 2007, 1219-1225 | Proceedings Article | |
| | 2007 | | | Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten] | | | | On Improving Approximate Solutions by Evolutionary Algorithms
In: IEEE Congress on Evolutionary Computation 2007, 2614-2621 | Proceedings Article | |
| | 2007 | | | Friedrich, Tobias
[He, Jun]
Hebbinghaus, Nils
Neumann, Frank
[Witt, Carsten] | [Dirk Thierens] | | | Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
In: Genetic and Evolutionary Computation Conference 2007, 797-804 | Proceedings Article | |
| | 2007 | | | Funke, Stefan
Kesselman, Alexander
[Kuhn, Fabian]
[Lotker, Zvi]
[Segal, Michael] | | | | Improved approximation algorithms for connected sensor cover
In: Wireless Networks [13], 153-164 | Journal Article | |
| | 2007 | | | Funke, Stefan
Laue, Sören
Naujoks, Rouven | [Aspnes, James]
[Scheideler, Christian]
[Arora, Anish]
[Madden, Samuel] | | | Minimum Energy Broadcast with Few Senders
In: Distributed Computing in Sensor Systems : Third IEEE International Conference, DCOSS 2007, 404-416 | Proceedings Article | |
| | 2007 | | | Funke, Stefan
Laue, Sören | [Thomas, Wolfgang]
[Weil, Pascal] | | | Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 272-283 | Proceedings Article | |
| | 2007 | | | Funke, Stefan
[Milosavljevic, Nikola] | | | | Guaranteed-delivery Geographic Routing under Uncertain Node Locations
In: IEEE INFOCOM 2007 : 26th IEEE International Conference on Computer Communications, 1244-1252 | Proceedings Article | |
| | 2007 | | | Funke, Stefan
[Milosavljevic, Nikola] | | | | Network Sketching or: "How much Geometry hides in Connectivity? - Part II"
In: Proceedings of the eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-07), 958-967 | Proceedings Article | |
| | 2007 | | | Funke, Stefan
Rauf, Imran | [Kranakis, Evangelos]
[Opatrny, Jaroslav] | | | Information Brokerage Via Location-Free Double Rulings
In: Ad-Hoc, Mobile, and Wireless Networks : 6th International Conference, ADHOC-NOW 2007, Morelia, Mexico, September 24-26, 2007, Proceedings, 87-100 | Proceedings Article | |
| | 2007 | | | Gidenstam, Anders
[Papatriantafilou, Marina] | [Tovar, Eduardo]
[Tsigas, Philippas]
[Fouchal, Hacène] | | | LFthreads: A Lock-Free Thread Library
In: 11th International Conference On Principles Of Distributed Systems (OPODIS), 217-231 | Proceedings Article | |
| | 2007 | | | Giesen, Joachim | | | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: 23d Annual ACM Symposium on Computational Geometry, 123-124 | Proceedings Article | |
| | 2007 | | | Giesen, Joachim | [A. Gustafsson]
[A. Herrmann]
[F. Huber] | | | The Combinatorial Structure of Polyhedral Choice Based Conjoint Analysis
In: Conjoint Measurement: Methods and Applications, 259-271 | Part of a Book | |
| | 2007 | | | Giesen, Joachim
[Mitsche, Dieter]
[Schuberth, Eva] | [Kao, Ming-Yang]
[Li, Xiang-Yang] | | | Collaborative Ranking: an aggregation algorithm for individuals' preference estimation
In: Algorithmic Aspects in Information and Management : Third International Conference, AAIM 2007, 58-67 | Proceedings Article | |
| | 2007 | | | Giesen, Joachim
[Schuberth, Eva]
[Simon, Klaus]
[Zolliker, Peter]
[Zweifel, Oliver] | | | | Image-Dependent Gamut Mapping as Optimization Problem
In: IEEE Transactions on Image Processing [16], 2401-2410 | Journal Article | |
| | 2007 | | | [Gotsman, Craig]
Kaligosi, Kanela
Mehlhorn, Kurt
Michail, Dimitrios
Pyrga, Evangelia | | | | Cycle Bases of Graphs and Sampled Manifolds
In: Computer Aided Geometric Design [24], 464 | Journal Article | |
| | 2007 | | | Hachenberger, Peter
Kettner, Lutz
Mehlhorn, Kurt | | | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, Optimized Implementation and Experiments
In: Computational Geometry: Theory and Applications [38], 64-99 | Journal Article | |
| | 2007 | | | Harren, Rolf | | | | Mehrdimensionale Packungsprobleme - Approximation geometrischer Verallgemeinerungen klassischer Packungsprobleme | Book | |
| | 2007 | | | Hebbinghaus, Nils | | | | Discrepancy of Sums of two Arithmetic Progressions | Report | |
| | 2007 | | | Hemmer, Michael | | | | Algebraic Foundations, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual | |
| | 2007 | | | Hemmer, Michael
[Hert, Susan]
[Kettner, Lutz]
[Pion, Sylvain]
[Schirra, Stefan] | | | | Number Types, CGAL - Computational Geometry Algorithms Library, release 3.3 | Manual | |
| | 2007 | | | Hemmer, Michael
[Hülse, Dominik] | | | | Traits classes for polynomial gcd computation over algebraic extensions | Report | |
| | 2007 | | | Hemmer, Michael
[Limbach, Sebastian] | | | | Benchmarks on a generic univariate algebraic kernel | Report | |
| | 2007 | | | [Hert, Susan]
[Hoffmann, Michael]
Kettner, Lutz
[Pion, Sylvain]
[Seel, Michael] | | | | An adaptable and extensible geometry kernel
In: Computational Geometry: Theory and Applications [38], 16-36 | Journal Article | |
| | 2007 | | | Kavitha, Telikepalli
Mehlhorn, Kurt | | | | Algorithms to compute minimum cycle basis in directed graphs
In: Theory of Computing Systems [40], 485-505 | Journal Article | |
| | 2007 | | | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna E.] | | | | Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
In: ACM Transactions on Algorithms [3], 15.1-15.18 | Journal Article | |
| | 2007 | | | [Kavitha, Telikepalli]
Mehlhorn, Kurt
Michail, Dimitrios | [Thomas, Wolfgang]
[Weil, Pascal] | | | New Approximation Algorithms for Minimum Cycle Bases of Graphs
In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, 512-523 | Proceedings Article | |
| | 2007 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | | | A global parallel algorithm for the hypergraph transversal problem
In: Information Processing Letters [101], 148-155 | Journal Article | |
| | 2007 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir] | | | | On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
In: Theoretical Computer Science [382], 139-150 | Journal Article | |
| | 2007 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | | | Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
In: Theoretical Computer Science [379], 361-376 | Journal Article | |
| | 2007 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | | | Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
In: Discrete Applied Mathematics [155], 137-149 | Journal Article | |
| | 2007 | | | [Khuller, Samir]
[Malekian, Azarakhsh]
Mestre, Julián | [Arge, Lars]
[Hoffmann, Michael]
[Welzl, Emo] | | | To Fill or Not to Fill: The Gas Station Problem
In: 15th Annual European Symposium on Algorithms, 534-545 | Proceedings Article | |
| | 2007 | | | [Klein, Rolf]
Kutz, Martin | [Kaufmann, Michael]
[Wagner, Dorothea] | | | Computing Geometric Minimum-Dilation Graphs Is NP-Hard
In: Graph Drawing : 14th International Symposium, GD 2006, 196-207 | Proceedings Article | |
| | 2007 | | | Kowalik, Lukasz | | | | Adjacency Queries in Dynamic Sparse Graphs
In: Inf. Proc. Lett. [-], - | Journal Article | |
| | 2007 | | | Kutz, Martin
Schweitzer, Pascal | Applegate, David
Brodal, Gerth | | | ScrewBox: a Randomized Certifying Graph Non-Isomorphism Algorithm
In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07), 150-157 | Proceedings Article | |
| | 2007 | | | [Lehnert, Jörg]
Schweitzer, Pascal | | | | The Co-Word Problem for the Higman-Thompson Group is context-free
In: Bulletin of the London Mathematical Society [39], 235-241 | Journal Article | |
| | 2007 | | | Mehlhorn, Kurt | [Dress, Andreas]
[Xu, Yinfeng]
[Zhu, Binhai] | | | Matchings in Graphs Variations of the Problem
In: Combinatorial Optimization and Applications : First International Conference, COCOA 2007, 1-2 | Proceedings Article | |
| | 2007 | | | Mehlhorn, Kurt | Kucera, Ludek
Kucera, Antonín | | | Minimum Cycle Bases in Graphs Algorithms and Applications
In: Mathematical Foundations of Computer Science 2007 : 32nd International Symposium, MFCS 2007, 13-14 | Proceedings Article | |
| | 2007 | | | Michail, Dimitrios | | | | Reducing rank-maximal to maximum weight matching
In: Theoretical Computer Science [389], 125-132 | Journal Article | |
| | 2007 | | | [Miklos, Balint]
Giesen, Joachim
[Pauly, Mark] | | | | Medial Axis Approximation from Inner Voronoi Balls: A Demo of the Mesecina Tool
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 123-124 | Proceedings Article | |
| | 2007 | | | [Mourrain, Bernard]
[Pion, Sylvain]
Schmitt, Susanne
[Técourt, Jean-Pierre]
[Tsigaridas, Elias]
Wolpert, Nicola | [Boissonnat, Jean-Daniel]
[Teillaud, Monique] | | | Algebraic Issues in Computational Geometry
In: Effective Computational Geometry for Curves and Surfaces, 117-155 | Part of a Book | |
| | 2007 | | | Mustafa, Nabil H.
[Ray, Saurabh] | | | | An Optimal Generalization of the Centerpoint Theorem, and its Extensions
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 138-141 | Proceedings Article | |
| | 2007 | | | Neumann, Frank
[Sudholt, Dirk]
[Witt, Carsten] | [Stützle, Thomas]
[Birattari, Mauro]
[Hoss, Holger H.] | | | Comparing Variants of MMAS ACO Algorithms on Pseudo-Boolean Functions
In: Engineering Stochastic Local Search Algorithms 2007, 61-75 | Proceedings Article | |
| | 2007 | | | Neumann, Frank
[Wegener, Ingo] | | | | Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
In: Theoretical Computer Science [378], 32-40 | Journal Article | |
| | 2007 | | | Pyrga, Evangelia
[Schulz, Frank]
[Wagner, Dorothea]
[Zaroliagis, Christos] | | | | Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39 | Journal Article | |
| | 2007 | | | [Ray, Saurabh]
Mustafa, Nabil H. | | | | Weak $\epsilon$-nets have a basis of size $O(1/\epsilon\log 1/\epsilon)$ in any dimension
In: Proceedings of the Twenty-Third Annual Symposium on Computational Geometry (SCG'07), 239-244 | Proceedings Article | |
| | 2007 | | | | [Thierens, Dirk]
[Beyer, Hans-Georg]
[Bongard, Joshua]
[Branke, Juergen]
[Clark, John]
[Cliff, Dave]
[Congdon, Clare]
[Deb, Kalyanmoy]
Doerr, Benjamin
[Kovacs, Tim]
[Kumar, Sanjeev]
[Miller, Julian]
[Moore, Jason]
Neumann, Frank
[Pelikan, Martin]
[Poli, Ricardo]
[Sastry, Kumara]
[Stanley, Ken]
[Stützle, Thomas]
[Watson, Richard]
[Wegener, Ingo] | | | GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation | Proceedings | |
| | 2007 | | | Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter] | | | | Towards Peer-to-Peer Web Search
In: 1st European Conference on Complex Systems, ECCS'05, ? | Proceedings Article | |
| | 2007 | | | [Xu, Chihao]
Karrenbauer, Andreas
[Soh, Kian Min]
[Wahl, Jürgen] | [Morreale, Jay] | | | A New Addressing Scheme for PM OLED Display
In: SID 2007 International Symposium Digest of Technical Papers, 97-100 | Proceedings Article | |
| | 2006 | | | Ajwani, Deepak
[Dementiev, Roman]
Meyer, Ulrich | | | | A computational study of external memory BFS algorithms
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 601-610 | Proceedings Article | |
| | 2006 | | | Ajwani, Deepak
Friedrich, Tobias
Meyer, Ulrich | [Arge, Lars]
[Freivalds, Rusins] | | | An $O(n^2.75)$ algorithm for online topological ordering
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 53-64 | Proceedings Article | |
| | 2006 | | | Althaus, Ernst
[Calinescu, Gruia]
[Mandoiu, Ion]
[Prasad, Sushil]
[Tchervenski, Nickolay]
[Zelikovsly, Alexander] | | | | Power efficient range assignment for symmetric connectivity in static ad-hoc wireless networks
In: Wireless Networks [12], 287-299 | Journal Article | |
| | 2006 | | | Althaus, Ernst
[Caprara, Alberto]
[Lenhof, Hans-Peter]
[Reinert, Knut] | | | | Aligning multiple sequences by cutting planes
In: Mathematical Programming [2006], 387-425 | Journal Article | |
| | 2006 | | | Althaus, Ernst
Naujoks, Rouven | | | | Computing Steiner Minimal Trees in Hamming Metric
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 172-181 | Proceedings Article | |
| | 2006 | | | [Aronov, Boris]
[Asano, Tetsuo]
[Katoh, Naoki]
Mehlhorn, Kurt
[Tokuyama, Takeshi] | | | | Polyline Fitting of Planar Points under Min-sum Criteria
In: International Journal of Computational Geometry and Applications [16], 97-116 | Journal Article | |
| | 2006 | | | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | | | | On the Importance of Idempotence
In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'06, 564-573 | Proceedings Article | |
| | 2006 | | | [Arya, Sunil]
Malamatos, Theocharis
[Mount, David M.] | [Amenta, Nina]
[Cheong, Otfried] | | | The Effect of Corners on the Complexity of Approximate Range Searching
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 11-20 | Proceedings Article | |
| | 2006 | | | [Bárány, Imre]
Doerr, Benjamin | | | | Balanced partitions of vector sequences
In: Linear Algebra and Its Applications [414], 464-469 | Journal Article | |
| | 2006 | | | [Bartal, Yair]
[Leonardi, Stefano]
[Shallom, Gill]
Sitters, Rene | [Diaz, Josep]
[Jansen, Klaus]
[Rolim, José D. P.]
[Zwick, Uri] | | | On the value of preemption in scheduling
In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 39-48 | Proceedings Article | |
| | 2006 | | | Bast, Holger
[Dupret, Georges]
Majumdar, Debapriyo
[Piwowarski, Benjamin] | [Ackermann, Markus]
[Berendt, Bettina]
[Grobelnik, Marko]
[Hotho, Andreas]
[Mladenic, Dunja]
[Semeraro, Giovanni]
[Spiliopoulou, Myra]
[Stumme, Gerd]
[Svatek, Vojtech]
[van Someren, Maarten W.] | | | Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, 103-120 | Proceedings Article | |
| | 2006 | | | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | | | | IO-Top-k: Index-Access Optimized Top-k Query Processing | Report | |
| | 2006 | | | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | [Dayal, Umeshwar]
[Whang, Kyu-Young]
[Lomet, David B.]
[Alonso, Gustavo]
[Lohman, Guy M.]
[Kersten, Martin L.]
[Cha, Sang Kyun]
[Kim, Young-Kuk] | | | IO-Top-k: Index-Access Optimized Top-k Query Processing
In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, 475-486 | Proceedings Article | |
| | 2006 | | | Bast, Holger
Mehlhorn, Kurt
Schäfer, Guido
[Tamaki, Hisao] | | | | Matching Algorithms are Fast in Sparse Random Graphs
In: Theory of Computing Systems [39], 3-14 | Journal Article | |
| | 2006 | | | Bast, Holger
[Mortensen, Christian Worm]
Weber, Ingmar | [Crestani, Fabio]
[Ferragina, Paolo]
[Sanderson, Mark] | | | Output-Sensitive Autocompletion Search
In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, 150-162 | Proceedings Article | |
| | 2006 | | | Bast, Holger
Weber, Ingmar | [Broder, Andrei]
[Maarek, Yoelle] | | | When You're Lost For Words: Faceted Search With Autocompletion
In: SIGIR'06 Workshop on Faceted Search, 31-35 | Proceedings Article | |
| | 2006 | | | Bast, Holger
Weber, Ingmar | [Efthimiadis, Efthimis N.]
[Dumais, Susan]
[Hawking, David]
[Järvellin, Kalervo] | | | Type Less, Find More: Fast Autocompletion Search with a Succinct Index
In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 364-371 | Proceedings Article | |
| | 2006 | | | Beier, René
[Czumaj, Artur]
[Krysta, Piotr]
[Vöcking, Berthold] | | | | Computing Equilibria for a Service Provider Game with (Im)perfect Information
In: ACM Transactions on Algorithms [2], 679-706 | Journal Article | |
| | 2006 | | | Beier, René
[Vöcking, Berthold] | | | | An Experimental Study of Random Knapsack Problems
In: Algorithmica [45], 121-136 | Journal Article | |
| | 2006 | | | Beier, René
[Vöcking, Berthold] | | | | Typical Properties of Winners and Losers in Discrete Optimization
In: SIAM Journal on Computing [35], 855-881 | Journal Article | |
| | 2006 | | | Berberich, Eric
Ebert, Franziska
[Fogel, Efi]
Kettner, Lutz | | | | Web-site with benchmark instances for planar curve arrangements | Report | |
| | 2006 | | | Berberich, Eric
Ebert, Franziska
Kettner, Lutz | | | | Definition of file format for benchmark instances for arrangements of Quadrics | Report | |
| | 2006 | | | Berberich, Eric
Hemmer, Michael
[Karavelas, Menelaos]
[Pion, Sylvain]
[Teillaud, Monique]
[Tsigaridas, Elias] | Kettner, Lutz | | | Interface specification of algebraic kernel | Report | |
| | 2006 | | | Berberich, Eric
Hemmer, Michael | Kettner, Lutz | | | Prototype implementation of the algebraic kernel | Report | |
| | 2006 | | | [Bodlaender, Hans L.]
[Feremans, Corinne]
[Grigoriev, Alexander]
[Penninkx, Eelko]
Sitters, Rene
[Wolle, Thomas] | [Erlebach, Thomas]
[Kaklamanis, Christos] | | | On the minimum corridor connection and other generalized geometric problems
In: 4th Workshop on Approximation and Online Algorithms, WAOA, 69-82 | Proceedings Article | |
| | 2006 | | | [Brodal, Gerth Stølting]
Kaligosi, Kanela
[Katriel, Irit]
Kutz, Martin | [Moshe, Lewenstein]
[Gabriel, Valiente] | | | Faster Algorithms for Computing Longest Common Increasing Subsequences
In: Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, 330-341 | Proceedings Article | |
| | 2006 | | | [Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack] | | | | Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
In: SIAM Journal on Computing [36], 721-739 | Journal Article | |
| | 2006 | | | [Brown, Christopher]
El Kahoui, M'hammed
[Novotni, Dominik]
[Weber, Andreas] | | | | Algorithmic methods for investigating equilibria in epidemic modeling
In: Journal of Symbolic Computation [41], 1157-1173 | Journal Article | |
| | 2006 | | | [Bundy, David]
Hebbinghaus, Nils
[Stellmacher, Bernd] | | | | The Local C(G,T) Theorem
In: Journal of Algebra [300], 741-789 | Journal Article | |
| | 2006 | | | Canzar, Stefan
[Remy, Jan] | | | | Shape Distributions and Protein Similarity
In: GCB, 1-10 | Proceedings Article | |
| | 2006 | | | Caroli, Manuel | | | | Exakte Arrangement-Berechnung gedrehter Quadratischer Kurven
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 2006 | | | Chang, Kevin L.
[Kannan, Ravi] | | | | The Space Complexity of Pass-Efficient Algorithms for Clustering
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 1157-1166 | Proceedings Article | |
| | 2006 | | | [Chrobak, Marek]
[Dürr, Christoph]
[Jawor, Wojciech]
Kowalik, Lukasz
[Kurowski, Maciej] | | | | A Note on Scheduling Equal-Length Jobs to Maximize Throughput
In: Journal of Scheduling [9], 71-73 | Journal Article | |
| | 2006 | | | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor] | | | | Deterministic Random Walks on the Integers
In: ??? [?], 1-27 | Miscellaneous | |
| | 2006 | | | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gábor] | [Raman, Rajeev]
[Sedgewick, Robert]
[Stallmann, Matthias F.] | | | Deterministic Random Walks
In: Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments and the Third Workshop on Analytic Algorithmics and Combinatorics (ALENEX'06 / ANALCO'06), 185-197 | Proceedings Article | |
| | 2006 | | | Csaba, Bela
[Lodha, S.] | | | | A randomized on-line algorithm for the k-server problem on the line
In: Random Structures and Algorithms [29], 82-104 | Journal Article | |
| | 2006 | | | [Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej] | | | | Complexity of searching for a black hole | Unpublished/Draft | |
| | 2006 | | | [Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej] | | | | Deterministic rendezvous in graphs | Unpublished/Draft | |
| | 2006 | | | [Dessmark, Anders]
[Fraigniaud, Pierre]
Kowalski, Dariusz
[Pelc, Andrzej] | | | | Deterministic Rendezvous in Graphs
In: Algorithmica [46], 69-96 | Journal Article | |
| | 2006 | | | Doerr, Benjamin | | | | Matrix Rounding With Respect to Small Submatrices
In: Random Structures & Algorithms [28], 107-112 | Journal Article | |
| | 2006 | | | Doerr, Benjamin | | | | Non-independent randomized rounding and coloring
In: Discrete Applied Mathematics [154], 650-659 | Journal Article | |
| | 2006 | | | Doerr, Benjamin | | | | Non-independent Randomized Rounding, Linear Discrepancy and an Application to Digital Halftoning
In: Eurocomb '03 [3], 95-99 | Journal Article | |
| | 2006 | | | Doerr, Benjamin | [Durand, Bruno]
[Thomas, Wolfgang] | | | Generating Randomized Roundings with Cardinality Constraints and Derandomizations
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 571-583 | Proceedings Article | |
| | 2006 | | | Doerr, Benjamin
Fouz, Mahmoud | | | | Hereditary Discrepancies in Different Numbers of Colors II
In: ??? [?], 1-19 | Miscellaneous | |
| | 2006 | | | Doerr, Benjamin
Friedrich, Tobias | | | | Quasirandomness in Graphs
In: Electronic Notes in Discrete Mathematics [25], 61-64 | Journal Article | |
| | 2006 | | | Doerr, Benjamin
Friedrich, Tobias | [Asano, Tetsuo] | | | Deterministic Random Walks on the Two-Dimensional Grid
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 474-483 | Proceedings Article | |
| | 2006 | | | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | [Arge, Lars]
[Freivalds, Rusins] | | | Unbiased Matrix Rounding
In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, 102-112 | Proceedings Article | |
| | 2006 | | | Doerr, Benjamin
[Gnewuch, Michael] | | | | Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding | Report | |
| | 2006 | | | Doerr, Benjamin
Hebbinghaus, Nils
Neumann, Frank | [Runarsson, Thomas Ph.]
[Beyer, Hans G.]
[Burke, Edmund]
[Merelo-Guervós, Juan J.]
[Whitley, L. Darrell]
[Yao, Xin] | | | Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators
In: Parallel Problem Solving from Nature - PPSN IX, 9th International Conference, 978-987 | Proceedings Article | |
| | 2006 | | | Doerr, Benjamin
Hebbinghaus, Nils
[Werth, Sören] | | | | Improved Bounds and Schemes for the Declustering Problem
In: Theoretical Computer Science [359], 123-132 | Journal Article | |
| | 2006 | | | Doerr, Benjamin
Klein, Christian | [Arun-Kumar, S.]
Garg, Naveen | | | Unbiased Rounding of Rational Matrices
In: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science: 26th International Conference, 200-211 | Proceedings Article | |
| | 2006 | | | Doerr, Benjamin
[Lengler, Johannes]
[Steurer, Daniel] | [Asano, Tetsuo] | | | The Interval Liar Game
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 318-327 | Proceedings Article | |
| | 2006 | | | Doerr, Benjamin
[Lorenz, Ulf] | | | | Error Propagation in Game Trees
In: Mathematical Methods of Operations Research [64], 79-93 | Journal Article | |
| | 2006 | | | Eigenwillig, Arno
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | | | | Exact, Efficient and Complete Arrangement Computation for Cubic Curves
In: Computational Geometry [35], 36-73 | Journal Article | |
| | 2006 | | | [Eisenbrand, Friedrich]
Karrenbauer, Andreas
[Skutella, Martin]
[Xu, Chihao] | [Azar, Yossi]
[Erlebach, Thomas] | | | Multiline Addressing by Network Flow
In: Algorithms - ESA 2006 : 14th Annual European Symposium, 744-755 | Proceedings Article | |
| | 2006 | | | Elbassioni, Khaled M. | | | | Multiconsistency and Robustness with Global Constraints
In: Constraints [11], 335-352 | Journal Article | |
| | 2006 | | | Elbassioni, Khaled M. | | | | On the Complexity of Monotone Boolean Duality Testing | Report | |
| | 2006 | | | Elbassioni, Khaled M. | [Azar, Yossi]
[Erlebach, Thomas] | | | On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization
In: Algorithms - ESA 2006, 14th Annual European Symposium, 340-351 | Proceedings Article | |
| | 2006 | | | Elbassioni, Khaled M. | [Correa, José R.]
[Hevia, Alejandro]
[Kiwi, Marcos A.] | | | Finding All Minimal Infrequent Multi-dimensional Intervals
In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, 423-434 | Proceedings Article | |
| | 2006 | | | Elbassioni, Khaled M.
[Fishkin, Aleksei V.]
Sitters, Rene | [Asano, Tetsuo] | | | On Approximating the TSP with Intersecting Neighborhoods
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 213-222 | Proceedings Article | |
| | 2006 | | | Elbassioni, Khaled M.
[Lotker, Zvi]
[Seidel, Raimund] | | | | Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
In: Information Processing Letters [100], 69 - 71 | Journal Article | |
| | 2006 | | | Elbassioni, Khaled M.
Mustafa, Nabil H. | [Durand, Bruno]
[Thomas, Wolfgang] | | | Conflict-Free Colorings of Rectangle Ranges
In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, 254-263 | Proceedings Article | |
| | 2006 | | | [Epstein, Leah]
Kesselman, Alexander | | | | On the remote server problem or more about TCP acknowledgments
In: Theoretical Computer Science [369], 285 | Journal Article | |
| | 2006 | | | [Feremans, Corinne]
[Grigoriev, Alexander]
Sitters, Rene | | | | The geometric generalized minimum spanning tree problem with grid clustering
In: 4OR: A Quarterly Journal of Operations Research [4], 319-329 | Journal Article | |
| | 2006 | | | Fouz, Mahmoud | | | | Hereditary Discrepancy in Different Numbers of Colors
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 2006 | | | Funke, Stefan
[Guibas, Leonidas]
[Nguyen, An]
[Wang, Yusu] | [Gibbons, Phillip B.]
[Abdelzaher, Tarek F.]
[Aspnes, James]
[Rao, Ramesh] | | | Distance-Sensitive Information Brokerage in Sensor Networks
In: Distributed Computing in Sensor Systems, Second IEEE International Conference, DCOSS 2006, 234-251 | Proceedings Article | |
| | 2006 | | | [Funke, Stefan]
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: ACM Transactions on Sensor Networks [2], 444-453 | Journal Article | |
| | 2006 | | | Funke, Stefan
Klein, Christian | [Amenta, Nina]
[Cheong, Otfried] | | | Hole Detection or: "How Much Geometry Hides in Connectivity?"
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 377-385 | Proceedings Article | |
| | 2006 | | | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | | | Controlled Perturbation for Delaunay Triangulations | Report | |
| | 2006 | | | Funke, Stefan
Laue, Sören
Naujoks, Rouven
[Lotker, Zvi] | | | | Power Assignment Problems in Wireless Communication
In: ??? [?], 1-14 | Miscellaneous | |
| | 2006 | | | Funke, Stefan
[Malamatos, Theocharis]
[Matijevic, Domagoj]
Wolpert, Nicola | [Rappaport, David] | | | (Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
In: 18th Canadian Conference on Computational Geometry, 23-26 | Proceedings Article | |
| | 2006 | | | [Golumbic, Martin Charles]
[Mintz, Aviad]
[Rotics, Udi] | | | | Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees
In: Discrete Applied Mathematics [154], 1465-1477 | Journal Article | |
| | 2006 | | | [Grigoriev, Alexander]
[van Loon, Joyce]
Sitters, Rene
[Uetz, Marc] | [Fomin, Fedor V.] | | | How to Sell a Graph: Guidelines for Graph Retailers
In: Graph-Theoretic Concepts in Computer Science : 32nd International Workshop, WG 2006, 125-136 | Proceedings Article | |
| | 2006 | | | [Hariharan, Ramesh]
[Telikepalli, Kavitha]
Mehlhorn, Kurt | [Bugliesi, Michele]
[Preneel, Bart]
[Sassone, Vladimir]
[Wegener, Ingo] | | | A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 250-261 | Proceedings Article | |
| | 2006 | | | Harren, Rolf | | | | Approximation mehrdimensionaler Packungsprobleme
Universität Dortmund | Thesis - other | |
| | 2006 | | | Harren, Rolf | [Bugliesi, M.]
[Preneel, B.]
[Sassone, V.]
[Wegener, I.] | | | Approximating the Orthogonal Knapsack Problem for Hypercubes
In: Automata, Languages and Programming, 238-249 | Proceedings Article | |
| | 2006 | | | [Irving, Robert W.]
[Telikepalli, Kavitha]
Mehlhorn, Kurt
Michail, Dimitrios
[Paluch, Katarzyna] | | | | Rank-Maximal Matchings
In: ACM Transactions on Algorithms [2], 602-610 | Journal Article | |
| | 2006 | | | Kaligosi, Kanela
[Sanders, Peter] | [Azar, Yossi]
[Erlebach, Thomas] | | | How Branch Mispredictions Affect Quicksort
In: Algorithms - ESA 2006, 14th Annual European Symposium, 780-791 | Proceedings Article | |
| | 2006 | | | Kettner, Lutz
Mehlhorn, Kurt
[Pion, Sylvain]
[Schirra, Stefan]
[Yap, Chee] | [Gavrilova, Marina]
[Gervasi, Osvaldo]
[Kumar, Vipin]
[Tan, C. J.Kenneth]
[Taniar, David]
[Laganà, Antonio]
[Mun, Youngsong]
[Choo, Hyunseung] | | | Reply to "Backward Error Analysis ..."
In: Computational Science and Its Applications - ICCSA 2006, I, 60-60 | Proceedings Article | |
| | 2006 | | | Kettner, Lutz | [Musser, David]
[Siek, Jeremy] | | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Proceedings of the First International Workshop on Library-Centric Software Design, LCSD'05, 34-43 | Proceedings Article | |
| | 2006 | | | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | | | | Generating All Vertices of a Polyhedron is Hard
In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, 758-765 | Proceedings Article | |
| | 2006 | | | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | [Azar, Yossi]
[Erlebach, Thomas] | | | Enumerating Spanning and Connected Subsets in Graphs and Matroids
In: Algorithms - ESA 2006, 14th Annual European Symposium, 444-455 | Proceedings Article | |
| | 2006 | | | [Klein, Rolf]
Kutz, Martin | | | | The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 264-272 | Proceedings Article | |
| | 2006 | | | Kovács, Annamária | [Calamoneri, Tiziana]
[Finocchi, Irene]
[Italiano, Giuseppe F.] | | | Tighter Approximation Bounds for LPT Scheduling in Two Special Cases
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 187-198 | Proceedings Article | |
| | 2006 | | | Kowalik, Lukasz | [Asano, Tetsuo] | | | Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 557-566 | Proceedings Article | |
| | 2006 | | | Kowalik, Lukasz | [Fomin, Fedor V.] | | | Improved Edge Coloring with Three Colors
In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, 90-101 | Proceedings Article | |
| | 2006 | | | [Krandick, Werner]
Mehlhorn, Kurt | | | | New bounds for the Descartes method
In: Journal of Symbolic Computation [41], 49-66 | Journal Article | |
| | 2006 | | | [Kratsch, Dieter]
[McConnell, Ross]
Mehlhorn, Kurt
[Spinrad, Jeremy P.] | | | | Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
In: Siam Journal on Computing, 326-353
In: SIAM Journal on Computing [36], 326-353 | Journal Article | |
| | 2006 | | | Kutz, Martin | [Amenta, Nina]
[Cheong, Otfried] | | | Computing Shortest Non-Trivial Cycles on Orientable Surfaces of Bounded Genus in Almost Linear Time.
In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, 430-437 | Proceedings Article | |
| | 2006 | | | [Lotker, Zvi]
Majumdar, Debapriyo
[Narayanaswamy, N.S.]
Weber, Ingmar | [Chen, Danny Z.]
[Lee, D. T.] | | | Sequences Characterizing k-Trees
In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, 216-225 | Proceedings Article | |
| | 2006 | | | Maue, Jens
[Sanders, Peter]
Matijevic, Domagoj | [Alvarez, Carme]
[Serna, Maria J.] | | | Goal Directed Shortest Path Queries Using Precomputed Cluster Distances
In: Experimental Algorithms, 5th International Workshop, WEA 2006, 316-327 | Proceedings Article | |
| | 2006 | | | Mehlhorn, Kurt | [Calamoneri, Tiziana]
[Finocchi, Irene]
[Italiano, Giuseppe F.] | | | Reliable and Efficient Geometric Computing
In: Algorithms and Complexity : 6th Italian Conference, CIAC 2006, 1-2 | Proceedings Article | |
| | 2006 | | | Mehlhorn, Kurt
Osbild, Ralf
Sagraloff, Michael | [Bugliesi, Michele]
[Preneel, Bart]
[Sassone, Vladimir]
[Wegener, Ingo] | | | Reliable and Efficient Computational Geometry Via Controlled Perturbation
In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, 299-310 | Proceedings Article | |
| | 2006 | | | Meyer, Ulrich
[Zeh, Norbert] | [Azar, Yossi]
[Erlebach, Thomas] | | | I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
In: Algorithms - ESA 2006, 14th Annual European Symposium, 540-551 | Proceedings Article | |
| | 2006 | | | Meyer, Ulrike
[Wetzel, Susanne] | | | | Introducing History-Enriched Security Context Transfer to Enhance the Security of Subsequent Handover
In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 277-282 | Proceedings Article | |
| | 2006 | | | Neumann, Frank
[Witt, Carsten] | | | | Ant Colony Optimization and the Minimum Spanning Tree Problem | Report | |
| | 2006 | | | Paluch, Katarzyna | [Asano, Tetsuo] | | | A New Approximation Algorithm for Multidimensional Rectangle Tiling
In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, 712-721 | Proceedings Article | |
| | 2006 | | | Schmitt, Daniel | | | | Implementierung einer Überlagerungvon konvexen Arrangements der Kugeloberfläche
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 2006 | | | [Schömer, Elmar]
Wolpert, Nicola | | | | An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics
In: Computational Geometry [33], 65 - 97 | Journal Article | |
| | 2006 | | | Sitters, Rene
[Stougie, Leen] | | | | The general two-server problem
In: Journal of the ACM [53], 437-458 | Journal Article | |
| | 2006 | | | Steurer, David | | | | Tight Bounds on the Min-Max Boundary Decomposition Cost of Weighted Graphs
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 2006 | | | [Teramoto, Sachio]
[Asano, Tetsuo]
[Katoh, Naoki]
Doerr, Benjamin | | | | Inserting Points Uniformly at Every Instance
In: IEICE - Transactions on Information and Systems [E89-D], 2348-2356 | Journal Article | |
| | 2005 | | | Abraham, David
[Irving, Robert W.]
Mehlhorn, Kurt
Telikepalli, Kavitha | | | | Popular Matchings
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 424-432 | Proceedings Article | |
| | 2005 | | | [Abraham, David J.]
[Cechlárová, Katarína]
[Manlove, David]
Mehlhorn, Kurt | [Deng, Xiaotie]
Du, Dingzhu | | | Pareto Optimality in House Allocation Problems
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 1163-1175 | Proceedings Article | |
| | 2005 | | | [Ahuja, Nitin]
[Baltz, Andreas]
Doerr, Benjamin
[Privetivy, Ales]
[Srivastav, Anand] | [Erlebach, Thomas]
[Persiano, Pino] | | | On the Minimum Load Coloring Problem
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 15-26 | Proceedings Article | |
| | 2005 | | | Althaus, Ernst
Funke, Stefan
[Har-Peled, Sariel]
[Könemann, Jochen]
[Ramos, Edgar A.]
Skutella, Martin | | | | Approximating k-Hop Minimum-Spanning Trees
In: Operations Research Letters [33], 115-120 | Journal Article | |
| | 2005 | | | [Arya, Sunil]
Malamatos, Theocharis
Mount, David M. | | | | Space-Time Tradeoffs for Approximate Spherical Range Counting
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 535-544 | Proceedings Article | |
| | 2005 | | | Bast, Holger | | | | Präzisionssuche im homöopathischen Netz
In: Homöopathie-Zeitschrift [I/05], 119-122 | Journal Article | |
| | 2005 | | | Bast, Holger
Majumdar, Debapriyo | [Marchionini, Gary]
[Moffat, Alistair]
[Tait, John]
[Baeza-Yates, Ricardo]
[Ziviani, Nivio] | | | Why Spectral Retrieval Works
In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), 11-18 | Proceedings Article | |
| | 2005 | | | Bast, Holger
Weber, Ingmar | [Adachi, Jun]
[Shan, Wang]
[Vakali, Athena] | | | Insights from Viewing Ranked Retrieval as Rank Aggregation
In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), 243-248 | Proceedings Article | |
| | 2005 | | | Bast, Holger
Weber, Ingmar | Nikoletseas, Sotiris | | | Don't Compare Averages
In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), 67-76 | Proceedings Article | |
| | 2005 | | | Baswana, Surender
[Goyal, Vishrut]
[Sen, Sandeep] | [Diekert, Volker]
[Durand, Bruno] | | | All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 666-679 | Proceedings Article | |
| | 2005 | | | Baswana, Surender
Telikepalli, Kavitha
Mehlhorn, Kurt
Pettie, Seth | | | | New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 672-681 | Proceedings Article | |
| | 2005 | | | [Beldiceanu, Nicolas]
Katriel, Irit
Thiel, Sven | [Faltings, Boi]
[Petcu, Adrian]
[Fages, Francois]
[Rossi, Francesca] | | | GCC-like Restrictions on the Same constraint
In: Constraint Satisfaction and Constraint Logic Programming : ERCIM/CoLogNet International Workshop, CSCLP 2004, 1-11
In: Recent Advances in Constraints [3419], 1-11 | Proceedings Article | |
| | 2005 | | | Berberich, Eric
Eigenwillig, Arno
[Hemmer, Michael]
[Hert, Susan]
Kettner, Lutz
Mehlhorn, Kurt
Reichel, Joachim
Schmitt, Susanne
[Schömer, Elmar]
Wolpert, Nicola | [Brodal, Gerth S.]
[Leonardi, Stefano] | | | EXACUS: Efficient and exact algorithms for curves and surfaces
In: 13th Annual European Symposium on Algorithms (ESA 2005), 155-166 | Proceedings Article | |
| | 2005 | | | Berberich, Eric
[Hemmer, Michael]
Kettner, Lutz
[Schömer, Elmar]
Wolpert, Nicola | [Mitchell, Joe]
[Rote, Günter]
Kettner, Lutz | | | An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves
In: 21st Annual Symposium on Computational Geometry (SCG'05), 99-106 | Proceedings Article | |
| | 2005 | | | [Brönnimann, Hervé]
Kettner, Lutz
[Pocchiola, Michel]
[Snoeyink, Jack] | [Demetrescu, Camil]
[Tamassia, Roberto]
[Sedgewick, Robert] | | | Counting and enumerating pointed pseudo-triangulations with the greedy flip algorithm
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 98-110 | Proceedings Article | |
| | 2005 | | | [Chlebus, Bogdan S.]
Kowalski, Dariusz | [Gabow, Harold N.]
[Fagin, Ronald] | | | Cooperative asynchronous update of shared memory
In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), 733-739 | Proceedings Article | |
| | 2005 | | | [Cooper, Joshua]
Doerr, Benjamin
[Spencer, Joel]
[Tardos, Gabor] | [Felsner, Stefan] | | | Deterministic Random Walks on the Integers
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 73-76
In: Discrete Mathematics & Theoretical Computer Science [AE], 73-76 | Proceedings Article | |
| | 2005 | | | [Czyzowicz, Jurek]
Kowalski, Dariusz
[Markou, Euripides]
[Pelc, Andrzej] | Higashino, Teruo | | | Searching for a black hole in tree networks
In: Principles of distributed systems : 8th International Conference, OPODIS 2004, 67-80 | Proceedings Article | |
| | 2005 | | | Dementiev, Roman
[Kärkkäinen, Juha]
Mehnert, Jens
Sanders, Peter | Demetrescu, Camil
Sedgewick, Robert
Tamassia, Roberto | | | Better External Memory Suffix Array Construction
In: Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics
(ALENEX/ANALCO 2005), 86-97 | Proceedings Article | |
| | 2005 | | | [Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter] | | | | STXXL: Standard Template Library for XXL Data Sets | Report | |
| | 2005 | | | [Dementiev, Roman]
Kettner, Lutz
[Sanders, Peter] | [Brodal, Gerth Stølting]
[Leonardi, Stefano] | | | STXXL: Standard Template Library for XXL Data Sets
In: Algorithms - ESA 2005 : 13th Annual European Symposium (ESA 2005), 640-651 | Proceedings Article | |
| | 2005 | | | Doerr, Benjamin | | | | Matrix Rounding with Low Error in Small Submatrices
In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), 1067-1068 | Proceedings Article | |
| | 2005 | | | Doerr, Benjamin | [Diekert, Volker]
[Durand, Bruno] | | | Roundings Respecting Hard Constraints
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), 617-628 | Proceedings Article | |
| | 2005 | | | Doerr, Benjamin
Friedrich, Tobias
Klein, Christian
Osbild, Ralf | [Erlebach, Thomas]
[Persiano, Pino] | | | Rounding of Sequences and Matrices, with Applications
In: Third Workshop on Approximation and Online Algorithms (WAOA 2005), 96-109 | Proceedings Article | |
| | 2005 | | | Doerr, Benjamin
[Gnewuch, Michael]
[Srivastav, Anand] | | | | Bounds and Constructions for the Star-Discrepancy via Delta-Covers
In: Journal of Complexity [21], 691-709 | Journal Article | |
| | 2005 | | | Doerr, Benjamin
Hebbinghaus, Nils | [Felsner, Stefan] | | | Discrepancy of Products of Hypergraphs
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 323-328 | Proceedings Article | |
| | 2005 | | | Ebert, Franziska | | | | Benchmark Data Sets for Conic Arrangements
Universität des Saarlandes | Thesis - Bachelor thesis | |
| | 2005 | | | Eigenwillig, Arno
Kettner, Lutz
[Krandick, Werner]
Mehlhorn, Kurt
Schmitt, Susanne
Wolpert, Nicola | Ganzha, Viktor G.
Mayr, Ernst W.
Vorozhtsov, Evgenii V. | | | A Descartes algorithm for polynomials with bit-stream coefficients
In: Computer Algebra in Scientific Computing : 8th International Workshop, CASC 2005, 138-149 | Proceedings Article | |
| | 2005 | | | Eisenbrand, Friedrich
Funke, Stefan
Karrenbauer, Andreas
Matijevic, Domagoj | | | | Energy-Aware Stage Illumination
In: Proceedings of the 21st Annual Symposium on Computational Geometry : (SCG05), 336-346 | Proceedings Article | |
| | 2005 | | | Eisenbrand, Friedrich
[Funke, Stefan]
Karrenbauer, Andreas
Reichel, Joachim
[Schömer, Elmar] | [Spencer, Stephen N.] | | | Packing a Trunk - now with a Twist!
In: Proceedings SPM 2005 ACM Symposium on Solid and Physical Modeling, 197-206 | Proceedings Article | |
| | 2005 | | | El Kahoui, M'hammed | | | | Birational properties of the gap subresultant varieties
In: Journal of Symbolic Computation [39], 61-71 | Journal Article | |
| | 2005 | | | El Kahoui, M'hammed | | | | UFDs with commuting linearly independent locally nilpotent derivations
In: Journal of Algebra [289], 446-452 | Journal Article | |
| | 2005 | | | El Kahoui, M'hammed | | | | $D$-resultant and subresultants
In: Proceedings of the Amercian Mathematical Society [133], 2193-2199 | Journal Article | |
| | 2005 | | | Elbassioni, Khaled M.
[Elmasry, Amr]
[Kamel, Ibrahim] | | | | An Indexing Method for Answering Queries on Moving Objects
In: Distributed and Parallel Databases [17], 215-249 | Journal Article | |
| | 2005 | | | Elbassioni, Khaled M.
Fishkin, Aleksei V.
Mustafa, Nabil H.
Sitters, Rene | [Caires, Luis]
[Italiano, Giuseppe F.]
[Monteiro, Luís]
[Palamidessi, Catuscia]
[Yung, Moti] | | | Approximation algorithms for Euclidean Group TSP
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 1115-1126 | Proceedings Article | |
| | 2005 | | | Elbassioni, Khaled M.
Katriel, Irit | [Barták, Roman]
[Milano, Michela] | | | Multiconsistency and Robustness with Global Constraints
In: Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : Second International Conference, CPAIOR 2005, 168-182 | Proceedings Article | |
| | 2005 | | | Elbassioni, Khaled M.
[Katriel, Irit]
Kutz, Martin
[Mahajan, Meena] | [Deng, Xiaotie]
Du, Dingzhu | | | Simultaneous Matchings
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 106-115 | Proceedings Article | |
| | 2005 | | | Elbassioni, Khaled M.
Mustafa, Nabil H. | | | | Conflict-Free Colorings of Rectangle Ranges for Wireless Networks | Unpublished/Draft | |
| | 2005 | | | [Fotakis, Dimitris]
[Pagh, Rasmus]
Sanders, Peter
Spirakis, Paul G. | | | | Space Efficient Hash Tables With Worst Case Constant Access Time
In: Theory of Computing Systems [38], 229-248 | Journal Article | |
| | 2005 | | | Funke, Stefan | | | | Topological Hole Detection in Wireless Sensor Networks and its Applications
In: 3rd ACM/SIGMOBILE International Workshop on foundations of Mobile Computing (DIAL-M-POMC), 44-53 | Proceedings Article | |
| | 2005 | | | Funke, Stefan
Kesselman, Alexander
Meyer, Ulrich
[Segal, Michael] | | | | A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), 220-223 | Proceedings Article | |
| | 2005 | | | Funke, Stefan
Klein, Christian
Mehlhorn, Kurt
Schmitt, Susanne | | | | Controlled Perturbation for Delaunay Triangulations
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 1047-1056 | Proceedings Article | |
| | 2005 | | | Funke, Stefan
Mehlhorn, Kurt
Näher, Stefan | | | | Structural filtering: a paradigm for efficient and exact geometric programs
In: Computational Geometry [31], 179-194 | Journal Article | |
| | 2005 | | | Funke, Stefan
[Milosavljevic, Nikola] | Prasanna, Viktor K.
Iyengar, Sitharama
Spirakis, Paul
Welsh, Matt | | | Infrastructure-Establishment from Scratch in Wireless Sensor Networks
In: Distributed computing in sensor systems : First IEEE International Conference, DCOSS 2005, 354-367 | Proceedings Article | |
| | 2005 | | | [Georgiou, Chryssis]
Kowalski, Dariusz
[Shvartsman, Alexander] | | | | Efficient gossip and robust distributed computation
In: Theoretical Computer Science [347], 130-166 | Journal Article | |
| | 2005 | | | Hachenberger, Peter
Kettner, Lutz | [Kobbelt, Leif]
[Shapiro, Vadim] | | | Boolean Operations on 3D Selective Nef Complexes: Optimized Implementation and Experiments
In: ACM Symposium on Solid and Physical Modeling (SPM 2005), 163-174 | Proceedings Article | |
| | 2005 | | | [Hutchinson, David A.]
Sanders, Peter
[Vitter, Jeffrey Scott] | | | | Duality Between Prefetching and Queued Writing with Parallel Disks
In: SIAM Journal on Computing [34], 1443-1463 | Journal Article | |
| | 2005 | | | Kaligosi, Kanela
Mehlhorn, Kurt
[Munro, J. Ian]
[Sanders, Peter] | Caires, Luis
Italiano, Giuseppe F.
Monteiro, Luís
Palamidessi, Catuscia
Yung, Moti | | | Towards Optimal Multiple Selection
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 103-114 | Proceedings Article | |
| | 2005 | | | Katriel, Irit
[Bodlaender, Hans L.] | | | | Online Topological Ordering
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 443-450 | Proceedings Article | |
| | 2005 | | | Katriel, Irit
[Michel, Laurent]
[Van Hentenryck, Pascal] | | | | Maintaining Longest Paths Incrementally
In: Constraints [10], 159-183 | Journal Article | |
| | 2005 | | | Katriel, Irit
Thiel, Sven | | | | Complete Bound Consistency for the Global Cardinality Constraint
In: Constraints [10], 191-217 | Journal Article | |
| | 2005 | | | Kavitha, Telikepalli
Mehlhorn, Kurt | [Diekert, Volker]
[Durand, Bruno] | | | A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, 654-665 | Proceedings Article | |
| | 2005 | | | Kesselman, Alexander
[Kogan, Kirill] | | | | Non-Preemptive Scheduling of Optical Switches
In: 2004 IEEE Global Telecommunications Conference workshops (GLOBECOM'04), 1840-1844 | Proceedings Article | |
| | 2005 | | | Kesselman, Alexander
Kowalski, Dariusz | | | | Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
In: Second Annual Conference on Wireless On-demand Network Systems and Services (WONS'05), 119-124 | Proceedings Article | |
| | 2005 | | | Kesselman, Alexander
Kowalski, Dariusz
[Segal, Michael] | | | | Energy efficient communication in ad hoc networks from user's and designer's perspective
In: Proceedings of the n?th Conference on, 15-26
In: ACM SIGMOBILE Mobile Computing and Communications Review [9], 15-26 | Journal Article | |
| | 2005 | | | [Khachiyan, Leonid]
[Boros, Endre]
[Borys, Konrad]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | [Deng, Xiaotie]
[Du, Ding-Zhu] | | | Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 156-165 | Proceedings Article | |
| | 2005 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | [Jedrzejowicz, Joanna]
[Szepietowski, Andrzej] | | | Generating All Minimal Integral Solutions to Monotone $\wedge,\vee$-Systems of Linear, Transversal and Polymatroid Inequalities
In: Mathematical Foundations of Computer Science 2005 : 30th International Symposium, MFCS 2005, 556-567 | Proceedings Article | |
| | 2005 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir]
[Makino, Kazuhisa] | | | | On the Complexity of Some Enumeration Problems for Matroids
In: SIAM Journal on Discrete Mathematics [19], 966-984 | Journal Article | |
| | 2005 | | | [Khachiyan, Leonid]
[Boros, Endre]
Elbassioni, Khaled M.
[Gurvich, Vladimir] | [Wang, Lusheng] | | | A New Algorithm for the Hypergraph Transversal Problem
In: Computing and combinatorics : 11th Annual International Conference, COCOON 2005, 767-776 | Proceedings Article | |
| | 2005 | | | Kovács, Annamária | [Brodal, Gerth S.]
[Leonardi, Stefano] | | | Fast monotone 3-approximation algorithm for scheduling related machines
In: Algorithms - ESA 2005: 13th Annual European Symposium, 616-627 | Proceedings Article | |
| | 2005 | | | Kovács, Annamária | [Caires, Luis]
[Italiano, Giuseppe F.]
[Monteiro, Luís]
[Palamidessi, Catuscia]
[Yung, Moti] | | | Polynomial Time Preemptive Sum-Multicoloring on Paths
In: Automata, languages and programming : 32nd International Colloquim, ICALP 2005, 840-852 | Proceedings Article | |
| | 2005 | | | Kowalski, Dariusz
[Musial, Peter M.]
[Shvartsman, Alexander] | | | | Explicit combinatorial structures for cooperative distributed algorithms
In: 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 49-58 | Proceedings Article | |
| | 2005 | | | Kowalski, Dariusz
[Pelc, Andrzej] | | | | Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
In: Theoretical Computer Science [333], 355-371 | Journal Article | |
| | 2005 | | | Kutz, Martin | | | | Conway's Angel in three dimensions
In: Theoretical Computer Science [349], 443-451 | Journal Article | |
| | 2005 | | | Kutz, Martin | [Felsner, Stefan] | | | Weak Positional Games on Hypergraphs of Rank Three
In: 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 31-36 | Proceedings Article | |
| | 2005 | | | Kutz, Martin
[Pór, Attila] | [Wang, Lusheng] | | | Angel, Devil, and King
In: Computing and Combinatorics : 11th Annual International Conference, COCOON 2005, 925-934 | Proceedings Article | |
| | 2005 | | | | Lars, Arge
Bender, Michael A.
Demaine, Erik
Leiserson, Charles
Mehlhorn, Kurt | | | Cache-Oblivious and Cache-Aware Algorithms | Report | |
| | 2005 | | | Mehlhorn, Kurt
Eigenwillig, Arno
Kaligosi, Kanela
Kratsch, Dieter
McConnell, Ross
Meyer, Ulrich
Spinrad, Jeremy P. | | | | Certifying Algorithms (draft) | Unpublished/Draft | |
| | 2005 | | | Mehlhorn, Kurt | Healy, Patrick
Nikolo, Nikola S. | | | Minimum Cycle Bases and Surface Reconstruction
In: Graph Drawing: 13th International Symposium, GD 2005, ,, 532-532 | Proceedings Article | |
| | 2005 | | | Mehlhorn, Kurt
Michail, Dimitrios | | | | Network Problems with Non-Polynomial Weights and Applications | Unpublished/Draft | |
| | 2005 | | | Mehlhorn, Kurt
Michail, Dimitrios | [Nikoletseas, Sotiris] | | | Implementing Minimum Cycle Basis Algorithms
In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, 32-43 | Proceedings Article | |
| | 2005 | | | Mehlhorn, Kurt
Waldmann, Uwe
[Wilhelm, Reinhard] | | | | Harald Ganzinger : 31.10.1950 - 3.6.2004
In: MPG-Jahrbuch, 107-108
In: Jahrbuch / Max-Planck-Gesellschaft [?], 107-108 | Part of a Book | |
| | 2005 | | | | [Mitchell, Joe]
[Rote, Günter]
Kettner, Lutz | | | 21st Annual Symposium on Computational Geometry (SCG'05) | Proceedings | |
| | 2005 | | | [Mortensen, Christian Worm]
Pettie, Seth | Dehne, Frank
López-Ortiz, Alejandro
Sack, Jörg-Rüdiger | | | The complexity of implicit and space-efficient priority queues
In: Algorithms and data structures : 9th International Workshop, WADS 2005, 49-60 | Proceedings Article | |
| | 2005 | | | Pettie, Seth | | | | Towards a final analysis of pairing heaps
In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 174-183 | Proceedings Article | |
| | 2005 | | | Pettie, Seth | Deng, Xiaotie
Du, Dingzhu | | | Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
In: Algorithms and computation : 16th International Symposium, ISAAC 2005, 964-973 | Proceedings Article | |
| | 2005 | | | Pettie, Seth
Sanders, Peter | | | | Computing Approximate Matchings in External Memory, Streaming, Parallel, and Distributed Network Models | Unpublished/Draft | |
| | 2005 | | | Sanders, Peter
Steurer, David | | | | An Asymptotic Approximation Scheme for Multigraph Edge Coloring
In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), 897-906 | Proceedings Article | |
| | 2005 | | | Schmitt, Susanne | Ganzha, Viktor G.
[Mayr, Ernst W.]
[Vorozhtsov, Evgenii V.] | | | The diamond operator - Implementation of exact real algebraic numbers
In: Computer Algebra in Scientific Computing, 8th International Workshop, CASC 2005, 355-366 | Proceedings Article | |
| | 2005 | | | [Seidel, Raimund]
Wolpert, Nicola | Mitchell, Joseph S. B.
Rote, Günter | | | On the Exact Computation of the Topology of Real Algebraic Curves
In: Proceedings of the 21st ACM Symposium on Computational Geometry, 107-115 | Proceedings Article | |
| | 2005 | | | Sitters, Rene | | | | Complexity of preemptive minsum scheduling on unrelated parallel machines
In: Journal of Algorithms [57], 37-48 | Journal Article | |
| | 2005 | | | Weikum, Gerhard
Bast, Holger
[Canright, Geoffrey]
[Hales, David]
[Schindelhauer, Christian]
[Triantafillou, Peter] | [Schindelhauer, Christian] | | | Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, 7-24 | Proceedings Article | |
| | 2005 | | | [Xu, Chihao]
[Wahl, Jürgen]
[Eeisenbrand, Friedrich]
Karrenbauer, Andreas
[Soh, Kian Min]
[Hitzelberger, Christoph] | | | | Verfahren zur Ansteuerung von Matrixanzeigen | Miscellaneous | |
| 54 |
| Publikationen im Internet |
| |
| | 2011 | | | Berberich, Eric
Emeliyanenko, Pavel
Kobel, Alexander
Sagraloff, Michael | | | | Arrangement Computation for Planar Algebraic Curves
In: arXiv [abs/1103.4697], | Electronic Journal Article | |
| | 2011 | | | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | | | | Deconstructing Approximate Offsets
In: arXiv [abs/1109.2158], | Electronic Journal Article | |
| | 2011 | | | [Case, John]
Kötzing, Timo | [Schwentick, Thomas]
[Dürr, Christoph] | | | Measuring Learning Complexity with Criteria Epitomizers
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 320-331 | Electronic Proceedings Article | |
| | 2011 | | | [Chan, Sze-Hang]
[Lam, Tak-Wah]
Lee, Lap-Kei | [Schwentick, Thomas]
[Dürr, Christoph] | | | Scheduling for weighted flow time and energy with rejection penalty
In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), 392-403 | Electronic Proceedings Article | |
| | 2011 | | | Doerr, Benjamin
[Fouz, Mahmoud] | | | | Asymptotically optimal randomized rumor spreading
In: Electronic Notes in Discrete Mathematics [38], 297-302 | Electronic Journal Article | |
| | 2011 | | | Doerr, Benjamin
[Fouz, Mahmoud]
Friedrich, Tobias | [Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila] | | | Social Networks Spread Rumors in Sublogarithmic Time
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 303-308
In: Electronic Notes in Discrete Mathematics [38], 303-308 | Electronic Proceedings Article | |
| | 2011 | | | Elbassioni, Khaled
[Rauf, Imran]
Ray, Saurabh | [Collette, Sebastien] | | | Enumerating Minimal Transversals of Geometric Hypergraphs
In: 23rd Canadian Conference on Computational Geometry (CCCG 2011), 437-442 | Electronic Proceedings Article | |
| | 2011 | | | [Gugelmann, Luca]
Spöhel, Reto | [Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila] | | | On balanced coloring games in random graphs
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 425-430 | Electronic Proceedings Article | |
| | 2011 | | | [Mütze, Torsten]
Spöhel, Reto | | | | On the path-avoidance vertex-coloring game
In: The Electronic Journal of Combinatorics [18], 1-33 | Electronic Journal Article | |
| | 2011 | | | [Mütze, Torsten]
Spöhel, Reto | [Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila] | | | On the path-avoidance vertex-coloring game
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 657-662 | Electronic Proceedings Article | |
| | 2011 | | | Panagiotou, Konstantinos
Spöhel, Reto
[Steger, Angelika]
[Thomas, Henning] | [Nešetřil, Jarik]
[Győri, Ervin]
[Sali, Attila] | | | Explosive percolation in Erdős-Rényi-like random graph processes
In: The Sixth European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2011, 699-704 | Electronic Proceedings Article | |
| | 2011 | | | Sagraloff, Michael | | | | When Newton meets Descartes: A Simple and Fast Algorithm to Isolate the Real Roots of a Polynomial
In: arXiv [abs/1109.6279v1], 1-21 | Electronic Journal Article | |
| | 2011 | | | van Zuylen, Anke
[Schalekamp, Frans]
[Williamson, David P.] | [Adacher, Ludovica]
[Flamini, Marta]
[Leo, Gianmaria]
[Nicosia, Gaia]
[Pacifici, Andrea]
[Piccialli, Veronica] | | | Popular Ranking
In: 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 267-270 | Electronic Proceedings Article | |
| | 2010 | | | [Amini, Omid]
Manjunath, Madhusudan | | | | Riemann-Roch for sublattices of the root lattice $A\_n$
In: Electronic Journal of Combinatorics [17], R124,1-R124,50 | Electronic Journal Article | |
| | 2010 | | | Berberich, Eric
Emeliyanenko, Pavel
Sagraloff, Michael | | | | An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
In: CoRR [abs/1010.1386], 1-16 | Electronic Journal Article | |
| | 2010 | | | Berberich, Eric
[Halperin, Dan]
[Kerber, Michael]
[Pogalnikova, Roza] | [Vahrenhold, Jan] | | | Polygonal Reconstruction from Approximate Offsets
In: 26th European Workshop on Computational Geometry : Workshop Proceedings, 65-68 | Electronic Proceedings Article | |
| | 2010 | | | [Chan, Ho-Leung]
[Lam, Tak-Wah]
Lee, Lap-Kei
[Ting, Hing-Fung] | [Marion, Jean-Yves]
[Schwentick, Thomas] | | | Continuous monitoring of distributed data streams over a time-based sliding window
In: 27th International Symposium on Theoretical Aspects of Computer Science
STACS 2010, 179-190 | Electronic Proceedings Article | |
| | 2010 | | | Elmasry, Amr
Mehlhorn, Kurt
[Schmidt, Jens M.] | | | | An $O(m+n)$ Certifying Triconnectivity Algorithm for Hamiltonian Graphs
In: Algorithmica [Online First], 1-13 | Electronic Journal Article | |
| | 2010 | | | [Epstein, Leah]
[Levin, Asaf]
Mestre, Julian
[Segev, Danny] | [Marion, Jean-Yves]
[Schwentick, Thomas] | | | Improved approximation guarantees for weighted matching in the semi-streaming model
In: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), 347-358 | Electronic Proceedings Article | |
| | 2010 | | | Fountoulakis, Nikolaos
[Kang, Ross]
[McDiarmid, Colin] | | | | The t-stability number of a random graph
In: The Electronic Journal of Combinatorics [17], R59,1-R59,29 | Electronic Journal Article | |
| | 2010 | | | Friedrich, Tobias
Sauerwald, Thomas | | | | The Cover Time of Deterministic Random Walks
In: The Electronic Journal of Combinatorics [17], R167,1-R167,30 | Electronic Journal Article | |
| | 2010 | | | Friedrich, Tobias
[Sauerwald, Thomas]
[Vilenchik, Dan] | | | | Smoothed Analysis of Balancing Networks
In: Random Structures and Algorithms [Early View], 1-24 | Electronic Journal Article | |
| | 2010 | | | [Kavitha, Telikepalli]
Mestre, Julian | | | | Max-coloring paths: Tight bounds and extensions
In: Journal of Combinatorial Optimization [Online First], 1 - 14 | Electronic Journal Article | |
| | 2010 | | | McConnella, Ross M.
Mehlhorn, Kurt
[Näher, Stefan]
[Schweitzer, Pascal] | | | | Certifying algorithms
In: Computer Science Review [Article in Press], 1-43 | Electronic Journal Article | |
| | 2010 | | | Sagraloff, Michael | | | | On the Complexity of Real Root Isolation
In: CoRR [abs/1011.0344], 1-33 | Electronic Journal Article | |
| | 2009 | | | Angelopoulos, Spyros
Doerr, Benjamin
Huber, Anna
Panagiotou, Konstantinos | | | | Tight bounds for quasirandom rumor spreading
In: The Electronic Journal of Combinatorics [16], R102,1-R102,19 | Electronic Journal Article | |
| | 2009 | | | Chan, Ho-Leung
[Edmonds, Jeff]
[Lam, Tak-Wah]
[Lee, Lap-Kei]
[Marchetti-Spaccamela, Alberto]
[Pruhs, Kirk] | [Albers, Susanne]
[Marion, Jean-Yves] | | | Nonclairvoyant Speed Scaling for Flow and Energy
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 255-264 | Electronic Proceedings Article | |
| | 2009 | | | [Dumitriu, Daniel]
[Funke, Stefan]
[Kutz, Martin]
[Milosavljevic, Nikola] | | | | How Much Geometry It Takes to Reconstruct a 2-Manifold in R 3
In: ACM Journal of Experimental Algorithms [14], 2.2:1-2.2:17 | Electronic Journal Article | |
| | 2009 | | | Elbassioni, Khaled
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj] | [Albers, Susanne]
[Marion, Jean-Yves] | | | Improved Approximation Algorithms for 1.5D Terrain Guarding
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 361-371 | Electronic Proceedings Article | |
| | 2009 | | | Elbassioni, Khaled M.
[Krohn, Erik]
[Matijevic, Domagoj]
Mestre, Julián
[Severdija, Domagoj] | | | | Improved Approximations for Guarding 1.5-Dimensional Terrains
In: Algorithmica [Online First], 1-13 | Electronic Journal Article | |
| | 2009 | | | Gidenstam, Anders
[Papatriantafilou, Marina]
[Tsigas, Phillipas] | | | | NBmalloc : Allocating Memory in a Lock-Free Manner
In: Algorithmica [Online First], 1-35 | Electronic Journal Article | |
| | 2009 | | | [Giesen, Joachim]
Manjunath, Madhusudan | [Agarwal, Pankaj Kumar]
[Alt, Helmut]
[Teillaud, Monique] | | | Minimizing Absolute Gaussian Curvature over Meshes
In: Computational Geometry, 1-16 | Electronic Proceedings Article | |
| | 2009 | | | Kratsch, Stefan | [Albers, Susanne]
[Marion, Jean-Yves] | | | Polynomial Kernelizations For MIN F+Pi1 And MAX NP
In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), 601-612 | Electronic Proceedings Article | |
| | 2009 | | | [Larsson, Andreas]
Gidenstam, Anders
[Ha, Phuong H.]
[Papatriantafilou, Marina]
[Tsigas, Philippas] | | | | Multiword Atomic Read/Write Registers on Multiprocessor Systems
In: Journal of experimental algorithmics [13], 7:1-7:30 | Electronic Journal Article | |
| | 2009 | | | Mehlhorn, K.
Michail, D. | | | | Minimum Cycle Bases: Faster and Simpler
In: ACM Transactions on Algorithms [6], 8:1-8:13 | Electronic Journal Article | |
| | 2009 | | | Panagiotou, Konstantinos | [Krattenthaler, Christian]
[Strehl, Volker]
[Kauers, Manuel] | | | Blocks In Constrained Random Graphs with Fixed Average Degree
In: 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 733-744 | Electronic Proceedings Article | |
| | 2009 | | | [Schwarz, Karsten]
Karrenbauer, Andreas
[Schehr, Gregory]
[Rieger, H.] | | | | Domain walls and chaos in the disordered SOS model
In: Journal of statistical mechanics : theory and experiment [P08022], 1-23 | Electronic Journal Article | |
| | 2009 | | | [Shervashidze, Nino]
Vishwanathan, S .V. N.
[Petri, Tobias H.]
Mehlhorn, Kurt
[Borgwardt, Karsten M.] | [van Dyk, David]
[Welling, Max] | | | Efficient Graphlet Kernels for Large Graph Comparison
In: Proceedings of the Twelfth International Conference on Artificial Intelligence and Statistics (AISTATS), 488-495 | Electronic Proceedings Article | |
| | 2008 | | | [Cameron, Peter]
Johannsen, Daniel
[Prellberg, Thomas]
Schweitzer, Pascal | | | | Counting Defective Parking Functions
In: Electronic Journal of Combinatorics [15], R92 | Electronic Journal Article | |
| | 2008 | | | Sharma, Vikram | | | | Complexity of real root isolation using continued fractions
In: Theoretical Computer Science [409], 292-310 | Electronic Journal Article | |
| | 2007 | | | Bast, Holger
Weber, Ingmar | Weikum, Gerhard | | | The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, 88-95 | Electronic Proceedings Article | |
| | 2007 | | | Mehlhorn, Kurt
Michail, Dimitrios | | | | Implementing Minimum Cycle Basis Algorithms
In: Journal of Experimental Algorithmics [11], 1-14 | Electronic Journal Article | |
| | 2006 | | | Bast, Holger | | | | Intelligente Suche mit garantiert schnellen Antwortzeiten
In: MPG Jahrbuch [?], | Electronic Journal Article | |
| | 2006 | | | Bast, Holger
Funke, Stefan
Matijevic, Domagoj | [Demetrescu, Camil]
[Goldberg, Andrew]
[Johnson, David] | | | TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
In: 9th DIMACS Implementation Challenge --- Shortest Path, | Electronic Proceedings Article | |
| | 2006 | | | Bast, Holger
Majumdar, Debapriyo
Schenkel, Ralf
Theobald, Martin
Weikum, Gerhard | [Voorhees, Ellen M.]
[Buckland, Lori Phillips] | | | IO-Top-k at TREC 2006: Terabyte Track
In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, 1-5 | Electronic Proceedings Article | |
| | 2006 | | | Doerr, Benjamin
[Gnewuch, Michael]
Hebbinghaus, Nils | | | | Discrepancy of Symmetric Products of Hypergraphs
In: The Electronic Journal of Combinatorics [13], 1-12 | Electronic Journal Article | |
| | 2006 | | | Doerr, Benjamin
Klein, Christian | | | | Controlled Randomized Rounding
In: Electronic Notes in Discrete Mathematics [25], 39-40 | Electronic Journal Article | |
| | 2006 | | | [Donato, Debora]
[Laura, Luigi]
[Leonardi, Stefano]
[Millozzi, Stefano]
Meyer, Ulrich
[Sibeyn, Jop F.] | | | | Algorithms and Experiments for the Webgraph
In: Journal of Graph Algorithms and Applications [10], 219-236 | Electronic Journal Article | |
| | 2006 | | | Eigenwillig, Arno
[Sharma, Vikram]
[Yap, Chee K.] | [Dumas, Jean-Guillaume] | | | Almost Tight Recursion Tree Bounds for the Descartes Method
In: ISSAC '06: Proceedings of the 2006 international symposium on Symbolic and algebraic computation, 71-78 | Electronic Proceedings Article | |
| | 2006 | | | Mehlhorn, Kurt
Michail, Dimitrios | | | | Implementing Minimum Cycle Basis Algorithms
In: ACM Journal of Experimental Algorithmics [11], 1-14 | Electronic Journal Article | |
| | 2005 | | | [Bifet, Albert]
[Castillo, Carlos]
[Chirita, Paul-Elexandru]
Weber, Ingmar | [Davison, Brian] | | | An Analysis of Factors Used in Search Engine Ranking
In: 1st International Workshop on Adversarial Information Retrieval on the Web (AIRWeb'05), 1-10 | Electronic Proceedings Article | |
| | 2005 | | | Elmasry, Amr
Elbassioni, Khaled M. | | | | Output-Sensitive Algorithms for Enumerating and Counting Simplices Containing a Given Point in th Plane
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 248-251 | Electronic Proceedings Article | |
| | 2005 | | | Kettner, Lutz | [Lumsdaine, Andrew]
[Schupp, Sibylle] | | | Reference Counting in Library Design---Optionally and with Union-Find Optimization
In: Library-Centric Software Design (LCSD'05), 1-10 | Electronic Proceedings Article | |
| | 2005 | | | Malamatos, Theocharis | | | | Lower bounds for expected-case planar point location
In: 17th Canadian Conference on Computational Geometry (CCCG'05), 191-194 | Electronic Proceedings Article | |
| 24 |
| |
| | 2011 | | | Philip, Geevarghese | | | | The Kernelization Complexity of some Domination and Covering Problems
Homi Bhabha National Institute | Thesis - PhD thesis | |
| | 2011 | | | Winzen, Carola | | | | Toward a complexity theory for randomized search heuristics : black box models
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2010 | | | Harren, Rolf | | | | Two-dimensional packing problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2010 | | | Huber, Anna | | | | Randomized rounding and rumor spreading with stochastic dependencies
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2010 | | | Johannsen, Daniel | | | | Random combinatorial structures and randomized search heuristics
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2010 | | | Kratsch, Stefan | | | | Kernelization of generic problems : upper and lower bounds
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2010 | | | Pyrga, Evangelia | | | | Algorithmic Game Theory and Networks
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2009 | | | Happ, Edda | | | | Analyses of Evolutionary Algorithms
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2009 | | | Kerber, Michael | | | | Geometric Algorithms for Algebraic Curves and Surfaces
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2009 | | | Schweitzer, Pascal | | | | Problems of Unknown Complexity: Graph isomorphism and Ramsey theoretic numbers
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2008 | | | Berberich, Eric | | | | Robust and Efficient Software for Problems in 2.5-Dimensional Non-Linear Geometry - Algorithms and Implementations
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2008 | | | Eigenwillig, Arno | | | | Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2008 | | | Hemmer, Michael | | | | Exact Computation of the Adjacency Graph of an Arrangement of Quadrics
Johannes Gutenberg-Universität Mainz | Thesis - PhD thesis | |
| | 2008 | | | Naujoks, Rouven | | | | NP-hard Networking Problems - Exact and Approximate Algorithms
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | | | Friedrich, Tobias | | | | Use and Avoidance of Randomness
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | | | Karrenbauer, Andreas | | | | Engineering combinatorial optimization algorithms to improve the lifetime of OLED displays
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | | | Kovács, Annamária | | | | Fast Algorithms for Two Scheduling Problems
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | | | Matijevic, Domagoj | | | | Geometric Optimization and Querying - Exact and Approximate
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2007 | | | Weber, Ingmar | | | | Efficient Index Structures for and Applications of the CompleteSearch Engine
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2006 | | | Dementiev, Roman | | | | Algorithm Engineering for Large Data Sets
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2006 | | | Hachenberger, Peter | | | | Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms Optimized Implementation, Experiments and Applications
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2006 | | | Michail, Dimitrios | | | | Minimum Cycle Basis, Algorithms & Applications
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2006 | | | Reichel, Joachim | | | | Combinatorial Approaches for the Trunk Packing Problem
Universität des Saarlandes | Thesis - PhD thesis | |
| | 2005 | | | Lennerz, Christian | | | | Distance Computation for Extended Quadratic Complexes
Universität des Saarlandes | Thesis - PhD thesis | |
| 679 |
| |
