Halina Bielak - RankMe

33 papers C 4Journal 28Unranked 1

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	On the Ramsey-Goodness of Paths. Graphs Comb. Binlong Li, Halina Bielak
2016	J	`jnl`	The Turán number of the graph Discuss. Math. Graph Theory Halina Bielak, Sebastain Kieliszek
2015	J	`jnl`	Closing the Gap on Path-Kipas Ramsey Numbers. Electron. J. Comb. Binlong Li, Yanbo Zhang, Halina Bielak, Hajo Broersma, Premek Holub
2015	C	`conf`	On the generalized Wiener polarity index for some classes of graphs. FedCSIS Halina Bielak, Kinga Dabrowska, Katarzyna Wolska
2015	C	`conf`	The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm. FedCSIS Halina Bielak, Kamil Powroznik
2014	J	`jnl`	A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs. J. Univers. Comput. Sci. Michal Panczyk, Halina Bielak
2014	—	`conf`	A self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs. FedCSIS (Position Papers) Halina Bielak, Michal Panczyk
2014	C	`conf`	An efficient algorithm for the density Turán problem of some unicyclic graphs. FedCSIS Halina Bielak, Kamil Powroznik
2013	C	`conf`	A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. FedCSIS Halina Bielak, Michal Panczyk
2013	J	`jnl`	A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. Ann. UMCS Informatica Halina Bielak, Michal Panczyk
2012	J	`jnl`	A self-stabilizing algorithm for finding weighted centroid in trees. Ann. UMCS Informatica Halina Bielak, Michal Panczyk
2010	J	`jnl`	Ramsey numbers for a disjoint union of good graphs. Discret. Math. Halina Bielak
2009	J	`jnl`	Multicolor Ramsey numbers for some paths and cycles. Discuss. Math. Graph Theory Halina Bielak
2009	J	`jnl`	Ramsey numbers for a disjoint union of some graphs. Appl. Math. Lett. Halina Bielak
2009	J	`jnl`	Size Ramsey numbers for some regular graphs. Discret. Math. Halina Bielak
2007	J	`jnl`	Chromatic properties of hamiltonian graphs. Discret. Math. Halina Bielak
2007	J	`jnl`	Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. Discret. Math. Halina Bielak
2007	J	`jnl`	Relations between 2-local and 2-mean Ramsey numbers for graphs. Discret. Math. Halina Bielak
2006	J	`jnl`	Size Ramsey numbers for some regular graphs. Electron. Notes Discret. Math. Halina Bielak
2006	J	`jnl`	The oriented chromatic number of some grids. Ann. UMCS Informatica Halina Bielak
2005	J	`jnl`	A new method for counting chromatic coefficients. Ann. UMCS Informatica Halina Bielak
2004	J	`jnl`	Local Ramsey numbers for copies of cycles. Discret. Math. Halina Bielak
2003	J	`jnl`	Local Ramsey numbers for some graphs. Discret. Math. Halina Bielak
2001	J	`jnl`	Local and Mean Ramsey Numbers for Some Graphs. Electron. Notes Discret. Math. Halina Bielak
2001	J	`jnl`	Roots of chromatic polynomials. Discret. Math. Halina Bielak
2001	J	`jnl`	The planar Ramsey number for Discret. Math. Halina Bielak, Izolda Gorgol
2000	J	`jnl`	Local Ramsey Numbers for Copies of Cycles. Electron. Notes Discret. Math. Halina Bielak
2000	J	`jnl`	Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. Discret. Math. Halina Bielak
1999	J	`jnl`	A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs. Discuss. Math. Graph Theory Halina Bielak
1998	J	`jnl`	Equivalent classes for K Discuss. Math. Graph Theory Halina Bielak
1998	J	`jnl`	The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six. Discuss. Math. Graph Theory Halina Bielak
1997	J	`jnl`	Chromatic uniqueness in a family of 2-connected graphs. Discret. Math. Halina Bielak
1993	J	`jnl`	Graphs with special neighbourhood orderings of vertices. Discret. Math. Halina Bielak