Search Results - Hamm, Thekla

Relation: https://doi.org/10.1016/j.artint.2021.103648; Artificial Intelligence; Ganian , R , Hamm , T & Talvitie , T 2022 , ' An efficient algorithm for counting Markov equivalent DAGs ' , Artificial Intelligence , vol. 304 , 103648 . https://doi.org/10.1016/j.artint.2021.103648; PURE: 170846779; PURE UUID: 2ed0d492-9f76-44cd-9c93-2f2931ab6e03; RIS: urn:0C34AAACE6C4C5904B77B98067313394; WOS: 000768161000001; http://hdl.handle.net/10138/566630

Availability: https://doi.org/10.1016/j.artint.2021.103648
http://hdl.handle.net/10138/566630

5

Academic Journal

A Structural Complexity Analysis of Synchronous Dynamical Systems

Authors: Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Korchemna, Viktoriia

Superior Title: Eiben , E , Ganian , R , Hamm , T & Korchemna , V 2023 , A Structural Complexity Analysis of Synchronous Dynamical Systems . in 37th AAAI Conference on Artificial Intelligence, AAAI 2023 . pp. 6313-6321 , 37th AAAI Conference on Artificial Intelligence , Washington , District of Columbia , United States , 7/02/23 . https://doi.org/10.1609/aaai.v37i5.25777

File Description: application/pdf

Availability: https://doi.org/10.1609/aaai.v37i5.25777
https://rhul.elsevierpure.com/en/publications/5e3b42a4-7b94-499e-ad94-5fd303cc7a1e
https://pure.royalholloway.ac.uk/ws/files/49072824/main_18_.pdf

Zugang prüfen (DOI)

6

Academic Journal

Approximate Evaluation of Quantitative Second Order Queries

Authors: Dreier, Jan, Ganian, Robert, Hamm, Thekla

Subject Terms: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms, Computer Science - Logic in Computer Science, 68Q27, 05C85, 03B70

Relation: http://arxiv.org/abs/2305.02056

Availability: http://arxiv.org/abs/2305.02056

7

Academic Journal

Maximizing Social Welfare in Score-Based Social Distance Games

Authors: Ganian, Robert, Hamm, Thekla, Knop, Dušan, Roy, Sanjukta, Schierreich, Šimon, Suchý, Ondřej

Subject Terms: Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms

Relation: http://arxiv.org/abs/2307.05061; EPTCS 379, 2023, pp. 272-286

Availability: https://doi.org/10.4204/EPTCS.379.22
http://arxiv.org/abs/2307.05061

Zugang prüfen (DOI)

8

eBook

Computing Kemeny Rankings from d-Euclidean Preferences

Authors: Hamm, Thekla^Aff10, Lackner, Martin^Aff10, Rapberger, Anna^Aff10

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Fotakis, Dimitris, editor^Aff8, Ríos Insua, David, editor^Aff9

Superior Title: Algorithmic Decision Theory : 7th International Conference, ADT 2021, Toulouse, France, November 3–5, 2021, Proceedings. 13023:147-161

Zugang prüfen (DOI)

9

Academic Journal

An efficient algorithm for counting Markov equivalent DAGs

Authors: Ganian, Robert, Hamm, Thekla, Talvitie, Topi

Superior Title: In Artificial Intelligence March 2022 304

Zugang prüfen (DOI)

10

Conference

Parameterised Partially-Predrawn Crossing Number ...

Authors: Hamm, Thekla, Hliněný, Petr

Subject Terms: Crossing Number, Drawing Extension, Partial Planarity, Parameterised Complexity, Theory of computation → Fixed parameter tractability, Theory of computation → Computational geometry

File Description: application/pdf

Availability: https://doi.org/10.4230/lipics.socg.2022.4610.4230/LIPIcs.SoCG.202210.1145/262934110.1016/0196-6774(91)90006-K10.1016/j.tcs.2021.10.01710.1016/0890-5401(90)90043-H10.1007/978-3-319-21275-310.1007/978-1-4471-5559-110.4230/LIPIcs.MFCS.2020.3110.4230/LIPIcs.ICALP.2020.4310.1016/j.jcss.2021.04.00510.4230/LIPIcs.ICALP.2021.7210.1016/j.jcss.2003.07.00810.1016/j.jctb.2005.09.00910.1145/321850.32185210.1016/j.comgeo.2012.07.00510.1145/1250790.125084810.1006/jvlc.1995.1010

Zugang prüfen (DOI)

11

Conference

A Unifying Framework for Characterizing and Computing Width Measures ...

Authors: Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Jaffke, Lars, Kwon, O-joung

Subject Terms: branchwidth, parameterized algorithms, mim-width, treewidth, clique-width, Theory of computation → Parameterized complexity and exact algorithms

