Cover Image

Computing Height-Optimal Tangles Faster

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Firman, Oksana, Kindermann, Philipp, Ravsky, Alexander, Wolff, Alexander, Zink, Johannes
Format:	Preprint
Published:	2019
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Complexity of Finding Tangles
by: Firman, Oksana, et al.
Published: (2020)

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

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

Hypergraph Representation via Axis-Aligned Point-Subspace Cover
by: Firman, Oksana, et al.
Published: (2021)

Coloring Mixed and Directional Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2022)

Coloring and Recognizing Directed Interval Graphs
by: Gutowski, Grzegorz, et al.
Published: (2023)

Reconsideration of Tangle and Ultrafilter using Separation and Partition
by: Fujita, Takaaki
Published: (2023)

Drawing Trees and Cacti with Integer Edge Lengths on a Polynomial-Size Grid
by: Förster, Henry, et al.
Published: (2025)

Beyond Outerplanarity
by: Chaplick, Steven, et al.
Published: (2017)

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

Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)

A Computer-Assisted Proof of the Optimal Density Bound for Pinwheel Covering
by: Kawamura, Akitoshi, et al.
Published: (2025)

Cube Height, Cube Width and Related Extremal Problems for Posets
by: Bastide, Paul, et al.
Published: (2025)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
by: Hatzel, Meike, et al.
Published: (2024)

Near-optimal edge partitioning via intersecting families
by: Yakunin, Alexander, et al.
Published: (2025)

Simultaneous Drawing of Layered Trees
by: Katheder, Julia, et al.
Published: (2023)

Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)

Results on cubic bent and weakly regular bent $p$-ary functions leading to a class of cubic ternary non-weakly regular bent functions
by: Carlet, Claude, et al.
Published: (2025)

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

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

Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
by: Helleseth, Tor, et al.
Published: (2025)

Playing Snake on a Graph
by: Graafsma, Denise, et al.
Published: (2025)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
by: Förster, Henry, et al.
Published: (2023)

Optimal Delivery with a Faulty Drone
by: Coleman, Jared, et al.
Published: (2024)

An Efficient Genus Algorithm Based on Graph Rotations
by: Metzger, Alexander, et al.
Published: (2024)

Faster algorithms for graph homomorphism via tractable constraint satisfaction
by: Carbonnel, Clément
Published: (2026)

Symbolic Listings as Computation
by: Sawczuk, Hamilton, et al.
Published: (2024)

Node-Weighted Triangles: Faster and Simpler
by: Akmal, Shyan, et al.
Published: (2026)

Optimal Average Disk-Inspection via Fermat's Principle
by: Georgiou, Konstantinos
Published: (2025)

A statistical test for network similarity
by: Miasnikof, Pierre, et al.
Published: (2025)

Temporal Network Analysis of Microservice Architectural Degradation
by: Bakhtin, Alexander
Published: (2025)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Optimal Representation for Right-to-Left Parallel Scalar Point Multiplication
by: Phalakarn, Kittiphon, et al.
Published: (2025)

Optimal placement of mobile distance-limited devices for line routing\
by: Erzin, Adil, et al.
Published: (2025)

Graph drawing applications in combinatorial theory of maturity models
by: Kajzer, Špela, et al.
Published: (2024)

Optimal Trading of a Charging-Station Company in Auction Markets for Electricity
by: Sohrabi, Farnaz, et al.
Published: (2025)

Path Contraction Faster than $2^n$
by: Agrawal, Akanksha, et al.
Published: (2025)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Optimal energy collection with rotational movements constraints in concentrated solar power plants
by: Díaz-Bañez, J. M., et al.
Published: (2024)

Discrete Single-Parameter Optimal Auction Design
by: Giannakopoulos, Yiannis, et al.
Published: (2024)