:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Didimo, Walter, Gupta, Siddharth, Kindermann, Philipp, Liotta, Giuseppe, Wolff, Alexander, Zehavi, Meirav
Formato:	Preprint
Publicado:	2022
Materias:	Computational Geometry
Acceso en línea:	https://arxiv.org/abs/2210.05019
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Orthogonal Drawings in Linear Time
por: Didimo, Walter, et al.
Publicado: (2025)

Three Edge-disjoint Plane Spanning Paths in a Point Set
por: Kindermann, Philipp, et al.
Publicado: (2023)

Parameterized Geometric Graph Modification with Disk Scaling
por: Fomin, Fedor V., et al.
Publicado: (2024)

Near-Linear and Parameterized Approximations for Maximum Cliques in Disk Graphs
por: Gao, Jie, et al.
Publicado: (2025)

Weakly Leveled Planarity with Bounded Span
por: Bekos, Michael, et al.
Publicado: (2024)

Exact Algorithms for Clustered Planarity with Linear Saturators
por: Da Lozzo, Giordano, et al.
Publicado: (2024)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
por: Fomin, Fedor V., et al.
Publicado: (2025)

The Complexity of Extending Storylines with Minimum Local Crossing Number
por: Dobler, Alexander, et al.
Publicado: (2026)

Unbent Collections of Orthogonal Drawings
por: Antić, Todor, et al.
Publicado: (2025)

Outerplanar and Forest Storyplans
por: Fiala, Jiří, et al.
Publicado: (2023)

Min-$k$-planar Drawings of Graphs
por: Binucci, Carla, et al.
Publicado: (2023)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Minimum Monotone Spanning Trees
por: Di Giacomo, Emilio, et al.
Publicado: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
por: Fomin, Fedor V., et al.
Publicado: (2024)

On Layered Area-Proportional Rectangle Contact Representations
por: Haase, Carolina, et al.
Publicado: (2023)

Learning Small Decision Trees with Few Outliers: A Parameterized Perspective
por: Gahlawat, Harmender, et al.
Publicado: (2025)

Outside-Obstacle Representations with All Vertices on the Outer Face
por: Firman, Oksana, et al.
Publicado: (2022)

The Parametrized Complexity of the Segment Number
por: Cornelsen, Sabine, et al.
Publicado: (2023)

Treewidth Parameterized by Feedback Vertex Number
por: Molter, Hendrik, et al.
Publicado: (2025)

Tangling and Untangling Trees on Point-sets
por: Di Battista, Giuseppe, et al.
Publicado: (2025)

Constrained and Ordered Level Planarity Parameterized by the Number of Levels
por: Blažej, Václav, et al.
Publicado: (2024)

On Kernelization with Access to NP-Oracles
por: Molter, Hendrik, et al.
Publicado: (2025)

A Parameterized Perspective on Uniquely Restricted Matchings
por: Chaudhary, Juhi, et al.
Publicado: (2025)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
por: Chaudhary, Juhi, et al.
Publicado: (2024)

Bounding and computing obstacle numbers of graphs
por: Balko, Martin, et al.
Publicado: (2022)

Simultaneous Embedding of Two Paths on the Grid
por: Kobourov, Stephen, et al.
Publicado: (2026)

On $k$-Plane Insertion into Plane Drawings
por: Katheder, Julia, et al.
Publicado: (2024)

How Many Slopes Does Polynomial Area Cost?
por: Bekos, Michael A., et al.
Publicado: (2026)

The Price of Upwardness
por: Angelini, Patrizio, et al.
Publicado: (2024)

Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces
por: Angelini, Patrizio, et al.
Publicado: (2025)

Linear Layouts of Graphs with Priority Queues
por: Di Giacomo, Emilio, et al.
Publicado: (2025)

When agents choose bundles autonomously: guarantees beyond discrepancy
por: Gupta, Sushmita, et al.
Publicado: (2026)

Rectangular Duals on the Cylinder and the Torus
por: Biedl, Therese, et al.
Publicado: (2025)

Saturated Drawings of Geometric Thickness k
por: Bachmann, Patricia, et al.
Publicado: (2025)

The Parameterized Complexity of Geometric 1-Planarity
por: Firbas, Alexander
Publicado: (2026)

Edge-Constrained Hamiltonian Paths on a Point Set
por: Antić, Todor, et al.
Publicado: (2025)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
por: Bekos, Michael A., et al.
Publicado: (2025)

How to Make Knockout Tournaments More Popular?
por: Chaudhary, Juhi, et al.
Publicado: (2023)

Adaptive Manipulation for Coalitions in Knockout Tournaments
por: Chaudhary, Juhi, et al.
Publicado: (2024)

Planar Stories of Graph Drawings: Algorithms and Experiments
por: Binucci, Carla, et al.
Publicado: (2025)