BibTeX records: Dorota Osula

download as .bib file

@article{DBLP:journals/tcs/BorowieckiDO23,
  author       = {Piotr Borowiecki and
                  Dariusz Dereniowski and
                  Dorota Osula},
  title        = {The complexity of bicriteria tree-depth},
  journal      = {Theor. Comput. Sci.},
  volume       = {947},
  pages        = {113682},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.tcs.2022.12.032},
  doi          = {10.1016/J.TCS.2022.12.032},
  timestamp    = {Tue, 28 Mar 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BorowieckiDO23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BorowieckiDO21,
  author       = {Piotr Borowiecki and
                  Dariusz Dereniowski and
                  Dorota Osula},
  editor       = {Evripidis Bampis and
                  Aris Pagourtzis},
  title        = {The Complexity of Bicriteria Tree-Depth},
  booktitle    = {Fundamentals of Computation Theory - 23rd International Symposium,
                  {FCT} 2021, Athens, Greece, September 12-15, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12867},
  pages        = {100--113},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-86593-1\_7},
  doi          = {10.1007/978-3-030-86593-1\_7},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fct/BorowieckiDO21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-06645,
  author       = {Piotr Borowiecki and
                  Dariusz Dereniowski and
                  Dorota Osula},
  title        = {The Complexity of Bicriteria Tree-Depth},
  journal      = {CoRR},
  volume       = {abs/2101.06645},
  year         = {2021},
  url          = {https://arxiv.org/abs/2101.06645},
  eprinttype    = {arXiv},
  eprint       = {2101.06645},
  timestamp    = {Fri, 22 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2101-06645.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DereniowskiLOPZ19,
  author       = {Dariusz Dereniowski and
                  Andrzej Lingas and
                  Dorota Osula and
                  Mia Persson and
                  Pawel Zylinski},
  title        = {Clearing directed subgraphs by mobile agents: Variations on covering
                  with paths},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {102},
  pages        = {57--68},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.jcss.2018.11.002},
  doi          = {10.1016/J.JCSS.2018.11.002},
  timestamp    = {Fri, 12 Apr 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcss/DereniowskiLOPZ19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DereniowskiO19,
  author       = {Dariusz Dereniowski and
                  Dorota Osula},
  title        = {On-line Search in Two-Dimensional Environment},
  journal      = {Theory Comput. Syst.},
  volume       = {63},
  number       = {8},
  pages        = {1819--1848},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00224-019-09948-6},
  doi          = {10.1007/S00224-019-09948-6},
  timestamp    = {Fri, 31 Jan 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/DereniowskiO19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DereniowskiOR19,
  author       = {Dariusz Dereniowski and
                  Dorota Osula and
                  Pawel Rzazewski},
  title        = {Finding small-width connected path decompositions in polynomial time},
  journal      = {Theor. Comput. Sci.},
  volume       = {794},
  pages        = {85--100},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2019.03.039},
  doi          = {10.1016/J.TCS.2019.03.039},
  timestamp    = {Thu, 07 Nov 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DereniowskiOR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Osula19,
  author       = {Dorota Osula},
  editor       = {Barbara Catania and
                  Rastislav Kr{\'{a}}lovic and
                  Jerzy R. Nawrocki and
                  Giovanni Pighizzini},
  title        = {Minimizing the Cost of Team Exploration},
  booktitle    = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
                  Conference on Current Trends in Theory and Practice of Computer Science,
                  Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11376},
  pages        = {392--405},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-10801-4\_31},
  doi          = {10.1007/978-3-030-10801-4\_31},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/sofsem/Osula19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-05501,
  author       = {Dariusz Dereniowski and
                  Dorota Osula and
                  Pawel Rzazewski},
  title        = {Finding small-width connected path decompositions in polynomial time},
  journal      = {CoRR},
  volume       = {abs/1802.05501},
  year         = {2018},
  url          = {http://arxiv.org/abs/1802.05501},
  eprinttype    = {arXiv},
  eprint       = {1802.05501},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1802-05501.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/DereniowskiLPUZ17,
  author       = {Dariusz Dereniowski and
                  Andrzej Lingas and
                  Mia Persson and
                  Dorota Urbanska and
                  Pawel Zylinski},
  editor       = {Ralf Klasing and
                  Marc Zeitoun},
  title        = {The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents)},
  booktitle    = {Fundamentals of Computation Theory - 21st International Symposium,
                  {FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10472},
  pages        = {190--203},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-662-55751-8\_16},
  doi          = {10.1007/978-3-662-55751-8\_16},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/DereniowskiLPUZ17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DereniowskiU17,
  author       = {Dariusz Dereniowski and
                  Dorota Urbanska},
  editor       = {Roberto Solis{-}Oba and
                  Rudolf Fleischer},
  title        = {On-line Search in Two-Dimensional Environment},
  booktitle    = {Approximation and Online Algorithms - 15th International Workshop,
                  {WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {10787},
  pages        = {223--237},
  publisher    = {Springer},
  year         = {2017},
  url          = {https://doi.org/10.1007/978-3-319-89441-6\_17},
  doi          = {10.1007/978-3-319-89441-6\_17},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/waoa/DereniowskiU17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Urbanska-Osula17,
  author       = {Dorota Urbanska{-}Osula},
  title        = {Minimizing the Cost of Team Exploration},
  journal      = {CoRR},
  volume       = {abs/1705.10826},
  year         = {2017},
  url          = {http://arxiv.org/abs/1705.10826},
  eprinttype    = {arXiv},
  eprint       = {1705.10826},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/Urbanska-Osula17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-00316,
  author       = {Dariusz Dereniowski and
                  Andrzej Lingas and
                  Dorota Osula and
                  Mia Persson and
                  Pawel Zylinski},
  title        = {The Snow Team Problem (Clearing Directed Subgraphs by Mobile Agents)},
  journal      = {CoRR},
  volume       = {abs/1712.00316},
  year         = {2017},
  url          = {http://arxiv.org/abs/1712.00316},
  eprinttype    = {arXiv},
  eprint       = {1712.00316},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1712-00316.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DereniowskiU16,
  author       = {Dariusz Dereniowski and
                  Dorota Urbanska},
  title        = {Distributed Searching of Partial Grids},
  journal      = {CoRR},
  volume       = {abs/1610.01458},
  year         = {2016},
  url          = {http://arxiv.org/abs/1610.01458},
  eprinttype    = {arXiv},
  eprint       = {1610.01458},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DereniowskiU16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics