io-port.net

io-port 06106683 Dvořák, Wolfgang; Ordyniak, Sebastian; Szeider, Stefan

Augmenting tractable fragments of abstract argumentation. (English)

Artif. Intell. 186, 157-173 (2012).

1

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05973642 Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan

Algorithms and complexity results for persuasive argumentation. (English)

Artif. Intell. 175, No. 9-10, 1722-1736 (2011).

2

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05947166 Kreutzer, Stephan; Ordyniak, Sebastian

Digraph decompositions and monotonicity in digraph searching. (English)

Theor. Comput. Sci. 412, No. 35, 4688-4703 (2011).

3

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05923048 Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan

Algorithms and complexity results for persuasive argumentation. (English)

Comput. Res. Repos. 2011, Article No. 1104.4290 (2011).

4

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 05923046 Ordyniak, Sebastian; Paulusma, Daniël; Szeider, Stefan

Satisfiability of acyclic and almost acyclic CNF formulas (II). (English)

Comput. Res. Repos. 2011, Article No. 1104.4279 (2011).

5

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 05922881 Ordyniak, Sebastian; Szeider, Stefan

Augmenting tractable fragments of abstract argumentation. (English)

Comput. Res. Repos. 2011, Article No. 1104.2842 (2011).

6

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 05908736 Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan

Satisfiability of acyclic and almost acyclic CNF formulas (II). (English)

Sakallah, Karem A. (ed.) et al., Theory and applications of satisfiability testing ‒ SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21580-3/pbk). Lecture Notes in Computer Science 6695, 47-60 (2011).

7

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70129511 Ordyniak, Sebastian; Szeider, Stefan

Augmenting tractable fragments of abstract argumentation (English)

IJCAI, 1033-1038 (2011).

8

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70264058 Ordyniak, Sebastian; Paulusma, Daniël; Szeider, Stefan

Satisfiability of acyclic and almost acyclic CNF formulas (II) (English)

SAT, 47-60 (2011).

9

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 06073522 Ordyniak, Sebastian; Paulusma, Daniel; Szeider, Stefan

Satisfiability of acyclic and almost acyclic CNF formulas. (English)

Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPICS ‒ Leibniz International Proceedings in Informatics 8, 84-95, electronic only (2010).

10

PDF XML AMS-TeX TEXT BIBTeX DOI URL

io-port 05661068 Kreutzer, Stephan; Ordyniak, Sebastian

Distance $d$-domination games. (English)

Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24‒26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 308-319 (2010).

11

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70761814 Ordyniak, Sebastian; Szeider, Stefan

Algorithms and complexity results for exact Bayesian structure learning (English)

UAI, 401-408 (2010).

12

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70960335 Ordyniak, Sebastian; Paulusma, Daniël; Szeider, Stefan

Satisfiability of acyclic and almost acyclic CNF formulas (English)

FSTTCS, 84-95 (2010).

13

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 71037848 Kim, Eun Jung; Ordyniak, Sebastian; Szeider, Stefan

Algorithms and complexity results for persuasive argumentation (English)

COMMA, 311-322 (2010).

14

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 70060597 Kreutzer, Stephan; Ordyniak, Sebastian

Distance $d$-domination games (English)

WG, 308-319 (2009).

15

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05494808 Kreutzer, Stephan; Ordyniak, Sebastian

Digraph decompositions and monotonicity in digraph searching. (English)

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30‒July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 336-347 (2008).

16

PDF XML AMS-TeX TEXT BIBTeX DOI

io-port 05409395 Kreutzer, Stephan; Ordyniak, Sebastian

Digraph decompositions and monotonicity in digraph searching. (English)

Comput. Res. Repos. 2008, Article No. 0802.2228 (2008).

17

PDF XML AMS-TeX TEXT BIBTeX URL

io-port 70060071 Kreutzer, Stephan; Ordyniak, Sebastian

Digraph decompositions and monotonicity in digraph searching (English)

WG, 336-347 (2008).

18

PDF XML AMS-TeX TEXT BIBTeX DOI