Daniel E. Severín

Orcid: 0000-0003-2391-3489

Affiliations:
  • Universidad Nacional de Rosario, Argentina


According to our database1, Daniel E. Severín authored at least 22 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Solving the List Coloring Problem through a branch-and-price algorithm.
Eur. J. Oper. Res., 2024

2023
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows.
Int. Trans. Oper. Res., 2023

Solving the List Coloring Problem through a Branch-and-Price algorithm.
CoRR, 2023

2021
An integer programming approach for solving a generalized version of the Grundy domination number.
Discret. Appl. Math., 2021

2020
On the additive chromatic number of several families of graphs.
Inf. Process. Lett., 2020

2019
A Branch and Price Algorithm for List Coloring Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Formalization of the Domination Chain with Weighted Parameters (Short Paper).
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment.
J. Comb. Optim., 2018

Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution.
Electron. Notes Discret. Math., 2018

The polytope of legal sequences.
CoRR, 2018

2017
Facets of the polytope of legal sequences.
Electron. Notes Discret. Math., 2017

2016
Balanced Partition of a Graph for Football Team Realignment in Ecuador.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
Topological additive numbering of directed acyclic graphs.
Inf. Process. Lett., 2015

On the Packing Chromatic Number on Hamming Graphs and General Graphs.
CoRR, 2015

A DSATUR-based algorithm for the Equitable Coloring Problem.
Comput. Oper. Res., 2015

2014
A polyhedral approach for the equitable coloring problem.
Discret. Appl. Math., 2014

A Tabu Search Heuristic for the Equitable Coloring Problem.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
An exact DSatur-based algorithm for the Equitable Coloring Problem.
Electron. Notes Discret. Math., 2013

A new DSATUR-based algorithm for the Equitable Coloring Problem.
CoRR, 2013

Additive Coloring with Fixed Orientations.
CoRR, 2013

2011
Polyhedral results for the Equitable Coloring Problem.
Electron. Notes Discret. Math., 2011

2008
Unary primitive recursive functions.
J. Symb. Log., 2008


  Loading...