Removing popular faces in curve arrangements

DOI10.7155/jgaa.v28i2.2988MaRDI QIDQ6636990

Alexandra Weinberger, Maarten Löffler, Soeren Terziadis, Phoebe de Nooijer, Günter Rote, Zuzana Masárová, Tamara Mchedlidze

Publication date: 12 November 2024

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

curve arrangementsfixed-parameter tractable (FPT)puzzle generationpopular faces

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• On non-intersecting Eulerian circuits
• Dynamic programming meets the principle of inclusion and exclusion
• Eulerian graphs and related topics. Part 1, Volume 1
• The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
• Nonograms: combinatorial questions and algorithms
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Removing popular faces in curve arrangements

This page was built for publication: Removing popular faces in curve arrangements