default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel E. Severín
Person information
- affiliation: Universidad Nacional de Rosario, Argentina
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Mauro Lucci, Graciela Nasini, Daniel Severín:
Solving the List Coloring Problem through a branch-and-price algorithm. Eur. J. Oper. Res. 315(3): 899-912 (2024)- 2023
- [j12]Mauro Lucci, Daniel E. Severín, Paula Zabala
:
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows. Int. Trans. Oper. Res. 30(2): 970-1001 (2023) - [i16]Mauro Lucci, Daniel E. Severín, Graciela L. Nasini:
Solving the List Coloring Problem through a Branch-and-Price algorithm. CoRR abs/2304.10995 (2023) - 2021
- [j11]Manoel B. Campêlo, Daniel Severín:
An integer programming approach for solving a generalized version of the Grundy domination number. Discret. Appl. Math. 301: 26-48 (2021) - [i15]Mauro Lucci, Daniel Severín, Paula Zabala:
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows. CoRR abs/2102.01780 (2021) - 2020
- [j10]Daniel Severín:
On the additive chromatic number of several families of graphs. Inf. Process. Lett. 158: 105937 (2020)
2010 – 2019
- 2019
- [c4]Daniel E. Severín:
Formalization of the Domination Chain with Weighted Parameters (Short Paper). ITP 2019: 36:1-36:7 - [c3]Mauro Lucci, Graciela L. Nasini, Daniel Severín:
A Branch and Price Algorithm for List Coloring Problem. LAGOS 2019: 613-624 - [i14]Manoel B. Campêlo, Daniel Severín:
An integer programming approach for solving a generalized version of the Grundy domination number. CoRR abs/1912.12752 (2019) - 2018
- [j9]Daniel Severín:
Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution. Electron. Notes Discret. Math. 69: 29-36 (2018) - [j8]Diego Recalde, Daniel Severín, Ramiro Torres, Polo Vaca:
An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment. J. Comb. Optim. 36(3): 916-936 (2018) - [i13]Manoel B. Campêlo, Daniel Severín:
The polytope of legal sequences. CoRR abs/1811.12360 (2018) - [i12]Mauro Lucci, Graciela L. Nasini, Daniel Severín:
A Branch and Price Algorithm for List Coloring Problem. CoRR abs/1812.00040 (2018) - 2017
- [j7]Manoel B. Campêlo, Daniel E. Severín:
Facets of the polytope of legal sequences. Electron. Notes Discret. Math. 62: 15-20 (2017) - [i11]Diego Recalde, Daniel E. Severín, Ramiro Torres, Polo Vaca:
An Exact Approach for the Balanced k-Way Partitioning Problem with Weight Constraints and its Application to Sports Team Realignment. CoRR abs/1709.01433 (2017) - [i10]Daniel E. Severín:
Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution. CoRR abs/1710.09417 (2017) - 2016
- [c2]Diego Recalde, Daniel E. Severín, Ramiro Torres, Polo Vaca:
Balanced Partition of a Graph for Football Team Realignment in Ecuador. ISCO 2016: 357-368 - [i9]Daniel E. Severín:
On the additive chromatic number of several families of graphs. CoRR abs/1602.07675 (2016) - 2015
- [j6]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A DSATUR-based algorithm for the Equitable Coloring Problem. Comput. Oper. Res. 57: 41-50 (2015) - [j5]Javier Marenco, Marcelo Mydlarz, Daniel E. Severín:
Topological additive numbering of directed acyclic graphs. Inf. Process. Lett. 115(2): 199-202 (2015) - [i8]Graciela L. Nasini, Daniel E. Severín, Pablo Daniel Torres:
On the Packing Chromatic Number on Hamming Graphs and General Graphs. CoRR abs/1510.05524 (2015) - 2014
- [j4]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A polyhedral approach for the equitable coloring problem. Discret. Appl. Math. 164: 413-426 (2014) - [c1]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A Tabu Search Heuristic for the Equitable Coloring Problem. ISCO 2014: 347-358 - [i7]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
An exact DSatur-based algorithm for the Equitable Coloring Problem. CoRR abs/1405.7011 (2014) - [i6]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A tabu search heuristic for the Equitable Coloring Problem. CoRR abs/1405.7020 (2014) - 2013
- [j3]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
An exact DSatur-based algorithm for the Equitable Coloring Problem. Electron. Notes Discret. Math. 44: 281-286 (2013) - [i5]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A new DSATUR-based algorithm for the Equitable Coloring Problem. CoRR abs/1306.1758 (2013) - [i4]Javier Marenco, Marcelo Mydlarz, Daniel E. Severín:
Additive Coloring with Fixed Orientations. CoRR abs/1310.4141 (2013) - 2011
- [j2]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
Polyhedral results for the Equitable Coloring Problem. Electron. Notes Discret. Math. 37: 159-164 (2011) - [i3]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
A polyhedral approach for the Equitable Coloring Problem. CoRR abs/1106.3348 (2011) - [i2]Isabel Méndez-Díaz, Graciela L. Nasini, Daniel E. Severín:
Polyhedral results for the Equitable Coloring Problem. CoRR abs/1106.3349 (2011)
2000 – 2009
- 2008
- [j1]Daniel E. Severín:
Unary primitive recursive functions. J. Symb. Log. 73(4): 1122-1138 (2008) - 2006
- [i1]Daniel E. Severín:
Unary Primitive Recursive Functions. CoRR abs/cs/0603063 (2006)
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 2024-08-03 20:14 CEST 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:
