| 2008 |
|---|
| 32 | | Roland T. Mittermeir,
Maciej M. Syslo:
Informatics Education - Supporting Computational Thinking, Third International Conference on Informatics in Secondary Schools - Evolution and Perspectives, ISSEP 2008, Torun, Poland, July 1-4, 2008, Proceedings
Springer 2008 |
| 31 | EE | Maciej M. Syslo,
Anna Beata Kwiatkowska:
The Challenging Face of Informatics Education in Poland.
ISSEP 2008: 1-18 |
| 2006 |
|---|
| 30 | EE | Maciej M. Syslo,
Anna Beata Kwiatkowska:
Contribution of Informatics Education to Mathematics Education in Schools.
ISSEP 2006: 209-219 |
| 29 | EE | Anna Beata Kwiatkowska,
Maciej M. Syslo:
On Page Number of N-free Posets.
Electronic Notes in Discrete Mathematics 24: 243-249 (2006) |
| 2005 |
|---|
| 28 | EE | Maciej M. Syslo,
Anna Beata Kwiatkowska:
Informatics Versus Information Technology - How Much Informatics Is Needed to Use Information Technology - A School Perspective.
ISSEP 2005: 178-188 |
| 27 | EE | Ewa Gurbiel,
Grazyna Hardt-Olejniczak,
Ewa Kolczyk,
Helena Krupicka,
Maciej M. Syslo:
Informatics and ICT in Polish Education System.
ISSEP 2005: 46-52 |
| 26 | EE | Anna Beata Kwiatkowska,
Maciej M. Syslo:
On Posets of Page Number 2.
Electronic Notes in Discrete Mathematics 22: 549-552 (2005) |
| 2003 |
|---|
| 25 | | Divjak Dowling,
Sasja Dowling,
Carolyn Dowling,
Petra Fisser,
Anna Grabowska,
Marijke Hezemans,
Mike Kendall,
Pencho Mihnev,
Magda Ritzen,
Maciej M. Syslo,
Rosa Maria Vicari,
Tom J. van Weert:
Lifelong Learning in the Digital Age (Focus Group Report).
Lifelong Learning in the Digital Age 2003: 1-49 |
| 24 | | Maciej M. Syslo:
Schools as Lifelong Learning Institutions and the Role of Information Technology.
Lifelong Learning in the Digital Age 2003: 99-109 |
| 1998 |
|---|
| 23 | EE | Le Tu Quoc Hung,
Maciej M. Syslo,
Margaret L. Weaver,
Douglas B. West:
Bandwidth and density for block graphs.
Discrete Mathematics 189(1-3): 163-176 (1998) |
| 1996 |
|---|
| 22 | EE | Andrzej Proskurowski,
Maciej M. Syslo,
Pawel Winter:
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees.
SIAM J. Discrete Math. 9(4): 577-596 (1996) |
| 1995 |
|---|
| 21 | EE | Maciej M. Syslo:
on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets.
Discrete Applied Mathematics 60(1-3): 349-358 (1995) |
| 20 | EE | Maciej M. Syslo:
The jump number problem on interval orders: A 3/2 approximation algorithm.
Discrete Mathematics 144(1-3): 119-130 (1995) |
| 1994 |
|---|
| 19 | EE | Pawel Winter,
Maciej M. Syslo:
Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers.
Discrete Applied Mathematics 54(2-3): 267-280 (1994) |
| 1990 |
|---|
| 18 | | Maciej M. Syslo,
Pawel Winter:
In-Trees and Plane Embeddings of Outerplanar Graphs.
BIT 30(1): 83-90 (1990) |
| 17 | EE | Miroslawa Skowronska,
Maciej M. Syslo:
Dominating cycles in halin graphs.
Discrete Mathematics 86(1-3): 215-224 (1990) |
| 1989 |
|---|
| 16 | | Maciej M. Syslo:
Bounds to the Page Number of Partially Ordered Sets.
WG 1989: 181-195 |
| 15 | EE | Maciej M. Syslo:
Sequential coloring versus Welsh-Powell bound.
Discrete Mathematics 74(1-2): 241-243 (1989) |
| 1988 |
|---|
| 14 | | Andrzej Lingas,
Maciej M. Syslo:
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.
ICALP 1988: 394-409 |
| 13 | | Maciej M. Syslo,
Pawel Winter:
Independent Covers in Outerplanar Graphs.
SWAT 1988: 243-254 |
| 12 | EE | Maciej M. Syslo:
An algorithm for solving the jump number problem.
Discrete Mathematics 72(1-3): 337-346 (1988) |
| 1987 |
|---|
| 11 | EE | Maciej M. Syslo:
Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II.
Discrete Mathematics 63(2-3): 279-295 (1987) |
| 1986 |
|---|
| 10 | | Maciej M. Syslo:
On Some Generalizations of Outerplanar Graphs: Results and Open Problems.
WG 1986: 146-164 |
| 9 | | Miroslawa Skowronska,
Maciej M. Syslo,
Christina Zamfirescu:
An Algorithmic Characterization of Total Digraphs.
J. Algorithms 7(1): 120-133 (1986) |
| 1985 |
|---|
| 8 | EE | Maciej M. Syslo:
Triangulated edge intersection graphs of paths in a tree.
Discrete Mathematics 55(2): 217-220 (1985) |
| 7 | EE | Sandra Mitchell Hedetniemi,
Andrzej Proskurowski,
Maciej M. Syslo:
Interior graphs of maximal outerplane graphs.
J. Comb. Theory, Ser. B 38(2): 156-167 (1985) |
| 1982 |
|---|
| 6 | | Maciej M. Syslo:
A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph.
Inf. Process. Lett. 15(1): 28-30 (1982) |
| 5 | | Maciej M. Syslo:
The Subgraph Isomorphism Problem for Outerplanar Graphs.
Theor. Comput. Sci. 17: 91-97 (1982) |
| 1981 |
|---|
| 4 | EE | Maciej M. Syslo:
The Helly-type property of non-trivial intervals on a tree.
Discrete Mathematics 37(2-3): 297-298 (1981) |
| 3 | | Maciej M. Syslo:
An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph.
SIAM J. Comput. 10(4): 797-808 (1981) |
| 1975 |
|---|
| 2 | | Maciej M. Syslo:
The Elementary Circuits of a Graph (Remark on Algorithm 459).
Commun. ACM 18(2): 119 (1975) |
| 1973 |
|---|
| 1 | | Maciej M. Syslo:
The Elementary Circuits of a Graph [H] (Algorithm 459).
Commun. ACM 16(10): 632-633 (1973) |
