Search

Showing total 12 results
12 results

Search Results

1. AN IMPROVED ALGORITHM FOR THE HALF-DISJOINT PATHS PROBLEM.

2. EDGE-DISJOINT PATHS IN PLANAR GRAPHS WITH CONSTANT CONGESTION.

3. TESTING GRAPH ISOMORPHISM.

4. Decycling Cartesian Products of Two Cycles.

5. CERTIFYING LexBFS RECOGNITION ALGORITHMS FOR PROPER INTERVAL GRAPHS AND PROPER INTERVAL BIGRAPHS.

6. TIGHT BOUNDS FOR TESTING BIPARTITENESS IN GENERAL GRAPHS.

7. CONSTRAINED EDGE-SPLITTING PROBLEMS.

8. FINDING 1-FACTORS IN BIPARTITE REGULAR GRAPHS AND EDGE-COLORING BIPARTITE GRAPHS.

9. COMPACT REPRESENTATIONS OF CUTS.

10. THE SIZE OF THE LARGEST COMPONENTS IN RANDOM PLANAR MAPS.

11. EDGE-CONNECTIVITY AUGMENTATION WITH PARTITION CONSTRAINTS.

12. DE BRUIJN SEQUENCES AND PERFECT FACTORS.