default search action
Jules Wulms
Person information
- affiliation: TU Eindhoven, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. SoCG 2024: 19:1-19:16 - [c18]Sarita de Berg
, Nathan van Beusekom, Max van Mulken, Kevin Verbeek, Jules Wulms:
Competitive Searching over Terrains. LATIN (1) 2024: 254-269 - [c17]Nathan van Beusekom, Marc J. van Kreveld, Max van Mulken, Marcel Roeloffzen, Bettina Speckmann, Jules Wulms:
Capturing the Shape of a Point Set with a Line Segment. MFCS 2024: 26:1-26:18 - [c16]Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms:
Minimizing Corners in Colored Rectilinear Grids. WALCOM 2024: 134-148 - [i21]Sarita de Berg, Nathan van Beusekom, Max van Mulken, Kevin Verbeek
Competitive Searching over Terrains. CoRR abs/2401.01289 (2024) - [i20]Sarita de Berg, Tim Ophelders, Irene Parada, Frank Staals, Jules Wulms:
The Complexity of Geodesic Spanners using Steiner Points. CoRR abs/2402.12110 (2024) - [i19]Nathan van Beusekom, Marc J. van Kreveld, Max van Mulken, Marcel Roeloffzen, Bettina Speckmann, Jules Wulms:
Capturing the Shape of a Point Set with a Line-Segment. CoRR abs/2402.12285 (2024) - [i18]Maarten Löffler, Tamara Mchedlidze, David Orden, Josef Tkadlec, Jules Wulms:
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4. CoRR abs/2402.12357 (2024) - [i17]Annika Bonerath, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger, Jules Wulms:
On Orbital Labeling with Circular Contours. CoRR abs/2403.19052 (2024) - 2023
- [j3]Sujoy Bhore
Worbel: Aggregating Point Labels into Word Clouds. ACM Trans. Spatial Algorithms Syst. 9(3): 19:1-19:32 (2023) - [c15]Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms:
The Influence of Dimensions on the Complexity of Computing Decision Trees. AAAI 2023: 8343-8350 - [c14]Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Transitions in Dynamic Point Labeling. GIScience 2023: 2:1-2:19 - [i16]Alexander Dobler, Martin Nöllenburg, Daniel Stojanovic, Anaïs Villedieu, Jules Wulms:
Crossing Minimization in Time Interval Storylines. CoRR abs/2302.14213 (2023) - [i15]Sujoy Bhore, Martin Nöllenburg, Csaba D. Tóth, Jules Wulms:
Fully Dynamic Maximum Independent Sets of Disks in Polylogarithmic Update Time. CoRR abs/2308.00979 (2023) - [i14]Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms:
Minimizing Corners in Colored Rectilinear Grids. CoRR abs/2311.14134 (2023) - 2022
- [c13]Willem Sonke, Jules Wulms:
An Interactive Framework for Reconfiguration in the Sliding Square Model (Media Exposition). SoCG 2022: 70:1-70:4 - [c12]Martin Nöllenburg
Planarizing Graphs and Their Drawings by Vertex Splitting. GD 2022: 232-246 - [c11]Hugo A. Akitaya
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares. SWAT 2022: 4:1-4:19 - [i13]Thomas Depian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Transitions in Dynamic Map Labeling. CoRR abs/2202.11562 (2022) - [i12]Soeren Nickel, Martin Nöllenburg, Manuel Sorge, Anaïs Villedieu, Hsiang-Yun Wu, Jules Wulms:
Planarizing Graphs and their Drawings by Vertex Splitting. CoRR abs/2202.12293 (2022) - [i11]Stephen G. Kobourov, Maarten Löffler, Fabrizio Montecchiani, Marcin Pilipczuk, Ignaz Rutter, Raimund Seidel, Manuel Sorge, Jules Wulms:
The Influence of Dimensions on the Complexity of Computing Decision Trees. CoRR abs/2205.07756 (2022) - 2021
- [j2]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek
Topological stability of kinetic k-centers. Theor. Comput. Sci. 866: 145-159 (2021) - [c10]Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek
Stable Visual Summaries for Trajectory Collections. PacificVis 2021: 61-70 - [c9]Martin Nöllenburg
Layered Area-Proportional Rectangle Contact Representations. GD 2021: 318-326 - [c8]Sujoy Bhore, Robert Ganian, Guangping Li
Worbel: Aggregating Point Labels into Word Clouds. SIGSPATIAL/GIS 2021: 256-267 - [i10]Irina Kostitsyna, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms:
Compacting Squares. CoRR abs/2105.07997 (2021) - [i9]Martin Nöllenburg, Anaïs Villedieu, Jules Wulms:
Layered Area-Proportional Rectangle Contact Representations. CoRR abs/2108.10711 (2021) - [i8]Sujoy Bhore, Robert Ganian, Guangping Li, Martin Nöllenburg, Jules Wulms:
Worbel: Aggregating Point Labels into Word Clouds. CoRR abs/2109.04368 (2021) - 2020
- [j1]Bart M. P. Jansen
Lower bounds for protrusion replacement by counting equivalence classes. Discret. Appl. Math. 278: 12-27 (2020) - [c7]Tillmann Miltzow, Irene Parada
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). SoCG 2020: 78:1-78:5
2010 – 2019
- 2019
- [c6]Ivor van der Hoog, Marc J. van Kreveld
Topological Stability of Kinetic k-centers. WALCOM 2019: 43-55 - [i7]Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Stability analysis of kinetic orientation-based shape descriptors. CoRR abs/1903.11445 (2019) - [i6]Jules Wulms, Juri Buchmüller, Wouter Meulemans, Kevin Verbeek, Bettina Speckmann:
Spatially and Temporally Coherent Visual Summaries. CoRR abs/1912.00719 (2019) - 2018
- [c5]Wouter Meulemans, Bettina Speckmann
A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs. LATIN 2018: 805-819 - [i5]Ivor van der Hoog, Marc J. van Kreveld, Wouter Meulemans, Kevin Verbeek, Jules Wulms:
Topological Stability of Kinetic k-Centers. CoRR abs/1810.00794 (2018) - 2017
- [c4]Arthur van Goethem, Irina Kostitsyna
The Painter's Problem: Covering a Grid with Colored Connected Polygons. GD 2017: 492-505 - [i4]Wouter Meulemans, Bettina Speckmann, Kevin Verbeek, Jules Wulms:
A Framework for Algorithm Stability. CoRR abs/1704.08000 (2017) - [i3]Arthur van Goethem, Irina Kostitsyna, Marc J. van Kreveld, Wouter Meulemans, Max Sondag, Jules Wulms:
The Painter's Problem: covering a grid with colored connected polygons. CoRR abs/1709.00001 (2017) - 2016
- [c3]Kevin Buchin
Geo word clouds. PacificVis 2016: 144-151 - [c2]Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. IPEC 2016: 17:1-17:12 - [i2]Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. CoRR abs/1609.09304 (2016) - 2015
- [i1]Bogdan Vasilescu, Stef van Schuylenburg, Jules Wulms, Alexander Serebrenik, Mark G. J. van den Brand:
Continuous integration in a social-coding world: Empirical evidence from GitHub. **Updated version with corrections*. CoRR abs/1512.01862 (2015) - 2014
- [c1]Bogdan Vasilescu
Continuous Integration in a Social-Coding World: Empirical Evidence from GitHub. ICSME 2014: 401-405
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-08-27 22:01 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: