default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMario Valencia-Pabon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Agustina Victoria Ledezma, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon:
On the diameter of Schrijver graphs. Discret. Appl. Math. 350: 15-30 (2024)- [j36]Jean Cardinal, Lionel Pournin
, Mario Valencia-Pabon:
The rotation distance of brooms. Eur. J. Comb. 118: 103877 (2024) - 2022
- [j35]Celina M. H. de Figueiredo, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On total and edge coloring some Kneser graphs. J. Comb. Optim. 44(1): 119-135 (2022) - [i5]Mitre Costa Dourado, Luciano N. Grippo, Mario Valencia-Pabon:
On restricted completions of chordal and trivially perfect graphs. CoRR abs/2204.06842 (2022) - 2021
- [j34]Luciano N. Grippo, Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon, Juan C. Vera:
On the $P_3$-Hull Number of Kneser Graphs. Electron. J. Comb. 28(3) (2021) - [c7]Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. LAGOS 2021: 239-247 - [c6]Adrián Pastine, Pablo Daniel Torres, Mario Valencia-Pabon:
On the diameter of Schrijver graphs. LAGOS 2021: 266-274 - [c5]Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Brasil Kowada, Caroline Reis Patrão, Diana Sasaki, Mario Valencia-Pabon:
On total coloring the direct product of complete graphs. LAGOS 2021: 306-314 - [i4]Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon:
Bounds on the Diameter of Graph Associahedra. CoRR abs/2106.16130 (2021) - 2020
- [j33]Flavia Bonomo-Braberman, Mitre Costa Dourado, Mario Valencia-Pabon, Juan C. Vera:
A note on homomorphisms of Kneser hypergraphs. Appl. Math. Comput. 366 (2020) - [j32]Frédérique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, Mario Valencia-Pabon:
Preface: LAGOS 2017 - IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M. - Marseille, France, 2017. Discret. Appl. Math. 281: 1 (2020) - [j31]Bostjan Bresar, Mario Valencia-Pabon:
On the P3-hull number of Hamming graphs. Discret. Appl. Math. 282: 48-52 (2020)
2010 – 2019
- 2019
- [j30]Bostjan Bresar, Mario Valencia-Pabon:
Independence number of products of Kneser graphs. Discret. Math. 342(4): 1017-1027 (2019) - 2018
- [j29]Flavia Bonomo, Guillermo Durán, Ivo Koch, Mario Valencia-Pabon:
On the (k, i)-coloring of cacti and complete graphs. Ars Comb. 137: 317-333 (2018) - [j28]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Discret. Appl. Math. 234: 12-21 (2018) - [j27]Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon:
k-tuple colorings of the Cartesian product of graphs. Discret. Appl. Math. 245: 177-182 (2018) - 2017
- [j26]Pablo Daniel Torres, Mario Valencia-Pabon:
Shifts of the stable Kneser graphs and hom-idempotence. Eur. J. Comb. 62: 50-57 (2017) - [j25]Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon, Juan C. Vera:
LAGOS 2017 - IX Latin and American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 62: 1-2 (2017) - 2015
- [j24]Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs. Algorithmica 73(2): 289-305 (2015) - [j23]Pablo Daniel Torres, Mario Valencia-Pabon:
The packing chromatic number of hypercubes. Discret. Appl. Math. 190-191: 127-140 (2015) - [j22]Flavia Bonomo, Ivo Koch, Pablo Daniel Torres, Mario Valencia-Pabon:
k-tuple chromatic number of the cartesian product of graphs. Electron. Notes Discret. Math. 50: 243-248 (2015) - [j21]Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon:
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electron. Notes Discret. Math. 50: 249-254 (2015) - [j20]Flavia Bonomo, Guillermo Durán, Amedeo Napoli, Mario Valencia-Pabon:
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs. Inf. Process. Lett. 115(6-8): 600-603 (2015) - [j19]Flavia Bonomo, Guillermo Durán, Mario Valencia-Pabon:
Complexity of the cluster deletion problem on subclasses of chordal graphs. Theor. Comput. Sci. 600: 59-69 (2015) - 2014
- [j18]Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. Discret. Appl. Math. 164: 357-359 (2014) - [j17]Flavia Bonomo, Mario Valencia-Pabon:
On the Minimum Sum Coloring of P 4-Sparse Graphs. Graphs Comb. 30(2): 303-314 (2014) - [c4]Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-Coloring is NP-Hard on Co-Bipartite Graphs and Polytime Solvable on Tree-Cographs. ISCO 2014: 100-111 - 2013
- [j16]Pablo Daniel Torres, Mario Valencia-Pabon:
On the packing chromatic number of hypercubes. Electron. Notes Discret. Math. 44: 263-268 (2013) - [i3]Flavia Bonomo, Oliver Schaudt, Maya Stein, Mario Valencia-Pabon:
b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs. CoRR abs/1310.8313 (2013) - 2011
- [j15]Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon:
Minimum sum set coloring of trees and line graphs of trees. Discret. Appl. Math. 159(5): 288-294 (2011) - [j14]Flavia Bonomo, Thomas M. Liebling, Javier Marenco, Jayme Luiz Szwarcfiter, Mario Valencia-Pabon:
LAGOS 2011 - VI Latin-American Algorithms, Graphs, and Optimization Symposium. Electron. Notes Discret. Math. 37: 1-2 (2011) - [j13]Mekkia Kouider, Mario Valencia-Pabon:
On lower bounds for the b-chromatic number of connected bipartite graphs. Electron. Notes Discret. Math. 37: 399-404 (2011) - 2010
- [j12]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Minimum sum edge colorings of multicycles. Discret. Appl. Math. 158(12): 1216-1223 (2010) - [j11]Mario Valencia-Pabon:
Idomatic partitions of direct products of complete graphs. Discret. Math. 310(5): 1118-1122 (2010)
2000 – 2009
- 2009
- [j10]Flavia Bonomo, Mario Valencia-Pabon:
Minimum Sum Coloring of P4-sparse graphs. Electron. Notes Discret. Math. 35: 293-298 (2009) - [j9]Flavia Bonomo, Guillermo Durán, Frédéric Maffray, Javier Marenco, Mario Valencia-Pabon:
On the b-Coloring of Cographs and P4-Sparse Graphs. Graphs Comb. 25(2): 153-167 (2009) - [c3]Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon:
Minimum Sum Set Coloring on some Subclasses of Block Graphs. CTW 2009: 195-198 - 2008
- [j8]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs. Electron. Notes Discret. Math. 30: 39-44 (2008) - [j7]Christian Lavault, Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees. J. Parallel Distributed Comput. 68(2): 200-208 (2008) - 2007
- [i2]Jean Cardinal, Vlady Ravelomanana, Mario Valencia-Pabon:
Chromatic Edge Strength of Some Multigraphs. CoRR abs/0706.3848 (2007) - 2006
- [j6]Mario Valencia-Pabon, Juan Vera:
Independence and coloring properties of direct products of some vertex-transitive graphs. Discret. Math. 306(18): 2275-2281 (2006) - [i1]Christian Lavault, Mario Valencia-Pabon:
A distributed approximation algorithm for the minimum degree minimum weight spanning trees. CoRR abs/cs/0607031 (2006) - 2005
- [j5]Sylvie Corteel, Mario Valencia-Pabon, Juan-Carlos Vera:
On approximating the b-chromatic number. Discret. Appl. Math. 146(1): 106-110 (2005) - [j4]Mario Valencia-Pabon, Juan-Carlos Vera:
On the diameter of Kneser graphs. Discret. Math. 305(1-3): 383-385 (2005) - 2003
- [j3]Mario Valencia-Pabon:
Revisiting Tucker's Algorithm to Color Circular Arc Graphs. SIAM J. Comput. 32(4): 1067-1072 (2003) - [j2]Sylvie Corteel, Mario Valencia-Pabon, Danièle Gardy, Dominique Barth, Alain Denise:
The permutation-path coloring problem on trees. Theor. Comput. Sci. 297(1-3): 119-143 (2003) - 2001
- [j1]Mario Valencia-Pabon:
Revisiting Tucker's Algorithm to Color Circular-Arc Graphs. Electron. Notes Discret. Math. 7: 198-201 (2001) - 2000
- [c2]Dominique Barth, Sylvie Corteel, Alain Denise, Danièle Gardy, Mario Valencia-Pabon:
On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract. LATIN 2000: 308-317
1990 – 1999
- 1999
- [c1]Dominique Barth, Mario Valencia-Pabon:
Message Scheduling on Trees under a Generalized Line-Communication Model. ISPAN 1999: 10-15
Coauthor Index
aka: Flavia Bonomo
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-05 21:20 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:
