Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
André Schulz
2010 – today
- 2013
[j11]Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow: Bounded-degree polyhedronization of point sets. Comput. Geom. 46(2): 148-153 (2013)- [j10]André Schulz, Csaba D. Tóth: The union of colorful simplices spanned by a colored point set. Comput. Geom. 46(5): 574-590 (2013)
- [j9]Moria Ben-Ner, André Schulz, Adam Sheffer: On numbers of pseudo-triangulations. Comput. Geom. 46(6): 688-699 (2013)
- [j8]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz: Memory-constrained algorithms for simple polygons. Comput. Geom. 46(8): 959-969 (2013)
- [c26]Dominik Wodniok, André Schulz, Sven Widmer, Michael Goesele: Analysis of Cache Behavior and Performance of Different BVH Memory Layouts for Tracing Incoherent Rays. EGPGV 2013: 57-64
- [c25]Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, Andrew Winslow: Algorithms for Designing Pop-Up Cards. STACS 2013: 269-280
- [i7]Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff: Multi-Sided Boundary Labeling. CoRR abs/1305.0750 (2013)
- 2012
- [j7]Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber: Pointed drawings of planar graphs. Comput. Geom. 45(9): 482-494 (2012)
- [j6]Immanuel Halupczok, André Schulz: Pinning balloons with perfect angles and optimal area. J. Graph Algorithms Appl. 16(4): 847-870 (2012)
- [j5]Martin Fink, Jan-Henrik Haunert, André Schulz, Joachim Spoerhase, Alexander Wolff: Algorithms for Labeling Focus Regions. IEEE Trans. Vis. Comput. Graph. 18(12): 2583-2592 (2012)
- [c24]André Schulz, Christian Saul: Adaptive e-Assessment Application Scenario - A Framework and Concept for the Integration of askme! in Higher Education. CSEDU (2) 2012: 132-137
- [c23]Klaus P. Jantke, Jun Fujima, Oksana Arnold, André Schulz: Memetic Communication Media - Concepts, Technologies, Applications. ICME Workshops 2012: 260-265
- [i6]Moria Ben-Ner, André Schulz, Adam Sheffer: On Numbers of Pseudo-Triangulations. CoRR abs/1210.7126 (2012)
- 2011
- [j4]Ares Ribó Mor, Günter Rote, André Schulz: Small Grid Embeddings of 3-Polytopes. Discrete & Computational Geometry 45(1): 65-87 (2011)
- [j3]André Schulz: Drawing 3-Polytopes with Good Vertex Resolution. J. Graph Algorithms Appl. 15(1): 33-52 (2011)
- [c22]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Vida Dujmovic, Ferran Hurtado, Anna Lubiw, Günter Rote, André Schulz, Diane L. Souvaine, Andrew Winslow: Convexifying Polygons Without Losing Visibilities. CCCG 2011
- [c21]André Schulz, Merlin Becker: Old School Meets New School: The Adaptive School Book Approach - Adaptivity Extends Conventional School Books with Digital Media. CSEDU (1) 2011: 130-139
- [c20]Klaus P. Jantke, André Schulz: Adaptivity in Moodle beyond the Limits of Adaptivity in Moodle. CSEDU (1) 2011: 418-421
- [c19]Immanuel Halupczok, André Schulz: Pinning Balloons with Perfect Angles and Optimal Area. Graph Drawing 2011: 154-165
- [c18]Erik D. Demaine, André Schulz: Embedding Stacked Polytopes on a Polynomial-Size Grid. SODA 2011: 1177-1187
- [c17]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth: Bounds on the maximum multiplicity of some common geometric graphs. STACS 2011: 637-648
- [i5]Immanuel Halupczok, André Schulz: Pinning Balloons with Perfect Angles and Optimal Area. CoRR abs/1109.1705 (2011)
- [i4]Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer, Günter Rote, André Schulz: Memory-Constrained Algorithms for Simple Polygons. CoRR abs/1112.5904 (2011)
- 2010
- [c16]Gill Barequet, Nadia Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow: Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102
- [c15]André Schulz, Csaba D. Tóth: The Union of Colorful Simplices Spanned by a Colored Point Set. COCOA (1) 2010: 324-338
- [c14]Christoph Vogler, André Schulz, Andrea Hofmann: Does Anybody Need Help? Pupils and Teachers in Harmony - Creating an Adaptive Visualisation-module for Teachers to Support their Scheduling and Teaching Processes. CSEDU (2) 2010: 446-450
- [c13]Kevin Buchin, Maike Buchin, André Schulz: Fréchet Distance of Surfaces: Some Simple Hard Cases. ESA (2) 2010: 63-74
- [c12]Kevin Buchin, André Schulz: On the Number of Spanning Trees a Planar Graph Can Have. ESA (1) 2010: 110-121
- [i3]Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth: Bounds on the maximum multiplicity of some common geometric graphs. CoRR abs/1012.5664 (2010)
2000 – 2009
- 2009
- [j2]Oswin Aichholzer, Thomas Hackl, David Orden, Pedro Ramos, Günter Rote, André Schulz, Bettina Speckmann: Flip Graphs of Bounded-Degree Triangulations. Electronic Notes in Discrete Mathematics 34: 509-513 (2009)
- [c11]
- [c10]
- [i2]Ares Ribó Mor, Günter Rote, André Schulz: Small grid embeddings of 3-polytopes. CoRR abs/0908.0488 (2009)
- 2008
- [c9]Christian Wojek, Gyuri Dorkó, André Schulz, Bernt Schiele: Sliding-Windows for Rapid Object Class Localization: A Parallel Technique. DAGM-Symposium 2008: 71-81
- 2007
- [c8]Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian: On Rolling Cube Puzzles. CCCG 2007: 141-144
- [c7]Oswin Aichholzer, Günter Rote, André Schulz, Birgit Vogtenhuber: Pointed Drawings of Planar Graphs. CCCG 2007: 237-240
- [c6]Kevin Buchin, Christian Knauer, Klaus Kriegel, André Schulz, Raimund Seidel: On the Number of Cycles in Planar Graphs. COCOON 2007: 97-107
- [c5]Ares Ribó Mor, Günter Rote, André Schulz: Embedding 3-polytopes on a small grid. Symposium on Computational Geometry 2007: 112-118
- [c4]Kevin Buchin, André Schulz: Inflating the cube by shrinking. Symposium on Computational Geometry 2007: 125-126
- 2006
- [j1]Günter Rote, André Schulz: Threshold arrangements and the knapsack problem. Appl. Math. Lett. 19(1): 108-112 (2006)
- 2005
- [c3]
- [i1]Günter Rote, André Schulz: A pointed Delaunay pseudo-triangulation of a simple polygon. EuroCG 2005: 77-80
- 2001
- [c2]
- 2000
- [c1]André Schulz, Benno Stein, A. Kurzok: On automated design in chemical engineering. KES 2000: 261-266
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-06 20:13 CEST by the dblp team