Search

Your search keyword '"Colbourn, Charles J."' showing total 36 results

Search Constraints

Start Over You searched for: Author "Colbourn, Charles J." Remove constraint Author: "Colbourn, Charles J." Journal combinatorial algorithms : 30th international workshop, iwoca 2019, pisa, italy, july 23-25, 2019, proceedings Remove constraint Journal: combinatorial algorithms : 30th international workshop, iwoca 2019, pisa, italy, july 23-25, 2019, proceedings
36 results on '"Colbourn, Charles J."'

Search Results

1. Incremental Algorithm for Minimum Cut and Edge Connectivity in Hypergraph

2. Burrows-Wheeler Transform of Words Defined by Morphisms

3. Supermagic Graphs with Many Odd Degrees

4. Solving Group Interval Scheduling Efficiently

5. Disjoint Clustering in Combinatorial Circuits

6. Algorithm and Hardness Results on Liar’s Dominating Set and -tuple Dominating Set

7. On Erdős–Szekeres-Type Problems for k-convex Point Sets

8. Finding Periods in Cartesian Tree Matching

9. Fixed-Parameter Tractability of List Coloring

10. Parameterized Complexity of Min-Power Asymmetric Connectivity

11. On the Average Case of MergeInsertion

12. Stable Noncrossing Matchings

13. A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber

14. An Improved Scheme in the Two Query Adaptive Bitprobe Model

15. Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings

16. Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling Under Precedence Constraints

17. Maximum Clique Exhaustive Search in Circulant k-Hypergraphs

18. An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number

19. An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs

20. Computing the k-Crossing Visibility Region of a Point in a Polygon

21. Complexity of Fall Coloring for Restricted Graph Classes

22. Parameterized Algorithms for Graph Burning Problem

23. Complexity and Algorithms for Semipaired Domination in Graphs

24. Extension and Its Price for the Connected Vertex Cover Problem

25. Computing the Rooted Triplet Distance Between Phylogenetic Networks

26. Shortest-Path-Preserving Rounding

27. A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications

28. A Note on Handicap Incomplete Tournaments

29. Reaching 3-Connectivity via Edge-Edge Additions

30. Cops and Robber on Some Families of Oriented Graphs

31. The Hull Number in the Convexity of Induced Paths of Order 3

32. Dual Domination

33. Call Admission Problems on Trees with Advice : (Extended Abstract)

34. Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs

35. Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs

36. Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs

Catalog

Books, media, physical & digital resources