The following pages link to Petr A. Golovach (Q259036):
Displaying 50 items.
- Some generalizations of the problem on the search number of a graph (Q1373627) (← links)
- The \(k\)-search number of graphs of regular polyhedra (Q1373647) (← links)
- Interval degree and bandwidth of a graph (Q1406031) (← links)
- On a complementary interval graph with the lowest max-degree (Q1420308) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Minimal trees of a given search number (Q1816287) (← links)
- Computing the isoperimetric number of a graph (Q1905161) (← links)
- Three complexity results on coloring \(P_k\)-free graphs (Q1933643) (← links)
- Choosability on \(H\)-free graphs (Q1943624) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- Obtaining planarity by contracting few edges (Q1945931) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Induced disjoint paths in AT-free graphs (Q2051862) (← links)
- Graph Hamiltonicity parameterized by proper interval deletion set (Q2081606) (← links)
- Present-biased optimization (Q2082782) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- Parameterized complexity of directed spanner problems (Q2161008) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Subgraph complementation (Q2182091) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Finding connected secluded subgraphs (Q2186823) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- Contraction obstructions for treewidth (Q2275894) (← links)
- Kernelization of graph Hamiltonicity: proper \(H\)-graphs (Q2285097) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Editing to a connected graph of given degrees (Q2407094) (← links)
- Parameterized complexity of secluded connectivity problems (Q2408560) (← links)
- Computing square roots of graphs with low maximum degree (Q2413970) (← links)
- Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
