( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Expanding the expressive power of Monadic Second-Order logic on restricted graph classes.

, и . CoRR, (2013)

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.

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)

Matthäus Janczyk

Synthese funktionalisierter Trinukleotide und ihre Anwendung bei der Randomisierung. Uni Greifswald, (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)
 

Другие публикации лиц с тем же именем

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