default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTatiana Romina Hartinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j10]Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs. Theor. Comput. Sci. 795: 128-141 (2019)- 2018
- [j9]Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. Discret. Appl. Math. 248: 33-45 (2018) - [j8]Bostjan Bresar, Tatiana Romina Hartinger, Tim Kos, Martin Milanic:
On total domination in the Cartesian product of graphs. Discuss. Math. Graph Theory 38(4): 963-976 (2018) - [j7]Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson
, Martin Milanic, Daniël Paulusma:
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity. Theor. Comput. Sci. 705: 75-83 (2018) - [c2]Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
Improved Algorithms for k-Domination and Total k-Domination in Proper Interval Graphs. ISCO 2018: 290-302 - [i4]Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni, Maria Inés Lopez Pujato, Martin Milanic:
New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs. CoRR abs/1803.04327 (2018) - 2017
- [j6]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On two extensions of equimatchable graphs. Discret. Optim. 26: 112-130 (2017) - [j5]Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable graphs and graph products. Discret. Math. 340(7): 1727-1737 (2017) - [j4]Tatiana Romina Hartinger, Martin Milanic:
Partial Characterizations of 1-Perfectly Orientable Graphs. J. Graph Theory 85(2): 378-394 (2017) - [i3]Nina Chiarelli, Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity. CoRR abs/1706.08050 (2017) - 2016
- [j3]Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
The price of connectivity for cycle transversals. Eur. J. Comb. 58: 203-224 (2016) - [j2]Bostjan Bresar, Tim Kos, Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable K4-minor-free and outerplanar graphs. Electron. Notes Discret. Math. 54: 199-204 (2016) - [j1]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. 55: 177-180 (2016) - 2015
- [c1]Tatiana Romina Hartinger, Matthew Johnson, Martin Milanic, Daniël Paulusma:
The Price of Connectivity for Cycle Transversals. MFCS (2) 2015: 395-406 - [i2]Tatiana Romina Hartinger, Martin Milanic:
1-perfectly orientable graphs and graph products. CoRR abs/1511.07314 (2015) - 2014
- [i1]Tatiana Romina Hartinger, Martin Milanic:
On the structure of 1-perfectly orientable graphs. CoRR abs/1411.6663 (2014)
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 2025-01-09 13:20 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:
