@article{13260, author = {{Cho, Hee-Kyung and Trier, Matthias and Kim, Eunhee}}, issn = {{1083-6101}}, journal = {{Journal of Computer-Mediated Communication}}, pages = {{00--00}}, title = {{{The Use of Instant Messaging in Working Relationship Development: A Case Study}}}, doi = {{10.1111/j.1083-6101.2005.tb00280.x}}, year = {{2010}}, } @inbook{13269, author = {{Trier, Matthias}}, booktitle = {{Handbuch Netzwerkforschung}}, isbn = {{9783531158082}}, title = {{{Struktur und Dynamik in der Netzwerkanalyse}}}, doi = {{10.1007/978-3-531-92575-2_18}}, year = {{2010}}, } @inbook{13301, author = {{Trier, Matthias and Müller, Claudia}}, booktitle = {{Practical Aspects of Knowledge Management}}, isbn = {{9783540240884}}, issn = {{0302-9743}}, title = {{{Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes}}}, doi = {{10.1007/978-3-540-30545-3_23}}, year = {{2010}}, } @inbook{13302, author = {{Trier, Matthias and Bobrik, Annette}}, booktitle = {{Communities and Technologies 2007}}, isbn = {{9781846289040}}, title = {{{Analyzing the Dynamics of Community Formation Using Brokering Activities}}}, doi = {{10.1007/978-1-84628-905-7_23}}, year = {{2010}}, } @inproceedings{1004, author = {{Miller, Konstantin and Biermann, Thorsten and Woesner, Hagen and Karl, Holger}}, booktitle = {{Network Coding (NetCod), 2010 IEEE International Symposium on}}, pages = {{1----6}}, title = {{{Network coding in passive optical networks}}}, year = {{2010}}, } @article{10174, author = {{Steffen, Eckhard}}, journal = {{Discrete Mathematics}}, pages = {{385 -- 389}}, title = {{{Tutte's 5-flow conjecture for cyclically highly connected cubic graphs}}}, volume = {{310}}, year = {{2010}}, } @unpublished{10202, abstract = {{An $r$-graph is an $r$-regular graph where every odd set of vertices is connected by at least $r$ edges to the rest of the graph. Seymour conjectured that any $r$-graph is $r+1$-edge-colorable, and also that any $r$-graph contains $2r$ perfect matchings such that each edge belongs to two of them. We show that the minimum counter-example to either of these conjectures is a brick. Furthermore we disprove a variant of a conjecture of Fan, Raspaud.}}, author = {{Mkrtchyan, Vahan and Steffen, Eckhard}}, booktitle = {{arXiv:1003.5782}}, title = {{{Bricks and conjectures of Berge, Fulkerson and Seymour}}}, year = {{2010}}, } @inproceedings{1021, author = {{Lischka, Jens and Karl, Holger}}, booktitle = {{Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures}}, pages = {{9----16}}, title = {{{RiaS: overlay topology creation on a PlanetLab infrastructure}}}, year = {{2010}}, } @inproceedings{1022, author = {{Woldegebreal, Dereje H and Karl, Holger}}, booktitle = {{Sensor Technologies and Applications (SENSORCOMM), 2010 Fourth International Conference on}}, pages = {{513----520}}, title = {{{Energy efficiency model of network-coded cooperation in wireless sensor networks}}}, year = {{2010}}, } @inproceedings{1023, author = {{Khan, Rana Azeem M and Karl, Holger}}, booktitle = {{Proceedings of the Fourth International Conference on Mobile Ubiquitous Computing (UBICOMM 2010)}}, title = {{{Cooperative communication to improve reliability and efficient neighborhood wakeup in wireless sensor networks}}}, year = {{2010}}, }