Approximation Algorithms for Euler Genus and Related Problems (Q4581910): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.2416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kuratowski theorem for the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for solving VLSI graph layout problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating and nonseparating disjoint homotopic cycles in graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of approximation for crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest non-trivial cycles in directed graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Better Approximation Algorithm for Finding Planar Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint paths in Planar graphs with constant congestion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximating graph genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tighter insertion-based approximation of the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the graph crossing number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid minors in damaged grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holiest minimum-cost paths and flows in surface graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally cutting a surface into a disk / rank
 
Normal rank
Property / cites work
 
Property / cites work: A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the shortest essential cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the approximation of nonplanarity parameters for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the orientable genus of projective graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Non-trivial Cycles in Directed and Undirected Surface Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 103 graphs that are irreducible for the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing crossing numbers in quadratic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2732568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudo-approximation for the Genus of Hamiltonian Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Local Planarity and the Width of Graph Embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face covers and the genus problem for apex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal embeddings in the projective plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. VIII: A Kuratowski theorem for general surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph genus problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embeddings of graphs with no short noncontractible cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a surface with a prescribed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724086 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886408974 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:36, 30 July 2024

scientific article; zbMATH DE number 6921489
Language Label Description Also known as
English
Approximation Algorithms for Euler Genus and Related Problems
scientific article; zbMATH DE number 6921489

    Statements

    Approximation Algorithms for Euler Genus and Related Problems (English)
    0 references
    0 references
    0 references
    21 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    Euler genus
    0 references
    minimum planarization
    0 references
    crossing number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references