default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSander Verdonschot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot:
Weight balancing on boundaries. J. Comput. Geom. 13(1): 1-12 (2022)- 2021
- [j20]Sander Verdonschot
:
Flipping in spirals. Comput. Geom. 95: 101729 (2021) - [j19]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained routing between non-visible vertices. Theor. Comput. Sci. 861: 144-154 (2021) - 2020
- [j18]Prosenjit Bose, Valentin Gledel, Claire Pennarun, Sander Verdonschot:
Power domination on triangular grids with triangular and hexagonal shape. J. Comb. Optim. 40(2): 482-500 (2020) - [j17]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex polygons in cartesian products. J. Comput. Geom. 11(2): 205-233 (2020)
2010 – 2019
- 2019
- [j16]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. Algorithmica 81(4): 1319-1341 (2019) - [j15]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. Algorithmica 81(4): 1392-1415 (2019) - [j14]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. Graphs Comb. 35(2): 437-450 (2019) - [c30]Sander Verdonschot:
Flipping in Spirals. CCCG 2019: 257-262 - [c29]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. SoCG 2019: 22:1-22:17 - [c28]Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot:
Reconstructing a Convex Polygon from Its \omega ω -cloud. CSR 2019: 25-37 - 2018
- [j13]Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao graphs. Comput. Geom. 67: 42-52 (2018) - [j12]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping edge-labelled triangulations. Comput. Geom. 68: 309-326 (2018) - [j11]Prosenjit Bose, Matias Korman, Sander Verdonschot, André van Renssen:
Routing on the visibility graph. J. Comput. Geom. 9(1): 430-453 (2018) - [c27]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. SWAT 2018: 14:1-14:12 - [i24]Prosenjit Bose, Jean-Lou De Carufel, Elena Khramtcova, Sander Verdonschot:
Reconstructing a convex polygon from its ω-cloud. CoRR abs/1801.02162 (2018) - [i23]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Routing on the Visibility Graph. CoRR abs/1803.02979 (2018) - [i22]Ahmad Biniaz, Prosenjit Bose, Aurélien Ooms, Sander Verdonschot:
Improved Bounds for Guarding Plane Graphs with Edges. CoRR abs/1804.07150 (2018) - [i21]Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, Sander Verdonschot:
Convex Polygons in Cartesian Products. CoRR abs/1812.11332 (2018) - 2017
- [j10]Prosenjit Bose, Sander Verdonschot:
Flips in edge-labelled pseudo-triangulations. Comput. Geom. 60: 45-54 (2017) - [j9]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive local routing with constraints. J. Comput. Geom. 8(1): 125-152 (2017) - [c26]Prosenjit Bose, Claire Pennarun, Sander Verdonschot:
Power Domination on Triangular Grids. CCCG 2017: 2-6 - [c25]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained Routing Between Non-Visible Vertices. COCOON 2017: 62-74 - [c24]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Routing on the Visibility Graph. ISAAC 2017: 18:1-18:12 - [c23]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. WADS 2017: 97-108 - [i20]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. CoRR abs/1704.03596 (2017) - [i19]Prosenjit Bose, Claire Pennarun, Sander Verdonschot:
Power domination on triangular grids. CoRR abs/1707.02760 (2017) - [i18]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. CoRR abs/1708.09080 (2017) - [i17]Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot:
Constrained Routing Between Non-Visible Vertices. CoRR abs/1710.08060 (2017) - 2016
- [j8]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci. 616: 70-93 (2016) - [c22]Therese Biedl, Carsten Grimm, Leonidas Palios, Jonathan Richard Shewchuk, Sander Verdonschot:
Realizing Farthest-Point Voronoi Diagrams. CCCG 2016: 48-56 - [c21]Therese Biedl, Anna Lubiw, Saeed Mehrabi, Sander Verdonschot:
Rectangle-of-influence triangulations. CCCG 2016: 237-243 - [c20]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. GD 2016: 519-531 - [i16]Nicolas Bonichon, Prosenjit Bose, Paz Carmi, Irina Kostitsyna, Anna Lubiw, Sander Verdonschot:
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition. CoRR abs/1608.08892 (2016) - 2015
- [j7]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ5-graph is a spanner. Comput. Geom. 48(2): 108-119 (2015) - [j6]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Reprint of: Theta-3 is connected. Comput. Geom. 48(5): 407-414 (2015) - [j5]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6(2): 19-53 (2015) - [j4]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal Local Routing on Delaunay Triangulations Defined by Empty Equilateral Triangles. SIAM J. Comput. 44(6): 1626-1649 (2015) - [c19]Prosenjit Bose, Sander Verdonschot:
Flips in Edge-Labelled Pseudo-Triangulations. CCCG 2015 - [c18]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. ISAAC 2015: 23-34 - [i15]Sander Verdonschot:
Flips and Spanners. CoRR abs/1509.02563 (2015) - [i14]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. CoRR abs/1511.04123 (2015) - [i13]Prosenjit Bose, Sander Verdonschot:
Flips in Edge-Labelled Pseudo-Triangulations. CoRR abs/1512.01485 (2015) - 2014
- [j3]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. Comput. Geom. 47(2): 187-197 (2014) - [j2]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. Comput. Geom. 47(9): 910-917 (2014) - [j1]Kevin Buchin, Bettina Speckmann, Sander Verdonschot:
On the Number of Regular Edge Labelings. Discret. Math. Theor. Comput. Sci. 16(3): 215-228 (2014) - [c17]Pat Morin, Sander Verdonschot:
On the Average Number of Edges in Theta Graphs. ANALCO 2014: 121-132 - [c16]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CCCG 2014 - [c15]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and Improved Spanning Ratios for Yao Graphs. SoCG 2014: 30 - [c14]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. SoCG 2014: 436 - [i12]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Towards Tight Bounds on Theta-Graphs. CoRR abs/1404.6233 (2014) - [i11]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CoRR abs/1404.7186 (2014) - [i10]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CoRR abs/1408.4099 (2014) - [i9]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. CoRR abs/1409.6397 (2014) - [i8]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Local Routing with Constraints. CoRR abs/1412.0760 (2014) - 2013
- [c13]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CCCG 2013 - [c12]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the Stretch Factor of the Theta-4 Graph. WADS 2013: 109-120 - [c11]Prosenjit Bose, André van Renssen, Sander Verdonschot:
On the Spanning Ratio of Theta-Graphs. WADS 2013: 182-194 - [c10]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The θ 5-Graph is a Spanner. WG 2013: 100-114 - [i7]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the stretch factor of the Theta-4 graph. CoRR abs/1303.5473 (2013) - [i6]Pat Morin, Sander Verdonschot:
On the Average Number of Edges in Theta Graphs. CoRR abs/1304.3402 (2013) - [i5]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot:
New and Improved Spanning Ratios for Yao Graphs. CoRR abs/1307.5829 (2013) - [i4]Prosenjit Bose, Anna Lubiw, Vinayak Pathak, Sander Verdonschot:
Flipping Edge-Labelled Triangulations. CoRR abs/1310.1166 (2013) - 2012
- [c9]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive Routing on a Bounded-Degree Plane Spanner. CCCG 2012: 285-290 - [c8]Prosenjit Bose, Jean-Lou De Carufel, Pat Morin, André van Renssen, Sander Verdonschot:
Optimal Bounds on Theta-Graphs: More is not Always Better. CCCG 2012: 291-296 - [c7]Kevin Buchin, Bettina Speckmann, Sander Verdonschot:
Evolution Strategies for Optimizing Rectangular Cartograms. GIScience 2012: 29-42 - [c6]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
On Plane Constrained Bounded-Degree Spanners. LATIN 2012: 85-96 - [c5]Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot:
Competitive routing in the half-θ6-graph. SODA 2012: 1319-1328 - [i3]Prosenjit Bose, Sander Verdonschot:
A History of Flips in Combinatorial Triangulations. CoRR abs/1206.0303 (2012) - [i2]Prosenjit Bose, Pat Morin, André van Renssen, Sander Verdonschot:
The theta-5-graph is a spanner. CoRR abs/1212.0570 (2012) - 2011
- [c4]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. CCCG 2011 - [c3]Prosenjit Bose, Sander Verdonschot:
A History of Flips in Combinatorial Triangulations. EGC 2011: 29-44 - [c2]Mark de Berg, Amirali Khosravi, Sander Verdonschot, Vincent van der Weele:
On Rectilinear Partitions with Minimum Stabbing Number. WADS 2011: 302-313 - [i1]Prosenjit Bose, Dana Jansens, André van Renssen, Maria Saumell, Sander Verdonschot:
Making triangulations 4-connected using flips. CoRR abs/1110.6473 (2011) - 2010
- [c1]Kevin Buchin, Bettina Speckmann, Sander Verdonschot:
Optimizing Regular Edge Labelings. GD 2010: 117-128
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-06-04 21:32 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:
