Planar Formulae and Their Uses
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- Edges and switches, tunnels and bridges
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- A better constant-factor approximation for weighted dominating set in unit disk graph
- Untangling a planar graph
- Planar bichromatic minimum spanning trees
- Polychromatic colorings of arbitrary rectangular partitions
- On the complexity of partitioning graphs into connected subgraphs
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- On non-intersecting Eulerian circuits
- Nonserial dynamic programming formulations of satisfiability
- On the complexity of loading shallow neural networks
- An application of the planar separator theorem to counting problems
- The complexity of recognizing polyhedral scenes
- The complexity of planar graph choosability
- Planar kernel and Grundy with d 3, dout 2, din 2 are NP- complete
- Unit disk graphs
- Testing approximate symmetry in the plane is NP-hard
- Nested annealing: A provable improvement to simulated annealing
- Drawing the planar dual
- Minimum vertex hulls for polyhedral domains
- The complexity of coloring games on perfect graphs
- Geography
- Optimal layout of edge-weighted forests
- The Othello game on an \(n\times n\) board is PSPACE-complete
- The complexity of finding minimal Voronoi covers with applications to machine learning
- Deciding whether a planar graph has a cubic subgraph is NP-complete
- Satisfiability of co-nested formulas
- Algorithmic complexity of list colorings
- A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- Functional inversion and communication complexity
- On the complexity of labeling perspective projections of polyhedral scenes
- Tiling figures of the plane with two bars
- The complexity of induced minors and related problems
- On approximation algorithms for the minimum satisfiability problem
- Edge-packing planar graphs by cyclic graphs
- The disjoint shortest paths problem
- The bottleneck independent domination on the classes of bipartite graphs and block graphs.
- Some observations on holographic algorithms
- The fewest clues problem
- On the complexity of submap isomorphism and maximum common submap problems
- On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
- The convexity of induced paths of order three and applications: complexity aspects
- Solving a binary puzzle
- On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions
- On the complexity of clustering with relaxed size constraints in fixed dimension
- Short plane supports for spatial hypergraphs
- On directed covering and domination problems
- Parameterized complexity of the spanning tree congestion problem
- Selecting and covering colored points
- An algebraic point of view of the data structures of database systems
- Packing triangles in bounded degree graphs.
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Point matching under non-uniform distortions.
- Approximation algorithms for aligning points
- It is tough to be a plumber
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Complexity of circuit intersection in graphs
- On edge perfectness and classes of bipartite graphs
- HAMILTONian circuits in chordal bipartite graphs
- Algorithmic aspects of proportional symbol maps
- Hardness of \(k\)-anonymous microaggregation
- Sensor network topology design and analysis for efficient data gathering by a mobile mule
- The inverse Voronoi problem in graphs. I: Hardness
- The complexity of data aggregation in static and dynamic wireless sensor networks
- Dominating set of rectangles intersecting a straight line
- Twin-width and polynomial kernels
- On the dichromatic number of surfaces
- A graph theoretical approach to the firebreak locating problem
- Positive planar satisfiability problems under 3-connectivity constraints
- Algorithmic aspects of the independent 2-rainbow domination number and independent Roman \(\{2\}\)-domination number
- Path cover problems with length cost
- Minimum color spanning circle of imprecise points
- The maximum independent union of cliques problem: complexity and exact approaches
- Placing labels in road maps: algorithms and complexity
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context
- On algorithmic complexity of double Roman domination
- Consistent dynamic map labeling with fairness and importance
- Maximizing ink in partial edge drawings of \(k\)-plane graphs
- On caterpillar factors in graphs
- On simplified NP-complete variants of \textsc{Monotone 3-Sat}
- Optimization for first order Delaunay triangulations
- Extension complexity of the correlation polytope
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
- Partitioning a graph into disjoint cliques and a triangle-free graph
- On the complexity of the disjoint paths problem
- Approximating points by a piecewise linear function
- Distance domination in graphs with given minimum and maximum degree
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
- The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds
- On the complexity of restoring corrupted colorings
- Upward and quasi-upward planarity testing of embedded mixed graphs
- Plane graphs with parity constraints
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs
This page was built for publication: Planar Formulae and Their Uses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936195)
