Maciej M. Syslo

Electron. Notes Discret. Math., 2006

Contribution of Informatics Education to Mathematics Education in Schools.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Informatics <i>Versus</i> Information Technology - How Much Informatics Is Needed to Use Information Technology - A School Perspective.

[BibT_eX]

[DOI]

Proceedings of the From Computer Literacy to Informatics Fundamentals, International Conference on Informatics in Secondary Schools, 2005

Informatics and ICT in Polish Education System.

[BibT_eX]

[DOI]

Ewa Gurbiel

Grazyna Hardt-Olejniczak

Ewa Kolczyk

Helena Krupicka

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.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Proceedings of the Lifelong Learning in the Digital Age: Sustainable for all in a changing world, 2003

1999

Hamiltonicity of Amalgams.

[BibT_eX]

[DOI]

Graphs Comb., 1999

1998

Bandwidth and density for block graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

1996

Plane Embeddings of 2-trees and Biconnected Partial 2-Trees.

[BibT_eX]

[DOI]

Andrzej Proskurowski

SIAM J. Discret. Math., 1996

1995

The jump number problem on interval orders: A 3/2 approximation algorithm.

[BibT_eX]

[DOI]

Discret. Math., 1995

on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1991

Some properties of graph centroids.

[BibT_eX]

[DOI]

Wiktor Piotrowski

Ann. Oper. Res., 1991

1990

Dominating cycles in halin graphs.

[BibT_eX]

[DOI]

Miroslawa Skowronska

Discret. Math., 1990

In-Trees and Plane Embeddings of Outerplanar Graphs.

[BibT_eX]

[DOI]

BIT, 1990

1989

Sequential coloring versus Welsh-Powell bound.

[BibT_eX]

[DOI]

Discret. Math., 1989

Bounds to the Page Number of Partially Ordered Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

1988

An algorithm for solving the jump number problem.

[BibT_eX]

[DOI]

Discret. Math., 1988

Some applications of graph theory to the study of polymer configuration.

[BibT_eX]

[DOI]

Henryk Galina

Discret. Appl. Math., 1988

Independent Covers in Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the SWAT 88, 1988

A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs.

[BibT_eX]

[DOI]

Andrzej Lingas

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.

[BibT_eX]

[DOI]

Discret. Math., 1987

1986

Book reviews.

[BibT_eX]

[DOI]

Z. Oper. Research, 1986

An Algorithmic Characterization of Total Digraphs.

[BibT_eX]

[DOI]

Miroslawa Skowronska

Christina Zamfirescu

J. Algorithms, 1986

On Some Generalizations of Outerplanar Graphs: Results and Open Problems.

[BibT_eX]

[DOI]

Sandra Mitchell Hedetniemi

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1985

Interior graphs of maximal outerplane graphs.

[BibT_eX]

[DOI]

Andrzej Proskurowski

J. Comb. Theory, Ser. B, 1985

Triangulated edge intersection graphs of paths in a tree.

[BibT_eX]

[DOI]

Discret. Math., 1985

1984

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

[BibT_eX]

[DOI]

Networks, 1984

Optimal constructions of reversible digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1984

An algorithm to recognize a middle graph.

[BibT_eX]

[DOI]

Miroslawa Skowronska

Discret. Appl. Math., 1984

1983

NP-Complete Problems on Some Tree-Structured Graphs: a Review.

[BibT_eX]

Proceedings of the WG '83, 1983

1982

The Subgraph Isomorphism Problem for Outerplanar Graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

1981

An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

Minimum dominating cycles in outerplanar graphs.

[BibT_eX]

[DOI]

Andrzej Proskurowski

Int. J. Parallel Program., 1981

The Helly-type property of non-trivial intervals on a tree.

[BibT_eX]

[DOI]

Discret. Math., 1981

1979

On cycle bases of a graph.

[BibT_eX]

[DOI]

Networks, 1979

A characterization of hypergraphs generated by arborescences.

[BibT_eX]

[DOI]

Kybernetika, 1979

Characterizations of outerplanar graphs.

[BibT_eX]

[DOI]

Discret. Math., 1979

1975

Computational experiences with some transitive closure algorithms.

[BibT_eX]

[DOI]

J. Dzikiewicz

Computing, 1975

The Elementary Circuits of a Graph (Remark on Algorithm 459).

[BibT_eX]

Commun. ACM, 1975

1973

A new solvable case of the traveling salesman problem.

[BibT_eX]

[DOI]

Math. Program., 1973

The Elementary Circuits of a Graph [H] (Algorithm 459).

[BibT_eX]

[DOI]