Maciej M. Syslo

According to our database1, Maciej M. Syslo authored at least 55 papers between 1973 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
The new computer science curriculum in Poland - challenges and solutions.
Proceedings of the International Conference on Informatics in School: Situation, 2020

2018
Tensions in specifying computing curricula for K-12: Towards a principled approach for objectives.
it Inf. Technol., 2018

2017
Computer science in K-12 school curricula of the 2lst century: Why, what and when?
Educ. Inf. Technol., 2017

Computer Science in the School Curriculum: Issues and Challenges.
Proceedings of the Tomorrow's Learning: Involving Everyone. Learning with and about Technologies and Computing, 2017

2015
Introducing a New Computer Science Curriculum for All School Levels in Poland.
Proceedings of the Informatics in Schools. Curricula, Competences, and Competitions, 2015

2014
The First 25 Years of Computers in Education in Poland: 1965 - 1990.
Proceedings of the Reflections on the History of Computers in Education, 2014

Playing with computing at a children's university.
Proceedings of the 9th Workshop in Primary and Secondary Computing Education, 2014

Introducing Students to Recursion: A Multi-facet and Multi-tool Approach.
Proceedings of the Informatics in Schools. Teaching and Learning Perspectives, 2014

2013
Informatics for All High School Students - A Computational Thinking Approach.
Proceedings of the Informatics in Schools. Sustainable Informatics Education for Pupils of all Ages, 2013

2011
Outreach to Prospective Informatics Students.
Proceedings of the Informatics in Schools. Contributing to 21st Century Education, 2011

2008
The Challenging Face of Informatics Education in Poland.
Proceedings of the Informatics Education - Supporting Computational Thinking, Third International Conference on Informatics in Secondary Schools, 2008

2006
On Page Number of N-free Posets.
Electron. Notes Discret. Math., 2006

Contribution of Informatics Education to Mathematics Education in Schools.
Proceedings of the Informatics Education - The Bridge between Using and Understanding Computers, International Conference in Informatics in Secondary Schools, 2006

2005
On Posets of Page Number 2.
Electron. Notes Discret. Math., 2005

Informatics <i>Versus</i> Information Technology - How Much Informatics Is Needed to Use Information Technology - A School Perspective.
Proceedings of the From Computer Literacy to Informatics Fundamentals, International Conference on Informatics in Secondary Schools, 2005

Informatics and ICT in Polish Education System.
Proceedings of the From Computer Literacy to Informatics Fundamentals, International Conference on Informatics in Secondary Schools, 2005

2003
Schools as Lifelong Learning Institutions and the Role of Information Technology.
Proceedings of the Lifelong Learning in the Digital Age: Sustainable for all in a changing world, 2003

Lifelong Learning in the Digital Age (Focus Group Report).
Proceedings of the Lifelong Learning in the Digital Age: Sustainable for all in a changing world, 2003

1999
Hamiltonicity of Amalgams.
Graphs Comb., 1999

1998
Bandwidth and density for block graphs.
Discret. Math., 1998

1996
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees.
SIAM J. Discret. Math., 1996

1995
The jump number problem on interval orders: A 3/2 approximation algorithm.
Discret. Math., 1995

on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets.
Discret. Appl. Math., 1995

1994
Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers.
Discret. Appl. Math., 1994

1991
Some properties of graph centroids.
Ann. Oper. Res., 1991

1990
Dominating cycles in halin graphs.
Discret. Math., 1990

In-Trees and Plane Embeddings of Outerplanar Graphs.
BIT Comput. Sci. Sect., 1990

1989
Sequential coloring versus Welsh-Powell bound.
Discret. Math., 1989

Bounds to the Page Number of Partially Ordered Sets.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988
An algorithm for solving the jump number problem.
Discret. Math., 1988

Some applications of graph theory to the study of polymer configuration.
Discret. Appl. Math., 1988

Independent Covers in Outerplanar Graphs.
Proceedings of the SWAT 88, 1988

A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II.
Discret. Math., 1987

1986
Book reviews.
Z. Oper. Research, 1986

An Algorithmic Characterization of Total Digraphs.
J. Algorithms, 1986

On Some Generalizations of Outerplanar Graphs: Results and Open Problems.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985
Interior graphs of maximal outerplane graphs.
J. Comb. Theory, Ser. B, 1985

Triangulated edge intersection graphs of paths in a tree.
Discret. Math., 1985

1984
On the computational complexity of the minimum-dummy-activities problem in a pert network.
Networks, 1984

Optimal constructions of reversible digraphs.
Discret. Appl. Math., 1984

An algorithm to recognize a middle graph.
Discret. Appl. Math., 1984

1983
NP-Complete Problems on Some Tree-Structured Graphs: a Review.
Proceedings of the WG '83, 1983

1982
The Subgraph Isomorphism Problem for Outerplanar Graphs.
Theor. Comput. Sci., 1982

A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph.
Inf. Process. Lett., 1982

1981
An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph.
SIAM J. Comput., 1981

Minimum dominating cycles in outerplanar graphs.
Int. J. Parallel Program., 1981

The Helly-type property of non-trivial intervals on a tree.
Discret. Math., 1981

1979
On cycle bases of a graph.
Networks, 1979

A characterization of hypergraphs generated by arborescences.
Kybernetika, 1979

Characterizations of outerplanar graphs.
Discret. Math., 1979

1975
Computational experiences with some transitive closure algorithms.
Computing, 1975

The Elementary Circuits of a Graph (Remark on Algorithm 459).
Commun. ACM, 1975

1973
A new solvable case of the traveling salesman problem.
Math. Program., 1973

The Elementary Circuits of a Graph [H] (Algorithm 459).
Commun. ACM, 1973


  Loading...