( en | de | ru )

 

Disambiguation of "Raskin, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
A unified algorithm for colouring graphs of bounded clique-width.

, , and . (2020)http://arxiv.org/abs/2008.07468.

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.

Peter Raskin

Gisela Raskin

Richard Raskin

Heinrich Raskin

Katrin Raskin

 

Other publications of authors with the same name

Sharp Thresholds in Random Simple Temporal Graphs, , , and . 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), page 319-326. (February 2022)Lisp in the middle - using Lisp to manage a Linux system.. ELS, page 36-44. ELSAA, (2021)Sharp Thresholds in Random Simple Temporal Graphs., , , and . CoRR, (2020)https://arxiv.org/abs/2011.03738.A unified algorithm for colouring graphs of bounded clique-width., , and . (2020)http://arxiv.org/abs/2008.07468.Accessing Local Variables During Debugging., and . ELS, page 93-94. ELSAA, (2016)Working with first-order proofs and provers., and . (2019)https://european-lisp-symposium.org/static/2019/raskin.pdf.Efficient Restrictions of Immediate Observation Petri Nets, and . (2020)http://arxiv.org/abs/2007.09189.Giant Components in Random Temporal Graphs., , , , , , and . CoRR, (2022)Giant Components in Random Temporal Graphs., , , , , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 29:1-29:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On defining linear orders by automata, , and . Moscow Journal of Combinatorics and Number Theory, 9 (3): 253-291 (2020)Preprint: <a href="https://hal.archives-ouvertes.fr/hal-02397982/">Link</a><br>#journal.