Wouter Meulemans

Available identifiers

zbMath Open meulemans.wouterWikidataQ102873140 ScholiaQ102873140MaRDI QIDQ312140

List of research outcomes

Publication	Date of Publication	Type
Graph drawing contest report	2023-08-16	Paper
Obstructing Classification via Projection	2023-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q5881544	2023-03-10	Paper
Competitive Searching for a Line on a Line Arrangement.	2022-07-21	Paper
Convex polygons in Cartesian products	2022-07-18	Paper
Graph drawing contest report	2022-07-01	Paper
Graph Drawing Contest Report	2021-12-01	Paper
Topological stability of kinetic \(k\)-centers	2021-04-14	Paper
https://portal.mardi4nfdi.de/entity/Q5854566	2021-03-17	Paper
Computing stable Demers cartograms	2020-10-26	Paper
Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary	2020-05-27	Paper
A framework for algorithm stability and its application to kinetic Euclidean MSTs	2020-02-12	Paper
Topological Stability of Kinetic k-centers	2019-10-15	Paper
Short Plane Supports for Spatial Hypergraphs	2019-09-16	Paper
Geometry and Generation of a New Graph Planarity Game	2019-09-16	Paper
Four Soviets Walk the Dog—with an Application to Alt's Conjecture	2019-06-20	Paper
The Painter’s Problem: Covering a Grid with Colored Connected Polygons	2019-02-20	Paper
Experimental Analysis of the Accessibility of Drawings with Few Segments	2019-02-20	Paper
Short plane supports for spatial hypergraphs	2019-02-15	Paper
Locally correct Fréchet matchings	2018-11-16	Paper
Experimental Analysis of the Accessibility of Drawings with Few Segments	2018-10-25	Paper
Drawing Planar Graphs with Few Geometric Primitives	2018-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q4580143	2018-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4606291	2018-03-02	Paper
Drawing planar graphs with few geometric primitives	2018-01-04	Paper
Four Soviets walk the dog: improved bounds for computing the Fréchet distance	2017-10-10	Paper
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments	2017-05-16	Paper
Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms and Experiments	2017-02-10	Paper
A Tale of Two Communities: Assessing Homophily in Node-Link Diagrams	2017-02-10	Paper
Computing the Fréchet distance with a retractable leash	2016-09-14	Paper
Computing the Fréchet Distance with a Retractable Leash	2013-09-17	Paper
Locally correct Fréchet matchings	2012-09-25	Paper

Research outcomes over time

This page was built for person: Wouter Meulemans