Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Irina Lomonosov
@article{DBLP:journals/dam/DraganL07, author = {Feodor F. Dragan and Irina Lomonosov}, title = {On compact and efficient routing in certain graph classes}, journal = {Discret. Appl. Math.}, volume = {155}, number = {11}, pages = {1458--1470}, year = {2007}, url = {https://doi.org/10.1016/j.dam.2007.03.011}, doi = {10.1016/J.DAM.2007.03.011}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DraganL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/DraganYL06, author = {Feodor F. Dragan and Chenyu Yan and Irina Lomonosov}, title = {Collective tree spanners of graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {20}, number = {1}, pages = {241--260}, year = {2006}, url = {https://doi.org/10.1137/S089548010444167X}, doi = {10.1137/S089548010444167X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/DraganYL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/DraganL04, author = {Feodor F. Dragan and Irina Lomonosov}, editor = {Rudolf Fleischer and Gerhard Trippen}, title = {On Compact and Efficient Routing in Certain Graph Classes}, booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC} 2004, Hong Kong, China, December 20-22, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3341}, pages = {402--414}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30551-4\_36}, doi = {10.1007/978-3-540-30551-4\_36}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/DraganL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/DraganYL04, author = {Feodor F. Dragan and Chenyu Yan and Irina Lomonosov}, editor = {Torben Hagerup and Jyrki Katajainen}, title = {Collective Tree Spanners of Graphs}, booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3111}, pages = {64--76}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-27810-8\_7}, doi = {10.1007/978-3-540-27810-8\_7}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/DraganYL04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pdcs/DraganL02, author = {Feodor F. Dragan and Irina Lomonosov}, editor = {Selim G. Akl and Teofilo F. Gonzalez}, title = {New Routing Schemes for Interval, Circular-Arc, and Permutation Graphs}, booktitle = {International Conference on Parallel and Distributed Computing Systems, {PDCS} 2002, November 4-6, 2002, Cambridge, {USA}}, pages = {78--83}, publisher = {{IASTED/ACTA} Press}, year = {2002}, timestamp = {Tue, 26 Sep 2006 13:37:10 +0200}, biburl = {https://dblp.org/rec/conf/pdcs/DraganL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.