Dani{\"{e}}l Paulusma | AC Group | TU Wienhttps://ac.notready.eu/author/dani%5Cel-paulusma/Dani{\"{e}}l PaulusmaHugo Blox Builder (https://hugoblox.com)en-usSat, 01 Jan 2011 00:00:00 +0000https://ac.notready.eu/media/logo_hu10234977157890132473.pngDani{\"{e}}l Paulusmahttps://ac.notready.eu/author/dani%5Cel-paulusma/Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)https://ac.notready.eu/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-ii/Sat, 01 Jan 2011 00:00:00 +0000https://ac.notready.eu/publication/satisfiability-of-acyclic-and-almost-acyclic-cnf-formulas-ii/On Contracting Graphs to Fixed Pattern Graphshttps://ac.notready.eu/publication/on-contracting-graphs-to-fixed-pattern-graphs/Fri, 01 Jan 2010 00:00:00 +0000https://ac.notready.eu/publication/on-contracting-graphs-to-fixed-pattern-graphs/Covering graphs with few complete bipartite subgraphshttps://ac.notready.eu/publication/covering-graphs-with-few-complete-bipartite-subgraphs-2/Thu, 01 Jan 2009 00:00:00 +0000https://ac.notready.eu/publication/covering-graphs-with-few-complete-bipartite-subgraphs-2/Covering Graphs with Few Complete Bipartite Subgraphshttps://ac.notready.eu/publication/covering-graphs-with-few-complete-bipartite-subgraphs/Mon, 01 Jan 2007 00:00:00 +0000https://ac.notready.eu/publication/covering-graphs-with-few-complete-bipartite-subgraphs/acyclic-cnf-formulas/