default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancisco J. Soulignac
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Gonzalo Lera-Romero, Juan José Miranda Bront
, Francisco J. Soulignac:
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. Eur. J. Oper. Res. 312(3): 978-995 (2024)- [j25]Marcos Blufstein, Gonzalo Lera-Romero, Francisco J. Soulignac:
Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone. INFORMS J. Comput. 36(4): 1064-1083 (2024) - 2023
- [j24]Santiago Cifuentes, Francisco J. Soulignac, Pablo Terlisky:
Complexity of solving a system of difference constraints with variables restricted to a finite set. Inf. Process. Lett. 182: 106378 (2023) - 2022
- [j23]Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac:
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 34(6): 3292-3308 (2022) - [i14]Francisco J. Soulignac, Pablo Terlisky:
Loop unrolling of UCA models: distance labeling. CoRR abs/2202.10527 (2022) - [i13]Santiago Cifuentes, Francisco J. Soulignac, Pablo Terlisky:
Complexity of solving a system of difference constraints with variables restricted to a finite set. CoRR abs/2211.05259 (2022) - 2021
- [j22]Francisco J. Soulignac:
Total 2-domination of proper interval graphs. Discret. Appl. Math. 302: 256-262 (2021) - [j21]Francisco J. Soulignac:
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. Theor. Comput. Sci. 889: 105-134 (2021) - 2020
- [j20]Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac:
Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows. Networks 76(1): 24-53 (2020)
2010 – 2019
- 2019
- [j19]Martín Rinemberg, Francisco J. Soulignac:
The eternal dominating set problem for interval graphs. Inf. Process. Lett. 146: 27-29 (2019) - 2018
- [i12]Martín Rinemberg, Francisco J. Soulignac:
The eternal dominating set problem for interval graphs. CoRR abs/1808.09591 (2018) - [i11]Francisco J. Soulignac:
Total 2-domination of proper interval graphs. CoRR abs/1812.00689 (2018) - 2017
- [j18]Francisco J. Soulignac:
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter I: theory. J. Graph Algorithms Appl. 21(4): 455-489 (2017) - [j17]Francisco J. Soulignac:
Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms. J. Graph Algorithms Appl. 21(4): 491-525 (2017) - 2016
- [i10]Francisco J. Soulignac, Pablo Terlisky:
Integrality of minimal unit circular-arc models. CoRR abs/1609.01266 (2016) - 2015
- [j16]Francisco J. Soulignac:
Fully Dynamic Recognition of Proper Circular-Arc Graphs. Algorithmica 71(4): 904-968 (2015) - [j15]Martiniano Eguía, Francisco J. Soulignac:
Disimplicial arcs, transitive vertices, and disimplicial eliminations. Discret. Math. Theor. Comput. Sci. 17(2): 101-118 (2015) - [j14]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
A faster algorithm for the cluster editing problem on proper interval graphs. Inf. Process. Lett. 115(12): 913-916 (2015) - [i9]Francisco J. Soulignac:
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs. CoRR abs/1509.05828 (2015) - 2014
- [j13]Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky:
Star and Biclique Coloring and Choosability. J. Graph Algorithms Appl. 18(3): 347-383 (2014) - [i8]Martiniano Eguía, Francisco J. Soulignac:
Disimplicial arcs, transitive vertices, and disimplicial eliminations. CoRR abs/1403.1628 (2014) - [i7]Francisco J. Soulignac:
Minimal and short representations of unit interval and unit circular-arc graphs. CoRR abs/1408.3443 (2014) - 2013
- [j12]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Normal Helly circular-arc graphs and its subclasses. Discret. Appl. Math. 161(7-8): 1037-1059 (2013) - [j11]Martiniano Eguía, Francisco J. Soulignac:
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration. Discret. Math. Theor. Comput. Sci. 15(1): 55-74 (2013) - [j10]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Isomorphism of graph classes related to the circular-ones property. Discret. Math. Theor. Comput. Sci. 15(1): 157-182 (2013) - 2012
- [j9]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Arboricity, h-index, and dynamic algorithms. Theor. Comput. Sci. 426: 75-90 (2012) - [i6]Andrew R. Curtis, Min Chih Lin, Ross M. McConnell, Yahav Nussbaum, Francisco J. Soulignac, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Isomorphism of graph classes related to the circular-ones property. CoRR abs/1203.4822 (2012) - [i5]Marina Groshaus, Francisco J. Soulignac, Pablo Terlisky:
The star and biclique coloring and choosability problems. CoRR abs/1210.7269 (2012) - 2011
- [j8]Min Chih Lin, Dieter Rautenbach, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Powers of cycles, powers of paths, and distance graphs. Discret. Appl. Math. 159(7): 621-627 (2011) - [i4]Martiniano Eguía, Francisco J. Soulignac:
Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration. CoRR abs/1103.1917 (2011) - [i3]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Subclasses of Normal Helly Circular-Arc Graphs. CoRR abs/1103.3732 (2011) - [i2]Francisco J. Soulignac:
Fully dynamic recognition of proper circular-arc graphs. CoRR abs/1111.3548 (2011) - 2010
- [j7]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
The clique operator on circular-arc graphs. Discret. Appl. Math. 158(12): 1259-1267 (2010) - [i1]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Arboricity, h-Index, and Dynamic Algorithms. CoRR abs/1005.2211 (2010)
2000 – 2009
- 2009
- [j6]Francisco J. Soulignac, Gabriel Sueiro:
NP-hardness of the recognition of coordinated graphs. Ann. Oper. Res. 169(1): 17-34 (2009) - [j5]Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs. Discret. Appl. Math. 157(17): 3511-3518 (2009) - [j4]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Short Models for Unit Interval Graphs. Electron. Notes Discret. Math. 35: 247-255 (2009) - [j3]Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
Partial characterizations of coordinated graphs: line graphs and complements of forests. Math. Methods Oper. Res. 69(2): 251-270 (2009) - 2008
- [j2]Flavia Bonomo, Guillermo Durán, Francisco J. Soulignac, Gabriel Sueiro:
Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs. Electron. Notes Discret. Math. 30: 51-56 (2008) - [j1]Min Chih Lin, Ross M. McConnell, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
On cliques of Helly Circular-arc Graphs. Electron. Notes Discret. Math. 30: 117-122 (2008) - [c2]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs. SWAT 2008: 355-366 - 2007
- [c1]Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter:
Proper Helly Circular-Arc Graphs. WG 2007: 248-257
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
