The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- On the number of complete subgraphs contained in certain graphs (Q1159691) (← links)
- A graph theoretic approach to multivariable control system design (Q1160101) (← links)
- Tree constructions of free continuous algebras (Q1160149) (← links)
- Signed graphs (Q1160198) (← links)
- Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293) (← links)
- Testing attribute grammars for circularity (Q1162165) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- A simplified B-spline computation routine (Q1164369) (← links)
- Embedding metric spaces into CPO's (Q1164416) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- Explicit constructions of linear-sized superconcentrators (Q1165257) (← links)
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower (Q1167186) (← links)
- Roth's estimate of the discrepancy of integer sequences is nearly sharp (Q1167207) (← links)
- Symmetric space-bounded computation (Q1167537) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- On maximally saturated graphs (Q1169471) (← links)
- A combinatorial application of matrix Riccati equations and their q- analogue (Q1170193) (← links)
- Decompositions of complete graphs into isomorphic cubes (Q1170266) (← links)
- Finding repeated elements (Q1170891) (← links)
- Equitable and proportional coloring of trees (Q1171064) (← links)
- Recognizing graphic matroids (Q1172064) (← links)
- Comparability graphs and intersection graphs (Q1172652) (← links)
- An investigation of the causes of pathology in games (Q1173415) (← links)
- Trees with 1-factors and oriented trees (Q1174177) (← links)
- On the robustness of discrete-time indirect adaptive (linear) controllers (Q1175520) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Distances in a rigid unit-distance graph in the plane (Q1175790) (← links)
- Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
- Sensitivity of constrained Markov decision processes (Q1176864) (← links)
- Relativized topological size of sets of partial recursive functions (Q1177145) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Condition numbers of random matrices (Q1179026) (← links)
- Size and connectivity of the \(k\)-core of a random graph (Q1179277) (← links)
- Analytic determination of the depth effect in stereokinetic phenomena without a rigidity assumption (Q1179399) (← links)
- A path integral approach to data structure evolution (Q1179455) (← links)
- Quickly excluding a forest (Q1179478) (← links)
- The parameters of subcodes of algebraic-geometric codes over prime subfields (Q1180163) (← links)
- Clean triangulations (Q1180415) (← links)
- Dual linear extensions of generalised quadrangles (Q1180802) (← links)
- Belief contraction without recovery (Q1181487) (← links)
- Minimally inconsistent LP (Q1181492) (← links)
- An evaluation of sensory noise in the human visual system (Q1181587) (← links)
- The spectral dynamics and its applications in EEG (Q1181596) (← links)
- Impediments to universal preference-based default theories (Q1182162) (← links)
- Constructive complexity (Q1182305) (← links)
- Optimising synaptic learning rules in linear associative memories (Q1182329) (← links)
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory (Q1182475) (← links)
- \(p\)-integral harmonic sums (Q1182862) (← links)
- Bifurcation analysis of a neural network model (Q1182901) (← links)
