default search action
Stefan Szeider
- > Home > Persons > Stefan Szeider
Publications
- 2015
- [j50]Gregory Z. Gutin, Stefan Szeider
:
Guest Editorial: Special Issue on Parameterized and Exact Computation. Algorithmica 71(3): 539-540 (2015) - 2013
- [j39]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 53(4): 690-691 (2013) - [e5]Gregory Z. Gutin, Stefan Szeider
Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8246, Springer 2013, ISBN 978-3-319-03897-1 [contents] - 2012
- [j36]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica 64(1): 112-125 (2012) - 2011
- [j32]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider
Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica 61(3): 638-655 (2011) - [j27]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider
A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2): 422-429 (2011) - [i17]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider, Anders Yeo:
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. CoRR abs/1106.3527 (2011) - 2010
- [c30]Gregory Z. Gutin, Eun Jung Kim, Arezou Soleimanfallah, Stefan Szeider
Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. IPEC 2010: 158-169 - [c28]Noga Alon, Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider
Solving MAX-r-SAT Above a Tight Lower Bound. SODA 2010: 511-517 - 2009
- [c25]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds. IWPEC 2009: 234-245 - [i11]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
A Probabilistic Approach to Problems Parameterized Above Tight Lower Bound. CoRR abs/0906.1356 (2009) - [i10]Gregory Z. Gutin, Eun Jung Kim, Stefan Szeider, Anders Yeo:
Solving MAX-2-SAT Above a Tight Lower Bound. CoRR abs/0907.4573 (2009) - 2008
- [j17]Gregory Z. Gutin, Stefan Szeider
Fixed-Parameter Complexity of Minimum Profile Problems. Algorithmica 52(2): 133-152 (2008) - 2007
- [j13]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider
The Linear Arrangement Problem Parameterized Above Guaranteed Value. Theory Comput. Syst. 41(3): 521-538 (2007) - 2006
- [c12]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CIAC 2006: 356-367 - [c10]Gregory Z. Gutin, Stefan Szeider
Fixed-Parameter Complexity of Minimum Profile Problems. IWPEC 2006: 60-71 - [i8]Gregory Z. Gutin, Stefan Szeider, Anders Yeo:
Fixed-Parameter Complexity of Minimum Profile Problems. CoRR abs/cs/0604095 (2006) - 2005
- [i5]Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo:
The Linear Arrangement Problem Parameterized Above Guaranteed Value. CoRR abs/cs/0511030 (2005)
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-11-14 23:51 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: