The SCEAS System
Navigation Menu

Search the dblp DataBase


Marek Cygan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. A Planar Linear Arboricity Conjecture. [Citation Graph (, )][DBLP]

  2. Irredundant Set Faster Than O(2n). [Citation Graph (, )][DBLP]

  3. Algorithms for Three Versions of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]

  4. Fast Approximation in Subspaces by Doubling Metric Decomposition. [Citation Graph (, )][DBLP]

  5. Exact and Approximate Bandwidth. [Citation Graph (, )][DBLP]

  6. Capacitated Domination Faster Than O(2n). [Citation Graph (, )][DBLP]

  7. Faster Exact Bandwidth. [Citation Graph (, )][DBLP]

  8. Exponential-Time Approximation of Hard Problems [Citation Graph (, )][DBLP]

  9. Even Faster Exact Bandwidth [Citation Graph (, )][DBLP]

  10. Beyond O*(2^n) in domination-type problems [Citation Graph (, )][DBLP]

  11. Fast Approximation in Subspaces by Doubling Metric Decomposition [Citation Graph (, )][DBLP]

  12. Subset feedback vertex set is fixed parameter tractable [Citation Graph (, )][DBLP]

  13. The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem) [Citation Graph (, )][DBLP]

  14. Bandwidth and Distortion Revisited [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002