%------ 2008 --------------------------------------------------------- @Article{FKNP07a, author = "Flammini, Michele and Klasing, Ralf and Navarra, Alfredo and P\'erennes, St\'ephane", title = "Tightening the upper bound for the Minimum Energy Broadcasting", journal = "Wireless Networks", year = "2008", note = "Online First", url = "http://dx.doi.org/10.1007/s11276-006-0007-4" } @Article{KMRS07b, author = "Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano", title = "Approximation bounds for Black Hole Search problems", journal = "Networks", year = "2008", note = "to appear", url = "http://eu.wiley.com/WileyCDA/WileyTitle/productCd-NET.html" } @Article{KMP07c, author = "Klasing, Ralf and Markou, Euripides and Pelc, Andrzej", title = "Gathering asynchronous oblivious mobile robots in a ring", journal = "Theoretical Computer Science", year = "2008", note = "to appear", url = "http://dx.doi.org/10.1016/j.tcs.2007.09.032" } @Article{CKR07a, author = "Cooper, Colin and Klasing, Ralf and Radzik, Tomasz", title = "A randomized algorithm for the joining protocol in dynamic distributed networks", journal = "Theoretical Computer Science", year = "2008", note = "to appear", url = "http://www.elsevier.com/locate/tcs" } @Article{KMP07b, author = "Klasing, Ralf and Morales, Nelson and P\'erennes, St\'ephane", title = "On the Complexity of Bandwidth Allocation in Radio Networks", journal = "Theoretical Computer Science", year = "2008", note = "to appear", url = "http://www.elsevier.com/locate/tcs" } @Article{GKM07, author = "Gravier, Sylvain and Klasing, Ralf and Moncel, Julien", title = "Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs", journal = "Algorithmic Operations Research", year = "2008", note = "to appear", url = "http://journals.hil.unb.ca/index.php/AOR" } @Article{GKMNX08, author = "Gasieniec, Leszek and Klasing, Ralf and Martin, Russell and Navarra, Alfredo and Zhang, Xiaohui", title = "Fast Periodic Graph Exploration with Constant Memory", journal = "Journal of Computer and System Sciences", year = "2008", note = "to appear", url = "http://dx.doi.org/10.1016/j.jcss.2007.09.004" } @book{BaKl08, author = {Subir Bandyopadhyay ({in cooperation with Ralf Klasing})}, title = {Dissemination of Information in Optical Networks: From Technology to Algorithms}, year = {2008}, publisher = {Springer-Verlag}, series = {Springer Monograph}, url = {http://www.springer.com/france/home?SGWID=7-102-22-173750238-0&changeHeader=true} } %------ 2007 --------------------------------------------------------- @Article{FKNP07, author = "Flammini, Michele and Klasing, Ralf and Navarra, Alfredo and P\'erennes, St\'ephane", title = "Improved approximation results for the Minimum Energy Broadcasting problem in Wireless Ad Hoc Networks", journal = "Algorithmica", number = "4", volume = "49", pages = "318--336", month = "December", year = "2007", url = "http://dx.doi.org/10.1007/s00453-007-9077-7" } @TechReport{GKKKN07, author = "Gavoille, Cyril and Klasing, Ralf and Kosowski, Adrian and Kuszner, \L{}ukasz and Navarra, Alfredo", title = "On the Complexity of Distributed Graph Coloring with Local Minimality Constraints", institution = "LaBRI", number = "RR-1440-07", month = "December", year = "2007", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes", note = "appears also as INRIA Research Report RR-6399, December 2007" } @Article{KMRS07a, author = "Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano", title = "Hardness and approximation results for black hole search in arbitrary graphs", journal = "Theoretical Computer Science", year = "2007", month = oct, pages = "201--221", volume = "384", number = {2--3}, url = {http://dx.doi.org/10.1016/j.tcs.2007.04.024} } @TechReport{KLNP07, author = "Klasing, Ralf and Lotker, Zvi and Navarra, Alfredo and P\'erennes, St\'ephane", title = "From Balls and Bins to Points and Vertices", institution = "LaBRI", number = "RR-1437-07", month = "October", year = "2007", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @TechReport{KKN07a, author = "Klasing, Ralf and Kosowski, Adrian and Navarra, Alfredo", title = "Cost Minimisation in Wireless Networks with a Bounded and Unbounded Number of Interfaces", institution = "LaBRI", number = "RR-1436-07", month = "September", year = "2007", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @InProceedings{GKKN07, author = "Gavoille, Cyril and Klasing, Ralf and Kosowski, Adrian and Navarra, Alfredo", title = "On the Complexity of Distributed Greedy Coloring", booktitle = "Proceedings of the 21st International Symposium on Distributed Computing (DISC 2007)", series = "Lecture Notes in Computer Science", volume = "4731", pages = "482--484", month = "September", year = "2007", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/978-3-540-75142-7_37" } @TechReport{CKR07b, author = "Cooper, Colin and Klasing, Ralf and Radzik, Tomasz", title = "A randomized algorithm for the joining protocol in dynamic distributed networks", institution = "LaBRI", number = "RR-1432-07", month = "June", year = "2007", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @InProceedings{KKN07, author = "Klasing, Ralf and Kosowski, Adrian and Navarra, Alfredo", title = "Cost minimisation in multi-interface networks", booktitle = "Proceedings of the 1st Annual International Conference on Network Control and Optimization (NET-COOP 2007)", series = "Lecture Notes in Computer Science", volume = "4465", pages = "276--285", month = "June", year = "2007", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/978-3-540-72709-5_29" } @InProceedings{GKMNX07a, author = "Gasieniec, Leszek and Klasing, Ralf and Martin, Russell and Navarra, Alfredo and Zhang, Xiaohui", title = " Fast Periodic Graph Exploration with Constant Memory", booktitle = "Proceedings of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO 2007)", series = "Lecture Notes in Computer Science", volume = "4474", pages = "26--40", month = "June", year = "2007", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/978-3-540-72951-8_4" } @TechReport{BBHKPSU07, author = {B\"ockenhauer, Hans-Joachim and Bongartz, Dirk and Hromkovi\v{c}, Juraj and Klasing, Ralf and Proietti, Guido and Seibert, Sebastian and Unger, Walter}, title = "On k-Connectivity Problems with Sharpened Triangle Inequality", institution = "LaBRI", number = "RR-1430-07", month = "May", year = "2007", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @TechReport{GKMNX07b, author = "Gasieniec, Leszek and Klasing, Ralf and Martin, Russell and Navarra, Alfredo and Zhang, Xiaohui", title = "Fast Periodic Graph Exploration with Constant Memory", institution = "LaBRI", number = "RR-1426-07", month = "April", year = "2007", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @TechReport{KMP07a, author = "Klasing, Ralf and Markou, Euripides and Pelc, Andrzej", title = "Gathering asynchronous oblivious mobile robots in a ring", institution = "LaBRI", number = "RR-1422-07", month = "January", year = "2007", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } %------ 2006 --------------------------------------------------------- @InProceedings{CKR06, author = "Cooper, Colin and Klasing, Ralf and Radzik, Tomasz", title = "Searching for black-hole faults in a network using multiple agents", booktitle = "Proceedings of the 10th International Conference on Principles of Distributed Systems (OPODIS 2006)", series = "Lecture Notes in Computer Science", volume = "4305", pages = "320-332", month = "December", year = "2006", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/11945529_23" } @InProceedings{KMP06, author = "Klasing, Ralf and Markou, Euripides and Pelc, Andrzej", title = "Gathering asynchronous oblivious mobile robots in a ring", booktitle = "Proceedings of the 17th Annual International Symposium on Algorithms and Computation (ISAAC 2006)", series = "Lecture Notes in Computer Science", volume = "4288", pages = "744--753", month = "December", year = "2006", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/11940128_74" } @TechReport{GKM06, author = "Gravier, Sylvain and Klasing, Ralf and Moncel, Julien", title = "Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs", institution = "LaBRI", number = "RR-1417-06", month = "November", year = "2006", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @TechReport{HKKLUW06, author = "Hromkovi\v{c}, Juraj and Kanarek, Przemyslawa and Klasing, Ralf and Lorys, Krzysztof and Unger, Walter and Wagener, Hubert", title = "On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks", institution = "LaBRI", number = "RR-1410-06", month = "September", year = "2006", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @TechReport{KMRS06a, author = "Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano", title = "Approximation bounds for Black Hole Search problems", institution = "LaBRI", number = "RR-1407-06", month = "July", year = "2006", type = "Technical Report", url = "http://www.labri.fr/perso/lepine/Rapports_internes", note = "appears also as INRIA Research Report RR-6185, May 2007" } @TechReport{BGKMP06c, author = "Bermond, Jean-Claude and Galtier, J\'er\^ome and Klasing, Ralf and Morales, Nelson and P\'erennes, St\'ephane", title = "Hardness and approximation of Gathering in static radio networks", institution = {INRIA Research Report RR-5936 and LaBRI Research Report RR-1403-06}, month = "June", year = "2006", url = "http://www.labri.fr/perso/lepine/Rapports_internes" } @Article{BGKMP06b, author = "Bermond, Jean-Claude and Galtier, J\'er\^ome and Klasing, Ralf and Morales, Nelson and P\' erennes, St\'ephane", title = "Hardness and approximation of Gathering in static radio networks", journal = "Parallel Processing Letters", number = "2", volume = "16", pages = "165--183", month = "June", year = "2006", url = "http://dx.doi.org/10.1142/S0129626406002551" } @InProceedings{BGKMP06a, author = "Bermond, Jean-Claude and Galtier, J\'er\^ome and Klasing, Ralf and Morales, Nelson and P\' erennes, St\'ephane", title = "Gathering in specific radio networks", booktitle = "8\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel06), Tr\'egastel", month = "May", year = "2006", pages = "85--88", url = "http://algotel2006.lip6.fr" } @InProceedings{BGKMP06d, author = "Bermond, Jean-Claude and Galtier, J\'er\^ome and Klasing, Ralf and Morales, Nelson and P\'erennes, St\'ephane", title = "Hardness and approximation of Gathering in static radio networks", booktitle = "FAWN06, Pisa, Italy", month = "March", year = "2006", pages = "75--79", url = "http://doi.ieeecomputersociety.org/10.1109/PERCOMW.2006.62" } @InProceedings{KMRS05, author = "Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano", title = "Approximation bounds for Black Hole Search problems", booktitle = "Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005)", series = "Lecture Notes in Computer Science", volume = "3974", pages = "261--274", year = "2006", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/11795490_21" } @Article{KLPT06, author = "Klasing, Ralf and Laforest, Christian and Peters, Joseph G. and Thibault, Nicolas", title = "Constructing Incremental Sequences in Graphs", journal = "Algorithmic Operations Research", number = "2", volume = "1", pages = "1--7", year = "2006", url = "http://journals.hil.unb.ca/index.php/AOR/article/view/666" } %------ 2005 --------------------------------------------------------- @InProceedings{KLNP05, author = "Klasing, Ralf and Lotker, Zvi and Navarra, Alfredo and P\'erennes, St\'ephane", title = "From Balls and Bins to Points and Vertices", booktitle = "Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005)", series = "Lecture Notes in Computer Science", volume = "3827", pages = "757--766", month = "December", year = "2005", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/11602613_76" } @InProceedings{KMRS05a, author = "Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano", title = "Hardness and approximation results for black hole search in arbitrary graphs", booktitle = "Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005)", series = "Lecture Notes in Computer Science", volume = "3499", pages = "200--215", month = "May", year = "2005", publisher = "Springer Verlag", url = "http://dx.doi.org/10.1007/11429647_17" } @TechReport{KMRS05c, author = {R. Klasing and E. Markou and T. Radzik and F. Sarracco}, title = {Approximation Results for Black Hole Search in Arbitrary Networks}, institution = {INRIA Research Report RR-5659 and I3S Research Report I3S/RR-2005-23-FR}, type = {Research Report}, year = {2005}, PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.23-R.KLASING.pdf}, POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5659.ps.gz} } @TechReport{KLPT05, author = {R. Klasing and C. Laforest and J. Peters and N. Thibault}, title = {Constructing Incremental Sequences in Graphs}, institution = {INRIA Research Report RR-5648 and I3S Research Report I3S/RR-2005-22-FR}, type = {Research Report}, year = {2005}, PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.22-R.KLASING.pdf}, POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5648.ps.gz} } @TechReport{CKZ05b, author = {C. Cooper and R. Klasing and M. Zito}, title = {Lower Bounds and Algorithms for Dominating Sets in Web Graphs}, institution = {INRIA Research Report RR-5529 and I3S Research Report I3S/RR-2005-09-FR}, year = {2005}, PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.09-R.KLASING.pdf}, POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5529.ps.gz} } @Article{CKZ05a, author = "Cooper, Colin and Klasing, Ralf and Zito, Michele", title = "Lower Bounds and Algorithms for Dominating Sets in Web Graphs", journal = "Internet Mathematics", number = "3", volume = "2", pages = "275--300", year = "2005", url = "http://www.internetmathematics.org/volumes/2.htm" } @book{HKPRU05, title = {Dissemination of Information in Communication Networks: Part I. Broadcasting, Gossiping, Leader Election, and Fault-Tolerance }, author = {J.~Hromkovi\v{c} and R.~Klasing and A.~Pelc and P.~Ru\v{z}i\v{c}ka and W.~Unger}, year = {2005}, publisher = {Springer-Verlag}, series = {Springer Monograph}, url = {http://www.springer.com/france/home?SGWID=7-102-22-33834650-0&changeHeader=true} } %------ 2004 --------------------------------------------------------- @inproceedings{FKNP04, title = {Improved approximation results for the Minimum Energy Broadcasting Problem}, author = {M. Flammini and R. Klasing and A. Navarra and S. P\'erennes}, pages = {85--91}, url = {http://doi.acm.org/10.1145/1022630.1022644}, publisher = {ACM Press}, isbn = {1-58113-921-7}, booktitle = {Workshop on Discrete Algorithms and Methods for MOBILE Computing and Communications, Proceedings of the 2004 joint workshop on Foundations of mobile computing}, year = {2004}, month = oct } @inproceedings{CKZ04, author = {C. Cooper and R. Klasing and M. Zito}, title = {Dominating Sets in Web Graphs}, booktitle = {Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag}, volume = {3243}, pages = {31--43}, year = {2004}, url = {http://www.springerlink.com/link.asp?id=cbqbyfy1vp0rrj7a}, month = oct } @Article{BBHKPSU04, title = {On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality}, author = {H.-J. B\"ockenhauer and D. Bongartz and J. Hromkovi\v{c} and R. Klasing and G. Proietti and S. Seibert and W. Unger}, year = {2004}, month = oct, journal = {Theoretical Computer Science}, pages = {137--153}, volume = {326}, number = {1--3}, url = {http://dx.doi.org/10.1016/j.tcs.2004.06.019} } @inproceedings{KNPP04, author = {R. Klasing and A. Navarra and A. Papadopoulos and S. P\'erennes}, title = {Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem}, booktitle = {NETWORKING 2004, Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications: Third International IFIP-TC6 Networking Conference}, series = {Lecture Notes in Computer Science}, volume = {3042}, publisher = {Springer-Verlag}, pages = {866--877}, year = {2004}, month = may, url = {http://www.springerlink.com/link.asp?id=7qjd9d9mg2tg4wc6} } @techreport{CKR04, title = {A randomized algorithm for the joining protocol in dynamic distributed networks}, author = {C. Cooper and R. Klasing and T. Radzik}, institution = {INRIA Research Report RR-5376 and I3S Research Report I3S/RR-2004-39-FR}, type = {Research Report}, year = {2004}, PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.23-R.KLASING.pdf}, POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5659.ps.gz}, url = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/KMP04.ps} } @techreport{KMP04, title = {Complexity of Bandwidth Allocation in Radio Networks: the static case}, author = {R. Klasing and N. Morales and S. P\'erennes}, institution = {INRIA Research Report RR-5432 and I3S Research Report I3S/RR-2004-40-FR}, type = {Research Report}, year = {2004}, PDF = {http://www.i3s.unice.fr/~mh/RR/2005/RR-05.23-R.KLASING.pdf}, POSTSCRIPT = {ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-5659.ps.gz}, url = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/KMP04.ps} } @techreport{KLNP04, title = {The Points and Vertices Game}, author = {R. Klasing and Z. Lotker and A. Navarra and S. P\'erennes}, year = {2004}, number = {TRCS 030/2004}, institution = {Dipartimento di Informatica, Universit\`a degli Studi di L'Aquila}, url = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/KLNP04.pdf} } @article{KL04, author = {R. Klasing and C. Laforest}, title = {Hardness results and approximation algorithms of k-tuple domination in graphs}, journal = {Information Processing Letters}, volume = {89}, number = {2}, month = jan, year = {2004}, issn = {0020-0190}, pages = {75--83}, url = {http://dx.doi.org/10.1016/j.ipl.2003.10.004}, publisher = {Elsevier North-Holland, Inc} } %------ 2003 --------------------------------------------------------- @inproceedings{BBHKPSU03, author = {H.-J.~B\"ockenhauer and D.~Bongartz and J.~Hromkovi\v{c} and R.~Klasing and G.~Proietti and S.~Seibert and W.~Unger}, title = {On k-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract)}, booktitle = {Algorithms and Complexity: 5th Italian Conference, CIAC 2003}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag}, volume = {2653}, pages = {189--200}, year = {2003}, month = may, url = {http://www.springerlink.com/link.asp?id=xaauj6bhackq2hld} } %------ 2002 --------------------------------------------------------- @InProceedings{BBH02, author = {H.-J. B\"ockenhauer and D. Bongartz and J. Hromkovi\v{c} and R. Klasing and G. Proietti and S. Seibert and W. Unger}, title = {On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Extended Abstract)}, booktitle = {FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science: 22nd Conference}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag}, volume = {2556}, year = {2002}, isbn = {3-540-00225-1}, pages = {59--70}, month = dec, url = {http://www.springerlink.com/link.asp?id=w1agh4wk81k09j9p} } @Article{BHKSU02, author = {H.-J.~B\"ockenhauer and J.~Hromkovi\v{c} and R.~Klasing and S.~Seibert and W.~Unger}, title = {Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem}, journal = {Theoretical Computer Science}, year = {2002}, volume = {285}, number = {1}, pages = {3--24}, month = aug, url = {http://dx.doi.org/10.1016/S0304-3975(01)00287-0} } %------ 2000 --------------------------------------------------------- @article{BHK00c, url = {http://dx.doi.org/10.1016/S0020-0190(00)00089-2}, author = {H.-J. Böckenhauer and J. Hromkovi\v{c} and R. Klasing and S. Seibert and W. Unger}, title = {Approximation algorithms for the TSP with sharpened triangle inequality}, journal = {Information Processing Letters}, volume = {75}, number = {3}, month = aug, pages = {133-138}, year = {2000} } @inproceedings{BHK00a, url = {http://link.springer.de/link/service/series/0558/bibs/1767/17670072.htm}, author = {H.-J. B\"ockenhauer and J. Hromkovi\v{c} and R. Klasing and S. Seibert and W. Unger}, title = {Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem}, booktitle = {Algorithms and Complexity: 4th Italian Conference, CIAC 2000}, year = 2000, month = mar, pages = {72-86}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag}, volume = {1767} } @inproceedings{BHK00b, url = {http://link.springer.de/link/service/series/0558/bibs/1770/17700382.htm}, author = {H.-J. B\"ockenhauer and J. Hromkovi\v{c} and R. Klasing and S. Seibert and W. Unger}, title = {An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality}, booktitle = {STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science}, year = 2000, pages = {382-394}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag}, volume = {1770}, month = feb } %------ 1999 --------------------------------------------------------- @TechReport{BHK99a, author = {H.-J. B\"ockenhauer and J. Hromkovi\v{c} and R. Klasing and S. Seibert and W. Unger}, title = {Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem}, institution = {Electronic Colloquium on Computational Complexity (ECCC)}, year = 1999, type = {Research Report}, number = {TR99-031}, month = sep, url = {ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1999/TR99-031/index.html} } %------ 1998 --------------------------------------------------------- @article{KLM98a, url = {http://www3.interscience.wiley.com/cgi-bin/abstract/32082/ABSTRACT}, author = {R. Klasing and R. L\"uling and B. Monien}, title = {Compressing cube-connected cycles and butterfly networks}, journal = {Networks}, volume = {32}, number = {1}, pages = {47-65}, year = {1998}, month = dec } @article{Kla98c, url = {http://csdl.computer.org/comp/trans/td/1998/08/l0803abs.htm}, author = {R. Klasing}, title = {Improved Compressions of Cube-Connected Cycles Networks}, journal = {IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {8}, pages = {803-812}, year = {1998}, month = aug } @article{HKP98a, author = {J. Hromkovi\v{c} and R. Klasing and D. Pardubská and J. Waczulík and H. Wagener}, title = {Effective Systolic Algorithms for Gossiping in Cycles}, journal = {Parallel Processing Letters}, volume = {8}, number = {2}, pages = {197-205}, year = {1998}, month = jun, url = {http://www.worldscinet.com/ppl/08/0802/S0129626498000213.html} } @inproceedings{Kla98a, author = {R. Klasing}, title = {Improved Compressions of Cube-Connected Cycles Networks}, booktitle = {24rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98)}, year = {1998}, month = jun, pages = {242-256}, url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-65195-0}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag}, volume = {1517} } @article{Kla98b, url = {http://dx.doi.org/10.1016/S0166-218X(97)00112-1}, author = {R. Klasing}, title = {The Relationship between the Gossip Complexity in Vertex-Disjoint Paths Mode and the Vertex Bisection Width}, journal = {Discrete Applied Mathematics}, volume = {83}, number = {1-3}, pages = {229-246}, year = {1998}, month = mar } @article{HKM98a, author = {R. Heckmann and R. Klasing and B. Monien and W. Unger}, title = {Optimal Embedding of Complete Binary Trees into Lines and Grids}, journal = {Journal of Parallel and Distributed Computing}, volume = {49}, number = {1}, pages = {40-56}, year = {1998}, month = feb, url = {http://dx.doi.org/10.1006/jpdc.1998.1424} } %------ 1997 --------------------------------------------------------- @article{HKUW97, author = {J. Hromkovi\v{c} and R. Klasing and W. Unger and H. Wagener}, title = {Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes}, journal = {Information and Computation}, volume = {133}, number = {1}, pages = {1-33}, year = {1997}, month = feb, url = {http://dx.doi.org/10.1006/inco.1996.2618} } %------ 1996 --------------------------------------------------------- @InBook{HKMP96, author = {J. Hromkovi\v{c} and R. Klasing and B. Monien and R. Peine}, editor = {Frank Hsu and Ding-Zhu Du}, title = {Combinatorial Network Theory}, chapter = {Dissemination of Information in Interconnection Networks (Broadcasting and Gossiping)}, publisher = {Kluwer Academic Publishers}, year = 1996, pages = {125-212} } @article{HKS96, author = {J.~Hromkovi\v{c} and R.~Klasing and E.A.~St\"ohr}, title = {Dissemination of information in vertex-disjoint paths mode}, journal = {Computers and Artificial Intelligence}, volume = {15}, number = {4}, pages = {295-318}, year = {1996}, url = {http://www.cai.sk/} } %------ 1995 --------------------------------------------------------- @article{HKS95a, author = {J. Hromkovi\v{c} and R. Klasing and E. Stöhr and H. Wagener}, title = {Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs}, journal = {Information and Computation}, volume = {123}, number = {1}, pages = {17-28}, year = {1995}, month = nov, url = {http://dx.doi.org/10.1006/inco.1995.1154} } @inproceedings{HKP95, author = {J. Hromkovi\v{c} and R. Klasing and D. Pardubská and W. Unger and J. Waczulík and H. Wagener}, title = {Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract)}, year = {1995}, pages = {273-282}, editor = {H. Reichel}, booktitle = {Fundamentals of Computation Theory, 10th International Symposium, FCT '95}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {965}, month = aug, url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-60249-6} } @inproceedings{HLK95a, author = {J. Hromkovi\v{c} and K. Lorys and P. Kanarek and R. Klasing and W. Unger and H. Wagener}, title = {On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks}, year = {1995}, pages = {255-266}, editor = {E. W. Mayr and C. Puech}, booktitle = {STACS 95, 12th Annual Symposium on Theoretical Aspects of Computer Science}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {900}, month = mar, url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-59042-0} } @inbook{MDF95a, author = {B. Monien and R. Diekmann and R. Feldmann and R. Klasing and R. Lüling and K. Menzel and T. Römke and U.-P. Schroeder}, chapter = {Efficient Use of Parallel & Distributed Systems: From Theory to Practice}, booktitle = {Computer Science Today}, year = {1995}, pages = {62-77}, editor = {Jan van Leeuwen}, title = {Computer Science Today: Recent Trends and Developments}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {1000} } %------ 1994 --------------------------------------------------------- @article{KMP94a, author = {R. Klasing and B. Monien and R. Peine and E. Stöhr}, title = {Broadcasting in Butterfly and deBruijn Networks}, journal = {Discrete Applied Mathematics}, volume = {53}, number = {1-3}, pages = {183-197}, year = {1994}, month = sep, url = {http://dx.doi.org/10.1016/0166-218X(94)90184-8} } @inproceedings{Kla94a, author = {R. Klasing}, title = {The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width}, year = {1994}, pages = {473-483}, editor = {I. Pr\'{\i}vara and B. Rovan and P. Ruzicka}, booktitle = {Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {841}, month = aug, url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-58338-6} } @inproceedings{HKU94b, author = {J. Hromkovi\v{c} and R. Klasing and W. Unger and H. Wagener}, title = {Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract)}, year = {1994}, pages = {219-230}, editor = {E. M. Schmidt and S. Skyum}, booktitle = {Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {824}, month = jul, url = {http://www.informatik.uni-trier.de/~ley/db/conf/swat/swat94.html} } @inproceedings{HKU94a, author = {J. Hromkovi\v{c} and R. Klasing and W. Unger and H. Wagener and D. Pardubská}, title = {The Complexity of Systolic Dissemination of Information in Interconnection Networks}, year = {1994}, pages = {235-249}, editor = {M. Cosnard and A. Ferreira and J. G. Peters}, booktitle = {Parallel and Distributed Computing, First Canada-France Conference}, month = may, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {805}, url = {http://www.springer.de/cgi-bin/search_book.pl?isbn=3-540-58078-6} } @article{HKU94c, author = {J. Hromkovi\v{c} and R. Klasing and W. Unger and H. Wagener and D. Pardubská}, title = {The Complexity of Systolic Dissemination of Information in Interconnection Networks}, journal = {R.A.I.R.O. Theoretical Informatics and Applications}, volume = {28}, number = {3-4}, pages = {303-342}, year = {1994} } %------ 1993 --------------------------------------------------------- @inproceedings{HKS93a, author = {J. Hromkovi\v{c} and R. Klasing and E. Stöhr and H. Wagener}, title = {Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs}, year = {1993}, pages = {200-211}, editor = {T. Lengauer}, booktitle = {Algorithms - ESA '93, First Annual European Symposium}, month = oct, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {726}, url = {http://www.informatik.uni-trier.de/~ley/db/conf/esa/esa93.html} } @inproceedings{HKS93b, author = {J. Hromkovi\v{c} and R. Klasing and E. Stöhr}, title = {Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks}, year = {1993}, pages = {288-300}, editor = {J. van Leeuwen}, booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93}, month = jun, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {790}, url = {http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html} } @inproceedings{MFK93a, author = {B. Monien and R. Feldmann and R. Klasing and R. Lüling}, title = {Parallel Architectures: Design and Efficient Use}, year = {1993}, pages = {247-269}, editor = {P. Enjalbert and A. Finkel and K. W. Wagner}, booktitle = {STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science}, month = feb, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {665}, url = {http://www.informatik.uni-trier.de/~ley/db/conf/stacs/stacs93.html} } %------ 1992 --------------------------------------------------------- @inproceedings{KMP92a, author = {R. Klasing and B. Monien and R. Peine and E. Stöhr}, title = {Broadcasting in Butterfly and DeBruijn Networks}, year = {1992}, pages = {351-362}, editor = {A. Finkel and M. Jantzen}, booktitle = {STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science}, month = feb, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {577}, url = {http://www.informatik.uni-trier.de/~ley/db/conf/stacs/stacs92.html} } %------ 1991 --------------------------------------------------------- @inproceedings{HKM91a, author = {R. Heckmann and R. Klasing and B. Monien and W. Unger}, title = {Optimal Embedding of Complete Binary Trees into Lines and Grids}, year = {1991}, pages = {25-35}, editor = {G. Schmidt and R. Berghammer}, booktitle = {17th International Workshop, WG '91}, month = jun, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {570}, url = {http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html} } %------ 1990 --------------------------------------------------------- @inproceedings{KLM90, author = {R. Klasing and R. L\"uling and B. Monien}, title = {Compressing cube-connected cycles and butterfly networks}, year = {1990}, pages = {858--865}, booktitle = {2nd IEEE Symposium on Parallel and Distributed Processing, SPDP '90}, month = dec, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=3854&arnumber=143659&count=140&index=134} }