( en | de | ru )

 

Disambiguation of "Ramos, Lander"

Author of the publication

copydeleteadd this publication to your clipboard
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes.

, , , and . Electron. J. Comb., 27 (1): 1 (2020)

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.

Carlos Ramos Cuevas

On convex subcomplexes of spherical buildings and Tits' center conjecture. Uni München, (2009)

José Miguel Ramos Pittol

Eberhard Lander

Katja Lander

Stefan Lander

 

Other publications of authors with the same name

Subgraph statistics in subcritical graph classes., , and . Random Struct. Algorithms, 51 (4): 631-673 (2017)Excessively duplicating patterns represent non-regular languages., , and . Inf. Process. Lett., 114 (3): 85-93 (2014)Graphs with degree constraints., and . ANALCO, page 34-45. SIAM, (2016)Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes., , , and . AofA, volume 110 of LIPIcs, page 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The HOM Problem is EXPTIME-Complete., , , and . SIAM J. Comput., 45 (4): 1230-1260 (2016)The HOM problem is decidable., , , and . STOC, page 485-494. ACM, (2010)Random Planar Maps and Graphs with Minimum Degree Two and Three., and . Electron. J. Comb., 25 (4): 4 (2018)First-Order Unification on Compressed Terms., , and . RTA, volume 10 of LIPIcs, page 51-60. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes., , , and . Electron. J. Comb., 27 (1): 1 (2020)The HOM Problem is EXPTIME-Complete., , , and . LICS, page 255-264. IEEE Computer Society, (2012)