SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Maciej M. Syslo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Andrzej Lingas, Maciej M. Syslo
A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP]
ICALP, 1988, pp:394-409 [Conf]
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). [Citation Graph (0, 0)][DBLP]
Lifelong Learning in the Digital Age, 2003, pp:1-49 [Conf]
Maciej M. Syslo
Schools as Lifelong Learning Institutions and the Role of Information Technology. [Citation Graph (0, 0)][DBLP]
Lifelong Learning in the Digital Age, 2003, pp:99-109 [Conf]
Ewa Gurbiel, Grazyna Hardt-Olejniczak, Ewa Kolczyk, Helena Krupicka, Maciej M. Syslo
Informatics and ICT in Polish Education System. [Citation Graph (0, 0)][DBLP]
ISSEP, 2005, pp:46-52 [Conf]
Maciej M. Syslo, Anna Beata Kwiatkowska
Informatics Versus Information Technology - How Much Informatics Is Needed to Use Information Technology - A School Perspective. [Citation Graph (0, 0)][DBLP]
ISSEP, 2005, pp:178-188 [Conf]
Maciej M. Syslo, Anna Beata Kwiatkowska
Contribution of Informatics Education to Mathematics Education in Schools. [Citation Graph (0, 0)][DBLP]
ISSEP, 2006, pp:209-219 [Conf]
Maciej M. Syslo, Pawel Winter
Independent Covers in Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
SWAT, 1988, pp:243-254 [Conf]
Maciej M. Syslo
On Some Generalizations of Outerplanar Graphs: Results and Open Problems. [Citation Graph (0, 0)][DBLP]
WG, 1986, pp:146-164 [Conf]
Maciej M. Syslo
Bounds to the Page Number of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
WG, 1989, pp:181-195 [Conf]
Maciej M. Syslo, Pawel Winter
In-Trees and Plane Embeddings of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
BIT, 1990, v:30, n:1, pp:83-90 [Journal]
Maciej M. Syslo
The Elementary Circuits of a Graph [H] (Algorithm 459). [Citation Graph (0, 0)][DBLP]
Commun. ACM, 1973, v:16, n:10, pp:632-633 [Journal]
Maciej M. Syslo
The Elementary Circuits of a Graph (Remark on Algorithm 459). [Citation Graph (0, 0)][DBLP]
Commun. ACM, 1975, v:18, n:2, pp:119- [Journal]
Maciej M. Syslo
on Some New Types of Greedy Chains and Greedy Linear Extensions of Partially ordered Sets. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:349-358 [Journal]
Pawel Winter, Maciej M. Syslo
Maximal Outerplanar Graphs with Perfect Face-independent Vertex Covers. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:267-280 [Journal]
Maciej M. Syslo
A Labeling Algorithm to Recognize a Line Digraph and Output its Root Graph. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1982, v:15, n:1, pp:28-30 [Journal]
Miroslawa Skowronska, Maciej M. Syslo, Cristina Zamfirescu
An Algorithmic Characterization of Total Digraphs. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1986, v:7, n:1, pp:120-133 [Journal]
Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo
Interior graphs of maximal outerplane graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1985, v:38, n:2, pp:156-167 [Journal]
Maciej M. Syslo
An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1981, v:10, n:4, pp:797-808 [Journal]
Andrzej Proskurowski, Maciej M. Syslo, Pawel Winter
Plane Embeddings of 2-trees and Biconnected Partial 2-Trees. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1996, v:9, n:4, pp:577-596 [Journal]
Maciej M. Syslo
The Subgraph Isomorphism Problem for Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1982, v:17, n:, pp:91-97 [Journal]
Maciej M. Syslo
The Helly-type property of non-trivial intervals on a tree. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1981, v:37, n:2-3, pp:297-298 [Journal]
Maciej M. Syslo
Triangulated edge intersection graphs of paths in a tree. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1985, v:55, n:2, pp:217-220 [Journal]
Maciej M. Syslo
Minimizing the jump number for partially-ordered sets: a graph-theoretic approach, II. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1987, v:63, n:2-3, pp:279-295 [Journal]
Maciej M. Syslo
An algorithm for solving the jump number problem. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1988, v:72, n:1-3, pp:337-346 [Journal]
Maciej M. Syslo
Sequential coloring versus Welsh-Powell bound. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1989, v:74, n:1-2, pp:241-243 [Journal]
Le Tu Quoc Hung, Maciej M. Syslo, Margaret L. Weaver, Douglas B. West
Bandwidth and density for block graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1998, v:189, n:1-3, pp:163-176 [Journal]
Miroslawa Skowronska, Maciej M. Syslo
Dominating cycles in halin graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:86, n:1-3, pp:215-224 [Journal]
Maciej M. Syslo
The jump number problem on interval orders: A 3/2 approximation algorithm. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1995, v:144, n:1-3, pp:119-130 [Journal]
The Challenging Face of Informatics Education in Poland. [Citation Graph (, )][DBLP]
Computational experiences with some transitive closure algorithms. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.153secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP