Maciej M. Syslo

Publication Activity (10 Years)

Years Active: 1973-2023
Publications (10 Years): 5

Top Topics

Computer Science

Inter Disciplinary

Top Venues

ISSEP (Local Proceedings)

Educ. Inf. Technol.

it Inf. Technol.

Publications

Maciej M. Syslo
Computer Science Education with a Computer in the Background. ISSEP (Local Proceedings) (2023)
Maciej M. Syslo
The new computer science curriculum in Poland - challenges and solutions. ISSEP (CEURWS Volume) (2020)
Mary E. Webb, Tim Bell, Niki Davis, Yaacov J. Katz, Andrew E. Fluck, Maciej M. Syslo, Ivan Kalas, Margaret J. Cox, Charoula Angeli, Joyce Malyn-Smith, Torsten Brinda, Peter Micheuz, Andrej Brodnik
Tensions in specifying computing curricula for K-12: Towards a principled approach for objectives. it Inf. Technol. 60 (2) (2018)
Mary Webb, Niki Davis, Tim Bell, Yaacov J. Katz, Nicholas Reynolds, Dianne P. Chambers, Maciej M. Syslo
Computer science in K-12 school curricula of the 2lst century: Why, what and when? Educ. Inf. Technol. 22 (2) (2017)
Mary Webb, Tim Bell, Niki Davis, Yaacov J. Katz, Nicholas Reynolds, Dianne P. Chambers, Maciej M. Syslo, Andrew E. Fluck, Margaret J. Cox, Charoula Angeli, Joyce Malyn-Smith, Joke Voogt, Jason Zagami, Peter Micheuz, Yousra Chtouki, Natasa Mori
Computer Science in the School Curriculum: Issues and Challenges. WCCE (2017)
Maciej M. Syslo, Anna Beata Kwiatkowska
Introducing a New Computer Science Curriculum for All School Levels in Poland. ISSEP (2015)
Maciej M. Syslo, Anna Beata Kwiatkowska
Playing with computing at a children's university. WiPSCE (2014)
Maciej M. Syslo, Anna Beata Kwiatkowska
Introducing Students to Recursion: A Multi-facet and Multi-tool Approach. ISSEP (2014)
Maciej M. Syslo, Anna Beata Kwiatkowska
Informatics for All High School Students - A Computational Thinking Approach. ISSEP (2013)
Maciej M. Syslo
Outreach to Prospective Informatics Students. ISSEP (2011)
Maciej M. Syslo, Anna Beata Kwiatkowska
The Challenging Face of Informatics Education in Poland. ISSEP (2008)
Anna Beata Kwiatkowska, Maciej M. Syslo
On Page Number of N-free Posets. Electron. Notes Discret. Math. 24 (2006)
Maciej M. Syslo, Anna Beata Kwiatkowska
Contribution of Informatics Education to Mathematics Education in Schools. ISSEP (2006)
Maciej M. Syslo, Anna Beata Kwiatkowska
Information Technology - How Much Informatics Is Needed to Use Information Technology - A School Perspective. ISSEP (2005)
Anna Beata Kwiatkowska, Maciej M. Syslo
On Posets of Page Number 2. Electron. Notes Discret. Math. 22 (2005)
Ewa Gurbiel, Grazyna Hardt-Olejniczak, Ewa Kolczyk, Helena Krupicka, Maciej M. Syslo
Informatics and ICT in Polish Education System. ISSEP (2005)
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)
Maciej M. Syslo
Schools as Lifelong Learning Institutions and the Role of Information Technology. Lifelong Learning in the Digital Age (2003)
Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo
Hamiltonicity of Amalgams. Graphs Comb. 15 (4) (1999)
Le Tu Quoc Hung, Maciej M. Syslo, Margaret L. Weaver, Douglas B. West
Bandwidth and density for block graphs. Discret. Math. 189 (1-3) (1998)
Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. SIAM J. Discret. Math. 9 (4) (1996)
Maciej M. Syslo
The jump number problem on interval orders: A 3/2 approximation algorithm. Discret. Math. 144 (1-3) (1995)
Maciej M. Syslo
on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets. Discret. Appl. Math. 60 (1-3) (1995)
Pawel Winter, Maciej M. Syslo
Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers. Discret. Appl. Math. 54 (2-3) (1994)
Wiktor Piotrowski, Maciej M. Syslo
Some properties of graph centroids. Ann. Oper. Res. 33 (3) (1991)
Miroslawa Skowronska, Maciej M. Syslo
Dominating cycles in halin graphs. Discret. Math. 86 (1-3) (1990)
Maciej M. Syslo, Pawel Winter
In-Trees and Plane Embeddings of Outerplanar Graphs. BIT 30 (1) (1990)
Maciej M. Syslo
Sequential coloring versus Welsh-Powell bound. Discret. Math. 74 (1-2) (1989)
Maciej M. Syslo
Bounds to the Page Number of Partially Ordered Sets. WG (1989)
Henryk Galina, Maciej M. Syslo
Some applications of graph theory to the study of polymer configuration. Discret. Appl. Math. 19 (1-3) (1988)
Maciej M. Syslo, Pawel Winter
Independent Covers in Outerplanar Graphs. SWAT (1988)
Maciej M. Syslo
An algorithm for solving the jump number problem. Discret. Math. 72 (1-3) (1988)
Andrzej Lingas, Maciej M. Syslo
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. ICALP (1988)
Maciej M. Syslo
Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II. Discret. Math. 63 (2-3) (1987)
Karin Wolf, Joachim Rosenmüller, Gustav Feichtinger, Maciej M. Syslo, Dietmar Schweigert, Ignacy Kaliszewski, Richard L. Francis, Günter Bamberg, Kurt Marti, R. Burkhard
Book reviews. Z. Oper. Research 30 (5) (1986)
Maciej M. Syslo
On Some Generalizations of Outerplanar Graphs: Results and Open Problems. WG (1986)
Miroslawa Skowronska, Maciej M. Syslo, Christina Zamfirescu
An Algorithmic Characterization of Total Digraphs. J. Algorithms 7 (1) (1986)
Maciej M. Syslo
Triangulated edge intersection graphs of paths in a tree. Discret. Math. 55 (2) (1985)
Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo
Interior graphs of maximal outerplane graphs. J. Comb. Theory, Ser. B 38 (2) (1985)
Miroslawa Skowronska, Maciej M. Syslo
An algorithm to recognize a middle graph. Discret. Appl. Math. 7 (2) (1984)
Maciej M. Syslo
Optimal constructions of reversible digraphs. Discret. Appl. Math. 7 (2) (1984)
Maciej M. Syslo
On the computational complexity of the minimum-dummy-activities problem in a pert network. Networks 14 (1) (1984)
Maciej M. Syslo
NP-Complete Problems on Some Tree-Structured Graphs: a Review. WG (1983)
Maciej M. Syslo
The Subgraph Isomorphism Problem for Outerplanar Graphs. Theor. Comput. Sci. 17 (1982)
Maciej M. Syslo
A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph. Inf. Process. Lett. 15 (1) (1982)
Maciej M. Syslo
An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph. SIAM J. Comput. 10 (4) (1981)
Andrzej Proskurowski, Maciej M. Syslo
Minimum dominating cycles in outerplanar graphs. Int. J. Parallel Program. 10 (2) (1981)
Maciej M. Syslo
The Helly-type property of non-trivial intervals on a tree. Discret. Math. 37 (2-3) (1981)
Maciej M. Syslo
Characterizations of outerplanar graphs. Discret. Math. 26 (1) (1979)
Maciej M. Syslo
On cycle bases of a graph. Networks 9 (2) (1979)
Maciej M. Syslo
A characterization of hypergraphs generated by arborescences. Kybernetika 15 (6) (1979)
Maciej M. Syslo, J. Dzikiewicz
Computational experiences with some transitive closure algorithms. Computing 15 (1) (1975)
Maciej M. Syslo
The Elementary Circuits of a Graph (Remark on Algorithm 459). Commun. ACM 18 (2) (1975)
Maciej M. Syslo
A new solvable case of the traveling salesman problem. Math. Program. 4 (1) (1973)
Maciej M. Syslo
The Elementary Circuits of a Graph [H] (Algorithm 459). Commun. ACM 16 (10) (1973)