BibTeX records: Maciej Kurowski

download as .bib file

@article{DBLP:journals/jda/FigueroaGJKLP08,
  author       = {Andres Figueroa and
                  Avraham Goldstein and
                  Tao Jiang and
                  Maciej Kurowski and
                  Andrzej Lingas and
                  Mia Persson},
  title        = {Approximate clustering of incomplete fingerprints},
  journal      = {J. Discrete Algorithms},
  volume       = {6},
  number       = {1},
  pages        = {103--108},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jda.2007.01.004},
  doi          = {10.1016/J.JDA.2007.01.004},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/FigueroaGJKLP08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChrobakDJKK06,
  author       = {Marek Chrobak and
                  Christoph D{\"{u}}rr and
                  Wojciech Jawor and
                  Lukasz Kowalik and
                  Maciej Kurowski},
  title        = {A Note on Scheduling Equal-Length Jobs to Maximize Throughput},
  journal      = {J. Sched.},
  volume       = {9},
  number       = {1},
  pages        = {71--73},
  year         = {2006},
  url          = {https://doi.org/10.1007/s10951-006-5595-4},
  doi          = {10.1007/S10951-006-5595-4},
  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/scheduling/ChrobakDJKK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KowalikK06,
  author       = {Lukasz Kowalik and
                  Maciej Kurowski},
  title        = {Oracles for bounded-length shortest paths in planar graphs},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {2},
  number       = {3},
  pages        = {335--363},
  year         = {2006},
  url          = {https://doi.org/10.1145/1159892.1159895},
  doi          = {10.1145/1159892.1159895},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/KowalikK06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cats/FigueroaGJKLP05,
  author       = {Andres Figueroa and
                  Avraham Goldstein and
                  Tao Jiang and
                  Maciej Kurowski and
                  Andrzej Lingas and
                  Mia Persson},
  editor       = {Mike D. Atkinson and
                  Frank K. H. A. Dehne},
  title        = {Approximate Clustering of Fingerprint Vectors with Missing Values},
  booktitle    = {Theory of Computing 2005, Eleventh {CATS} 2005, Computing: The Australasian
                  Theory Symposium, Newcastle, NSW, Australia, January/February 2005},
  series       = {{CRPIT}},
  volume       = {41},
  pages        = {57--60},
  publisher    = {Australian Computer Society},
  year         = {2005},
  url          = {http://crpit.scem.westernsydney.edu.au/abstracts/CRPITV41Figueroa.html},
  timestamp    = {Mon, 08 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cats/FigueroaGJKLP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Kurowski05,
  author       = {Maciej Kurowski},
  editor       = {Peter Vojt{\'{a}}s and
                  M{\'{a}}ria Bielikov{\'{a}} and
                  Bernadette Charron{-}Bost and
                  Ondrej S{\'{y}}kora},
  title        = {Planar Straight-Line Drawing in an O(n){\texttimes}O(n) Grid with
                  Angular Resolution Omega(1/n)},
  booktitle    = {{SOFSEM} 2005: Theory and Practice of Computer Science, 31st Conference
                  on Current Trends in Theory and Practice of Computer Science, Liptovsk{\'{y}}
                  J{\'{a}}n, Slovakia, January 22-28, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3381},
  pages        = {250--258},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-30577-4\_28},
  doi          = {10.1007/978-3-540-30577-4\_28},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/Kurowski05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kurowski04,
  author       = {Maciej Kurowski},
  title        = {A 1.235 lower bound on the number of points needed to draw all \emph{n}-vertex
                  planar graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {92},
  number       = {2},
  pages        = {95--98},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.ipl.2004.06.009},
  doi          = {10.1016/J.IPL.2004.06.009},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Kurowski04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0410046,
  author       = {Marek Chrobak and
                  Christoph D{\"{u}}rr and
                  Wojciech Jawor and
                  Lukasz Kowalik and
                  Maciej Kurowski},
  title        = {A Note on Scheduling Equal-Length Jobs to Maximize Throughput},
  journal      = {CoRR},
  volume       = {cs.DS/0410046},
  year         = {2004},
  url          = {http://arxiv.org/abs/cs.DS/0410046},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/cs-DS-0410046.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Kurowski03,
  author       = {Maciej Kurowski},
  title        = {Simple and efficient floor-planning},
  journal      = {Inf. Process. Lett.},
  volume       = {86},
  number       = {3},
  pages        = {113--119},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0020-0190(02)00490-8},
  doi          = {10.1016/S0020-0190(02)00490-8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Kurowski03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KowalikK03,
  author       = {Lukasz Kowalik and
                  Maciej Kurowski},
  editor       = {Lawrence L. Larmore and
                  Michel X. Goemans},
  title        = {Short path queries in planar graphs in constant time},
  booktitle    = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
                  June 9-11, 2003, San Diego, CA, {USA}},
  pages        = {143--148},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/780542.780565},
  doi          = {10.1145/780542.780565},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/KowalikK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DiksKK02,
  author       = {Krzysztof Diks and
                  Lukasz Kowalik and
                  Maciej Kurowski},
  editor       = {Ludek Kucera},
  title        = {A New 3-Color Criterion for Planar Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
                  {WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {2573},
  pages        = {138--149},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-36379-3\_13},
  doi          = {10.1007/3-540-36379-3\_13},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/DiksKK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics