The following pages link to Andrzej Proskurowski (Q175510):
Displaying 50 items.
- Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs (Q631789) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
- Forbidden minors characterization of partial 3-trees (Q913807) (← links)
- Interior graphs of maximal outerplane graphs (Q1059083) (← links)
- Linear time algorithms for NP-hard problems restricted to partial k- trees (Q1116705) (← links)
- Centering a spanning tree of a biconnected graph (Q1123632) (← links)
- Computation of the center and diameter of outerplanar graphs (Q1142786) (← links)
- Directed maximal-cut problems (Q1169817) (← links)
- Canonical representations of partial 2- and 3-trees (Q1196453) (← links)
- Minimum broadcast graphs (Q1256494) (← links)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs (Q1262768) (← links)
- Bounded-call broadcasting (Q1339878) (← links)
- Minimum self-repairing graphs (Q1376072) (← links)
- Covering regular graphs (Q1386472) (← links)
- Minimum-time multidrop broadcast (Q1392528) (← links)
- Multicoloring trees. (Q1401922) (← links)
- The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
- Spanners and message distribution in networks. (Q1427197) (← links)
- Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
- (Q1578417) (redirect page) (← links)
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees (Q1578418) (← links)
- Memory requirements for table computations in partial \(k\)-tree algorithms (Q1578422) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Systems of distant representatives (Q1764814) (← links)
- On routing of wavebands for all-to-all communications in all-optical paths and cycles (Q1770374) (← links)
- Hamiltonicity of amalgams (Q1961758) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- The complexity of the defensive domination problem in special graph classes (Q2279988) (← links)
- Obstructions for linear rank-width at most 1 (Q2442201) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- Defensive domination in proper interval graphs (Q2691568) (← links)
- (Q2721972) (← links)
- (Q2766689) (← links)
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296) (← links)
- (Q3029044) (← links)
- (Q3042417) (← links)
- (Q3042845) (← links)
- Canonical incidence matrices of graphs (Q3051394) (← links)
- A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition (Q3087961) (← links)
- Extremal graphs having no matching cuts (Q3113291) (← links)
- (Q3198869) (← links)
- (Q3206969) (← links)
- (Q3218070) (← links)
- (Q3322145) (← links)
- (Q3325749) (← links)
- (Q3325753) (← links)
- (Q3334090) (← links)
- (Q3337494) (← links)
