The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Decomposition by clique separators (Q1062072) (← links)
- Depth-first iterative-deepening: An optimal admissible tree search (Q1062761) (← links)
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764) (← links)
- Hamiltonian cycles in random regular graphs (Q1063002) (← links)
- Sylow's theorem in polynomial time (Q1063109) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- The chromatic number of the product of two 4-chromatic graphs is 4 (Q1063620) (← links)
- The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable (Q1063621) (← links)
- Simplification of expressions involving radicals (Q1063634) (← links)
- A characterization of planar graphs by Trémaux orders (Q1065816) (← links)
- On the value of a random minimum spanning tree problem (Q1066149) (← links)
- A polynomial time algorithm for finding the prime factors of Cartesian- product graphs (Q1067411) (← links)
- Comments on some B-spline algorithms (Q1068507) (← links)
- Succinct representation of regular languages by Boolean automata. II (Q1068549) (← links)
- Probabilistic counting algorithms for data base applications (Q1069325) (← links)
- Availability of a distributed computer system with failures (Q1069693) (← links)
- The intractability of resolution (Q1071750) (← links)
- Solvability by radicals is in polynomial time (Q1071803) (← links)
- Inherited arcs in finite affine planes (Q1072103) (← links)
- Sequential access in splay trees takes linear time (Q1072706) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- Directed switching games on graphs and matroids (Q1074519) (← links)
- Quasi finitely axiomatizable totally categorical theories (Q1075316) (← links)
- A resolution of the Sylvester-Gallai problem of J.-P. Serre (Q1076336) (← links)
- On Lovász' lattice reduction and the nearest lattice point problem (Q1076512) (← links)
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles (Q1076976) (← links)
- Graphs determined by their finite induced subgraphs (Q1077438) (← links)
- Two poset polytopes (Q1077721) (← links)
- Individuals and points (Q1078550) (← links)
- Closed-world databases and circumscription (Q1079022) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- Graph minors. V. Excluding a planar graph (Q1079583) (← links)
- On interprocess communication. I: Basic formalism (Q1079945) (← links)
- Traces, dependency graphs and DNLC grammars (Q1081307) (← links)
- Recurrent words and simultaneous growth in T0L systems (Q1081308) (← links)
- The power of geometric duality (Q1082821) (← links)
- Graph theoretic closure properties of the family of boundary NLC graph languages (Q1084870) (← links)
- Rectilinear planar layouts and bipolar orientations of planar graphs (Q1085168) (← links)
- The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices (Q1085184) (← links)
- CTS systems and Petri nets (Q1085981) (← links)
- The Erdős-Ko-Rado theorem for vector spaces (Q1086589) (← links)
- On the number of faces of centrally-symmetric simplicial polytopes (Q1087139) (← links)
- A geometric inequality and the complexity of computing volume (Q1087143) (← links)
- The pairing heap: A new form of self-adjusting heap (Q1087333) (← links)
- The edge-chromatic class of regular graphs of degree 4 and their complements (Q1087882) (← links)
- Critical star multigraphs (Q1089350) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- Linear discrimination with symmetrical models (Q1091065) (← links)
- On Hamiltonian cycles in Cayley graphs of wreath products (Q1091398) (← links)
