Width notions for ordering-related problems
From MaRDI portal
Cites work
- A Characterization of Comparability Graphs and of Interval Graphs
- A Consistent Extension of Condorcet’s Election Principle
- A efficient fixed parameter tractable algorithm for 1-sided crossing minimzation
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization
- A fixed-parameter approach to 2-layer planarization
- A linear edge kernel for two-layer crossing minimization
- A linear time and space algorithm to recognize interval orders
- A NEW MEASURE OF RANK CORRELATION
- A survey on the linear ordering problem for weighted or unweighted tournaments
- An Extension of the String-to-String Correction Problem
- An improved bound on the one-sided minimum crossing number in two-layered drawings
- Comparing and aggregating partial orders with Kendall tau distances
- Counting linear extensions: parameterizations by treewidth
- Crossing minimization in weighted bipartite graphs
- Crossing-constrained hierarchical drawings
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Edge crossings in drawings of bipartite graphs
- Encyclopedia of Optimization
- Exact algorithms for the quadratic linear ordering problem
- Facility Location Problems: A Parameterized View
- Fast FAST
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Finding shuffle words that represent optimal scheduling of shared memory access
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fixed parameter algorithms for one-sided crossing minimization revisited
- Fixed-parameter algorithms for Kemeny rankings
- Fixed-Parameter Algorithms for Kemeny Scores
- Fundamentals of parameterized complexity
- Graph Drawing
- Graph Drawing
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- Heuristics, experimental subjects, and treatment evaluation in bigraph crossing minimization
- scientific article; zbMATH DE number 1693470 (Why is no real title available?)
- scientific article; zbMATH DE number 2084271 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3425631 (Why is no real title available?)
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 5485441 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1057882 (Why is no real title available?)
- scientific article; zbMATH DE number 6297698 (Why is no real title available?)
- Improved parameterized algorithms for the Kemeny aggregation problem
- Kernels: Annotated, Proper and Induced
- Minimizing the sum cost in linear extensions of a poset
- NP-completeness properties about linear extensions
- NP-hardness results for the aggregation of linear orders into median orders
- Parameterized analysis and crossing minimization problems
- Patterns with bounded treewidth
- Probabilistic analysis of a grouping algorithm
- Ranking and drawing in subexponential time
- Ranking chain sum orders
- Realizing Interval Graphs with Size and Distance Constraints
- Satisfiability problems on intervals and unit intervals
- The graph crossing number and its variants: a survey
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Treewidth. Computations and approximations
- Voting schemes for which it can be difficult to tell who won the election
This page was built for publication: Width notions for ordering-related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239833)
