( en | de | ru )

 

Disambiguation of "Obdrzálek, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
STANSE: Bug-Finding Framework for C Programs.

, , and . MEMICS, volume 7119 of Lecture Notes in Computer Science, page 167-178. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tsai-Yu Jansen

Einfluss der Konversion laparoskopischer Operationen auf Tumorwachstum, hepatische Metastasierung und Tumorangiogenese. Uni Heidelberg, (2010)

Dirk Jansen

Temperaturkorrektur von mit dem Falling-Weight-Deflectometer gemessenen Deflexionen auf Asphaltbefestigungen. Uni Duisburg-Essen, (2009)

Christoph Janello

Wertschöpfung im digitalisierten Buchmarkt. Uni München, (2010)

Richard Janissen

Biomolecular based nano-manipulation with a combined atomic force microscope and single molecule fluorescence setup. Uni Düsseldorf, (2009)

Matthäus Janczyk

Synthese funktionalisierter Trinukleotide und ihre Anwendung bei der Randomisierung. Uni Greifswald, (2009)
 

Other publications of authors with the same name

FO Model Checking of Interval Graphs., , , , , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 250-262. Springer, (2013)Tree-depth and vertex-minors., , , and . Eur. J. Comb., (2016)STANSE: Bug-finding Framework for C Programs, , and . CoRR, (2012)Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width., , and . Fundam. Informaticae, 123 (1): 59-76 (2013)Faster Existential FO Model Checking on Posets., , , and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 441-451. Springer, (2014)Clique-Width and Parity Games.. CSL, volume 4646 of Lecture Notes in Computer Science, page 54-68. Springer, (2007)First order limits of sparse graphs: Plane trees and path-width., , , , , , , and . Random Struct. Algorithms, 50 (4): 612-635 (2017)A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width., , and . Eur. J. Comb., 34 (3): 680-701 (2013)Qualitative Reachability in Stochastic BPA Games., , , and . STACS, volume 3 of LIPIcs, page 207-218. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)A New Perspective on FO Model Checking of Dense Graph Classes., , , , and . CoRR, (2018)