Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Publications 2023 see here.
Publications 2022 see here.
Publications 2021 see here.
Publications 2020 see here.
Publications 2019 see here.
Publications 2018 see here.
Publications 2017 see here.
Publications 2016 see here.
Publications 2015 see here.
O. Aichholzer, G. Aloupis, E. Demaine, M. Demaine, M. Hoffmann, S. Fekete, A. Lubiw, J. Snoeyink, A. Winslow, Covering Folded Shapes, Journal of Computational Geometry , 5:1 (2014), 150-168.
O. Aichholzer, J. Cardinal, Th. Hackl, F. Hurtado, M. Korman, A. Pilz, R. I. Silveira, R. Uehara, B. Vogtenhuber, E. Welzl, Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane, Discrete Mathematics & Theoretical Computer Science, 16:3 (2014), 317-332.
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, B. Vogtenhuber, Plane Graphs with Parity Constraints, Graphs and Combinatorics, 30:1 (2014), 47-69.
A. Baertschi, S. Suri, Conflict-free chromatic art gallery coverage, Algorithmica 68:1 (2014), 265-283.
B. Bukh, J. Matoušek, Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1, Duke Mathematical Journal 163:12 (2014), 2243-2270.
M. Čadek, M. Krčál, J. Matoušek, L. Vokřínek, U. Wagner, Extendability of continuous maps is undecidable, Discrete & Computational Geometry 51:1 (2014), 24-66.
M. Čadek, M. Krčál, J. Matoušek, L. Vokřínek, U. Wagner, Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension, SIAM J. Computing 43:5 (2014), 1728-1780.
M. Čadek, M. Krčál, J. Matoušek, F. Sergeraert, L. Vokřínek, U. Wagner, Computing all maps into a sphere, Journal of the ACM 61:3 (2014), Article No.: 17.
M. Elias, J. Matoušek, E. Roldán-Pensado, Z. Safernová, Lower bounds on geometric Ramsey functions, SIAM J. Discrete Math. 28:4 (2014), 1960-1970.
J. Foniok, B. Gärtner, L. Klaus, M. Sprecher, Counting Unique-Sink Orientations, Discrete Applied Mathematics 163:2 (2014), 155-164.
F. Frati, J. Gudmundsson, E. Welzl, On the Number of Upward Planar Orientations of Maximal Planar Graphs, Theoretical Computer Science 544 (2014), 32-59.
T. Hertli, 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General, SIAM Journal of Computing 43:2 (2014), 718-729.
M. Hoffmann and Cs.D. Tóth, Vertex-Colored Encompassing Graphs, Graphs and Combinatorics 30:4 (2014), 933-947.
J. Matoušek, Near-optimal separators in string graphs, Combinatorics, Probability and Computing 23:1 (2014), 135-139.
J. Matoušek, U. Wagner, On Gromov's method of selecting heavily covered points, Discrete and Computational Geometry 52:1 (2014), 1-33.
H. Tyagi, V. Cevher, Learning non-parametric basis independent models from point queries via low-rank methods, Applied and Computational Harmonic Analysis 37:3 (2014), 389-412.
O. Aichholzer, J. Cardinal, V. Kusters, S. Langerman, P. Valtr, Reconstructing Point Set Order Types from Radial Orderings, Proc. 25th International Symposium on Algorithms and Computation (ISAAC) (2014) LNCS 8889, 15-26.
I. Bárány, J. Matoušek, A. Por, Curves in Rd intersecting every hyperplane at most d+1 times, Proc. 30th Annual ACM Symposium on Computational Geometry (SoCG) (2014), 565-574.
K. Buchin, A. van Goethem, M. Hoffmann, M. van Kreveld, B. Speckmann. Travel-time Maps: Linear Cartograms with Fixed Vertex Locations, Proc. 8th International Conference on Geographic Information Science (GIScience) (2014) LNCS 8728, 18-33.
M. Elias, J. Matoušek, E. Roldán-Pensado, Z. Safernová, Lower bounds on geometric Ramsey functions, Proc. 30th Annual ACM Symposium on Computational Geometry (SoCG) (2014), 558-564.
W. Evans, V.Kusters, M. Saumell, B. Speckmann, Column Planarity and Partial Simultaneous Geometric Embedding, 22nd International Symposium on Graph Drawing (2014) LNCS 8871, 259-271.
A. Francke, Cs.D. Tóth, A Census of Plane Graphs with Polyline Edges, Proc. 30th Annual ACM Symposium on Computational Geometry (SoCG) (2014), 242-250.
B. Gärtner, Sampling with Removal in LP-type Problems, Proc. 30th Annual ACM Symposium on Computational Geometry (SoCG) (2014), 511-518.
B. Gärtner, A. Krause, H. Tyagi, Efficient Sampling for Learning Sparse Additive Models in High Dimensions, Advances in Neural Information Processing Systems (NIPS) (2014), 514-522.
B. Gärtner, H. Tyagi, Continuum armed bandit problem of few variables in high dimensions, Proc. 11th Workshop on Approximation and Online Algorithms (WAOA) (2014) LNCS 8447, 108-119.
A. Gundert, M. Szedlák, Higher Dimensional Discrete Cheeger Inequalities, Proc. 30th Annual ACM Symposium on Computational Geometry (SoCG) (2014), 181-188.
T.Hertli, Breaking the PPSZ Barrier for Unique 3-SAT, 41st International Colloquium on Automata, Languages and Programming (ICALP) (2014) LNCS 8572, 600-611.
M. Hoffmann, V. Kusters, T. Miltzow, Halving Balls in Deterministic Linear Time, Proc. 22nd Annual European Symposium on Algorithms (ESA) (2014) LNCS 8737, 566-578.
J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, Embeddability in the 3-sphere is decidable, Proc. 30th Annual ACM Symposium on Computational Geometry (SoCG) (2014), 78-87.
S. Stich, On low complexity Acceleration Techniques for Randomized Optimization, 13th International Conference on Parallel Problem Solving From Nature (PPSN) (2014) LNCS 8672, 130-140.
M. Wettstein, Counting and Enumerating Crossing-free Geometric Graphs, Proc. 30th Annual ACM Symposium on Computational Geometry (SoCG) (2014), 1-10.
O. Aichholzer, Th. Hackl, M. Korman, M. van Kreveld, M. Löffler, A. Pilz, B. Speckmann, E. Welzl, Packing Plane Spanning Trees and Paths in Complete Geometric Graphs, Proc. 26th Canadian Conference on Computational Geometry (CCCG) (2014), 6 pages.
O. Aichholzer, M. Hoffmann, M. van Kreveld, G. Rote, Graph Drawings with Relative Edge Length Specifications Proc. 26th Canadian Conference on Computational Geometry (CCCG) (2014), 7 pages.
Y. Brise, K. Buchin, D. Eversmann, M. Hoffmann, W. Mulzer, Interference Minimization in Asymmetric Sensor Networks, Proc. 10th International Symposium on Algorithms and Experiments for Sensor Systems (ALGOSENSORS) (2014), 16 pages.
M. Hoffmann, M. van Kreveld, V. Kusters, G. Rote, Quality Ratios of Measures for Graph Drawing Styles, Proc. 26th Canadian Conference on Computational Geometry (CCCG) (2014), 7 pages.
M. Hoffmann, V. Kusters, T. Miltzow, Separating Balls with a Hyperplane, Abstracts of the 30th European Workshop on Computational Geometry (EuroCG), Ein-Gedi, Israel (2014).
J. Matoušek, String graphs and separators (expository paper), in J. Matoušek, J. Nesetril, M. Pellegrini (eds.): Geometry, Structure and Randomness in Combinatorics, CRM Series, Springer, (2014).
P. K. Agarwal, J. Matoušek, M. Sharir, On range searching with semialgebraic sets II, SIAM Journal of Computing 42:6 (2013), 2039-2062.
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Pór, F. Santos, B. Speckmann, B. Vogtenhuber, Maximizing maximal angles for plane straight-line graphs, Computational Geometry: Theory and Applications 46:1 (2013), 17-28.
C. Ambühl, B. Gärtner, B. von Stengel, Optimal lower bounds for projective list update algorithms, ACM Transactions on Algorithms, 9:4 (2013), 31:1-31:18.
D. Chen, P. Morin, U. Wagner, Absolute approximation of Tukey depth: Theory and experiments, Computational Geometry - Theory and Applications 46:5 (2013), 566-573.
M. Eliáš, J. Matoušek, Higher-order Erdős-Szekeres theorems, Advances in Mathematics 244 (2013), 1-15.
K. Fukuda, H. Miyata, S. Moriyama, Complete enumeration of small realizable oriented matroids, Discrete and Computational Geometry 49 (2013), 359–381.
B. Gärtner, C. Müller, S. Stich, Optimization of Convex Functions with Random Pursuit, SIAM Journal on Optimization 23:2 (2013), 1284-1309.
H. Gebauer, On the Construction of 3-Chromatic Hypergraphs with Few Edges, Journal of Combinatorial Theory Series A 120:7 (2013), 1483-1490.
H. Gebauer, Size Ramsey Number of Bounded Degree Graphs for Games, Combinatorics, Probability and Computing 22:4 (2013), 499--516.
Y.-L. Hwong, J. Keiren, V. Kusters, S. Leemans, T. Willemse, Formalising and analysing the control software of the Compact Muon Solenoid Experiment at the Large Hadron Collider, Science of Computer Programming 78:12 (2013), 2435-2452.
M. Krèál, J. Matoušek, F. Sergeraert, Polynomial-time homology for simplicial Eilenberg-MacLane spaces, Journal of Foundations of Computational Mathematics 13:6 (2013), 935-963.
J. Matoušek, The determinant bound for discrepancy is almost tight, Proceedings of the American Mathematical Society 141 (2013), 451-460.
A. Razen, E. Welzl, On the Number of Crossing-Free Partitions, Computational Geometry - Theory and Applications 46:7 (2013), 879-893.
H. Tyagi, E. Vural, P. Frossard, Tangent space estimation for smooth embeddings of Riemannian manifolds, Information and Inference 2:1 (2013), 69-114.
M. Sharir, A. Sheffer, E. Welzl, Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique, Journal of Combinatorial Theory, Series A 120:4 (2013), 777-794.
A. Asinowski, J. Cardinal, N. Cohen, S. Collette, T. Hackl, M. Hoffmann, K. Knauer, S. Langerman, M. Lason, P. Micek, G. Rote and T. Ueckerdt, Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles, Proc. 13th Algorithms and Data Structures Symposium (WADS) (2013), LNCS 8037, 73-84.
M. Čadek, M. Krčál, J. Matoušek, L. Vokřínek, U. Wagner, Extending continuous maps: polynomiality and undecidability (extended abstract), Proc. 45rd Annual ACM Symposium on Theory of Computing (STOC) (2013), 595-604.
J. Cardinal, M. Hoffmann, V. Kusters, On Universal Point Sets for Planar Graphs, Proc. Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG) (2013), LNCS 8296, 30-41.
M. Geyer, M. Hoffmann, M. Kaufmann, V. Kusters, Cs. D. Tóth, Planar Packing of Binary Trees, Proc. 13th Algorithms and Data Structures Symposium (WADS) (2013), LNCS 8037, 353-364.
X. Goaoc, J. Matoušek, P. Paták, Z. Safernová, Simplifying inclusion-exclusion formulas, European Conference on Combinatorics, Graph Theory and Applications (Eurocomb) (2013), 559-565.
J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, Untangling two systems of noncrossing curves, 21st International Symposium on Graph Drawing (2013), LNCS 8242, 472-483.
A. Thomas, J. van Leeuwen, Treewidth and Pure Nash Equilibria, 8th International Symposium on Parameterized and Exact Computation (IPEC 2013) (2013), LNCS 8246, 348-360.
H. Tyagi, E. Vural, P. Frossard, Tangent space estimation bounds for smooth manifolds, 10th International Conference on Sampling Theory and Applications (SAMPTA) (2013), to appear.
O. Aichholzer, G. Aloupis, E. Demaine, M. Demaine, S. Fekete, M. Hoffmann, A. Lubiw, J. Snoeyink, and A. Winslow, Covering Folded Shapes, Proc. 25th Canadian Conference on Computational Geometry (CCCG) (2013), 73-78.
O. Aichholzer, J. Cardinal, Th. Hackl, F. Hurtado, M. Korman, A. Pilz, R. Silveira, R. Uehara, B. Vogtenhuber, E. Welzl, Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane, Proc. 25th Canadian Conference on Computational Geometry (CCCG) (2013), 169-174.
I. Emiris, V. Fisikopoulos and B. Gärtner, Efficient Volume and Edge-Skeleton Computation for Polytopes Given by Oracles, Abstracts of the 29th European Workshop on Computational Geometry (EuroCG), Braunschweig, Germany, (2013), 111-114.
B. Gärtner, C. Helbling, Y. Ota, T. Takahashi, Large Shadows from Sparse Inequalities, (2013).
A. Gundert, U. Wagner, On the Subdivision Containment Problem for Random 2-Complexes, Computational Geometry Week: Young Researchers Forum 2013, Rio de Janeiro, Brazil, (2013).
M. Hoffmann, V. Kusters, G. Rote, M. Saumell, and R. Silveira, Convex Hull Alignment through Translation, Proc. 25th Canadian Conference on Computational Geometry (CCCG) (2013), 295-300.
H. Tyagi, S. Stich, B. Gärtner, Stochastic continuum armed bandit problem of few linear parameters in high dimensions, (2013).
B. Gärtner, J. Matoušek, Approximation Algorithms and Semidefinite Programming, Springer Verlag (2012).
P. Adamaszek, B. Gärtner, I. Meili, J. Müllener, J. Spühler, B. Zwahlen, Schau genau - schau wie schlau! Sprache und Technik Hand in Hand, Pro Juventute (2012).
H. Ahn, O. Cheong, J. Matoušek, A. Vigneron, Reachability by paths of bounded curvature in convex polygons, Computational Geometry: Theory and Applications 45:1-2 (2012), 21-32.
M. Bodlaender, C. Hurkens, V. Kusters, F. Staals, G. Woeginger, H Zantema, Cinderella versus the Wicked Stepmother, Theoretical Computer Science, Lecture Notes in Computer Science 7604 (2012), 57-71.
K. Buchin, J. Matoušek, R. Moser, and D. Pálvölgyi: Vectors in a box, Mathematical Programming Ser. A, 135:1-2 (2012), 323-335.
B. Bukh, G. Nivasch, Upper Bounds for Centerlines, Journal of Computational Geometry 3 (2012), 20-30.
T. Christ, D. Pálvölgyi, M. Stojaković, Consistent Digital Line Segments, Discrete and Computational Geometry 47:4 (2012), 691-710.
B. Gärtner, M. Jaggi, C. Maria, An Exponential Lower Bound on the Complexity of Regularization Paths, Journal of Computational Geometry 3:1 (2012), 168-195.
B. Gärtner, M. Sprecher, A Polynomial-Time Algorithm for the Tridiagonal and Hessenberg P-Matrix Linear Complementarity Problem, Operations Research Letters 40:6 (2012), 484-486.
H. Gebauer, Disproof of the Neighborhood Conjecture with Implications to SAT, Combinatorica 32:5 (2012), 573-587.
H. Gebauer, On the Clique-Game, European Journal of Combinatorics 33:1 (2012), 8-19.
J. Giesen, M. Jaggi, S. Laue, Approximating Parameterized Convex Optimization Problems, ACM Transactions on Algorithms 9:1 (2012), #10.
M. Hoffmann, J. Matoušek, Y. Okamoto, P. Zumstein, Maximum and Minimum against k lies, Chicago Journal Theoretical Computer Science (2012), #2.
A. Kawamura, J. Matoušek, T. Tokuyama, Zone diagrams in Euclidean spaces and in other normed spaces, Mathematische Annalen 354:4 (2012), 1201-1221.
H. Kaplan, J. Matoušek, Z. Safernová, M. Sharir: Unit distances in three dimensions, Combinatorics, Probability and Computing, 21:4 (2012) 597-610.
H. Kaplan, J. Matoušek, M. Sharir: Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique, Discrete and Computational Geometry 48: 3(2012), 499-517.
J. Matoušek, M. Tancer, U. Wagner, A geometric proof of the colored Tverberg theorem, Discrete and Computational Geometry 47:2 (2012), 245-265.
U. Wagner, Minors, Embeddability, and Extremal Problems for Hypergraphs, Thirty Essays on Geometric Graph Theory, ed. J. Pach, (2012), 569-607.
P. K. Agarwal, J. Matoušek, M. Sharir, On range searching with semialgebraic sets II, Proc. IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) (2012), 420-429.
A. Bärtschi, S. Suri, Conflict-free Chromatic Art Gallery Coverage, Proc. 29th International Symposium on Theoretical Aspects of Computer Science (STACS) (2012), 160-171.
V. Cevher, H. Tyagi, Learning ridge functions with randomized sampling in high dimensions, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2012), 2025-2028.
V. Cevher, H. Tyagi, Active Learning of Multi-Index Function Models, Advances in Neural Information Processing Systems (NIPS) (2012), 1475--1483.
M. Čadek, M. Krčál, J. Matoušek, F. Sergeraert, L. Vokřínek, and U. Wagner, Computing all maps into a sphere, Proc. 23nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2012), 1-10.
M. Eliáš, J. Matoušek, Higher-order Erdős-Szekeres theorems, Proc. 26th Annual Symposium on Computational Geometry (SoCG) (2012), 81-90.
F. Frati, J. Gudmundsson, E. Welzl, On the Number of Upward Planar Orientations of Maximal Planar Graphs, Proc. 23rd Int. Symp. on Algorithms and Computation (ISAAC) (2012), Lecture Notes in Computer Science 7676 (2012), 413-422.
J. Giesen, M. Jaggi, S. Laue, Regularization Paths with Guarantees for Convex Semidefinite Optimization, Proceedings of 15th International Conference on Artificial Intelligence and Statistics (AISTATS) (2012), 432-439.
A. Gundert, U.Wagner, On Laplacians of Random Complexes, Proc. 28th Annual ACM Symposium on Computational Geometry (SoCG) (2012), 151-160.
Y.-L. Hwong, V. Kusters, T. Willemse, Analysing the Control Software of the Compact Muon Solenoid Experiment at the Large Hadron Collider, Fundamentals of Software Engineering, Lecture Notes in Computer Science 7141 (2012), 174-189.
C. Müller, S. Stich, On spectral invariance of Randomized Hessian and Covariance Matrix Adaptation schemes, 12th International Conference on Parallel Problem Solving From Nature (PPSN) (2012), 448-457.
M. Sharir, A. Sheffer, E. Welzl, Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique, Proc. 26th Annual Symposium on Computational Geometry (SoCG) (2012), 189-198.
J. Cardinal, N. Cohen, S. Collette, M. Hoffmann, S. Langerman, G. Rote, Coloring Dynamic Point Sets on a Line, Abstracts 28th European Workshop on Computational Geometry (EuroCG), Assisi, Italy, (2012), 209-212.
Y. Brise, B. Gärtner, Clarkson's Algorithm for Violator Spaces, Computational Geometry - Theory and Applications 44 (2011), 70-81.
J. Foniok, K. Fukuda, L. Klaus, Combinatorial Characterizations of K-matrices, Linear Algebra and its Applications 434 (2011), 68-80.
H. Gebauer, Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs, The Electronic Journal of Combinatorics 18:1 (2011), #P132.
H. Gebauer, Finding and Enumerating Hamilton Cycles in 4-Regular Graphs, Theoretical Computer Science 412(35) (2011), 4579-4591.
M. Hoffmann, J. Matoušek, Y. Okamoto, P. Zumstein, The t-Pebbling Number is Eventually Linear in t, Electronic Journal of Combinatorics 18:1 (2011), #P153.
Jiří Matoušek, Martin Tancer, and Uli Wagner, Hardness of embedding simplicial complexes in Rd , Journal of the European Mathematical Society 13:2 (2011), 259-295.
M. Sharir, A. Sheffer, E. Welzl, On Degrees in Random Triangulations of Point Sets, Journal of Combinatorial Theory, Ser. A 118(7) (2011), 1979-1999.
T. Christ, Beyond Triangulation: Covering Polygons with Triangles, Proc. 12th Algorithms and Data Structures Symposium (WADS) (2011), LNCS 6844, 231-242.
T. Christ, A. Francke, H. Gebauer, J. Matoušek, T. Uno, A Doubly Exponentially Crumbled Cake, Electronic Notes in Discrete Mathematics (38), (2011), 265-271.
H. Gebauer, T. Szabó, G. Tardos, The Local Lemma is Tight for SAT, Proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2011), 664-674.
T. Hertli, 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General, Proc. 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2011), 277-284.
T. Hertli, R. Moser, D. Scheder, Improving PPSZ for 3-SAT using Critical Variables, Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS) (2011), 237-248.
M. Hoffmann, M. Sharir, A. Sheffer, Cs. D. Tóth, E. Welzl, Counting Plane Graphs: Flippability and Its Applications, Proc. 12th Algorithms and Data Structures Symposium (WADS) (2011), LNCS 6844, 524-535.
U. Wagner, Minors in Random and Expanding Hypergraphs, Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG) (2011), 351-360.
T. Christ, M. Hoffmann, Wireless Localization within Orthogonal Polyhedra, Proc. 23rd Canadian Conference on Computational Geometry (CCCG) (2011), 467-472.
T. Christ, A. Mishra, Wireless Localization with Vertex Guards, Abstracts 27th European Workshop on Computational Geometry (EuroCG), Morschach, Switzerland (2011), 87-90.
A. Razen, E. Welzl, Counting Crossing-Free Geometric Graphs with Exponential Speed-Up, Rainbow of Computer Science - Dedicated to Hermann Maurer on the Occasion of His 70th Birthday, Lecture Notes in Computer Science 6570 (2011), 36-46.
E. Welzl, The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland?, Algorithms Unplugged (2011), 357-360.
K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama (Eds.), Mathematical Software - ICMS 2010, LNCS6327, Springer-Verlag (2010).
R. Berke, D. Mitsche, Colorings at Minimum Cost, Discrete Mathematics 310:3 (2010), 561-569.
T. Christ, M. Hoffmann, Y. Okamoto, T. Uno, Improved Bounds for Wireless Localization, Algorithmica 57:3 (2010), 499-516.
K. Fukuda, C. Weibel, A linear equation for minkowski sums of polytopes relatively in general position, European J. Combinatorics 31 (2010), 565-573.
M. Hoffmann, B. Speckmann, Cs. D. Tóth, Pointed binary encompassing trees: simple and optimal, Computational Geometry - Theory and Applications 43:1 (2010), 35-41.
R. Moser, G.Tardos, A Constructive Proof of the General Lovász Local Lemma, Journal of the ACM 2 (2010) Art. 11, 15pp.
T. Szabó, P. Zumstein, S Zürcher, On the Minimum Degree of Minimal Ramsey Graphs, Journal of Graph Theory 64:2 (2010), 150-164.
T. Christ, D. Pálvölgyi, M. Stojaković, Consistent digital line segments, Symposium of Computational Geometry (SoCG) (2010), 11-18.
J. Giesen, M. Jaggi, S. Laue, Approximating Parameterized Convex Optimization Problems, Proc. 8th Annual European Symposium on Algorithms (ESA), (2010), LNCS 6346, 524-535.
M. Hoffmann, J. Matoušek, Y. Okamoto, P. Zumstein, Minimum and Maximum Against k Lies, Proc. 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) (2010), LNCS 6139, 139-149.
M. Jaggi, M. Sulovský, A Simple Algorithm for Nuclear Norm Regularized Problems, Proc. 27th International Conference on Machine Learning (ICML) (2010), 471-478.
A. Kawamura, J. Matoušek, T. Tokuyama, Zone diagrams in Euclidean spaces and in other normed spaces, Proc. 26th ACM Symposium Comput. Geom. (SoCG) (2010), 216-221.
M. Sharir, A. Sheffer, E. Welzl, On Degrees in Random Triangulations of Point Sets, Proc. 26th Annual Symposium on Computational Geometry (SoCG) (2010), 297-306.
A. Gundert, E. D. Kim, D. Schymura, Lattice Paths and Lagrangian Matroids, DocCourse Combinatorics and Geometry 2009, Part III: Research Reports, CRM Documents Vol. 5 (2010), 63-82.
H. Miyata, S. Moriyama, and K. Fukuda, Complete enumeration of small realizable oriented matroids, Proceedings of Canadian Conference on Computational Geometry (CCCG) (2010), 143-146.
M. Sulovský, U. Wagner, k-Sets and Continuous Motion in R3, Proceedings of Canadian Conference on Computational Geometry (CCCG) (2010), 47-50.
R. Aharoni, T. Szabó, Vizing's conjecture for chordal graphs, Discrete Mathematics 300 (2009), 1766-1768.
N. Alon, R. Berke, K. Buchin, M. Buchin, P. Csorba, S. Shannigrahi, B. Speckmann, P. Zumstein, Polychromatic Coloring of Plane Graphs, Discrete and Computational Geometry 42:3 (2009), 421-442.
K. Buchin, A. Razen, T. Uno, U. Wagner, Transforming Spanning Trees: A Lower Bound, Computational Geometry - Theory and Applications 42:8 (2009), 724 - 730.
J. Foniok, K. Fukuda, B. Gärtner, H. J. Lüthi, Pivoting in Linear Complementarity: Two Polynomial-Time Cases, Discrete and Computational Geometry 42:2 (2009), 187-205.
K. Fukuda, S. Moriyama, Y. Okamoto, The Holt-Klee condition for oriented matroids, European J. Combinatorics 30:8 (2009), 1854-1867.
S. Gandhi, S. Suri, E. Welzl, Catching Elephants with Mice: Sparse Sampling for Monitoring Sensor Networks, ACM Transactions on Sensor Networks 6:1 (2009), Article No.: 1.
H. Gebauer, Y. Okamoto, Fast exponential-time algorithms for the forest counting and the Tutte polynomial computation in graph classes, International Journal of Foundations of Computer Science 20 (2009), 25-44.
H. Gebauer, T.Szabó, Asymptotic random graph intuition for the biased connectivity game, Random Structures & Algorithms, 35 (2009), 431-443.
D. Hefetz, M. Krivelevich, T. Szabó, Hamilton cycles in highly connected and expanding graphs, Combinatorica 29 (2009), 547-568.
D. Hefetz, M. Krivelevich, M. Stojaković, T. Szabó, Avoider-Enforcer: the rules of the game, Journal of Combinatorial Theory (Series A) 117 (2009), 152-163.
D. Hefetz, M. Krivelevich, M. Stojaković, T. Szabó, A sharp threshold for the Hamilton cycle Maker-Breaker game, Random Structures and Algorithms, 34 (2009), 112-122.
J. Matoušek, Blocking visibility for points in general position, Discrete and Computational Geometry, 42:2 (2009), 19-22.
J. Matoušek, Removing degeneracy in LP-type problems revisited, Discrete and Computational Geometry, 42:4 (2009), 517-526.
E. Nevo, U. Wagner, On the embeddability of skeleta of spheres, Israel Journal of Mathematics 174 (2009), 381-402.
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, B. Vogtenhuber, Plane Graphs with Parity Constraints, Proc. 10th Algorithms and Data Structures Symposium (WADS), (2009), LNCS 5664, 13-24.
M. Al-Jubeh, M. Hoffmann, M. Ishaque, D. Souvaine, Cs. Tóth, Convex Partitions with 2-Edge Connected Dual Graphs, Proc. 15th Ann. Internat. Conf. Computing and Combinatorics (COCOON) (2009), LNCS 5609, 192-204.
S. Columbano, K. Fukuda, C. Jones, An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices, In D. Avis, D. Bremner, and A. Deza, editors, Polyhedral Computation, CRM Proceedings and Lecture Notes, Amer. Math. Soc., Vol. 48 (2009), 73-102.
T. Galkovskyi, B. Gärtner, B. Rublev, The Domination Heuristic for LP-type Problems, Proc. 10th Workshop on Algorithm Engineering and Experiments (ALENEX) (2009), 74-84.
H. Gebauer, Disproof of the Neighborhood Conjecture with Implications to SAT, Proc. 17th Annual European Symposium on Algorithms (ESA) (2009), LNCS 5757, 764-775.
A. Francke, M. Hoffmann, Maximum Degree Four Euclidean Minimum Spanning Tree is NP-hard, Proc. 25th Annual Symposium on Computational Geometry (SoCG) (2009), 179-188.
B. Gärtner, M. Jaggi, Coresets for Polytope Distance, Proc. 25th Annual Symposium on Computational Geometry (SoCG) (2009), 33-42.
J. Matoušek, M. Tancer, and U. Wagner, Hardness of Embedding Simplicial Complexes, Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA) (2009), 855-864.
R. Moser, A Constructive Proof of the Lovász Local Lemma, Proc. 41st Annual ACM Symposium on Theory of Computing (STOC) (2009), 343-350.
P. Traxler, Variable Influences in Conjunctive Normal Forms, Proc. 11th International Conference on Theory and Applications of Satisfiability Testing (SAT) (2009), LNCS 5584, 101-113.
Y. Brise, B. Gärtner, Clarkson's Algorithm for Violator Spaces, Proc. 21st Canadian Conference on Computational Geometry (CCCG) (2009), 9-12.
T. Christ, M. Hoffmann, Wireless Localization with Vertex Guards is NP-hard, Proc. 21st Canadian Conference on Computational Geometry (CCCG) (2009), 149-152.
T. Christ, M. Hoffmann, Y. Okamoto, Natural Wireless Localization is NP-hard, Abstracts 25th European Workshop on Computational Geometry (EuroCG) (2009), 175-178.
H. Gebauer, R. A. Moser, D. Scheder, E. Welzl, The Lovász Local Lemma and Satisfiability, Efficient Algorithms - Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday , (2009), LNCS 5760, 30-54.
A. Razen, E. Welzl, On the Number of Crossing-Free Partitions in the Plane, Abstracts 25th European Workshop on Computational Geometry (EuroCG) (2009), 147-150.
P. Agarwal, M. Sharir, E. Welzl, Algorithms for center and Tverberg points, ACM Transactions on Algorithms 5(1) (2008), Article 5 (20 pp.).
V. Anuradha, C. Jain, J. Snoeyink, T. Szabó, How long can a graph be kept planar? Electronic Journal of Combinatorics, 15(1) (2008), N14.
K. Buchin, T.K. Dey, J. Giesen and M. John, Recursive Geometry of the Flow Complex and Topology of the Flow Complex Filtration, Computational Geometry - Theory and Applications 40 (2008), 115-137.
T.K. Dey, J. Giesen, E. Ramos and B. Sadri, Critical points of the distance to an epsilon-sampling of a surface and flow based surface reconstruction, International Journal of Computational Geometry and Applications 18 (2008), 29-61.
B. Gärtner, J. Matoušek, L. Rüst, P. Škovroň, Violator spaces: structure and algorithms, Discrete Applied Mathematics 156:11 (2008), 2124-2141.
B. Gärtner, W. D. Morris Jr., L. Rüst, Unique sink orientations of grids, Algorithmica 51:2 (2008) 200-235.
D. Hefetz, M. Krivelevich, M. Stojakovíc, T. Szabó, A sharp threshold for the Hamilton cycle Maker-Breaker game, Random Structures and Algorithms, 34 (2009), 112-122.
D. Hefetz, M. Krivelevich, M. Stojakovic, T. Szabó, Planarity, colorability and minor games, SIAM Journal on Discrete Mathematics, 22 (2008), 194-212.
M. Krivelevich, T. Szabó, Large covers of hypergraphs and biased positional games, Electronic Journal of Combinatorics, 15(1) (2008), R70.
J. Matoušek, LC reductions yield isomorphic simplicial complexes, Contributions to Discrete Mathematics (electronic) 3,2 (2008), 37-39.
J. Matoušek, On variants of the Johnson--Lindenstrauss lemma, Random Structures & Algorithms 33:2 (2008), 142-156.
U. Wagner, k-Sets and k-Facets, Discrete & Computational Geometry - 20 Years Later, AMS Series Contemporary Mathematics (2008), 443-513.
N. Alon, R. Berke, K. Buchin, M. Buchin, P. Csorba, S. Shannigrahi, B. Speckmann, P. Zumstein, Polychromatic Coloring of Plane Graphs, Proc. 24th Annual ACM Symposium on Computational Geometry (SoCG) (2008), 338-345.
T. Christ, M. Hoffmann, Y. Okamoto, T. Uno, Improved Bounds for Wireless Localization, Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT) (2008), 77-89.
J. Díaz, D. Mitsche, X. Pérez-Giménez, On the connectivity of dynamic random geometric graphs, Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2008), 601-610.
T. Galkovskyi, B. Gärtner, B. Rublev, The Domination Heuristic for LP-type Problems, Proc. 10th Workshop on Algorithm Engineering and Experiments (ALENEX) (2009), 74-84.
H. Gebauer, On the Number of Hamilton Cycles in Bounded Degree Graphs, Proc. 5th Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (2008), 241-248.
A. Razen, J. Snoeyink, E. Welzl, Number of Crossing-Free Geometric Graphs vs. Triangulations, Electronic Notes in Discrete Mathematics 31 (2008), 195-200, and Proc. of the International Conference on Topological & Geometric Graph Theory (TGGT) (2008), 188-193.
P. Sankowski, Algebraic Graph Algorithms, Proc. 33rd International Symposium on Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science 5162, (2008), 68-82.
D. Scheder, Guided Search and a Faster Deterministic Algorithm for 3-SAT, Proc. 8th Latin American Theoretical Informatics Symposium (LATIN) (2008), LNCS 4957, 60-71.
D. Scheder, P. Zumstein, How many conflicts does it need to be unsatisfiable?, Proc. 11th International Conference on Theory and Applications of Satisfiability Testing (SAT) (2008), LNCS 4996, 246-256.
S. Smorodinsky, M. Sulovský, U. Wagner, On Center Regions and Balls Containing Many Points, Proc. 14th Annual International Computing and Combinatorics Conference (COCOON) (2008), LNCS 5092, 363-373.
P. Traxler, On the time complexity of constraint satisfaction, Proc. of the 3rd International Workshop on Parameterized and Exact Computation (IWPEC) (2008), 190-201.
B. Gärtner, R. Veltkamp (Eds.), Special Issue on CGAL (the Computational Geometry Algorithms Library), Computational Geometry - Theory and Applications 38:1-2 (2007) 1-128.
N. Alon, A. Krech, T. Szabó, Turán's Theorem in the hypercube, SIAM Journal on Discrete Mathematics 21 (2007) 66-72.
T. Asano, J. Matoušek, T. Tokuyama, The distance trisector curve, Advances in Mathematics 212 (2007) 338-360.
T. Asano, J. Matoušek, T. Tokuyama, Zone diagrams, SIAM Journal of Computing 37:4 (2007) 1182-1198.
R. Berke, T. Szabó, Relaxed two-coloring of cubic graphs, Journal of Combinatorial Theory (Series B) 97:4 (2007) 652-668.
F. Cazals, J. Giesen, M. Pauly, A. Zomorodian, The conformal alpha shape filtration, The Visual Computer 22 (2006) 531-540.
T.K. Dey, J. Giesen, S. Goswami, Delaunay triangulation approximates anchor hull, Computational Geometry - Theory and Applications 36 (2007) 131-143.
K. Fukuda, A. Jensen, N. Lauritzen and R. Thomas, The generic Gröbner walk, Journal of Symbolic Computation 42 (2007) 298-312.
K. Fukuda, A. Jensen and R. Thomas, Computing Gröbner fans, Mathematics of Computation 76 (2007) 2189-2212.
K. Fukuda and T. Uno, Polynomial time algorithms for maximizing the intersection volume of polytopes, Pacific Journal on Optimization 3 (2007) 37-52.
K. Fukuda and C. Weibel, f-vectors of Minkowski additions of convex polytopes, Discrete Computational Geometry 37 (2007) 503-516.
B. Gärtner, V. Kaibel, Two new bounds for the Random-Edge simplex algorithm, SIAM Journal on Discrete Mathematics 21 (2007) 178-190.
J. Giesen, M. John, The flow complex: a data structure for geometric modeling, Computational Geometry - Theory and Applications 39 (2008) 178-190.
J. Giesen, K. Mueller, E. Schuberth, L. Wang and P. Zolliker, Conjoint Analysis for Measuring the Perceived Quality in Volume Rendering, IEEE Transactions on Visualization and Computer Graphics 13:6 (2007) 1664-1671.
J. Giesen, E. Schuberth, K. Simon, P. Zolliker, O. Zweifel, Image-Dependent Gamut Mapping as Optimization Problem, IEEE Transactions on Image Processing 16 (2007) 2401-2410.
D. Hefetz, M. Krivelevich, T. Szabó, Avoider-Enforcer games, Journal of Combinatorial Theory (Series A) 114 (2007) 840-853.
D. Hefetz, M. Krivelevich, T. Szabó, Bart-Moe games, JumbleG and discrepancy, European Journal of Combinatorics 28 (2007) 1131-1143.
S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel, An adaptable and extensible geometry kernel, Computational Geometry - Theory and Applications 38:1-2 (2007) 16-36.
T. Asano, J. Matoušek, T. Tokuyama: Zone diagrams, Proc. 18th ACM-SIAM Symposum on Discrete Algorithms (SODA), (2007) 756-765.
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Pór, F. Santos, B. Speckmann, B. Vogtenhuber, Maximizing maximal angles for plane straight line graphs, Proc. 10th Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science 4619 (2007) 458-469.
Marc Benkert, Martin Nöllenburg, Takeaki Uno, Alexander Wolff, Minimizing intra-edge crossings in wiring diagrams and public transport maps, Proc. 14th Int. Symposium on Graph Drawing (GD), Lecture Notes in Computer Science 4372 (2007) 270-281.
S. Gandhi, S. Suri, E. Welzl, Catching elephants with mice: sparse sampling for monitoring sensor networks, Proc. 5th International ACM Conference on Embedded Networked Sensor Systems (SenSys), (2007) 261-274.
J. Giesen, D. Mitsche, E. Schuberth, A spectral approach to collaborative ranking, Proc. AAAI 07 Workshop on Preference Handling for Artificial Intelligence, (2007) 47-52.
J. Giesen, D. Mitsche, E. Schuberth, Collaborative ranking: an aggregation algorithm for individuals' preference estimation, Proc. 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM), Lecture Notes in Computer Science 4508 (2007) 58-67.
C. Käppeli, D. Scheder, Partial Satisfaction of k-Satisfiable Formulas, Proc. European Conference on Combinatorics (EuroComb), (2007) 497-501.
V. Pauli, L. Lampe, R. Schober and K. Fukuda, Multiple-symbol differential detection based on combinatorial geometry, Proc. IEEE International Conference on Communications (ICC 2007), (2007) 827-832.
D. Scheder, P. Zumstein, Satisfiability with exponential families, Proc. 10th International Conference on Theory and Applications of Satisfiability Testing (SAT), Lecture Notes in Computer Science 4501 (2007) 148-158.
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, F. Santos, B. Speckmann, B. Vogtenhuber, Maximizing maximal angles for plane straight line graphs, Proc. 23rd European Workshop on Computational Geometry (EuroCG) (2007) 98-101.
V. Anuradha, C. Jain, J. Snoeyink, T Szabó, How long can a graph be kept planar?, 17th Fall Workshop on Computational and Combinatorial Geometry (2007).
N. Benbernou, E. D. Demaine, M. L. Demaine, M. Hoffmann, M. Ishaque, D. L. Souvaine, Cs. D. Tóth, Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs, Proc. 19th Canadian Conference on Computational Geometry (CCCG) (2007) 13-16.
K. Buchin, A. Razen, T. Uno, U. Wagner, Transforming spanning trees: a lower bound, Proc. 23rd European Workshop on Computational Geometry (EuroCG) (2007) 166-169.
F. Cazals, J. Giesen, Delaunay triangulation based surface reconstruction, Effective Computational Geometry of Curves and Surfaces, (J.D. Boissonnat, M. Teillaud, Eds.) Springer-Verlag (2007), 231-276.
J. Giesen, E. Schuberth, The combinatorial structure of polyhedral choice based conjoint analysis; Conjoint Measurement: Methods and Applications, Editors A. Gustafsson, A. Herrmann and F. Huber, Springer-Verlag (2007) 258-271.
B. Gärtner, J. Matoušek, Understanding and Using Linear Programming, Universitext, Springer (2006).
U. Adamy, M. Hoffmann, J. Solymosi, M. Stojakovic, Coloring octrees, Theoretical Computer Science 363:1 (2006) 11-17.
J. Bang-Jensen, B. Reed, M. Schacht, R. Samal, B. Toft, U. Wagner, On six problems posed by Jarik Nesetril, In: Topics in Discrete Mathematics (M. Klazar, J. Kratochvil, M. Loebl, J. Matoušek, R. Thomas, eds.), Algorithms and Combinatorics 26 (2006) 613-627.
J. Barat, J. Matoušek, D. Wood, Bounded-degree graphs have arbitrarily large geometric thickness, The Electronic Journal of Combinatorics 13:1 (2006).
K. Chen, A. Fiat, H. Kaplan, M. Levy, J. Matoušek, E. Mossel, J. Pach, M. Sharir, Sh. Smorodinsky, U. Wagner, E. Welzl, Online conflict-free coloring for intervals, SIAM Journal of Computing 36 (2006) 956-973.
V.G. Deineko, M. Hoffmann, Y. Okamoto, G.J. Woeginger, The traveling salesman problem with few inner points, Operations Research Letters 34:1 (2006) 106-110.
R. Haas and M. Hoffmann, Chordless paths through three vertices, Theoretical Computer Science 351:3 (2006) 360-371.
P. Haxell, T. Szabó, Odd independent transversals are odd, Combinatorics, Probability and Computing 15:1-2 (2006) 193-211.
J. Matoušek, The number of unique-sink orientations of the hypercube, Combinatorica 26 (2006) 91-99.
J. Matoušek, M. Sharir, S. Smorodinsky, U. Wagner, k-sets in four dimensions, Discrete Computational Geometry 35:2 (2006) 177-191.
J. Matoušek, T. Szabó, RANDOMEDGE can be exponential in abstract cubes, Advances in Mathematics 204 (2006) 262-277.
M. Sharir, E. Welzl, On the number of crossing-free matchings, cycles, and partitions, SIAM Journal of Computing 36 (2006) 1342-1359.
T. Szabó, G. Tardos, Extremal problems for transversals in graphs with bounded degree, Combinatorica 26:3 (2006) 333-351.
T. Asano, J. Matoušek, T. Tokuyama, The distance trisector curve, Proc. 38th ACM Symposium on Theory of Computing (STOC) (2006) 336-343.
R. Berke, T. Szabó, Deciding relaxed two-colorability - a hardness jump, Proc. 14th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 4168 (2006) 124-135.
K. Fukuda, T. Uno, Algorithms for maximizing the volume of intersection of polytopes, Proc. 22nd European Workshop on Computational Geometry (EURO-CG) (2006).
B. Gärtner, J. Matoušek, L. Rüst, P. Škovroň, Violator spaces: structure and algorithms, Proc. 14th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 4168 (2006) 387-398.
B. Gärtner, I. Schurr, Linear Programming and unique sink orientations, Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2006) 749-757.
J. Giesen, E. Ramos, B. Sadri, Medial axis approximation and unstable manifolds, Proc. 22nd Annual ACM Symposium on Computational Geometry (SoCG) (2006) 327-336.
J. Giesen, E. Schuberth, K. Simon, D. Zeiter, P. Zolliker, A framework for image-dependent gamut mapping, Proc. IS&T/SPIE Symposium on Electronic Imaging (2006) 605805-1-11.
J. Giesen, E. Schuberth, M. Stojakovic, Approximate sorting, Proc. 7th Latin American Theoretical Informatics Symposium (LATIN), Lecture Notes in Computer Science 3887 (2006) 524-531.
M. Kiyomi, S. Kijima, T. Uno, Listing chordal graphs and interval graphs, Proc. 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG) (2006) 68-77.
N. Mitra, L. Guibas, J. Giesen, M. Pauly; Probabilistic fingerprints for shapes, Proc. 4th Symposium on Geometry Processing (SGP) (2006) 121-130.
M. Sharir, E. Welzl, On the number of crossing-free matchings, (cycles, and partitions), Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2006) 860-869.
M. Sharir, E. Welzl, Random triangulations of planar point sets, Proc. 22nd Annual ACM Symposium on Computational Geometry (SOCG) (2006) 273-281.
U. Wagner, On a generalization of the Upper Bound Theorem, Proc. 47th Annual Symposium on the Foundations of Computer Science (FOCS) (2006) 635-645.
J. Giesen, E. Schuberth, K. Simon, P. Zolliker, A kernel approach to gamut boundary computation, Proceedings of the 14th European Signal Processing Conference (EUSIPCO) (2006) (invited paper).
M. Hoffmann, Cs. D. Tóth, Spanning trees across axis-parallel segments, Proc. 18th Canadian Conference on Computational Geometry (CCCG), Kingston (ON), Canada (2006) 101-104.
E. Welzl, Kleinster umschliessender Kreis - Ein Demokratiebeitrag aus der Schweiz?, Algorithmus der Woche 42 (2006).
E. Welzl, Random triangulations of planar point sets, in: Algorithmic Graph Theory, Oberwolfach Reports 7 (2006) 432-435.
J. E. Goodman, J. Pach, E. Welzl (Eds.), Combinatorial and Computational Geometry, Mathematical Sciences Research Institute Publications, Cambridge University Press (2005).
N. Alon, M. Krivelevich, J. Spencer, T. Szabó, Discrepancy games, Electronic Journal of Combinatorics 12 (2005) R51.
I. Bárány, K. Fukuda, A case when the union of polytopes is convex, Linear Algebra and its Applications 397 (2005) 381 - 388.
P. Csorba, On the biased n-in-a-row game, Discrete Mathematics, 305:1-3 (2005) 100-111.
S. Felsner, B. Gärtner, F. Tschirschnitz, Grid orientations, (d,d+2)-polytopes, and arrangements of pseudolines, Discrete & Computational Geometry 34 (2005) 411-437.
A. Frieze, M. Krivelevich, O. Pikhurko, T. Szabó, The game of JumbleG, Combinatorics, Probability and Computing 14 (2005) 783-793.
M. Hoffmann, A simple linear algorithm for rectilinear 3-centers, Computational Geometry - Theory and Applications 31:3 (2005) 150-165.
K. Kashiwabara, M. Nakamura, Y. Okamoto, The affine representation theorem for abstract convex geometries, Computational Geometry - Theory and Applications 30 (2005) 129-144.
B. Speckmann, Cs. D. Tóth, Allocating vertex pi-guards in simple polygons via pseudo-triangulations, Discrete & Computational Geometry 33 (2005) 345-364.
M. Stojakovic, T. Szabó, Positional games on random graphs, Random Structures & Algorithms 26 (2005) 204-223.
B. Sudakov, T. Szabó, V. Vu, A generalization of Turán's Theorem, Journal of Graph Theory 49:3 (2005) 187-195.
T. Szabó, V. Vu, Exact k-wise intersection theorems, Graphs and Combinatorics 21:2 (2005) 247-261.
U. Adamy, Th. Erlebach, D. Mitsche, I. Schurr, B. Speckmann, E. Welzl, Off-line admission control for advance reservations in star networks, Proc. 2nd Workshop on Approximation and Online Algorithms (WAOA`04), Lecture Notes in Computer Science 3351 (2005) 211-224.
B. Aronov, S. Smorodinsky, On geometric permutations induced by lines transversal through a fixed point, Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2005) 251-256.
Z. Beerliova, F. Eberhard, Th. Erlebach, A. Hall, M. Hoffmann, M. Mihalak, L. Shankar Ram, Network discovery and verification, Proc. Graph Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science 3787 (2005) 127-138.
R. Berke, T. Szabó, Relaxed coloring of cubic graphs, European Conference on Combinatorics, Graph Theory, and Applications (EUROCOMB) (2005) 341-344.
M. Bläser, L. Shankar Ram, An improved approximation for TSP with distances one and two, Proc. 15th International Symposium on Fundamentals of Computation Theory (FCT), Lecture Notes in Computer Science 3623 (2005) 504-515.
M. Bläser, L. Shankar Ram, Approximate fair cost allocation in metric TSP games, Proc. 3rd Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science 3879 (2005) 82-95.
M. Bläser, L. Shankar Ram, M. Sviridenko, Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems, Proc. Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science 3608 (2005) 350-359.
F. Cazals, J. Giesen, M. Pauly, A. Zomorodian, Conformal alpha shapes, Proc. 2nd Symposium on Point Based Graphics (SPBG) (2005) 55-61.
T.K. Dey, J. Giesen, S. Goswami, Delaunay triangulation approximates anchor hull, Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2005) 1028-1037.
T.K. Dey, J. Giesen, E. Ramos, B. Sadri, Critical points of the distance to an epsilon-sampling on a surface and flow complex reconstruction, Proc. 21st Annual ACM Symposium on Computational Geometry (SOCG) (2005) 218-227.
A. Fiat, M. Levy, J. Matoušek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner, E. Welzl, Online conflict-free coloring for intervals, Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2005) 545-554.
B. Gärtner, W. D. Morris Jr., L. Rüst, Unique sink orientations of grids, Proc. 11th Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science 3509 (2005) 210-224.
B. Gärtner, L. Rüst, Simple stochastic games and P-matrix generalized linear complementarity problems, Proc. 15th International Symposium on Fundamentals of Computation Theory (FCT), Lecture Notes in Computer Science 3623 (2005) 209-220.
J. Giesen, D. Mitsche, Boosting spectral partitioning by sampling and iteration, Proc. 16th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 3827 (2005) 473-482.
J. Giesen, D. Mitsche, Bounding the misclassification error in spectral partitioning in the planted partition model, Proc. 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science 3787 (2005) 409-420.
J. Giesen, D. Mitsche, Reconstructing many partitions using spectral techniques , Proc. 15th International Symposium on Fundamentals of Computation Theory (FCT), Lecture Notes in Computer Science 3623 (2005) 433-444.
J. Giesen, E. Schuberth, K. Simon, P. Zolliker, Toward interactive image-dependent gamut mapping: Fast and accurate gamut boundary determination, Proc. IS&T/SPIE Symposium on Electronic Imaging (2005) 201-210.
M. Hoffmann, Cs. D. Tóth, Pointed and colored binary encompassing trees, Proc. 21st Annual ACM Symposium on Computational Geometry (SOCG) (2005) 81-90.
F. Kuhn, P. von Rickenbach, R. Wattenhofer, E. Welzl, A. Zollinger, Interference in cellular networks: The minimum membership set cover problem, Proc. 11th Annual International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 3595 (2005) 188-198.
M. Marciniszyn, D. Mitsche, M. Stojakovic, Balanced avoidance games on random graphs, Proc. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB); Discrete Mathematics & Theoretical Computer Science (2005) 329-334.
M. Pauly, N. Mitra, J. Giesen, L. Guibas, M. Gross, Example-based 3D scan completion, Proc. 3rd Symposium on Geometry Processing (SGP) (2005) 23-32.
T Szabó, I. Schurr, Jumping doesn't help in abstract cubes, Proc. 11th Conference on Integer Programming and Combinatorial Optimization (IPCO) (2005) 225-235.
K. Buchin, J. Giesen, Flow complex: General structure and algorithm, Proc. 17th Canadian Conference on Computational Geometry (CCCG) (2005) 270-273.
M. Buchin, J. Giesen, Minimizing the total absolute Gaussian curvature in a terrain is hard, Proc. 17th Canadian Conference on Computational Geometry (CCCG) (2005) 192-195.
M. Hoffmann, Cs. D. Tóth, Pointed binary encompassing trees: Simple and optimal, Abstracts 21st European Workshop on Computational Geometry (EuroCG) (2005) 93-96.
G.M. Beutler, J. Kurmanavicius, M. Hoffmann, E. Welzl, R. Huch, M. Bajka, New nomogram for foetal weight estimation based on Hadlock's two-parameter formula, Ultraschall in der Medizin 25 (2004) 1-7.
M. Cieliebak, Th. Erlebach, Zs. Lipták, J. Stoye, E. Welzl, Algorithmic complexity of protein identification: Combinatorics of weighted strings, Discrete Applied Mathematics 137 (2004) 27-46 (Special Issue on Combinatorics of Searching, Sorting, and Coding).
P. Csorba, C. Lange, I. Schurr, A. Waßmer, Box complexes, neighborhood complexes, and the chromatic number, Journal of Combinatorial Theory: Series A 108 (2004) 159-168.
K. Fischer, B. Gärtner, The smallest enclosing ball of balls: combinatorial structure and algorithms, International Journal of Computational Geometry & Applications 14:4/5 (2004) 341-378.
K. Fukuda, From the zonotope construction to the Minkowski addition of convex polytopes, Journal of Symbolic Computation 38 (2004) 1261-1272.
B. Gärtner, J. Solymosi, F. Tschirschnitz, P. Valtr, E. Welzl, One line and n points, Random Structures & Algorithms 23:4 (2004) 453-471.
J. Giesen, M. John, M. Stöcklin, Symmetry of flow diagrams derived from weighted points in the plane, International Journal of Computational Geometry and Applications 13 (2004) 327-337.
J. Giesen, U. Wagner, Shape dimension and intrinsic metric from samples of manifolds, Discrete & Computational Geometry 32:2 (2004) 245-267.
M. Krivelevich, B. Sudakov, T. Szabó, Triangle factors in pseudo-random graphs, Combinatorica 24 (2004) 403-426.
L. Lovász, K. Vesztergombi, U. Wagner, E. Welzl, Convex quadrilaterals and k-sets, in: Towards a Theory of Geometric Graphs (J. Pach, Ed.), AMS Contemporary Mathematics 342 (2004) 139-148.
J. Matousek, A combinatorial proof of Kneser's conjecture, Combinatorica 24 (2004) 163-170.
J. Matousek, U. Wagner, New constructions of weak epsilon-nets, Discrete & Computational Geometry 32:2 (2004) 195-206.
Y. Okamoto, Traveling salesman games with the Monge property, Discrete Applied Mathematics 138 (2004) 349-369.
I. Schurr, T. Szabó, Finding the sink takes some time, Discrete & Computational Geometry 31 (2004) 627-642.
M. Sharir, E. Welzl, Point-line incidences in space, Combinatorics, Probability and Computing 13 (2004) 203-220.
Cs. D. Tóth, Illuminating Labyrinths, Discrete Applied Mathematics 138 (1-2) (2004) 215-228.
U. Adamy, Th. Erlebach, Online coloring of intervals with bandwidth, Proc. 1st Workshop on Approximation and Online Algorithms (WAOA03), Lecture Notes in Computer Science 2909 (2004) 1-12.
U. Adamy, M. Hoffmann, J. Solymosi, M. Stojakovic, Coloring Octrees, Proc. 10th Int. Computing and Combinatorics Conference (COCOON '04), Lecture Notes in Computer Science 3106 (2004) 62-71.
P.K. Agarwal, M. Sharir, E. Welzl, Algorithms for Center and Tverberg Points, Proc. 20th Annual ACM Symposium on Computational Geometry (SoCG) (2004) 61-67.
M. Andersson, J. Giesen, M. Pauly and B. Speckmann, Bounds on the k-neighborhood for locally uniform sampled surfaces, Proc. 1st Symposium on Point Based Graphics (PBG`04) (2004) 167-171.
Th. Bietenhader, Y. Okamoto, Core stability of minimum coloring games, Proc. 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004), Lecture Notes in Computer Science 3353 (2004) 389-401.
E.D. Demaine, M. Hoffmann, M. Holzer, PushPush-k is PSPACE-Complete, Proc. 3rd International Conference on Fun with Algorithms (FUN`04) (2004) 159-170.
V.G. Deineko, M. Hoffmann, Y. Okamoto, G.J. Woeginger, The Traveling Salesman Problem with few inner points, Proc. 10th International Computing and Combinatorics Conference (COCOON 2004), Lecture Notes in Computer Science 3106 (2004) 268-277.
T.K. Dey, J. Giesen, S. Goswami, Shape segmentation and matching from noisy point clouds, Proc. 1st Symposium on Point Based Graphics (PBG`04) (2004) 193-199.
K. Fukuda, B. Kaluzny, The criss-cross method can take Omega(n^d) pivots, Proc. 20th Annual ACM Symposium on Computational Geometry (SoCG) (2004) 401-408.
K. Fukuda, V. Rosta, Exact parallel algorithms for the location depth and the maximum feasible subsystem problems, in Frontiers in global optimization (C.A. Floudas, P.M. Pardalos, Eds.), Nonconvex Optim. Appl. 74 (2004) 123-133, Kluwer Acad. Publ., Boston, MA.
R. Haas, M. Hoffmann, Chordless paths through three vertices, Proceedings of 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science 3162 (2004) 25-36.
M. Hoffmann, Y. Okamoto, The minimum weight triangulation problem with few inner points, Proceedings of 1st International Workshop on Parameterized and Exact Computation (IWPEC 2004), Lecture Notes in Computer Science 3162 (2004) 200-212.
M. Hoffmann, B. Speckmann, and Cs. D. Tóth, Pointed Binary Encompassing Trees, Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT`04), Lecture Notes in Computer Science 3111 (2004) 442-454.
J. Matoušek, T. Szabó, RANDOM EDGE can be exponential on abstract cubes, Proc. 45nd Ann. IEEE Symp. on Foundations of Computer Science (FOCS) (2004) 92-100.
R. Pinchasi, S. Smorodinsky, On Locally Delaunay Geometric Graphs, Proc. 20th Annual ACM Symposium on Computational Geometry (SoCG) (2004) 378-382.
B. Schoelkopf, J. Giesen, S. Spalinger, Kernel methods for implicit surface modeling, Proc. 18th Annual Conference on Neural Information Processing Systems (NIPS) (2004) 1193-1200.
M. Dyer, N. Megiddo, E. Welzl, Linear Programming, in: Handbook of Discrete and Computational Geometry (J.E. Goodman, J. O'Rourke, eds.), Chapman and Hall/CRC, (2004) 999-1014.
J. Giesen, S. Spalinger, Meshless Surface Reconstruction by Kernel Clustering, Proc. 16th Candian Conference on Computational Geometry (CCCG) (2004) 11-14.
M. Hoffmann, Cs. D. Tóth, Pointed Binary Encompassing Trees: Simple and Optimal, Abstracts 14th Annual Fall Workshop on Computational Geometry (2004) 28-29.
A. Andrzejak, E. Welzl, In between k-Sets, j-Facets, and i-Faces: (i,j)-Partitions, Discrete & Computational Geometry 29:1 (2003) 105-131.
E. D. Demaine, M. L. Demaine, M. Hoffmann, J. O'Rourke, Pushing Blocks is Hard, Computational Geometry - Theory and Applications 26:1 (2003) 21-36.
T.K. Dey, J. Giesen, Detecting undersampling in surface reconstruction, Discrete & Computational Geometry - The Goodman-Pollack Festschrift (2003) 328-345.
T. K. Dey, J. Giesen, S. Goswami, W. Zhao, Shape dimension and approximation from samples, Discrete & Computational Geometry 29:3 (2003) 419-434.
J. Hage, T. Harju, E. Welzl, Euler graphs, triangle-free graphs and bipartite graphs in switching classes, Fundamenta Informaticae 58:1 (2003) 23-37.
P. Haxell, T. Szabó, G. Tardos, Bounded size components - Partitions and Transversals, Journal of Combinatorial Theory (Series B) 88:2 (2003) 281-297.
M. Hoffmann, Cs. D. Tóth, Segment endpoint visibility graphs are Hamiltonian, Computational Geometry - Theory and Applications 26:1 (2003) 47-68.
M. Hoffmann, Cs. D. Tóth, Alternating paths through disjoint line segments, Information Processing Letters 87:6 (2003) 287-294.
K. Kashiwabara, Y. Okamoto, A greedy algorithm for convex geometries, Discrete Applied Mathematics 131:2 (2003) 449-465.
L. Kettner, D. Kirkpatrick, A. Mantler, J. Snoeyink, B. Speckmann, F. Takeuchi, Tight Degree Bounds for Pseudo-Triangulations of Points. Computational Geometry - Theory and Applications 25 (2003) 3-12.
J. Matousek, M. Stojakovic, On restricted min-wise independence of permutations, Random Structures & Algorithms 23 (2003) 397-408.
Y. Okamoto, Some properties of the core on convex geometries, Mathematical Methods of Operations Research 56 (2003) 377-386.
Y. Okamoto, Submodularity of some classes of the combinatorial optimization games, Mathematical Methods of Operations Research 58:1 (2003) 131-139.
Y. Okamoto, M. Nakamura, The forbidden minor characterization of line-search antimatroids of rooted digraphs, Discrete Applied Mathematics 131:2 (2003) 523-533.
J. Pach, J. Solymosi, G. Tóth, Unavoidable Configurations in Complete Topological Graphs, Discrete & Computational Geometry 30 (2003) 311-320.
M. Sharir, E. Welzl, Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem, Discrete & Computational Geometry - The Goodman-Pollack Festschrift (2003) 789-797.
M. Stojakovic, Limit shape of optimal convex lattice polygons in the sense of different metrics, Discrete Mathematics 271 (2003) 235-249.
T. Szabó, On the spectrum of projective norm-graphs, Information Processing Letters 86:2 (2003) 71-74.
T. Szabó, Van H. Vu, Turán's Theorem in sparse random graphs, Random Structures and Algorithms 23:3 (2003) 225-234.
Cs. D. Tóth, Illuminating Disjoint Line Segments in the Plane, Discrete & Computational Geometry 30:3 (2003) 489-505.
Cs. D. Tóth, A Note on Binary Plane Partitions, Discrete & Computational Geometry 30:1 (2003) 3-16.
Cs. D. Tóth, Illumination of Polygons with 45º-Floodlights, Discrete Mathematics 265:1-3 (2003) 251-260.
Cs. D. Tóth, Guarding disjoint triangles and claws in the plane, Computational Geometry - Theory and Applications 25:1-3 (2003) 51-65.
Cs. D. Tóth, Binary Space Partition for Line Segments with a Limited Number of Directions, SIAM Journal of Computing 32:2 (2003) 307-325.
P. Carmi, Th. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science 2880 (2003) 143-155.
K. Fischer, B. Gärtner, M. Kutz, Fast smallest-enclosing-ball computation in high dimensions, Proc. 11th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 2832 (2003) 630-641.
T.K. Dey, J. Giesen, S. Goswami, Shape segmentation and matching with flow discretization, Proc. 8th International Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science 2748 (2003) 25-36.
T. K. Dey, J. Giesen, M. John, alpha-Shapes and flow shapes are homotopy equivalent, Proc. 35rd Annual ACM Symposium on the Theory of Computing (STOC) (2003) 493-502.
K. Fischer, B. Gärtner, The smallest enclosing ball of balls: combinatorial structure and algorithms, Proc. 19th Annual ACM Symposium on Computational Geometry (SoCG) (2003) 292-301.
J. Giesen, M. John, The flow complex: A data structure for geometric modeling, Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003) 285-294.
J. Giesen, M. John, Computing the weighted flow complex, Proc. 8th International Fall Workshop Vision, Modeling, and Visualization (2003) 235-243.
J. Giesen, U. Wagner, Shape dimension and intrinsic metric from samples of manifolds with high co-dimension, Proc. 19th Annual ACM Symposium on Computational Geometry (SoCG) (2003) 329-337.
K. Kashiwabara, Y. Okamoto, T. Uno, Matroid representation of clique complexes, Proc. 9th International Computing and Combinatorics Conference (COCOON), Lecture Notes in Computer Science 2697 (2003) 192-201.
J. Matousek, U. Wagner, New constructions of weak epsilon-nets, Proc. 19th Annual ACM Symposium on Computational Geometry (SoCG) (2003) 129-135.
J. Matousek, M. Stojakovic, On restricted min-wise independence of permutations, Abstracts European Conference on Combinatorics, Graph Theory, and Applications (EUROCOMB) (2003) 264-268.
Y. Okamoto, Fair cost allocations under conflicts - a game-theoretic point of view, Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 2906 (2003) 686--695.
Y. Okamoto, The free complex of a two-dimensional generalized convex shelling, Abstracts European Conference on Combinatorics, Graph Theory, and Applications (EUROCOMB) (2003) 289-293.
B. Speckmann, Cs. D. Tóth, Allocating vertex pi-guards in simple polygons via pseudo-triangulations, Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003) 109-118.
U. Wagner, On the Rectilinear Crossing Number of Complete Graphs, Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003) 583-588.
O. Aichholzer, G. Rote, B. Speckmann, I. Streinu, The zigzag path of a pseudo-triangulation, Proc. 8th International Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science 2748 (2003), 377-388.
O. Aichholzer, M. Hoffmann, B. Speckmann, and Cs. D. Tóth, Degree bounds for constrained pseudo-triangulations, Proc. 15th Canadian Conference on Computational Geometry (2003) 155-158.
P. Carmi, Th. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs (in Japanese), Mathematics and Algorithms of Optimization, Surikaisekikenkyusho Kokyuroku 1297 (2002) 12-23.
P. Carmi, Th. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, TIK-Report 155, Computer Engineering and Networks Laboratory (TIK), ETH Zurich (2003).
K. Fischer, B. Gärtner, Cgal-based implementation of smallest enclosing balls of balls, ECG Technical Report No. ECG-TR-121202-01, ETH Zurich (2003).
K. Fischer, B. Gärtner, Prototype implementation of approximate minimum enclosing ellipsoids, ECG Technical Report No. ECG-TR-301211-01, ETH Zurich (2003).
M. Hachimori, Y. Okamoto, Japanese translation of "Lectures on Polytopes" (author: Günter M. Ziegler), Springer-Verlag Tokyo, 2003.
K. Kashiwabara, Y. Okamoto, T. Uno, Matroid representation of clique complexes, Proc. 3rd Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications (2003) 40-48.
H. Mohri, Y. Okamoto, Discrete optimization and cooperative games (2), (in Japanese), Communications of the Operations Research Society of Japan 48 (2003) 114-120.
Y. Okamoto, Edelman-Reiner's conjecture on the free complex of an abstract convex geometry, (in Japanese) Proc. of Ouyou Suugaku Goudou Kenkyuu Shuukai (2003) 125-128.
U. Adamy, J. Giesen, M. John, Surface Reconstruction Using Umbrella Filters, Computational Geometry - Theory and Applications 21 (2002) 63-86.
B. Gärtner, The Random-Facet Simplex Algorithm on Combinatorial Cubes, Random Structures and Algorithms 20 (2002) 353-381.
G. Karolyi, J. Solymosi, Almost Disjoint Triangles in 3-Space, Discrete & Computational Geometry 28 (2002) 577-583.
D. Kirkpatrick, J. Snoeyink, B. Speckmann, Kinetic Collision Detection for Simple Polygons. International Journal of Computational Geometry and Applications 12 (2002) 3-27.
J. Matousek, A Lower Bound for Weak Epsilon-Nets in High Dimension, Discrete & Computational Geometry 28 (2002) 45-48.
J. Solymosi, G. Tardos, Cs. D. Tóth, The k Most Frequent Distances in the Plane, Discrete & Computational Geometry 28 (2002) 639-648.
Cs. D. Tóth, Art Galleries with Guards of Uniform Range of Vision, Computational Geometry - Theory and Applications 21 (2002) 185-192.
Cs. D. Tóth, Illumination in the Presence of Opaque Line Segments in the Plane, Computational Geometry - Theory and Applications 21 (2002) 193-204.
U. Wagner, On the Number of Corner Cuts, Advances in Applied Mathematics 29 (2002) 152-161.
U. Adamy, C. Ambühl, S. Anand, Th. Erlebach, Call Control in Rings, Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Computer Science 2380 (2002) 788-799.
P.K. Agarwal, T. Hagerup, R. Ray, M. Sharir, M. Smid, E. Welzl, Translating a Planar Object to Maximize Point Containment, Proc. 10th European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 2461 (2002) 42-53.
Ch. Ambühl, U. Wagner, On the CLIQUE Problem in Intersection Graphs of Ellipses, Proc. 13th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 2518 (2002) 489-500.
M. Cieliebak, Th. Erlebach, Zs. Lipták, J. Stoye, E. Welzl, Algorithmic Complexity of Protein Identification: Searching in Weighted Strings, Proc. of 2nd IFIP Conference on Theoretical Computer Science, (2002) 143-156, Kluwer Adacemic Publishers.
T. K. Dey, J. Giesen, S. Goswami, W. Zhao, Shape Dimension and Approximation from Samples, Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2002) 772-780.
J. Giesen, M. John, New Diagrams from Disks in the Plane, Proc. 19th International Symp. on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science 2285 (2002) 238-249.
J. Giesen, M. John, Duality in Disk Induced Flows, Proc. 2nd Intern. Conf. on Computational Science (ICCS), Intern. Workshop on Computational Geometry and Applications (CGA), Lecture Notes in Computer Science 2331 (2002) 154-163.
J. Giesen, M. John, Surface Reconstruction Based on a Dynamical System, Proc. 23rd Annual Conference of the European Association for Computer Graphics (Eurographics), Computer Graphics Forum 21 (2002) 363-371.
J. Giesen, A. Völker, Requirements Interdependencies and Stakeholder Preferences, Proc. IEEE Joint International Requirements Engineering Conference (RE) (2002) 206-209.
J. Giesen, R. Wattenhofer, A. Zollinger, Towards a Theory of Peer-to-Peer Computability, Proc. 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Proceedings in Informatics 13 (2002) 115-132, Carleton Scientific.
J. Hage, T. Harju, E. Welzl, Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes, Proc. 1st International Conference on Graph Transformation (ICGT), Lecture Notes in Computer Science 2505 (2002) 148-160.
D. Kirkpatrick, B. Speckmann, Kinetic Maintenance of Context-Sensitive Hierarchical Representations of Disjoint Simple Polygons, Proc. 18th Ann. ACM Symp. on Computational Geometry (2002) 179-188.
M. van Kreveld, B. Speckmann, Cutting a Country for Smallest Square Fit, Proc. 13th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science 2518 (2002) 91-102.
M. Laumanns, L. Thiele, E. Zitzler, E. Welzl, K. Deb, Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem, Parallel Problem Solving From Nature, Lecture Notes in Computer Science 2439 (2002) 44-53.
I. Schurr, T. Szabó, Finding the Sink Takes some Time, Proc. 10th European Symposium on Algorithms (ESA), Lecture Notes in Computer Science 2461 (2002) 833-844.
M. Sharir, E. Welzl, Point-Line Incidences in Space, Proc. 18th Ann. ACM Symp. on Computational Geometry (2002) 107-115.
Cs. D. Tóth, Binary Space Partition for Line Segments with a Limited Number of Directions, Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA) (2002) 465-471.
O. Aichholzer, F. Aurenhammer, H. Krasser, B. Speckmann, Convexity minimizes Pseudo-Triangulations, Proc. 14th Canadian Conference on Computational Geometry (2002) 158-161.
O. Aichholzer, B. Speckmann, I. Streinu, The Path of a Pseudo-Triangulation, Abstracts of the DIMACS Workshop on Computational Geometry, Piscataway (NJ), USA, (2002), 2 pages.
E. D. Demaine, R. A. Hearn, M. Hoffmann, Push-2F is PSPACE-Complete, Proc. 14th Canadian Conference on Computational Geometry (2002) 31-35.
K. Fischer, B. Gärtner, CGAL-based implementation of smallest enclosing ball of balls, ECG Technical Report No. ECG-TR-121202-01 (2002) 4 pages.
J. Giesen, M. John, The Complexity of flow diagrams in the plane, Proc. 14th Canadian Conference on Computational Geometry (2002) 45-48.
J. Giesen, M. John, How to Add Facet Attributes to CGAL's 3D Geometric Triangulations, Proc. CGAL User Workshop (2002) 4 pages.
M. Hoffmann, Cs. D. Tóth, Alternating Paths through Disjoint Line Segments, Abstracts of the 18th European Workshop on Computational Geometry (EuroCG) (2002) 23-26.
M. Hoffmann, Cs. D. Tóth, Connecting Points in the Presence of Obstacles in the Plane, Proc. 14th Canadian Conference on Computational Geometry (2002) 63-67.
Y. Okamoto, Traveling salesman games with the Monge property, ICM2002GTA Proceeding Volume (2002) 625-629.
Y. Okamoto, Submodularity of some classes of the combinatorial optimization games, (in Japanese), IPSJ SIGNotes ALgorithms 085 (2002).
Y. Okamoto, Some properties of the core on convex geometries, (in Japanese), "Optimization - Modeling and Algorithms", The Institute of Statistical Mathematics Cooperative Research Report 148 (2002) 28-36.
S. Schönherr, A quadratic programming engine for geometric optimization - Part I: The solver, TR 387 (2002), Department of Computer Science, ETH Zürich.
S. Schönherr, A quadratic programming engine for geometric optimization - Part II: The basis inverse, TR 388 (2002), Department of Computer Science, ETH Zürich.
S. Schönherr, A quadratic programming engine for geometric optimization - Part III: Pricing strategies, TR 389 (2002), Department of Computer Science, ETH Zürich.
B. Speckmann, Cs. D. Tóth, Vertex pi-Guards in Simple Polygons, Abstracts of the 18th European Workshop on Computational Geometry (EuroCG) (2002) 12-15.
CH. AMBÜHL, B. GÄRTNER, B. VON STENGEL, A New Lower Bound for the List Update Problem in the Partial Cost Model, Theoretical Computer Science 268 (2001) 3-16.
E. BABSON, L. FINSCHI, K. FUKUDA, Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids, European Journal of Combinatorics 22 (2001) 587-600.
A. BEMPORAD, K. FUKUDA, F.D. TORRISI, Convexity Recognition of the Union of Polyhedra, Computational Geometry - Theory and Applications 18 (2001) 141 - 154.
A. DUMITRESCU, B. GÄRTNER, S. PEDRONI, E. WELZL, Enumerating Triangulation Paths, Computational Geometry - Theory and Applications 20 (2001) 3-12.
K. FUKUDA, T.M. LIEBLING, C. LÜTOLF, Extended Convex Hull, Computational Geometry - Theory and Applications 20 (2001) 13-13.
K. FUKUDA, A. PRODON, T. SAKUMA, Notes on Acyclic Orientations and the Shelling Lemma, Theoretical Computer Science 263 (2001) 9-16.
B. GÄRTNER, E. WELZL, Random Sampling in Geometric Optimization: New Insights and Applications, Discrete & Computational Geometry 25 (2001) 569-590.
Gy. KÁROLYI, E. WELZL, Crossing-Free Segments and Triangles in Point Configurations, Discrete Applied Mathematics 112 (2001) 77-88.
J. MATOUSEK, Lower Bound on the Minus-Domination Number, Discrete Mathematics 233 (2001) 361-370.
J. PACH, J. SOLYMOSI, Crossing Patterns of Line Segments, Journal of Combinatorial Theory Ser. A 96 (2001) 316-325.
J. SOLYMOSI, CS. D. TÓTH, Distinct Distances in the Plane, Discrete & Computational Geometry 25 (2001) 629-634.
B. SPECKMANN, J. SNOEYINK, Easy Triangle Strips for TIN Terrain Models International Journal of Geographical Information Science, 15 (2001) 379-386.
T. SZABÓ, G. TARDOS, A Multidimensional Generalization of the Erdös-Szekeres Lemma on Monotone Subsequences, Combinatorics, Probability and Computing 10 (2001) 557-565.
U. WAGNER, E. WELZL, A Continuous Analogue of the Upper Bound Theorem, Discrete & Computational Geometry 26 (2001) 205-219.
E. WELZL, Entering and Leaving j-Facets, Discrete & Computational Geometry 25 (2001) 351-364.
T. K. DEY, J. GIESEN, W. ZHAO, Robustness Issues in Surface Reconstruction, Proc. Intern. Conf. on Computat. Sci. (2001) 658-662.
T. K. DEY, J. GIESEN, Detecting Undersampling in Surface Reconstruction, Proc. 17th Ann. ACM Symp. on Computational Geometry (2001) 257-263.
T.K. DEY, J. GIESEN, S. GOSWAMI, J. HUDSON, R. WENGER, W. ZHAO, Undersampling and Oversampling in Sample Based Shape Modeling, Proc. IEEE Visualization (2001) 83-90.
T.K. DEY, J. GIESEN, J. HUDSON, Delaunay Based Shape Reconstruction from Large Data, Proc. IEEE Symposium in Parallel and Large Data Visualization and Graphics (2001) 19-27.
T.K. DEY, J. GIESEN, J. HUDSON, Sample Shuffling for Quality Hierarchic Surface Meshing, Proc. 10th International Meshing Roundtable (2001) 143-154.
A. DEZA, K. FUKUDA, D. PASECHNIK, M. SATO, On the Skeleton of the Metric Polytope, in Discrete and Computational Geometry (J. Akiyama, M. Kano, M. Urabe, eds.), Proc. Japanese Conf. on Discrete and Comput. Geom., Lecture Notes in Computer Science 2098 (2001) 125-136.
B. GÄRTNER, J. SOLYMOSI, F. TSCHIRSCHNITZ, P. VALTR, E. WELZL, One Line and n Points, Proc. 33rd Ann. ACM Symp. on the Theory of Computing (STOC) (2001) 306-315.
S. HERT, M. HOFFMANN, L. KETTNER, S. PION, M. SEEL, An Adaptable and Extensible Geometry Kernel, in Proc. 5th Workshop on Algorithm Engineering (WAE), Lecture Notes in Computer Science 2141 (2001) 79-90.
M. SHARIR, E. WELZL, Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem, Proc. 17th Ann. ACM Symp. on Computational Geometry (2001) 315-318.
J. SOLYMOSI, CS. D. TÓTH, On the Distinct Distances Determined by a Planar Point Set, Proc. 17th Ann. ACM Symp. on Computational Geometry (2001) 29-32.
T. SZABÓ, E. WELZL, Unique Sink Orientations of Cubes, Proc. 42nd Ann. IEEE Symp. on Foundations of Computer Science (FOCS) (2001) 547-555.
CS. D. TÓTH, Illuminating Polygons with Vertex pi-Floodlights, in Proc. Intern. Conf. on Computational Science, Lecture Notes in Computer Science 2073 (2001) 772-781.
CS. D. TÓTH, A Note on Binary Plane Partitions, Proc. 17th Ann. ACM Symp. on Computational Geometry (2001) 151-156.
CS. D. TÓTH, Illuminating Both Sides of Line Segments, in Discrete and Computational Geometry (J. Akiyama, M. Kano, M. Urabe, eds.), Proc. Japanese Conf. on Discrete and Comput. Geom., Lecture Notes in Computer Science 2098 (2001) 370-380.
M. CIELIEBAK, T. ERLEBACH, ZS. LIPTÁK, J. STOYE, E. WELZL, Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings, submitted (2001).
E. D. DEMAINE, M. HOFFMANN, Pushing Blocks is NP-Complete for Noncrossing Solution Paths, Proc. 13th Canadian Conf. on Computational Geometry (2001) 65-68.
T.K. DEY, J. GIESEN, J. HUDSON, Decimating Samples for Mesh Simplification, Proc. 13th Canadian Conf. on Computational Geometry (2001) 85-88.
L. FINSCHI, K. FUKUDA, Complete Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements, Proc. 13th Canadian Conf. on Computational Geometry (2001) 97-100.
B. GÄRTNER, TH. HERMANN, Computing the Width of a Point Set in 3-Space, Proc. 13th Canadian Conf. on Computational Geometry (2001) 101-104.
B. GÄRTNER, E. WELZL, Explicit and Implicit Enforcing - Randomized Optimization, in Lectures of the Graduate Program Computational Discrete Mathematics, Lecture Notes in Computer Science 2122 (2001) 26-49.
S. HERT, M. HOFFMANN, L. KETTNER, S. PION, M. SEEL, An Adaptable and Extensible Geometry Kernel, Technical Report #362, September 2001.
M. HOFFMANN, Covering Polygons with Few Rectangles, Abstracts of the 17th European Workshop on Computational Geometry (EuroCG) (2001) 39-42.
M. HOFFMANN, CS. D. TÓTH, Segment endpoint visibility graphs are Hamiltonian, Proc. 13th Canadian Conf. on Computational Geometry (2001) 109-112 (full version in electronic proceedings).
CS. D. TÓTH, Guarding Disjoint Triangles and Claws in the Plane, Abstracts of the 17th European Workshop on Computational Geometry (EuroCG) (2001) 137-139.
F. TSCHIRSCHNITZ, Testing Extendability for Partial Chirotopes is NP-complete, Proc. 13th Canadian Conf. on Computational Geometry (2001) 165-168.
H. ALT, S. FELSNER, F. HURTADO DIAZ, E. WELZL,
A class of point sets with few k-sets,
Computational Geometry - Theory and Applications
16 (2000) 95-101.
R. CORDOVIL, K. FUKUDA, A. GUEDES DE OLIVEIRA, On the cocircuit graph of an oriented matroid, Discrete and Computational Geometry 24 (2000) 257-265.
J. BLÖMER, Denesting by Bounded Degree Radicals, Algorithmica 28 (2000) 2-15.
A. FABRI, G.-J. GIEZEMAN, L. KETTNER, ST. SCHIRRA, S. SCHÖNHERR, On the design of CGAL - a computational geometry algorithms library, Software-Practice and Experience 30 (2000) 1167-1202.
K. FUKUDA, T. TERLAKY, On the Existence of a Short Admissible Pivot Sequence for Feasibility and Linear Optimization Problems, Pure Mathematics and Applications, Mathematics of Optimization 10 (2000) 431-447.
J. GIESEN,
Curve reconstruction, the Traveling Salesman Problem, and
Menger's Theorem on Length,
Discrete & Computational Geometry 24 (2000) 577-603.
R. SEIDEL, U. ADAMY,
On the exact worst case query complexity of planar point location,
Journal of Algorithms
37 (2000) 189-217.
U. ADAMY, J. GIESEN, M. JOHN, New Techniques for Topologically Correct Surface Reconstrucion, Proc. 11th Ann. IEEE Visualization Conf. (Vis) (2000) 373-380.
CH. AMBÜHL, B. GÄRTNER, B. VON STENGEL, Optimal Projective Algorithms for the List Update Problem, Proc. 27th Ann. International Coll. on Automata, Languages and Programming (ICALP) (2000) 305-316.
CH. AMBÜHL, Offline List Update is NP-hard, Proc. 8th Ann. European Symp. on Algorithms (ESA) (2000) 42-51.
CH. AMBÜHL, S. CHAKRABORTY, B. GÄRTNER, Computing the LCP of two Point Sets under Approximate Congruence, Proc. 8th Ann. European Symposium on Algorithms (ESA) (2000) 52-63.
J. BLÖMER, Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices, Proc. 27th Ann. International Coll. on Automata, Languages and Programming (ICALP) (2000) 248-259.
B. GÄRTNER, Pitfalls in Computing with Pseudorandom Determinants, Proc. 16th Ann. ACM Symp. on Computational Geometry (2000) 148-155.
B. GÄRTNER, S. SCHÖNHERR, An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization, Proc. 16th Ann. ACM Symp. on Computational Geometry (2000) 110-118.
B. GÄRTNER, E. WELZL, Random Sampling in Geometric Optimization: New Insights and Applications, Proc. 16th Ann. ACM Symp. on Computational Geometry (2000) 91-99.
A. SCHLEICH, S. JOVANOVIC, B. SEDLMAIER, U. WARSCHEWSKE, F. OLTMANNS, S. SCHÖNHERR, W. OGANOVSKY, B. OHNESORGE, T. HOELL, H. SCHERER, Electromagnetic ENT navigation: the NEN system, Proc. 4th Annu. Conf. International Society for Computer Aided Surgery (2000).
U. WAGNER, E. WELZL, Origin-Embracing Distributions or A Continuous Analogue of the Upper Bound Theorem, Proc. 16th Ann. ACM Symp. on Computational Geometry (2000) 50-56.
U. ADAMY, J. GIESEN, M. JOHN, The Lambda-Complex and Surface Reconstruction, Proc. 16th European Workshop on Computational Geometry (EuroCG) (2000) 14-17.
B. BÜELER, A. ENGE, K. FUKUDA, Exact Volume Computation for Convex Polytopes: A Practical Study, in G. Kalai and G. Ziegler, editors, Polytopes - Combinatorics and Computation, DMV-Seminar 29 (2000) 131-154.
G. BEUTLER, J. KURMANAVICIUS, M. HOFFMANN, R. HUCH, M. BAJKA, Entwicklung eines Nomogramm zur fetalen Gewichtsschätzung (Poster), 24. Dreiländertreffen der Deutschen, Österreichischen und Schweizerischen Gesellschaften für Ultraschall in der Medizin, Wien, 7.-9. September 2000.
A. DUMITRESCU, B. GÄRTNER, S. PEDRONI, E. WELZL, Enumerating Triangulation Paths, Proc. 12th Ann. Canadian Conf. on Computational Geometry (CCCG) (2000) 233-238.
K. FUKUDA, T.M. LIEBLING, C. LÜTOLF, Extended Convex Hull, Proc. 12th Ann.Canadian Conf. on Computational Geometry (CCCG) (2000) 57-63.
B. GÄRTNER, E. WELZL, On a Simple Sampling Lemma, Proc. Computing: The Australasian Theory Symp., Electronic Notes in Theoretical Computer Science 31 (2000) 10 pages.
M. HOFFMANN, Motion Planning amidst Movable Square Blocks: Push-* is NP-hard, Proc. 12th Canadian Conference on Computational Geometry (2000) 205-209.
U. MONTANARI, J. D. P. ROLIM, E. WELZL, (Eds.), Automata, Languages and Programming, Proc. 27th International Colloquium, ICALP 2000, Lecture Notes in Computer Science 1853 (2000).
B. GÄRTNER, Randomization and Abstraction - Useful Tools for Optimization, BRICS Notes Series NS-00-1, Februar 2000.
348
F. TSCHIRSCHNITZ,
A Discourse on the Pivot Rules Random-Edge and Random-Facet
(2000).
B. GÄRTNER, Exact arithmetic at low cost - A case study in linear programming, Computational Geometry - Theory and Applications 13, (1999) 121-139.
L. KETTNER, Using generic programming for designing a data structure for polyhedral surfaces, Computational Geometry - Theory and Applications 13, (1999) 65-90.
A. ANDRZEJAK, K. FUKUDA,
Optimization over k-set polytopes and efficient k-set enumeration,
in Proc. Workshop on Algorithms And Data Structures, Lecture Notes in
Computer Science 1663, (1999) 1-12.
J. BLÖMER, J.-P. SEIFERT,
On the Complexity of Computing Short Linearly Independent Vectors
and Short Bases in a Lattice, in Proc. 31 Annual ACM Symposium on Theory of
Computing, (1999) 711-720.
M. HOFFMANN,
A Simple Linear Algorithm for Computing Rectangular 3-Centers, in
Proc. 11th Canadian Conference on Computational Geometry, (1999) 72-75.
B. GÄRTNER,
Fast and robust smallest enclosing balls, in Proc. of 7th Annual European
Symposium on Algorithms (ESA), Lecture Notes in Computer Science 1643,
(1999) 325-338.
J. GIESEN,
Curve Reconstruction in Arbitrary Dimension and the Traveling Salesman Problem,
in Proc. of 8th Discrete Geometry and Computational Imagery, Lecture
Notes in Computer Science 1568, (1999) 164-176.
J. GIESEN, Curve Reconstruction, the Traveling Salesman Problem and Menger's Theorem on Length, in Proc. of 15th ACM Symposium on Computational Geometry, (1999) 207-216.
A. ANDRZEJAK,
Kryptoregulierung, in
Rechtsfragen der Informationsgesellschaft,
Thomas Hoeren und Robert Queck (Hrsg),
(Grundlagen und Praxis des Wirtschaftsrechts Band 17),
Erich Schmidt Verlag Berlin, (1999) 132-145.
B. GÄRTNER,
Ein Reinfall mit Computer-Zufallszahlen, Mitteilungen der DMV, 1999,
Ausgabe 2, (1999) 56-60.
G. KAROLYI, E. WELZL,
Crossing-free segments and triangles in point configurations,
in Proc. 1st Japanese-Hungarian Symp. on
Discrete Math. and Its Appl., (1999) 265-272.
A. ANDRZEJAK,
An algorithm for the Tutte polynomials of graphs of bounded treewidth,
Discrete Mathematics 190, 1998, 39-54.
B. GÄRTNER, S. SCHÖNHERR,
Exact primitives for smallest enclosing ellipses,
Information Processing Letters 68, 1998, 33-38.
B. GÄRTNER, M. HENK, G. M. ZIEGLER,
Randomized simplex algorithms on Klee-Minty cubes,
Combinatorica 18, 1998, 349-372.
O. SCHWARZKOPF, U. FUCHS, G. ROTE, E. WELZL,
Approximation of convex figures by pairs of rectangles,
Computational Geometry - Theory and Applications 10, 1998,
77-87.
P.K. AGARWAL, M. SHARIR, E. WELZL,
The discrete 2-center problem,
Discrete Comput. Geom. 20, 1998, 287-305.
L.P. CHEW, K. KEDEM, M. SHARIR, B. TAGANSKY, E. WELZL,
Voronoi diagrams of lines in three dimensions under a polyhedral convex
distance function,
J. Algorithms 29, 1998, 238-255.
A. ANDRZEJAK, B. ARONOV, S. HAR-PELED, R. SEIDEL, E. WELZL,
Results on k-sets and j-facets via continuous motions,
in Proc. 14th Annual ACM Symposium on Computational Geometry (SoCG
'98), 1998, 192-199.
J. BLÖMER,
A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,
in Proc. 6th Annual European Symposium on Algorithms (ESA '98), 1998,
159-162.
B. GÄRTNER, Exact Arithmetic at Low Cost - A Case Study in Linear
Programming, in Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA), 1998, 157-166.
B. GÄRTNER, Combinatorial Linear Programming: Geometry can Help,
in Proc. 2nd International Workshop on
Randomization and Approximation Techniques in Computer
Science (RANDOM`98), Lecture Notes in Computer Science 1518,
1998, 82-96.
L. KETTNER,
Designing a Polyhedral Surface Data Structure in C++,
in Proc. 14th Annual ACM Symposium on Computational Geometry (SoCG
'98), 1998, 146-154.
H.-M. WILL,
Fast and Efficient Computation of Additively Weighted
Voronoi Cells for Applications in Molecular Biology,
in Proc. of the 6th Scandinavian Workshop on Algorithms Theory
(SWAT'98), Lecture Notes in Computer Science 1432, 1998,
310-311.
A. ANDRZEJAK,
Introduction to randomized algorithms,
Lecture Notes in Computer Science 1367, 1998, 29-39.
A. ANDRZEJAK, E. WELZL,
Halving point sets,
Documenta Mathematica, Extra Volume ICM 98, Proceedings of the
International Congress of Mathematicians Berlin, 1998, Vol. III, 471-478.
J. GIESEN,
Electric dipole moments of elementary particles and irreducible
representations of the poincare group,
Photon and Poincare Group, Valeri Dvoeglazov Editor,
Nova Science Publisher, 1998.
L. KETTNER, E. WELZL,
One sided error predicates in geometric computing,
in Proc. 15th IFIP World Computer Congress, Fundamentals - Foundations
of Computer Science (K. Mehlhorn, Ed.), 1998, 13-26.
308
H. BRÖNNIMANN, L. KETTNER, S. SCHIRRA, R. VELTKAMP, Applications of the
Generic Programming Paradigm in the Design of CGAL (1998).
302
H.-M. WILL, Geometric Properties of Spatial Additively Weighted Voronoi
Cells (1998).
300
H.-M. WILL, Practical and Efficient Computation of Additively Weighted Voronoi
Cells for Applications in Molecular Biology (1998).
299
J. BLÖMER, A Probabilistic Zero-Test for Expressions Involving Roots of
Rational Numbers (1998).
298
J. BLÖMER, B. TRACHSLER, A Lower Bound for a Class of Graph Based
Loss-Resilient Codes (1998).
296
B. GÄRTNER, V. KAIBEL, Abstract Objective Function Graphs on the
3-cube - A Classification by Realizability (1998).
291
B. FABRI, G.-J. GIEZEMAN, L. KETTNER, S. SCHIRRA, S. SCHÖNHERR, On the Design
of CGAL, the Computational Geometry Algorithms Library (1998).
283
B.GÄRTNER, Exact Arithmetic at Low Cost - A Case Study in Linear Programming
(1998).
A. ANDRZEJAK,
Splitting formulas for Tutte polynomials,
Journal of Combinatorial Theory Series B 70, 1997, 346-366.
T. ASANO, D. RANJAN, T. ROOS, E. WELZL, P. WIDMAYER,
Space filling curves and their use in the design of geometric data structures,
Theoretical Computer Science 181, 1997, 3-15.
J. BLÖMER, R. KARP, E. WELZL,
The rank of sparse random matrices over finite
fields, Random Structures and Algorithms 10, 1997, 407-419.
M. T. DICKERSON, R.L.S. DRYSDALE, S.A. McELFRESH, E. WELZL,
Fast greedy triangulation algorithms, Computational Geometry -
Theory and Applications 8, 1997, 67-86.
H. EDELSBRUNNER, P. VALTR, E. WELZL, Cutting dense point sets in half,
Discrete Comput. Geom. 17, 1997, 243-255.
B. VON STENGEL, D. KOLLER,
Team-maxmin equilibria.
Games and Economic Behavior 21, 1997, 309-321.
B. VON STENGEL, R. WERCHNER,
Complexity of searching an immobile hider in a graph,
Discrete Applied Mathematics 78, 1997, 235-249.
P. AGARWAL, M. SHARIR, E. WELZL, The discrete 2-center problem,
in "Proc. 13th Annual ACM Symposium on Computational Geometry",
1997, 147-155.
J. BLÖMER, Denesting by bounded degree radicals, in "Proc. 5th Annual
European Symposium on Algorithms", 1997, 53-63.
L. KETTNER, E. WELZL,
Contour Edge Analysis for Polyhedron Projections,
Geometric Modeling: Theory and Practice, (W. Strasser, R. Klein, R. Rau,
Eds.), (1997) 379-394,
Focus in Computer Graphics, Springer Verlag.
E. V. DUBROVA, J. C. MUZIO, B. VON STENGEL, Finding composition trees for multiple-valued functions, in Proc. 27th IEEE International Symposium on Multiple Valued Logic, 1997, 19-26.
H. ALT, B. WOLFERS, E. WELZL, Piecewise linear approximations of
Bézier-curves, communication, "Proc. 13th Annual ACM Symposium on
Computational Geometry", 1997, 433-435.
B. GÄRTNER, S. SCHÖNHERR, Exact Primitives for Smallest
Enclosing Ellipses, communication, "Proc. 13. Annual ACM Symposium on
Computational Geometry", 1997, 430-432.
264
B. VON STENGEL, New Lower Bounds for the Number of Equilibria in
Bimatrix Games (1997).
273
J. BLÖMER, Denesting by Bounded Degree Radicals (1997).
278
L. KETTNER, Designing a Data Structure for Polyhedral Surfaces (1997).
A. ALBANESE J. BLÖMER, J. EDMONDS, M. LUBY, M. SUDAN,
Priority Encoding Transmission, IEEE Transactions on Information
Theory 42, 1996, 1737-1744.
R. AVENHAUS, M. D. CANTY, D. M. KILGOUR, B. VON STENGEL, S. ZAMIR,
Invited review: ``Inspection games in arms control'',
European Journal of Operational Research 90, 1996,
383-394.
B. VON STENGEL,
Efficient computation of behavior strategies,
Games and Economic Behavior 14, 1996, 220-246.
D. KOLLER, N. MEGIDDO, B. VON STENGEL,
Efficient computation of equilibria for extensive two-person games,
Games and Economic Behavior 14, 1996, 247-259.
J. MATOUSEK, M. SHARIR, E. WELZL,
A subexponential bound for linear programming, Algorithmica 16,
1996, 498-516.
ANDREAS FABRI, GEERT-JAN GIEZEMAN, LUTZ KETTNER, STEFAN SCHIRRA, SVEN
SCHÖNHERR, The CGAL Kernel: A Basis for Geometric Computation,
ACM Workshop on Applied Computational Geometry, Philadelphia,
Pennsylvenia, 27.-28. Mai 1996, ed. M. C. Lin and D. Manocha, 1996,
191-202 (Lecture Notes in Computer Science 1148).
MICHA SHARIR, EMO WELZL, Rectilinear and Polygonal p-Piercing and
p-Center Problems, ``Proc. 12th Annual ACM Symposium on Computational
Geometry'', 1996, 122-132.
B. VON STENGEL, A. H. VAN DENELZEN, A. J. J. TALMAN
Tracing equilibria in extensive games by complementary pivoting.
Discussion paper Nr. 9686, Center for Economic Research, Universität
Tilburg, 1996, 30 Seiten.
EMO WELZL, BERND GÄRTNER, Linear Programming - Randomization and
Abstract Frameworks, ``Proc. 13th Annual Symp. on Theoretical Aspects of
Computer Sci.'', 1996, 669-688 (Lecture Notes in Computer Science
1046).
EMO WELZL, Suchen und Konstruieren durch Verdoppeln, in Highlights
der Informatik (Ingo Wegener, Hrsg.), Springer, 1996, 221-228.
253
B. VON STENGEL, Computing equilibria for two-person games (1996),
62 Seiten. Eingeladener Beitrag zum Handbook of Game Theory, erscheint
in Band 3, Hrsg. R. J. Aumann und S. Hart, North-Holland, Amsterdam.
257
J. BLÖMER, R. KARP, E. WELZL, The Rank of
Sparse Random Matrices over Finite Fields.
258
LUTZ KETTNER, EMO WELZL, Contour Edge Analysis
for Polyhedron Projections.