Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristiane Schmidt 0001
Person information
- affiliation: Linköping University / Campus Norrköping, Sweden
- affiliation: Hebrew University of Jerusalem, The Rachel and Selim Benin School of Computer Science and Engineering, Israel
- affiliation: TU Braunschweig, Institute of Operating Systems and Computer Networks, Germany
Other persons with the same name
- Christiane Schmidt — disambiguation page
- Christiane Schmidt 0002 — RWTH Aachen
- Christiane Schmidt 0003 — University of Hanover, Hannover, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Omrit Filtser
, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Guarding Polyominoes Under k-Hop Visibility. LATIN (1) 2024: 288-302- 2023
- [j16]Erik D. Demaine, Maarten Löffler, Christiane Schmidt:
Rectangular Spiral Galaxies are still hard. Comput. Geom. 110: 101949 (2023) - [c24]Bengt J. Nilsson, Christiane Schmidt:
k-Transmitter Watchman Routes. WALCOM 2023: 202-213 - [i18]Omrit Filtser, Erik Krohn, Bengt J. Nilsson, Christian Rieck, Christiane Schmidt:
Minimum k-Hop Dominating Sets in Grid Graphs. CoRR abs/2308.00334 (2023) - 2022
- [j15]Eulalia Hernández-Romero, Billy Josefsson, Anastasia Lemetti, Tatiana Polishchuk, Christiane Schmidt:
Integrating weather impact in air traffic controller shift scheduling in remote and conventional towers. EURO J. Transp. Logist. 11: 100076 (2022) - [c23]Erik Krohn, Bengt J. Nilsson, Christiane Schmidt:
Opposing Half Guards. CCCG 2022: 219-226 - [i17]Bengt J. Nilsson, Christiane Schmidt:
k-Transmitter Watchman Routes. CoRR abs/2202.01757 (2022) - [i16]Erik Krohn, Bengt J. Nilsson, Christiane Schmidt:
Opposing Half Guards. CoRR abs/2207.04474 (2022) - 2021
- [j14]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding polyominoes with holes into a cube. Comput. Geom. 93: 101700 (2021) - [j13]Fredrik Ljunggren, Kristian Persson, Anders Peterson, Christiane Schmidt:
Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path. Public Transp. 13(3): 597-623 (2021) - [c22]Hugo A. Akitaya, Brad Ballinger, Erik D. Demaine, Thomas C. Hull, Christiane Schmidt:
Folding Points to a Point and Lines to a Line. CCCG 2021: 271-278 - [i15]Erik D. Demaine, Maarten Löffler, Christiane Schmidt:
Rectangular Spiral Galaxies are Still Hard. CoRR abs/2110.00058 (2021) - 2020
- [j12]Valentin Polishchuk, Christiane Schmidt:
Special Issue on the 33rd European Workshop on Computational Geometry, Guest Editors' Foreword. Comput. Geom. 87: 101590 (2020)
2010 – 2019
- 2019
- [j11]Ovidiu Daescu, Stephan Friedrichs, Hemant Malik, Valentin Polishchuk, Christiane Schmidt:
Altitude terrain guarding and guarding uni-monotone polygons. Comput. Geom. 84: 22-35 (2019) - [c21]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CCCG 2019: 164-170 - [i14]Oswin Aichholzer, Hugo A. Akitaya, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt:
Folding Polyominoes with Holes into a Cube. CoRR abs/1910.09917 (2019) - 2018
- [j10]Sarah Cannon, Thomas G. Fai, Justin Iwerks, Undine Leopold, Christiane Schmidt:
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. Comput. Geom. 68: 89-100 (2018) - [j9]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. Int. J. Comput. Geom. Appl. 28(3): 197-226 (2018) - [i13]Stephan Friedrichs, Valentin Polishchuk, Christiane Schmidt:
Altitude Terrain Guarding and Guarding Uni-Monotone Polygons. CoRR abs/1803.05893 (2018) - 2017
- [j8]Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
Algorithms for art gallery illumination. J. Glob. Optim. 68(1): 23-45 (2017) - [j7]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing nonsimple polygons of minimum perimeter. J. Comput. Geom. 8(1): 340-365 (2017) - [i12]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. CoRR abs/1712.09317 (2017) - 2016
- [j6]Stephan Friedrichs, Michael Hemmer, James King, Christiane Schmidt:
The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS. J. Comput. Geom. 7(1): 256-284 (2016) - [c20]Tobias Andersson Granberg, Tatiana Polishchuk, Valentin Polishchuk, Christiane Schmidt:
Automatic Design of Aircraft Arrival Routes with Limited Turning Angle. ATMOS 2016: 9:1-9:13 - [c19]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. SEA 2016: 134-149 - [r1]Michael Hemmer, Christiane Schmidt:
Convex Hulls. Encyclopedia of Algorithms 2016: 446-449 - [i11]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. CoRR abs/1603.07077 (2016) - [i10]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games. CoRR abs/1607.01826 (2016) - 2015
- [j5]Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. Algorithmica 73(2): 411-440 (2015) - [c18]Aviv Adler, Michael Biro, Erik D. Demaine, Mikhail Rudoy, Christiane Schmidt:
Computational complexity of numberless Shakashaka. CCCG 2015 - [c17]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. CCCG 2015 - [c16]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - [i9]Sarah Cannon, Thomas G. Fai, Justin Iwerks, Undine Leopold, Christiane Schmidt:
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. CoRR abs/1503.05681 (2015) - [i8]Stephan Friedrichs, Michael Hemmer, Christiane Schmidt:
The Continuous 1.5D Terrain Guarding Problem: Discretization, Optimal Solutions, and PTAS. CoRR abs/1509.08285 (2015) - 2014
- [c15]Sándor P. Fekete, Stephan Friedrichs, Michael Hemmer, Joseph S. B. Mitchell, Christiane Schmidt:
On the Chromatic Art Gallery Problem. CCCG 2014 - [c14]Stephan Friedrichs, Michael Hemmer, Christiane Schmidt:
A PTAS for the Continuous 1.5D Terrain Guarding Problem. CCCG 2014 - [i7]Stephan Friedrichs, Michael Hemmer, Christiane Schmidt:
A PTAS for the continuous 1.5D Terrain Guarding Problem. CoRR abs/1405.6564 (2014) - [i6]Maximilian Ernestus, Stephan Friedrichs, Michael Hemmer, Jan Kokemüller, Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
Algorithms for Art Gallery Illumination. CoRR abs/1410.5952 (2014) - 2013
- [c13]Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. COCOON 2013: 208-220 - [c12]Aaron T. Becker, Sándor P. Fekete, Alexander Kröller, SeoungKyou Lee, James McLurkin, Christiane Schmidt:
Triangulating unknown environments using robot swarms. SoCG 2013: 345-346 - [c11]Dorit Borrmann, Pedro J. de Rezende, Cid C. de Souza, Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Andreas Nüchter, Christiane Schmidt, Davi C. Tozoni:
Point guards and point clouds: solving general art gallery problems. SoCG 2013: 347-348 - [c10]Alexander Kröller, Mahdi Moeini, Christiane Schmidt:
A Novel Efficient Approach for Solving the Art Gallery Problem. WALCOM 2013: 5-16 - [c9]Sándor P. Fekete, Sophia Rex, Christiane Schmidt:
Online Exploration and Triangulation in Orthogonal Polygonal Regions. WALCOM 2013: 29-40 - [i5]Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. CoRR abs/1308.4670 (2013) - 2012
- [j4]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum covering with travel cost. J. Comb. Optim. 24(1): 32-51 (2012) - [j3]Alexander Kröller, Tobias Baumgartner, Sándor P. Fekete, Christiane Schmidt:
Exact solutions and bounds for general art gallery problems. ACM J. Exp. Algorithmics 17(1) (2012) - 2011
- [b1]Christiane Schmidt:
Algorithms for mobile agents with limited capabilities. University of Braunschweig - Institute of Technology, 2011, ISBN 978-3-86955-829-5, pp. 1-151 - [c8]Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt:
Exploring and Triangulating a Region by a Swarm of Robots. APPROX-RANDOM 2011: 206-217 - [i4]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum Covering with Travel Cost. CoRR abs/1101.2360 (2011) - 2010
- [j2]Sándor P. Fekete, Christiane Schmidt:
Polygon exploration with time-discrete vision. Comput. Geom. 43(2): 148-168 (2010) - [j1]Sándor P. Fekete, Christiane Schmidt, Axel Wegener, Horst Hellbrück, Stefan Fischer:
Empowered by wireless communication: Distributed methods for self-organizing traffic collectives. ACM Trans. Auton. Adapt. Syst. 5(3): 11:1-11:30 (2010) - [c7]Tobias Baumgartner, Sándor P. Fekete, Alexander Kröller, Christiane Schmidt:
Exact Solutions and Bounds for General Art Gallery Problems. ALENEX 2010: 11-22 - [i3]Sándor P. Fekete, Christiane Schmidt, Axel Wegener, Horst Hellbrück, Stefan Fischer:
Empowered by Wireless Communication: Self-Organizing Traffic Collectives. CoRR abs/1005.0675 (2010)
2000 – 2009
- 2009
- [c6]Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach, Christiane Schmidt:
Distributed vision with smart pixels. SCG 2009: 257-266 - [c5]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum Covering with Travel Cost. ISAAC 2009: 393-402 - [c4]Axel Wegener, Horst Hellbrück, Stefan Fischer, Björn Hendriks, Christiane Schmidt, Sándor P. Fekete:
Designing a Decentralized Traffic Information System - AutoNomos. KiVS 2009: 309-315 - 2008
- [c3]Marcus Komann, Alexander Kröller, Christiane Schmidt, Dietmar Fey, Sándor P. Fekete:
Emergent algorithms for centroid and orientation detection in high-performance embedded cameras. Conf. Computing Frontiers 2008: 221-230 - [i2]Sándor P. Fekete, Christiane Schmidt:
Polygon Exploration with Discrete Vision. CoRR abs/0807.2358 (2008) - 2007
- [c2]Axel Wegener, Horst Hellbrück, Stefan Fischer, Christiane Schmidt, Sándor P. Fekete:
AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems. VTC Fall 2007: 1947-1951 - 2006
- [c1]Sándor P. Fekete, Christiane Schmidt, Axel Wegener, Stefan Fischer:
Recognizing Traffic Jams with Hovering Data Clouds. ISoLA 2006: 198-203 - [i1]Sándor P. Fekete, Christiane Schmidt:
Polygon Exploration with Discrete Vision. Robot Navigation 2006
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
