( en | de | ru )

 

Disambiguation of "Syslo, Maciej M."

Author of the publication

copydeleteadd this publication to your clipboard
Bandwidth and density for block graphs.

, , , and . Discret. Math., 189 (1-3): 163-176 (1998)

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.

Maciej Wojnowski

Bernd Maciej

Maciej Krychowiak

Maciej Dorna

Maciej Małyga

 

Other publications of authors with the same name

On the computational complexity of the minimum-dummy-activities problem in a pert network.. Networks, 14 (1): 37-45 (1984)A characterization of hypergraphs generated by arborescences.. Kybernetika, 15 (6): 403-407 (1979)A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs., and . ICALP, volume 317 of Lecture Notes in Computer Science, page 394-409. Springer, (1988)Outreach to Prospective Informatics Students.. ISSEP, volume 7013 of Lecture Notes in Computer Science, page 56-70. Springer, (2011)Introducing a New Computer Science Curriculum for All School Levels in Poland., and . ISSEP, volume 9378 of Lecture Notes in Computer Science, page 141-154. Springer, (2015)The Subgraph Isomorphism Problem for Outerplanar Graphs.. Theor. Comput. Sci., (1982)Triangulated edge intersection graphs of paths in a tree.. Discret. Math., 55 (2): 217-220 (1985)From Algorithmic to Computational Thinking: On the Way for Computing for all Students.. ITiCSE, page 1. ACM, (2015)Playing with computing at a children's university., and . WiPSCE, page 104-107. ACM, (2014)NP-Complete Problems on Some Tree-Structured Graphs: a Review.. WG, page 342-353. Universitätsverlag Rudolf Trauner, Linz, (1983)