default search action
Siamak Tazari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c12]Yang Yu, Matthew Perez, Ankur Bapna, Fadi Haik, Siamak Tazari, Yu Zhang:
PronScribe: Highly Accurate Multimodal Phonemic Transcription From Speech and Text. INTERSPEECH 2023: 5541-5545 - 2022
- [c11]Manish Sharma, Yizhi Hong, Emily Kaplan, Siamak Tazari, Rob Clark:
Improving Phonetic Realizations in its by Using Phoneme-Aligned Graphemes. ICASSP 2022: 6077-6081
2010 – 2019
- 2016
- [c10]Xavi Gonzalvo, Siamak Tazari, Chun-an Chan, Markus Becker, Alexander Gutkin
, Hanna Silén:
Recent Advances in Google Real-Time HMM-Driven Unit Selection Synthesizer. INTERSPEECH 2016: 2238-2242 - 2014
- [j6]Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Algorithmica 68(2): 287-311 (2014) - 2012
- [j5]Lukas Moll, Siamak Tazari, Marc Thurley:
Computing hypergraph width measures exactly. Inf. Process. Lett. 112(6): 238-242 (2012) - [j4]Siamak Tazari:
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs. Theor. Comput. Sci. 417: 95-107 (2012) - [c9]Stephan Kreutzer, Siamak Tazari:
Directed nowhere dense classes of graphs. SODA 2012: 1552-1562 - 2011
- [j3]Siamak Tazari, Matthias Müller-Hannemann
Dealing with large hidden constants: engineering a planar steiner tree PTAS. ACM J. Exp. Algorithmics 16 (2011) - [i6]Stephan Kreutzer, Siamak Tazari:
Directed Nowhere Dense Classes of Graphs. CoRR abs/1104.3808 (2011) - [i5]Lukas Moll, Siamak Tazari, Marc Thurley:
Computing hypergraph width measures exactly. CoRR abs/1106.4719 (2011) - 2010
- [b1]Siamak Tazari:
Algorithmic graph minor theory: approximation, parameterized complexity, and practical aspects. Humboldt University of Berlin, 2010, pp. 1-212 - [j2]Matthias Müller-Hannemann
A near linear time approximation scheme for Steiner tree among obstacles in the plane. Comput. Geom. 43(4): 395-409 (2010) - [c8]Stephan Kreutzer, Siamak Tazari:
Lower Bounds for the Complexity of Monadic Second-Order Logic. LICS 2010: 189-198 - [c7]Siamak Tazari:
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs. MFCS 2010: 641-652 - [c6]Stephan Kreutzer, Siamak Tazari:
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. SODA 2010: 354-364 - [i4]Stephan Kreutzer, Siamak Tazari:
Lower Bounds for the Complexity of Monadic Second-Order Logic. CoRR abs/1001.5019 (2010) - [i3]Siamak Tazari:
Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs. CoRR abs/1004.3392 (2010)
2000 – 2009
- 2009
- [j1]Siamak Tazari, Matthias Müller-Hannemann
Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation. Discret. Appl. Math. 157(4): 673-684 (2009) - [c5]Siamak Tazari, Matthias Müller-Hannemann
Dealing with Large Hidden Constants: Engineering a Planar Steiner Tree PTAS. ALENEX 2009: 120-131 - [c4]Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. STACS 2009: 171-182 - [i2]Glencora Borradaile, Erik D. Demaine, Siamak Tazari:
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. CoRR abs/0902.1043 (2009) - [i1]Stephan Kreutzer, Siamak Tazari:
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. CoRR abs/0907.3076 (2009) - 2008
- [c3]Siamak Tazari, Matthias Müller-Hannemann
A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. WG 2008: 360-371 - 2007
- [c2]Matthias Müller-Hannemann
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane. WADS 2007: 151-162 - 2006
- [c1]Siamak Tazari, Matthias Müller-Hannemann
Workload Balancing in Multi-stage Production Processes. WEA 2006: 49-60
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-06-16 23:54 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: