Francisco J. Soulignac

44 papers B 1Journal 42Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Beware of the classical benchmark instances for the Traveling Salesman Problem with Time Windows. Comput. Oper. Res. Francisco J. Soulignac
2025	J	`jnl`	Beware of the Classical Benchmark Instances for the Traveling Salesman Problem with Time Windows. CoRR Francisco J. Soulignac
2024	J	`jnl`	A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. Eur. J. Oper. Res. Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
2024	J	`jnl`	Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone. INFORMS J. Comput. Marcos Blufstein, Gonzalo Lera-Romero, Francisco J. Soulignac
2023	J	`jnl`	Complexity of solving a system of difference constraints with variables restricted to a finite set. Inf. Process. Lett. Santiago Cifuentes, Francisco J. Soulignac, Pablo Terlisky
2022	J	`jnl`	Complexity of solving a system of difference constraints with variables restricted to a finite set. CoRR Santiago Cifuentes, Francisco J. Soulignac, Pablo Terlisky
2022	J	`jnl`	Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows. INFORMS J. Comput. Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
2022	J	`jnl`	Loop unrolling of UCA models: distance labeling. CoRR Francisco J. Soulignac, Pablo Terlisky
2021	J	`jnl`	A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. Theor. Comput. Sci. Francisco J. Soulignac
2021	J	`jnl`	Total 2-domination of proper interval graphs. Discret. Appl. Math. Francisco J. Soulignac
2020	J	`jnl`	Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows. Networks Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
2019	J	`jnl`	The eternal dominating set problem for interval graphs. Inf. Process. Lett. Martín Rinemberg, Francisco J. Soulignac
2018	J	`jnl`	The eternal dominating set problem for interval graphs. CoRR Martín Rinemberg, Francisco J. Soulignac
2018	J	`jnl`	Total 2-domination of proper interval graphs. CoRR Francisco J. Soulignac
2017	J	`jnl`	Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory. J. Graph Algorithms Appl. Francisco J. Soulignac
2017	J	`jnl`	Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms. J. Graph Algorithms Appl. Francisco J. Soulignac
2016	J	`jnl`	Integrality of minimal unit circular-arc models. CoRR Francisco J. Soulignac, Pablo Terlisky
2015	J	`jnl`	A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. CoRR Francisco J. Soulignac
2015	J	`jnl`	A faster algorithm for the cluster editing problem on proper interval graphs. Inf. Process. Lett. Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2015	J	`jnl`	Disimplicial arcs, transitive vertices, and disimplicial eliminations. Discret. Math. Theor. Comput. Sci. Martiniano Eguía, Francisco J. Soulignac
2015	J	`jnl`	Fully Dynamic Recognition of Proper Circular-Arc Graphs. Algorithmica Francisco J. Soulignac
2014	J	`jnl`	Disimplicial arcs, transitive vertices, and disimplicial eliminations. CoRR Martiniano Eguía, Francisco J. Soulignac
2014	J	`jnl`	Minimal and short representations of unit interval and unit circular-arc graphs. CoRR Francisco J. Soulignac
2014	J	`jnl`	Star and Biclique Coloring and Choosability. J. Graph Algorithms Appl. Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky
2013	J	`jnl`	Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration. Discret. Math. Theor. Comput. Sci. Martiniano Eguía, Francisco J. Soulignac
2013	J	`jnl`	Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2013	J	`jnl`	Normal Helly circular-arc graphs and its subclasses. Discret. Appl. Math. Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2012	J	`jnl`	Arboricity, h-index, and dynamic algorithms. Theor. Comput. Sci. Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2012	J	`jnl`	Isomorphism of graph classes related to the circular-ones property CoRR Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter
2012	J	`jnl`	The star and biclique coloring and choosability problems CoRR Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky
2011	J	`jnl`	Fully dynamic recognition of proper circular-arc graphs CoRR Francisco J. Soulignac
2011	J	`jnl`	Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration CoRR Martiniano Eguía, Francisco J. Soulignac
2011	J	`jnl`	Powers of cycles, powers of paths, and distance graphs. Discret. Appl. Math. Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2011	J	`jnl`	Subclasses of Normal Helly Circular-Arc Graphs CoRR Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2010	J	`jnl`	Arboricity, h-Index, and Dynamic Algorithms CoRR Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2010	J	`jnl`	The clique operator on circular-arc graphs. Discret. Appl. Math. Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2009	J	`jnl`	NP-hardness of the recognition of coordinated graphs. Ann. Oper. Res. Francisco J. Soulignac, Gabriel Sueiro
2009	J	`jnl`	Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs. Discret. Appl. Math. Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro
2009	J	`jnl`	Partial characterizations of coordinated graphs: line graphs and complements of forests. Math. Methods Oper. Res. Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro
2009	J	`jnl`	Short Models for Unit Interval Graphs. Electron. Notes Discret. Math. Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2008	—	`conf`	A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. SWAT Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2008	J	`jnl`	On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter
2008	J	`jnl`	Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs. Electron. Notes Discret. Math. Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro
2007	B	`conf`	Proper Helly Circular-Arc Graphs. WG Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter