default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaudio Telha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Andreas S. Schulz
, Claudio Telha:
Integer Factorization: Why Two-Item Joint Replenishment Is Hard. Oper. Res. 72(3): 1192-1202 (2024)- [j7]Andreas S. Schulz, Claudio Telha:
On the complexity of a maintenance problem for hierarchical systems. Oper. Res. Lett. 54: 107117 (2024) - 2023
- [i3]Andreas S. Schulz, Claudio Telha:
On the complexity of a maintenance problem for hierarchical systems. CoRR abs/2312.17569 (2023) - 2022
- [j6]Cristóbal Guzmán, Javiera Riffo, Claudio Telha, Mathieu Van Vyve:
A sequential Stackelberg game for dynamic inspection problems. Eur. J. Oper. Res. 302(2): 727-739 (2022) - 2021
- [j5]José A. Soto, Claudio Telha:
Independent Sets and Hitting Sets of Bicolored Rectangular Families. Algorithmica 83(6): 1918-1952 (2021) - [j4]Kenneth Page, Juan Pérez, Claudio Telha, Andrés García-Echalar, Héctor A. López-Ospina:
Optimal bundle composition in competition for continuous attributes. Eur. J. Oper. Res. 293(3): 1168-1187 (2021) - 2020
- [i2]Andreas S. Schulz, Claudio Telha:
Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard. CoRR abs/2007.09045 (2020)
2010 – 2019
- 2018
- [j3]Fahimeh Shamsaei, Claudio Telha, Mathieu Van Vyve:
On the on-line maintenance scheduling problem. Optim. Lett. 12(2): 387-397 (2018) - 2016
- [j2]Claudio Telha, Mathieu Van Vyve:
Efficient approximation schemes for Economic Lot-Sizing in continuous time. Discret. Optim. 20: 23-39 (2016) - 2014
- [i1]José A. Soto, Claudio Telha:
Independent sets and hitting sets of bicolored rectangular families. CoRR abs/1411.2311 (2014) - 2011
- [j1]Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha:
On-line approximate string matching with bounded errors. Theor. Comput. Sci. 412(45): 6359-6370 (2011) - [c4]Andreas S. Schulz, Claudio Telha:
Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands. ESA 2011: 628-639 - [c3]José A. Soto, Claudio Telha:
Jump Number of Two-Directional Orthogonal Ray Graphs. IPCO 2011: 389-403 - [c2]Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha:
Optimization over Integers with Robustness in Cost and Few Constraints. WAOA 2011: 89-101
2000 – 2009
- 2008
- [c1]Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha:
On-Line Approximate String Matching with Bounded Errors. CPM 2008: 130-142
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-07-20 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:
