The following pages link to (Q4385515):
Displaying 50 items.
- Recognizing Hamming graphs in linear time and space (Q287143) (← links)
- Random duplicate storage strategies for load balancing in multimedia servers (Q294850) (← links)
- Algorithmic aspects of open neighborhood location-domination in graphs (Q344871) (← links)
- Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Trading uninitialized space for time (Q834884) (← links)
- Attribute value reordering for efficient hybrid OLAP (Q855692) (← links)
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth (Q881594) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← links)
- Quantum approaches to graph colouring (Q1004074) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- On the complexity of scheduling with large communication delays (Q1278302) (← links)
- The forbidden projections of unate functions (Q1364471) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Efficient computation of implicit representations of sparse graphs (Q1377648) (← links)
- Fugitive-search games on graphs and related parameters (Q1392025) (← links)
- On treewidth and minimum fill-in of asteroidal triple-free graphs (Q1392207) (← links)
- Algorithms for generalized vertex-rankings of partial k-trees (Q1575443) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Algebraic approach to fasciagraphs and rotagraphs (Q1917348) (← links)
- HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
- Finding regular subgraphs in both arbitrary and planar graphs (Q1923612) (← links)
- Upper bounds to the clique width of graphs (Q1975365) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- On the job rotation problem (Q2467127) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672) (← links)
- Factoring with Two Large Primes (Q4317677) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Treewidth and pathwidth of permutation graphs (Q4630253) (← links)
- Finding even cycles even faster (Q4632454) (← links)
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856) (← links)
- Semi-dynamic shortest paths and breadth-first search in digraphs (Q5047157) (← links)
- Parametric problems on graphs of bounded tree-width (Q5056150) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
- Practical algorithms on partial k-trees with an application to domination-like problems (Q5060153) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
