Pages that link to "Item:Q5903516"

The following pages link to The NP-completeness column: An ongoing guide (Q5903516):

Displaying 24 items.

• Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
• Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
• Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
• The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
• On the complexity of finding balanced oneway cuts (Q1014383) (← links)
• Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
• Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
• Unit disk graphs (Q1174134) (← links)
• \(\alpha\)-vertex separator is NP-hard even for 3-regular graphs (Q1179551) (← links)
• Edge colouring line graphs of unicyclic graphs (Q1186166) (← links)
• On the pathwidth of chordal graphs (Q1309811) (← links)
• The maximum edge biclique problem is NP-complete (Q1414242) (← links)
• A note on the complexity of the bilevel bottleneck assignment problem (Q2095526) (← links)
• Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
• On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains (Q2225405) (← links)
• The effect of homogeneity on the computational complexity of combinatorial data anonymization (Q2435706) (← links)
• On the complexity of the black-and-white coloring problem on some classes of perfect graphs (Q2445872) (← links)
• Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis (Q2633244) (← links)
• The Effect of Homogeneity on the Complexity of k-Anonymity (Q3088269) (← links)
• Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044) (← links)
• Template-Based Minor Embedding for Adiabatic Quantum Optimization (Q5084660) (← links)
• Entropy, Randomization, Derandomization, and Discrepancy (Q5326100) (← links)
• Combinatorics and algorithms for quasi-chain graphs (Q5918620) (← links)
• Combinatorics and algorithms for quasi-chain graphs (Q5925628) (← links)