The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrzej Czygrinow: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
    Distributed Approximation Algorithms for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:296-307 [Conf]
  2. Andrzej Czygrinow, Michal Hanckowiak
    Distributed Algorithm for Better Approximation of the Maximum Matching. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:242-251 [Conf]
  3. Andrzej Czygrinow, Michal Hanckowiak
    Distributed Almost Exact Approximations for Minor-Closed Families. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:244-255 [Conf]
  4. Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski
    Distributed O(Delta log(n))-Edge-Coloring Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:345-355 [Conf]
  5. Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
    A Fast Distributed Algorithm for Approximating the Maximum Matching. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:252-263 [Conf]
  6. Andrzej Czygrinow, Michal Hanckowiak
    Distributed Approximation Algorithms in Unit-Disk Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:385-398 [Conf]
  7. Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
    Spanning Trees of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  8. Andrzej Czygrinow, Brendan Nagle
    Matrix-Free Proof of a Regularity Characterization. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  9. Andrzej Czygrinow
    Partitioning problems in dense hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:3, pp:179-191 [Journal]
  10. Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
    Distributed algorithm for approximating the maximum matching. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:62-71 [Journal]
  11. Airat Bekmetjev, Graham Brightwell, Andrzej Czygrinow, Glenn Hurlbert
    Thresholds for families of multisets, with an application to graph pebbling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:21-34 [Journal]
  12. Andrzej Czygrinow, Nancy Eaton, Glenn H. Hurlbert, P. Mark Kayll
    On pebbling threshold functions for graph sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:93-105 [Journal]
  13. Andrzej Czygrinow, Henry A. Kierstead
    2-factors in dense bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:357-369 [Journal]
  14. Andrzej Czygrinow, Brendan Nagle
    Bounding the strong chromatic index of dense random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:129-136 [Journal]
  15. Andrzej Czygrinow, Brendan Nagle
    Strong edge colorings of uniform graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:286, n:3, pp:219-223 [Journal]
  16. Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter
    A Note on Graph Pebbling. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:2, pp:219-225 [Journal]
  17. Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam
    The Polling Primitive for Computer Networks. [Citation Graph (0, 0)][DBLP]
    Informatica (Slovenia), 2000, v:24, n:2, pp:- [Journal]
  18. Andrzej Czygrinow, Michal Hanckowiak
    Distributed algorithms for weighted problems in sparse graphs. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:588-607 [Journal]
  19. Andrzej Czygrinow
    Maximum dispersion problem in dense graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:223-227 [Journal]
  20. Andrzej Czygrinow, Vojtech Rödl
    An Algorithmic Regularity Lemma for Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1041-1066 [Journal]
  21. Andrzej Czygrinow, Glenn Hurlbert
    Girth, Pebbling, and Grid Thresholds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:1-10 [Journal]
  22. Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl
    Constructive Quasi-Ramsey Numbers and Tournament Ranking. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:1, pp:48-63 [Journal]
  23. Andrzej Czygrinow, Michal Hanckowiak
    Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:515-525 [Conf]
  24. Andrzej Czygrinow, Michal Hanckowiak
    Distributed Approximations for Packing in Unit-Disk Graphs. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:152-164 [Conf]

  25. Distributed packing in planar graphs. [Citation Graph (, )][DBLP]


  26. Fast Distributed Approximations in Planar Graphs. [Citation Graph (, )][DBLP]


  27. On the pebbling threshold of paths and the pebbling threshold spectrum. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002