:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Firman, Oksana, Kindermann, Philipp, Klemz, Boris, Ravsky, Alexander, Wolff, Alexander, Zink, Johannes
Format:	Preprint
Published:	2020
Subjects:	Discrete Mathematics
Online Access:	https://arxiv.org/abs/2002.12251
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing Height-Optimal Tangles Faster
by: Firman, Oksana, et al.
Published: (2019)

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)

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

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)

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

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

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

Morphing Graph Drawings in the Presence of Point Obstacles
by: Firman, Oksana, et al.
Published: (2023)

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

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

Finding Minimal Clusters in st-DAGs
by: Vogl, Ulrich, 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)

The Density Formula: One Lemma to Bound Them All
by: Kaufmann, Michael, et al.
Published: (2023)

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)

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

Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
by: Bentert, Matthias, et al.
Published: (2023)

On Obtaining New MUBs by Finding Points on Complete Intersection Varieties over $\mathbb{R}$
by: Banerjee, Arindam, 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)

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

The Complexity of Cluster Vertex Splitting and Company
by: Firbas, Alexander, et al.
Published: (2023)

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

Complexity of Deciding the Equality of Matching Numbers
by: Gomes, Guilherme C. M., et al.
Published: (2024)

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

The Price of Upwardness
by: Angelini, Patrizio, et al.
Published: (2024)

On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
by: Pluska, Alexander, et al.
Published: (2025)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes
by: Hommelsheim, Felix, et al.
Published: (2026)

A New Method for Finding the Schulze Winner Set
by: Fujishige, Satoru, et al.
Published: (2026)

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

The Complexity of Homomorphism Reconstruction Revisited
by: Gervens, Timo, et al.
Published: (2026)

A Note on the Complexity of Graph Recoloring
by: Bousquet, Nicolas
Published: (2024)