File Description: application/pdf

Relation: https://dx.doi.org/10.4230/LIPIcs.ITCS.2022; https://dx.doi.org/10.1016/j.tcs.2013.01.011; https://dx.doi.org/10.1137/20M1350571; https://dx.doi.org/10.4230/LIPIcs.STACS.2020.57; https://dx.doi.org/10.1016/j.tcs.2013.01.009; https://dx.doi.org/10.1007/978-3-319-21275-3; https://dx.doi.org/10.4230/LIPIcs.IPEC.2019.20; https://dx.doi.org/10.1016/j.tcs.2019.09.012; https://dx.doi.org/10.1016/j.jalgor.2004.12.003

Availability: https://doi.org/10.4230/lipics.itcs.2022.6310.4230/LIPIcs.ITCS.202210.1016/j.tcs.2013.01.01110.1137/20M135057110.4230/LIPIcs.STACS.2020.5710.1016/j.tcs.2013.01.00910.1007/978-3-319-21275-310.4230/LIPIcs.IPEC.2019.2010.1016/j.tcs.2019.09.01210.1016/j.jalgor.2004.12.003

Zugang prüfen (DOI)

12

Conference

The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width ...

Authors: Ganian, Robert, Hamm, Thekla, Korchemna, Viktoriia, Okrasa, Karolina, Simonov, Kirill

Subject Terms: homomorphism, clique-width, fine-grained complexity, Theory of computation → Parameterized complexity and exact algorithms

File Description: application/pdf

Availability: https://doi.org/10.4230/lipics.icalp.2022.6610.4230/LIPIcs.ICALP.202210.1145/305109410.1002/jgt.1007310.1137/S009753979426676610.1007/s00224-007-2007-x10.1016/0095-8956(90)90132-J10.1016/j.jctb.2005.10.00610.1006/jcss.2001.177410.1137/19M128032610.7151/dmgt.117510.4230/LIPIcs.ESA.2020.7410.1007/s00224-010-9261-z

Zugang prüfen (DOI)

13

Academic Journal

The Complexity of Envy-Free Graph Cutting ...

Authors: Deligkas, Argyrios, Eiben, Eduard, Ganian, Robert, Hamm, Thekla, Ordyniak, Sebastian

Subject Terms: Data Structures and Algorithms cs.DS, Artificial Intelligence cs.AI, Computational Complexity cs.CC, FOS Computer and information sciences

Availability: https://doi.org/10.48550/arxiv.2312.07043
https://arxiv.org/abs/2312.07043

Zugang prüfen (DOI)

14

Academic Journal

Hedonic Diversity Games: A Complexity Picture with More than Two Colors

Authors: Ganian, Robert, Hamm, Thekla, Knop, Dušan, Schierreich, Šimon, Suchý, Ondřej

Subject Terms: Computer Science - Computer Science and Game Theory

Relation: http://arxiv.org/abs/2202.09210; Artificial Intelligence 325 (2023) 104017:1-20

Availability: https://doi.org/10.1016/j.artint.2023.104017
http://arxiv.org/abs/2202.09210

Zugang prüfen (DOI)

15

Academic Journal

The Complexity of Temporal Vertex Cover in Small-Degree Graphs

Authors: Hamm, Thekla, Klobas, Nina, Mertzios, George B., Spirakis, Paul G.

Subject Terms: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics

Relation: http://arxiv.org/abs/2204.04832

Availability: http://arxiv.org/abs/2204.04832

16

Conference

Crossing-Optimal Extension of Simple Drawings ...

Authors: Ganian, Robert, Hamm, Thekla, Klute, Fabian, Parada, Irene, Vogtenhuber, Birgit

Subject Terms: Simple drawings, Extension problems, Crossing minimization, FPT-algorithms, Theory of computation → Parameterized complexity and exact algorithms, Theory of computation → Computational geometry

File Description: application/pdf

Availability: https://doi.org/10.4230/lipics.icalp.2021.7210.4230/LIPIcs.ICALP.202110.1145/262934110.1016/j.jctb.2019.08.00610.1007/978-3-030-68766-3_2110.1016/0196-6774(91)90006-K10.4230/LIPIcs.SoCG.2020.910.1007/978-3-030-35802-0_1810.1007/978-3-030-60440-0_2610.1002/jgt.2216710.1137/1.9781611974782.13010.20382/jocg.v9i1a710.7155/jgaa.0025710.7155/jgaa.0037510.4230/LIPIcs.SoCG.2016.3010.1016/0890-5401(90)90043-H10.1007/978-3-319-21275-310.1145/2744447.2744454

Zugang prüfen (DOI)