default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIvo Koch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal
, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos:
On the proper interval completion problem within some chordal subclasses. Discret. Math. 348(1): 114274 (2025)- 2024
- [j11]Ivo Koch, Nina Pardal, Vinícius Fernandes dos Santos:
Edge deletion to tree-like graph classes. Discret. Appl. Math. 348: 122-131 (2024) - 2023
- [j10]Ivo Koch, Javier Marenco:
A hybrid heuristic for the rectilinear picture compression problem. 4OR 21(2): 329-358 (2023) - 2022
- [j9]Ivo Koch, Javier Marenco:
The maximum 2D subarray polytope: Facet-inducing inequalities and polyhedral computations. Discret. Appl. Math. 323: 286-301 (2022) - [i3]Ivo Koch, Nina Pardal, Vinícius Fernandes dos Santos:
Edge deletion to tree-like graph classes. CoRR abs/2210.03839 (2022) - 2021
- [i2]François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos:
On the proper interval completion problem within some chordal subclasses. CoRR abs/2110.07706 (2021)
2010 – 2019
- 2019
- [j8]Ivo Koch, Javier Marenco:
An integer programming approach to b-coloring. Discret. Optim. 32: 43-62 (2019) - [c2]Ricardo C. Corrêa, Manuela Blaum, Javier Marenco, Ivo Koch, Marcelo Mydlarz:
An Integer Programming Approach for the 2-class Single-group Classification Problem. LAGOS 2019: 321-331 - [c1]Ivo Koch, Javier Marenco:
The 2D Subarray Polytope. LAGOS 2019: 557-566 - 2018
- [j7]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) - [j6]Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch, Javier Marenco:
General cut-generating procedures for the stable set polytope. Discret. Appl. Math. 245: 28-41 (2018) - [j5]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) - 2015
- [j4]Ivo Koch, Iztok Peterin:
The b-chromatic index of direct product of graphs. Discret. Appl. Math. 190-191: 109-117 (2015) - [j3]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) - [j2]Ricardo C. Corrêa, Javier Marenco, Diego Delle Donne, Ivo Koch:
A Strengthened General Cut-Generating Procedure for the Stable Set Polytope. Electron. Notes Discret. Math. 50: 261-266 (2015) - [i1]Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch, Javier Marenco:
General Cut-Generating Procedures for the Stable Set Polytope. CoRR abs/1512.08757 (2015) - 2011
- [j1]Clara Inés Betancur Velasquez, Flavia Bonomo, Ivo Koch:
On the b-coloring of P4-tidy graphs. Discret. Appl. Math. 159(1): 60-68 (2011)
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-12-10 21:42 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:
