Pages that link to "Item:Q3798236"
From MaRDI portal
The following pages link to Nonconstructive tools for proving polynomial-time decidability (Q3798236):
Displayed 50 items.
- A randomized algorithm for long directed cycle (Q264199) (← links)
- Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- A decidability result for the dominating set problem (Q410736) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On feedback vertex set: new measure and new structures (Q494933) (← links)
- Complete graph immersions in dense graphs (Q512586) (← links)
- Faster parameterized algorithms for minor containment (Q650942) (← links)
- The complexity of querying indefinite data about linearly ordered domains (Q676427) (← links)
- Connected graph searching (Q690489) (← links)
- Linearizing well quasi-orders and bounding the length of bad sequences (Q744984) (← links)
- Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- Quickly deciding minor-closed parameters in general graphs (Q854832) (← links)
- On well-quasi-ordering finite structures with labels (Q912875) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Nonconstructive advances in polynomial-time complexity (Q1098635) (← links)
- Constructive complexity (Q1182305) (← links)
- The vertex separation number of a graph equals its path-width (Q1198094) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← links)
- On search, decision, and the efficiency of polynomial-time algorithms (Q1342869) (← links)
- On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory (Q1379838) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- On computing graph minor obstruction sets (Q1575945) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- A linear time algorithm for monadic querying of indefinite data over linearly ordered domains (Q1887153) (← links)
- Computing crossing numbers in quadratic time (Q1887712) (← links)
- From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- FPT is characterized by useful obstruction sets (Q2828222) (← links)
- TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS (Q2873496) (← links)
- Fixed-Parameter Tractability, A Prehistory, (Q2908528) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Surfing with Rod (Q2973715) (← links)
- Algorithms and Complexity of Signed, Minus, and Majority Domination (Q3384120) (← links)
- Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694) (← links)
- Finite automata as characterizations of minor closed tree families (extended abstract) (Q4630274) (← links)
- Kernelization of Arc Disjoint Cycle Packing in $$\alpha $$-Bounded Digraphs (Q5042259) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- A naive algorithm for feedback vertex set (Q5240414) (← links)