The following pages link to (Q5684962):
Displaying 49 items.
- Pattern matching for permutations (Q293263) (← links)
- Signed enumeration of upper-right corners in path shuffles (Q338583) (← links)
- A mathematical formulation and complexity considerations for the blocks relocation problem (Q439616) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- Graph layouts via layered separators (Q473100) (← links)
- Sorting with networks of data structures (Q602673) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (Q756423) (← links)
- Distributions of pattern statistics in sparse Markov models (Q778872) (← links)
- Permuting machines and priority queues (Q817805) (← links)
- Queue layouts of iterated line directed graphs (Q885285) (← links)
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties (Q886670) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- A series of slowly synchronizing automata with a zero state over a small alphabet (Q948092) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- The enumeration of permutations sortable by pop stacks in parallel (Q987841) (← links)
- Upper bounds on the queue number of \(k\)-ary \(n\)-cubes (Q990104) (← links)
- Decomposing a set of points into chains, with applications to permutation and circle graphs (Q1071505) (← links)
- On the notion of infinite pseudorandom sequences (Q1091817) (← links)
- On decomposing polygons into uniformly monotone parts (Q1108793) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- Sorting using networks of deques (Q1136225) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- Invariant and geometric aspects of algebraic complexity theory. I (Q1176389) (← links)
- Random languages for nonuniform complexity classes (Q1179458) (← links)
- Intersection graphs of curves in the plane (Q1234300) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Permutations generated by token passing in graphs (Q1391529) (← links)
- Container ship stowage problem complexity and connection to the coloring of circle graphs (Q1570840) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- Černý's conjecture and the road colouring problem (Q2074216) (← links)
- Forbidden induced subgraph characterization of circle graphs within split graphs (Q2091783) (← links)
- Embedding planar 5-graphs in three pages (Q2185736) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Every discrete input machine is linearly simulatable (Q2560210) (← links)
- On the Hierarchy of Block Deterministic Languages (Q2947409) (← links)
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics (Q3506945) (← links)
- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique (Q3511317) (← links)
- Synchronizing Automata and the Černý Conjecture (Q3540093) (← links)
- Hopcroft’s Algorithm and Cyclic Automata (Q3540107) (← links)
- Hopcroft’s Minimization Technique: Queues or Stacks? (Q3602803) (← links)
- The Complexity of Coloring Circular Arcs and Chords (Q3964622) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- Minimal auxiliary Markov chains through sequential elimination of states (Q5085915) (← links)
- Permutations of a multiset avoiding permutations of length 3 (Q5952148) (← links)
- Using Euler’s Formula to Find the Lower Bound of the Page Number (Q6489355) (← links)
