diff options
Diffstat (limited to 'mgr.bib')
-rw-r--r-- | mgr.bib | 38 |
1 files changed, 38 insertions, 0 deletions
@@ -0,0 +1,38 @@ +@incollection{bagan2006, + doi = {10.1007/11874683_11}, + % url = {https://doi.org/10.1007%2F11874683_11}, + year = 2006, + publisher = {Springer Berlin Heidelberg}, + pages = {167--181}, + author = {Guillaume Bagan}, + title = {{MSO} Queries on Tree Decomposable Structures Are Computable with Linear Delay} +} +@article{kazana2013, + doi = {10.1145/2528928}, + % url = {https://doi.org/10.1145%2F2528928}, + year = 2013, + month = {nov}, + publisher = {Association for Computing Machinery ({ACM})}, + volume = {14}, + number = {4}, + pages = {1--12}, + author = {Wojciech Kazana and Luc Segoufin}, + title = {Enumeration of monadic second-order queries on trees} +} +@incollection{colcombet, + doi = {10.1007/978-3-540-73420-8_77}, + % url = {https://doi.org/10.1007%2F978-3-540-73420-8_77}, + publisher = {Springer Berlin Heidelberg}, + pages = {901--912}, + author = {Thomas Colcombet}, + title = {A Combinatorial Theorem for Trees} +} +@incollection{bender2000, + doi = {10.1007/10719839_9}, + % url = {https://doi.org/10.1007%2F10719839_9}, + year = 2000, + publisher = {Springer Berlin Heidelberg}, + pages = {88--94}, + author = {Michael A. Bender and Mart{\'{\i}}n Farach-Colton}, + title = {The {LCA} Problem Revisited} +} |