The following pages link to Francisco J. Soulignac (Q418736):
Displaying 31 items.
- Arboricity, \(h\)-index, and dynamic algorithms (Q418737) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
- (Q967411) (redirect page) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- The eternal dominating set problem for interval graphs (Q1739215) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- Total 2-domination of proper interval graphs (Q2043384) (← links)
- A certifying and dynamic algorithm for the recognition of proper circular-arc graphs (Q2232611) (← links)
- Fully dynamic recognition of proper circular-arc graphs (Q2350902) (← links)
- Short models for unit interval graphs (Q2840545) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory (Q2985115) (← links)
- Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms (Q2985116) (← links)
- (Q3455034) (← links)
- On cliques of Helly Circular-arc Graphs (Q3503539) (← links)
- Proper Helly Circular-Arc Graphs (Q3508572) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- (Q3645767) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)
- The Star and Biclique Coloring and Choosability Problems (Q5494862) (← links)
- (Q5747371) (← links)
- (Q5747380) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900083) (← links)
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs (Q5900860) (← links)
- A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows (Q6087498) (← links)
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
- Complexity of solving a system of difference constraints with variables restricted to a finite set (Q6161434) (← links)
- Total 2-domination of proper interval graphs (Q6310592) (← links)
- Decremental state-space relaxations for the basic traveling salesman problem with a drone (Q6598944) (← links)
