Total Ordering Problem
From MaRDI portal
Cited in
(62)- Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
- On Reichenbach's causal betweenness
- Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints
- Permuting matrices to avoid forbidden submatrices
- Simple linear time approximation algorithm for betweenness
- Betweenness parameterized above tight lower bound
- On the complexity of computing treebreadth
- On recognizing staircase compatibility
- On the complexity of recognizing Wheeler graphs
- StreamTable: an area proportional visualization for tables with flowing streams
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Condorcet domains satisfying Arrow's single-peakedness
- Advancements on SEFE and partitioned book embedding problems
- Acyclicity in edge-colored graphs
- On subbetweennesses of trees: hardness, algorithms, and characterizations
- Crossing-constrained hierarchical drawings
- Anonymous monotonic social welfare functions
- The importance of being proper
- The complexity of shelflisting
- Hardness of fully dense problems
- Bounded Embeddings of Graphs in the Plane
- Permutation reconstruction from MinMax-betweenness constraints
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
- Sequence Covering Arrays and Linear Extensions
- Beyond level planarity
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Approximation schemes for the betweenness problem in tournaments and related ranking problems
- On Random Ordering Constraints
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
- Path-based supports for hypergraphs
- Upward partitioned book embeddings
- On the computational complexity of ordered subgraph recognition
- On random betweenness constraints
- Parameterized constraint satisfaction problems: a survey
- Simultaneous Embedding
- Why are CSPs based on partition schemes computationally hard?
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- Upward book embeddings of st-graphs
- Tractable combinations of temporal CSPs
- On the Generalised Character Compatibility Problem for Non-branching Character Trees
- Topological Birkhoff
- Recognizing \(k\)-clique extendible orderings
- Good orientations of unions of edge‐disjoint spanning trees
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- scientific article; zbMATH DE number 7758347 (Why is no real title available?)
- A geometric approach to betweenness
- Partial and simultaneous transitive orientations via modular decompositions
- Algorithms and complexity of sandwich problems in graphs (extended abstract)
- Characterization and representation problems for intersection betweennesses
- Strict betweennesses induced by posets as well as by graphs
- Streaming approximation resistance of every ordering CSP
- Parameterized complexity of simultaneous planarity
- Complexity classification transfer for CSPs via algebraic products
- Decision problems for subregular classes
- Simultaneous contact representations of planar graphs
- Simultaneous representation of proper and unit interval graphs
- The complexity of recognizing ABAB-free hypergraphs
- Finding an optimal alphabet ordering for Lyndon factorization is hard
- Segment intersection representations, level planarity and constrained ordering problems
- Language membership problems for subregular classes
- Three fundamental questions in modern infinite-domain constraint satisfaction
- A mixed integer linear programming formulation of the maximum betweenness problem
This page was built for publication: Total Ordering Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178507)
