%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% -------------------------------------------------------------- %% Bibliography of i11 %% %% -------------------------------------------------------------- %% Sections: %% * STRING DEFINITIONS %% - general %% - authors %% - publishers %% - journals %% - conference proceedings %% * MONOGRAPHS, PAPERS, THESES %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% STRINGS DEFINITIONS %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% -------------------------------------------------------------- %% general %% -------------------------------------------------------------- @string{and = " and " } @string{jan = "January" } @string{feb = "February" } @string{mar = "March" } @string{apr = "April" } @string{may = "May" } @string{jun = "June" } @string{jul = "July" } @string{aug = "August" } @string{sep = "September" } @string{oct = "October" } @string{nov = "November" } @string{dec = "December" } @string{first = "1st" } @string{second = "2nd" } @string{third = "3rd" } @string{fourth = "4th" } @string{fifth = "5th" } @string{sixth = "6th" } @string{seventh = "7th" } @string{eighth = "8th" } @string{ninth = "9th" } @string{tenth = "10th" } @string{iti_wagner = "ITI Wagner, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)" } @string{inf_ka = "Universit{\"a}t Karlsruhe (TH), Fakult{\"a}t f{\"u}r Informatik" } @string{uni_ka = "Universit{\"a}t Karlsruhe (TH)" } @string{kit_wagner = "ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT)" } %% -------------------------------------------------------------- %% authors %% -------------------------------------------------------------- @string{AbelloJ = "James Abello" } @string{AbiteboulS = "Serge Abiteboul" } @string{AbrahamI = "Ittai Abraham" } @string{Abu-KhzamFN = "Faisal N. Abu-Khzam" } @string{ActonFS = "Forman S. Acton" } @string{AdamicLA = "Lada A. Adamic" } @string{AdamopoulouE = "E. Adamopoulou" } @string{AdamsonP = "P. Adamson" } @string{aft = "testbja af" } @string{AgarwalG = "Gaurav Agarwal" } @string{AgarwalS = "Sharad Agarwal" } @string{AGDT = "Deutsche Telekom AG" } @string{AggarwalCC = "Charu C. Aggarwal" } @string{AggarwalV = "Vinay Aggarwal" } @string{AgrawalD = "Divyakant Agrawal" } @string{AgrestiA = "Alan Agresti" } @string{AhlswedeR = "Rudolf Ahlswede" } @string{AhoAV = "Alfred V. Aho" } @string{AhujaRK = "Ravindra K. Ahuja" } @string{AielloW = "William Aiello" } @string{AifadopoulouG = "Georgia Aifadopoulou" } @string{AignerM = "Martin Aigner" } @string{AingworthD = "Donald Aingworth" } @string{AkhanMB = "Mehmet B.\ Akhan" } @string{AkiyamaJ = "Jin Akiyama" } @string{AkonMM = "Mohammad Mursalin Akon" } @string{AlamJ = "Md. Jawaherul Alam" } @string{AlamSMN = "S.~M.~Nazrul Alam" } @string{AlaviY = "Yousef Alavi" } @string{AlbaRD = "Richard D. Alba" } @string{AlberJ = "Jochen Alber" } @string{AlbersS = "Susanne Albers" } @string{AlbertLH = "Louis H. Albert" } @string{AlbertR = "R{\'e}ka Albert" } @string{AlborziH = "Houman Alborzi" } @string{AldecoaR = "Rodrigo Aldecoa" } @string{AldenderferMS = "Mark S. Aldenderfer" } @string{AleardiLC = "Luca Castelli Aleardi" } @string{AlhajjR = "Reda Alhajj" } @string{AlmaasE = "Eivind Almaas" } @string{AlonN = "Noga Alon" } @string{AlonU = "Uri Alon" } @string{AlpertCJ = "Charles J.\ Alpert" } @string{AltH = "Helmut Alt" } @string{AltmannM = "Michael Altmann" } @string{AlvarezHamelinJI = "Jos{\'e} Ignacio Alvarez-Hamelin" } @string{AmaralLAN = "Lu{\'i}s A. Nunes Amaral" } @string{AmatoP = "Paolo Amato" } @string{AmdahlG = "Gene Amdahl" } @string{AminAT = "Ashok T. Amin" } @string{AminN = "Nada Amin" } @string{AmmarM = "Mostafa Ammar" } @string{AnalyticTech = "{Analytic Technologies}" } @string{AnderbergMR = "Michael R.~Anderberg" } @string{AndersenR = "Reid Andersen" } @string{AndersonBDO = "Brian D. O. Anderson" } @string{AndersonCJ = "Carolyn J. Anderson" } @string{AndersonJG = "James G. Anderson" } @string{AndersonMR = "Michael R.\ Anderson" } @string{AndreevEM = "E. M. Andreev" } @string{AndreevK = "Konstantin Andreev" } @string{AndreevSD = "Simeon Danailov Andreev" } @string{AndroutsopoulosKN = "Konstantinos N. Androutsopoulos" } @string{AngeliniP = "Patrizio Angelini" } @string{AnnexsteinFD = "Fred D. Annexstein" } @string{AnthonisseJ = "Jacob M. Anthonisse" } @string{AntsfeldL = "Leonid Antsfeld" } @string{AnY = "Yuan An" } @string{ArabieP = "Phipps Arabie" } @string{ArasuA = "Arvind Arasu" } @string{ArchakovAI = "Alexander I. Archakov" } @string{ArchambaultD = "Daniel Archambault" } @string{ArenasA = "Alex Arenas" } @string{ArgyriouE = "Evmorfia N. Argyriou" } @string{ArikushiK = "Karin Arikushi" } @string{AriyoshiH = "Hiromu Ariyoshi" } @string{ArkayaAD = "A. Diaz de Arkaya" } @string{ArnauV = "Vicente Arnau" } @string{ArnborgS = "Stefan Arnborg" } @string{ArnoldL = "Ludwig Arnold" } @string{AroraS = "Sanjeev Arora" } @string{ArtmeierA = "Andreas Artmeier" } @string{ArzJ = "Julian Arz" } @string{AsaduzzamanS = "Shah Asaduzzaman" } @string{AsahiroY = "Yuichi Asahiro" } @string{AtallahM = "Mikhail Atallah" } @string{AthenstadtJC = "Jan Christoph Athenst{\"a}dt" } @string{AtienzaN = "Nieves Atienza" } @string{AuberD = "David Auber" } @string{AurenhammerF = "Franz Aurenhammer" } @string{AusielloG = "Giorgio Ausiello" } @string{AusternMH = "Matthew H. Austern" } @string{AvinC = "Chen Avin" } @string{AvrachenkovK = "Avrachenkov Konstantin" } @string{AxenovichM = "Maria Axenovich" } @string{AzarY = "Yossi Azar" } @string{AzumaM = "Machiko Azuma" } @string{AzumaS = "Shigetoshi Azuma" } @string{BaakeP = "Pio Baake" } @string{BabaiL = "L{\'a}szl{\'o} Babai" } @string{BabenkoM = "Maxim Babenko" } @string{BachFR = "Francis R. Bach" } @string{BachlS = "Sabine Bachl" } @string{BachmaierC = "Christian Bachmaier" } @string{BadentM = "Melanie Badent" } @string{BaderDA = "David A. Bader" } @string{BaderR = "Roland Bader" } @string{BadoiuM = "Mihai B\u{a}doiu" } @string{BadraHO = "H. O. Badra" } @string{Baeza-YatesR = "Ricardo Baeza-Yates" } @string{BaggaJ = "Jay Bagga" } @string{BagrowJ = "James Bagrow" } @string{BairdD = "Daniel Baird" } @string{BalakrishnanH = "Hari Balakrishnan" } @string{BalasubramanianNV = "N. V. Balasubramanian" } @string{BalbuenaC = "Camino Balbuena" } @string{BaligaNS = "Nitin S. Baliga" } @string{BallMO = "Michael~O.~Ball" } @string{BaltzA = "Andreas Baltz" } @string{BalzerM = "Michael Balzer" } @string{Banaei-KashaniF = "Farnoush Banaei-Kashani" } @string{BanerjiRB = "Ranan B. Banerji" } @string{BansalN = "Nikhil Bansal" } @string{Bar-GeraH = "Hillel Bar-Gera" } @string{Bar-NoyA = "Amotz Bar-Noy" } @string{BarabasiAL = "Albert-L{\'a}szl{\'o} Barab{\'a}si" } @string{BarakeM = "Musbah Barake" } @string{BaraldiA = "A. Baraldi" } @string{BaranyI = "Imre B{\'a}r{\'a}ny" } @string{BarbayJ = "J{\'e}r{\'e}my Barbay" } @string{BarequetG = "Gill Barequet" } @string{BarnardST = "Stephen T. Barnard" } @string{BarnesJ = "Josh Barnes" } @string{BarnesTM = "Tiffany M.\ Barnes" } @string{BarnetteDW = "David W. Barnette" } @string{BarratA = "Alain Barrat" } @string{BarrettC = "Chris Barrett" } @string{BartalY = "Y. Bartal" } @string{BarthD = "D.\ Barth" } @string{BarthelemyM = "Marc Barth{\'e}lemy" } @string{BarYosseffZ = "Ziv Bar-Yosseff" } @string{BastertO = "Oliver Bastert" } @string{BastH = "Holger Bast" } @string{BastH2 = "Hannah Bast" } @string{BatageljV = "Vladimir Batagelj" } @string{BatistakisY = "Yannis Batistakis" } @string{BatzV = "Gernot Veit Batz" } @string{BauerA = "Andreas Bauer" } @string{BauerD = "Douglas Bauer" } @string{BauerM = "Michel Bauer" } @string{BauerR = "Reinhard Bauer" } @string{BaumannH = "Herv{\'e} Baumann" } @string{BaumannN = "Nadine Baumann" } @string{BaumM = "Moritz Baum" } @string{BaurM = "Michael Baur" } @string{BavelasA = "Alex Bavelas" } @string{BavierA = "Andy Bavier" } @string{BayenA = "Alex Bayen" } @string{BayikT = "Tolga Bayik" } @string{BeauchampM = "Murray A. Beauchamp" } @string{BeckerM = "M. Becker" } @string{BeenK = "Ken Been" } @string{BeeriC = "Catriel Beeri" } @string{BeerliovaZ = "Zuzana Beerliova" } @string{BehrendsE = "Ehrhard Behrends" } @string{BeierR = "Rene Beier" } @string{BeigelR = "Richard Beigel" } @string{BeilnerH = "Heinz Beilner" } @string{BeinekeLW = "Lowell W. Beineke" } @string{BekosM = "Michael Bekos" } @string{BelhumeuPN = "Peter N. Belhumeu" } @string{BellmanR = "Richard Bellman" } @string{BellMG = "Michael G. H. Bell" } @string{ben-AvrahamD = "Daniel ben-Avraham" } @string{BenadeG = "Gerhard Benade" } @string{BenAvrahamD = "ben-Avraham, Daniel" } @string{BenderS = "Stefan Bender" } @string{BenigniA = "A. Benigni" } @string{BenkertM = "Marc Benkert" } @string{BenzerS = "Seymour Benzer" } @string{BenzurA = "Andr{\'a}s A. Benz{\'u}r" } @string{BerberichK = "Klaus Berberich" } @string{BeregS = "Sergey Bereg" } @string{BergeC = "Claude Berge" } @string{Berger-WolfT = "Tanya Berger-Wolf" } @string{BergerA = "Annabell Berger" } @string{BergerAndre = "Andre Berger" } @string{BergerB = "Bonnie Berger" } @string{BergerN = "Noam Berger" } @string{BerkhinP = "Pavel Berkhin" } @string{BerkowitzSD = "Stephen D. Berkowitz" } @string{BermanKA = "Kenneth A. Berman" } @string{BermanP = "Piotr Berman" } @string{BermondJC = "J.-C. Bermond" } @string{BernsteinA = "Abraham Bernstein" } @string{BernsteinD = "David Bernstein" } @string{BerretiniE = "Emanuele Berretini" } @string{BerryJW = "Jonathan W. Berry" } @string{BerthomeP = "Pascal Berthom{\'e}" } @string{BertolazziP = "Paola Bertolazzi" } @string{BesagJE = "Julian E. Besag" } @string{BetzG = "Gregor Betz" } @string{BetzlerN = "Nadja Betzler" } @string{BeyererJ = "J{\"u}rgen Beyerer" } @string{BezrukovS = "Sergej Bezrukov" } @string{BhalgatA = "Anand Bhalgat" } @string{BhargavaVK = "Vijay K. Bhargava" } @string{BharghavanV = "Vaduvur Bharghavan" } @string{BhattSN = "Sandeep N. Bhatt" } @string{BianchiniM = "Bianchini, Monica" } @string{BiederbickC = "Claus Biederbick" } @string{BiedlT = "Therese Biedl" } @string{BiedlTC = "Therese C. Biedl" } @string{BielliM = "Maurizio Bielli" } @string{BikAJ = "Aart J. Bik" } @string{BingmannT = "Timo Bingmann" } @string{BinucciC = "Carla Binucci" } @string{BissetK = "Keith Bisset" } @string{BixbyRE = "Robert E. Bixby" } @string{BlaesiusT = "Thomas Bl{\"a}sius" } @string{BlairJ = "Jean Blair" } @string{BlakeIF = "Ian F. Blake" } @string{BlandfordDK = "Daniel K. Blandford" } @string{BlandinS = "Sebastien Blandin" } @string{BlashfieldRK = "Roger K. Blashfield" } @string{BlellochGE = "Guy E. Blelloch" } @string{BlomeA = "Abian Blome" } @string{BlondaP = "P. Blonda" } @string{BlondelV = "Vincent Blondel" } @string{BloomBH = "Burton H. Bloom" } @string{BlumA = "Avrim Blum" } @string{BlytheJ = "Jim Blythe" } @string{BMBFBf = "Bundesministerium (BMBF)" } @string{BobickA = "Aaron Bobick" } @string{BockN = "Nicolas Bock" } @string{BodirskyM = "Manuel Bodirsky" } @string{BodlaenderHL = "Hans L. Bodlaender" } @string{BoeckerS = "Sebastian B{\"o}cker" } @string{BoerP = "P. Boer" } @string{BoeschFT = "Francis T. Boesch" } @string{BogenbergerK = "Klaus Bogenberger" } @string{BogunaM = "Mari{\'a}n Bogu{\~n}{\'a}" } @string{BohlF = "Florian B{\"o}hl" } @string{BohmC = "Christian B{\"o}hm" } @string{BoilyMC = "M.-C.\ Boily" } @string{BoisseauO = "Oliver Boisseau" } @string{BoitmanisK = "Krists Boitmanis" } @string{BoldiP = "Paolo Boldi" } @string{BollobasB = "B{\'e}la Bollob{\'a}s" } @string{BomanE = "Erik Boman" } @string{BomzeIM = "Immanuel M. Bomze" } @string{BonacichP = "Phillip Bonacich" } @string{BondJ = "J.~Bond" } @string{BondyJA = "John Adrian Bondy" } @string{BonichonN = "Nicolas Bonichon" } @string{BonifaciV = "Vincenzo Bonifaci" } @string{BonizzoniP = "Paola Bonizzoni" } @string{BoormanSA = "Scott A.\ Boorman" } @string{BoorstynRR = "Robert~R.~Boorstyn" } @string{BoothKS = "Kellogg S. Booth" } @string{BoppanaRB = "Ravi B. Boppana" } @string{BorgattiSP = "Stephen P. Borgatti" } @string{BorgsC = "Christian Borgs" } @string{BornholdtS = "Stefan Bornholdt" } @string{BorodinA = "Borodin, Allan" } @string{BorosE = "Endre Boros" } @string{BorzyszkowskiAM = "Andrzej M. Borzyszkowski" } @string{BoseP = "Prosenjit Bose" } @string{BotafogoRA = "Rodrigo A. Botagfogo" } @string{BoteaA = "Adi Botea" } @string{BoulmakoulA = "Azedine Boulmakoul" } @string{BowenR = "Rufus Bowen" } @string{BoydJP = "John P.\ Boyd" } @string{BoydS = "Stephen Boyd" } @string{BoykovY = "Yuri Boykov" } @string{BozdagD = "Doruk Bozdag" } @string{BraeysyO = "Olli Br{\"a}ysy" } @string{BrandenburgFJ = "Franz J. Brandenburg" } @string{BrandesU = "Ulrik Brandes" } @string{BrandstaedtA = "Andreas Brandst{\"a}dt" } @string{BrandtF = "Felix Brandt" } @string{BrankeJ = "J{\"u}rgen Branke" } @string{BrannlundJ = "Johan Br{\"a}nnlund" } @string{BrehmE = "Enno Brehm" } @string{BreigerRL = "Ronald L.\ Breiger" } @string{BrennerT = "Thomas Brenner" } @string{BreuH = "Heinz Breu" } @string{BrewerCA = "Cynthia A. Brewer" } @string{BrewerEA = "Eric A. Brewer" } @string{BriesemeisterS = "Sebastian Briesemeister" } @string{BrightwellGR = "Graham R. Brightwell" } @string{BrilloutR = "Romuald Brillout" } @string{BrinkmannG = "Gunnar Brinkmann" } @string{BrinkmeierM = "Michael Brinkmeier" } @string{BrinkRvd = "van den Brink, Ren{\'e}" } @string{BrinS = "Sergey Brin" } @string{BroadA = "Alan Broad" } @string{BrockenauerR = "Ralf Brockenauer" } @string{BrodalG = "Gerth Brodal" } @string{BroderA = "Andrei Broder" } @string{BronC = "Coen Bron" } @string{BronnimannH = "Herv{\'e} Br{\"o}nnimann" } @string{BrooksRL = "R. L. Brooks" } @string{BrualdiRA = "Richard A. Brualdi" } @string{BruckdorferT = "Till Bruckdorfer" } @string{BruckJ = "Jehoshua Bruck" } @string{BrueraF = "Francesco Bruera" } @string{BruggesserH = "Heinz Bruggesser" } @string{BrunelE = "Edith Brunel" } @string{BrunoJ = "John Bruno" } @string{BuchananM = "Mark Buchanan" } @string{BuchheimC = "Christoph Buchheim" } @string{BuchinK = "Kevin Buchin" } @string{BuchinM = "Maike Buchin" } @string{BuchmannM = "Michael Buchmann" } @string{BuchsbaumAL = "Adam L. Buchsbaum" } @string{BudinichM = "Marco Budinich" } @string{BudiuM = "Mihai Budiu" } @string{BuesingC = "Christina B{\"u}sing" } @string{BuhlerT = "Thomas B{\"u}hler" } @string{BuiTN = "Thang Nguyen Bui" } @string{BulirschR = "Roland Bulirsch" } @string{BungartzH = "Hans-Joachim Bungartz" } @string{BunkeH = "Horst Bunke" } @string{BurgardW = "Wolfram Burgard" } @string{BuriolL = "Luciana Buriol" } @string{BurkardRE = "Rainer E. Burkard" } @string{BurriN = "Nicolas Burri" } @string{BurtRS = "Ronald S.\ Burt" } @string{BuT = "Tian Bu" } @string{ByersJ = "John Byers" } @string{ByrkaJ = "Jaroslaw Byrka" } @string{CaceresR = "Ramon Caceres" } @string{CafieriS = "Sonia Cafieri" } @string{CaflischA = "Amedeo Caflisch" } @string{Caida = "{CAIDA: The Cooperative Association for Internet Data Analysis}" } @string{CaiN = "Ning Cai" } @string{CaldarelliG = "Guido Caldarelli" } @string{CaldwellT = "Tom Caldwell" } @string{CalinescuG = "Gruia Calinescu" } @string{CallawayDS = "Duncan S. Callaway" } @string{CalvertKL = "Kenneth L. Calvert" } @string{CalvoRW = "Roberto Wolfler Calvo" } @string{CantnerU = "Uwe Cantner" } @string{CapobiancoMF = "Michael F. Capobianco" } @string{CapocciA = "Andrea Capocci" } @string{CarchioloV = "V. Carchiolo" } @string{CardeiM = "Mihaela Cardei" } @string{CardeneoA = "Andreas Cardeneo" } @string{CardonA = "A. Cardon" } @string{CarleyKM = "Kathleen M. Carley" } @string{CarlinJB = "John B.\ Carlin" } @string{CarlsonJ = "Josiah Carlson" } @string{CarlssonE = "Erik Carlsson" } @string{CarmelL = "Liran Carmel" } @string{CarmiP = "Paz Carmi" } @string{CarmiS = "Shai Carmi" } @string{CarmonaA = "{\'A}ngeles Carmona" } @string{CarpenterT = "Tami Carpenter" } @string{CarringtonPJ = "Peter J. Carrington" } @string{CarterL = "Larry Carter" } @string{CasagrandeN = "Norman Casagrande" } @string{CasellaG = "George Casella" } @string{CastellanoC = "Claudio Castellano" } @string{CastelliV = "Vittorio Castelli" } @string{CatalyurekU = "Umit Catalyurek" } @string{CederbaumI = "Israel Cederbaum" } @string{ChakrabartiD = "Deepayan Chakrabarti" } @string{ChalmersM = "M. Chalmers" } @string{ChalopinJ = "J{\'e}r{\'e}mie Chalopin" } @string{ChandaA = "Amrita Chanda" } @string{ChandrakasanA = "Anantha Chandrakasan" } @string{ChandranBG = "Bala G. Chandran" } @string{ChangH = "Hyunseok Chang" } @string{ChangJ = "Jae-Hwan Chang" } @string{ChanTM = "Timothy M. Chan" } @string{ChardaireP = "Pierre Chardaire" } @string{CharikarM = "Moses Charikar" } @string{ChartrandG = "Gary Chartrand" } @string{ChataignerF = "Fr{\'e}d{\'e}ric Chataigner" } @string{ChaudhuriS = "Soma Chaudhuri" } @string{ChawlaS = "Shuchi Chawla" } @string{ChayesJ = "Jennifer Chayes" } @string{ChekuriC = "Chandra Chekuri" } @string{ChenCY = "Chieh-Yu Chen" } @string{ChenDZ = "Danny Z. Chen" } @string{ChengC = "C.K. Cheng" } @string{ChengCC = "C. C. Cheng" } @string{ChengD = "David Cheng" } @string{ChengJ = "Jiefeng Cheng" } @string{ChenHo = "Ho-Lin Chen" } @string{ChenJ = "Jian-Jia Chen" } @string{ChenJiamo = "Jiamo Chen" } @string{ChenJianer = "Jianer Chen" } @string{ChenQ = "Qian Chen" } @string{ChenR = "Runsheng Chen" } @string{ChenW = "Wei Chen" } @string{ChenY = "Yubin Chen" } @string{ChenYa = "Yanyan Chen" } @string{ChenYj = "Yijia Chen" } @string{ChenZ = "Zaiben Chen" } @string{CheongO = "Otfried Cheong" } @string{CheriyanJ = "Joseph Cheriyan" } @string{CherkasskyBV = "Boris V. Cherkassky" } @string{ChervonenkisAY = "Alexey Ya. Chervonenkis" } @string{ChevalierC = "C{\'e}dric Chevalier" } @string{ChiangY = "Yi-Ting Chiang" } @string{ChibaN = "Norishige Chiba" } @string{ChickeringM = "Max Chickering" } @string{ChienS = "Steve Chien" } @string{ChimaniM = "Markus Chimani" } @string{ChinFYL = "F. Y. L. Chin" } @string{ChintalapudiKK = "Krishna Kant Chintalapudi" } @string{ChiriacC = "Camelia Chiriac" } @string{ChklovskiiD = "Dmitri Chklovskii" } @string{ChlebikovaJ = "Janka Chleb{\'{\i}}kov{\'a}" } @string{ChoH = "Hyung-Ju Cho" } @string{ChoiD = "Dae-Hyun Choi" } @string{ChoJD = "J. D. Cho" } @string{ChorB = "Benny Chor" } @string{ChoY = "Young-rae Cho" } @string{ChrisohoouE = "Evangelia Chrisohoou" } @string{ChristianoP = "Paul Christiano" } @string{ChristofidesN = "Nicos Christofides" } @string{ChrobakM = "Marek Chrobak" } @string{ChuangRC = "Richie Chih-Nan Chuang" } @string{ChungC = "Chin-Wan Chung" } @string{ChungFRK = "Fan R. K. Chung" } @string{ChunJ = "Jinhee Chun" } @string{ChvatalV = "Va{\v s}ek Chv{\'a}tal" } @string{ChwaK = "Kyung-Yong Chwa" } @string{CiceroneS = "Serafino Cicerone" } @string{ClaffyK = "K. Claffy" } @string{ClarksonKL = "Kenneth L. Clarkson" } @string{ClausetA = "Aaron Clauset" } @string{ClevelandWS = "William S. Cleveland" } @string{CobenaG = "Gregory Cobena" } @string{CodenottiB = "Bruno Codenotti" } @string{CoetzeeFM = "Frans M. Coetzee" } @string{CohenE = "Edith Cohen" } @string{CohenJD = "Johnathan D. Cohen" } @string{CohenR = "Reuven Cohen" } @string{ColbournCJ = "Charles J. Colbourn" } @string{CollinsRL = "Rebecca L. Collins" } @string{ColumbusT = "Tobias Columbus" } @string{CondonA = "Anne Condon" } @string{ConnellJ = "J. Connell" } @string{ConnellyR = "Robert Connelly" } @string{ConradCA = "Charles A. Conrad" } @string{CooganK = "Kevin Coogan" } @string{CookDJ = "Diane J.\ Cook" } @string{CookeK = "K. Cooke" } @string{CookSA = "Stephen A. Cook" } @string{CookSW = "Stuart W. Cook" } @string{CookW = "William Cook" } @string{CooperC = "Colin Cooper" } @string{CoppersmithD = "Don Coppersmith" } @string{CormanSR = "Steven R. Corman" } @string{CormenTH = "Thomas H. Cormen" } @string{CorneDW = "David W. Corne" } @string{CorneilDG = "Derek G. Corneil" } @string{CornelsenS = "Sabine Cornelsen" } @string{CortesC = "Cort{\'e}s, Carmen" } @string{CoverTM = "Thomas M. Cover" } @string{CowenL = "Lenore Cowen" } @string{CoxMAA = "Michael A. A. Cox" } @string{CoxR = "Russ Cox" } @string{CoxTF = "Trevor F.\ Cox" } @string{CrescenziP = "Pierluigi Crescenzi" } @string{CrobakJR = "Joseph R. Crobak" } @string{CrochemoreM = "Maxime Crochemore" } @string{CrossM = "Mark Cross" } @string{CrouchB = "Bradley Crouch" } @string{CsardiG = "G{\'a}bor Cs{\'a}rdi" } @string{CulbersonJC = "Joseph C. Culberson" } @string{CvetkovicDM = "Drago{\v s} M. Cvetkovi{\'c}" } @string{CvijicS = "S. Cvijic" } @string{CychowskiM = "M. Cychowski" } @string{CzajkaT = "Tomek Czajka" } @string{CzajkowskiG = "Grzegorz Czajkowski" } @string{CzygrinowA = "Andrzej Czygrinow" } @string{DabekF = "Frank Dabek" } @string{DahlhausE = "Elias Dahlhaus" } @string{DAlexandriFL = "Fabio Luiz D'Alexandri" } @string{DallAstaL = "Luca Dall'Asta" } @string{DalyF = "F.\ Daly" } @string{DamERv = "Edwin R. van Dam" } @string{DangC = "Chuangyin Dang" } @string{DangeloG = "Gianlorenzo D'Angelo" } @string{DankelmannP = "Peter Dankelmann" } @string{DanonL = "Leon Danon" } @string{DantzigGB = "George B. Dantzig" } @string{DasB = "Bevan Das" } @string{DasGuptaB = "Bhaskar DasGupta" } @string{DasguptaK = "Koustuv Dasgupta" } @string{DaskinMS = "Mark S.\ Daskin" } @string{DasS = "Sandip Das" } @string{DasSK = "Sajal K. Das" } @string{DavidsonR = "Ron Davidson" } @string{DawsonS = "Steve Dawson" } @string{DayalU = "Umeshwar Dayal" } @string{DeanBC = "Brian C. Dean" } @string{deBergM = "Mark de Berg" } @string{DebK = "Kalyanmoy Deb" } @string{deCastroN = "de Castro, Natalia" } @string{DechterR = "Rina Dechter" } @string{DeesJ = "Jonathan Dees" } @string{deFraysseixH = "de Fraysseix, Hubert" } @string{DegenhardtW = "W. Degenhardt" } @string{DehmerM = "Matthias Dehmer" } @string{DehneF = "Frank Dehne" } @string{DehnertJC = "James C. Dehnert" } @string{DelaneyK = "K. Delaney" } @string{DellamicoM = "Mauro Dell'Amico" } @string{DellingD = "Daniel Delling" } @string{DellingG = "G{\"u}nter Delling" } @string{DellingM = "Markus Delling" } @string{DellnitzM = "Michael Dellnitz" } @string{DeLosRiosP = "De Los Rios, Paolo" } @string{DelprattO = "O'Neil Delpratt" } @string{DemaineED = "Erik D. Demaine" } @string{DemestichasK = "K. Demestichas" } @string{DemetrescuC = "Camil Demetrescu" } @string{DEmidioM = "Mattia D'Emidio" } @string{DemiryurekU = "Ugur Demiryurek" } @string{DenardoEV = "Eric V. Denardo" } @string{DeniseA = "Alain Denise" } @string{DeoN = "Narsingh Deo" } @string{DerbelB = "Bilel Derbel" } @string{DerenyiI = "Imre Der{\'e}nyi" } @string{DesaiD = "Devendra Desai" } @string{DeshpandeA = "Amit Deshpande" } @string{DesrochersM = "Martin Desrochers" } @string{DesrosiersJ = "Jacques Desrosiers" } @string{DeussenO = "Oliver Deussen" } @string{DeutschM = "Morton Deutsch" } @string{DevillersO = "Olivier Devillers" } @string{DevineK = "Karen Devine" } @string{DhandapaniR = "Raghavan Dhandapani" } @string{DhawanA = "Akshaye Dhawan" } @string{DialloM = "Madiagne Diallo" } @string{DialRB = "Robert B. Dial" } @string{DiazGuileraA = "Albert D{\'i}az-Guilera" } @string{DiBattistaG = "Di Battista, Giuseppe" } @string{DibbeltJ = "Julian Dibbelt" } @string{DidimoW = "Walter Didimo" } @string{DiehlS = "Stephan Diehl" } @string{DiekmannR = "Ralf Diekmann" } @string{DiestelR = "Reinhard Diestel" } @string{DietzfelbingerM = "Martin Dietzfelbinger" } @string{DiGiacomoE = "Di Giacomo, Emilio" } @string{DijkstraEW = "Edsger W. Dijkstra" } @string{DijkTv = "Thomas van Dijk" } @string{DillenburgJ = "John F. Dillenburg" } @string{DillencourtMB = "Michael B. Dillencourt" } @string{DillmannR = "R{\"u}diger Dillmann" } @string{DillS = "Stephen Dill" } @string{DingCHQ = "Ding, Chris H. Q." } @string{DingG = "Guoli Ding" } @string{DinhTN = "Thang N. Dinh" } @string{DinitzY = "Yefim Dinitz" } @string{DiracGA = "Gabriel A. Dirac" } @string{DisserY = "Yann Disser" } @string{DiStefanoG = "Gabriele Di Stefano" } @string{DiZ = "Zengru Di" } @string{DjidjevHN = "Hristo N. Djidjev" } @string{DoarMB = "Matthew B. Doar" } @string{DoddiS = "Srinivas Doddi" } @string{DoenhardtJ = "J{\"u}rgen Doenhardt" } @string{DogrusozU = "Ugur Dogrus{\"o}z" } @string{DohertyL = "Lance Doherty" } @string{DolinskiK = "Kara Dolinski" } @string{DollC = "Christof Doll" } @string{DollevoetT = "Twan Dollevoet" } @string{DomschkeW = "Wolfgang Domschke" } @string{DonahooMJ = "Michael J. Donahoo" } @string{DonathWE = "William E. Donath" } @string{DonatiAV = "Alberto V. Donati" } @string{DondiR = "Riccardo Dondi" } @string{DongarraJ = "Jack Dongarra" } @string{DongenS = "van Dongen, Stijn M." } @string{DongQ = "Qunfeng Dong" } @string{DongY = "Yingfei Dong" } @string{DongZY = "Zhao Yang Dong" } @string{DoobM = "Michael Doob" } @string{DoreianP = "Patrick Doreian" } @string{DornF = "Frederic Dorn" } @string{DorogovtsevSN = "Sergey N. Dorogovtsev" } @string{DoslicT = "Tomislav Do{\v s}li{\' c}" } @string{DoulkeridisC = "Christos Doulkeridis" } @string{DowneyRG = "Rodney G. Downey" } @string{DreherS = "S. Dreher" } @string{DreierT = "Thomas Dreier" } @string{DrewsF = "Florian Drews" } @string{DrexlA = "Andreas Drexl" } @string{DreyfusSE = "Stuart E. Dreyfus" } @string{DreznerZ = "Zvi Drezner" } @string{DrineasP = "Petros Drineas" } @string{DubanovAV = "Alexander V. Dubanov" } @string{DubesRC = "Richard C. Dubes" } @string{DucheneautN = "Nicolas Ducheneaut" } @string{DuchJ = "Jordi Duch" } @string{DuchonP = "Philippe Duchon" } @string{DuDZ = "Ding-Zhu Du" } @string{DuffusD = "D. Duffus" } @string{DuH = "Haifeng Du" } @string{DuijnMAJ = "van Duijn, Marijtje A.J." } @string{DujmovicV = "Vida Dujmovi{\'c}" } @string{DuncanCA = "Christian A. Duncan" } @string{DunlaingCO = "Colm {\'O} D{\'u}nlaing" } @string{DurstenfeldR = "Richard Durstenfeld" } @string{DuschlM = "Matthias Duschl" } @string{DworkC = "Cynthia Dwork" } @string{DwyerRA = "Rex A. Dwyer" } @string{DwyerT = "Tim Dwyer" } @string{EadesP = "Peter Eades" } @string{EberhardF = "Felix Eberhard" } @string{EbertA = "Achim Ebert" } @string{EbertJ = "J{\"u}rgen Ebert" } @string{EdmondsJ = "Jack Edmonds" } @string{EFClementiA = "Andrea E.~F.~Clementi" } @string{EfentakisA = "Alexandros Efentakis" } @string{EffingerP = "Philip Effinger" } @string{EfratA = "Alon Efrat" } @string{EgervaryE = "Eugene Egerv\'ary" } @string{EguiluzVM = "V{'i}ctor M. Egu{'i}luz" } @string{EhrgottM = "Matthias Ehrgott" } @string{EichelbergerH = "Holger Eichelberger" } @string{EidenbenzS = "Stephan Eidenbenz" } @string{EigenwilligA = "Arno Eigenwillig" } @string{EiglspergerM = "Markus Eiglsperger" } @string{EisenbrandF = "Friedrich Eisenbrand" } @string{EisenstatD = "David Eisenstat" } @string{EisnerJ = "Jochen Eisner" } @string{El-HamdouchiA = "Abdelmoula El-Hamdouchi" } @string{ElAbbadiA = "Amr {El~Abbadi}" } @string{EliasP = "Peter Elias" } @string{ElmaghrabySE = "Salah E. Elmaghraby" } @string{ElmasryA = "Amr Elmasry" } @string{ElsaesserR = "Robert Els{\"a}sser" } @string{EmanuelD = "Dotan Emanuel" } @string{EmdenWeinertT = "Thomas Emden-Weinert" } @string{Emmert-StreibF = "Frank Emmert-Streib" } @string{EmmettMR = "Mark R. Emmett" } @string{EngebretsenL = "Lars Engebretsen" } @string{EngelsmanEC = "E. C. Engelsman" } @string{EnnisJG = "James G. Ennis" } @string{EnsorA = "Andrew Ensor" } @string{EppsteinD = "David Eppstein" } @string{EpsteinL = "Leah Epstein" } @string{EraH = "Hiroshi Era" } @string{ErdoesP = "Paul Erd{\H o}s" } @string{ErenT = "Tolga Eren" } @string{ErezK = "Keren Erez" } @string{ErlebachT = "Thomas Erlebach" } @string{ErtenC = "Cesim Erten" } @string{ErtlG = "Gerhard Ertl" } @string{ErwigM = "Martin Erwig" } @string{EsfahanianAH = "Abdol-Hossein Esfahanian" } @string{EssaI = "Irfan Essa" } @string{EstrinD = "Deborah Estrin" } @string{EswaranKP = "{Kapali P.} Eswaran" } @string{EubankS = "Stephen Eubank" } @string{EulerL = "Leonhard Euler" } @string{EvansJR = "Jim R. Evans" } @string{eVB = "BITKOM e.V." } @string{EvenG = "Guy Even" } @string{EvenS = "Shimon Even" } @string{EverettMG = "Martin G.\ Everett" } @string{eVMK = "M{\"u}nchner Kreis e.V." } @string{FaberV = "Vance Faber" } @string{FabregaJ = "Josep F{\`a}brega" } @string{FabrikantA = "Alex Fabrikant" } @string{FaginR = "Ronald Fagin" } @string{FahrmeirL = "Ludwig Fahrmeir" } @string{FakcharoenpholJ = "Jittat Fakcharoenphol" } @string{FaloutsosC = "Christos Faloutsos" } @string{FaloutsosM = "Michalis Faloutsos" } @string{FaloutsosP = "Petros Faloutsos" } @string{FandelG = "G{\"u}nter Fandel" } @string{FanH = "Hongbing Fan" } @string{FanY = "Ying Fan" } @string{FarinaM = "Marco Farina" } @string{FarkasI = "Ill{\'e}s Farkas" } @string{FarshiM = "Mohammad Farshi" } @string{FaryI = "Istv{\'a}n F{\'a}ry" } @string{FasuloD = "Daniel Fasulo" } @string{FaustK = "Katherine Faust" } @string{FederT = "Tom{\'a}s Feder" } @string{FeigenbaumJ = "Joan Feigenbaum" } @string{FeigeU = "Uriel Feige" } @string{FeinsteinA = "Amiel Feinstein" } @string{FeketeSP = "S{\'a}ndor P. Fekete" } @string{FeldmanMW = "Marcus W.\ Feldman" } @string{FeldmannA = "Anja Feldmann" } @string{FeldmannP = "P. Feldmann" } @string{FellowsMR = "Michael R. Fellows" } @string{FelsnerS = "Stefan Felsner" } @string{FengQ = "Qing-Wen Feng" } @string{FengX = "Xiangyang Feng" } @string{FennerT = "Trevor Fenner" } @string{FerligojA = "Anu{\v s}ka Ferligoj" } @string{FerligojAs = "Anu{\v s}ka Ferligoj" } @string{FernandezA = "Alberto Fernandez" } @string{FernandezJC = "Jean-Claude Fernandez" } @string{FernauH = "Henning Fernau" } @string{FerraginaP = "Paolo Ferragina" } @string{FerrarWL = "William L. Ferrar" } @string{FerreiraA = "Afonso Ferreira" } @string{FestaP = "Paola Festa" } @string{FeuersteinE = "E. Feuerstein" } @string{FialaJ = "Ji{\v r}{\'i} Fiala" } @string{FialkoS = "Sergej Fialko" } @string{FiatA = "Amos Fiat" } @string{FiducciaCM = "C. M. Fiduccia" } @string{FiedlerH = "Herbert Fiedler" } @string{FiedlerM = "Miroslav Fiedler" } @string{FieldsS = "Stanley Fields" } @string{FienbergSE = "Stephen E. Fienberg" } @string{FiessC = "Christian Fiess" } @string{FineP = "Peter Fine" } @string{FinkM = "Martin Fink" } @string{FinocchiI = "Irene Finocchi" } @string{FiolMA = "Miguel A. Fiol" } @string{FischettiM = "Matteo Fischetti" } @string{FisherRA = "Ronald Aylmer Fisher" } @string{FiskCJ = "C. J. Fisk" } @string{FiskLA = "Lee Ann Fisk" } @string{FiskS = "Stephen Fisk" } @string{FjallstromP = "Per-Olof Fj{\"a}llstr{\"o}m" } @string{FlajoletP = "Philippe Flajolet" } @string{FlakeGW = "Gary William Flake" } @string{FlanneryBP = "Brian P. Flannery" } @string{FleischerD = "Daniel Fleischer" } @string{FleischerL = "Lisa Fleischer" } @string{FleischerR = "Rudolf Fleischer" } @string{FlemingPJ = "Peter J. Fleming" } @string{FlinsenbergIC = "Ingrid C.M. Flinsenberg" } @string{FloaterMS = "Michael S. Floater" } @string{FlotterodG = "Gunnar Fl{\"o}tter{\"o}d" } @string{FloydRW = "Robert W. Floyd" } @string{FlynnPJ = "Patrick J. Flynn" } @string{FoggiaP = "Pasquale Foggia" } @string{FominFV = "Fedor V. Fomin" } @string{FordLR = "Ford, Jr., Lester R." } @string{ForemanRK = "Robert K. Foreman" } @string{FormannM = "Michael Formann" } @string{ForsterM = "Michael Forster" } @string{FortinS = "Scott Fortin" } @string{FortunatoS = "Santo Fortunato" } @string{FoschiniL = "Luca Foschini" } @string{FossmeierU = "Ulrich F{\"o}{\ss}meier" } @string{FosterBL = "Brian L. Foster" } @string{FosterI = "Ian Foster" } @string{FotiF = "Fletcher Foti" } @string{FoussF = "Fran{\c{c}}ois Fouss" } @string{Fox-EpsteinE = "Eli Fox-Epstein" } @string{FoxBL = "Bennett L. Fox" } @string{FoxG = "Geoffrey Fox" } @string{FraigniaudP = "Pierre Fraigniaud" } @string{FrancisMC = "Mathew C. Francis" } @string{FrancisRL = "Richard L.\ Francis" } @string{FrankA = "Andr{\'a}s Frank" } @string{FrankeR = "Robert Franke" } @string{FrankH = "Howard Frank" } @string{FrankKA = "Kenneth A. Frank" } @string{FrankO = "Ove Frank" } @string{FrankS = "Stephen Frank" } @string{FratiF = "Fabrizio Frati" } @string{FredAL = "Ana L. Fred" } @string{FredeL = "Lennart Frede" } @string{FredericksonGN = "Greg N. Frederickson" } @string{FredmanML = "Michael L. Fredman" } @string{FreemanLC = "Linton Clarke Freeman" } @string{FreidingerM = "Myriam Freidinger" } @string{FrickAK = "Arne K.\ Frick" } @string{FridmanAA = "A. A. Fridman" } @string{FriedkinNE = "Noah E. Friedkin" } @string{FriedlandS = "Shmuel Friedland" } @string{FrietschR = "Rainer Frietsch" } @string{FriezeAM = "Alan M. Frieze" } @string{FrigioniD = "Daniele Frigioni" } @string{FrischIT = "Ivan T. Frisch" } @string{FruchtermanTMJ = "Thomas M. J. Fruchterman" } @string{FuB = "Bin Fu" } @string{FuchsF = "Fabian Fuchs" } @string{FuerediZ = "Zolt{\'a}n F{\"u}redi" } @string{FujisawaT = "Toshio Fujisawa" } @string{FukunagaT = "Takuro Fukunaga" } @string{FuL = "L. Fu" } @string{FulekR = "Radoslav Fulek" } @string{FulkersonDR = "Delbert R. Fulkerson" } @string{FunCT = "C. T. Fan" } @string{FunkeS = "Stefan Funke" } @string{FurerM = "Martin F{\"u}rer" } @string{FusyE = "{\'E}ric Fusy" } @string{GabowHN = "Harold N. Gabow" } @string{GaedekeT = "Tobias G{\"a}deke" } @string{GaertlerM = "Marco Gaertler" } @string{GajerP = "Pawel Gajer" } @string{GalilZ = "Zvi Galil" } @string{GallaiT = "Tibor Gallai" } @string{GalloG = "Giorgio Gallo" } @string{GalT = "T. Gal" } @string{GaltierJ = "J. Galtier" } @string{GambardellaLM = "Luca M. Gambardella" } @string{GambosiG = "Giorgio Gambosi" } @string{GandhiR = "Rajiv Gandhi" } @string{GandibleuxX = "Xavier Gandibleux" } @string{GanesanD = "Deepak Ganesan" } @string{GansnerER = "Emden R. Gansner" } @string{GaoJ = "Jie Gao" } @string{GaoJun = "Jun Gao" } @string{GaoL = "Lixin Gao" } @string{Garcia-Luna-AcevesJJ = "J. J. Garcia-Luna-Aceves" } @string{GardinerEJ = "Eleanor J. Gardiner" } @string{GareyMR = "Michael R. Garey" } @string{GargA = "Ashim Garg" } @string{GargN = "Naveen Garg" } @string{GarlandM = "Michael Garland" } @string{GarridoMA = "Garrido, M. {\'A}ngeles" } @string{GattoM = "Michael Gatto" } @string{GaudiotJL = "Jean-Luc Gaudiot" } @string{GaulW = "Wolfgang Gaul" } @string{GavlasH = "Heather Gavlas" } @string{GavoilleC = "Cyril Gavoille" } @string{GavrilovaM = "Marina Gavrilova" } @string{GawronC = "Christian Gawron" } @string{GebhardtA = "Andreas Gebhardt" } @string{GehlsenB = "Bj{\"o}rn Gehlsen" } @string{GehrkeJ = "Johannes Gehrke" } @string{GeisbergerR = "Robert Geisberger" } @string{GelattCD = "C. D. Gelatt" } @string{GellerD = "Dennis Geller" } @string{GelmanA = "Andrew Gelman" } @string{GemsaA = "Andreas Gemsa" } @string{GendreauM = "Michel Gendreau" } @string{GeraetsF = "Frank Geraets" } @string{GerritsD = "Dirk Gerrits" } @string{Geyer-SchulzA = "Andreas Geyer-Schulz" } @string{GeyerM = "Markus Geyer" } @string{GhoshJ = "Joydeep Ghosh" } @string{GiannakopoulouK = "Kalliopi Giannakopoulou" } @string{GibbonsP = "Phillip Gibbons" } @string{GibsonD = "David Gibson" } @string{GilbargD = "David Gilbarg" } @string{GilbertEN = "Horst Gilbert" } @string{GilesCL = "C.\ Lee Giles" } @string{GilksWR = "Walter R.\ Gilks" } @string{GillesRP = "Gilles, Robert P." } @string{GilmorePC = "Paul C. Gilmore" } @string{GimenezO = "Omar Gim{\'e}nez" } @string{GiniC = "Corrado Gini" } @string{GinkelA = "Andreas Ginkel" } @string{GionisA = "Aristides Gionis" } @string{GiordanoF = "Francesco Giordano" } @string{GiotisI = "Ioannis Giotis" } @string{GiovanniLD = "Luigi De Giovanni" } @string{GiraltF = "Francesc Giralt" } @string{GirardA = "Andre Girard" } @string{GiridharA = "Arvind Giridhar" } @string{GirvanM = "Michelle Girvan" } @string{GkantsidisC = "Christos Gkantsidis" } @string{GlanceN = "Natalie Glance" } @string{GlaserD = "Dieter Glaser" } @string{GlausB = "Bj{\"o}rn Glaus" } @string{GlazJ = "Joseph Glaz" } @string{GleiserP = "Pablo Gleiser" } @string{GmbHEC = "EICT GmbH" } @string{GmbHTI = "TNS Infratest GmbH" } @string{GoddardW = "Wayne Goddard" } @string{GodsilC = "Chris Godsil" } @string{GoelA = "Ashish Goel" } @string{GoerigkM = "Marc Goerigk" } @string{GoerkeR = "Robert G{\"o}rke" } @string{GogateV = "Vibhav Gogate" } @string{GohK = "Kwang-Il Goh" } @string{GoldbergAV = "Andrew V. Goldberg" } @string{GoldenbergDK = "David K. Goldenberg" } @string{GoldnerA = "Anita Goldner" } @string{GoldsmithDL = "Donald L. Goldsmith" } @string{GoldwasserMH = "Michael H. Goldwasser" } @string{GolinelliO = "Olivier Golinelli" } @string{GolubGH = "Gene H.\ Golub" } @string{GomezS = "Sergio Gomez" } @string{GomoryRE = "Ralph E. Gomory" } @string{GoncalvesD = "Daniel Gon{\c{c}}alves" } @string{GongiW = "Weibo Gongi" } @string{GonzalezTF = "Teofilo F.\ Gonzalez" } @string{GoodmanA = "Arnold Goodman" } @string{GoodmanJE = "Jacob E.\ Goodman" } @string{GoodrichMT = "Michael T. Goodrich" } @string{GoriM = "Gori, Marco" } @string{GortlerSJ = "Steven J. Gortler" } @string{GotoS = "Susumu Goto" } @string{GotsmanC = "Craig Gotsman" } @string{GottliebL = "Lee-Ad Gottlieb" } @string{GoussevskaiaO = "Olga Goussevskaia" } @string{GoverdeR = "Rob Goverde" } @string{GovindanR = "Ramesh Govindan" } @string{GovindarajuN = "Naga Govindaraju" } @string{GovorunVM = "Vadim M. Govorun" } @string{GraetzerG = "George Gr{\"a}tzer" } @string{GrafH = "Holger Graf" } @string{GrahamRL = "Ronald L. Graham" } @string{GrandoniF = "Fabrizio Grandoni" } @string{GranovetterMS = "Mark S.\ Granovetter" } @string{GrassW = "Werner Grass" } @string{GribbleSD = "Steven D.\ Gribble" } @string{GriggsJR = "Jerrold R. Griggs" } @string{GrigoriadisMD = "Michail D. Grigoriadis" } @string{GrilliL = "Luca Grilli" } @string{GrimaCI = "Grima, Clara I." } @string{GrimmerM = "Martin Grimmer" } @string{GrimmettG = "Geoffrey Grimmett" } @string{GrinsteadCM = "Charles Miller Grinstead" } @string{GroeplC = "Clemens Gr{\"o}pl" } @string{GroneR = "Robert Grone" } @string{GroppW = "William Gropp" } @string{GrossiR = "Roberto Grossi" } @string{GrossJL = "Jonathan L. Gross" } @string{GrossM = "Markus Gross" } @string{GrossOA = "O. A. Gross" } @string{GrotschelM = "M. Gr{\"o}tschel" } @string{GruenbaumB = "Branko Gr{\"u}nbaum" } @string{GruppH = "Hariolf Grupp" } @string{gtf = "{General Transit Feed}" } @string{GuanLJ = "Lin Jie Guan" } @string{GudenbergJW = "J{\"u}rgen Wolff Gudenberg" } @string{GudmundssonJ = "Joachim Gudmundsson" } @string{GuentherO = "Oliver G{\"u}nther" } @string{GuidobaldiC = "Corrado Guidobaldi" } @string{GuillaumeJ = "Jean-Loup Guillaume" } @string{GuimeraR = "Roger Guimer{\`a}" } @string{GuM = "Ming Gu" } @string{GummadiPK = "P. Krishna Gummadi" } @string{GunkelT = "Thorsten Gunkel" } @string{GuptaA = "Anupam Gupta" } @string{GupteN = "Neelima Gupte" } @string{GuruswamiV = "Venkatesan Guruswami" } @string{GusfieldD = "Dan Gusfield" } @string{GutirrezE = "Eli{\'e}cer Guti{\'e}rrez" } @string{GutmanRJ = "Ronald J. Gutman" } @string{GuttmanA = "Antonin Guttman" } @string{GutwengerC = "Carsten Gutwenger" } @string{GuY = "Yu Gu" } @string{GyugyiL = "Laszlo Gyugyi" } @string{HaaseP = "Patti Haase" } @string{HabibM = "Michel Habib" } @string{HackbuschW = "Wolfgang Hackbusch" } @string{hacon = "{HaCon - Ingenieurgesellschaft mbH}" } @string{HaemersW = "Willem H.\ Haemers" } @string{HageP = "Per Hage" } @string{HagerupT = "Torben Hagerup" } @string{HaghaniA = "Ali Haghani" } @string{HahnG = "Ge{\v n}a Hahn" } @string{HaibtLM = "Lois M. Haibt" } @string{HajiaghayiM = "MohammadTaghi Hajiaghayi" } @string{HakimiSL = "Hakimi, S. Louis" } @string{HalinR = "Rudolf Halin" } @string{HalkidiM = "Maria Halkidi" } @string{HallA = "Alexander Hall" } @string{HalldorssonMM = "Magn{\'u}s M. Halld{\'o}rsson" } @string{HallKM = "Kenneth M. Hall" } @string{HallW = "Wendy Hall" } @string{HalperinE = "Eran Halperin" } @string{HalpernJ = "Joseph Halpern" } @string{HalseyE = "E. Halsey" } @string{HamacherHW = "Horst W.\ Hamacher" } @string{HamannM = "Michael Hamann" } @string{HamerJ = "John Hamer" } @string{HamF = "Frank van Ham" } @string{HammerPL = "Peter L. Hammer" } @string{HanCC = "Chih-Chieh Han" } @string{HandDJ = "D.\ J.\ Hand" } @string{HandleyM = "Mark Handley" } @string{HanebeckUD = "Uwe D. Hanebeck" } @string{HannemanR = "Robert Hanneman" } @string{HansenP = "Pierre Hansen" } @string{HanSK = "Seung Kee Han" } @string{HanusseN = "Nicolas Hanusse" } @string{HaoJ = "Jianxiu Hao" } @string{HaoMC = "Ming C.\ Hao" } @string{Har-PeledS = "Sariel Har-Peled" } @string{HaraborD = "Daniel Harabor" } @string{HaralambidesJ = "James Haralambides" } @string{HararyF = "Frank Harary" } @string{HardingGC = "G. C. Harding" } @string{HarelD = "David Harel" } @string{HargensLL = "L. L. Hargens" } @string{HariharanR = "Ramesh Hariharan" } @string{HarperR = "Richard Harper" } @string{HarrelsonC = "Chris Harrelson" } @string{HarrisM = "Mark Harris" } @string{HarrisonMA = "Michael A. Harrison" } @string{HartensteinH = "Hannes Hartenstein" } @string{HartiganJA = "John A.\ Hartigan" } @string{HartmannT = "Tanja Hartmann" } @string{HartPE = "Peter E. Hart" } @string{HartuvE = "Erez Hartuv" } @string{HartvigsenD = "David Hartvigsen" } @string{HartwigS = "Stephan Hartwig" } @string{HartyM = "Martha Harty" } @string{HasegawaT = "Toshiharu Hasegawa" } @string{HaselmayrJ = "Julian Haselmayr" } @string{HashimotoH = "Hideki Hashimoto" } @string{HashimotoT = "T. Hashimoto" } @string{HassinR = "Refael Hassin" } @string{HastadJ = "Johan H{\r a}stad" } @string{HatzisKP = "Kostas P. Hatzis" } @string{HaunertJ = "Jan-Henrik Haunert" } @string{HausbergerS = "Stefan Hausberger" } @string{HaveliwalaTH = "Haveliwala, Taher H." } @string{HavelV = "Vaclav Havel" } @string{HaverkortH = "Herman Haverkort" } @string{HavlinS = "Shlomo Havlin" } @string{HealeyCG = "Christopher G. Healey" } @string{HeaphyR = "Robert Heaphy" } @string{HechtPK = "P. K. Hecht" } @string{HeckbertPS = "Paul S. Heckbert" } @string{HeckermanD = "David Heckerman" } @string{HeH = "Hongmei He" } @string{HeHuan = "Huan He" } @string{HeidemannJ = "John Heidemann" } @string{HeilGH = "Greg H.\ Heil" } @string{HeilpornG = "Geraldine Heilporn" } @string{HeinM = "Matthias Hein" } @string{HeinzelmanWR = "Wendi Rabiner Heinzelman" } @string{HeiseDR = "D. R. Heise" } @string{HelbingD = "Dirk Helbing" } @string{HeldenG = "Guido Helden" } @string{HellP = "Pavol Hell" } @string{HeM = "Meng He" } @string{HendricksonB = "Bruce Hendrickson" } @string{HendryG = "George R. T. Hendry" } @string{HenningMA = "Michael A. Henning" } @string{HenzingerM = "Monika R.\ Henzinger" } @string{HerbstA = "Andre Herbst" } @string{HermanI = "Ivan Herman" } @string{HernandezG = "Hern{\'a}ndez, Gregorio" } @string{HershbergerJ = "John Hershberger" } @string{HertelA = "Alex Hertel" } @string{HertelS = "Stefan Hertel" } @string{HerzogO = "Otthein Herzog" } @string{HesselM = "Mirko {Hessel-von Molo}" } @string{HeuvelJ = "Jan van den Heuvel" } @string{HeviaH = "Hector Hevia" } @string{HeW = "Weiqing He" } @string{HeX = "He, Xiaofeng" } @string{HeXi = "Xin He" } @string{HGB = "Benjamin H. Good" } @string{HibbsM = "Matthew Hibbs" } @string{HieM = "M. Hie" } @string{HilgerM = "Moritz Hilger" } @string{HillerB = "Benjamin Hiller" } @string{HillFSJr = "F. S. {Hill Jr.}" } @string{HimsoltM = "Michael Himsolt" } @string{HingoraniNG = "Narain G. Hingorani" } @string{HinzeS = "Sybille Hinze" } @string{HircheS = "S. Hirche" } @string{HirschC = "Colin Hirsch" } @string{HjaltasonG = "G\'{\i}sli Hjaltason" } @string{HochbaumDS = "Dorit S. Hochbaum" } @string{HoeferM = "Martin H{\"o}fer" } @string{HoeffdingW = "Wassily Hoeffding" } @string{HoelldoberS = "Steffen H{\"o}lldober" } @string{HoffmanAJ = "Alan J. Hoffman" } @string{HoffmannM = "Michael Hoffmann" } @string{HoffmannR = "Roberto Hoffmann" } @string{HoffmannRalf = "Ralf Hoffmann" } @string{HohltB = "Barbara Hohlt" } @string{HolbertK = "Karen S. Holbert" } @string{HolderLB = "Lawrence B.\ Holder" } @string{HollandPW = "Paul W.\ Holland" } @string{HolldoblerS = "Steffen H{\"o}lldobler" } @string{HolmeP = "Petter Holme" } @string{HolmerinJ = "Jonas Holmerin" } @string{HolmJ = "Jacob Holm" } @string{HolmstromE = "Erik Holmstr{\"o}m" } @string{HoltenD = "Danny Holten" } @string{HoltgreweM = "Manuel Holtgrewe" } @string{HolzapfelK = "Klaus Holzapfel" } @string{HolzerM = "Martin Holzer" } @string{HolzerS = "Stephan Holzer" } @string{HongS = "Seok-Hee Hong" } @string{HoogeveenH = "Han Hoogeveen" } @string{HooryS = "Shlomo Hoory" } @string{HopcroftJE = "John E. Hopcroft" } @string{HopnerM = "Martin H{\"o}pner" } @string{HoraudR = "Radu Horaud" } @string{HornI = "Ilan Horn" } @string{HorsterP = "Patrick Horster" } @string{HorvitzE = "Eric Horvitz" } @string{HoTB = "Tu Bao Ho" } @string{HotellingH = "Harold Hotelling" } @string{HotzG = "G{\"u}nter Hotz" } @string{HougardyS = "Stefan Hougardy" } @string{HoyosJRC = "Jose R.C. Hoyos" } @string{HromkovicJ = "Juraj Hromkovic" } @string{HsuM = "Min-Yao Hsu" } @string{HsuT = "{Tsan-sheng} Hsu" } @string{HsuW = "Wen-Lian Hsu" } @string{HuaC = "Cunqing Hua" } @string{HuangC = "Chi-Fu Huang" } @string{HuangL = "Lin Huang" } @string{HuangP = "Polly Huang" } @string{HuangQL = "Q. L. Huang" } @string{HuangX = "Xiaohan Huang" } @string{HuangXi = "Xiaodi Huang" } @string{HuangYW = "Yun-Wu Huang" } @string{HuaQ = "Qiang-Sheng Hua" } @string{HubbellCH = "Charles H.\ Hubbell" } @string{HubermanBA = "Bernardo A. Huberman" } @string{HubnerF = "Florian H{\"u}bner" } @string{HuffakerB = "Bradley Huffaker" } @string{HuismanD = "Dennis Huisman" } @string{HuismanM = "Mark Huisman" } @string{HummonNP = "Norman P. Hummon" } @string{HungY = "Ya-Fei Hung" } @string{HurtadoF = "Ferran Hurtado" } @string{HuS = "Songnian Hu" } @string{HusbandsP = "Husbands, Parry" } @string{HustonG = "Geoff Huston" } @string{HuTC = "T.C. Hu" } @string{HutchinsonAR = "Allan R. Hutchinson" } @string{HutP = "Piet Hut" } @string{HutschenreutherH = "H.\ Hutschenreuther" } @string{HuX = "Xiaohua Hu" } @string{HuY = "Yifan Hu" } @string{HwangW = "Woo-chang Hwang" } @string{IaconoJ = "John Iacono" } @string{IbarakiT = "Toshihide Ibaraki" } @string{IbarraOH = "Oscar H. Ibarra" } @string{IchouaS = "Soumia Ichoua" } @string{IdekerT = "Trey Ideker" } @string{IdeM = "Mikio Ide" } @string{IguchiT = "Takashi Iguchi" } @string{IhlerE = "Edmund Ihler" } @string{IkedaM = "Michael Ikeda" } @string{IkedaT = "T. Ikeda" } @string{ILY = "Leon-Suematsu, Yutaka I." } @string{ImaiH = "H. Imai" } @string{InagakiY = "Y. Inagaki" } @string{IndykP = "Piotr Indyk" } @string{infras = "INFRAS AG" } @string{IntanagonwiwatC = "Chalermek Intanagonwiwat" } @string{IoffredaM = "Mario Ioffreda" } @string{IriM = "Masao Iri" } @string{IsettDD = "D. D. Isett" } @string{IshiiT = "Toshimasa Ishii" } @string{IshikawaK = "Kunihiro Ishikawa" } @string{ItaiA = "Alon Itai" } @string{ItalianoGF = "Giuseppe F.\ Italiano" } @string{ItoT = "Tooru Ito" } @string{ItzkovitzS = "Shalev Itzkovitz" } @string{IvanovYD = "Yuri D. Ivanov" } @string{IversonK = "Kenneth E. Iverson" } @string{IwamaK = "Kazuo Iwama" } @string{JacksonMO = "Matthew O. Jackson" } @string{JacobR = "Riko Jacob" } @string{JahodaM = "Marie Jahoda" } @string{JainA = "A. Jain" } @string{JainAK = "Anil K. Jain" } @string{JaJaJ = "Joseph JaJa" } @string{JakelJ = "Jens J{\"a}kel" } @string{JaminS = "Sugih Jamin" } @string{JansenD = "Dorothea Jansen" } @string{JansenK = "Klaus Jansen" } @string{JanssenJ = "Jeannette Janssen" } @string{JanssenP = "Paul Janssen" } @string{JaromczykJW = "Jerzy W.\ Jaromczyk" } @string{JaySJ = "Stephen J. Jay" } @string{JehG = "Jeh, Glen" } @string{JelinekV = "V{\'\i}t Jel{\'\i}nek" } @string{JeongH = "Hawoong Jeong" } @string{JerrumM = "Mark Jerrum" } @string{JessJA = "Jochen A. Jess" } @string{JiangAA = "Anxiao (Andrew) Jiang" } @string{JiangB = "Bin Jiang" } @string{JiangT = "Tao Jiang" } @string{JiangX = "Xiao Jiang" } @string{JianT = "Tang Jian" } @string{JinC = "Cheng Jin" } @string{JingN = "Ning Jing" } @string{JinR = "Ruoming Jin" } @string{JinX = "Xiaoyi Jin" } @string{JohnesMC = "M.\ C.\ Jones" } @string{JohnsGL = "Gary L. Johns" } @string{JohnsonDB = "Donald B. Johnson" } @string{JohnsonDS = "David S. Johnson" } @string{JohnsonMA = "Marc A. Johnson" } @string{JokschHC = "H.C. Joksch" } @string{JolliffeIT = "Ian T. Jolliffe" } @string{JonesA = "Alan Jones" } @string{JonesMC = "M.~C.~Jonas" } @string{JordanC = "Camille Jordan" } @string{JordanMI = "Jordan, Micheal I." } @string{JuedesD = "David Juedes" } @string{JuengerM = "Michael J{\"u}nger" } @string{JuhaszF = "Ferenc Juh{\'a}sz" } @string{JungC = "Christian Jung" } @string{JungJ = "Jaeyeon Jung" } @string{JungnickelD = "Dieter Jungnickel" } @string{JungS = "Soojung Jung" } @string{JungSU = "Sungwon Jung" } @string{JurdzinskiT = "Tomasz Jurdzinski" } @string{KaashoekF = "Frans Kaashoek" } @string{KaasR = "R. Kaas" } @string{KabellJA = "Jerald A.~Kabell" } @string{KacprzykJ = "Janusz Kacprzyk" } @string{KaeaebV = "Vanessa K{\"a}{\"a}b" } @string{KahlM = "Matthias Kahl" } @string{KahngAB = "Andrew B. Kahng" } @string{KahngB = "Byungnam Kahng" } @string{KaibelV = "Volker Kaibel" } @string{KaindlH = "Hermann Kaindl" } @string{KainzG = "Gerhard Kainz" } @string{KalishY = "Yuval Kalish" } @string{KalpakisK = "Konstantinos Kalpakis" } @string{KamadaT = "Tomihisa Kamada" } @string{KamathC = "Chandrika Kamath" } @string{KamedaT = "Tiko Kameda" } @string{KammerF = "Frank Kammer" } @string{KampenG = "G. R. Kampen" } @string{KamperJH = "Jan-Hinrich K{\"a}mper" } @string{KamvarSD = "Kamvar, Sepandar D." } @string{KandybaM = "Maria Kandyba" } @string{KanevskyA = "Arkady Kanevsky" } @string{KangM = "Mihyun Kang" } @string{KaninkeG = "G. Kaninke" } @string{KanjIA = "Iyad A. Kanj" } @string{KannanR = "Ravi Kannan" } @string{KannanS = "Sampath Kannan" } @string{KannoJ = "Jinko Kanno" } @string{KannV = "Viggo Kann" } @string{KantG = "Goos Kant" } @string{KantR = "Ravi Kant" } @string{KaoM = "Ming-Yang Kao" } @string{KaoMJ = "Mong-Jen Kao" } @string{KaothanthongN = "Natsuda Kaothanthong" } @string{KaplanH = "Haim Kaplan" } @string{KapoorSF = "S. F. Kapoor" } @string{KappesA = "Andrea Kappes" } @string{KarakostasG = "George Karakostas" } @string{KarchD = "Daniel Karch" } @string{KargerDR = "David R. Karger" } @string{KarguptaH = "Hillol Kargupta" } @string{KarimiM = "Masoumeh Karimi" } @string{KarivO = "Oded Kariv" } @string{KarlinA = "Anna R. Karlin" } @string{KarloffH = "Howard Karloff" } @string{KarmarkarN = "Narendra Karmarkar" } @string{KarpinskiM = "Marek Karpinski" } @string{KarpRM = "Richard M. Karp" } @string{KarrerA = "Annette Karrer" } @string{KarS = "S. Kar" } @string{KarypisG = "George Karypis" } @string{KarzanovAV = "Alexander V. Karzanov" } @string{KasaiR = "Ryosei Kasai" } @string{KashIA = "Ian A. Kash" } @string{KashiwabaraT = "Toshinobu Kashiwabara" } @string{KashtanN = "Nadav Kashtan" } @string{KaskiP = "Petteri Kaski" } @string{KatonaG = "Gyula Katona" } @string{KatzB = "Bastian Katz" } @string{KatzL = "Leo Katz" } @string{KatzRH = "Randy H. Katz" } @string{KaufmanDE = "David E. Kaufman" } @string{KaufmannM = "Michael Kaufmann" } @string{KavanaghJ = "John Kavanagh" } @string{KavithaT = "Telikepalli Kavitha" } @string{KawaiS = "Satoru Kawai" } @string{KawarabayashiK = "Ken-ichi Kawarabayashi" } @string{KawasakiS = "Saori Kawasaki" } @string{KeberW = "W. Keber" } @string{KeimDA = "Daniel A.\ Keim" } @string{KellererH = "Hans Kellerer" } @string{KelleyC = "Colin Kelley" } @string{KellyD = "David Kelly" } @string{KelmansAK = "A. K. Kelmans" } @string{KelnerJA = "Jonathan A. Kelner" } @string{KempeD = "David Kempe" } @string{KenisP = "Patrick Kenis" } @string{KenleyEC = "Edward Casey Kenley " } @string{KennedyK = "Ken Kennedy" } @string{KeoghE = "Eamonn Keogh" } @string{KerboschJAGM = "Joep A. G. M. Kerbosch" } @string{KernerBS = "Boris S. Kerner" } @string{KernighanBW = "Brian W. Kernighan" } @string{KerrenA = "Andreas Kerren" } @string{KerstingH = "Hanno Kersting" } @string{KertezJ = "J{\'a}nos Kert{\'e}z" } @string{KeszeghB = "Bal{\'a}zs Keszegh" } @string{KeyanL = "Liu Keyan" } @string{KhabbazianM = "Majid Khabbazian" } @string{KhachiyanLG = "Leonid G. Khachiyan" } @string{KhanO = "Omar Khan" } @string{KhareV = "Varun Khare" } @string{KhosraviA = "Amirali Khosravi" } @string{KhotS = "Subhash Khot" } @string{KhullerS = "Samir Khuller" } @string{KickEL = "Edward L. Kick" } @string{KieritzT = "Tim Kieritz" } @string{KikuoY = "Yuta, Kikuo" } @string{KimBJ = "Kim, Beom Jun" } @string{KimCE = "Chul E.\ Kim" } @string{KimD = "Doochul Kim" } @string{KimKH = "K. H.\ Kim" } @string{KindermannP = "Philipp Kindermann" } @string{KingV = "Valerie King" } @string{KintaliS = "Shiva Kintali" } @string{KirchhoffG = "Gustav Kirchhoff" } @string{KirchlerD = "Dominik Kirchler" } @string{KirkpatrickS = "Scott Kirkpatrick" } @string{KishiG = "G.~Kishi" } @string{KitsuregawaM = "Masaru Kitsuregawa" } @string{KlafszkyE = "Emil Klafszky" } @string{KlasingR = "R. Klasing" } @string{KlauGW = "Gunnar W. Klau" } @string{KlavikP = "Pavel Klav{\'i}k" } @string{KleeneSC = "Stephen Cole Kleene" } @string{KleeV = "Victor Klee" } @string{KleinbergJM = "Jon M. Kleinberg" } @string{KleinD = "Klein, Dan" } @string{KleinK = "Karsten Klein" } @string{KleinPN = "Philip N. Klein" } @string{KleinR = "Rolf Klein" } @string{KleinS = "Sulamita Klein" } @string{KleitmanDJ = "Daniel J. Kleitman" } @string{KlemmK = "Konstantin Klemm" } @string{KliemannL = "Lasse Kliemann" } @string{KliewerN = "Natalia Kliewer" } @string{KloksT = "Ton Kloks" } @string{KlugeR = "Roland Kluge" } @string{KlukasC = "Christian Klukas" } @string{KlunderGA = "G. A. Klunder" } @string{KnokeD = "David Knoke" } @string{KnoppS = "Sebastian Knopp" } @string{KnothM = "Martin Knoth" } @string{KnowlesJD = "Joshua D. Knowles" } @string{KnuthD = "Donald E. Knuth" } @string{KobitzschM = "Moritz Kobitzsch" } @string{KobourovSG = "Stephen G. Kobourov" } @string{KodamaY = "Yukihiro Kodama" } @string{KoebeP = "Paul Koebe" } @string{KoeblerJ = "Johannes K{\"{o}}bler" } @string{KoehlerE = "Ekkehard K{\"o}hler" } @string{KoenemannJ = "Jochen K{\"o}nemann" } @string{KoenigD = "D\'enes K{\H o}nig" } @string{KoepfB = "Boris K{\"o}pf" } @string{KoevariT = "Tam{\'a}s K{\H{o}}v{\'a}ri" } @string{KoganJ = "Jacob Kogan" } @string{KohKM = "Khee Meng Koh" } @string{KohliP = "Pushmeet Kohli" } @string{KollerD = "Daphne Koller" } @string{KolmanP = "Petr Kolman" } @string{KomlosJ = "J{\'a}nos Koml{\'o}s" } @string{KommelH = "Helene J. Kommel" } @string{KonjevodG = "Goran Konjevod" } @string{KoopmansTC = "Tjalling C. Koopmans" } @string{KorenI = "Israel Koren" } @string{KorenY = "Yehuda Koren" } @string{KorenZ = "Zahava Koren" } @string{KormanM = "Matias Korman" } @string{KorteB = "Bernhard Korte" } @string{KortewegP = "Peter Korteweg" } @string{KortsarzG = "Guy Kortsarz" } @string{KoschutzkiD = "Dirk Kosch{\"u}tzki" } @string{KosterAM = "Arie M.C.A. Koster" } @string{KosubS = "Sven Kosub" } @string{KoutsoupiasE = "Elias Koutsoupias" } @string{KowalskiDR = "Dariusz R. Kowalski" } @string{KrackhardtD = "David Krackhardt" } @string{KrapivskyPL = "Paul L.\ Krapivsky" } @string{KratochvilJ = "Jan Kratochv{\'\i}l" } @string{KratschD = "Dieter Kratsch" } @string{KrauseAE = "Ann E. Krause" } @string{KrauthgamerR = "Robert Krauthgamer" } @string{KravetzA = "Alan Kravetz" } @string{KrebsVE = "Valdis E. Krebs" } @string{KrempelL = "Lothar Krempel" } @string{KreuterB = "Bernd Kreuter" } @string{KreveldMv = "Marc van Kreveld" } @string{KringsM = "Manuel Krings" } @string{KrishnaCM = "Krishna, C. Mani" } @string{KrishnamachariB = "Bhaskar Krishnamachari" } @string{KrishnamoorthyV = "V. Krishnamoorthy" } @string{KrishnanN = "Neeraj Krishnan" } @string{KrivelevichM = "Michael Krivelevich" } @string{KrollM = "Moritz Kroll" } @string{KroonLG = "Leo G. Kroon" } @string{KruegerJ = "Jens Kr{\"u}ger" } @string{KrugM = "Marcus Krug" } @string{KrummJ = "John Krumm" } @string{KruskalJB = "Joseph B.\ Kruskal" } @string{KubickiG = "Grzegorz Kubicki" } @string{KuceraL = "Lud{\v e}k Ku{\v c}era" } @string{KuchemR = "Ruth Kuchem" } @string{KuenstlerR = "Rita K{\"u}nstler" } @string{KuhnF = "Fabian Kuhn" } @string{KuhnHW = "Harold W. Kuhn" } @string{KuhnW = "Werner Kuhn" } @string{KulisB = "Brian Kulis" } @string{KulliVR = "V.~R.~Kulli" } @string{KumadaY = "Yoichiro Kumada" } @string{KumarG = "Gautam Kumar" } @string{KumarMP = "Kumar, M. Pramodh" } @string{KumarPR = "P. R. Kumar" } @string{KumarR = "Ravi Kumar" } @string{KumarV = "Vipin Kumar" } @string{KumarVSA = "Kumar, V. S. Anil" } @string{KundurP = "P. Kundur" } @string{KungHT = "H. T. Kung" } @string{KupkeJ = "Joachim Kupke" } @string{KuratowskiC = "Casimir Kuratowski" } @string{KwaJB = "James B. Kwa" } @string{KwatraV = "Vivek Kwatra" } @string{LabbeM = "Martine Labbe" } @string{LabK = "George Karypis" } @string{LabovitzC = "Craig Labovitz" } @string{LabrinidisA = "Alexandros Labrinidis" } @string{LafouOF = "Oscar Fofie Lafou" } @string{LagunaM = "Manuel Laguna" } @string{LaiW = "Wei Lai" } @string{LakamrajuV = "Vijay Lakamraju" } @string{LakhinaA = "Anukool Lakhina" } @string{LallS = "Sanjay Lall" } @string{LambiotteR = "Renaud Lambiotte" } @string{LammerS = "Stefan L{\"a}mmer" } @string{LancichinettiA = "Andrea Lancichinetti" } @string{LandgrafB = "Britta Landgraf" } @string{LangetepeE = "Elmar Langetepe" } @string{LangKJ = "Kevin J. Lang" } @string{LangS = "Steffen Lang" } @string{LangSe = "Serge Lang" } @string{LangstonMA = "Michael A. Langston" } @string{LangvilleAN = "Amy N. Langville" } @string{LaPoutreJA = "La Poutr{\'e}, Johannes A." } @string{LarsenKG = "Kim Guldstrand Larsen" } @string{LaschingerM = "Moritz Laschinger" } @string{LaskeyKB = "Kathryn B.\ Laskey" } @string{LatapyM = "Matthieu Latapy" } @string{LauchliP = "Peter L{\"a}uchli" } @string{LauFC = "Francis C. M. Lau" } @string{LauraL = "Luigi Laura" } @string{LautherU = "Ulrich Lauther" } @string{LavilleF = "Fran{\c{c}}oise Laville" } @string{LawlerEL = "Eugene L. Lawler" } @string{LawrenceS = "Steve Lawrence" } @string{LeahyR = "Richard Leahy" } @string{LeeCPC = "Lee, Chris Pan-Chi" } @string{LeeD = "D.T. Lee" } @string{LeeJ = "Jian Lee" } @string{LeeL = "Lie-Quan Lee" } @string{LeeRCT = "Richard C. T. Lee" } @string{LeeS = "Sang-Ho Lee" } @string{LeeuwenJv = "van Leeuwen, Jan" } @string{LeeuwJW = "Jan W. de Leeuw" } @string{LefebvreE = "Etienne Lefebvre" } @string{LefohnA = "Aaron Lefohn" } @string{LeH = "Hoang-Oanh Le" } @string{LehmannEL = "Erich L. Lehmann" } @string{LehmannK = "Katharina A. Lehmann" } @string{LehmannKA = "Katharina A. Lehmann" } @string{LeibfriedT = "Thomas Leibfried" } @string{LeichtEA = "E. A. Leicht" } @string{LeifmanLYa = "L. Ya. Leifman" } @string{LeightonFT = "Frank Thomson Leighton" } @string{LeinhardtS = "Samuel Leinhardt" } @string{LeipertS = "Sebastian Leipert" } @string{LeiserN = "Naty Leiser" } @string{LeisersonCE = "Charles E. Leiserson" } @string{LelandR = "Robert Leland" } @string{LempelA = "Abraham Lempel" } @string{LempelR = "Ronny Lempel" } @string{LengauerT = "Thomas Lengauer" } @string{LenstraHW = "Hendrik Willem Lenstra" } @string{LenstraJK = "Jan Karel Lenstra" } @string{LeonardiS = "Stefano Leonardi" } @string{LeonardJ = "John Leonard" } @string{LernerJ = "J{\"u}rgen Lerner" } @string{LeskovecJ = "Jure Leskovec" } @string{LesniakL = "Linda Lesniak" } @string{LeuckerM = "Martin Leucker" } @string{LeungV = "Vitus Leung" } @string{LeveneM = "Mark Levene" } @string{LevequeB = "Benjamin L\'ev\^eque" } @string{LevineMS = "Matthew S. Levine" } @string{LevinsonR = "Robert Levinson" } @string{LewinerT = "Thomas Lewiner" } @string{LewiP = "Paul Lewi" } @string{LeydesdorffL = "Loet Leydesdorff" } @string{LeyvrazF = "Francois Leyvraz" } @string{LiA = "Angsheng Li" } @string{LiangJ = "Jiye Liang" } @string{LiangW = "Weifa Liang" } @string{LiaoC = "Chien-Chih Liao" } @string{LibertiL = "Leo Liberti" } @string{LiC = "Chung-Sheng Li" } @string{LichtenbergK = "de Lichtenberg, Kristian" } @string{LickDR = "Don R. Lick" } @string{LiebchenC = "Christian Liebchen" } @string{LiebersA = "Annegret Liebers" } @string{LiereR = "Robert van Liere" } @string{LiG = "Guojie Li" } @string{LiggesmeyerP = "Peter Liggesmeyer" } @string{LightnerMR = "Michael R. Lightner" } @string{LiJ = "Jiandong Li" } @string{LiJin = "Jinyang Li" } @string{LilloF = "Felipe Lillo" } @string{LiM = "Menghui Li" } @string{LinC = "Ching-Chi Lin" } @string{LinCh = "Chuan Lin" } @string{LinChewK = "Kim Lin Chew" } @string{LingasA = "Andrzej Lingas" } @string{LingL = "Lunjiang Ling" } @string{LinialN = "Nathan Linial" } @string{LinS = "S. Lin" } @string{LinX = "Xuemin Lin" } @string{LiottaG = "Giuseppe Liotta" } @string{LipmanMJ = "Marc J. Lipman" } @string{LiptonRJ = "Richard J. Lipton" } @string{LiS = "Shuzhuo Li" } @string{LisowskiD = "David Lisowski" } @string{LiSYR = "Shuo-Yen Robert Li" } @string{LitvakN = "Litvak, Nelly" } @string{LiuC = "Chih-Hung Liu" } @string{LiuH = "Hengchang Liu" } @string{LiuJ = "Junqi Liu" } @string{LiuY = "Yong Liu" } @string{LiuYh = "Yonghe Liu" } @string{LiuYQ = "Y. Q. Liu" } @string{LiX = "Xiang-Yang Li" } @string{LiXY = "Xiang-Yang Li" } @string{LiY = "Yingshu Li" } @string{LladoA = "Anna S. Llad{\'o}" } @string{LloydS = "Stuart Lloyd" } @string{LoanCF = "Van Loan, Charles F." } @string{LochbihlerA = "Andreas Lochbihler" } @string{LodiE = "Elena Lodi" } @string{LoehA = "Andres L{\"o}h" } @string{LoehrK = "Klaus-Peter L{\"o}hr" } @string{LofflerM = "Maarten L{\"o}ffler" } @string{LoizouG = "George Loizou" } @string{LomonosovMV = "M. V. Lomonosov" } @string{LonardiS = "Stefano Lonardi" } @string{LongJ = "Jun Long" } @string{LoomisCP = "C. P. Loomis" } @string{Lopez-OrtizA = "Alejandro L{\'o}pez-Ortiz" } @string{LopezMGR = "Maria G.R. Lopez" } @string{LorenzU = "Ulf Lorenz" } @string{LorrainF = "Fran{\c{c}}ois Lorrain" } @string{LotkerZ = "Zvi Lotker" } @string{LouchardG = "Guy Louchard" } @string{LouiRP = "Ronald Prescott Loui" } @string{LoukakisE = "Emmanuel Loukakis" } @string{LourenccoA = "Andr{\'e} Louren{\c{c}}o" } @string{LovaszL = "L{\'a}szl{\'o} Lov{\'a}sz" } @string{LuanGF = "G. F. Luan" } @string{LubbeckeME = "Marco E. L{\"u}bbecke" } @string{LubbersMJ = "Miranda J.\ Lubbers" } @string{LubiwA = "Anna Lubiw" } @string{LuccioF = "Fabrizio Luccio" } @string{LuceRD = "R. Duncan Luce" } @string{LudwigA = "Andreas Ludwig" } @string{LuebkeD = "David Luebke" } @string{LuekerGS = "George S. Lueker" } @string{LuF = "Feng Lu" } @string{LuG = "Gang Lu" } @string{LuH = "Hsueh-I Lu" } @string{LukoseRM = "Rajan M. Lukose" } @string{LuksEM = "Eugene M. Luks" } @string{LuL = "Linyuan Lu" } @string{LumsdaineA = "Andrew Lumsdaine" } @string{LundC = "Carsten Lund" } @string{LunnAD = "A.\ D.\ Lunn" } @string{LuoH = "Hong Luo" } @string{LuoJ = "Jun Luo" } @string{LuoX = "Xuemei Luo" } @string{LusherD = "Dean Lusher" } @string{LusseauD = "David Lusseau" } @string{LuxburgUv = "Ulrike von Luxburg" } @string{LuxenD = "Dennis Luxen" } @string{LuzR = "Raphael Luz" } @string{LynchN = "Nancy Lynch" } @string{MaassMG = "Moritz G. Maa{\ss}" } @string{MaassW = "Wolfgang Maass" } @string{MacciC = "Claudio Macci" } @string{MachucaE = "Enrique Machuca" } @string{MacLaneS = "Mac Lane, Saunders" } @string{MacQueenJ = "J.\ MacQueen" } @string{MadanR = "Ritesh Madan" } @string{MaddenB = "Brendan Madden" } @string{MaddenP = "Patrick Madden" } @string{MaddenS = "Samuel Madden" } @string{MadduriK = "Kamesh Madduri" } @string{MaderM = "Martin Mader" } @string{MaderW = "Wolfgang Mader" } @string{MadryA = "Aleksander Madry" } @string{MaffioliF = "Francesco Maffioli" } @string{MaghoulF = "Farzin Maghoul" } @string{MagnantiTL = "Thomas L. Magnanti" } @string{MagoniD = "Damien Magoni" } @string{MagoulesF = "Fr{\'e}d{\'e}ric Magoul{\`e}s" } @string{MaheshwariA = "Anil Maheshwari" } @string{MaheshwariSN = "S. N. Maheshwari" } @string{MaierD = "David Maier" } @string{MaierM = "Markus Maier" } @string{MaillardP = "Pascal Maillard" } @string{MakinenE = "E. M{\"a}kinen" } @string{MakkiK = "Kia Makki" } @string{MakkiS = "Shamila Makki" } @string{MakkiSK = "S. Kami Makki" } @string{MaL = "Li Ma" } @string{MalandrakiC = "Chryssi Malandraki" } @string{MalewiczG = "Grzegorz Malewicz" } @string{MalgeriM = "M. Malgeri" } @string{MalhotraVM = "Vishv M. Malhotra" } @string{MaliG = "Georgia Mali" } @string{MalikJ = "Jitendra Malik" } @string{MalitzS = "Seth Malitz" } @string{MalkevitchJ = "Joseph Malkevitch" } @string{MammanaF = "Flavia Mammana" } @string{MamoulisN = "Nikos Mamoulis" } @string{MandowL = "Lawrence Mandow" } @string{MangioniG = "G. Mangioni" } @string{ManicG = "G. Manic" } @string{ManiP = "Peter Mani" } @string{ManneF = "Fredrik Manne" } @string{MannilaH = "Heikki Mannila" } @string{ManningCD = "Manning, Christopher D." } @string{ManninoC = "Carlo Mannino" } @string{ManolopoulosY = "Yannis Manolopoulos" } @string{MansourY = "Yishay Mansour" } @string{ManteuffelTA = "Thomas A. Manteuffel" } @string{MaratheMV = "Madhav V. Marathe" } @string{MarchettiFE = "Franco E. Marchetti" } @string{MarchettiSpaccamelaA = "Alberto Marchetti-Spaccamela" } @string{MarcotteP = "Patrice Marcotte" } @string{MarianiF = "Federico Mariani" } @string{MarinI = "Ignacio Mar{\'\i}n" } @string{MarinoniS = "Stefano Marinoni" } @string{MarionJ = "Jean-Yves Marion" } @string{MarkielA = "Andrew Markiel" } @string{MarksJ = "Joe Marks" } @string{MarquezA = "M{\'a}rquez, Alberto" } @string{MarriottK = "Kim Marriott" } @string{MarshallAG = "Alan G. Marshall" } @string{MarshallMS = "M. Scott Marshall" } @string{MarsS = "Sergio Mars" } @string{MartelC = "Charles Martel" } @string{MartelloS = "Silvano Martello" } @string{MartinGN = "G. Nigel Martin" } @string{MartinsEQ = "Ernesto Queiros Martins" } @string{MartiR = "Rafael Mart{\'i}" } @string{MarxM = "Maarten Marx" } @string{MasikosM = "M. Masikos" } @string{MasonDM = "Doran M. Mason" } @string{MasonSP = "Sean P. Mason" } @string{MasseBR = "B.R.\ M{\^{a}}sse" } @string{MasuchM = "Michael Masuch" } @string{MasudaS = "Sumio Masuda" } @string{MasuyamaS = "Shigeru Masuyama" } @string{MathonR = "Rudi Mathon" } @string{MatijevicD = "Domagoj Matijevic" } @string{MatousekJ = "Ji{\v r}{\' i} Matou{\v s}ek" } @string{MattaI = "Ibrahim Matta" } @string{MatternF = "Friedemann Mattern" } @string{MattfeldDC = "Dirk Christian Mattfeld" } @string{MattheysesRM = "R. M. Mattheyses" } @string{MatulaDW = "David W. Matula" } @string{MatuszewskiC = "Christian Matuszewski" } @string{MaueJ = "Jens Maue" } @string{MaW = "Wei Ma" } @string{MayrEW = "Ernst W. Mayr" } @string{McCainKW = "Katherine W.\ McCain" } @string{McCarthyJ = "John McCarthy" } @string{McCartyC = "Chris McCarty" } @string{McConnellR = "Ross McConnell" } @string{McConwayKJ = "K.~J.~McConway" } @string{McCurleyKS = "Kevin S.\ McCurley" } @string{McDiarmidCJH = "Colin J. H. McDiarmid" } @string{McGeochCC = "Catherine C. McGeoch" } @string{McGillR = "Robert McGill" } @string{McGinnisLF = "Leon F.\ McGinnis" } @string{McGrathC = "Cathleen McGrath" } @string{McGregorJJ = "James J. McGregor" } @string{MchedlidzeT = "Tamara Mchedlidze" } @string{McKayBD = "Brendan D.\ McKay" } @string{McKeeTA = "Terry A. McKee" } @string{McKeownGP = "Geoff P. McKeown" } @string{McMorrisFR = "F. R. McMorris" } @string{McSherryF = "Frank McSherry" } @string{MeckeS = "Steffen Mecke" } @string{MedagliaAL = "Andr{\'e}s L. Medaglia" } @string{MedinaA = "Alberto Medina" } @string{MeekC = "Christopher Meek" } @string{MehldauH = "Heiko Mehldau" } @string{MehlerA = "Alexander Mehler" } @string{MehlhornK = "Kurt Mehlhorn" } @string{MeilaM = "Marina Meil{\u{a}}" } @string{MeinelC = "Christoph Meinel" } @string{MeinertS = "Sascha Meinert" } @string{MelanconG = "Guy Melan\c{c}on" } @string{MellouliT = "Taieb Mellouli" } @string{MeltzerB = "Bernard Meltzer" } @string{MendelzonAO = "Alberto O. Mendelzon" } @string{MendesJFF = "Jose Ferreira F. Mendes" } @string{MendezPO = "Ossona de Mendez, Patrice" } @string{MengerK = "Karl Menger" } @string{MerrickD = "Damian Merrick" } @string{MerrisR = "Russell Merris" } @string{MesaJA = "Juan A. Mesa" } @string{MetznerP = "Philipp Metzner" } @string{Meyer-BaseA = "Anke Meyer-B{\"a}se" } @string{MeyerADHF = "Friedhelm {Meyer auf der Heide}" } @string{MeyerCD = "Carl D. Meyer" } @string{MeyerD = "David Meyer" } @string{MeyerhenkeH = "Henning Meyerhenke" } @string{MeyerJ = "Joerg Meyer" } @string{MeyersRA = "Robert A. Meyers" } @string{MeyerU = "Ulrich Meyer" } @string{MeyerW = "W. Fr. Meyer" } @string{MichailP = "Panagiotis Michail" } @string{MichieD = "Donald Michie" } @string{MiddendorfM = "Manuel Middendorf" } @string{MielkeA = "Alexander Mielke" } @string{MihailM = "Milena Mihail" } @string{MihalakM = "Mat{\'u}{\v s} Mihal'{\'a}k" } @string{MilgramS = "Stanley Milgram" } @string{MiliosEE = "Evangelos E. Milios" } @string{MillerE = "Ezra Miller" } @string{MillerGL = "Gary L. Miller" } @string{MillerRE = "Raymond E. Miller" } @string{MillozziS = "Stefano Millozzi" } @string{MilmanVD = "Vitali D. Milman" } @string{MiloR = "Ron Milo" } @string{MirchandaniPB = "Pitu B.\ Mirchandani" } @string{MishraN = "Nina Mishra" } @string{MisueK = "K. Misue" } @string{MitchellJC = "J. Clyde Mitchell" } @string{MitchellSL = "Sandra L. Mitchell" } @string{MitchellW = "William Mitchell" } @string{MitohK = "K. Mitoh" } @string{MitraP = "Pabitra Mitra" } @string{MitraPra = "Pradipta Mitra" } @string{MitzenmacherM = "Michael Mitzenmacher" } @string{MiuraK = "Kazuyuki Miura" } @string{MiyamotoI = "Isao Miyamoto" } @string{ModestiP = "Paola Modesti" } @string{MoehringR = "Rolf H. M{\"o}hring" } @string{MoellerB = "Burkhard M{\"{o}}ller" } @string{MoharB = "Bojan Mohar" } @string{MohrmannH = "H. Mohrmann" } @string{MohrT = "Th. Mohr" } @string{MokbelMF = "Mohamed F. Mokbel" } @string{MokkenRJ = "Robert J. Mokken" } @string{MolinaJL = "Jos{\'e} Luis Molina" } @string{MolitorP = "Paul Molitor" } @string{MolluzzoJC = "John C. Molluzzo" } @string{MonienB = "Burkhard Monien" } @string{MonmaCL = "Clyde L. Monma" } @string{MontanariUG = "Ugo G. Montanari" } @string{MontecchianiF = "Fabrizio Montecchiani" } @string{MontemanniR = "Roberto Montemanni" } @string{MontgolfierFd = "Fabien de Montgolfier" } @string{MontiA = "Angelo Monti" } @string{MontjoyeYd = "Yves-Alexandre de Montjoye" } @string{MoonJW = "John W. Moon" } @string{MoorBD = "Bart De Moor" } @string{MooreC = "Cristopher Moore" } @string{MooreD = "David Moore" } @string{MooreRJ = "Robert J. Moore" } @string{MoralesN = "N. Morales" } @string{MoranS = "Shlomo Moran" } @string{MorenoA = "Moreno, Auxiliadora" } @string{MorentD = "Dominik Morent" } @string{MoretB = "Bernard Moret" } @string{MoreyLC = "Leslie C. Morey" } @string{MoricF = "Filip Moric" } @string{MoritzH = "Helmut Moritz" } @string{MorrisR = "Robert Morris" } @string{MorseAS = "A. Stephen Morse" } @string{MosbahM = "Mohamed Mosbah" } @string{MoscibrodaT = "Thomas Moscibroda" } @string{MoserL = "L. Moser" } @string{MoshkovitzD = "Dana Moshkovitz" } @string{MotwaniR = "Rajeev Motwani" } @string{MouncifH = "Hicham Mouncif" } @string{MoxleyN = "Nancy F. Moxley" } @string{MoxleyR = "Robert L. Moxley" } @string{MozesS = "Shay Mozes" } @string{MrvarA = "Andrej Mrvar" } @string{mta = "{Metropolitan Transportation Authority of the State of New York}" } @string{MuellerH = "Haiko M{\"{u}}ller" } @string{MuellerHannemannM = "Matthias {M{\"u}ller--Hannemann}" } @string{MuellerK = "Kirill M{\"u}ller" } @string{MuellerR = "Rudolf M{\"u}ller" } @string{MuffS = "Stefanie Muff" } @string{MukhtarS = "Selma Mukhtar" } @string{MullerGlaserKD = "K.D. M{\"u}ller-Glaser" } @string{MullerLF = "Laurent Flindt Muller" } @string{MullerME = "Mervin E. Muller" } @string{MullinsNC = "N. C. Mullins" } @string{MulmuleyK = "Ketan Mulmuley" } @string{MumfordE = "Elena Mumford" } @string{MunozMA = "M. A. Mu{\~{n}}oz" } @string{MunroI = "Ian Munro" } @string{MunroJI = "J. Ian Munro" } @string{MunznerT = "Tamara Munzner" } @string{MurtaghF = "F. Murtagh" } @string{MurtyMN = "M. N. Murty" } @string{MurtyUS = "U. S. Murty" } @string{MutzelP = "Petra Mutzel" } @string{MyersC = "Chad Myers" } @string{NaamadA = "Amnon Naamad" } @string{NachtigallK = "Karl Nachtigall" } @string{NadelSF = "Siegfried F.\ Nadel" } @string{NaeherS = "Stefan N{\"a}her" } @string{NagaiS = "Sayaka Nagai" } @string{NagamochiH = "Hiroshi Nagamochi" } @string{NagarajanV = "Viswanath Nagarajan" } @string{NagelK = "Kai Nagel" } @string{NagelS = "Stefanie Nagel" } @string{NaglM = "Manfred Nagl" } @string{NaimM = "Mary Naim" } @string{NajjarW = "Walid Najjar" } @string{NakajimaK = "Kazuo Nakajima" } @string{NakamuraA = "Akira Nakamura" } @string{NakanoS = "Shin-Ichi Nakano" } @string{NakaoA = "Akihiro Nakao" } @string{NakashimaH = "Hideyuki Nakashima" } @string{NamjoshiP = "Parag Namjoshi" } @string{NamSH = "S. H. Nam" } @string{NanniciniG = "Giacomo Nannicini" } @string{NanniU = "Umberto Nanni" } @string{NaorD = "Dalit Naor" } @string{NaorJ = "Joseph Naor" } @string{NardelliE = "Enrico Nardelli" } @string{NarinF = "Narin, Francis" } @string{NarvaezP = "Paolo Narv{\'a}ez" } @string{NashWilliamsC = "Crispin St. Nash-Williams" } @string{NausJ = "Joseph Naus" } @string{NefW = "Walter Nef" } @string{NegenbornR = "R.R. Negenborn" } @string{NelsonPC = "Peter C. Nelson" } @string{NemethE = "Evi Nemeth" } @string{NemhauserGL = "Georg L. Nemhauser" } @string{NepuszT = "Tam{'a}s Nepusz" } @string{NesetrilJ = "Jaroslav Ne{\v s}et{\v r}il" } @string{NeubauerS = "Sabine Neubauer" } @string{NeumannG = "Gustaf Neumann" } @string{NewmanMEJ = "Mark E. J. Newman" } @string{NewportC = "Calvin Newport" } @string{NeyerG = "Gabriele Neyer" } @string{NgAY = "Ng, Andrew Y." } @string{NgKW = "K. W. Ng" } @string{NgoJT = "J. Thomas Ngo" } @string{NguyenNB = "Ngoc Binh Nguyen" } @string{NguyenS = "Sang Nguyen" } @string{NicholasC = "Charles Nicholas" } @string{NicholsonV = " Victor Nicholson" } @string{NickellE = "Eric Nickell" } @string{NicolaiT = "Tom Nicolai" } @string{NicosiaV = "Vincenzo Nicosia" } @string{NiedermannB = "Benjamin Niedermann" } @string{NiedermeierR = "Rolf Niedermeier" } @string{NieminenUJ = "U. J. Nieminen" } @string{NieseltK = "Kay Nieselt" } @string{NiittymakiJ = "Jarko Niittym{\"a}ki" } @string{NikanderP = "Pekka Nikander" } @string{NikoletseasS = "Sotiris Nikoletseas" } @string{NikoloskiZ = "Zoran Nikoloski" } @string{NilssonN = "Nils Nilsson" } @string{NisanN = "Noam Nisan" } @string{NishimuraK = "Kazuhiro Nishimura" } @string{NishimuraS = "S. Nishimura" } @string{NishizekiT = "Takao Nishizeki" } @string{NittelS = "Silvia Nittel" } @string{NoackA = "Andreas Noack" } @string{NodaI = "Itsuki Noda" } @string{NollenburgM = "Martin N{\"o}llenburg" } @string{NoltemeierH = "Hartmut Noltemeier" } @string{NooyW = "Wouter de Nooy" } @string{NooyWD = "Wouter De Nooy" } @string{NormanR = "Robert Z. Norman" } @string{NorthSC = "Stephen C. North" } @string{NorthwayML = "Mary L. Northway" } @string{NorvaagK = "Kjetil N{\o}rv{\aa}g" } @string{NossensonR = "Ronit Nossenson" } @string{NovakJ = "Novak, Jasmine" } @string{NowatzykA = "Andreas Nowatzyk" } @string{NowickiK = "Krzysztof Nowicki" } @string{NoyM = "Marc Noy" } @string{NummenmaaJ = "J. Nummenmaa" } @string{NunesAmaralLA = "Lu{\acute i}s Amaral" } @string{NunkesserM = "Marc Nunkesser" } @string{NutovZ = "Zeev Nutov" } @string{NuutilaE = "Esko Nuutila" } @string{ObradovicD = "D. Obradovic" } @string{OdenK = "Kevin Oden" } @string{OelkeD = "Daniela Oelke" } @string{OellermannOR = "Ortrud R. Oellermann" } @string{OgawaM = "Michima Ogawa" } @string{OgiharaM = "Mitsunori Ogihara" } @string{OhE = "Eulsik Oh" } @string{OhtaM = "Masyuku Ohta" } @string{OkadaT = "Takashi Okada" } @string{OkamotoY = "Yoshio Okamoto" } @string{OlmanV = "Victor Olman" } @string{OltvaiZN = "Zoltan N.\ Oltvai" } @string{OmranMT = "Masoud T. Omran" } @string{ONeilP = "P. V. O'Neil" } @string{oneworld = "{Oneworld Management Ltd}" } @string{OpitzO = "Otto Opitz" } @string{OrdaA = "Ariel Orda" } @string{oregon = "{University of Oregon Routeviews Project}" } @string{OresicM = "Matej Oresic" } @string{OrlinJB = "James B. Orlin" } @string{OrourkeJ = "Joseph O'Rourke" } @string{OrtizMGR = "Maria G.R. Ortiz" } @string{OsangG = "Georg Osang" } @string{OsawaT = "Toshihiko Osawa" } @string{OsipovV = "Vitaly Osipov" } @string{osm = "OpenStreetMap E" } @string{OstrowskiM = "Martin Ostrowski" } @string{OtachiY = "Yota Otachi" } @string{OttmannT = "Thomas Ottmann" } @string{OvelgonneM = "Michael Ovelg{\"o}nne" } @string{OvermarsMH = "Mark H. Overmars" } @string{OwensJD = "John D. Owens" } @string{OzierO = "Owen Ozier" } @string{PabonJimenezG = "Glarycelis Pab{'o}n-Jim{'e}nez" } @string{PachJ = "J{\'a}nos Pach" } @string{PadbergM = "Manfred Padberg" } @string{PageL = "Lawrence Page" } @string{PageLB = "Lavon B.\ Page" } @string{PaigeR = "Robert Paige" } @string{PajorT = "Thomas Pajor" } @string{PalaciosHuertaI = "Palacios-Huerta, Ignacio" } @string{PalemK = "Krishna Palem" } @string{PalladinoP = "Pietro Palladino" } @string{PallaG = "Gergely Palla" } @string{PallottinoS = "Stefano Pallottino" } @string{PalmerC = "Christopher Palmer" } @string{PanduranganG = "Gopal Pandurangan" } @string{PangC = "{Chi-Yin} Pang" } @string{PanigrahiD = "Debmalya Panigrahi" } @string{PanJ = "Jia-Yu Pan" } @string{PansiotJJ = "Jean Jacques Pansiot" } @string{PanVY = "Victor Y. Pan" } @string{PanY = "Yi Pan" } @string{PaoloED = "Ezequiel Di Paolo" } @string{PapadiasD = "Dimitris Papadias" } @string{PapadimitriouCH = "Christos H. Papadimitriou" } @string{PapadimitriouS = "Spiros Papadimitriou" } @string{PapadopoulosA = "Apostolos Papadopoulos" } @string{PapageorgiouLG = "Lazaros G. Papageorgiou" } @string{PapakostasA = "Achilleas Papakostas" } @string{PapamanthouC = "Charalampos Papamanthou" } @string{PapendiekB = "Britta Papendiek" } @string{PaperH = "Herbert H. Paper" } @string{PapeU = "U. Pape" } @string{ParaskevopoulosA = "Andreas Paraskevopoulos" } @string{PardalosPM = "Panos M. Pardalos" } @string{ParkJ = "Juyong Park" } @string{ParlettBN = "Beresford N.\ Parlett" } @string{ParmiggianiF = "F. Parmiggiani" } @string{ParterSV = "Seymour V. Parter" } @string{ParthasarathyS = "Srinivasan Parthasarathy" } @string{PascheC = "C. Pasche" } @string{PasqualeF = "Francesco Pasquale" } @string{PasqualoneG = "Giulio Pasqualone" } @string{PastorSatorrasR = "Romualdo Pastor-Satorras" } @string{PatelP = "Pari Patel" } @string{PatonK = "Keith Paton" } @string{PatrignaniM = "Maurizio Patrignani" } @string{PattisonP = "Philippa Pattison" } @string{PattisonPip = "Pip Pattison" } @string{PatwaryMM = "Md. Mostofa Patwary" } @string{PaulC = "Christophe Paul" } @string{PaullMC = "Marvin C. Paull" } @string{PaulusmaD = "Dani{\"e}l Paulusma" } @string{PayneTH = "Thomas H. Payne" } @string{PearlJ = "Judea Pearl" } @string{PeetersL = "Leon Peeters" } @string{PeinhardtM = "Matthias Peinhardt" } @string{PeiP = "Pengjun Pei" } @string{PejicS = "Sne{\v z}ana Peji{\'c}" } @string{PekecA = "Aleksandar Peke{\v c}" } @string{PelegD = "David Peleg" } @string{PelilloM = "Marcello Pelillo" } @string{PellegriniF = "Francois Pellegrini" } @string{PenttonenM = "Martti Penttonen" } @string{PerennesS = "St\'{e}phane P\'{e}rennes" } @string{PererA = "Adam Perer" } @string{Perez-de-la-CruzJL = "Jos{\'e}-Luis {P{\'e}rez-de-la-Cruz}" } @string{PerryA = "Albert Perry" } @string{PerryJE = "Jo Ellen Perry" } @string{PetersonL = "Larry Peterson" } @string{PetitJ = "Jordi Petit" } @string{PettieS = "Seth Pettie" } @string{PeyratC = "Claudine Peyrat" } @string{PferschyU = "Ulrich Pferschy" } @string{PfetschM = "Marc Pfetsch" } @string{PfoserD = "Dieter Pfoser" } @string{PhilippidesA = "Andrew Philippides" } @string{PhillipsJM = "Jeff M. Phillips" } @string{PhillipsS = "Steven Phillips" } @string{PhothilimthanaPM = "Phitchaya Mangpo Phothilimthana" } @string{PicardJC = "Jean-Claude Picard" } @string{PichC = "Christian Pich" } @string{PickholtzR = "Raymond Pickholtz" } @string{PigeotI = "Iris Pigeot" } @string{PignoletY = "Yvonne-Anne Pignolet" } @string{PijlsW = "Wim Pijls" } @string{PinlouA = "Alexandre Pinlou" } @string{PinskiG = "Pinski, Gabriel" } @string{PippertRE = "Raymond E. Pippert" } @string{PissinouN = "Niki Pissinou" } @string{PitreS = "Sylvain Pitre" } @string{PittelB = "Boris Pittel" } @string{PizzoniaM = "Maurizio Pizzonia" } @string{PlantC = "Claudia Plant" } @string{PoenitzA = "Andr{\'e} P{\"o}nitz" } @string{PohlI = "Ira Pohl" } @string{PolishchukV = "Valentin Polishchuk" } @string{PoljakS = "Svatopluk Poljak" } @string{PollackR = "Richard Pollack" } @string{PonsP = "Pascal Pons" } @string{PoonSH = "Sheung-Hung Poon" } @string{PoorH = "H.V. Poor" } @string{PopkovY = "Y.~Popkov" } @string{PortilloJR = "Portillo, Jos{\'e} Ramon" } @string{PosaL = "Louis P{\'o}sa" } @string{PostHN = "Henk N. Post" } @string{PotkonjakM = "Miodrag Potkonjak" } @string{PotvinJY = "Jean-Yves Potvin" } @string{PoulalhonD = "Dominique Poulalhon" } @string{PoulinR = "R.\ Poulin" } @string{PradhanSS = "S. Sandeep Pradhan" } @string{PramanikS = "Sakti Pramanik" } @string{PrasadSK = "Sushil K. Prasad" } @string{PrasinosG = "Grigorios Prasinos" } @string{PredaM = "Mihai Preda" } @string{PreisR = "Robert Preis" } @string{PremrudeepreechacharnS = "S. Premrudeepreechacharn" } @string{PreparataFP = "Franco P. Preparata" } @string{PressWH = "William H. Press" } @string{PrinsG = "Geert Prins" } @string{PrisnerE = "Erich Prisner" } @string{ProctorCH = "C.H. Proctor" } @string{ProemelHJ = "Hans J. Pr{\"o}mel" } @string{ProiettiG = "Guido Proietti" } @string{ProskurowskiA = "Andrzej Proskurowski" } @string{ProvanJS = "J. Scott Provan" } @string{PrutkinR = "Roman Prutkin" } @string{ptv = "{PTV AG -- Planung Transport Verkehr}" } @string{PuniyaniAR = "Amit R. Puniyani" } @string{PuppeT = "Thomas Puppe" } @string{PurcellTJ = "Timothy J. Purcell" } @string{PurchaseHC = "Helen C. Purchase" } @string{PurdomPW = "Purdom, Jr., Paul W." } @string{PursulaM = "Matti Pursula" } @string{PyrgaE = "Evangelia Pyrga" } @string{QuanW = "Wu Quan" } @string{QueyranneM = "Maurice Queyranne" } @string{QuigleyA = "Aaron Quigley" } @string{RaabJ = "J{\"o}rg Raab" } @string{RaanAF = "A. F. Van Raan" } @string{RabinMO = "Michael Oser Rabin" } @string{RackeH = "Harald R{\"a}cke" } @string{RademacherH = "Hans Rademacher" } @string{RademacherL = "Luis Rademacher" } @string{RadicchiF = "Filippo Radicchi" } @string{RadoslavovP = "Pavlin Radoslavov" } @string{RadzikT = "Tomasz Radzik" } @string{RafflerH = "Hartmut Raffler" } @string{RaghavachariB = "Balaji Raghavachari" } @string{RaghavanP = "Prabhakar Raghavan" } @string{RaghavendraCS = "Cauligi S.~Raghavendra" } @string{RahmanN = "Naila Rahman" } @string{RahmanS = "Md. Saidur Rahman" } @string{RajagopalanS = "Sridhar Rajagopalan" } @string{RakpenthaiC = "C. Rakpenthai" } @string{RamachandranV = "Vijaya Ramachandran" } @string{RamageD = "Daniel Ramage" } @string{RamalingamG = "G. Ramalingam" } @string{RamamoorthyCV = "C. V. Ramamoorthy" } @string{RamanR = "Rajeev Raman" } @string{RamchandranK = "Kannan Ramchandran" } @string{RamLS = "L. Shankar Ram" } @string{RandWM = "William M. Rand" } @string{RanganCP = "C. Pandu Rangan" } @string{RangwalaS = "Sumit Rangwala" } @string{RaoF = "Francesco Rao" } @string{RaoS = "Satish Rao" } @string{RaphaelB = "Bertram Raphael" } @string{RatanamahatanaCA = "Chotirat Ann Ratanamahatana" } @string{RatliffHD = "H. D. Ratliff" } @string{RatnasamyS = "Sylvia Ratnasamy" } @string{RaubalM = "Martin Raubal" } @string{RaviSS = "S.\ S.\ Ravi" } @string{RawitzD = "Dror Rawitz" } @string{RaychevV = "Veselin Raychev" } @string{RaymondJW = "John W. Raymond" } @string{RazenshteynI = "Ilya Razenshteyn" } @string{RazR = "Ran Raz" } @string{ReadRC = "Ronald C. Read" } @string{RebennackS = "Steffen Rebennack" } @string{RechtP = "Peter Recht" } @string{ReddyA = "Anoop Reddy" } @string{RednerS = "Sidney Redner" } @string{ReggianiMG = "Marcello G. Reggiani" } @string{ReichardtJ = "J{\"o}rg Reichardt" } @string{ReifJH = "John H. Reif" } @string{ReineltG = "Gerhard Reinelt" } @string{ReingoldEM = "Edward M. Reingold" } @string{ReischukR = "R{\"u}diger Reischuk" } @string{ReissT = "Thomas Rei{\ss{}}" } @string{ReitzKP = "Karl P.\ Reitz" } @string{RendlF = "Franz Rendl" } @string{RenyiA = "Alfred R{\'e}nyi" } @string{RepsT = "Thomas Reps" } @string{ResendeM = "Mauricio Resende" } @string{RexeisM = "Martin Rexeis" } @string{RexfordJ = "Jennifer Rexford" } @string{ReyesP = "Reyes, Pedro" } @string{RezuchaI = "Ivan Rezucha" } @string{RiceJA = "John A.\ Rice" } @string{RiceM = "Michael Rice" } @string{RichaAW = "Andrea W. Richa" } @string{RichardsonS = "Sylvia Richardson" } @string{RichardsWD = "William D.\ Richards" } @string{RichmondLB = "L.\ Bruce Richmond" } @string{RichterS = "Stefan Richter" } @string{RickenbachPv = "Pascal von Rickenbach" } @string{RiddleM = "Mark Riddle" } @string{RiegerD = "David Rieger" } @string{RijsbergenCJ = "C. J. Rijsbergen" } @string{RilettLR = "L. R. Rilett" } @string{RileyC = "Chris Riley" } @string{RinaldiG = "Giovanni Rinaldi" } @string{RingelG = "Gerhard Ringel" } @string{RinnooyKanAHG = "Alexander H. G. Rinnooy Kan" } @string{RiordanOM = "Oliver M. Riordan" } @string{RipphausenLipaH = "Heike Ripphausen-Lipa" } @string{RivestRL = "Ronald L. Rivest" } @string{RivlinE = "Ehud Rivlin" } @string{RizzoliAE = "Andrea E. Rizzoli" } @string{RobertsFS = "Fred S.\ Roberts" } @string{RobertsGO = "Roberts, Gareth O." } @string{RobertsM = "Maxwell Roberts" } @string{RobinsG = "Garry Robins" } @string{RobsonD = "Drew Robson" } @string{RobsonJM = "John Michael Robson" } @string{RoddenT = "Tom Rodden" } @string{RodehM = "Michael Rodeh" } @string{RodittyL = "Liam Roditty" } @string{RogersDL = "David L. Rogers" } @string{RogersY = "Yvonne Rogers" } @string{RohnertH = "Hans Rohnert" } @string{RokneJ = "Jon Rokne" } @string{RollinJ = "Jonathan Rollin" } @string{RomanJ = "Jean Roman" } @string{RomneyAK = "A. Kimbal Romney" } @string{RomR = "Raphael Rom" } @string{RosamondF = "Frances Rosamond" } @string{RosenA = "A. Rosen" } @string{RosenbergC = "Catherine Rosenberg" } @string{RosenfeldA = "Azriel Rosenfeld" } @string{RosenstiehlP = "Pierre Rosenstiehl" } @string{RosenthalA = "Arnon S.~Rosenthal" } @string{RosenthalAr = "Arnie Rosenthal" } @string{RosenthalJS = "Rosenthal, Jeffrey S." } @string{Roshany-YamchiS = "S. Roshany-Yamchi" } @string{RossIC = "Ian C. Ross" } @string{RossmanithP = "Peter Rossmanith" } @string{RossSM = "Sheldon M. Ross" } @string{RoteG = "G{\"u}nter Rote" } @string{RothD = "Dan Roth" } @string{RottaR = "Randolf Rotta" } @string{RoughgardenT = "Tim Roughgarden" } @string{RoushFW = "F. W.\ Roush" } @string{RowlinsonP = "Peter Rowlinson" } @string{RoyleG = "Gordon Royle" } @string{RubiM = "Miguel Rubi" } @string{RubinDB = "Donald B.\ Rubin" } @string{RudellR = "Richard Rudell" } @string{RuhnauB = "Britta Ruhnau" } @string{RuiZ = "Zhang Rui" } @string{RumlW = "Wheeler Ruml" } @string{RundensteinerEA = "Elke A. Rundensteiner" } @string{RusD = "Daniela Rus" } @string{RuspiniEH = "Enrique H. Ruspini" } @string{RustinR = "Randall Rustin" } @string{RutterI = "Ignaz Rutter" } @string{RuttNE = "Norman E. Rutt" } @string{RuysP = "Picter H.M. Ruys" } @string{RuzikaS = "Stefan Ruzika" } @string{SaberiA = "Amin Saberi" } @string{SabidussiG = "Gert Sabidussi" } @string{SachenbacherM = "Martin Sachenbacher" } @string{SachsH = "Horst Sachs" } @string{SackJ = "J{\"o}rg-R{\"u}diger Sack" } @string{SadasivamS = "Sadish Sadasivam" } @string{SaerensM = "Marco Saerens" } @string{SafraS = "Shmuel Safra" } @string{SagieG = "Gonen Sagie" } @string{SahaB = "Barna Saha" } @string{SahniSK = "Sartaj K.\ Sahni" } @string{SaiaJ = "Jared Saia" } @string{SailerLD = "Lee Douglas Sailer" } @string{SaitohT = "Toshiki Saitoh" } @string{SaitoN = "N.~Saito" } @string{Sales-PardoM = "Marta Sales-Pardo" } @string{SalgadoLB = "Liliane Benning Salgado" } @string{SamaranayakeS = "Samitha Samaranayake" } @string{SametH = "Hanan Samet" } @string{SamiM = "Mariagiovanna Sami" } @string{SamukhinAN = "Alexander N. Samukhin" } @string{SandersP = "Peter Sanders" } @string{SankaranarayananJ = "Jagan Sankaranarayanan" } @string{SansoneC = "Carlo Sansone" } @string{SantiniM = "Massimo Santini" } @string{SantiP = "Paolo Santi" } @string{SantoroN = "Nicola Santoro" } @string{SantosJL = "Jose L. Santos" } @string{SaranH = "Huzur Saran" } @string{SardasM = "Meir Sardas" } @string{SarelaM = "Mikko S{\"a}rel{\"a}" } @string{SaroiuS = "Stefan Saroiu" } @string{SarrafzadehM = "Majid Sarrafzadeh" } @string{SasseJ = "Jan-Ole Sasse" } @string{SatalinoG = "G. Satalino" } @string{SatishN = "Nadathur Satish" } @string{SatyanarayanaA = "A. Satyanarayana" } @string{SauerwaldT = "Thomas Sauerwald" } @string{SaulL = "Lawrence Saul" } @string{SaumellM = "Maria Saumell" } @string{SaupeD = "Dietmar Saupe" } @string{SavageCD = "Carla D.\ Savage" } @string{SavageSD = "Shaun D. Savage" } @string{SavvidesA = "Andreas Savvides" } @string{SawardeckerEN = "E. N. Sawardecker" } @string{SawitzkiD = "Daniel Sawitzki" } @string{ScalaA = "Antonio Scala" } @string{ScarselliF = "Scarselli, Franco" } @string{SchachtebeckM = "Michael Schachtebeck" } @string{SchaderM = "Martin Schader" } @string{SchaeferM = "Marcus Schaefer" } @string{SchaefferG = "Gilles Schaeffer" } @string{SchaefferJ = "Jonathan Schaeffer" } @string{SchaefferSE = "Satu Elisa Schaeffer" } @string{SchafferAA = "Alejando A. Sch{\"a}ffer" } @string{SchambergerS = "Stefan Schamberger" } @string{SchankT = "Thomas Schank" } @string{ScharnhorstA = "Andrea Scharnhorst" } @string{ScheidelerC = "Christian Scheideler" } @string{ScheinermanER = "Edward R. Scheinerman" } @string{SchieberB = "Baruch Schieber" } @string{SchieferdeckerD = "Dennis Schieferdecker" } @string{SchikarskiA = "Andreas Schikarski" } @string{SchillingH = "Heiko Schilling" } @string{SchimkeA = "Antje Schimke" } @string{SchirraS = "Stefan Schirra" } @string{SchlafliL = "Ludwig Schl{\"a}fli" } @string{SchlickenriederW = "Wolfram Schlickenrieder" } @string{SchloegelK = "Kirk Schloegel" } @string{SchmeichelEF = "Edward F.~Schmeichel" } @string{SchmidJ = "Johannes Schmid" } @string{SchmidtEM = "Erik Meineche Schmidt" } @string{SchmidtJM = "Jens M. Schmidt" } @string{SchmidtM = "Marie Schmidt" } @string{SchmochU = "Ulrich Schmoch" } @string{SchneeM = "Mathias Schnee" } @string{SchneiderK = "Karsten Schneider" } @string{SchneiderV = "Volker Schneider" } @string{SchneidewindJ = "J{\"o}rn Schneidewind" } @string{SchnorrCP = "Claus P. Schnorr" } @string{SchnyderW = "Walter Schnyder" } @string{SchodlA = "Arno Sch{\"o}dl" } @string{SchoebelA = "Anita Sch{\"o}bel" } @string{SchoelkopfB = "Bernhard Sch{\"o}lkopf" } @string{SchoenfeldR = "Robby Sch{\"o}nfeld" } @string{SchoeningU = "Uwe Sch{\"o}ning" } @string{SchrammO = "Oded Schramm" } @string{SchreckT = "Tobias Schreck" } @string{SchreiberF = "Falk Schreiber" } @string{SchreiberR = "Robert Schreiber" } @string{SchrijverA = "Alexander Schrijver" } @string{SchuetzB = "Birk Sch{\"u}tz" } @string{SchuetzP = "Philipp Schuetz" } @string{SchuhmannJ = "Julian Schuhmann" } @string{SchultesD = "Dominik Schultes" } @string{SchultzM = "Michelle Schultz" } @string{SchultzT = "Tanja Schultz" } @string{SchulzA = "Andr{\'e} Schulz" } @string{SchulzC = "Christian Schulz" } @string{SchulzeA = "Anna Schulze" } @string{SchulzF = "Frank Schulz" } @string{SchummA = "Andrea Schumm" } @string{SchusterHG = "Heinz Georg Schuster" } @string{SchusterS = "S. Schuster" } @string{SchutteC = "Christof Sch{\"u}tte" } @string{SchutterBD = "Bart De Schutter" } @string{SchwabA = "A.J. Schwab" } @string{SchwartzJE = "Joseph E. Schwartz" } @string{SchwartzMR = "M. R. Schwartz" } @string{SchweinbergerM = "Michael Schweinberger" } @string{SchwenkAJ = "Allen J. Schwenk" } @string{SchwentickT = "Thomas Schwentick" } @string{SchwikowskiB = "Benno Schwikowski" } @string{SciomachenA = "Anna Sciomachen" } @string{ScottD = "Dana Scott" } @string{ScottJ = "John Scott" } @string{ScottJA = "Jennifer A.\ Scott" } @string{ScottK = "Kelley Scott" } @string{ScutellaMG = "Maria Grazia Scutell{\`a}" } @string{SearyAJ = "Andrew J. Seary" } @string{SedgewickR = "Robert Sedgewick" } @string{SeegerB = "Bernhard Seeger" } @string{SeeleyJR = "John R. Seeley" } @string{SeeryJB = "J. B. Seery" } @string{SeetharamanS = "Srinivasan Seetharaman" } @string{SegalM = "Michael Segal" } @string{SegoviaJ = "Javier Segovia" } @string{SeidelE = "Eike Seidel" } @string{SeidmanSB = "Stephen B.\ Seidman" } @string{SellenA = "Abigail Sellen" } @string{SellmannM = "Meinolf Sellmann" } @string{SelmanB = "Bart Selman" } @string{SeltserMA = "Michael A. Seltser" } @string{SenS = "Sandeep Sen" } @string{SensenN = "Norbert Sensen" } @string{SernaM = "Mar{\'i}a Serna" } @string{SerraO = "Oriol Serra" } @string{ServettoSD = "Sergio D.~Servetto" } @string{SeymourPD = "Paul D. Seymour" } @string{ShahabiC = "Cyrus Shahabi" } @string{ShaharS = "Shimon Shahar" } @string{ShahC = "C. Shah" } @string{ShahrokhiF = "Farhad Shahrokhi" } @string{ShallcrossD = "David Shallcross" } @string{ShamirR = "Ron Shamir" } @string{ShamosMI = "Michael I. Shamos" } @string{ShannonCE = "Claude E. Shannon" } @string{ShannonP = "Paul Shannon" } @string{SharaihaYM = "Y. M. Sharaiha" } @string{SharanR = "Roded Sharan" } @string{SharirM = "Micha Sharir" } @string{ShavittY = "Yuval Shavitt" } @string{ShawP = "Peter Shaw" } @string{ShearerK = "Kim Shearer" } @string{ShengC = "Cheng Sheng" } @string{ShengL = "Li Sheng" } @string{ShenH = "Hong Shen" } @string{ShenHT = "Heng Tao Shen" } @string{ShenkerS = "Scott Shenker" } @string{ShenkerSJ = "Scott J. Shenker" } @string{ShenOrrS = "Shai Shen-Orr" } @string{ShieberSM = "Stuart M. Shieber" } @string{ShierDR = "Douglas R. Shier" } @string{ShiJ = "Jianbo Shi" } @string{ShiloachY = "Yossi Shiloach" } @string{ShimbelA = "Alfonso Shimbel" } @string{ShimouraH = "H. Shimoura" } @string{ShinC = "Chan-Su Shin" } @string{ShinodaK = "Kosuke Shinoda" } @string{ShirakawaI = "Isao Shirakawa" } @string{ShirE = "Eran Shir" } @string{ShireyPR = "Paul R. Shirey" } @string{ShivakumarN = "N.R. Shivakumar" } @string{ShmoysDB = "David B. Shmoys" } @string{ShmulyianB = "B.~Shmulyian" } @string{ShneidermanB = "Ben Shneiderman" } @string{ShorPW = "Peter W. Shor" } @string{ShubinaG = "Galina Shubina" } @string{SiebenhallerM = "Martin Siebenhaller" } @string{SiekJG = "Jeremy G. Siek" } @string{SierksmaG = "Gerard Sierksma" } @string{SiganosG = "Georgos Siganos" } @string{SilvaF = "Fabio Silva" } @string{SilvaVd = "Vin de Silva" } @string{SilveiraRI = "Rodrigo I. Silveira" } @string{SilversteinC = "Craig Silverstein" } @string{SilvestriR = "Riccardo Silvestri" } @string{SimFM = "F. M. Sim" } @string{SimicS = "Slobodan Simic" } @string{SimonH = "Hort Simon" } @string{SimonHD = "Horst D. Simon" } @string{SimonovitsM = "Mikl{\'o}s Simonovits" } @string{SinclairA = "Alistair Sinclair" } @string{SinclairP = "Philip Sinclair" } @string{SinghB = "Brajendra K. Singh" } @string{SinghM = "Mohit Singh" } @string{SipserM = "Michael Sipser" } @string{SipsM = "Mike Sips" } @string{SiuK = "Kai-Yeung Siu" } @string{SivakumarD = "D. Sivakumar" } @string{SixJM = "Janet M. Six" } @string{SkordasT = "Thomas Skordas" } @string{SkriverAJ = "Anders J. Skriver" } @string{SkvoretzJ = "John Skvoretz" } @string{SkyumS = "Sven Skyum" } @string{SlaterP = "Peter J. Slater" } @string{SleaterDD = "Daniel D. Sleater" } @string{SlijepcevicS = "Sasa Slijepcevic" } @string{SlivkinsA = "Aleksandrs Slivkins" } @string{SliwinskiA = "Adam Sliwinski" } @string{SloaneNJ = "Neil James Alexander Sloane" } @string{SlobW = "Wouter Slob" } @string{SlootenE = "Elisabeth Slooten" } @string{SlutzkiG = "Slutzki, Giora" } @string{SmartC = "Christian Smart" } @string{SmidM = "Michiel Smid" } @string{SmidMH = "Michiel H. Smid" } @string{SmithCAB = "C. A. B. Smith" } @string{SmithRL = "Robert L. Smith" } @string{SmythP = "Padhraic Smyth" } @string{SmythWF = "William F. Smyth" } @string{SneathPHA = "Peter H. A. Sneath" } @string{SnellJL = "James Laurie Snell" } @string{SneltingG = "Gregor Snelting" } @string{SnijdersTAB = "Tom A.B.\ Snijders" } @string{SnoeyinkJ = "Jack Snoeyink" } @string{SoisalonSoininenE = "Eljas Soisalon-Soininen" } @string{SokalRR = "Robert R. Sokal" } @string{SokolowskiS = "Stefan Sokolowski" } @string{SommerC = "Christian Sommer" } @string{sonivis = "{SONIVIS} team" } @string{SonntagG = "Gerit Sonntag" } @string{SoperAJ = "A. J. Soper" } @string{SosVT = "Vera T. S{\'o}s" } @string{SotoM = "Mauricio Soto" } @string{SoumisF = "Francois Soumis" } @string{SouzaA = "Alexander Offtermatt-Souza" } @string{SparmannU = "Uwe Sparmann" } @string{SpeckJ = "Jochen Speck" } @string{SpeckmannB = "Bettina Speckmann" } @string{SpencerJ = "Joel Spencer" } @string{SpiegelhalterDJ = "David J.\ Spiegelhalter" } @string{SpielmanDA = "Daniel A.\ Spielman" } @string{SpiliopoulouM = "Myra Spiliopoulou" } @string{SpillnerA = "Andreas Spillner" } @string{SpirakisP = "Paul Spirakis" } @string{SpitadakisV = "Vassilis Spitadakis" } @string{SprinzenM = "Merle Sprinzen" } @string{SridharS = "Srinath Sridhar" } @string{SrinivasanA = "Aravind Srinivasan" } @string{SrivastavA = "Anand Srivastav" } @string{SrivastavaJ = "Jaideep Srivastava" } @string{StadlerPF = "Peter F. Stadler" } @string{StadtentwicklungBf = "Bundesministerium f{\"u}r Stadtentwicklung" } @string{StanleyHE = "H. Eugene Stanley" } @string{staralliance = "{Star Alliance}" } @string{StataR = "Raymie Stata" } @string{StaudtC = "Christian Staudt" } @string{StegerA = "Angelika Steger" } @string{StegeU = "Ulrike Stege" } @string{SteglichCE = "Christian E. Steglich" } @string{StegmaierM = "Matthias Stegmaier" } @string{SteigeleS = "Stephan Steigele" } @string{SteiglitzK = "Kenneth Steiglitz" } @string{SteinbachM = "Michael Steinbach" } @string{SteinC = "Clifford Stein" } @string{SteinitzE = "Erich Steinitz" } @string{SteinmetzR = "Ralf Steinmetz" } @string{SteinSK = "S. K. Stein" } @string{StephensonK = "Kenneth Stephenson" } @string{StephensonKA = "Karen A. Stephenson" } @string{SteponaviceI = "Ingrida Steponavice" } @string{SternHS = "Hal S.\ Stern" } @string{StillerS = "Sebastian Stiller" } @string{StixV = "Volker Stix" } @string{StockmeyerLJ = "Larry J. Stockmeyer" } @string{StoerJ = "Josef Stoer" } @string{StoerM = "Mechthild Stoer" } @string{StoerrleH = "Harald St{\"o}rrle" } @string{StokmanFN = "Frans N. Stokman" } @string{StoneAH = "A. H. Stone" } @string{StoneM = "Maureen Stone" } @string{StorandtS = "Sabine Storandt" } @string{StorkW = "Wilhelm Stork" } @string{StougieL = "Leen Stougie" } @string{StrasserB = "Ben Strasser" } @string{StraussD = "David Strauss" } @string{StrehlA = "Alexander Strehl" } @string{StrivastavaMB = "Mani B. Strivastava" } @string{StrogatzSH = "Steven H.\ Strogatz" } @string{SturtevantNR = "Nathan R.\ Sturtevant" } @string{SubramanianA = "Ashok Subramanian" } @string{SubramanianL = "Lakshminarayanan Subramanian" } @string{SudakovB = "Benny Sudakov" } @string{SudermanM = "Matthew Suderman" } @string{SugiyamaK = "Kozo Sugiyama" } @string{SuhlL = "Leena Suhl" } @string{SuJ = "Jianning Su" } @string{SunD = "D. Sun" } @string{SunderVS = "V. S. Sunder" } @string{SunF = "Feng Sun" } @string{SunI = "I-Fan Sun" } @string{SunJ = "Jimeng Sun" } @string{SunS = "Shiwei Sun" } @string{SupowitKJ = "Kenneth J. Supowit" } @string{SuriS = "Siddharth Suri" } @string{SuriSu = "Subhash Suri" } @string{SutersWH = "W. Henry Suters" } @string{SwamyMNS = "M. N. S. Swamy" } @string{SwartHC = "Henda C. Swart" } @string{SweetingWJ = "W. J. Sweeting" } @string{SykoraO = "Ondrej S{\'y}kora" } @string{SymonsCT = "Chris T. Symons" } @string{SymvonisA = "Antonios Symvonis" } @string{SysikaskiM = "Mikko Sysikaski" } @string{SzczepaniakPS = "Piotr S. Szczepaniak" } @string{SzekelyLA = "L{\'a}szl{\'o} A. Sz{\' e}kely" } @string{TaeubigH = "Hanjo T{\"a}ubig" } @string{TagawaS = "S. Tagawa" } @string{TainiterM = "Melvin Tainiter" } @string{TakafujiD = "Daisuke Takafuji" } @string{TakeuchiM = "M.~Takeuchi" } @string{TalbiEG = "El-Ghazali Talbi" } @string{TamakiH = "Hisao Tamaki" } @string{TamassiaR = "Roberto Tamassia" } @string{TangL = "Linqing Tang" } @string{TangmunarunkitH = "Hongsuda Tangmunarunkit" } @string{TanP = "Pang-Ning Tan" } @string{TantipathananandthC = "C. Tantipathananandth" } @string{TaokaS = "Satoshi Taoka" } @string{TaoY = "Yufei Tao" } @string{TardosE = "{\'E}va Tardos" } @string{TarjanR = "Robert Tarjan" } @string{TarjanRE = "Robert E. Tarjan" } @string{TaruiJ = "Jun Tarui" } @string{TassinariE = "Emanuele Tassinari" } @string{TassiulasL = "Leandros Tassiulas" } @string{TaubigH = "Hanjo T{\"a}ubig" } @string{TauroS = "Sudhir L. Tauro" } @string{TavaresG = "Gabriel Tavares" } @string{TaylorDS = "David S.\ Taylor" } @string{TaylorWW = "William W. Taylor" } @string{TeamRD = "{R Development Core Team}" } @string{TeboulleM = "Marc Teboulle" } @string{TelG = "Gerard Tel" } @string{TellerS = "Seth Teller" } @string{TenenbaumJB = "Joshua B. Tenenbaum" } @string{TenfeldePodehlD = "Dagmar Tenfelde-Podehl" } @string{TengS = "Shang-Hau Teng" } @string{TenmokuK = "K. Tenmoku" } @string{TeukolskySA = "Saul A. Teukolsky" } @string{ThaiMT = "My T. Thai" } @string{ThatcherJW = "James W. Thatcher" } @string{TheesfeldC = "Chandra Theesfeld" } @string{TheodorakisD = "Dimitris Theodorakis" } @string{TheuneD = "Dirk Theune" } @string{ThomasGR = "George Rubin Thomas" } @string{ThomasianA = "Alexander Thomasian" } @string{ThomasJA = "Joy A. Thomas" } @string{ThomasRE = "R. Emerson Thomas" } @string{ThomassenC = "Carsten Thomassen" } @string{ThorupM = "Mikkel Thorup" } @string{ThrunS = "Sebastian Thrun" } @string{ThulasiramanK = "K. Thulasiraman" } @string{ThurimellaR = "Ramakrishna Thurimella" } @string{ThurstonD = "Dylan Thurston" } @string{ThurstonWP = "William Paul Thurston" } @string{TianS = "Songlin Tian" } @string{TielertT = "Tessa Tielert" } @string{TilfordJS = "John S. Tilford" } @string{TillichJP = "Jean-Pierre Tillich" } @string{TimajevL = "Larissa Timajev" } @string{TimofeevEA = "Eugeniy A. Timofeev" } @string{TindellR = "Ralph Tindell" } @string{TinhoferG = "Gottfried Tinhofer" } @string{TittmannP = "Peter Tittmann" } @string{TjandraSA = "Stevanus A. Tjandra" } @string{TodaM = "M. Toda" } @string{TokushigeN = "Norihide Tokushige" } @string{TokuyamaT = "Takeshi Tokuyama" } @string{TolkienJR = "John Ronald Reuel Tolkien" } @string{TollisIG = "Ioannis G.~Tollis" } @string{TomborB = "B. Tombor" } @string{TomkinsAS = "Andrew S. Tomkins" } @string{TomlinJ = "Tomlin, John" } @string{TongP = "Po Tong" } @string{ToppJ = "Jerzy Topp" } @string{ToranJ = "Jacobo Toran" } @string{TorczonL = "Linda Torczon" } @string{TorgersonWS = "Warren S. Torgerson" } @string{TorrPH = "Philip H. Torr" } @string{TothC = "Csaba D. T{\'o}th" } @string{TothP = "Paolo Toth" } @string{ToussaintGT = "Godfried T.\ Toussaint" } @string{TowslefD = "Don Towslef" } @string{TowsleyD = "Don Towsley" } @string{ToyodaM = "Masashi Toyoda" } @string{TraubJF = "Joseph F. Traub" } @string{TrieschE = "Eberhard Triesch" } @string{TripathiA = "Amitabha Tripathi" } @string{TrojanowskiAE = "Anthony E. Trojanowski" } @string{TrottaF = "Francesco Trotta" } @string{TrotterWT = "William T. Trotter" } @string{TroyanskayaO = "Olga Troyanskaya" } @string{TrudingerNS = "Neil S. Trudinger" } @string{TruszczynskiM = "Miroslaw Truszczy{\'n}ski" } @string{TsaiCC = "Chun Che Tsai" } @string{TsaparasP = "Tsaparas, Panayiotis" } @string{TsengY = "Yu-Chee Tseng" } @string{TsioutsiouliklisK = "Kostas Tsioutsiouliklis" } @string{TsirogiannisC = "Constantinos Tsirogiannis" } @string{TsokaS = "Sophia Tsoka" } @string{TsotrasV = "Vassilis Tsotras" } @string{TsourosK = "Konstantinos-Klaudius Tsouros" } @string{TsukiyamaS = "Shuji Tsukiyama" } @string{TsurD = "Dekel Tsur" } @string{TsurumiT = "Toshiyuki Tsurumi" } @string{TuckerAW = "Albert William Tucker" } @string{TuckerTW = "Thomas W. Tucker" } @string{TufteE = "Edward Tufte" } @string{TungL = "L. Tung" } @string{TungTungC = "Chi Tung Tung" } @string{TunkelangD = "Daniel Tunkelang" } @string{TuranP = "P{\'a}l Tur{\'a}n" } @string{TurauV = "Volker Turau" } @string{TurkG = "Greg Turk" } @string{TusnadyG = "G{\'a}bor Tusn{\'a}dy" } @string{TutteWT = "William T. Tutte" } @string{TutzG = "Gerhard Tutz" } @string{TzengH = "Hong-Yi Tzeng" } @string{UatrongjitS = "S. Uatrongjit" } @string{UeharaR = "Ryuhei Uehara" } @string{UetzP = "Peter Uetz" } @string{UlanowiczRE = "Robert E. Ulanowicz" } @string{UllmanJD = "Jeffrey D. Ullman" } @string{UngererT = "Theo Ungerer" } @string{UngerSH = "Stephen H. Unger" } @string{UnoT = "Takeaki Uno" } @string{UpfalE = "Eli Upfal" } @string{VadhanSP = "Salil P. Vadhan" } @string{VahrenholdJ = "Jan Vahrenhold" } @string{VaidyaPM = "Pravin M. Vaidya" } @string{ValdesJ = "Jacobo Valdes" } @string{ValenteTW = "Thomas W. Valente" } @string{ValenzuelaJ = "Valenzuela, Jes{\'u}s" } @string{ValiantLG = "Leslie G. Valiant" } @string{VandenbergheL = "Lieven Vandenberghe" } @string{VanEmdeBoasP = "Peter van Emde Boas" } @string{VanRyzinJ = "Van Ryzin, J." } @string{VanvyveD = "Denis Vanvyve" } @string{VapnikVN = "Vladimir N. Vapnik" } @string{VargiuF = "Francesco Vargiu" } @string{VasconcellosM = "Marcio Vasconcellos" } @string{VassilevskaV = "Virginia Vassilevska" } @string{VassilvitskiiS = "Sergei Vassilvitskii" } @string{VaughanC = "Courtenay Vaughan" } @string{VaziraniU = "Umesh Vazirani" } @string{VaziraniVV = "Vijay V. Vazirani" } @string{VazirgiannisM = "Michalis Vazirgiannis" } @string{VazquezA = "Alexei V{\'a}zquez" } @string{VecchiMP = "Mario P. Vecchi" } @string{VedovaGD = "Gianluca Della Vedova" } @string{VekslerO = "Olga Veksler" } @string{VempalaS = "Santosh Vempala" } @string{VenkatacharyS = "Srinivasan Venkatachary" } @string{VentoM = "Mario Vento" } @string{VerbeekK = "Kevin Verbeek" } @string{VerleysenM = "Michel Verleysen" } @string{VermaD = "Deepak Verma" } @string{VeselovskyAV = "Alexander V. Veselovsky" } @string{VespignaniA = "Alessandro Vespignani" } @string{VettaA = "Adrian Vetta" } @string{VetterC = "Christian Vetter" } @string{VetterlingWT = "William T. Vetterling" } @string{VicsekT = "Tam{\'a}s Vicsek" } @string{ViennotL = "Laurent Viennot" } @string{VigerF = "Fabien Viger" } @string{VignaS = "Sebastiano Vigna" } @string{VigoD = "Daniele Vigo" } @string{VillarMT = "Villar, Maria Trinidad" } @string{VinayV = "V. Vinay" } @string{VismaraL = "Luca Vismara" } @string{visone = "visone project" } @string{VitaleC = "Camillo Vitale" } @string{VitterJS = "Jeffrey S. Vitter" } @string{VockingB = "Berthold V{\"o}cking" } @string{VolijO = "Volij, Oscar" } @string{VolinskyC = "Chris Volinsky" } @string{VolkerL = "Lars Volker" } @string{VolkerM = "Markus V{\"o}lker" } @string{VolkmannL = "Lutz Volkmann" } @string{VollmerH = "Heribert Vollmer" } @string{VriesRD = "Remco De Vries" } @string{VrtoI = "Imrich Vrto" } @string{VuCT = "Chinh T. Vu" } @string{VukadinovicD = "Danica Vukadinovi{\'c}" } @string{VuV = "Van Vu" } @string{VygenJ = "Jens Vygen" } @string{VyskocilT = "Tom{\'a}s Vyskocil" } @string{WadaK = "Koichi Wada" } @string{WaddellP = "Paul Waddell" } @string{WagnerCG = "Christopher G. Wagner" } @string{WagnerD = "Dorothea Wagner" } @string{WagnerF = "Frank Wagner" } @string{WagnerK = "Klaus Wagner" } @string{WagnerS = "Silke Wagner" } @string{WahlsterW = "Wolfgang Wahlster" } @string{WakabayashiY = "Yoshiko Wakabayashi" } @string{WakitaK = "Ken Wakita" } @string{WallCE = "Curtiss E. Wall" } @string{WallensteinS = "Sylvan Wallenstein" } @string{WalshawC = "Chris Walshaw" } @string{WalshT = "Toby Walsh" } @string{WalshTR = "T. R. Walsh" } @string{WangB = "Bei Wang" } @string{WangC = "Chen Wang" } @string{WangChao = "Chao Wang" } @string{WangG = "Grant Wang" } @string{WangH = "Haitao Wang" } @string{WangJ = "Joseph Wang" } @string{WangJT = "Jonathan T. Wang" } @string{WangN = "Nan Wang" } @string{WangT = "Tengjiao Wang" } @string{WangX = "Xiaobo Wang" } @string{WangY = "Yuexuan Wang" } @string{WangYa = "Yajun Wang" } @string{WangYJ = "Yuchung J.\ Wang" } @string{WangYu = "Yu Wang" } @string{WankaR = "Rolf Wanka" } @string{WanxingS = "Sheng Wanxing" } @string{WarburtonA = "Arthur Warburton" } @string{WardenT = "Tobias Warden" } @string{WareC = "Colin Ware" } @string{WarmuthMK = "Manfred K. Warmuth" } @string{WarnowT = "Tandy Warnow" } @string{WarshallS = "Stephen Warshall" } @string{WassermanS = "Stanley Wasserman" } @string{WatanabeT = "Toshimasa Watanabe" } @string{WatkinsDS = "David S.\ Watkins" } @string{WattenhoferM = "Mirjam Wattenhofer" } @string{WattenhoferR = "Roger Wattenhofer" } @string{WattsA = "Alison Watts" } @string{WattsDJ = "Duncan J.\ Watts" } @string{WaxmanBM = "Bernard M. Waxman" } @string{WeberA = "Alfred Weber" } @string{WeberP = "Pascal Weber" } @string{WegenerI = "Ingo Wegener" } @string{WegmanMN = "Mark N. Wegman" } @string{WehrleK = "Klaus Wehrle" } @string{WeiF = "Fang Wei" } @string{WeigtM = "Martin Weigt" } @string{WeiheK = "Karsten Weihe" } @string{WeikumG = "Gerhard Weikum" } @string{WeinerP = "Peter Weiner" } @string{WeiskircherR = "Ren{\'e} Weiskircher" } @string{WeissY = "Yair Weiss" } @string{WelshDJ = "Dominic J. A. Welsh" } @string{WelzlE = "Emo Welzl" } @string{WenkC = "Carola Wenk" } @string{WenkMR = "Markus R. Wenk" } @string{WerneckR = "Renato F. Werneck" } @string{WesselsD = "Duane Wessels" } @string{WestbrookJ = "Jeffery Westbrook" } @string{WestDB = "Douglas B.\ West" } @string{WestfechtelB = "Bernhard Westfechtel" } @string{WexlerT = "Tom Wexler" } @string{WeyerC = "Christoph Weyer" } @string{WheelockCE = "Craig E. Wheelock" } @string{WhiteA = "Andy White" } @string{WhitedDE = "D. E. Whited" } @string{WhiteDR = "Douglas R.\ White" } @string{WhiteHC = "Harrison C.\ White" } @string{WhiteHD = "Howard D.\ White" } @string{WhiteJA = "John A.\ White" } @string{WhiteleyW = "Walter Whiteley" } @string{WhiteS = "Scott White" } @string{WhitesidesSH = "Sue H.\ Whitesides" } @string{WhitneyH = "Hassler Whitney" } @string{WhittyRW = "R. W. Whitty" } @string{WhyteWF = "William F. Whyte" } @string{WibleA = "Adam Wible" } @string{WichmannA = "Arne Wichmann" } @string{WichmannT = "Thorsten Wichmann" } @string{WidmayerP = "Peter Widmayer" } @string{WidomJ = "Widom, Jennifer" } @string{WienerH = "Harry Wiener" } @string{WienerJ = "Janet Wiener" } @string{WieseR = "Roland Wiese" } @string{WigdersonA = "Avi Wigderson" } @string{WigginsCH = "Chris H.\ Wiggins" } @string{WignerEP = "Eugene P. Wigner" } @string{Wikipedia = "Wikipedia" } @string{WilfHS = "Herbert S. Wilf" } @string{WilhelmR = "Reinhard Wilhelm" } @string{WilkinsonD = "Dennis Wilkinson" } @string{WilkinsonJH = "James H. Wilkinson" } @string{WillardDE = "Dan E. Willard" } @string{WilletP = "Peter Willet" } @string{WillettP = "Peter Willett" } @string{WillhalmT = "Thomas Willhalm" } @string{WilliamsJ = "J.W.J. Williams" } @string{WilliamsonD = "David Williamson" } @string{WilliamsR = "Robert Williams" } @string{WilliamsT = "Thomas Williams" } @string{WilliamsVV = "Virginia Vassilevska Williams" } @string{WillingerW = "Walter Willinger" } @string{WillsGJ = "Graham J Wills" } @string{WinickJ = "Jared Winick" } @string{WinklerG = "Gerhard Winkler" } @string{WinogradS = "Shmuel Winograd" } @string{WinogradT = "Terry Winograd" } @string{WinskelG = "Glynn Winskel" } @string{WinstanleyA = "Adam Winstanley" } @string{WinterP = "Paul Winter" } @string{WinterS = "Stephan Winter" } @string{WintersSJ = "Steven J. Winters" } @string{WinterT = "Thomas Winter" } @string{WirthA = "Anthony Wirth" } @string{WismathSK = "Stephen K. Wismath" } @string{WoegingerGJ = "Gerhard J. Woeginger" } @string{WolfC = "Christian Wolf" } @string{WolfeP = "Philip Wolfe" } @string{WolffA = "Alexander Wolff" } @string{WolfK = "Katja Wolf" } @string{WolfsonO = "Ouri Wolfson" } @string{WolinskyA = "Asher Wolinsky" } @string{WolkowiczH = "Henry Wolkowicz" } @string{WolleT = "Thomas Wolle" } @string{WolseyLA = "Laurence A. Wolsey" } @string{WongGY = "George Y.\ Wong" } @string{WongJK = "J.K. Wong" } @string{WongKP = "Kit Po Wong" } @string{WoodDR = "David R. Wood" } @string{WoodPT = "Peter T. Wood" } @string{WoolA = "Avishai Wool" } @string{WormaldN = "Nicholas C.\ Wormald" } @string{WormaldNC = "Nicholas C.\ Wormald" } @string{WoutersF = "Fabien Wouters" } @string{WuchtyS = "Stefan Wuchty" } @string{WuF = "Fang Wu" } @string{WuJ = "Jinshan Wu" } @string{WuK = "Kesheng Wu" } @string{WuW = "Weili Wu" } @string{WuYH = "Yun Hui Wu" } @string{WuZ = "Zhenyu Wu" } @string{XiaG = "Ge Xia" } @string{XiaoY = "Yang Xiao" } @string{XieL = "Le Xie" } @string{XieY = "Yinglian Xie" } @string{XingX = "Xin Xing" } @string{XuB = "Bin Xu" } @string{XuD = "Dong Xu" } @string{XueJ = "Jue Xue" } @string{XueminL = "Lin Xuemin" } @string{XuG = "G. Xu" } @string{XuMH = "M. H. Xu" } @string{XuN = "Ning Xu" } @string{XuY = "Ying Xu" } @string{XuZ = "Zhao Xu" } @string{YagiuraM = "Mutsunori Yagiura" } @string{YanagisawaH = "Hiroki Yanagisawa" } @string{YanC = "Cairong Yan" } @string{YangYR = "Yang Richard Yang" } @string{YannakakisM = "Mihalis Yannakakis" } @string{YanX = "Xu Yan" } @string{YaoS = "So-Zen Yao" } @string{YaoY = "Yong Yao" } @string{YapHP = "Hian-Poh Yap" } @string{YatesF = "Frank Yates" } @string{YauS = "S.-T.\ Yau" } @string{YeeN = "Nicholas Yee" } @string{YenH = "Hsu-Chun Yen" } @string{YenJY = "Jin Y. Yen" } @string{YenL = "Luh Yen" } @string{YetukuriL = "Laxman Yetukuri" } @string{YeungRW = "Raymond W. Yeung" } @string{YeZ = "Zhenqing Ye" } @string{YoonCN = "Chang No Yoon" } @string{YoungNE = "Neal E. Young" } @string{YuD = "Dongxiao Yu" } @string{YuH = "Haobo Yu" } @string{YuHai = "Haicong Yu" } @string{YuJ = "Jun Yu" } @string{YuJeff = "Jeffrey Xu Yu" } @string{YuJX = "Jeffrey Xu Yu" } @string{YumTP = "Tak-Shing Peter Yum" } @string{Yun-huaL = "Li Yun-hua" } @string{YungM = "M. Yung" } @string{YuP = "Philip Yu" } @string{YuPS = "Philip S.\ Yu" } @string{YusterR = "Raphael Yuster" } @string{YuX = "Xiangdong Yu" } @string{yworks = "{yWorks GmbH}" } @string{ZabihR = "Ramin Zabih" } @string{ZachariasenM = "Martin Zachariasen" } @string{ZacharyWW = "Wayne W. Zachary" } @string{ZachosS = "Stathis Zachos" } @string{ZadehLA = "Lotfi A. Zadeh" } @string{ZadehN = "Norman Zadeh" } @string{ZahnCT = "C.\ T.\ Zahn" } @string{ZallingerM = "Michael Zallinger" } @string{ZaroliagisC = "Christos Zaroliagis" } @string{ZaversnikM = "Matja{\v z} Zaver{\v s}nik" } @string{ZeggelinkE = "E.P.H. Zeggelink" } @string{ZeguraEW = "Ellen W. Zegura" } @string{ZehaviA = "Avram Zehavi" } @string{ZelenM = "Marvin Zelen" } @string{ZelikovskyA = "Alexander Zelikovsky" } @string{ZelinkaB = "Bohdan Zelinka" } @string{ZeniosSA = "Stefanos A. Zenios" } @string{ZeyBT = "Bernd Thomas Zey" } @string{ZhaH = "Hongyuan Zha" } @string{ZhangA = "Aidong Zhang" } @string{ZhangH = "Honggang Zhang" } @string{ZhangHu = "Huaming Zhang" } @string{ZhangHui = "Hui Zhang" } @string{ZhangJ = "Jun Zhang" } @string{ZhangN = "Nan Zhang" } @string{ZhangP = "Peng Zhang" } @string{ZhangPu = "Pusheng Zhang" } @string{ZhangR = "Rui Zhang" } @string{ZhangY = "Yuanyi Zhang" } @string{ZhangYX = "Y. X. Zhang" } @string{ZhangYy = "Yun Zhang" } @string{ZhaoB = "Baohua Zhao" } @string{ZhaoX = "Xu Zhao" } @string{ZhaoYD = "Yang Dong Zhao" } @string{ZhengAX = "Alice X. Zheng" } @string{ZhengL = "Lanbo Zheng" } @string{ZhengX = "Xiaofei Zheng" } @string{ZhouA = "Aoying Zhou" } @string{ZhouH = "Haijun Zhou" } @string{ZhouJ = "Jiashuai Zhou" } @string{ZhouX = "Xiaofang Zhou" } @string{ZhouY = "Yunhong Zhou" } @string{ZhuB = "Binhai Zhu" } @string{ZickfeldF = "Florian Zickfeld" } @string{ZieglerG = "G{\"u}nter M. Ziegler" } @string{ZijlstraBJH = "Bonne J. H. Zijlstra" } @string{ZijlstraE = "E. Zijlstra" } @string{ZiliaskopoulosA = "Athanasios Ziliaskopoulos" } @string{ZivE = "Etay Ziv" } @string{ZlotowskiO = "Oliver Zlotowski" } @string{ZobristAL = "Albert Lindsey Zobrist" } @string{ZografosKG = "Konstantinos G. Zografos" } @string{ZollingerA = "Aaron Zollinger" } @string{ZubkovR = "Roman Zubkov" } @string{ZuendorfT = "Tobias Z{\"u}ndorf" } @string{ZweigKA = "Katharina A. Zweig" } @string{ZwickU = "Uri Zwick" } %% -------------------------------------------------------------- %% publishers %% -------------------------------------------------------------- @string{pub-acm = "ACM Press" } @string{pub-ams = "American Mathematical Society" } @string{pub-ap = "Academic Press" } @string{pub-apraha = "Academia Praha" } @string{pub-aw = "Addison-Wesley" } @string{pub-birk = "Birkh{\"a}user Verlag" } @string{pub-bsp = "Booksurge Publishing" } @string{pub-ch = "Chapman~\& Hall/CRC" } @string{pub-cp = "Clarendon Press" } @string{pub-csp = "Computer Science Press" } @string{pub-cup = "Cambridge University Press" } @string{pub-cw = "Cohen~\& West LTD" } @string{pub-dp = "Duxbury Press" } @string{pub-freeman = "W.\,H.~Freeman and Company" } @string{pub-gb = "Gordon and Breach" } @string{pub-gmup = "George Mason University Press" } @string{pub-ics = "IEEE Computer Society" } @string{pub-ieeecs = "IEEE Computer Society Press" } @string{pub-jab = "Johann Ambrosius Barth Verlag" } @string{pub-jb = "Jossey Bass" } @string{pub-kapg = "Kluwer Academic Publishers Group" } @string{pub-lb = "Leske und Budrich" } @string{pub-maa = "Mathematical Association of America" } @string{pub-macmillan = "Macmillan" } @string{pub-mc = "Mathematisch Centrum" } @string{pub-mitpr = "MIT Press" } @string{pub-mohr = "J.\,C.\,B.~Mohr" } @string{pub-nauka = "Nauka" } @string{pub-nh = "North-Holland" } @string{pub-norton = "W.\,W.~Norton~\& Company" } @string{pub-oup = "Oxford University Press" } @string{pub-perseus = "Perseus Publishing" } @string{pub-ph = "Prentice Hall" } @string{pub-plenum = "Plenum Press" } @string{pub-pup = "Princeton University Press" } @string{pub-sage = "Sage" } @string{pub-siam = "SIAM" } @string{pub-springer = "Springer" } @string{pub-tjhup = "John Hopkins University Press" } @string{pub-utp = "University of Toronto Press" } @string{pub-wiley = "Wiley" } @string{pub-wileys = "John Wiley~\& Sons, Inc." } @string{pub-wiley-vch = "Wiley-VCH" } @string{pub-physica = "Physica-Verlag GmbH" } @string{pub-c = "Campus" } @string{pub-igi = "IfGI prints" } @string{pub-eup = "Edinburgh University Press" } @string{pub-sdg = "Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany" } @string{pub-cu = "Carleton University" } @string{pub-wsp = "World Scientific Publishing" } @string{pub-ucr = "University of California, Riverside" } @string{pub-bdgh = "Books on Demand GmbH" } @string{pub-ebv = "Elsevier B.V." } @string{pub-v = "Vieweg" } @string{pub-sav = "Spektrum Akademischer Verlag" } @string{pub-t = "Teubner" } @string{pub-usdc = "U.S. Department of the Census" } @string{pub-obl = "Oliver and Boyd, London" } @string{pub-bh = "Butterworth-Heinemann" } @string{pub-cti = "Course Technology Inc" } @string{pub-gp = "Graphics Press" } @string{pub-akpl = "AK Peters, Ltd." } @string{pub-mk = "Morgan Kaufmann" } @string{pub-asa = "American Statistical Association" } @string{pub-ucp = "University of Chicago Press" } @string{pub-uk = "Universit{\"a}tsverlag Karlsruhe" } @string{pub-acsi = "Australian Computer Society, Inc." } @string{pub-mrl = "Microsoft Research Ltd" } @string{pub-ukcrc = "UK Computer Research Committee" } @string{pub-fk = "Feldafinger Kreis" } @string{pub-r = "Ruksaldruck" } @string{pub-k = "K{\"o}nigsdruck" } @string{pub-dlgh = "Druckhaus Locher GmbH" } @string{pub-hniup = "Heinz Nixdorf Institut, Universit{\"at} Paderborn" } @string{pub-nsp = "Nova Science Publisher" } @string{pub-gau = "George Allen~\& Unwin" } @string{pub-vdmvdmk = "VDM Verlag Dr. Mueller e.K." } @string{pub-tdp = "The Dover Publications" } @string{pub-npg = "Nature Publishing Group" } @string{pub-uscb = "U.S. Census Bureau" } @string{pub-spietisoe = "SPIE--The International Society for Optical Engineering" } @string{pub-pie = "Pearson International Edition" } @string{pub-um = "University of Manitoba" } @string{pub-gi = "Gesellschaft f{\"u}r Informatik" } @string{pub-aaaip = "AAAI Press" } @string{pub-witp = "WIT Press" } @string{pub-ccl = "Civil-Comp Ltd." } @string{pub-auaip = "AUAI Press" } @string{pub-smi = "Selbstverlag des Mathematischen Instituts" } @string{pub-trb = "Transportation Research Board" } @string{pub-fvs = "Friedrick Vieweg~\& Son" } @string{pub-sim = "Society for Industrial Mathematics" } @string{pub-ov = "Oldenburg Verlag" } @string{pub-crcp = "CRC Press" } @string{pub-ieee = "IEEE" } @string{pub-wieeep = "Wiley-IEEE Press" } @string{pub-vtug = "Verlag der Technischen Universit{\"a}t Graz" } @string{pub-mghi = "MacGraw-Hill Inc." } %% -------------------------------------------------------------- %% series %% -------------------------------------------------------------- @string{ser-ams_cbms = "CBMS Regional Conference Series in Mathematics" } @string{ser-ann_math_stud = "Annals of Mathematics Studies" } @string{ser-ch_tiss = "Chapman~\& Hall Texts in Statistical Science" } @string{ser-ima = "The IMA Volumes in Mathematics and its Applications" } @string{ser-lms_lns = "London Mathematical Society Lecture Note Series" } @string{ser-mct = "Mathematical Centre Tracts" } @string{ser-msap = "Monographs on Statistics and Applied Probability" } @string{ser-nato_ac = "NATO ASI Series C" } @string{ser-springer_gtm = "Graduate Texts in Mathematics" } @string{ser-springer_lncs = "Lecture Notes in Computer Science" } @string{ser-springer_lnm = "Lecture Notes in Mathematics" } @string{ser-springer_lnp = "Lecture Notes in Physics" } @string{ser-springer_mcs = "Monographs in Computer Science" } @string{ser-springer_stis = "Springer Texts in Statistics" } @string{ser-utp_me = "Mathematical Expositions" } @string{ser-wiley_dmo = "Discrete Mathematics and Optimization" } @string{ser-wiley_ps = "Wiley Series in Probability and Statistics" } @string{ser-dsp = "Dagstuhl Seminar Proceedings" } @string{ser-acm = "Algorithms and Computation in Mathmatics" } @string{ser-sass = "Structural Analysis in the Social Sciences" } @string{ser-csic = "Complex Systems and Interdisciplinary Science" } @string{ser-dimacsb = "DIMACS Book" } @string{ser-gielnilni = "GI-Edition---Lecture Notes in Informatics (LNI)" } @string{ser-entcs = "Electronic Notes in Theoretical Computer Science" } @string{ser-lnee = "Lecture Notes in Electrical Engineering" } @string{ser-bricsds = "BRICS Dissertation Series" } @string{ser-psc = "Princeton Studies in Complexity" } @string{ser-hniv = "HNI-Verlagsschriftenreihe" } @string{ser-wnmc = "Wireless Networks and Mobile Computing" } @string{ser-ms = "Mathematics and Statistics" } @string{ser-mmb = "Methods in Molecular Biology" } @string{ser-gtc = "Graph Theory and Combinatorics" } @string{ser-soia = "Springer Optimization and Its Applications" } @string{ser-oasioasi = "OpenAccess Series in Informatics (OASIcs)" } @string{ser-li = "Leitf{\"a}den der Informatik" } @string{ser-ttcs = "Texts in Theoretical Computer Science" } @string{ser-ema = "Encyclopedia of Mathematics and its Applications" } @string{ser-ewea = "Encyklop{\"a}die der mathematischen Wissenschaften mit Einschluss ihrer Anwendungen" } @string{ser-sscm = "Springer Series in Computational Mathematics" } @string{ser-lnsc = "Lecture Notes Series on Computing" } @string{ser-ac = "Algorithms and Combinatorics" } @string{ser-mmsg = "Mitteilungen aus dem Mathematischen Seminar Giessen" } @string{ser-tacp = "The Art of Computer Programming" } @string{ser-lni = "Lecture Notes in Informatics" } @string{ser-mdma = "Monographs on Discrete Mathematics and Applications" } @string{ser-wisdmo = "Wiley Interscience Series in Discrete Mathematics and Optimization" } @string{ser-is = "Informatik Spektrum" } @string{ser-it = "it--Information Technology" } @string{ser-tggs = "The Graphics Gems Series" } @string{ser-mivt = "Mitteilungen des Institutes f{\"u}r Verbrennungskraftmaschinen und Thermodynamik" } %% -------------------------------------------------------------- %% journals %% -------------------------------------------------------------- @string{dcg = "Discrete and Computational Geometry" } @string{j-abhmsuh = "Abhandlungen aus dem Mathematischen Seminar der Universit{\"a}t Hamburg" } @string{j-ac = "Annals of Combinatorics" } @string{j-acm = "Journal of the ACM" } @string{j-acm-ccr = "ACM SIGCOMM Computer Communication Review" } @string{j-acm-csur = "ACM Computing Surveys" } @string{j-acm-ea = "ACM Journal of Experimental Algorithmics" } @string{j-acm-mccr = "ACM SIGMOBILE Mobile Computing and Communications Review" } @string{j-acm-tchi = "ACM Transactions on Computer-Human Interaction" } @string{j-acm-tms = "ACM Transactions on Mathematical Software" } @string{j-acm-tois = "ACM Transactions on Information Systems" } @string{j-acmta = "ACM Transactions on Algorithms" } @string{j-acmtds = "ACM Transactions on Database Systems" } @string{j-acmtg = "ACM Transactions on Graphics" } @string{j-acmtkdd = "ACM Transactions on Knowledge Discovery from Data" } @string{j-acs = "Advances in Complex Systems" } @string{j-acta-inf = "Acta Informatica" } @string{j-actam = "Acta Mathematica" } @string{j-ai = "Artificial Intelligence" } @string{j-ajm = "American Journal of Mathematics" } @string{j-ajs = "American Journal of Sociology" } @string{j-alg = "Algorithmica" } @string{j-am = "Aequationes Mathematicae" } @string{j-amash = "Acta Mathematica Academiae Scientiarum Hungaricae" } @string{j-amath = "Annals of Mathematics" } @string{j-amb = "Algorithms for Molecular Biology" } @string{j-amc = "Applied Mathematics and Computation" } @string{j-amm = "American Mathematical Monthly" } @string{j-ams = "The Annals of Mathematical Statistics" } @string{j-aor = "Annals of Operations Research" } @string{j-ap = "Advances in Physics" } @string{j-apc = "Applied Physical Sciences" } @string{j-aphch = "Annalen der Physik und Chemie" } @string{j-apjor = "Asia-Pacific Journal of Operational Research (APJOR) " } @string{j-arch-math = "Archiv der Mathematik" } @string{j-arist = "Annual Review of Information Science and Technology" } @string{j-arsc = "Ars Combinatoria" } @string{j-asa = "Journal of the Acoustical Society of America" } @string{j-asms = "Acta Scientiarum Mathematicarum (Szeged)" } @string{j-asr = "American Sociological Review" } @string{j-au = "Algebra Universalis" } @string{j-b = "Bioinformatics" } @string{j-bes = "Behavioral Ecology and Sociobiology" } @string{j-bit = "BIT" } @string{j-bjmsp = "British Journal of Mathematical and Statistical Psychology" } @string{j-bmb = "Bulletin of Mathematical Biophysics" } @string{j-bmcsb = "BMC Systems Biology" } @string{j-bs = "Behavioral Science" } @string{j-bstj = "Bell System Technical Journal" } @string{j-bull-ams = "Bulletin of the American Mathematical Society" } @string{j-bvsawl = "Berichte {\"u}ber die Verhandlungen der S{\"a}chsischen Akademie der Wissenschaften zu Leipzig" } @string{j-c = "Connections" } @string{j-c2 = "Journal of Classification" } @string{j-cagd = "Computer Aided Geometric Design" } @string{j-cam = "Journal of Computational and Applied Mathematics" } @string{j-can-math-bull = "Canadian Mathematical Bulletin" } @string{j-cc = "Competition and Change" } @string{j-ccacaa = "Crotia Chemica ACTA" } @string{j-ccpe = "Concurrency and Computation: Practice and Experience" } @string{j-ccr = "Computer Communication Review" } @string{j-ceus = "Computers, Environment and Urban Systems" } @string{j-cg = "Computational Geometry" } @string{j-cgf = "Computer Graphics Forum" } @string{j-cgta = "Computational Geometry: Theory and Applications" } @string{j-ci = "Computational Intelligence" } @string{j-cjm = "Canadian Journal of Mathematics" } @string{j-cjp = "Canadian Journal of Psychology" } @string{j-cm = "IEEE Communications Magazine" } @string{j-cma = "Computers~\& Mathematics with Applications" } @string{j-cmj = "Czechoslovak Mathematical Journal" } @string{j-cmpan = "Colloquium Mathematicum" } @string{j-cmsjb = "Colloquia Mathematica Societatis J{\'a}nos Bolyai" } @string{j-cmuc = "Commentationes Mathematicae Universitatis Carolinae" } @string{j-cn = "Computer Networks: The International Journal of Computer and Telecommunications Networking" } @string{j-cn_isdn = "Computer Networks and ISDN Systems" } @string{j-coa = "Computational Optimization and Applications" } @string{j-comb = "Combinatorica" } @string{j-comcom = "Computer Communications" } @string{j-comm-acm = "Communications of the ACM" } @string{j-comp = "Journal of Complexity" } @string{j-complexity = "Complexity" } @string{j-comput = "Computing" } @string{j-congr-num = "Congressus Numerantium" } @string{j-const = "Constraints" } @string{j-copr = "Computers~\& Operations Research" } @string{j-copre = "Computers~\\& Operations Research" } @string{j-cor = "Computers~& Operations Research" } @string{j-cpc = "Combinatorics, Probability and Computing" } @string{j-cpm = "{\v C}eskoslovensk{\'a} Akademie V{\v e}d. {\v C}asopis Pro P{\v e}stov{\'a}n{\'i} Matematiky" } @string{j-cse = "Computing in Science and Engineering" } @string{j-csr = "Computer Science Review" } @string{j-css = "Journal of Computer and System Sciences" } @string{j-cviu = "Computer Vision and Image Understanding" } @string{j-cwi-qu = "CWI Quarterly" } @string{j-cwiq = "CWI Quarterly" } @string{j-cy = "Cybernetics" } @string{j-dam = "Discrete Applied Mathematics" } @string{j-dc = "Distributed Computing" } @string{j-dcg = "Discrete {\&} Computational Geometry" } @string{j-dima = "Discrete Mathematics" } @string{j-dm = "Documenta Mathematica" } @string{j-dmgt = "Discussiones Mathematicae Graph Theory" } @string{j-dmtcs = "Discrete Mathematics and Theoretical Computer Science" } @string{j-dmvm = "DMV Mitteilungen" } @string{j-do = "Discrete Optimization" } @string{j-dp = "Der Pathologe" } @string{j-duke-mj = "Duke Mathematical Journal" } @string{j-e = "Econometrica" } @string{j-eacis = "Electronic Articles in Computer and Information Science" } @string{j-ecmo = "Ecological Monographs" } @string{j-eco = "Economic Journal" } @string{j-ecomb = "The Electronic Journal of Combinatorics" } @string{j-eeetits = "EEE Transactions on Intelligent Transportation Systems" } @string{j-ejc = "European Journal of Combinatorics" } @string{j-ejor = "European Journal of Operational Research" } @string{j-em = "Elemente der Mathematik" } @string{j-endima = "Electronic Notes in Discrete Mathematics" } @string{j-entcs = "Electronic Notes in Theoretical Computer Science" } @string{j-epi = "El Profesional de la Informaci'on" } @string{j-epjb = "The European Physical Journal~B" } @string{j-epm = "Educational and Psychological Measurement" } @string{j-es = "Energy Systems" } @string{j-esa = "Expert Systems with Applications" } @string{j-et = "Journal of Economic Theory" } @string{j-expsysapp = "DELETEME" } @string{j-fi = "Fundamenta Informaticae" } @string{j-fm = "Fundamenta Mathematicae" } @string{j-gb = "Genome Biology" } @string{j-gc = "Graphs and Combinatorics" } @string{j-geb = "Games and Economic Behavior" } @string{j-geoi = "GeoInformatica" } @string{j-gi = "Genome Informatics" } @string{j-gr = "Genome Research" } @string{j-ho = "Human Organizations" } @string{j-i = "Inventiones mathematicae" } @string{j-ibioinfo = "Journal of Integrative Bioinformatics" } @string{j-ic = "Information and Computation" } @string{j-ico = "Information and Control" } @string{j-ieeec = "IEEE Computer" } @string{j-ieeedeb = "IEEE Data Engineering Bulletin" } @string{j-ieees = "IEEE Spectrum" } @string{j-ieeetcst = "IEEE Transactions on Control Systems Technology" } @string{j-ieeetim = "IEEE Transactions on Instrumentation and Measurement" } @string{j-ieeetits = "IEEE Transactions on Intelligent Transportation Systems" } @string{j-ieeetmc = "IEEE Transactions on Mobile Computing" } @string{j-ieeetps = "IEEE Transactions on Power Systems" } @string{j-ieeetse = "IEEE Transactions on Software Engineering" } @string{j-ieeetsg = "IEEE Transactions on Smart Grid" } @string{j-ieeetsmc = "IEEE Transactions on Systems, Man and Cybernetics" } @string{j-ieeetsmcpa = "IEEE Transactions on Systems, Man, and Cybernetics, Part A" } @string{j-ieeetssc = "IEEE Transactions on Systems Science and Cybernetics" } @string{j-ieeetwc = "IEEE Transactions on Wireless Communications" } @string{j-ieicetfeccs = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences" } @string{j-ieicetj = "IEICE Transactions Japan" } @string{j-iijci = "Informatica: An International Journal of Computing and Informatics" } @string{j-ijbc = "International Journal of Bifurcation and Chaos " } @string{j-ijc = "International Journal of Control" } @string{j-ijc2 = "Informs Journal on Computing" } @string{j-ijcga = "International Journal of Computational Geometry and Applications" } @string{j-ijcm = "International Journal of Computer Mathematics" } @string{j-ijfcs = "International Journal of Foundations of Computer Science" } @string{j-ijgis = "International Journal of Geographical Information Systems" } @string{j-ijm = "Israel Journal of Mathematics" } @string{j-ijrd = "IBM Journal of Research and Development" } @string{j-ijse = "International Journal of Sustainable Engineering" } @string{j-im = "Internet Mathematics" } @string{j-impc = "International Journal of Modern Physics~C" } @string{j-indmath = "Indagationes Mathematicae" } @string{j-infovis = "Journal of Information Visualization" } @string{j-int = "Integration: The VLSI Journal" } @string{j-ipj = "The Internet Protocol Journal" } @string{j-ipl = "Information Processing Letters" } @string{j-ipm = "Information Processing~\& Management" } @string{j-ir = "Information Retrieval, special issue on Advances in Mathematics/Formal Methods in Information Retrie" } @string{j-ire-tec = "IRE Transaction on Electronic Computers" } @string{j-ire-trans-it = "IRE Transactions on Information Theory" } @string{j-is = "Informatik Spektrum" } @string{j-it = "it---Information Technology" } @string{j-jacs = "Journal of the American Chemical Society" } @string{j-jair = "Journal of Artificial Intelligence Research" } @string{j-jalg = "Journal of Algorithms" } @string{j-jams = "Journal of the American Mathematical Society" } @string{j-jar = "Journal of Anthropological Research" } @string{j-jasa = "Journal of the American Statistical Association" } @string{j-jasist = "Journal of the American Society for Information Science and Technology" } @string{j-jc = "Journal of Classification" } @string{j-jcg = "Journal of Computational Geometry" } @string{j-jcit = "Journal of Computing and Information Technology" } @string{j-jco = "Journal of Combinatorial Optimization" } @string{j-jcombth = "Journal of Combinatorial Theory" } @string{j-jcombthb = "Journal of Combinatorial Theory Series~B" } @string{j-jda = "Journal of Discrete Algorithms" } @string{j-jdmvdmv = "Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV)" } @string{j-jg = "Journal of Geodesy" } @string{j-jgaa = "Journal of Graph Algorithms and Applications" } @string{j-jgo = "Journal of Global Optimization" } @string{j-jgt = "Journal of Graph Theory" } @string{j-jiis = "Journal of Intelligent Information Systems" } @string{j-jip = "Journal of Information Processing" } @string{j-jits = "Journal of Intelligent Transportation Systems" } @string{j-jlms = "Journal of the London Mathematical Society" } @string{j-jma = "Journal of Multivariate Analysis" } @string{j-jmp = "Journal of Mathematical Psychology" } @string{j-jms = "Journal of Mathematical Sociology" } @string{j-jorsj = "Journal of the Operations Research Society of Japan " } @string{j-jpp = "Journal of Parallel Programming" } @string{j-jrsssb = "Journal of the Royal Statistical Society, Series~B" } @string{j-js = "Journal of Scheduling" } @string{j-jsac = "IEEE Journal on Selected Areas in Communications" } @string{j-jsbs = "Journal of Social and Biological Structures" } @string{j-jsc = "Journal of Symbolic Computation" } @string{j-jsp = "Journal of Statistical Physics" } @string{j-jtb = "Journal of Theoretical Biology" } @string{j-jtp = "Journal of Theoretical Politics" } @string{j-jtrb = "Journal of the Transportation Research Board" } @string{j-kcdu = "Knowledge: Creation, Diffusion, Utilization" } @string{j-kdb = "Knowledge Discovery in Bioinformatics" } @string{j-kis = "Knowledge and Information Systems" } @string{j-l = "Language: Journal of the Linguistic Society of America" } @string{j-laa = "Linear Algebra and its Applications" } @string{j-m = "Methodology" } @string{j-ma = "Machine Learning" } @string{j-maa = "Journal of Mathematical Analysis and Applications" } @string{j-matchcmcc = "MATCH - Communications in Mathematical and in Computer Chemistry" } @string{j-math-prog-a = "Mathematical Programming, Series~A" } @string{j-mathann = "Mathematische Annalen" } @string{j-mathematika = "Mathematika" } @string{j-mb = "Mathematica Bohemica" } @string{j-mc = "Mathematics of Computation" } @string{j-mcs = "Mathematics in Computer Science" } @string{j-mfl = "Matematikai {\'e}s Fizikai Lapok" } @string{j-ml = "Journal of Machine Learning" } @string{j-mmj = "Michigan Mathematical Journal" } @string{j-mmor = "Mathematical Methods of Operations Research" } @string{j-mms = "Multiscale Modeling and Simulation" } @string{j-mna = "Mobile Networks and Applications" } @string{j-moor = "Mathematics of Operations Research" } @string{j-mor = "Methods of Operations Research" } @string{j-mos = "Mathematische Operationsforschung Statistik" } @string{j-mp = "Mathematical Programming" } @string{j-mpcps = "Mathematical Proceedings of the Cambridge Philosophical Society" } @string{j-ms = "Mathematica Slovaca" } @string{j-msc = "Mathematica Scandinavica" } @string{j-msci = "Management Science" } @string{j-msr = "Sociological Methods and Research" } @string{j-mss = "Mathematical Social Sciences" } @string{j-mst = "Mathematical Systems Theory" } @string{j-mussrs = "Mathematics of the USSR - Sbornik" } @string{j-nar = "Nucleic Acids Research" } @string{j-nationalb = "Journal of National Bureau of Standards" } @string{j-nature = "Nature" } @string{j-nb = "Nature Biotechnology" } @string{j-ncasp = "Novi commentarii academiae scientiarum Petropolitaenae" } @string{j-netnomics = "Netnomics" } @string{j-networks = "Networks" } @string{j-nips = "Advances in Neural Information Processing Systems" } @string{j-njc = "Nordic Journal of Computing" } @string{j-njp = "New Journal of Physics" } @string{j-nn = "Neural Networks" } @string{j-nns = "coNNectionS" } @string{j-nrdd = "Nature Reviews Drug Discovery" } @string{j-nrlq = "Naval Research Logistics Quarterly" } @string{j-nsr = "Nature Scientific Reports" } @string{j-nummat = "Numerische Mathematik" } @string{j-or = "Operations Research" } @string{j-order = "ORDER" } @string{j-orl = "Operations Research Letter" } @string{j-ors = "OR Spectrum" } @string{j-p = "Proteomics" } @string{j-pams = "Proceedings of the American Mathematical Society" } @string{j-patrl = "Pattern Recognition Letters" } @string{j-pc = "Parallel Computing" } @string{j-pdc = "Journal of Parallel and Distributed Computing" } @string{j-pdnp = "Physica D: Nonlinear Phenomena" } @string{j-phre = "Physical Review~E" } @string{j-phrl = "Physical Review Letters" } @string{j-physa = "Physica~A" } @string{j-pjm = "Pacific Journal of Mathematics" } @string{j-plms = "Proceedings of the London Mathematical Society" } @string{j-plsone = "PLoS ONE" } @string{j-pmd = "Publicationes Mathematicae Debrecen" } @string{j-pnas = "Proceedings of the National Academy of Science of the United States of America" } @string{j-ppl = "Parallel Processing Letters" } @string{j-pr = "Physics Reports" } @string{j-pr-e = "Physical Review E" } @string{j-psy = "Psychometrika" } @string{j-psyt = "Psychology Today" } @string{j-pt = "Public Transport" } @string{j-qa = "Journal of Quantitative Anthropology" } @string{j-qam = "Quarterly of Applied Mathematics" } @string{j-qq = "Quality and Quantity" } @string{j-r = "Release 1.0" } @string{j-ram = "Journal der reinen und angewandten Mathematik" } @string{j-rmp = "Reviews of Modern Physics" } @string{j-rp = "Research Policy" } @string{j-rsa = "Randoms Structures and Algorithms" } @string{j-sc = "Journal of Symbolic Computation" } @string{j-science = "Science" } @string{j-sf = "Social Forces" } @string{j-siam = "Journal of the Society for Industrial and Applied Mathematics" } @string{j-siamjadm = "SIAM Journal on Algebraic and Discrete Methods" } @string{j-sicomp = "SIAM Journal on Computing" } @string{j-sidma = "SIAM Journal on Discrete Mathematics" } @string{j-sigact-news = "ACM SIGACT News" } @string{j-sijam = "SIAM Journal on Applied Mathematics" } @string{j-sisccomp = "SIAM Journal on Scientific Computing" } @string{j-sjmaa = "SIAM Journal on Matrix Analysis and Applications" } @string{j-sm = "Sociological Methodology" } @string{j-smr = "Sociological Methods and Research" } @string{j-smte = "Journal of Statistical Mechanics: Theory and Experiment" } @string{j-sn = "Social Networks" } @string{j-socm = "Sociometry" } @string{j-sov-math-dokl = "Soviet Mathematics-Doklady" } @string{j-spe = "Software - Practice and Experience" } @string{j-sr = "SIAM Review" } @string{j-ss = "Journal of Social Structure" } @string{j-ssc = "Statistics and Computing" } @string{j-ssr = "Sociology and Social Research" } @string{j-ssre = "Social Science Research" } @string{j-t = "Telektronikk" } @string{j-tams = "Transactions of the American Mathematical Society" } @string{j-tasm = "Technology Analysis and Strategic Management" } @string{j-tc = "IEEE Transactions on Computers" } @string{j-tcj = "The Computer Journal" } @string{j-tcs = "Theoretical Computer Science" } @string{j-tct = "IEEE Transactions on Circuit Theory" } @string{j-tej = "The Economic Journal" } @string{j-tinfth = "IEEE Transactions on Information Theory" } @string{j-tis = "IEICE Transactions on Information and Systems" } @string{j-tit = "ACM Transactions on Internet Technology" } @string{j-tkde = "IEEE Transactions on Knowledge and Data Engineering" } @string{j-tob = "Trends in Organizational Behavior" } @string{j-toc = "IEEE Transactions on Communications" } @string{j-tocs = "Theory of Computing Systems " } @string{j-ton = "IEEE/ACM Transactions on Networking" } @string{j-tpa = "Theory of Probability and its Applications" } @string{j-tpami = "IEEE Transactions on Pattern Analysis and Machine Intelligence" } @string{j-tr = "IEEE Transactions on Reliability" } @string{j-tr-ec = "IEEE Transactions on Electronic Computers" } @string{j-trpbm = "Transportation Research Part B: Methodological" } @string{j-ts = "Transportation Science" } @string{j-tsq = "The Sociological Quarterly" } @string{j-tsy = "Telecommunication Systems" } @string{j-tvcg = "IEEE Transactions on Visualization and Computer Graphics" } @string{j-vlsid = "VLSI Design" } @string{j-wzthi = "Wissenschaftliche Zeitschrift, Technische Hochschule Ilmenau" } @string{j-zpmfu = "Zeitschrift zur Pflege der Mathematik und zur F{\"o}rderung des mathematisch-physikalischen Unterric" } @string{NHM = "Networks and Heterogeneous Media" } %% -------------------------------------------------------------- %% conference proceedings %% -------------------------------------------------------------- @string{proc-aaai-11 = "Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence" } @string{proc-aaai-12 = "Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence" } @string{proc-aaai-13 = "Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence" } @string{proc-aaim-07 = "Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07)" } @string{proc-aaim-08 = "Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08)" } @string{proc-aaim-09 = "Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09)" } @string{proc-aaim-10 = "Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'10)" } @string{proc-aaim-11 = "Proceedings of the 7th International Conference on Algorithmic Aspects in Information and Management (AAIM'11)" } @string{proc-acmgis-10 = "Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems" } @string{proc-acmgis-11 = "Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems" } @string{proc-acsc-05 = "Proceedings of the Twenty-eighth Australasian conference on Computer Science" } @string{proc-afips-67 = "AFIPS'67 (Spring): Proceedings of the April 18-20, 1967, spring joint computer conference" } @string{proc-aiide-10 = "Proceedings of the 6th Artificial Intelligence for Interactive Digital Entertainment Conference (AIIDE'10)" } @string{proc-aiide-11 = "Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'11)" } @string{proc-alenex-01 = "Proceedings of the 3rd International Workshop on Algorithm Engineering and Experiments (ALENEX'01)" } @string{proc-alenex-02 = "Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)" } @string{proc-alenex-04 = "Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)" } @string{proc-alenex-05 = "Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05)" } @string{proc-alenex-06 = "Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)" } @string{proc-alenex-07 = "Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)" } @string{proc-alenex-08 = "Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08)" } @string{proc-alenex-09 = "Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09)" } @string{proc-alenex-10 = "Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10)" } @string{proc-alenex-11 = "Proceedings of the 13th Workshop on Algorithm Engineering and Experiments (ALENEX'11)" } @string{proc-alenex-12 = "Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)" } @string{proc-alenex-13 = "Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX'13)" } @string{proc-alenex-99 = "Selected Papers from the 1st International Workshop on Algorithm Engineering and Experimentation (ALENEX'99)" } @string{proc-alex-98 = "Proceedings of Algorithms and Experiments (ALEX'98)" } @string{proc-algosensors-08 = "Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08)" } @string{proc-algosensors-09 = "Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)" } @string{proc-algosensors-10 = "Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)" } @string{proc-algosensors-11 = "Proceedings of the 7th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'11)" } @string{proc-algosensors-13 = "Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS'13)" } @string{proc-analco-10 = "Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO '10)" } @string{proc-analco-11 = "Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO '11)" } @string{proc-approx-00 = "Proceedings of the 3rd International Workshop on Approximatin Algorithms for Combinatorial Optimizat" } @string{proc-approx-98 = "Proceedings of the 1st International Workshop on Approximatin Algorithms for Combinatorial Optimizat" } @string{proc-apscc-07 = "Proceedings of the 2nd IEEE Asia-Pacific Service Computing Conference (APSCC)" } @string{proc-apvis-07 = "Asia-Pacific Symposium on Visualisation 2007 (APVIS'07)" } @string{proc-apweb-08 = "Proceedings of the 10th Asia-Pacific Web Conference" } @string{proc-asonam-12 = "Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining" } @string{proc-atmos-01 = "Proceedings of the 1st Workshop on Algorithmic MeThods and Models for Optimization of RailwayS (ATMOS'01)" } @string{proc-atmos-02 = "Proceedings of the 2nd Workshop on Algorithmic MeThods and Models for Optimization of RailwayS (ATMOS'02)" } @string{proc-atmos-03 = "Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)" } @string{proc-atmos-05 = "Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)" } @string{proc-atmos-07 = "Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)" } @string{proc-atmos-08 = "Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)" } @string{proc-atmos-09 = "Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)" } @string{proc-atmos-10 = "Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10)" } @string{proc-atmos-11 = "Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)" } @string{proc-atmos-12 = "Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12)" } @string{proc-aussois-01 = "Proceedings of the 5th International Workshop on Combinatorial Optimization (Aussois'2001)" } @string{proc-avi-02 = "Proceedings of the 6th Working Conference on Advanced Visual Interfaces (AVI'02)" } @string{proc-bcc-79 = "Proceedings of the 7th British Combinatorial Conference" } @string{proc-bsmsp-67 = "Fifth Berkeley Symposium on Mathematical Statistics and Probability" } @string{proc-ccc-84 = "Cambridge Combinatorial Conference in honor of Paul Erdos" } @string{proc-cccg-07 = "Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG '07)" } @string{proc-cccg-10 = "Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG '10)" } @string{proc-cccg-11 = "Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11)" } @string{proc-ccn-02 = "Proceedings of the IASTED International Conference on Communications and Computer Networks" } @string{proc-ccss-72 = "Courant Computer Science Symposium~9: Combinatorial Algorithms (1972)" } @string{proc-cecnet-12 = "2nd International Conference on Consumer Electronics, Communications and Networks" } @string{proc-cg-91 = "Proceedings of Compugraphics '91" } @string{proc-chi-06 = "Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI'06)" } @string{proc-ciac-03 = "Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC'03)" } @string{proc-ciac-06 = "Proceedings of the 6th Conference on Algorithms and Complexity (CIAC'06)" } @string{proc-ciac-10 = "Proceedings of the 7th Conference on Algorithms and Complexity (CIAC'10)" } @string{proc-ciac-13 = "Proceedings of the 8th Conference on Algorithms and Complexity" } @string{proc-cikm-96 = "Proceedings of the 5th International Conference on Information and Knowledge Management" } @string{proc-cikm-98 = "Proceedings of the 7th International Conference on Information and Knowledge Management" } @string{proc-cocc-72 = "Complexity of Computer Computations" } @string{proc-cocoa-07 = "Proceedings of the 1st International Conference on Combinatorial Optimization and Applications" } @string{proc-cocoon-01 = "Proceedings of the 7th Annual International Conference on Computing Combinatorics (COCOON'01)" } @string{proc-cocoon-02 = "Proceedings of the 8th Annual International Conference on Computing Combinatorics (COCOON'02)" } @string{proc-cocoon-03 = "Proceedings of the 9th Annual International Conference on Computing Combinatorics (COCOON'03)" } @string{proc-cocoon-05 = "Proceedings of the 11th Annual International Conference on Computing Combinatorics (COCOON'05)" } @string{proc-cocoon-11 = "Proceedings of the 17th Annual International Conference on Computing Combinatorics (COCOON'11)" } @string{proc-cocoon-99 = "Proceedings of the 5th Annual International Conference on Computing Combinatorics (COCOON'99)" } @string{proc-colt-03 = "Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, Proceedings" } @string{proc-comprail-98 = "Proceedings of the 6th international conference on computer aided design, manufacture and operations in the railway and other mass transit systems" } @string{proc-cosit-93 = "Proceedings of the European Conference on Spatial Information Theory (COSIT'93)" } @string{proc-cpm-04 = "Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM'04)" } @string{proc-cs-87 = "Proceedings of the 20th IEEE International Symposium on Circuits and Systems 1987" } @string{proc-cwmu-68 = "The Many Facets of Graph Theory" } @string{proc-dac-65 = "Proceedings of the SHARE design automation project (DAC'65)" } @string{proc-dac-82 = "Proceedings of the 19th ACM/IEEE Conference on Design Automation" } @string{proc-dac-93 = "Proceedings of the 30th ACM/IEEE Conference on Design Automation" } @string{proc-dac-95 = "Proceedings of the 32nd ACM/IEEE Conference on Design Automation" } @string{proc-dcoss-11 = "Proceedings of the 2011 International Conference on Distributed Computing in Sensor Systems" } @string{proc-dcoss-12 = "Proceedings of the 2012 International Conference on Distributed Computing in Sensor Systems" } @string{proc-delis-final07 = "Proceedings of the Final Workshop of DELIS" } @string{proc-dialm-pomc-05 = "DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computing" } @string{proc-dialm-pomc-08 = "Proceedings of the 2008 joint workshop on Foundations of Mobile Computing" } @string{proc-dimacs-06 = "The Shortest Path Problem: Ninth DIMACS Implementation Challenge -" } @string{proc-dimacs-12 = "Graph Partitioning and Graph Clustering: Tenth DIMACS Implementation Challenge" } @string{proc-dimacs-98 = "Data Structures, Near Neighbor Searches, and Methodology: Proceedings of the Fifth and Sixth DIMACS Implementation Challenges" } @string{proc-disc-12 = "Proceedings of the 26th International Symposium on Distributed Computing" } @string{proc-dm-05 = "Proceedings of the Fifth SIAM International Conference on Data Mining" } @string{proc-dm-07 = "Proceedings of the 2007 SIAM International Conference on Data Mining" } @string{proc-dm-08 = "Proceedings of the 2008 SIAM International Conference on Data Mining" } @string{proc-dmsn-06 = "Proceedings of the 3rd Workshop on Data Management for Sensor Networks (DMSN'06)" } @string{proc-eccs-06 = "Proceedings of the European Conference of Complex Systems (ECCS'06)" } @string{proc-eccs-07 = "Proceedings of the European Conference of Complex Systems (ECCS'07)" } @string{proc-ecml-05 = "Proceedings of the 16th European Conference on Machine Learning" } @string{proc-edbt-09 = "Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT '09)" } @string{proc-esa-01 = "Proceedings of the 9th Annual European Symposium on Algorithms (ESA'01)" } @string{proc-esa-02 = "Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)" } @string{proc-esa-03 = "Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)" } @string{proc-esa-04 = "Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04)" } @string{proc-esa-05 = "Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05)" } @string{proc-esa-06 = "Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06)" } @string{proc-esa-07 = "Proceedings of the 14th Annual European Symposium on Algorithms (ESA'07)" } @string{proc-esa-08 = "Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)" } @string{proc-esa-09 = "Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09)" } @string{proc-esa-10 = "Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10)" } @string{proc-esa-12 = "Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)" } @string{proc-esa-13 = "Proceedings of the 21st Annual European Symposium on Algorithms (ESA'13)" } @string{proc-esa-93 = "Proceedings of the 1st European Symposium on Algorithms (ESA'93)" } @string{proc-esa-94 = "Proceedings of the 2nd Annual European Symposium on Algorithms (ESA'94)" } @string{proc-esa-96 = "Proceedings of the 4th Annual European Symposium on Algorithms (ESA'96)" } @string{proc-esa-97 = "Proceedings of the 5th Annual European Symposium on Algorithms (ESA'97)" } @string{proc-esa-98 = "Proceedings of the 6th Annual European Symposium on Algorithms (ESA'98)" } @string{proc-esa-99 = "Proceedings of the 7th Annual European Symposium on Algorithms (ESA'99)" } @string{proc-esann-05 = "Proceedings of the 13th European Symposium on Artifical Neural Networks" } @string{proc-eurocg-07 = "Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07)" } @string{proc-eurocg-08 = "Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)" } @string{proc-eurocg-10 = "Proceedings of the 26th European Workshop on Computational Geometry (EuroCG'10)" } @string{proc-eurocg-11 = "Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11)" } @string{proc-eurocg-12 = "Proceedings of the 28th European Workshop on Computational Geometry (EuroCG'12)" } @string{proc-eurocg-13 = "Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)" } @string{proc-eurolio-12 = "Geography of Innovation 2012" } @string{proc-ewcg-05 = "Proceedings of the 21st European Workshop on Computational Geometry (EWCG'05)" } @string{proc-focs-00 = "Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00)" } @string{proc-focs-01 = "Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'01)" } @string{proc-focs-02 = "Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02)" } @string{proc-focs-03 = "Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03)" } @string{proc-focs-04 = "Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)" } @string{proc-focs-86 = "Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS'86)" } @string{proc-focs-87 = "Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS'87)" } @string{proc-focs-88 = "Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS'88)" } @string{proc-focs-89 = "Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89)" } @string{proc-focs-90 = "Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90)" } @string{proc-focs-91 = "Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)" } @string{proc-focs-92 = "Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'92)" } @string{proc-focs-93 = "Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS'93)" } @string{proc-focs-94 = "Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS'94)" } @string{proc-focs-96 = "Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS'96)" } @string{proc-focs-98 = "Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98)" } @string{proc-fomc-12 = "The Eighth ACM International Workshop on Foundations of Mobile Computing" } @string{proc-fsci-04 = "Proceedings of the 14th Workshop Fuzzy-Systeme und Computational Intelligence" } @string{proc-fsttcs-01 = "Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science" } @string{proc-gcsg-80 = "Proceedings of the First General Conference on Social Graphics" } @string{proc-gd-00 = "Proceedings of the 8th International Symposium on Graph Drawing (GD'00)" } @string{proc-gd-01 = "Proceedings of the 9th International Symposium on Graph Drawing (GD'01)" } @string{proc-gd-02 = "Proceedings of the 10th International Symposium on Graph Drawing (GD'00)" } @string{proc-gd-03 = "Proceedings of the 11th International Symposium on Graph Drawing (GD'03)" } @string{proc-gd-04 = "Proceedings of the 12th International Symposium on Graph Drawing (GD'04)" } @string{proc-gd-05 = "Proceedings of the 13th International Symposium on Graph Drawing (GD'05)" } @string{proc-gd-06 = "Proceedings of the 14th International Symposium on Graph Drawing (GD'06)" } @string{proc-gd-07 = "Proceedings of the 15th International Symposium on Graph Drawing (GD'07)" } @string{proc-gd-08 = "Proceedings of the 16th International Symposium on Graph Drawing (GD'08)" } @string{proc-gd-09 = "Proceedings of the 17th International Symposium on Graph Drawing (GD'09)" } @string{proc-gd-10 = "Proceedings of the 18th International Symposium on Graph Drawing (GD'10)" } @string{proc-gd-11 = "Proceedings of the 19th International Symposium on Graph Drawing (GD'11)" } @string{proc-gd-12 = "Proceedings of the 20th International Symposium on Graph Drawing (GD'12)" } @string{proc-gd-13 = "Proceedings of the 21st International Symposium on Graph Drawing (GD'13)" } @string{proc-gd-94 = "DIAMCS International Workshop" } @string{proc-gd-95 = "Proceedings of the 3rd International Symposium on Graph Drawing (GD'95)" } @string{proc-gd-96 = "Proceedings of the 4th International Symposium on Graph Drawing (GD'96)" } @string{proc-gd-97 = "Proceedings of the 5th International Symposium on Graph Drawing (GD'97)" } @string{proc-gd-98 = "Proceedings of the 6th International Symposium on Graph Drawing (GD'98)" } @string{proc-gd-99 = "Proceedings of the 7th International Symposium on Graph Drawing (GD'99)" } @string{proc-gi-00 = "Ausgezeichnete Informatikdissertationen 2000" } @string{proc-gi-01 = "Ausgezeichnete Informatikdissertationen 2001" } @string{proc-gi-02 = "Ausgezeichnete Informatikdissertationen 2002" } @string{proc-gi-03 = "Ausgezeichnete Informatikdissertationen 2003" } @string{proc-gi-04 = "Ausgezeichnete Informatikdissertationen 2004" } @string{proc-gi-05 = "Ausgezeichnete Informatikdissertationen 2005" } @string{proc-gi-06 = "Ausgezeichnete Informatikdissertationen 2006" } @string{proc-gi-07 = "Ausgezeichnete Informatikdissertationen 2007" } @string{proc-gi-08 = "Ausgezeichnete Informatikdissertationen 2008" } @string{proc-gi-09 = "Ausgezeichnete Informatikdissertationen 2009" } @string{proc-gi-10 = "Informatiktage 2010" } @string{proc-gi-10a = "Ausgezeichnete Informatikdissertationen 2010" } @string{proc-gi-11 = "Ausgezeichnete Informatikdissertationen 2011" } @string{proc-gi-99 = "Ausgezeichnete Informatikdissertationen 1999" } @string{proc-giit-05 = "Informatiktage 2005. Fachwissenschaftlicher Informatik-Kongress, 8. und 9. April 2005, Schloss Birlinghoven, Sankt Augustin" } @string{proc-gis-05 = "Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems (GIS'05)" } @string{proc-gis-10 = "Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS'10)" } @string{proc-gisruk-07 = "Proceedings of the 15th Annual Geographic Information Sciences Research Conference UK" } @string{proc-globecom-01 = "IEEE GLOBECOM'01" } @string{proc-globecom-96 = "IEEE GLOBECOM'96" } @string{proc-gs-97 = "Graph Symmetry: Algebraic Methods and Applications" } @string{proc-gsn2006 = "GeoSensor Networks" } @string{proc-gtca-91 = "Graph Theory, Combinatorics and Applications" } @string{proc-hics-00 = "Proceedings of the 33rd Hawaii International Conference on System Sciences" } @string{proc-hpcn-96 = "High-Performance Computing and Networking" } @string{proc-hypertext-03 = "Proceedings of the 14th ACM Conference on Hypertext and Hypermedia" } @string{proc-hypertext-98 = "Proceedings of the 9th ACM Conference on Hypertext and Hypermedia" } @string{proc-iadis-wig-06 = "Proceedings of the 5th IADIS International Conference WWW/Internet Geometry" } @string{proc-icalp-02 = "Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'02)" } @string{proc-icalp-03 = "Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'03)" } @string{proc-icalp-05 = "Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP'05)" } @string{proc-icalp-11 = "Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP'11)" } @string{proc-icalp-13 = "Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)" } @string{proc-icalp-94 = "Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (ICALP'94)" } @string{proc-icalp-95 = "Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP'95)" } @string{proc-icalp-96 = "Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96)" } @string{proc-icalp-98 = "Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98)" } @string{proc-icaps-12 = "Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling" } @string{proc-icaps-13 = "Proceedings of the 23rd International Conference on Automated Planning and Scheduling" } @string{proc-icc-01 = "Proceedings of the IEEE International Conference on Communications 2001" } @string{proc-icc-97 = "Proceedings of the IEEE International Conference on Communications 1997" } @string{proc-iccad-93 = "Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design" } @string{proc-icdcn-10 = "Proceedings of the 11th International Conference on Distributed Computing and Networking " } @string{proc-icdcs-10 = "Proceedings of the 30th International Conference on Distributed Computing Systems" } @string{proc-icdm-01 = "Proceedings of the 2001 IEEE International Conference on Data Mining" } @string{proc-icdm-11 = "Proceedings of the 2011 IEEE International Conference on Data Mining" } @string{proc-icdmw-06 = "Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops" } @string{proc-icdmw-10 = "Data Mining Workshops (ICDMW), 2010 IEEE International Conference on" } @string{proc-icems-05 = "Proceedings of the 8th International Conference on Electrical Machines and Systems (ICEMS'05)" } @string{proc-icl-gnss-12 = "Proceedings of the International Conference on Localization and GNSS (ICL-GNSS '12)" } @string{proc-icml-04 = "Proceedings of the twenty-first international conference on Machine learning" } @string{proc-icml-05 = "Proceedings of the 22nd International Conference on Machine Learning" } @string{proc-ieeei-04 = "Proceedings of the 23rd IEEE Convention of Electrical and Electronics Engineers in Israel" } @string{proc-ifip-92 = "Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92" } @string{proc-iics-02 = "Proceedings of the 2nd International Workshop on Innovative Internet Computing Systems" } @string{proc-ijcai-01 = "Proceedings of the 17th international joint conference on artificial intelligence" } @string{proc-infocom-00 = "Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" } @string{proc-infocom-01 = "Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" } @string{proc-infocom-02 = "Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" } @string{proc-infocom-03 = "Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" } @string{proc-infocom-05 = "Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" } @string{proc-infocom-06 = "Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" } @string{proc-infocom-97 = "Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" } @string{proc-infovis-02 = "Proceedings of the 2002 IEEE Symposium on Information Visualization" } @string{proc-ipco-07 = "Proceedings of the 12th Integer Programming and Combinatorial Optimization Conference" } @string{proc-ipdps-04 = "18th International Parallel and Distributed Processing Symopsium (IPDPS'04)" } @string{proc-ipdps-06 = "20th International Parallel and Distributed Processing Symopsium (IPDPS'06)" } @string{proc-ipdps-08 = "22nd International Parallel and Distributed Processing Symposium (IPDPS'08)" } @string{proc-ipdps-09 = "23rd International Parallel and Distributed Processing Symposium (IPDPS'09)" } @string{proc-ipdps-10 = "24th International Parallel and Distributed Processing Symposium (IPDPS'10)" } @string{proc-ipdps-11 = "25th International Parallel and Distributed Processing Symposium (IPDPS'11)" } @string{proc-ipin-10 = "Proceedings of the 2010 International Conference on Indoor Positioning and Indoor Navigation (IPIN'10)" } @string{proc-ipps-98-ws = "Parallel and Distributed Processing---10th International IPPS/SPDP'98 Workshops" } @string{proc-ips-04 = "IPS 2004 -- Inter-Domain Performance and Simulation" } @string{proc-ipsn-04 = "Third International Symposium on Information Processing in Sensor Networks (IPSN 2004)" } @string{proc-ipsn-05 = "Fourth International Symposium on Information Processing in Sensor Networks (IPSN 2005)" } @string{proc-ipsn-06 = "Fifth International Conference on Information Processing in Sensor Networks (IPSN 2006)" } @string{proc-ipsn-07 = "Sixth International Symposium on Information Processing in Sensor Networks (IPSN 2007)" } @string{proc-ipst-13 = "Proceedings of the International Conference on Power Systems Transients (IPST'13)" } @string{proc-isa-91 = "Proceedings of the 2nd International Symposium on Algorithms (ISA'91)" } @string{proc-isaac-00 = "Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'00)" } @string{proc-isaac-04 = "Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'04)" } @string{proc-isaac-07 = "Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC'07)" } @string{proc-isaac-08 = "Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08)" } @string{proc-isaac-09 = "Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09)" } @string{proc-isaac-11 = "Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11)" } @string{proc-isaac-12 = "Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)" } @string{proc-isaac-92 = "Proceedings of the 3rd International Symposium on Algorithms and Computation (ISAAC'92)" } @string{proc-isaac-93 = "Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93)" } @string{proc-isaac-98 = "Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98)" } @string{proc-istg-66 = "Proceedings of the International Symposium on the Theory of Graphs" } @string{proc-it-11 = "Algorithm Engineering" } @string{proc-itcom-01 = "Proceedings of SPIE ITcom'01" } @string{proc-itm-12 = "Proceedings of the 4th TRB Conference on Innovations in Travel Modeling" } @string{proc-its-12 = "the 19th World Congress on Intelligent Transport Systems" } @string{proc-itss-02 = "ITSS 2002: Proceedings of the 5h International Conference on Intelligent Transportation Systems" } @string{proc-itst-12 = "12th International Conference on ITS Telecommunications" } @string{proc-iwcts-12 = "Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science" } @string{proc-iwoca-10 = "Proceedings of the 21st International Workshop on Combinatorial Algorithms" } @string{proc-iwoca-11 = "Proceedings of the 22nd International Workshop on Combinatorial Algorithms" } @string{proc-iwpec-06 = "Parameterized and Exact Computation" } @string{proc-kdd-00 = "Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and Data Mining" } @string{proc-kdd-01 = "Proceedings of the seventh ACM SIGKDD international conference on Knowledge Discovery and Data Mining" } @string{proc-kdd-03 = "Proceedings of the nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" } @string{proc-kdd-04 = "Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" } @string{proc-kdd-05 = "Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" } @string{proc-kdd-06 = "Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" } @string{proc-kdd-07 = "Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" } @string{proc-ki-10 = "Proceedings of the 33rd Annual German Conference on Advances in Artificial Intelligence" } @string{proc-latin-10 = "Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATIN'10)" } @string{proc-latin-98 = "Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98)" } @string{proc-mamus-03 = "Multiagent for Mass User Support - First International Workshop" } @string{proc-mascots-01 = "Proceedings of the 9th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems" } @string{proc-mascots-02 = "Proceedings of the 10th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems" } @string{proc-mascots-07 = "Proceedings of the 15th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems" } @string{proc-mates-09 = "Proceedings of the 7th German Conference on Multiagent System Technologies (MATES 2009)" } @string{proc-mdm-07 = "8th International Conference on Mobile Data Management (MDM 2007)" } @string{proc-medalg-12 = "Proceedings of the 1st Mediterranean Conference on Algorithms" } @string{proc-mfcs-06 = "Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS'06)" } @string{proc-mfcs-93 = "Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS'93)" } @string{proc-milcom-99 = "Proceedings of the IEEE Military Communications Conference (MILCOM'99)" } @string{proc-miw-70 = "Proceedings of the Sixth Annual Machine Intelligence Workshop" } @string{proc-mmcn-02 = "Proceedings of SPIE/ACM Conference on Multimedia Computing and Networking (MMCN) 2002" } @string{proc-mobicom-00 = "Proceedings of the 6th annual international conference on Mobile computing and networking" } @string{proc-mobicom-01 = "Proceedings of the 7th annual international conference on Mobile computing and networking" } @string{proc-mobicom-02 = "Proceedings of the 8th annual international conference on Mobile computing and networking" } @string{proc-mobicom-03 = "Proceedings of the 9th annual international conference on Mobile computing and networking" } @string{proc-mobicom-04 = "Proceedings of the 10th annual international conference on Mobile computing and networking" } @string{proc-mobicom-05 = "Proceedings of the 11th annual international conference on Mobile computing and networking" } @string{proc-mobicom-06 = "Proceedings of the 12th annual international conference on Mobile computing and networking" } @string{proc-mobicom-07 = "Proceedings of the 13th annual international conference on Mobile computing and networking" } @string{proc-mobihoc-03 = "Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03)" } @string{proc-mobihoc-06 = "Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'06)" } @string{proc-mobihoc-08 = "Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'08)" } @string{proc-mtaap-07 = "Workshop on Multithreaded Architectures and Applications (MTAAP 2007)" } @string{proc-networking-02 = "Proceedings of the 2nd International IFIP-TC6 Networking Conference" } @string{proc-nips-01 = "Proceedings of 14th Conference: Neural Information Processing Systems" } @string{proc-nips-02 = "Proceedings of 15th Conference: Neural Information Processing Systems" } @string{proc-nips-03 = "Advances in Neural Information Processing Systems 16" } @string{proc-nips-05 = "Advances in Neural Information Processing Systems 18" } @string{proc-nips-10 = "Advances in Neural Information Processing Systems 23" } @string{proc-nrdm-01 = "Workshop on Network-Related Data Management (NRDM'01)" } @string{proc-paa-04 = "Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures" } @string{proc-pacificvis-08 = "Proceedings of IEEE Pacific Visualization Symposium" } @string{proc-pacificvis-13 = "Proceedings of IEEE Pacific Visualization Symposium" } @string{proc-paris-07 = "Proc. First Int. Workshop on Protocols and Algorithms for Reliable and Data Intensive Sensor Networks (PARIS)" } @string{proc-percomw-06 = "Proc. 4th Annual IEEE Int. Conf. on Pervasive Computing and Communication Workshops (PerCOMW'06)" } @string{proc-pesgm-12 = "Power and Energy Society General Meeting" } @string{proc-podc-09 = "Proceedings of the 28th ACM symposium on Principles of distributed computing" } @string{proc-podc-12 = "Proceedings of the 31th ACM Symposium on Principles of Distributed Computing" } @string{proc-pris-06 = "Proceedings of the 6th International Workshop on Pattern Recognition in Information Systems (PRIS 2006)" } @string{proc-psce-09 = "Power Systems Conference and Exposition (PSCE'09)" } @string{proc-random-02 = "Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM'02)" } @string{proc-sab-06 = "Proc. 9th International Conference on Simulation of Adaptive Behavior" } @string{proc-sawn-06 = "Proceedings of the International Workshop on Self-Assembling Wireless Networks, 2006" } @string{proc-sbac-pad-04 = "Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'04)" } @string{proc-sc-95 = "Proceedings of the 1995 ACM/IEEE conference on Supercomputing (SC'05)" } @string{proc-scg-91 = "Proceedings of the 7th Annual ACM Symposium on Computational Geometry" } @string{proc-scg-98 = "Proceedings of the 14th Annual Symposium on Computational Geometry" } @string{proc-sdm-05 = "Proceedings of the fifth SIAM International Conference on Data Mining" } @string{proc-sdm-07 = "Proceedings of the seventh SIAM International Conference on Data Mining" } @string{proc-sea-09 = "Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)" } @string{proc-sea-10 = "Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)" } @string{proc-sea-11 = "Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)" } @string{proc-sea-12 = "Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)" } @string{proc-sea-13 = "Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)" } @string{proc-seagtc-83 = "Proceedings of the 1st Southeast Asian Graph Theory Colloquium" } @string{proc-secon-06 = "Proceedings of Sensor and Ad Hoc Communications and Networks, 2006. " } @string{proc-sensys-04 = "2nd international conference on Embedded networked sensor systems (SenSys'04)" } @string{proc-si-alenex-08 = "Special issue of the ACM Journal on Experimental Algorithms devoted to selected papers from ALENEX 2008" } @string{proc-si-dae-00 = "Discrete Algorithms Engineering, special issue of the journal Software--Practice and Experience" } @string{proc-si-gd-06 = "Special issue of the Journal of Graph Algorithms and Applications devoted to the 14th International Symposium on Graph Drawing (GD'06)" } @string{proc-si-waa-96 = "Special issue of the journal Algorithmica devoted to the Dagstuhl Workshop on Graph Algorithms and Applications (1996)" } @string{proc-si-waa-98 = "Special issue of the Journal of Graph Algorithms and Applications devoted to the Dagstuhl Workshop on Graph Algorithms and Applications (1998)" } @string{proc-si-wae-00 = "Special issue of the ACM Journal on Experimental Algorithms devoted to the 4th Workshop on Algorithm Engineering (WAE'00)" } @string{proc-si-wg00 = "Special issue of the Journal of Discrete Algorithms devoted to the 26th Workshop on Graph Theoretic Concepts in Computer Science(WG'00)" } @string{proc-sigcomm-03 = "SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications" } @string{proc-sigcomm-99 = "SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication" } @string{proc-sigir-86 = "Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval" } @string{proc-sigmetrics-03 = "SIGMETRICS'03" } @string{proc-sigmod-08 = "Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD'08)" } @string{proc-sigmod-09 = "Proceedings of the 2009 ACM SIGMOD international conference on Management of data (SIGMOD'09)" } @string{proc-sigmod-10 = "Proceedings of the 2010 ACM SIGMOD international conference on Management of data (SIGMOD'10)" } @string{proc-sigmod-11 = "Proceedings of the 2011 ACM SIGMOD international conference on Management of data (SIGMOD'11)" } @string{proc-sigmod-84 = "Proceedings of the 1984 ACM SIGMOD international conference on Management of data" } @string{proc-sigspatial08 = "Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems (GIS '08)" } @string{proc-sigspatial12 = "Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)" } @string{proc-socg-08 = "Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)" } @string{proc-socg-11 = "Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11)" } @string{proc-socg-95 = "Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG'95)" } @string{proc-socg-99 = "Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG'99)" } @string{proc-socs-10 = "Proceedings of the 3rd International Symposium on Combinatorial Search (SoCS'10)" } @string{proc-socs-12 = "Proceedings of the 5th International Symposium on Combinatorial Search (SoCS'12)" } @string{proc-soda-00 = "Proceedings of the 11th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'00)" } @string{proc-soda-01 = "Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)" } @string{proc-soda-02 = "Proceedings of the 13th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'02)" } @string{proc-soda-03 = "Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)" } @string{proc-soda-04 = "Proceedings of the 15th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'04)" } @string{proc-soda-05 = "Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)" } @string{proc-soda-06 = "Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)" } @string{proc-soda-07 = "Proceedings of the 18th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'07)" } @string{proc-soda-08 = "Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)" } @string{proc-soda-09 = "Proceedings of the 20st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'09)" } @string{proc-soda-10 = "Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)" } @string{proc-soda-11 = "Proceedings of the 22nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'11)" } @string{proc-soda-12 = "Proceedings of the 23rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'12)" } @string{proc-soda-13 = "Proceedings of the 24th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'13)" } @string{proc-soda-90 = "Proceedings of the 1st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'90)" } @string{proc-soda-91 = "Proceedings of the 2nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'91)" } @string{proc-soda-92 = "Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)" } @string{proc-soda-93 = "Proceedings of the 4th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'93)" } @string{proc-soda-96 = "Proceedings of the 7th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'96)" } @string{proc-soda-97 = "Proceedings of the 8th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'97)" } @string{proc-soda-98 = "Proceedings of the 9th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'98)" } @string{proc-soda-99 = "Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)" } @string{proc-sofsem-07 = "Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)" } @string{proc-sofsem-09 = "Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09)" } @string{proc-sofsem-11 = "Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11)" } @string{proc-softvis-03 = "Proceedings ACM 2003 Symposium on Software Visualization (SOFTVIS'03)" } @string{proc-spaa-01 = "Proceedings of the 13th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'01)" } @string{proc-spaa-03 = "Proceedings of the 15th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'03)" } @string{proc-spaa-92 = "Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'92)" } @string{proc-spie-7704 = "Proceedings of SPIE 7704: Evolutionary and Bio-Inspired Computation: Theory and Applications IV (2010)" } @string{proc-spire-10 = "Proceedings of the 17th Symposium on String Processing and Information Retrieval (Spire 2010)" } @string{proc-ssg-99 = "Section on Statistical Graphics '99" } @string{proc-stacs-05 = "Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS'05)" } @string{proc-stacs-07 = "Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)" } @string{proc-stacs-10 = "Proceedings of the 27nd International Symposium on Theoretical Aspects of Computer Science (STACS'10)" } @string{proc-stacs-94 = "Proceedings of the 11th International Symposium on Theoretical Aspects of Computer Science (STACS'94)" } @string{proc-stoc-00 = "Proceedings of the 32nd Annual {ACM} Symposium on the Theory of Computing (STOC'00)" } @string{proc-stoc-01 = "Proceedings of the 33rd Annual {ACM} Symposium on the Theory of Computing (STOC'01)" } @string{proc-stoc-03 = "Proceedings of the 35th Annual {ACM} Symposium on the Theory of Computing (STOC'03)" } @string{proc-stoc-04 = "Proceedings of the 36th Annual {ACM} Symposium on the Theory of Computing (STOC'04)" } @string{proc-stoc-07 = "Proceedings of the 39th Annual {ACM} Symposium on the Theory of Computing (STOC'07)" } @string{proc-stoc-08 = "Proceedings of the 40th Annual {ACM} Symposium on the Theory of Computing (STOC'08)" } @string{proc-stoc-09 = "Proceedings of the 41st Annual {ACM} Symposium on the Theory of Computing (STOC'09)" } @string{proc-stoc-11 = "Proceedings of the 43rd Annual {ACM} Symposium on the Theory of Computing (STOC'11)" } @string{proc-stoc-71 = "Proceedings of the 3rd Annual {ACM} Symposium on the Theory of Computing (STOC'71)" } @string{proc-stoc-81 = "Proceedings of the 13th Annual {ACM} Symposium on the Theory of Computing (STOC'81)" } @string{proc-stoc-88 = "Proceedings of the 20th Annual {ACM} Symposium on the Theory of Computing (STOC'88)" } @string{proc-stoc-89 = "Proceedings of the 21th Annual {ACM} Symposium on the Theory of Computing (STOC'89)" } @string{proc-stoc-91 = "Proceedings of the 23rd Annual {ACM} Symposium on the Theory of Computing (STOC'91)" } @string{proc-stoc-92 = "Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'92)" } @string{proc-stoc-93 = "Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)" } @string{proc-stoc-95 = "Proceedings of the 27th Annual {ACM} Symposium on the Theory of Computing (STOC'95)" } @string{proc-stoc-96 = "Proceedings of the 28th Annual {ACM} Symposium on the Theory of Computing (STOC'96)" } @string{proc-stoc-97 = "Proceedings of the 29th Annual {ACM} Symposium on the Theory of Computing (STOC'97)" } @string{proc-stoc-98 = "Proceedings of the 30th Annual {ACM} Symposium on the Theory of Computing (STOC'98)" } @string{proc-stoc-99 = "Proceedings of the 31st Annual {ACM} Symposium on the Theory of Computing (STOC'99)" } @string{proc-supercomp-95 = "Proceedings of the 1995 ACM/IEEE conference on Supercomputing" } @string{proc-swat-00 = "Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT'00)" } @string{proc-swat-02 = "Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT'04)" } @string{proc-swat-04 = "Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04)" } @string{proc-swat-06 = "Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT'06)" } @string{proc-swat-08 = "Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08)" } @string{proc-swat-10 = "Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10)" } @string{proc-swat-12 = "Proceedings of the 13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'12)" } @string{proc-swat-92 = "Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory (SWAT'92)" } @string{proc-tag-76 = "Proceedings of Theory and Applications of Graphs" } @string{proc-tamc-11 = "Proceedings of the 8th annual conference on Theory and applications of models of computation" } @string{proc-tapas-11 = "Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11)" } @string{proc-tc-94 = "Proceedings of the 26th Annual ACM Symposium on Theory of Computing" } @string{proc-tc-97 = "Proceedings of the 29th Annual ACM Symposium on Theory of Computing" } @string{proc-tggt-08 = "Topological & Geometric Graph Theory (TGGT'08)" } @string{proc-tmfogt-68 = "The Many Facets of Graph Theory, Proc." } @string{proc-uai-04 = "UAI'04 Proceedings of the 20th conference on Uncertainty in artificial intelligence" } @string{proc-vast-07 = "IEEE Symposium on Visual Analytics and Technology (VAST 2007)" } @string{proc-vd-05 = "Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering (VD'05)" } @string{proc-view-06 = "Pixelization Paradigm, Revised Selected Papers of the First Visual Information Expert Workshop" } @string{proc-vis-96 = "Proceedings of the 7th IEEE Conference on Visualization '96 (VIS'96)" } @string{proc-vissym-00 = "Proceedings of the 2nd Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym'00)" } @string{proc-vissym-02 = "Proceedings of the 4th Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym '02)" } @string{proc-vl-89 = "IEEE Workshop on Visual Languages" } @string{proc-vldb-03 = "Proceedings of the 29th International Conference on Very Large Databases (VLDB 2003)" } @string{proc-vldb-05 = "Proceedings of the 31st International Conference on Very Large Databases (VLDB 2005)" } @string{proc-vldb-09 = "Proceedings of the 35th International Conference on Very Large Databases (VLDB 2009)" } @string{proc-vldb-11 = "Proceedings of the 37th International Conference on Very Large Databases (VLDB 2011)" } @string{proc-vldb-12 = "Proceedings of the 38th International Conference on Very Large Databases (VLDB 2012)" } @string{proc-vlsi-94 = "Proceedings of the 7th International Conference on VLSI Design" } @string{proc-vnis-91 = "Proceedings of the Vehicle Navigation and Information Systems Conference (VNIS'91)" } @string{proc-vnis-94 = "Proceedings of the Vehicle Navigation and Information Systems Conference (VNSI'94)" } @string{proc-wads-03 = "Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'03)" } @string{proc-wads-05 = "Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS'05)" } @string{proc-wads-07 = "Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS'07)" } @string{proc-wads-09 = "Algorithms and Data Structures, 11th International Symposium (WADS'09)" } @string{proc-wads-11 = "Algorithms and Data Structures, 12th International Symposium (WADS'11)" } @string{proc-wads-13 = "Algorithms and Data Structures, 13th International Symposium (WADS'13)" } @string{proc-wads-91 = "Proceedings of the 2nd International Workshop on Algorithms and Data Structures (WADS'91)" } @string{proc-wads-93 = "Proceedings of the 3rd International Workshop on Algorithms and Data Structures (WADS'93)" } @string{proc-wae-00 = "Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00)" } @string{proc-wae-01 = "Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01)" } @string{proc-wae-99 = "Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE'99)" } @string{proc-walcom-09 = "Proceedings of the 3rd Workshop on Algorithms and Computation (WALCOM'09)" } @string{proc-waw-06 = "Algorithms and Models for the Web-Graph, Proceedings of the 4th International Workshop, WAW 2006" } @string{proc-waw-07 = "Algorithms and Models for the Web-Graph, Proceedings of the 5th International Workshop, WAW 2007" } @string{proc-wcnc-04 = "Proceedings of the Wireless Communications and Networking Conference 2004" } @string{proc-wea-03 = "Proceedings of the 2nd Workshop on Experimental Algorithms (WEA'03)" } @string{proc-wea-04 = "Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04)" } @string{proc-wea-05 = "Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)" } @string{proc-wea-06 = "Proceedings of the 5th Workshop on Experimental Algorithms (WEA'06)" } @string{proc-wea-07 = "Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)" } @string{proc-wea-08 = "Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)" } @string{proc-wg-00 = "Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'00)" } @string{proc-wg-01 = "Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01)" } @string{proc-wg-02 = "Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02)" } @string{proc-wg-03 = "Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)" } @string{proc-wg-04 = "Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)" } @string{proc-wg-05 = "Proceedings of the 31th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05)" } @string{proc-wg-07 = "Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07)" } @string{proc-wg-08 = "Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'08)" } @string{proc-wg-09 = "Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'09)" } @string{proc-wg-10 = "Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10)" } @string{proc-wg-80 = "Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG'80)" } @string{proc-wg-92 = "Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92)" } @string{proc-wg-93 = "Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)" } @string{proc-wg-94 = "Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)" } @string{proc-wg-98 = "Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'98)" } @string{proc-wg-99 = "Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99)" } @string{proc-wiopt-09 = "7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)" } @string{proc-wiopt-10 = "Proceedings of the 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'10)" } @string{proc-wjcc59 = "Proceedings of the Western Joint Computing Conference 1959" } @string{proc-wld-05 = "Proceedings of the 3rd international workshop on Link discovery" } @string{proc-wodes-98 = "Proceedings of the 4th International Workshop on Discrete Event Systems (WODES '98)" } @string{proc-wscg-08 = "Proceedings of the 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG'2008)" } @string{proc-wscg-99 = "Proceedings of the 7th International Conference in Central Europe on Computer Graphics, Visualizati" } @string{proc-wtasa-07 = "Proceedings of the International Workshop on Theoretical and Algorithmic Aspects of Sensor Networks (WTASA'07)" } @string{proc-www-01 = "Proceedings of the 10th International World Wide Web Conference (WWW10)" } @string{proc-www-03 = "Proceedings of the 12th International World Wide Web Conference (WWW12)" } @string{proc-www-08 = "Proceedings of the 17th International World Wide Web Conference (WWW2008)" } @string{proc-www-98 = "Proceedings of the 7th International World Wide Web Conference (WWW7)" } @string{proc-www-99 = "Proceedings of the 8th International World Wide Web Conference (WWW8)" } %% -------------------------------------------------------------- %% publications %% -------------------------------------------------------------- %% -------------------------------------------------------------- @Book{-ai-12 , title = {{Ausgezeichnete Informatikdissertationen 2011}} , booktitle = {{Ausgezeichnete Informatikdissertationen 2011}} , series = ser-lni , volume = {D-12} , year = 2012 } @Book{-cf-84 , title = {{Coxeter-Festschrift}} , booktitle = {{Coxeter-Festschrift}} , publisher = pub-smi , series = ser-mmsg , volume = 3 , year = 1984 } @Book{-crvi-98 , title = {{Computers in Railways VI}} , booktitle = {{Computers in Railways VI}} , publisher = pub-witp , year = 1998 } @misc{-cssld-08 , title = {{CiteSeer, Scientific Literature Digital Library}} , note = {\url{citeseer.ist.psu.edu}} , url = "citeseer.ist.psu.edu" , year = 2008 } @misc{-ddiki-11 , title = {{Dynamic network of email communication at the Department of Informatics at Karlsruhe Institute of Technology (KIT)}} , note = {Data collected, compiled and provided by Robert G\"orke and Martin Holzer of ITI Wagner and by Olaf Hopp, Johannes Theuerkorn and Klaus Scheibenberger of ATIS, all at KIT. i11www.iti.kit.edu/projects/spp1307/emaildata} , year = 2011 } @misc{-dimac-11 , title = {{10th DIMACS Implementation Challenge -- Graph Partitioning and Graph Clustering}} , note = {http://www.cc.gatech.edu/dimacs10/} , year = 2011 } @misc{-lemon-11 , title = {{LEMON Graph Library}} , note = {http://lemon.cs.elte.hu/trac/lemon/} , year = 2011 } @misc{-lwa-08 , title = {{Laboratory for Web Algorithmics}} , institution = "Universit{\`a} degli studi di Milano" , note = {\url{law.dsi.unimi.it}} , school = "Dipartimento di Scienze dell'Informazione (DSI)" , url = "aw.dsi.unimi.it" , year = 2008 } @misc{-pvnla-98 , title = {{Plankton: Visualizing NLANR's Web Cache Hierarchy}} , url = "http://www.caida.org/tools/visualization/plankton/" , year = 1998 } @misc{-xp-09 , title = {{arXiv.org e-Print archive}} , institution = "Cornell University Library" , url = "http://arxiv.org/" , year = 2009 } %% -------------------------------------------------------------- @InProceedings{258641 , author = RazR #and# SafraS , title = {{A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP}} , booktitle = {{Proceedings of the 29th Annual {ACM} Symposium on the Theory of Computing (STOC'97)}} , publisher = pub-ap , year = 1997 } %% -------------------------------------------------------------- @techreport{ARRIVAL-TR-0097 , author = BergerAndre #and# HoffmannRalf #and# LorenzU #and# StillerS , title = {{Online Delay Management: PSPACE Hardness and Simulation}} , institution = "ARRIVAL Project" , number = 0097 , year = 2007 } %% -------------------------------------------------------------- @misc{CAIDA , author = Caida , title = {{\url{http://www.caida.org/}}} , year = 2008 } %% -------------------------------------------------------------- @misc{DBLP , title = {{DBLP - Digital Bibliography and Library Project}} , note = {\url{http://dblp.uni-trier.de/}} , year = 2007 } @InProceedings{DHSS09 , author = DollevoetT #and# HuismanD #and# SchmidtM #and# SchoebelA , title = {{Delay Management with Re-Routing of Passengers}} , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}} , pages = {1--17} , series = ser-oasioasi , year = 2009 } @misc{DIMES , title = {{DIMES -- Distributed Internet MEasurements \& Simulations}} , key = "DIMES" , url = "http://www.netdimes.org/" } %% -------------------------------------------------------------- @misc{GTK-Gnutella , title = {{GTK-Gnutella}} , key = "GTK-Gnutella" , url = "http://gtk-gnutella.sourceforge.net/" } @Article{GiSc07 , author = GinkelA #and# SchoebelA , title = {{To wait or not to wait? The bicriteria delay management problem in public transportation}} , journal = j-ts , number = 4 , pages = {527--538} , volume = 41 , year = 2007 } @InCollection{Gov98b , author = GoverdeR , title = {{The Max-Plus Algebra Approach to Railway Timetable Design }} , booktitle = {{Computers in Railways VI}} , pages = {339--350} , publisher = pub-witp , year = 1998 } @InProceedings{Gov98bOLD , author = GoverdeR , title = {{The max-plus algebra approach to railway timetable design}} , pages = {339--350} } %% -------------------------------------------------------------- @misc{IGRAPH , author = CsardiG #and# NepuszT , title = {{The igraph Library for Complex Network Research}} , note = {\url{http://igraph.sourceforge.net/index.html}} , url = "http://igraph.sourceforge.net/index.html" , year = 2008 } %% -------------------------------------------------------------- @misc{Routeviews , author = oregon , title = {{\url{http://www.routeviews.org/}}} , year = 2008 } %% -------------------------------------------------------------- @InCollection{SMBG01 , author = SuhlL #and# MellouliT #and# BiederbickC , title = {{Managing and preventing delays in railway traffic}} , booktitle = {{Mathematical methods on Optimization in Transportation Systems}} , pages = {3--16} , year = 2001 } @Article{Sch06b , author = SchoebelA , title = {{Capacity constraints in delay management}} , journal = j-pt , number = 2 , pages = {135--154} , volume = 1 , year = 2009 } @misc{Slyck , title = {{Slyck}} , key = "Slyck" , url = "http://www.slyck.com/" } %% -------------------------------------------------------------- @techreport{TR-mw-aesgp-11 , author = MeinertS #and# WagnerD , title = {{An Experimental Study on Generating Planar Graphs }} , institution = kit_wagner , note = {Karlsruhe Reports in Informatics 2011-13} , pdf = "http://i11www.ira.uka.de/extra/publications/TR-mw-aesgp-11.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022486" , year = 2011 } %% -------------------------------------------------------------- @InProceedings{VSM98 , author = VriesRD #and# SchutterBD #and# MoorBD , title = {{On max-algebraic models for transportation networks}} , booktitle = {{Proceedings of the 4th International Workshop on Discrete Event Systems (WODES '98)}} , pages = {457--462} , year = 1998 } %% -------------------------------------------------------------- @article{a-aderm-67 , author = ArnoldL , title = {{On the Asymptotic Distribution of the Eigenvalues of Random Matrices}} , journal = j-maa , pages = {262--268} , volume = 20 , year = 1967 } @book{a-caa-73 , author = AnderbergMR , title = {{Cluster Analysis for Applications}} , isbn = "0-12-057650-3" , publisher = pub-ap , series = "Probability and Math" , volume = 19 , year = 1973 } @book{a-cda-02 , author = AgrestiA , title = {{Categorical Data Analysis}} , edition = second , publisher = pub-wiley , year = 2002 } @mastersthesis{a-chbtn-12 , author = ArzJ , title = {{Contraction-Hierarchy-Based Transit-Node Routing}} , school = "Karlsruhe Institute of Technology" , type = {Studienarbeit} , year = 2012 } @book{a-ct-99 , author = AignerM , title = {{Combinatorial Theory}} , publisher = pub-springer , year = 1999 } @article{a-ee-86 , author = AlonN , title = {{Eigenvalues and Expanders}} , journal = j-comb , number = 2 , pages = {83--96} , volume = 6 , year = 1986 } @article{a-gprpmfa-90 , author = AlonN , title = {{Generating pseudo-random permutations and maximum flow algorithms}} , journal = j-ipl , month = aug , number = 4 , pages = {201--204} , volume = 35 , year = 1990 } @article{a-gtdsc-73 , author = AlbaRD , title = {{A graph theoretic definition of a sociometric clique}} , journal = j-jms , pages = {113--126} , volume = 3 , year = 1973 } @Article{a-ocpls-70 , author = AndreevEM , title = {{On Convex Polyhedra in Loba{\v{c}}hevski{\v{i}} Spaces}} , journal = j-mussrs , number = 3 , pages = {413--440} , volume = 10 , year = 1970 } @techreport{a-rdg-71 , author = AnthonisseJ , title = {{The rush in a directed graph}} , address = "2e Boerhaavestraat 49 Amsterdam" , institution = "Stichting Mathematisch Centrum" , month = {Oct} , number = {BN 9/71} , year = 1971 } @mastersthesis{a-rpr-12 , author = AndreevSD , title = {{Realistic Pedestrian Routing}} , month = nov , school = "Karlsruhe Institute of Technology" , type = {Bachelor Thesis} , year = 2012 } @InProceedings{a-stga-98 , author = AlonN , title = {{Spectral Techniques in Graph Algorithms}} , booktitle = {{Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98)}} , pages = {206--215} , series = ser-springer_lncs , url = "http://portal.acm.org/citation.cfm?id=690180&coll=Portal&dl=GUIDE&CFID=40850466&CFTOKEN=3545646#" , volume = 1380 , year = 1998 } @InProceedings{a-vspaa-67 , author = AmdahlG , title = {{Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities}} , booktitle = {{AFIPS'67 (Spring): Proceedings of the April 18-20, 1967, spring joint computer conference}} , pages = {483--485} , publisher = pub-acm , year = 1967 } @Book{aan-ea-09 , editor = AlbersS #and# AltH #and# NaeherS , title = {{Efficient Algorithms}} , booktitle = {{Efficient Algorithms}} , publisher = pub-springer , series = ser-springer_lncs , volume = 5760 , year = 2009 } @Article{aar-prp-04 , author = AkonMM #and# AsaduzzamanS #and# RahmanS , title = {{Proposal for $st$-Routing Protocol}} , journal = j-tsy , number = {3--4} , pages = {287--298} , volume = 25 , year = 2004 } @book{ab-ca84 , author = AldenderferMS #and# BlashfieldRK , title = {{Cluster Analysis}} , publisher = pub-sage , year = 1984 } @Article{ab-drgn-00 , author = AnnexsteinFD #and# BermanKA , title = {{Directional Routing via Generalized $st$-Numbering}} , journal = j-sidma , month = jan , number = 2 , pages = {268--279} , volume = 13 , year = 2000 } @article{ab-smcn-02 , author = AlbertR #and# BarabasiAL , title = {{Statistical Mechanics of Complex Networks}} , journal = j-rmp , number = 1 , pages = {47--97} , volume = 74 , year = 2002 } @article{abeht-tcpg-81 , author = AkiyamaJ #and# BoeschFT #and# EraH #and# HararyF #and# TindellR , title = {{The Cohesiveness of a Point of a Graph}} , journal = j-networks , number = 1 , pages = {65--68} , volume = 11 , year = 1981 } @Article{abfflr-oci-99 , author = AzarY #and# BartalY #and# FeuersteinE #and# FiatA #and# LeonardiS #and# RosenA , title = {{On Capital Investment}} , journal = j-alg , number = 1 , pages = {22--36} , volume = 25 , year = 1999 } @InProceedings{abfkk-pcrpg-12 , author = AlamJ #and# BiedlT #and# FelsnerS #and# KaufmannM #and# KobourovSG , title = {{Proportional Contact Representations of Planar Graphs}} , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}} , pages = {26--38} , publisher = pub-springer , series = ser-springer_lncs , year = 2012 } @inproceedings{abfw-mendg-04 , author = AggarwalV #and# BenderS #and# FeldmannA #and# WichmannA , title = {{Methodology for Estimating Network Distances of Gnutella Neighbors}} , booktitle = {{GI Jahrestagung}} , pages = {219--223} , year = 2004 } @InProceedings{ablp-ocrc-89 , author = AlonN #and# Bar-NoyA #and# LinialN #and# PelegD , title = {{On the Complexity of Radio Communication}} , booktitle = {{Proceedings of the 21th Annual {ACM} Symposium on the Theory of Computing (STOC'89)}} , pages = {274--285} , publisher = pub-acm , year = 1989 } @Article{abn-e-06 , author = AlberJ #and# BetzlerN #and# NiedermeierR , title = {{Experiments on data reduction for optimal domination in networks}} , journal = j-aor , number = 1 , pages = {105--117} , volume = 146 , year = 2006 } @InProceedings{abs-tslra-11 , author = ArgyriouE #and# BekosM #and# SymvonisA , title = {{The Straight-Line RAC Drawing Problem Is {$\mathcal{NP}$}-Hard}} , booktitle = {{Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11)}} , month = jan , pages = {74--85} , publisher = pub-springer , series = ser-springer_lncs , volume = 6543 , year = 2011 } @InProceedings{accgghmmnprvvw-ccg-08 , author = AtienzaN #and# deCastroN #and# CortesC #and# GarridoMA #and# GrimaCI #and# HernandezG #and# MarquezA #and# MorenoA #and# NollenburgM #and# PortilloJR #and# ReyesP #and# ValenzuelaJ #and# VillarMT #and# WolffA , title = {{Cover Contact Graphs}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , pages = {171--182} , pdf = "http://i11www.ira.uka.de/extra/publications/accgghmmnprvvw-ccg-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-77537-9_18" , volume = 4875 , year = 2008 } @InProceedings{acflss-kavcp-04 , author = Abu-KhzamFN #and# CollinsRL #and# FellowsMR #and# LangstonMA #and# SutersWH #and# SymonsCT , title = {{Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments}} , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}} , pages = {62--69} , publisher = pub-siam , year = 2004 } @article{acg-rpgm-94 , author = AlonN #and# ChungFRK #and# GrahamRL , title = {{Routing Permutations on Graphs via Matchings}} , journal = j-sidma , pages = {513--530} , volume = 7 , year = 1994 } @book{acgkm-cacop-02 , author = AusielloG #and# CrescenziP #and# GambosiG #and# KannV #and# MarchettiSpaccamelaA , title = {{Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties}} , edition = second , publisher = pub-springer , year = 2002 } @inproceedings{acim-fedsp-99 , author = AingworthD #and# ChekuriC #and# MotwaniR , title = {{Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)}} , booktitle = {{Proceedings of the 7th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'96)}} , publisher = pub-ieeecs , url = "citeseer.ist.psu.edu/aingworth96fast.html" , year = 1996 } @inproceedings{acl-rgmmg-00 , author = AielloW #and# ChungFRK #and# LuL , title = {{A random graph model for massive graphs}} , booktitle = {{Proceedings of the 32nd Annual {ACM} Symposium on the Theory of Computing (STOC'00)}} , month = may , pages = {171--180} , year = 2000 } @Book{acos-gtca-91 , editor = AlaviY #and# ChartrandG #and# OellermannOR #and# SchwenkAJ , title = {{Graph Theory, Combinatorics, and Applications}} , booktitle = {{Graph Theory, Combinatorics, and Applications}} , publisher = pub-wiley , volume = 2 , year = 1991 } @Article{acp-cfet-87 , author = ArnborgS #and# CorneilDG #and# ProskurowskiA , title = {{Complexity of Finding Embeddings in a $k$-Tree}} , journal = j-sjmaa , number = 2 , pages = {277--284} , url = "http://dx.doi.org/10.1137/0608024" , volume = 8 , year = 1987 } @unpublished{adbv-cdata-05 , author = AlvarezHamelinJI #and# DallAstaL #and# BarratA #and# VespignaniA , title = {{$k$-Core Decomposition: A Tool for the Analysis of Large Scale Internet Graphs}} , month = nov , note = {electronically published at \url{http://arxiv.org/abs/cs.NI/0511007}} , pages = {1--11} , url = "http://arxiv.org/abs/cs.NI/0511007" , year = 2005 } @InProceedings{adbv-lsnfv-06 , author = AlvarezHamelinJI #and# DallAstaL #and# BarratA #and# VespignaniA , title = {{Large Scale Networks Fingerprinting and Visualization Using the k-Core Decomposition}} , booktitle = {{Advances in Neural Information Processing Systems 18}} , pages = {41--50} , pdf = "http://books.nips.cc/papers/files/nips18/NIPS2005_0999.pdf" , publisher = pub-mitpr , year = 2006 } @Article{adcgghmmnprvvw-ccg-12 , author = AtienzaN #and# deCastroN #and# CortesC #and# GarridoMA #and# GrimaCI #and# HernandezG #and# MarquezA #and# MorenoA #and# NollenburgM #and# PortilloJR #and# ReyesP #and# ValenzuelaJ #and# VillarMT #and# WolffA , title = {{Cover Contact Graphs}} , journal = j-jcg , number = 1 , pages = {102--131} , pdf = "http://i11www.ira.uka.de/extra/publications/adcgghmmnprvvw-ccg-12.pdf" , url = "http://jocg.org/index.php/jocg/article/ view/66/31" , volume = 3 , year = 2012 } @InProceedings{adf-cotca-12 , author = AleardiLC #and# DevillersO #and# FusyE , title = {{Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 7704 , year = 2013 } @Article{adfg-s-07 , author = ArenasA #and# DuchJ #and# FernandezA #and# GomezS , title = {{Size reduction of complex networks preserving modularity}} , journal = j-njp , number = 176 , pdf = "http://www.iop.org/EJ/article/1367-2630/9/6/176/njp7_6_176.pdf" , url = "http://dx.doi.org/10.1088/1367-2630/9/6/176" , volume = 9 , year = 2007 } @article{adfgw-h-13 , author = AbrahamI #and# DellingD #and# FiatA #and# GoldbergAV #and# WerneckR , title = {{Highway dimension and provably efficient shortest path algorithms}} , type = {submitted} , year = 2013 } @InProceedings{adfgw-hldbl-12 , author = AbrahamI #and# DellingD #and# FiatA #and# GoldbergAV #and# WerneckR , title = {{HLDB: Location-Based Services in Databases}} , booktitle = {{Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)}} , pages = {339--348} , pdf = "http://i11www.ira.uka.de/extra/publications/adfgw-hldbl-12.pdf" , publisher = pub-acm , year = 2012 } @InProceedings{adfgw-vcdsp-11 , author = AbrahamI #and# DellingD #and# FiatA #and# GoldbergAV #and# WerneckR , title = {{VC-Dimension and Shortest Path Algorithms}} , booktitle = {{Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP'11)}} , pages = {690--699} , publisher = pub-springer , series = ser-springer_lncs , volume = 6755 , year = 2011 } @InProceedings{adfjkpr-tppeg-10 , author = AngeliniP #and# DiBattistaG #and# FratiF #and# JelinekV #and# KratochvilJ #and# PatrignaniM #and# RutterI , title = {{Testing Planarity of Partially Embedded Graphs}} , booktitle = {{Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)}} , pages = {202--221} , publisher = pub-siam , url = "http://www.siam.org/proceedings/soda/2010/SODA10_019_angelinip.pdf" , year = 2010 } @Article{adfpr-tsegi-12 , author = AngeliniP #and# DiBattistaG #and# FratiF #and# PatrignaniM #and# RutterI , title = {{Testing the Simultaneous Embeddability of two Graphs whose Intersection is a Biconnected or a Connected Graph}} , journal = j-jda , note = {Special issue of IWOCA'10} , pages = {150--172} , url = "http://dx.doi.org/10.1016/j.jda.2011.12.015" , volume = 14 , year = 2012 } @InProceedings{adfpr-tsetg-10 , author = AngeliniP #and# DiBattistaG #and# FratiF #and# PatrignaniM #and# RutterI , title = {{Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree}} , booktitle = {{Proceedings of the 21st International Workshop on Combinatorial Algorithms}} , pages = {212--225} , publisher = pub-springer , series = ser-springer_lncs , volume = 6460 , year = 2011 } @techreport{adgw-ahbla-10 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR , title = {{A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks}} , institution = "Microsoft Research" , number = {MSR-TR-2010-165} , year = 2010 } @InProceedings{adgw-ahbla-11 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR , title = {{A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {230--241} , publisher = pub-springer , series = ser-springer_lncs , volume = 6630 , year = 2011 } @InProceedings{adgw-arrn-10 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR , title = {{Alternative Routes in Road Networks}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {23--34} , publisher = pub-springer , series = ser-springer_lncs , url = "http://research.microsoft.com/apps/pubs/default.aspx?id=121750" , volume = 6049 , year = 2010 } @Article{adgw-arrn-13 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR , title = {{Alternative Routes in Road Networks}} , journal = j-acm-ea , number = 1 , pages = {1--17} , volume = 18 , year = 2013 } @InProceedings{adgw-hhlsp-12 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR , title = {{Hierarchical Hub Labelings for Shortest Paths}} , booktitle = {{Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)}} , pages = {24--35} , pdf = "http://i11www.ira.uka.de/extra/publications/adgw-hhlsp-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 7501 , year = 2012 } @techreport{adgw-hhlsp-12TR , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR , title = {{Hierarchical Hub Labelings for Shortest Paths}} , institution = "Microsoft Research" , number = {MSR-TR-2012-46} , pdf = "http://research.microsoft.com/pubs/163231/MSR-TR-2012-46.pdf" , year = 2012 } @Article{adn-e-05 , author = AlberJ #and# DornF #and# NiedermeierR , title = {{Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs}} , journal = j-dam , number = 2 , pages = {219--231} , volume = 145 , year = 2005 } @Article{afffnrs-ads-05 , author = AlberJ #and# FanH #and# FellowsMR #and# FernauH #and# NiedermeierR #and# RosamondF #and# StegeU , title = {{A refined search tree technique for Dominating Set on planar graphs}} , journal = j-css , number = 4 , pages = {385--405} , volume = 71 , year = 2005 } @techreport{afggw-aotcv-05 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{Analysis of Overlay-Underlay Topology Correlation using Visualization}} , institution = iti_wagner , number = {2005-31} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3039" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000004239" , year = 2005 } @InProceedings{afggw-aotcv-06 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{Analysis of Overlay-Underlay Topology Correlation using Visualization}} , booktitle = {{Proceedings of the 5th IADIS International Conference WWW/Internet Geometry}} , location = "Murcia, Spain" , note = {awarded as outstanding paper} , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/IADIS_Conference_8_camready.pdf" , year = 2006 } @InProceedings{afggw-avdao-07 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{A Visualization-Driven Approach to Overlay-Underlay Engineering}} , booktitle = {{Proceedings of the Final Workshop of DELIS}} , month = dec , pages = {81--97} , pdf = "http://i11www.ira.uka.de/extra/publications/afggw-avdao-07.pdf" , publisher = pub-hniup , series = ser-hniv , year = 2007 } @Article{afggw-moucu-08 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{Modelling Overlay-Underlay Correlations Using Visualization}} , journal = j-t , number = 1 , pages = {114--125} , pdf = "http://www.telenor.com/en/resources/images/114-125_OverlayUnderlayCorrelations_tcm28-36845.pdf" , url = "http://www.telenor.com/en/innovation/research/publications/telektronikk/volume/telektronikk-1-2008" , volume = 104 , year = 2008 } @InProceedings{afgw-hdspp-10 , author = AbrahamI #and# FiatA #and# GoldbergAV #and# WerneckR , title = {{Highway Dimension, Shortest Paths, and Provably Efficient Algorithms}} , booktitle = {{Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)}} , pages = {782--793} , pdf = "http://www.siam.org/proceedings/soda/2010/SODA10_064_abrahami.pdf" , publisher = pub-siam , year = 2010 } @InProceedings{afkmt-garac-10 , author = ArikushiK #and# FulekR #and# KeszeghB #and# MoricF #and# TothC , title = {{Graphs that Admit Right Angle Crossing Drawings}} , booktitle = {{Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10)}} , pages = {135--146} , publisher = pub-springer , series = ser-springer_lncs , volume = 6410 , year = 2010 } @InProceedings{afl-swhgt-08 , author = AleardiLC #and# FusyE #and# LewinerT , title = {{Schnyder Woods for Higher Genus Triangulated Surfaces}} , booktitle = {{Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)}} , pages = {311--319} , publisher = pub-acm , year = 2008 } @Article{afl-swhgt-09 , author = AleardiLC #and# FusyE #and# LewinerT , title = {{Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding}} , journal = dcg , number = 3 , pages = {489--516} , volume = 42 , year = 2009 } @InProceedings{afn-eds-02 , author = AlberJ #and# FellowsMR #and# NiedermeierR , title = {{Efficient data reduction for Dominating Set: a linear problem kernel for the planar case}} , booktitle = {{Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT'04)}} , month = jul , pages = {150--159} , publisher = pub-springer , series = ser-springer_lncs , volume = 2368 , year = 2002 } @Article{afn-p-04 , author = AlberJ #and# FernauH #and# NiedermeierR , title = {{Parameterized complexity: exponential speed-up for planar graph problems}} , journal = j-jalg , month = jul , number = 1 , pages = {26--56} , volume = 58 , year = 2004 } @Article{afs-cipsc-07 , author = AggarwalV #and# FeldmannA #and# ScheidelerC , title = {{Can ISPs and P2P Systems Cooperate for Improved Performance?}} , journal = j-acm-ccr , number = 3 , pages = {29--40} , url = "http://doi.acm.org/10.1145/1273445.1273449" , volume = 37 , year = 2007 } @book{afs-nmw-90 , author = ActonFS , title = {{Numerical Methods that Work}} , publisher = pub-maa , year = 1990 } @InProceedings{ag-tus-05 , author = AdamicLA #and# GlanceN , title = {{The political blogosphere and the 2004 U.S. election: divided they blog}} , booktitle = {{Proceedings of the 3rd international workshop on Link discovery}} , pages = {36--43} , publisher = pub-acm , year = 2005 } @Article{agdivlj-p-03 , author = ArchakovAI #and# GovorunVM #and# DubanovAV #and# IvanovYD #and# VeselovskyAV #and# LewiP #and# JanssenP , title = {{Protein-protein interactions as a target for drugs in proteomics}} , journal = j-p , month = apr , number = 4 , pages = {380--391} , url = "http://www.ncbi.nlm.nih.gov/pubmed/12687606?dopt=Abstract" , volume = 3 , year = 2003 } @techreport{aggw-hnpcn-05 , author = AlvarezHamelinJI #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{Halfmoon - A new Paradigm for Complex Network Visualization}} , institution = iti_wagner , number = {2005-29} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3038" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000004127" , year = 2005 } @InProceedings{agkn-vlhcg-12 , author = AthenstadtJC #and# GoerkeR #and# KrugM #and# NollenburgM , title = {{Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , note = {Poster abstract.} , pages = {553--554} , pdf = "http://i11www.ira.uka.de/extra/publications/agkn-vlhcg-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_49" , volume = 7704 , year = 2013 } @article{ah-ggcin-73 , author = AminAT #and# HakimiSL , title = {{Graphs with Given Connectivity and Independence Number or Networks with Given Measures of Vulnerability and Survivability}} , journal = j-tct , month = jan , number = 1 , pages = {2--10} , volume = 20 , year = 1973 } @article{ahi-cfds-02 , author = AsahiroY #and# HassinR #and# IwamaK , title = {{Complexity of finding dense subgraphs}} , journal = j-dam , number = {1--3} , pages = {15--26} , volume = 121 , year = 2002 } @Article{ahk-alsgv-06 , author = AbelloJ #and# HamF #and# KrishnanN , title = {{ASK-GraphView: A Large Scale Graph Visualization System}} , journal = j-tvcg , month = sep , number = 5 , pages = {669--676} , pdf = "http://researchweb.watson.ibm.com/visual/papers/ASK-Graphview3.pdf" , volume = 12 , year = 2006 } @InProceedings{ahls-tsppr-10 , author = ArtmeierA #and# HaselmayrJ #and# LeuckerM #and# SachenbacherM , title = {{The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles}} , booktitle = {{Proceedings of the 33rd Annual German Conference on Advances in Artificial Intelligence}} , month = sep , pages = {309--316} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-16111-7_35" , volume = 6359 , year = 2010 } @book{ahu-daca-74 , author = AhoAV #and# HopcroftJE #and# UllmanJD , title = {{The Design and Analysis of Computer Algorithms}} , publisher = pub-aw , year = 1974 } @book{ahu-dsa-83 , author = AhoAV #and# HopcroftJE #and# UllmanJD , title = {{Data Structures and Algorithms}} , publisher = pub-aw , year = 1983 } @article{aitt-gfds-00 , author = AsahiroY #and# IwamaK #and# TamakiH #and# TokuyamaT , title = {{Greedily finding a dense subgraph}} , journal = j-jalg , number = 2 , pages = {203--221} , volume = 34 , year = 2000 } @article{aj-dmt-85 , author = AndersonJG #and# JaySJ , title = {{The Diffusion of Medical Technology: {Social} network analysis and policy research}} , journal = j-tsq , pages = {49--64} , volume = 26 , year = 1985 } @article{ajb-dwww-99 , author = AlbertR #and# JeongH #and# BarabasiAL , title = {{Diameter of the World Wide Web}} , journal = j-nature , month = sep , pages = {130--131} , volume = 401 , year = 1999 } @article{ajb-eatcn-00 , author = AlbertR #and# JeongH #and# BarabasiAL , title = {{Error and attack tolerance of complex networks}} , journal = j-nature , month = jul , pages = {378--382} , volume = 406 , year = 2000 } @Article{ajm-cmcgc-04 , author = AnY #and# JanssenJ #and# MiliosEE , title = {{Characterizing and Mining the Citation Graph of the Computer Science Literature}} , journal = j-kis , number = 6 , pages = {664--678} , volume = 6 , year = 2004 } @InProceedings{ak-gefbm-93 , author = AlpertCJ #and# KahngAB , title = {{Geometric Embeddings for Faster and Better Multi-Way Netlist Partitioning}} , booktitle = {{Proceedings of the 30th ACM/IEEE Conference on Design Automation}} , pages = {743--748} , publisher = pub-acm , year = 1993 } @Article{ak-mmgcm-08 , author = AgarwalG #and# KempeD , title = {{Modularity-Maximizing Graph Communities via Mathematical Programming }} , journal = j-epjb , month = dec , number = 3 , pages = {409--418} , pdf = "http://www.springerlink.com/content/w3221r727wr20x74/fulltext.pdf" , url = "http://www.springerlink.com/content/w3221r727wr20x74" , volume = 66 , year = 2008 } @Article{ak-rdnps-95 , author = AlpertCJ #and# KahngAB , title = {{Recent Directions in Netlist Partitioning: A Survey}} , journal = j-int , number = {1-2} , pages = {1--81} , url = "http://vlsicad.cs.ucla.edu/~cheese/survey.html" , volume = 19 , year = 1995 } @article{akk-ptasdinphp-99 , author = AroraS #and# KargerDR #and# KarpinskiM , title = {{Polynomial time approximation schemes for dense instances of {$\mathcal{NP}$}-hard problems}} , journal = j-css , number = 1 , pages = {193--210} , volume = 58 , year = 1999 } @Book{akl-vddt-13 , author = AurenhammerF #and# KleinR #and# LeeD , title = {{Voronoi Diagrams and Delaunay Triangulations}} , booktitle = {{Voronoi Diagrams and Delaunay Triangulations}} , month = aug , publisher = pub-wsp , year = 2013 } @Article{akor-f-13 , author = AxenovichM #and# KrugM #and# OsangG #and# RutterI , title = {{Fork-forests in bi-colored complete bipartite graphs}} , journal = j-dam , number = {10--11} , pages = {1363--1366} , url = "http://dx.doi.org/10.1016/j.dam.2013.01.023" , volume = 161 , year = 2013 } @article{aks-flhcrg-98 , author = AlonN #and# KrivelevichM #and# SudakovB , title = {{Finding a large hidden clique in a random graph}} , journal = j-rsa , number = {3--4} , pages = {457--466} , volume = 13 , year = 1998 } @InProceedings{al-aaigp-08 , author = AndersenR #and# LangKJ , title = {{An Algorithm for Improving Graph Partitions}} , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}} , pages = {651--660} , year = 2008 } @techreport{al-dgpro-04 , author = AvrachenkovK #and# LitvakN , title = {{Decomposition of the Google PageRank and optimal linking strategy}} , address = "Sophia Antipolis, France" , institution = "INRIA" , month = {Jan} , number = 5101 , year = 2004 } @Article{alph-spln-01 , author = AdamicLA #and# LukoseRM #and# PuniyaniAR #and# HubermanBA , title = {{Search in Power-Law Networks}} , journal = j-pr-e , month = sep , number = 4 , pages = 046135 , pdf = "http://prola.aps.org/pdf/PRE/v64/i4/e046135" , url = "http://dx.doi.org/10.1103/PhysRevE.64.046135" , volume = 64 , year = 2001 } @InProceedings{alpp-anupc-09 , author = AvinC #and# LotkerZ #and# PasqualeF #and# PignoletY , title = {{A Note on Uniform Power Connectivity in the SINR Model}} , booktitle = {{Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)}} , pages = {116--127} , publisher = pub-springer , series = ser-springer_lncs , year = 2009 } @techreport{als-tnrr-12 , author = ArzJ #and# LuxenD #and# SandersP , title = {{Transit Node Routing Reconsidered}} , institution = "Karlsruhe Institute of Technology" , pdf = "http://arxiv.org/pdf/1302.5611v1.pdf" , url = "http://arxiv.org/pdf/1302.5611v1.pdf" , year = 2012 } @InProceedings{als-tnrr-13 , author = ArzJ #and# LuxenD #and# SandersP , title = {{Transit Node Routing Reconsidered}} , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}} , pages = {55--66} , publisher = pub-springer , series = ser-springer_lncs , volume = 7933 , year = 2013 } @Article{am-c-12 , author = AldecoaR #and# MarinI , title = {{Closed benchmarks for network community structure characterization}} , journal = j-phre , month = feb , pages = 026109 , url = "http://link.aps.org/doi/10.1103/PhysRevE.85.026109" , volume = 85 , year = 2012 } @Article{am-dncss-11 , author = AldecoaR #and# MarinI , title = {{Deciphering Network Community Structure by Surprise}} , journal = j-plsone , month = sep , pages = {e24195} , volume = 6 , year = 2011 } @article{am-iigs-85 , author = AlonN #and# MilmanVD , title = {{$\lambda_1$, Isoperimetric Inequalities for Graphs, and Superconcentrators}} , journal = j-jcombthb , pages = {73--88} , volume = 38 , year = 1985 } @Article{am-jeacn-10 , author = AldecoaR #and# MarinI , title = {{Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering}} , journal = j-plsone , month = jul , pages = {e11585} , url = "http://dx.doi.org/10.1371%2Fjournal.pone.0011585" , volume = 5 , year = 2010 } @Article{am-s-13 , author = AldecoaR #and# MarinI , title = {{Surprise maximization reveals the community structure of complex networks}} , journal = j-nsr , month = jan , pages = 1060 , url = "http://dx.doi.org/10.1038/srep01060" , volume = 3 , year = 2013 } @Article{ama-tmlgl-07 , author = ArchambaultD #and# MunznerT #and# AuberD , title = {{TopoLayout: Multi-Level Graph Layout by Topological Features}} , journal = j-tvcg , number = 2 , pages = {305--317} , url = "http://www.cs.ubc.ca/nest/imager/tr/2006/Archambault_TopoLayout_TVCG/" , volume = 13 , year = 2007 } @Article{amm-icapi-05 , author = ArnauV #and# MarsS #and# MarinI , title = {{Iterative Cluster Analysis of Protein Interaction Data}} , journal = j-b , number = 3 , pages = {364--378} , url = "http://bioinformatics.oxfordjournals.org/content/21/3/364.abstract" , volume = 21 , year = 2005 } @book{amo-nf-93 , author = AhujaRK #and# MagnantiTL #and# OrlinJB , title = {{Network Flows: Theory, Algorithms, and Applications}} , publisher = pub-ph , year = 1993 } @Article{amot-faspp-90 , author = AhujaRK #and# MehlhornK #and# OrlinJB #and# TarjanR , title = {{Faster Algorithms for the Shortest Path Problem}} , journal = j-acm , number = 2 , pages = {213--223} , volume = 37 , year = 1990 } @Article{ams-a-06 , author = AlonN #and# MoshkovitzD #and# SafraS , title = {{Algorithmic construction of sets for k-restrictions}} , journal = j-acmta , number = 2 , pages = {153--177} , volume = 2 , year = 2006 } @Book{amz-rolso-09 , editor = AhujaRK #and# MoehringR #and# ZaroliagisC , title = {{Robust and Online Large-Scale Optimization}} , booktitle = {{Robust and Online Large-Scale Optimization}} , publisher = pub-springer , series = ser-springer_lncs , volume = 5868 , year = 2009 } @unpublished{antt-prcsw-01 , author = ArasuA #and# NovakJ #and# TomkinsAS #and# TomlinJ , title = {{PageRank computation and the structure of the web: experiments and algorithms}} , month = {Nov} , note = {short version appeared in Proceedings of the 11th International World Wide Web Conference, Poster Tr} , url = "http://www-staff.it.uts.efu.au/~tomlin/prankwww-long.pdf" , year = 2001 } @article{ao-dapmf-91 , author = AhujaRK #and# OrlinJB , title = {{Distance-based augmenting path algorithms for the maximum flow and parametric maximum flow problems}} , journal = j-nrlq , pages = {413--430} , volume = 38 , year = 1991 } @article{ao-fsamfp-89 , author = AhujaRK #and# OrlinJB , title = {{A Fast and Simple Algorithm for the Maximum Flow Problem}} , journal = j-or , month = sep , number = 5 , pages = {748--759} , volume = 37 , year = 1989 } @Article{aops-dspmt-03 , author = AhujaRK #and# OrlinJB #and# PallottinoS #and# ScutellaMG , title = {{Dynamic Shortest Paths Minimizing Travel Times and Costs}} , journal = j-networks , number = 4 , pages = {197--205} , volume = 41 , year = 2003 } @Article{ap-ltanp-89 , author = ArnborgS #and# ProskurowskiA , title = {{Linear Time Algorithms for NP-hard Problems Restricted to Partial k-Trees}} , journal = j-dam , month = apr , number = 1 , pages = {11--24} , volume = 23 , year = 1989 } @inproceedings{apc-aolpic-03 , author = AbiteboulS #and# PredaM #and# CobenaG , title = {{Adaptive On-Line Page Importance Computation}} , address = "Budapest, Hungary" , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}} , pages = {280--290} , year = 2003 } @InProceedings{ar-b-04 , author = AndreevK #and# RackeH , title = {{Balanced graph partitioning}} , booktitle = {{Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures}} , pages = {120--124} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1007912.1007931" , year = 2004 } @InProceedings{arv-efgeg-04 , author = AroraS #and# RaoS #and# VaziraniU , title = {{Expander Flows, Geometric Embeddings and Graph Partitioning}} , booktitle = {{Proceedings of the 36th Annual {ACM} Symposium on the Theory of Computing (STOC'04)}} , pages = {222--231} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1007352.1007355" , year = 2004 } @book{as-pm-92 , author = AlonN #and# SpencerJ , title = {{The Probabilistic Method}} , publisher = pub-wiley , year = 1992 } @book{ase-pm-92 , author = AlonN #and# SpencerJ #and# ErdoesP , title = {{The Probabilistic Method}} , publisher = pub-wiley , year = 1992 } @article{at-rug-94 , author = AignerM #and# TrieschE , title = {{Realizability and Uniqueness in graphs}} , journal = j-dima , pages = {3--20} , volume = 136 , year = 1994 } @inproceedings{aw-fmopm-12 , author = AntsfeldL #and# WalshT , title = {{Finding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm}} , booktitle = {{Proceedings of the 19th ITS World Congress}} , year = 2012 } @article{awc-pplms-99 , author = AndersonCJ #and# WassermanS #and# CrouchB , title = {{A $p^*$ Primer: {Logit} Models for Social Networks}} , journal = j-sn , month = jan , number = 1 , pages = {37--66} , volume = 21 , year = 1999 } @article{awf-bsb-92 , author = AndersonCJ #and# WassermanS #and# FaustK , title = {{Building stochastic blockmodels}} , journal = j-sn , pages = {137--161} , volume = 14 , year = 1992 } @InProceedings{ay-oaced-05 , author = AggarwalCC #and# YuPS , title = {{Online Analysis of Community Evolution in Data Streams}} , booktitle = {{Proceedings of the fifth SIAM International Conference on Data Mining}} , pdf = "http://www.charuaggarwal.net/aggar142.pdf" , publisher = pub-siam , year = 2005 } @InProceedings{ay-spmeb-95 , author = AlpertCJ #and# YaoS , title = {{Spectral Partitioning: The More Eigenvectors, the Better}} , booktitle = {{Proceedings of the 32nd ACM/IEEE Conference on Design Automation}} , pages = {195--200} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=217529&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36000283&CFTOKEN=73" , publisher = pub-acm , url = "http://doi.acm.org/10.1145/217474.217529" , year = 1995 } @article{ayz-fcglc-97 , author = AlonN #and# YusterR #and# ZwickU , title = {{Finding and Counting Given Length Cycles}} , journal = j-alg , number = 3 , pages = {209--223} , volume = 17 , year = 1997 } @Article{az-s-09 , author = AndroutsopoulosKN #and# ZografosKG , title = {{Solving the multi-criteria time-dependent routing and scheduling problem in a multi-modal fixed schedule network}} , journal = j-ejor , pages = {18--28} , volume = 192 , year = 2009 } @Article{azc-mopap-07 , author = AifadopoulouG #and# ZiliaskopoulosA #and# ChrisohoouE , title = {{Multiobjective Optimum Path Algorithm for Passenger Pretrip Planning in Multimodal Transportation Networks}} , journal = j-jtrb , month = dec , note = {10.3141/2032-04} , number = 1 , pages = {26--34} , volume = 2032 , year = 2007 } %% -------------------------------------------------------------- @inproceedings{b-aaem-03 , author = BadoiuM , title = {{Approximation Algorithm for Embedding Metrics into a Two-dimensional Space}} , booktitle = {{Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)}} , pages = {434--443} , year = 2003 } @Article{b-accg-94 , author = BarnetteDW , title = {{A Construction of 3-Connected Graphs}} , journal = j-ijm , pages = {397--407} , volume = 86 , year = 1994 } @InProceedings{b-afsia-04 , author = Baeza-YatesR , title = {{A Fast Set Intersection Algorithm for Sorted Sequences}} , booktitle = {{Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM'04)}} , pages = {400--408} , publisher = pub-springer , series = ser-springer_lncs , volume = 3109 , year = 2004 } @misc{b-amlfb-09 , author = BrilloutR , title = {{A Multi-Level Framework for Bisection Heuristics}} , note = {Studienarbeit Informatik} , school = inf_ka , year = 2009 } @Article{b-arasf-07 , author = BachmaierC , title = {{A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information}} , journal = j-tvcg , number = 3 , pages = {585--594} , url = "http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4135662" , volume = 13 , year = 2007 } @InCollection{b-ascdm-06 , author = BerkhinP , title = {{A Survey of Clustering Data Mining Techniques}} , booktitle = {{Grouping Multidimensional Data: Recent Advances in Clustering}} , pages = {25--71} , publisher = pub-springer , url = "http://www.springerlink.com/content/x321256p66512121/" , year = 2006 } @article{b-ca-95 , author = BorgattiSP , title = {{Centrality and {AIDS}}} , journal = j-c , number = 1 , pages = {112--115} , volume = 18 , year = 1995 } @article{b-cptog-50 , author = BavelasA , title = {{Communication patterns in task oriented groups}} , journal = j-asa , pages = {271--282} , volume = 22 , year = 1950 } @InCollection{b-cpttw-09 , author = BastH2 , title = {{Car or Public Transport {--} Two Worlds}} , booktitle = {{Efficient Algorithms}} , pages = {355--367} , publisher = pub-springer , series = ser-springer_lncs , volume = 5760 , year = 2009 } @InProceedings{b-cugdr-99 , author = BrewerCA , title = {{Color Use Guidelines for Data Representation}} , booktitle = {{Section on Statistical Graphics '99}} , pages = {55--60} , publisher = pub-asa , url = "http://www.personal.psu.edu/cab38/ColorSch/ASApaper.html" , year = 1999 } @InCollection{b-dgd-01 , author = BrankeJ , title = {{Dynamic Graph Drawing}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {228--246} , pdf = "http://www.springerlink.com/content/0ggdwjkyrr5q8u0k/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/0ggdwjkyrr5q8u0k/" , volume = 2025 , year = 2001 } @InCollection{b-dpa-01 , author = BrandesU , title = {{Drawing on Physical Analogies}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {71--86} , pdf = "http://www.springerlink.com/content/8w9xeajyn1ql4kxq/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/8w9xeajyn1ql4kxq/" , volume = 2025 , year = 2001 } @InProceedings{b-dpp-98 , author = BiedlTC , title = {{Drawing Planar Partitions {I}: {LL}-Drawings and {LH}-Drawings}} , booktitle = {{Proceedings of the 14th Annual Symposium on Computational Geometry}} , pages = {287--296} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/276884.276917" , year = 1998 } @mastersthesis{b-dsutd-06 , author = BauerR , title = {{Dynamic Speed-Up Techniques for Dijkstra's Algorithm}} , pdf = "http://i11www.ira.uka.de/extra/publications/b-dsutd-06.pdf" , school = inf_ka , year = 2006 } @Article{b-e-08 , author = BagrowJ , title = {{Evaluating local community methods in networks}} , journal = j-smte , note = {doi:10.1088/1742-5468/2008/05/P05001} , pages = {P05001} , pdf = "http://www.iop.org/EJ/article/1742-5468/2008/05/P05001/jstat8_05_p05001.pdf" , url = "http://www.iop.org/EJ/abstract/1742-5468/2008/05/P05001/" , year = 2008 } @misc{b-eab-07 , author = BlomeA , title = {{Empirical Analysis of k-Betweenness}} , month = oct , note = {Studienarbeit Informatik} , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-blome-07.pdf" , school = inf_ka , year = 2007 } @InCollection{b-ebp-01 , author = BrandesU , title = {{Energy-Based Placement}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {78--86} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/xkru1gvnyh5p/" , volume = 2025 , year = 2001 } @inproceedings{b-egb-87 , author = BoppanaRB , title = {{Eigenvalues and Graph Bisection: an Average Case Analysis}} , booktitle = {{Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS'87)}} , month = oct , pages = {280--285} , year = 1987 } @book{b-egt-78 , author = BollobasB , title = {{Extremal graph theory}} , publisher = pub-ap , year = 1978 } @InProceedings{b-eo-02 , author = BrandesU , title = {{Eager $st$-Ordering}} , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}} , pages = {183--197} , pdf = "http://www.springerlink.com/content/excppeygfwjah2rt/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/excppeygfwjah2rt/" , volume = 2461 , year = 2002 } @Article{b-fabc-01 , author = BrandesU , title = {{A Faster Algorithm for Betweenness Centrality}} , journal = j-jms , number = 2 , pages = {163--177} , volume = 25 , year = 2001 } @article{b-fawassci-72 , author = BonacichP , title = {{Factoring and Weighting Approaches to Status Scores and Clique Identification}} , journal = j-jms , pages = {113--120} , volume = 2 , year = 1972 } @inproceedings{b-fmissgg-99 , author = BeigelR , title = {{Finding Maximum Independent Sets in Sparse and General Graphs}} , booktitle = {{Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)}} , pages = {856--857} , publisher = pub-siam , year = 1999 } @book{b-g-91 , author = BergeC , title = {{Graphs}} , edition = third , publisher = pub-nh , year = 1991 } @Book{b-gh-76 , author = BergeC , title = {{Graphs and Hypergraphs}} , booktitle = {{Graphs and Hypergraphs}} , publisher = pub-nh , year = 1976 } @article{b-iic-65 , author = BeauchampM , title = {{An improved index of centrality}} , journal = "Behavioral Scie" , pages = {161--163} , volume = 10 , year = 1965 } @misc{b-iktfi-07 , editor = BMBFBf , title = {{IKT 2020. Forschung f{\"u}r Innovationen}} , institution = "Bundesministerium f{\"u}r Bildung und Forschung (BMBF)" , publisher = pub-dlgh , year = 2007 } @Book{b-imcws-02 , author = BehrendsE , title = {{Introduction to Markov Chains With Special Emphasis on Rapid Mixing}} , booktitle = {{Introduction to Markov Chains With Special Emphasis on Rapid Mixing}} , month = oct , publisher = pub-fvs , year = 2002 } @mastersthesis{b-kk-03 , author = BaurM , title = {{{Kantenkreuzungen in Kreislayouts}}} , pdf = "http://www.ub.uni-konstanz.de/kops/volltexte/2003/1099/pdf/kreislayouts.pdf" , school = "Universit{\"a}t Konstanz" , url = "http://www.ub.uni-konstanz.de/kops/volltexte/2003/1099/" , year = 2003 } @book{b-mgt-98 , author = BollobasB , title = {{Modern Graph Theory}} , publisher = pub-springer , series = ser-springer_gtm , volume = 184 , year = 1998 } @article{b-mmgs-48 , author = BavelasA , title = {{A Mathematical Model for Group Structure}} , journal = j-ho , pages = {16--30} , volume = 7 , year = 1948 } @article{b-mnevg-74 , author = BixbyRE , title = {{The minimum number of edges and vertices in a graph with edge connectivity $n$ and $m$ $n$-bonds}} , journal = j-bull-ams , number = 4 , pages = {700--704} , volume = 80 , year = 1974 } @mastersthesis{b-mpq-12 , author = BauerA , title = {{Multimodal Profile Queries }} , month = may , school = "Karlsruhe Institute of Technology" , type = {Bachelor Thesis} , year = 2012 } @Article{b-nb-97 , author = BatageljV , title = {{Notes on Blockmodeling}} , journal = j-sn , month = apr , number = 2 , pages = {143--155} , volume = 19 , year = 1997 } @misc{b-ngrpm-12 , author = BastH2 , title = {{Next-Generation Route Planning: Multi-Modal, Real-Time, Personalized}} , note = {Talk given at ISMP} , url = "http://ismp2012.mathopt.org/show-abs?abs=200" , year = 2012 } @mastersthesis{b-opafa-11 , author = BaumM , title = {{On Preprocessing the Arc-Flags Algorithm}} , pdf = "http://i11www.ira.uka.de/extra/publications/b-opafa-11.pdf" , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie (KIT)" , year = 2011 } @Article{b-orp-58 , author = BellmanR , title = {{On a Routing Problem}} , journal = j-qam , pages = {87--90} , volume = 16 , year = 1958 } @mastersthesis{b-ostd-00 , author = BrehmE , title = {{3-Orientations and Schnyder 3-Tree-Decompositions}} , school = "FU Berlin" , url = "http://www.math.tu-berlin.de/~felsner/Diplomarbeiten/brehm.ps.gz" , year = 2000 } @Article{b-otgfs-59 , author = BenzerS , title = {{On the Topology of the Genetic Fine Structure}} , journal = j-pnas , number = 11 , pages = {1607--1620} , volume = 45 , year = 1959 } @article{b-pacafom-87 , author = BonacichP , title = {{Power and Centrality: A Family of Measures}} , journal = j-ajs , number = 5 , pages = {1170--1182} , volume = 92 , year = 1987 } @article{b-pn-76 , author = BurtRS , title = {{Positions in Networks}} , journal = j-sf , pages = {93--122} , volume = 55 , year = 1976 } @techreport{b-ppegi-79 , author = BoothKS , title = {{Problems polynomially equivalent to graph isomorphism}} , institution = "University of Ljublana" , type = {Technical Report C} , year = 1979 } @Book{b-rg-01 , author = BollobasB , title = {{Random Graphs}} , booktitle = {{Random Graphs}} , publisher = pub-cup , year = 2001 } @Article{b-rrspp-12 , author = BuesingC , title = {{Recoverable Robust Shortest Path Problems}} , journal = j-networks , month = jan , number = 1 , pages = {181--189} , pdf = "http://onlinelibrary.wiley.com/doi/10.1002/net.20487/pdf" , url = "http://dx.doi.org/10.1002/net.20487" , volume = 59 , year = 2012 } @phdthesis{b-savsn-08 , author = BaurM , title = {{visone - Software for the Analysis and Visualization of Social Networks}} , month = nov , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/744891" , school = inf_ka , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000010897" , year = 2008 } @article{b-sisal-74 , author = BesagJE , title = {{Spatial Interaction and the Statistical Analysis of Lattice Systems (with Discussion)}} , journal = j-jrsssb , pages = {196--236} , volume = 36 , year = 1974 } @mastersthesis{b-spqoa-11 , author = BlaesiusT , title = {{Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems}} , institution = "Fakult{\"a}t f{\"u}r Informatik" , month = sep , pdf = "http://i11www.ira.uka.de/extra/publications/b-spqoa-11.pdf" , school = "Karlsruher Institut f{\"u}r Technologie (KIT)" , year = 2011 } @misc{b-srsha-09 , author = BrunelE , title = {{Shortcut Removal on SHARC}} , month = sep , note = {Student Research Project} , school = inf_ka , year = 2009 } @book{b-ss-91 , author = BoydJP , title = {{Social Semigroups}} , publisher = pub-gmup , year = 1991 } @Article{b-stthc-70 , author = BloomBH , title = {{Space/Time Trade-offs in Hash Coding with Allowable Errors}} , journal = j-comm-acm , number = 7 , pages = {422--426} , volume = 13 , year = 1970 } @Article{b-t-10 , author = Bar-GeraH , title = {{Traffic assignment by paired alternative segments}} , journal = j-trpbm , number = {8-9} , pages = {1022--1046} , volume = 44 , year = 2010 } @InProceedings{b-tesg-05 , author = BollobasB , title = {{The Evolution of Sparse Graphs}} , booktitle = {{Cambridge Combinatorial Conference in honor of Paul Erdos}} , pages = {35--57} , publisher = pub-ap , series = ser-gtc , year = 1984 } @phdthesis{b-tespd-10 , author = BauerR , title = {{Theory and Engineering for Shortest Paths and Delay Management}} , institution = "KIT" , month = dec , pdf = "http://i11www.ira.uka.de/extra/publications/b-tespd-10.pdf" , school = "Fakult{\"a}t f{\"u}r Informatik" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000021858" , year = 2010 } @InCollection{b-tesrr-09 , author = BuesingC , title = {{The Exact Subgraph Recoverable Robust Shortest Path Problem}} , booktitle = {{Robust and Online Large-Scale Optimization}} , pages = {231--248} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-05465-5_9" , volume = 5868 , year = 2009 } @article{b-tmnoeav-75 , author = BixbyRE , title = {{The minimum number of edges and vertices in a graph with edge connectivity $n$ and $m$ $n$-bonds}} , journal = j-networks , pages = {253--298} , volume = 5 , year = 1981 } @article{b-totce-79 , author = BreigerRL , title = {{Toward an Operational Theory of Community Elite Structures}} , journal = j-qq , pages = {21--57} , volume = 13 , year = 1979 } @InProceedings{b-uoprs-11 , author = BoteaA , title = {{Ultra-fast Optimal Pathfinding without Runtime Search}} , booktitle = {{Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'11)}} , pages = {122--127} , publisher = pub-aaaip , year = 2011 } @misc{b-vg-06 , author = BingmannT , title = {{Visualisierung sehr gro{\ss}er Graphen}} , note = {Student Research Project} , school = inf_ka , year = 2006 } @Article{b-vspbc-08 , author = BrandesU , title = {{On Variants of Shortest-Path Betweenness Centrality and their Generic Computation}} , journal = j-sn , number = 2 , pages = {136--145} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/b-vspbc-08.pdf" , url = "http://dx.doi.org/10.1016/j.socnet.2007.11.001" , volume = 30 , year = 2008 } @incollection{b-wh-89 , author = BonacichP , editor = FreemanLC #and# WhiteDR #and# RomneyAK , title = {{What is a Homomorphism?}} , booktitle = {{Research Methods in Social Network Analysis}} , chapter = 8 , pages = {255--293} , publisher = pub-gmup , year = 1989 } @article{ba-esrn-99 , author = BarabasiAL #and# AlbertR , title = {{Emergence of scaling in random networks}} , journal = j-science , pages = {509--512} , volume = 286 , year = 1999 } @InProceedings{bahm-srlg-07 , author = BarbayJ #and# AleardiLC #and# HeM #and# MunroI , title = {{Succinct Representation of Labeled Graphs}} , booktitle = {{Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC'07)}} , pages = {316--328} , publisher = pub-springer , series = ser-springer_lncs , volume = 4835 , year = 2007 } @InProceedings{bb-crcl-04 , author = BaurM #and# BrandesU , title = {{Crossing Reduction in Circular Layouts}} , booktitle = {{Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)}} , pages = {332--343} , pdf = "http://i11www.ira.uka.de/extra/publications/bb-crcl-04.pdf" , publisher = pub-springer , series = ser-springer_lncs , year = 2004 } @techreport{bb-crcl2-04 , author = BaurM #and# BrandesU , title = {{Crossing Reduction in Circular Layouts}} , institution = iti_wagner , number = {2004-14} , pdf = "http://i11www.ira.uka.de/extra/publications/bb-crcl-04_TR.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000001244" , year = 2004 } @Article{bb-eglrn-04 , author = BatageljV #and# BrandesU , title = {{Efficient Generation of Large Random Networks}} , journal = j-phre , number = 036113 , pages = 036113 , url = "http://link.aps.org/abstract/PRE/v71/e036113" , year = 2005 } @InProceedings{bb-gdcr-02 , author = BiedlT #and# BrandenburgFJ , title = {{Graph-Drawing Contest Report}} , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}} , month = jan , pages = {82--85} , pdf = "http://www.springerlink.com/content/ree6g32b3h02f693/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/ree6g32b3h02f693/" , volume = 2265 , year = 2002 } @InProceedings{bb-mclmm-08 , author = BaurM #and# BrandesU , title = {{Multi-Circular Layout of Micro/Macro Graphs}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , pages = {255--267} , pdf = "http://i11www.ira.uka.de/extra/publications/bb-mclmm-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/073r9m742m175683/" , volume = 4875 , year = 2008 } @InCollection{bb-nc-05 , author = BaurM #and# BenkertM , title = {{Network Comparison}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {318--340} , pdf = "http://springerlink.metapress.com/content/nx8c7053gpu9pjcx/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/nx8c7053gpu9pjcx/" , volume = 3418 , year = 2005 } @InProceedings{bb-pgt-07 , author = BiedlT #and# BrandenburgFJ , title = {{Partitions of Graphs into Trees}} , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}} , month = jan , pages = {430--439} , publisher = pub-springer , series = ser-springer_lncs , volume = 4372 , year = 2007 } @article{bba-acrda-75 , author = BreigerRL #and# BoormanSA #and# ArabieP , title = {{An Algorithm for Clustering Relational Data with Applications to Social Network Analysis and Comparison with Multidimensional Scaling}} , journal = j-jmp , pages = {328--383} , volume = 12 , year = 1975 } @InProceedings{bbbc-lco-10 , author = BadentM #and# BaurM #and# BrandesU #and# CornelsenS , title = {{Leftist Canonical Ordering}} , booktitle = {{Proceedings of the 17th International Symposium on Graph Drawing (GD'09)}} , pages = {159--170} , publisher = pub-springer , series = ser-springer_lncs , volume = 5849 , year = 2010 } @InProceedings{bbbcgklw-vsvsn-02 , author = BaurM #and# BenkertM #and# BrandesU #and# CornelsenS #and# GaertlerM #and# KoepfB #and# LernerJ #and# WagnerD , title = {{visone - Software for Visual Social Network Analysis}} , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}} , month = jan , pages = {463--464} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bbbcgklw-vsvsn-01.ps.gz" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2265&spage=463" , volume = 2265 , year = 2002 } @inproceedings{bbbcr-ddnm-03 , author = BergerN #and# BollobasB #and# BorgsC #and# ChayesJ #and# RiordanOM , title = {{Degree Distribution of the {FKP} Network Model}} , booktitle = {{Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'03)}} , pages = {725--738} , publisher = pub-springer , series = ser-springer_lncs , year = 2003 } @InProceedings{bbbnosw-dcbth-09 , author = BuchinK #and# BuchinM #and# ByrkaJ #and# NollenburgM #and# OkamotoY #and# SilveiraRI #and# WolffA , title = {{Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability}} , booktitle = {{Proceedings of the 16th International Symposium on Graph Drawing (GD'08)}} , pages = {324--335} , pdf = "http://i11www.ira.uka.de/extra/publications/bbbnosw-dcbth-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-00219-9_32" , volume = 5417 , year = 2009 } @Article{bbbnosw-dcbth-10 , author = BuchinK #and# BuchinM #and# ByrkaJ #and# NollenburgM #and# OkamotoY #and# SilveiraRI #and# WolffA , title = {{Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability}} , journal = j-alg , number = {1--2} , pages = {309--332} , url = "http://dx.doi.org/10.1007/s00453-010-9456-3" , volume = 62 , year = 2012 } @InProceedings{bbc-cc-02 , author = BansalN #and# BlumA #and# ChawlaS , title = {{Correlation Clustering}} , booktitle = {{Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02)}} , pages = {238--247} , pdf = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1181947&isnumber=26517" , publisher = pub-ieeecs , url = "http://dx.doi.org/10.1109/SFCS.2002.1181947" , year = 2002 } @Article{bbc-cc-04 , author = BansalN #and# BlumA #and# ChawlaS , title = {{Correlation Clustering}} , isbn = "0885-6125" , journal = j-ml , month = jul , number = {1-3} , pages = {89--113} , pdf = "http://www.springerlink.com/content/r101lm8201733662/fulltext.pdf" , url = "http://dx.doi.org/10.1023/B:MACH.0000033116.57574.95" , volume = 56 , year = 2004 } @Article{bbc-mco-11 , author = BadentM #and# BrandesU #and# CornelsenS , title = {{More Canonical Ordering}} , journal = j-jgaa , month = feb , number = 1 , pages = {97--126} , volume = 15 , year = 2011 } @techreport{bbd-ogh-05 , author = BarthD #and# BerthomeP #and# DialloM , title = {{On the analysis of Gomory-Hu cut-trees relationship}} , institution = "LIMOS" , year = 2005 } @InProceedings{bbddfgkppt-htcrp-07 , author = BadentM #and# BinucciC #and# DiGiacomoE #and# DidimoW #and# FelsnerS #and# GiordanoF #and# KratochvilJ #and# PalladinoP #and# PatrignaniM #and# TrottaF , title = {{Homothetic Triangle Contact Representations of Planar Graphs}} , booktitle = {{Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG '07)}} , pages = {233--238} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bbddfgkppt-htcr-07.pdf" , publisher = pub-cu , year = 2007 } @Article{bbdf-rm-06 , author = BarthD #and# BerthomeP #and# DialloM #and# FerreiraA , title = {{Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations}} , journal = j-do , number = 3 , pages = {195--205} , volume = 3 , year = 2006 } @InProceedings{bbgw-dag-05 , author = BaurM #and# BrandesU #and# GaertlerM #and# WagnerD , title = {{Drawing the {AS} Graph in 2.5 Dimensions}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {43--48} , pdf = "http://i11www.ira.uka.de/extra/publications/bbgw-dag-05.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/link.asp?id=xfqay6gkcychr4hf" , volume = 3383 , year = 2005 } @techreport{bbgw-dagth-04 , author = BaurM #and# BrandesU #and# GaertlerM #and# WagnerD , title = {{Drawing the AS Graph in Two and a Half Dimensions}} , institution = iti_wagner , number = {2004-12} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3037" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000001242" , year = 2004 } @InProceedings{bbhkmw-elcsp-08 , author = BarrettC #and# BissetK #and# HolzerM #and# KonjevodG #and# MaratheMV #and# WagnerD , title = {{Engineering Label-Constrained Shortest-Path Algorithms}} , booktitle = {{Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08)}} , month = jun , pages = {27--37} , publisher = pub-springer , series = ser-springer_lncs , volume = 5034 , year = 2008 } @InCollection{bbhkmw-elcsp-09 , author = BarrettC #and# BissetK #and# HolzerM #and# KonjevodG #and# MaratheMV #and# WagnerD , title = {{Engineering Label-Constrained Shortest-Path Algorithms}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {309--319} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @InProceedings{bbjkm-ccspp-02 , author = BarrettC #and# BissetK #and# JacobR #and# KonjevodG #and# MaratheMV , title = {{Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router}} , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}} , pages = {126--138} , pdf = "http://thrackle.eas.asu.edu/users/goran/papers/transims.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 2461 , year = 2002 } @InProceedings{bbk-aeacg-04 , author = BlandfordDK #and# BlellochGE #and# KashIA , title = {{An Experimental Analysis of a Compact Graph Representation}} , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}} , pages = {49--61} , publisher = pub-siam , year = 2004 } @InProceedings{bbk-crsg-03 , author = BlandfordDK #and# BlellochGE #and# KashIA , title = {{Compact Representation of Separable Graphs}} , booktitle = {{Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)}} , pages = {679--688} , year = 2003 } @InProceedings{bbk-eacee-08 , author = BoeckerS #and# BriesemeisterS #and# KlauGW , title = {{Exact Algorithms for Cluster Editing: Evaluation and Experiments}} , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}} , month = jun , pages = {289--302} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/f832516v14428712/" , volume = 5038 , year = 2008 } @misc{bblw-avsn-08 , author = BaurM #and# BrandesU #and# LernerJ #and# WagnerD , title = {{Analysis and Visualization of Social Networks (Poster)}} , pdf = "http://i11www.ira.uka.de/extra/publications/poster-bblw-avsn-08.pdf" , year = 2008 } @InCollection{bblw-glavs-09 , author = BaurM #and# BrandesU #and# LernerJ #and# WagnerD , title = {{Group-Level Analysis and Visualization of Social Networks}} , booktitle = {{Algorithmics of Large and Complex Networks}} , pages = {330--358} , pdf = "http://www.springerlink.com/index/f48n37273l5n18l0.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5515 , year = 2009 } @Article{bbm-o-06 , author = BielliM #and# BoulmakoulA #and# MouncifH , title = {{Object modeling and path computation for multimodal travel systems}} , journal = j-ejor , number = 3 , pages = {1705--1730} , volume = 175 , year = 2006 } @InProceedings{bbnnpr-uilps-13 , author = BiedlT #and# BlaesiusT #and# NiedermannB #and# NollenburgM #and# PrutkinR #and# RutterI , title = {{Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings}} , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , year = 2014 } @InProceedings{bbp-vieas-08 , author = BoitmanisK #and# BrandesU #and# PichC , title = {{Visualizing Internet Evolution on the Autonomous Systems Level}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , pages = {365--376} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/j084776h63258307/" , volume = 4875 , year = 2008 } @incollection{bbpp-mcp-99 , author = BomzeIM #and# BudinichM #and# PardalosPM #and# PelilloM , editor = DuDZ #and# PardalosPM , title = {{The Maximum Clique Problem}} , booktitle = {{Handbook of Combinatorial Optimization (Supplement Volume A)}} , pages = {1--74} , publisher = pub-kapg , volume = 4 , year = 1999 } @techreport{bbps-iscc-98 , author = BaraldiA #and# BlondaP #and# ParmiggianiF #and# SatalinoG , title = {{Image Segmentation through Contextual Clustering}} , address = "Berkeley, CA" , institution = "ICSI: International Computer Science Institute" , number = {TR-98-009} , pdf = "ftp://ftp.icsi.berkeley.edu/pub/techreports/1998/tr-98-009.pdf" , url = "http://www.icsi.berkeley.edu/cgi-bin/pubs/publication.pl?ID=001130" , year = 1998 } @InProceedings{bbrw-ocpga-12 , author = BauerR #and# BaumM #and# RutterI #and# WagnerD , title = {{On the Complexity of Partitioning Graphs for Arc-Flags}} , booktitle = {{Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12)}} , pages = {71--82} , pdf = "http://i11www.ira.uka.de/extra/publications/bbrw-ocpga-12.pdf" , series = ser-oasioasi , year = 2012 } @Article{bbrw-ocpga-13 , author = BauerR #and# BaumM #and# RutterI #and# WagnerD , title = {{On the Complexity of Partitioning Graphs for Arc-Flags}} , journal = j-jgaa , number = 3 , pages = {265--299} , url = "http://jgaa.info/getPaper?id=294" , volume = 17 , year = 2013 } @Article{bbvc-acpba-2012 , author = BrandtF #and# BauerR #and# VolkerM #and# CardeneoA , title = {{A Constraint Programming Based Approach to a Large-Scale Energy Management Problem}} , journal = j-js , pages = {1--20} , url = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s10951-012-0281-1" , year = 2012 } @misc{bbw-abvv-07 , author = BaurM #and# BrandesU #and# WagnerD , title = {{Attribute-Based Visualisation in visone (Poster Abstract)}} , pdf = "http://i11www.ira.uka.de/extra/publications/bbw-abvv-07.pdf" , year = 2007 } @misc{bbw-abvv2-07 , author = BaurM #and# BrandesU #and# WagnerD , title = {{Attribute-Based Visualisation in visone (Poster)}} , pdf = "http://i11www.ira.uka.de/extra/publications/poster-bbw-abvv-07.pdf" , year = 2007 } @InCollection{bc-dch-01 , author = BrockenauerR #and# CornelsenS , title = {{Drawing Clusters and Hierarchies}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {192--227} , pdf = "http://springerlink.metapress.com/content/hna86wa6ruahmxng/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/hna86wa6ruahmxng/" , volume = 2025 , year = 2001 } @Article{bc-vrls-03 , author = BrandesU #and# CornelsenS , title = {{Visual Ranking of Link Structures}} , journal = j-jgaa , number = 2 , pages = {181--201} , volume = 7 , year = 2003 } @Article{bc-vunea-03 , author = BrandesU #and# CormanSR , title = {{Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse}} , journal = j-infovis , number = 1 , volume = 2 , year = 2003 } @Article{bcddf-dmogs-08 , author = BrueraF #and# CiceroneS #and# DangeloG #and# DiStefanoG #and# FrigioniD , title = {{Dynamic Multi-level Overlay Graphs for Shortest Paths}} , journal = j-mcs , month = apr , number = 4 , pages = {709--736} , volume = 1 , year = 2008 } @InProceedings{bcdtt-hdspd-92 , author = BertolazziP #and# CohenR #and# DiBattistaG #and# TamassiaR #and# TollisIG , title = {{How to draw a series-parallel digraph}} , booktitle = {{Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory (SWAT'92)}} , pages = {272--283} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/3-540-55706-7_23" , volume = 621 , year = 1992 } @InProceedings{bceghrv-frvlp-10 , author = BastH2 #and# CarlssonE #and# EigenwilligA #and# GeisbergerR #and# HarrelsonC #and# RaychevV #and# VigerF , title = {{Fast Routing in Very Large Public Transportation Networks using Transfer Patterns}} , booktitle = {{Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10)}} , pages = {290--301} , publisher = pub-springer , series = ser-springer_lncs , volume = 6346 , year = 2010 } @InProceedings{bcf-p-09 , author = BaumannH #and# CrescenziP #and# FraigniaudP , title = {{Parsimonious flooding in dynamic graphs}} , booktitle = {{Proceedings of the 28th ACM symposium on Principles of distributed computing}} , pages = {260--269} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1582716.1582757" , year = 2009 } @InProceedings{bcfhknrs-moblb-13 , author = BekosM #and# CornelsenS #and# FinkM #and# HongS #and# KaufmannM #and# NollenburgM #and# RutterI #and# SymvonisA , title = {{Many-to-One Boundary Labeling with Backbones}} , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , year = 2014 } @InProceedings{bcfms-cgsnq-08 , author = BoseP #and# CarmiP #and# FarshiM #and# MaheshwariA #and# SmidM , title = {{Computing the Greedy Spanner in Near-Quadratic Time}} , booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08)}} , pages = {390--401} , publisher = pub-springer , series = ser-springer_lncs , volume = 5124 , year = 2008 } @Article{bcfw-hdmcp-04 , author = BrandesU #and# CornelsenS #and# FiessC #and# WagnerD , title = {{How to Draw the Minimum Cuts of a Planar Graph}} , journal = j-cgta , pages = {117--133} , volume = 29 , year = 2004 } @InProceedings{bcgkmnw-pped-12 , author = BruckdorferT #and# CornelsenS #and# GutwengerC #and# KaufmannM #and# MontecchianiF #and# NollenburgM #and# WolffA , title = {{Progress on Partial Edge Drawings}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , note = {Full version available at \url{http://arxiv.org/abs/2109.0830}.} , pages = {67--78} , pdf = "http://i11www.ira.uka.de/extra/publications/bcgkmnw-pped-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_7" , volume = 7704 , year = 2013 } @InProceedings{bckkw-psuth-10 , author = BauerR #and# ColumbusT #and# KatzB #and# KrugM #and# WagnerD , title = {{Preprocessing Speed-Up Techniques is Hard}} , booktitle = {{Proceedings of the 7th Conference on Algorithms and Complexity (CIAC'10)}} , pages = {359--370} , publisher = pub-springer , series = ser-springer_lncs , volume = 6078 , year = 2010 } @techreport{bckkw-psuth-10-tr , author = BauerR #and# ColumbusT #and# KatzB #and# KrugM #and# WagnerD , title = {{Preprocessing Speed-Up Techniques is Hard}} , institution = "ITI Wagner, Faculty of Informatics, Karlsruhe Institute of Technology" , number = {2010-04} , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000016080" , year = 2010 } @InProceedings{bcrw-sssch-13 , author = BauerR #and# ColumbusT #and# RutterI #and# WagnerD , title = {{Search-Space Size in Contraction Hierarchies}} , booktitle = {{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)}} , pages = {93--104} , publisher = pub-springer , series = ser-springer_lncs , volume = 7965 , year = 2013 } @Article{bcsv-ucasf-04 , author = BoldiP #and# CodenottiB #and# SantiniM #and# VignaS , title = {{UbiCrawler: A Scalable Fully Distributed Web Crawler}} , journal = j-spe , number = 8 , pages = {711--726} , pdf = "http://vigna.dsi.unimi.it/ftp/papers/UbiCrawler.pdf" , volume = 34 , year = 2004 } @InCollection{bcsz-e-05 , author = BermanP #and# CalinescuG #and# ShahC #and# ZelikovskyA , title = {{Efficient energy management in sensor networks}} , booktitle = {{Ad Hoc and Sensor Networks}} , pages = {71--90} , publisher = pub-nsp , series = ser-wnmc , volume = 2 , year = 2005 } @InProceedings{bcsz-p-04 , author = BermanP #and# CalinescuG #and# ShahC #and# ZelikovskyA , title = {{Power efficient monitoring management in sensor networks}} , booktitle = {{Proceedings of the Wireless Communications and Networking Conference 2004}} , month = mar , pages = {2329--2334} , publisher = pub-ieeecs , volume = 4 , year = 2004 } @InProceedings{bcw-cfcra-04 , author = BrandesU #and# CornelsenS #and# WagnerD , title = {{Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles}} , booktitle = {{Proceedings of the 11th International Symposium on Graph Drawing (GD'03)}} , month = jan , pages = {357--368} , publisher = pub-springer , series = ser-springer_lncs , volume = 2912 , year = 2004 } @Article{bcw-cfcra-05 , author = BrandesU #and# CornelsenS #and# WagnerD , title = {{Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles}} , journal = j-jgaa , number = 1 , pages = {99--115} , pdf = "http://www.cs.brown.edu/publications/jgaa/accepted/2005/BrandesCornelsenWagner2005.9.1.pdf" , volume = 9 , year = 2005 } @InProceedings{bcw-hdmcp-01 , author = BrandesU #and# CornelsenS #and# WagnerD , title = {{How to Draw the Minimum Cuts of a Planar Graph}} , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {103--114} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bcw-hdmcp-01.ps.gz" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/bx98c234v16601ca/" , volume = 1984 , year = 2001 } @Article{bd-dagl-81 , author = BabaiL #and# DuffusD , title = {{Dimension and Automorphism Groups of Lattices}} , journal = j-au , pages = {279--289} , volume = 12 , year = 1981 } @InProceedings{bd-ldvcg-07 , author = BalzerM #and# DeussenO , title = {{Level-of-Detail Visualization of Clustered Graph Layouts}} , booktitle = {{Asia-Pacific Symposium on Visualisation 2007 (APVIS'07)}} , year = 2007 } @InProceedings{bd-oudtt-91 , author = BertolazziP #and# DiBattistaG , title = {{On Upward Drawing Testing of Triconnected Digraphs (extended abstract)}} , booktitle = {{Proceedings of the 7th Annual ACM Symposium on Computational Geometry}} , pages = {272--280} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=109679&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36841009&CFTOKEN=98" , publisher = pub-acm , url = "http://doi.acm.org/10.1145/109648.109679" , year = 1991 } @InProceedings{bd-sharc-08 , author = BauerR #and# DellingD , title = {{SHARC: Fast and Robust Unidirectional Routing}} , booktitle = {{Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08)}} , month = apr , pages = {13--26} , pdf = "http://i11www.ira.uka.de/extra/publications/bd-sharc-08.pdf" , publisher = pub-siam , year = 2008 } @Article{bd-sharc-09 , author = BauerR #and# DellingD , title = {{SHARC: Fast and Robust Unidirectional Routing}} , journal = j-acm-ea , month = aug , note = {Special Section on Selected Papers from ALENEX 2008.} , number = {2.4} , pages = {1--29} , pdf = "http://i11www.ira.uka.de/extra/publications/bd-sharc-09.pdf" , url = "http://doi.acm.org/10.1145/1498698.1537599" , volume = 14 , year = 2009 } @InProceedings{bdd-afdg-09 , author = BerretiniE #and# DangeloG #and# DellingD , title = {{Arc-Flags in Dynamic Graphs}} , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}} , pdf = "http://i11www.ira.uka.de/extra/publications/bdd-afdg-09.pdf" , series = ser-oasioasi , year = 2009 } @article{bddhkkmnrw-pavcg-82 , author = BeckerM #and# DegenhardtW #and# DoenhardtJ #and# HertelS #and# KaninkeG #and# KeberW #and# MehlhornK #and# NaeherS #and# RohnertH #and# WinterT , title = {{A Probabilistic Algorithm for Vertex Connectivity of Graphs}} , journal = j-ipl , month = oct , number = 3 , pages = {135--136} , volume = 15 , year = 1982 } @techreport{bddsw-tspca-10 , author = BauerR #and# DangeloG #and# DellingD #and# SchummA #and# WagnerD , title = {{The Shortcut Problem -- Complexity and Algorithms }} , institution = iti_wagner , number = {2010-17} , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000019794" , year = 2010 } @Article{bddsw-tspca-12 , author = BauerR #and# DangeloG #and# DellingD #and# SchummA #and# WagnerD , title = {{The Shortcut Problem -- Complexity and Algorithms}} , journal = j-jgaa , number = 2 , pages = {447--481} , url = "http://jgaa.info/16/270.html" , volume = 16 , year = 2012 } @techreport{bddw-tcsp-07 , author = BauerR #and# DangeloG #and# DellingD #and# WagnerD , title = {{The Complexity of the Shortcut Problem}} , institution = "Arrival Technical Report" , number = 117 , pdf = "http://arrival.cti.gr/uploads/Documents.0117/ARRIVAL-TR-0117.pdf" , year = 2007 } @InProceedings{bddw-tspca-09 , author = BauerR #and# DangeloG #and# DellingD #and# WagnerD , title = {{The Shortcut Problem -- Complexity and Approximation}} , booktitle = {{Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09)}} , month = jan , pages = {105--116} , pdf = "http://i11www.ira.uka.de/extra/publications/bddw-tspca-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5404 , year = 2009 } @InProceedings{bdf-gtgpm-03 , author = BerthomeP #and# DialloM #and# FerreiraA , title = {{Graph-Theoretic Generalized Parametric Multi-terminal Flows Problem}} , booktitle = {{Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)}} , pages = {71--80} , publisher = pub-springer , series = ser-springer_lncs , volume = 2880 , year = 2003 } @misc{bdgghnw-mmh-06 , author = BrandesU #and# DellingD #and# GaertlerM #and# GoerkeR #and# HoeferM #and# NikoloskiZ #and# WagnerD , title = {{Maximizing Modularity is Hard}} , note = {arXiv physics/0608255} , pdf = "http://arxiv.org/pdf/physics/0608255" , url = "http://arxiv.org/abs/physics/0608255" , year = 2006 } @Article{bdgghnw-omc-08 , author = BrandesU #and# DellingD #and# GaertlerM #and# GoerkeR #and# HoeferM #and# NikoloskiZ #and# WagnerD , title = {{On Modularity Clustering}} , journal = j-tkde , month = feb , number = 2 , pages = {172--188} , url = "http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190689" , volume = 20 , year = 2008 } @techreport{bdgghnw-omnpcb-06 , author = BrandesU #and# DellingD #and# GaertlerM #and# GoerkeR #and# HoeferM #and# NikoloskiZ #and# WagnerD , title = {{On Modularity - NP-Completeness and Beyond}} , institution = iti_wagner , number = {2006-19} , pdf = "http://i11www.ira.uka.de/extra/publications/bdgghnw-omnpcb-06.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005777" , year = 2006 } @InProceedings{bdgm-atdmc-09 , author = BergerA #and# DellingD #and# GebhardtA #and# MuellerHannemannM , title = {{Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected}} , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}} , pdf = "http://i11www.ira.uka.de/extra/publications/bdgm-atdmc-09.pdf" , series = ser-oasioasi , year = 2009 } @InProceedings{bdgrw-cgl-12 , author = BetzG #and# DollC #and# GemsaA #and# RutterI #and# WagnerD , title = {{Column-based Graph Layouts}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , note = {to appear} , publisher = pub-springer , series = ser-springer_lncs , volume = 7704 , year = 2013 } @InProceedings{bdgs-argrn-11 , author = BaderR #and# DeesJ #and# GeisbergerR #and# SandersP , title = {{Alternative Route Graphs in Road Networks}} , booktitle = {{Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11)}} , pages = {21--32} , publisher = pub-springer , series = ser-springer_lncs , volume = 6595 , year = 2011 } @techreport{bdgw-sesr-09TR , author = BrunelE #and# DellingD #and# GemsaA #and# WagnerD , title = {{Space-Efficient SHARC-Routing}} , institution = iti_wagner , number = 13 , pdf = "http://i11www.ira.uka.de/extra/publications/bdgw-sesr-09TR.pdf" , year = 2009 } @InProceedings{bdgw-sesr-10 , author = BrunelE #and# DellingD #and# GemsaA #and# WagnerD , title = {{Space-Efficient SHARC-Routing}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {47--58} , pdf = "http://i11www.ira.uka.de/extra/publications/bdgw-sesr-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 6049 , year = 2010 } @InProceedings{bdhggnw-fgcmm-07 , author = BrandesU #and# DellingD #and# HoeferM #and# GaertlerM #and# GoerkeR #and# NikoloskiZ #and# WagnerD , title = {{On Finding Graph Clusterings with Maximum Modularity}} , booktitle = {{Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07)}} , month = oct , pages = {121--132} , pdf = "http://www.springerlink.com/content/w7p1057m25757210/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-74839-7_12" , volume = 4769 , year = 2007 } @InProceedings{bdl-dcgcp-07 , author = BadentM #and# DiGiacomoE #and# LiottaG , title = {{Drawing Colored Graphs on Colored Points}} , booktitle = {{Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS'07)}} , pages = {102--113} , pdf = "http://www.springerlink.com/index/y541221735258m35.pdf" , publisher = pub-springer , series = ser-springer_lncs , year = 2007 } @Article{bdlm-udtd-94 , author = BertolazziP #and# DiBattistaG #and# LiottaG #and# ManninoC , title = {{Upward Drawings of Triconnected Digraphs}} , journal = j-alg , month = dec , number = 6 , pages = {476--497} , pdf = "http://www.springerlink.com/content/qq1024262v624086/fulltext.pdf" , url = "http://www.springerlink.com/content/QQ1024262V624086/" , volume = 12 , year = 1994 } @techreport{bdpw-eorev-13 , author = BaumM #and# DibbeltJ #and# PajorT #and# WagnerD , title = {{Energy-Optimal Routes for Electric Vehicles}} , institution = "Faculty of Informatics, Karlsruhe Institute of Technology" , number = {2013-06} , pdf = "http://i11www.ira.uka.de/extra/publications/bdpw-eorev-13.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000035824" , year = 2013 } @article{bds-vumpa-04 , author = BrandesU #and# DwyerT #and# SchreiberF , title = {{Visual Understanding of Metabolic Pathways Across Organisms Using Layout in Two and a Half Dimensions}} , journal = j-ibioinfo , volume = 002 , year = 2004 } @InProceedings{bdsssw-chgds-08 , author = BauerR #and# DellingD #and# SandersP #and# SchieferdeckerD #and# SchultesD #and# WagnerD , title = {{Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm}} , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}} , month = jun , pages = {303--318} , pdf = "http://i11www.ira.uka.de/extra/publications/bdsssw-chgds-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5038 , year = 2008 } @Article{bdsssw-chgds-10 , author = BauerR #and# DellingD #and# SandersP #and# SchieferdeckerD #and# SchultesD #and# WagnerD , title = {{Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm}} , journal = j-acm-ea , month = jan , note = {Special Section devoted to WEA'08.} , number = {2.3} , pages = {1--31} , pdf = "http://i11www.ira.uka.de/extra/publications/bdsssw-chgds-10.pdf" , volume = 15 , year = 2010 } @InProceedings{bdsv-tdch-09 , author = BatzV #and# DellingD #and# SandersP #and# VetterC , title = {{Time-Dependent Contraction Hierarchies}} , booktitle = {{Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09)}} , month = apr , pages = {97--105} , pdf = "http://i11www.ira.uka.de/extra/publications/bdsv-tdch-09.pdf" , publisher = pub-siam , year = 2009 } @InProceedings{bdw-dobbd-11 , author = BudiuM #and# DellingD #and# WerneckR , title = {{DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines}} , booktitle = {{25th International Parallel and Distributed Processing Symposium (IPDPS'11)}} , pages = {1278--1289} , publisher = pub-ics , year = 2011 } @InProceedings{bdw-essut-07 , author = BauerR #and# DellingD #and# WagnerD , title = {{Experimental Study on Speed-Up Techniques for Timetable Information Systems}} , booktitle = {{Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)}} , pages = {209--225} , pdf = "http://i11www.ira.uka.de/extra/publications/bdw-essut-07.pdf" , series = ser-oasioasi , url = "http://drops.dagstuhl.de/opus/volltexte/2007/1169/" , year = 2007 } @Article{bdw-essut-11 , author = BauerR #and# DellingD #and# WagnerD , title = {{Experimental Study on Speed-Up Techniques for Timetable Information Systems}} , journal = j-networks , month = jan , number = 1 , pages = {38--52} , pdf = "http://i11www.ira.uka.de/extra/publications/bdw-essut-11.pdf" , volume = 57 , year = 2011 } @techreport{bdw-isst-08 , author = BauerR #and# DellingD #and# WagnerD , title = {{Impact of Shortcuts on Speedup Techniques}} , institution = iti_wagner , number = {2008-10} , pdf = "http://i11www.ira.uka.de/extra/publications/bdw-isst-08.pdf" , year = 2008 } @techreport{bdw-spiem-07 , author = BauerR #and# DellingD #and# WagnerD , title = {{Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems}} , institution = iti_wagner , number = {2007-14} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3112" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000006961" , year = 2007 } @article{be-careasc-89 , author = BorgattiSP #and# EverettMG , title = {{The Class of All Regular Equivalences: Algebraic Structure and Computation}} , journal = j-sn , number = 1 , pages = {65--88} , volume = 11 , year = 1989 } @InCollection{be-f-05 , author = BrandesU #and# ErlebachT , title = {{Fundamentals}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {7--15} , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/nv20c2jfpf28/" , volume = 3418 , year = 2005 } @unpublished{be-gpc-04 , author = BorgattiSP #and# EverettMG , title = {{A Graph-Theoretic Perspective on Centrality}} , note = {Unpublished manuscript} , year = 2004 } @article{be-mcps-99 , author = BorgattiSP #and# EverettMG , title = {{Models of core/periphery structures}} , journal = j-sn , number = 4 , pages = {375--395} , volume = 21 , year = 1999 } @Book{be-namf-05 , editor = BrandesU #and# ErlebachT , title = {{Network Analysis: Methodological Foundations}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/nv20c2jfpf28/" , volume = 3418 , year = 2005 } @article{be-psr-79 , author = BreigerRL #and# EnnisJG , title = {{Personae and Social Roles: {The} Network Structure of Personality Types in Small Groups}} , journal = j-tsq , pages = {262--270} , volume = 42 , year = 1979 } @article{be-rrrirre-99 , author = BoydJP #and# EverettMG , title = {{Relations, Residuals, Regular Interiors, and Relative Regular Equivalence}} , journal = j-sn , month = apr , number = 2 , pages = {147--165} , volume = 21 , year = 1999 } @article{be-tacre-93 , author = BorgattiSP #and# EverettMG , title = {{Two Algorithms for Computing Regular Equivalence}} , journal = j-sn , number = 4 , pages = {361--376} , volume = 15 , year = 1993 } @Article{beehhmr-ndv-06 , author = BeerliovaZ #and# EberhardF #and# ErlebachT #and# HallA #and# HoffmannM #and# MihalakM #and# RamLS , title = {{Network Discovery and Verification}} , journal = j-jsac , month = dec , number = 12 , pages = {2168--2181} , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4016133" , volume = 24 , year = 2006 } @misc{bef-uguci-99 , author = BorgattiSP #and# EverettMG #and# FreemanLC , title = {{Users Guide of {UCINET} 5 for Windows }} , url = "http://www.analytictech.com/ucinet/Ucinet_Guide.doc" , year = 1999 } @InProceedings{behhm-gmlpr-01 , author = BrandesU #and# EiglspergerM #and# HermanI #and# HimsoltM #and# MarshallMS , title = {{{GraphML} Progress Report: Structural Layer Proposal}} , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}} , month = jan , publisher = pub-springer , series = ser-springer_lncs , volume = 1984 , year = 2001 } @InProceedings{bekw-sdogd-03 , author = BrandesU #and# EiglspergerM #and# KaufmannM #and# WagnerD , title = {{Sketch-Driven Orthogonal Graph Drawing}} , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {1--11} , publisher = pub-springer , series = ser-springer_lncs , volume = 2528 , year = 2003 } @InProceedings{belns-apst-11 , author = BuchinK #and# EppsteinD #and# LofflerM #and# NollenburgM #and# SilveiraRI , title = {{Adjacency-Preserving Spatial Treemaps}} , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}} , month = aug , note = {Full version available at \url{http://arxiv.org/abs/1105.0398}.} , pages = {159--170} , pdf = "http://i11www.ira.uka.de/extra/publications/belns-apst-11.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.og/10.1007/978-3-642-22300-6 14" , volume = 6844 , year = 2011 } @article{bempt-sbbwg-04 , author = BezrukovS #and# ElsaesserR #and# MonienB #and# PreisR #and# TillichJP , title = {{New Spectral Lower Bounds on the Bisection Width of Graphs}} , journal = j-tcs , pages = {155--174} , volume = 320 , year = 2004 } @article{bes-lsslsocs-90 , author = BorgattiSP #and# EverettMG #and# ShireyPR , title = {{{LS} sets, lambda sets and other cohesive subsets}} , journal = j-sn , number = 4 , pages = {337--357} , volume = 12 , year = 1990 } @book{bett-gdavg-98 , author = DiBattistaG #and# EadesP #and# TamassiaR #and# TollisIG , title = {{Graph Drawing - Algorithms for the Visualization of Graphs}} , booktitle = {{Graph Drawing - Algorithms for the Visualization of Graphs}} , isbn = 0133016153 , publisher = pub-ph , year = 1998 } @inproceedings{bf-cmbcf-05 , author = BrandesU #and# FleischerD , title = {{Centrality Measures Based on Current Flow}} , booktitle = {{Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS'05)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 3404 , year = 2005 } @inproceedings{bf-crd-00 , author = BatageljV #and# FerligojA , editor = GaulW #and# OpitzO #and# SchaderM , title = {{Clustering Relational Data}} , booktitle = {{Data Analysis}} , pages = {3--15} , publisher = pub-springer , year = 2000 } @techreport{bf-crhgi-06 , author = BachmaierC #and# ForsterM , title = {{Crossing Reduction for Hierarchical Graphs with Intra-Level Edges}} , institution = "University of Passau" , number = {MIP-0608} , pdf = "http://www.infosun.fim.uni-passau.de/~chris/down/MIP-0608.pdf" , year = 2006 } @Article{bf-g-67 , author = BowenR #and# FiskS , title = {{Generation of triangulations of the sphere}} , journal = j-mc , pages = {250--252} , volume = 21 , year = 1967 } @article{bf-lsnto-77 , author = BoorstynRR #and# FrankH , title = {{Large Scale Network Topological Optimization}} , journal = j-toc , pages = {29--37} , volume = {Com-25} , year = 1977 } @Article{bf-rlcd-07 , author = FortunatoS #and# BarthelemyM , title = {{Resolution limit in community detection}} , journal = j-pnas , number = 1 , pages = {36--41} , pdf = "http://www.pnas.org/content/104/1/36.full.pdf" , url = "http://www.pnas.org/content/104/1/36.full.pdf" , volume = 104 , year = 2007 } @Article{bfd-gb-99 , author = BatageljV #and# FerligojA #and# DoreianP , title = {{Generalized Blockmodeling}} , journal = j-iijci , pages = {501--506} , url = "http://vlado.fmf.uni-lj.si/pub/networks/doc/ModelInf.ps" , volume = 23 , year = 1999 } @book{bfk-cgpla-93 , editor = BrualdiRA #and# FriedlandS #and# KleeV , title = {{Combinatorial and Graph-Theoretical Problems in Linear Algebra}} , booktitle = {{Combinatorial and Graph-Theoretical Problems in Linear Algebra}} , publisher = pub-springer , year = 1993 } @InProceedings{bfm-cdcpg-05 , author = BonichonN #and# FelsnerS #and# MosbahM , title = {{Convex Drawings of $3$-Connected Plane Graphs}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {60--70} , publisher = pub-springer , series = ser-springer_lncs , volume = 3383 , year = 2005 } @Article{bfm-cdcpg-07 , author = BonichonN #and# FelsnerS #and# MosbahM , title = {{Convex Drawings of 3-Connected Plane Graphs}} , journal = j-alg , pages = {399--420} , volume = 47 , year = 2007 } @InProceedings{bfm-trans-06 , author = BastH #and# FunkeS #and# MatijevicD , title = {{TRANSIT - Ultrafast Shortest-Path Queries with Linear-Time Preprocessing}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}} , month = nov , year = 2006 } @InCollection{bfm-uspqt-09 , author = BastH #and# FunkeS #and# MatijevicD , title = {{Ultrafast Shortest-Path Queries via Transit Nodes}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {175--192} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @InProceedings{bfmmuy-pads-81 , author = BeeriC #and# FaginR #and# MaierD #and# MendelzonAO #and# UllmanJD #and# YannakakisM , title = {{Properties of Acyclic Database Schemes}} , booktitle = {{Proceedings of the 13th Annual {ACM} Symposium on the Theory of Computing (STOC'81)}} , pages = {355--362} , publisher = pub-acm , year = 81 } @Article{bfms-eprn-09 , author = BeierR #and# FunkeS #and# MatijevicD #and# SandersP , title = {{Energy-efficient Paths in Radio Networks}} , journal = j-alg , year = 2009 } @InProceedings{bfmss-itcsp-07 , author = BastH #and# FunkeS #and# MatijevicD #and# SandersP #and# SchultesD , title = {{In Transit to Constant Shortest-Path Queries in Road Networks}} , booktitle = {{Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)}} , pages = {46--59} , publisher = pub-siam , year = 2007 } @Article{bfmy-odads-83 , author = BeeriC #and# FaginR #and# MaierD #and# YannakakisM , title = {{On the Desirability of Acyclic Database Schemes}} , journal = j-acm , month = jul , number = 3 , pages = {479--513} , volume = 30 , year = 1983 } @Article{bfp-dslas-07 , author = BrandesU #and# FleischerD #and# PuppeT , title = {{Dynamic Spectral Layout with an Application to Small Worlds}} , journal = j-jgaa , number = 2 , pages = {325--343} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bfp-dslas-07.pdf" , volume = 11 , year = 2007 } @Article{bfpp-ricpf-07 , author = BohmC #and# FaloutsosC #and# PanJ #and# PlantC , title = {{RIC: Parameter-Free Noise-Robust Clustering}} , journal = j-acmtkdd , month = dec , number = 3 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1297334&type=pdf&coll=portal&dl=ACM&CFID=49478026&CFTOKEN=97" , url = "http://portal.acm.org/citation.cfm?id=1297332.1297334&coll=portal&dl=ACM&idx=J1054&part=transaction&WantType=Transactions&title=ACM%20Transactions%20on%20Knowledge%20Discovery%20from%20Data%20%28TKDD%29&CFID=49478026&CFTOKEN=97837260" , volume = 1 , year = 2007 } @Article{bfss-frrnt-07 , author = BastH #and# FunkeS #and# SandersP #and# SchultesD , title = {{Fast Routing in Road Networks with Transit Nodes}} , journal = j-science , number = 5824 , pages = 566 , volume = 316 , year = 2007 } @InCollection{bfw-sn-13 , author = BrandesU #and# FreemanLC #and# WagnerD , title = {{Social Networks}} , booktitle = {{Handbook of Graph Drawing and Visualization }} , note = {to appear} , publisher = pub-crcp , year = 2013 } @incollection{bg-aaspi-94 , author = BrinkRvd #and# GillesRP , title = {{An axiomatic social power index for hierarchically structured populations of economic agents}} , booktitle = {{Imperfections and Behaviour in Economic Organizations}} , pages = {279--318} , publisher = pub-kapg , year = 1994 } @Article{bg-aoscf-95 , author = BronnimannH #and# GoodrichMT , title = {{Almost Optimal Set Covers in Finite VC-Dimension}} , journal = dcg , number = 4 , pages = {463--479} , volume = 14 , year = 1995 } @article{bg-mddn-00 , author = BrinkRvd #and# GillesRP , title = {{Measuring domination in directed networks}} , journal = j-sn , month = may , number = 2 , pages = {141--157} , volume = 22 , year = 2000 } @InProceedings{bg-ostcc-69 , author = BarnetteDW #and# GruenbaumB , title = {{On Steinitz's Theorem Concerning Convex 3-Polytopes and on Some Properties of Planar Graphs}} , booktitle = {{The Many Facets of Graph Theory}} , pages = {27--40} , publisher = pub-springer , series = ser-springer_lnm , volume = 110 , year = 1969 } @article{bg-rim-01 , author = BauerM #and# GolinelliO , title = {{Random incidence matrices: moments of the spectral density}} , journal = j-jsp , note = {arXiv cond-mat/0007127} , pages = {301--307} , url = "http://www-spht.cea.fr/articles_k2/t00/088/publi.ps.gz" , volume = 103 , year = 2001 } @Article{bg-vrptw1-05 , author = BraeysyO #and# GendreauM , title = {{Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms}} , journal = j-ts , month = feb , number = 1 , pages = {104--118} , volume = 39 , year = 2005 } @Article{bg-vrptw2-05 , author = BraeysyO #and# GendreauM , title = {{Vehicle Routing Problem with Time Windows, Part II: Metaheuristics}} , journal = j-ts , month = feb , number = 1 , pages = {119--139} , volume = 39 , year = 2005 } @misc{bgg-acahb-05 , author = BaurM #and# GaertlerM #and# GoerkeR , title = {{Analyzing the Career of Actors - How to Become Famous Fast}} , note = {Graph Drawing Contest at GD'05, Honorable Mention} , pdf = "http://i11www.ira.uka.de/extra/publications/genreSubmission.pdf" , url = "http://i11www.iti.uni-karlsruhe.de/~rgoerke/gd/genreflyer_full.jar" , year = 2005 } @Article{bggkw-acgpa-08 , author = BaurM #and# GaertlerM #and# GoerkeR #and# KrugM #and# WagnerD , title = {{Augmenting $k$-Core Generation with Preferential Attachment}} , journal = NHM , month = jun , number = 2 , pages = {277--294} , pdf = "http://i11www.ira.uka.de/extra/publications/bggkw-acgpa-08.pdf" , url = "http://aimsciences.org/journals/pdfs.jsp?paperID=3279&mode=full" , volume = 3 , year = 2008 } @InProceedings{bggkw-ggpcs-07 , author = BaurM #and# GaertlerM #and# GoerkeR #and# KrugM #and# WagnerD , title = {{Generating Graphs with Predefined k-Core Structure}} , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'07)}} , month = oct , pdf = "http://i11www.ira.uka.de/extra/publications/bggkw-ggpcs-07.pdf" , year = 2007 } @InProceedings{bggn-ahlo-13 , author = BabenkoM #and# GoldbergAV #and# GuptaA #and# NagarajanV , title = {{Algorithms for Hub Label Optimization}} , booktitle = {{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)}} , note = {to appear} , pdf = "http://research.microsoft.com/pubs/192125/ICALP-BGGN-proc.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 7965 , year = 2013 } @InCollection{bgh-aitub-11 , author = BonichonN #and# GavoilleC #and# HanusseN , title = {{An Information-Theoretic Upper Bound on Planar Graphs UsingWell-Orderly Maps}} , booktitle = {{Towards an Information Theory of Complex Networks: Statistical Methods and Applications}} , pages = {17--46} , publisher = {Birkh{"a}user Verlag} , year = 2011 } @Article{bgk-g-07 , author = BodirskyM #and# GroeplC #and# KangM , title = {{Generating labeled planar graphs uniformly at random}} , journal = j-tcs , number = 3 , pages = {377--386} , volume = 379 , year = 2007 } @Article{bgkmp-hagsr-06 , author = BermondJC #and# GaltierJ #and# KlasingR #and# MoralesN #and# PerennesS , title = {{Hardness and Approximation of Gathering in Static Radio Networks}} , journal = j-ppl , number = 2 , pages = {165--183} , volume = 16 , year = 2006 } @techreport{bgkrw-ggg-11-tr , author = BrunelE #and# GemsaA #and# KrugM #and# RutterI #and# WagnerD , title = {{Generalizing Geometric Graphs}} , institution = kit_wagner , number = {2011-27} , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024246 " , year = 2011 } @InProceedings{bgkrw-ggg-12 , author = BrunelE #and# GemsaA #and# KrugM #and# RutterI #and# WagnerD , title = {{Generalizing Geometric Graphs}} , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}} , pages = {179--190} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/p1t8356v54735312/" , year = 2012 } @Article{bgll-f-08 , author = BlondelV #and# GuillaumeJ #and# LambiotteR #and# LefebvreE , title = {{Fast unfolding of communities in large networks}} , journal = j-smte , number = 10 , pdf = "http://www.iop.org/EJ/article/1742-5468/2008/10/P10008/jstat8_10_p10008.pdf" , url = "http://dx.doi.org/10.1088/1742-5468/2008/10/P10008" , volume = 2008 , year = 2008 } @misc{bgll-fcln-08 , author = BlondelV #and# GuillaumeJ #and# LambiotteR #and# LefebvreE , title = {{Finding Communities in Large Networks}} , note = {\url{http://findcommunities.googlepages.com/}} , url = "http://findcommunities.googlepages.com/" , year = 2008 } @unpublished{bgll-fuch-08 , author = BlondelV #and# GuillaumeJ #and# LambiotteR #and# LefebvreE , title = {{Fast unfolding of community hierarchies in large networks}} , month = mar , note = {ARXIV: 2008arXiv0803.0476B} , pdf = "http://arxiv.org/pdf/0803.0476" , url = "http://arxiv.org/abs/0803.0476" , year = 2008 } @techreport{bgls-ctrd-10 , author = BatzV #and# GeisbergerR #and# LuxenD #and# SandersP , title = {{Compressed Transmission of Route Descriptions}} , institution = "Karlsruhe Institute of Technology (KIT)" , note = {{a}rXiv:1011.4465v1} , year = 2010 } @InProceedings{bglsz-erchr-12 , author = BatzV #and# GeisbergerR #and# LuxenD #and# SandersP #and# ZubkovR , title = {{Efficient Route Compression for Hybrid Route Planning}} , booktitle = {{Proceedings of the 1st Mediterranean Conference on Algorithms}} , publisher = pub-springer , year = 2012 } @InProceedings{bgm-fdsut-10 , author = BergerA #and# GrimmerM #and# MuellerHannemannM , title = {{Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {35--46} , publisher = pub-springer , series = ser-springer_lncs , volume = 6049 , year = 2010 } @InProceedings{bgmo-sdplt-11 , author = BergerA #and# GebhardtA #and# MuellerHannemannM #and# OstrowskiM , title = {{Stochastic Delay Prediction in Large Train Networks}} , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}} , pages = {100--111} , series = ser-oasioasi , volume = 20 , year = 2011 } @InProceedings{bgns-tdcha-10 , author = BatzV #and# GeisbergerR #and# NeubauerS #and# SandersP , title = {{Time-Dependent Contraction Hierarchies and Approximation}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {166--177} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/u787292691813526/" , volume = 6049 , year = 2010 } @Article{bgr-dpglv-04 , author = BarequetG #and# GoodrichMT #and# RileyC , title = {{Drawing Planar Graphs with Large Vertices and Thick Edges}} , journal = j-jgaa , number = 1 , pages = {3--20} , volume = 8 , year = 2004 } @Article{bgs-cpsbd-05 , author = BoseP #and# GudmundssonJ #and# SmidM , title = {{Constructing Plane Spanners of Bounded Degree and Low Weight}} , journal = j-alg , number = {3--4} , pages = {249--264} , volume = 42 , year = 2005 } @article{bgs-ipr-04 , author = BianchiniM #and# GoriM #and# ScarselliF , title = {{Inside PageRank}} , journal = j-tit , note = {in press} , year = 2004 } @techreport{bgs-tdchb-08 , author = BatzV #and# GeisbergerR #and# SandersP , title = {{Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas}} , institution = "ITI Sanders, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)" , year = 2008 } @Article{bgsv-mtdtt-13 , author = BatzV #and# GeisbergerR #and# SandersP #and# VetterC , title = {{Minimum Time-Dependent Travel Times with Contraction Hierarchies}} , journal = j-acm-ea , month = apr , number = {1.4} , pages = {1--43} , volume = 18 , year = 2013 } @InProceedings{bgw-egca-03 , author = BrandesU #and# GaertlerM #and# WagnerD , title = {{Experiments on Graph Clustering Algorithms}} , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}} , isbn = "0302-9743" , pages = {568--579} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2832&spage=568" , volume = 2832 , year = 2003 } @Article{bgw-egcme-07 , author = BrandesU #and# GaertlerM #and# WagnerD , title = {{Engineering Graph Clustering: Models and Experimental Evaluation}} , address = "New York, NY, USA" , doi = "http://doi.acm.org/10.1145/1227161.1227162" , isbn = "1084-6654" , journal = j-acm-ea , number = {1.1} , pages = {1--26} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1227162&type=pdf&coll=GUIDE&dl=GUIDE&CFID=24108080&CFTOKEN=3" , url = "http://portal.acm.org/citation.cfm?id=1227161.1227162" , volume = 12 , year = 2007 } @article{bh-amises-92 , author = BoppanaRB #and# HalldorssonMM , title = {{Approximating Maximum Independent Sets by Excluding Subgraphs}} , journal = j-bit , number = 2 , pages = {180--196} , volume = 32 , year = 1992 } @article{bh-cfg-67 , author = BeinekeLW #and# HararyF , title = {{The connectivity function of a graph}} , journal = j-mathematika , pages = {197--202} , volume = 14 , year = 1967 } @Article{bh-hfca-86 , author = BarnesJ #and# HutP , title = {{A Hierarchical $O(N \log N)$ Force-Calculation Algorithm}} , journal = j-nature , month = dec , pages = {446--449} , pdf = "http://www.nature.com/nature/journal/v324/n6096/pdf/324446a0.pdf" , url = "http://dx.doi.org/10.1038/324446a0" , volume = 324 , year = 1986 } @InProceedings{bh-ppcap-13 , author = BoteaA #and# HaraborD , title = {{Path Planning with Compressed All-Pairs Shortest Paths Data}} , booktitle = {{Proceedings of the 23rd International Conference on Automated Planning and Scheduling}} , publisher = pub-aaaip , year = 2013 } @article{bhk-gmcnv-81 , author = BoeschFT #and# HararyF #and# KabellJA , title = {{Graphs as Models of Communication Network Vulnerability: {Connectivity} and Persistence}} , journal = j-networks , pages = {57--63} , volume = 11 , year = 1981 } @Article{bhkn-amcbl-09 , author = BenkertM #and# HaverkortH #and# KrollM #and# NollenburgM , title = {{Algorithms for Multi-Criteria Boundary Labeling}} , journal = j-jgaa , note = {Special issue of GD 2007} , number = 3 , pages = {289--317} , pdf = "http://i11www.ira.uka.de/extra/publications/bhkn-amcbl-09.pdf" , url = "http://jgaa.info/accepted/2009/BenkertHaverkortKrollNollenburg2009.13.3.pdf" , volume = 13 , year = 2009 } @InProceedings{bhkn-amcos-08 , author = BenkertM #and# HaverkortH #and# KrollM #and# NollenburgM , title = {{Algorithms for Multi-Criteria One-Sided Boundary Labeling}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , pages = {243--254} , pdf = "http://i11www.ira.uka.de/extra/publications/bhkn-amcos-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-77537-9_25" , volume = 4875 , year = 2008 } @InProceedings{bhkp-aoght-07 , author = BhalgatA #and# HariharanR #and# KavithaT #and# PanigrahiD , title = {{An {${\tilde{O}}(mn)$} Gomory-Hu Tree Construction Algorithm for Unweighted Graphs}} , booktitle = {{Proceedings of the 39th Annual {ACM} Symposium on the Theory of Computing (STOC'07)}} , pages = {605--614} , publisher = pub-acm , year = 2007 } @Article{bhs-rtgn-90 , author = BauerD #and# HakimiSL #and# SchmeichelEF , title = {{Recognizing Tough Graphs is NP-hard}} , journal = j-dam , pages = {191--195} , volume = 28 , year = 1990 } @misc{bhsz-socne-03 , author = BoerP #and# HuismanM #and# SnijdersTAB #and# ZeggelinkE , title = {{{StOCNET}: an open software system for the advanced statistical analysis of social networks}} , institution = "Groningen: {ProGAMMA} / {ICS}" , year = 2003 } @techreport{bht-p-06 , author = BorosE #and# HammerPL #and# TavaresG , title = {{Preprocessing of unconstrained quadratic binary optimization}} , institution = "Rutgers Center for Operations Research (RUTCOR)" , number = 10 , url = "http://rutcor.rutgers.edu/pub/rrr/reports2006/10_2006.pdf" , year = 2006 } @article{bhz-csip-87 , author = BoppanaRB #and# HastadJ #and# ZachosS , title = {{Does co-{$\mathcal{NP}$} have short interactive proofs?}} , journal = "Information Pro" , pages = {127--132} , volume = 25 , year = 1987 } @InProceedings{bj-dpch-02 , author = BrodalG #and# JacobR , title = {{Dynamic Planar Convex Hull}} , booktitle = {{Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02)}} , pages = {617--626} , publisher = pub-ieeecs , url = "http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181985" , year = 2002 } @techreport{bj-lsc-03 , author = BachFR #and# JordanMI , title = {{Learning Spectral Clustering}} , institution = "Computer Science Division (EECS), University of California " , number = {UCB/CSD-03-1249} , pdf = "http://vision.jhu.edu/reading_group/LearningSpectralClustering.pdf" , year = 2003 } @InProceedings{bj-lsc-04 , author = BachFR #and# JordanC , title = {{Learning Spectral Clustering}} , booktitle = {{Advances in Neural Information Processing Systems 16}} , pdf = "http://books.nips.cc/papers/files/nips16/NIPS2003_AA39.pdf" , publisher = pub-mitpr , url = "http://books.nips.cc/nips16.html" , year = 2004 } @InProceedings{bj-tnmaf-04 , author = BrodalG #and# JacobR , title = {{Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries}} , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}} , pages = {3--15} , series = ser-entcs , volume = 92 , year = 2004 } @Article{bjm-flcpp-00 , author = BarrettC #and# JacobR #and# MaratheMV , title = {{Formal-Language-Constrained Path Problems}} , journal = j-sicomp , number = 3 , pages = {809--837} , volume = 30 , year = 2000 } @InProceedings{bk-abhog-94 , author = BiedlT #and# KantG , title = {{A Better Heuristic for Orthogonal Graph Drawings}} , booktitle = {{Proceedings of the 2nd Annual European Symposium on Algorithms (ESA'94)}} , month = sep , pages = {24--35} , pdf = "http://www.springerlink.com/content/h775q2054151x16m/fulltext.pdf" , series = ser-springer_lncs , url = "http://www.springerlink.com/content/h775q2054151x16m/" , volume = 855 , year = 1994 } @InProceedings{bk-aesig-97 , author = BiedlTC #and# KaufmannM , title = {{Area-Efficient Static and Incremental Graph Drawings}} , booktitle = {{Proceedings of the 5th Annual European Symposium on Algorithms (ESA'97)}} , month = sep , pages = {37--52} , publisher = pub-springer , series = ser-springer_lncs , volume = 1284 , year = 1997 } @InProceedings{bk-ao-96 , author = BenzurA #and# KargerDR , title = {{Approximating s-t minimum cuts in $\tilde{O}(n^2)$ time}} , booktitle = {{Proceedings of the 28th Annual {ACM} Symposium on the Theory of Computing (STOC'96)}} , pages = {47--55} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=237827&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61366998&CFTOKEN=43" , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=237827" , year = 1996 } @article{bk-facug-73 , author = BronC #and# KerboschJAGM , title = {{Algorithm 457: Finding all cliques of an undirected graph}} , journal = j-comm-acm , number = 9 , pages = {575--577} , volume = 16 , year = 1973 } @InProceedings{bk-fshca-02 , author = BrandesU #and# KoepfB , title = {{Fast and Simple Horizontal Coordinate Assignmen}} , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}} , month = jan , pages = {31--44} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/j8b63vh3yatf17mk/" , volume = 2265 , year = 2002 } @InCollection{bk-sa-05 , author = BaltzA #and# KliemannL , title = {{Spectral Analysis}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {373--416} , pdf = "http://springerlink.metapress.com/content/yrpdymqmb0uckvnp/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/yrpdymqmb0uckvnp/" , volume = 3418 , year = 2005 } @Article{bk-tiu-10 , author = BodlaenderHL #and# KosterAM , title = {{Treewidth computations I. Upper bounds}} , journal = j-ic , number = 3 , pages = {259--275} , volume = 208 , year = 2010 } @Article{bk-udgrn-98 , author = BreuH #and# KirkpatrickS , title = {{Unit Disk Graph Recognition is NP-hard}} , journal = j-cgta , number = {1-2} , pages = {3--24} , url = "http://dx.doi.org/10.1016/S0925-7721(97)00014-X" , volume = 9 , year = 1998 } @Article{bkk-otpgf-97 , author = BiedlT #and# KantG #and# KaufmannM , title = {{On Triangulating Planar Graphs under the Four-Connectivity Constraint}} , journal = j-alg , pages = {427--446} , volume = 19 , year = 1997 } @InProceedings{bklww-dws3d-98 , author = BrandesU #and# KaeaebV #and# LoehA #and# WagnerD #and# WillhalmT , title = {{Dynamic web structures in 3d}} , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}} , location = "Montreal, Canada" , month = jan , note = {``Honorable Mention'' beim {\em Graph Drawing Contest 1998}, s. Graph-Drawing Contest Report by P.~E} , pages = {423--435} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/8cm2ulm1qtc9/" , volume = 1547 , year = 1999 } @Article{bklww-dwsd-00 , author = BrandesU #and# KaeaebV #and# LoehA #and# WagnerD #and# WillhalmT , title = {{Dynamic Web Structures in 3D}} , journal = j-jgaa , number = 3 , pages = {183--191} , url = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bklww-dws3d-00.ps.gz" , volume = 4 , year = 2000 } @InProceedings{bkm-icci-00 , author = BroderA #and# KrauthgamerR #and# MitzenmacherM , title = {{Improved Classification via Connectivity Information}} , booktitle = {{Proceedings of the 11th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'00)}} , pages = {576--585} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=338610&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36008740&CFTOKEN=37" , publisher = pub-siam , url = "http://portal.acm.org/citation.cfm?id=338610" , year = 2000 } @InProceedings{bkmm-abc-07 , author = BaderDA #and# KintaliS #and# MadduriK #and# MihailM , title = {{Approximating Betweenness Centrality }} , booktitle = {{Algorithms and Models for the Web-Graph, Proceedings of the 5th International Workshop, WAW 2007}} , pages = {124--137} , pdf = "http://www.springerlink.com/content/w327302k835n02h8/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-77004-6_10" , volume = 4863 , year = 2007 } @article{bkmrrstw-gsw-00 , author = BroderA #and# KumarR #and# MaghoulF #and# RaghavanP #and# RajagopalanS #and# StataR #and# TomkinsAS #and# WienerJ , title = {{Graph structure in the Web}} , journal = j-cn , number = {1--6} , pages = {309--320} , volume = 33 , year = 2000 } @InProceedings{bkms-aaawg-06 , author = BonifaciV #and# KortewegP #and# MarchettiSpaccamelaA #and# StougieL , title = {{An Approximation Algorithm for the Wireless Gathering Problem}} , booktitle = {{Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT'06)}} , publisher = pub-springer , series = ser-springer_lnm , year = 2006 } @InProceedings{bkmw-srn-10 , author = BauerR #and# KrugM #and# MeinertS #and# WagnerD , title = {{Synthetic Road Networks}} , booktitle = {{Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'10)}} , pages = {46--57} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-14355-7_6" , volume = 6124 , year = 2010 } @InProceedings{bkns-blol-08 , author = BekosM #and# KaufmannM #and# NollenburgM #and# SymvonisA , title = {{Boundary Labeling with Octilinear Leaders}} , booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08)}} , pages = {234--245} , pdf = "http://i11www.ira.uka.de/extra/publications/bkns-blol-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-69903-3_22" , volume = 5124 , year = 2008 } @Article{bkns-blol-09 , author = BekosM #and# KaufmannM #and# NollenburgM #and# SymvonisA , title = {{Boundary Labeling with Octilinear Leaders}} , journal = j-alg , note = {Special issue of SWAT 2008} , number = 3 , pages = {436--461} , pdf = "http://i11www.ira.uka.de/extra/publications/bkns-blol-09.pdf" , url = "http://dx.doi.org/10.1007/s00453-009-9283-6" , volume = 57 , year = 2010 } @Article{bkr-etnv-06 , author = BrandesU #and# KenisP #and# RaabJ , title = {{Explanation Through Network Visualization}} , journal = j-m , number = 1 , pages = {16--23} , url = "http://content.apa.org/journals/med/2/1/16.html" , volume = 2 , year = 2006 } @InProceedings{bkr-seeor-13 , author = BlaesiusT #and# KarrerA #and# RutterI , title = {{Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices}} , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , year = 2014 } @Article{bkrsw-evpn-99 , author = BrandesU #and# KenisP #and# RaabJ #and# SchneiderV #and# WagnerD , title = {{Explorations into the Visualization of Policy Networks}} , journal = j-jtp , number = 1 , pages = {75--106} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bkrsw-evpn-99.pdf" , volume = 11 , year = 1999 } @InProceedings{bkrw-ogdfc-10 , author = BlaesiusT #and# KrugM #and# RutterI #and# WagnerD , title = {{Orthogonal Graph Drawing with Flexibility Constraints}} , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}} , pages = {92--104} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_9" , volume = 6502 , year = 2011 } @Article{bkrw-ogdfc-12 , author = BlaesiusT #and# KrugM #and# RutterI #and# WagnerD , title = {{Orthogonal Graph Drawing with Flexibility Constraints}} , journal = j-alg , year = 2012 } @techreport{bkrw-ogdfc-tr10 , author = BlaesiusT #and# KrugM #and# RutterI #and# WagnerD , title = {{Orthogonal Graph Drawing with Flexibility Constraints}} , institution = iti_wagner , number = {2010-18} , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000019793" , year = 2010 } @InProceedings{bks-rsaac-02 , author = BarYosseffZ #and# KumarR #and# SivakumarD , title = {{Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs}} , booktitle = {{Proceedings of the 13th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'02)}} , pages = {623--632} , url = "http://portal.acm.org/citation.cfm?id=545464" , year = 2002 } @InProceedings{bkt-affci-07 , author = Berger-WolfT #and# KempeD #and# TantipathananandthC , title = {{A Framework For Community Identification in Dynamic Social Networks}} , booktitle = {{Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}} , pdf = "http://compbio.cs.uic.edu/~tanya/research/pubs/TantipathananandhEtal_NetworkCommunities07.pdf" , publisher = pub-acm , url = "http://compbio.cs.uic.edu/~tanya/research/pubs/TantipathananandhEtal_NetworkCommunities07.pdf" , year = 2007 } @Article{bkw-ccpnd-03 , author = BrandesU #and# KenisP #and# WagnerD , title = {{Communicating Centrality in Policy Network Drawings}} , journal = j-tvcg , number = 2 , pages = {241--253} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bkw-ccpnd-03.pdf" , volume = 9 , year = 2003 } @InProceedings{bkw-cpnd-00 , author = BrandesU #and# KenisP #and# WagnerD , title = {{Centrality in Policy Network Drawings}} , booktitle = {{Proceedings of the 7th International Symposium on Graph Drawing (GD'99)}} , location = "Stirin Castle, Czech Republic" , month = jan , pages = {250--258} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bkw-cpnd-99.ps.gz" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/02ctp54ec2kxkyhl/" , volume = 1731 , year = 2000 } @techreport{bkw-dtpg-01 , author = BrandesU #and# KaeaebV #and# WagnerD , title = {{Dual Traversals of Planar Graphs}} , institution = "Universit{\"a}t Konstanz" , year = 2001 } @InProceedings{bkw-egldg-10 , author = BauerR #and# KrugM #and# WagnerD , title = {{Enumerating and Generating Labeled k-Degenerate Graphs}} , booktitle = {{Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO '10)}} , pages = {90--98} , publisher = pub-siam , year = 2010 } @inproceedings{bl-afsvl-84 , author = BhattSN #and# LeightonFT , title = {{A Framework for Solving VLSI Graph Layout Problems}} , number = 2 , pages = {300--343} , volume = 28 , year = 1984 } @article{bl-laia-75 , author = BoothKS #and# LuekerGS , title = {{Linear algorithms to recognize interval graphs and test for consecutive ones property}} , journal = "proc-stoc-75" , pages = {255--265} , year = 1975 } @inproceedings{bl-ssg-04 , author = BrandesU #and# LernerJ , title = {{Structural Similarity in Graphs}} , booktitle = {{Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'04)}} , pages = {184--195} , series = ser-springer_lncs , volume = 3341 , year = 2004 } @Article{blcs-gbaga-87 , author = BuiTN #and# LeightonFT #and# ChaudhuriS #and# SipserM , title = {{Graph Bisection Algorithms with Good Average Case Behavior}} , journal = j-comb , number = 2 , pages = {171--191} , pdf = "http://www.springerlink.com/content/u00w011807910743/fulltext.pdf" , url = "http://www.springerlink.com/content/u00w011807910743/" , volume = 7 , year = 1987 } @InProceedings{bllmm-vsccg-08 , author = BrandesU #and# LernerJ #and# LubbersMJ #and# McCartyC #and# MolinaJL , title = {{Visual Statistics for Collections of Clustered Graphs}} , booktitle = {{Proceedings of IEEE Pacific Visualization Symposium}} , note = {to appear} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bllmm-vsccg-08.pdf" , year = 2008 } @InProceedings{bm-aqcsm-12 , author = BrandesU #and# MaderM , title = {{A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing}} , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}} , pages = {99--110} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-25878-7_11" , year = 2012 } @Article{bm-f-07 , author = BrinkmannG #and# McKayBD , title = {{Fast generation of planar graphs}} , journal = j-matchcmcc , number = 2 , pages = {323--357} , url = "http://cs.anu.edu.au/~bdm/plantri/" , volume = 58 , year = 2007 } @Book{bm-gt-08 , author = BondyJA #and# MurtyUS , title = {{Graph Theory}} , booktitle = {{Graph Theory}} , publisher = pub-springer , series = ser-springer_gtm , year = 2008 } @Book{bm-gtha-76 , author = BondyJA #and# MurtyUS , title = {{Graph Theory with Applications}} , booktitle = {{Graph Theory with Applications}} , publisher = pub-macmillan , year = 1976 } @InCollection{bm-ldd-01 , author = BastertO #and# MatuszewskiC , title = {{Layered Drawings of Digraphs}} , booktitle = {{Drawing Graphs: Methods and Models}} , chapter = 5 , isbn = "3-540-42062-2" , pages = {87--120} , pdf = "http://www.springerlink.com/content/xl91uu3fwk0fhejj/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/xl91uu3fwk0fhejj/" , volume = 2025 , year = 2001 } @article{bm-pajek-98 , author = BatageljV #and# MrvarA , title = {{$\mathsf{Pajek}$ -- A Program for Large Network Analysis}} , journal = j-c , number = 2 , pages = {47--57} , volume = 21 , year = 1998 } @InCollection{bm-pavln-03 , author = BatageljV #and# MrvarA , title = {{Pajek - Analysis and Visualization of Large Networks}} , booktitle = {{Graph Drawing Software}} , isbn = "3-540-00881-0" , pages = {77--103} , publisher = pub-springer , url = "http://www.springer.com/math/cse/book/978-3-540-00881-1" , year = 2003 } @Book{bm-pgt-84 , editor = BondyJA #and# MurtyUS , title = {{Progress in Graph Theory}} , booktitle = {{Progress in Graph Theory}} , publisher = pub-ap , year = 1984 } @Article{bm-sdcs-71 , author = BruggesserH #and# ManicG , title = {{Shellable Decompositions of Cells and Spheres.}} , journal = j-msc , pages = {197--205} , volume = 29 , year = 1971 } @InProceedings{bm-snaps-08 , author = BaderDA #and# MadduriK , title = {{SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks}} , booktitle = {{22nd International Parallel and Distributed Processing Symposium (IPDPS'08)}} , pages = {1--12} , publisher = pub-ics , year = 2008 } @techreport{bm-somcs-09 , author = BergerA #and# MuellerHannemannM , title = {{Subpath-Optimality of Multi-Criteria Shortest Paths in Time- and Event-Dependent Networks}} , institution = "University Halle-Wittenberg, Institute of Computer Science" , number = 1 , year = 2009 } @Book{bmmn-horms-95 , editor = BallMO #and# MagnantiTL #and# MonmaCL #and# NemhauserGL , title = {{Handbooks in Operations Research/Management Science, Volume on Networks}} , booktitle = {{Handbooks in Operations Research/Management Science, Volume on Networks}} , publisher = pub-nh , year = 1995 } @inproceedings{bmpp-bgpsv-03 , author = DiBattistaG #and# MarianiF #and# PatrignaniM #and# PizzoniaM , title = {{BGPlay: A System for Visualizing the Interdomain Routing Evolution}} , booktitle = {{Proceedings of the 11th International Symposium on Graph Drawing (GD'03)}} , month = jan , pages = {295--306} , publisher = pub-springer , series = ser-springer_lncs , volume = 2912 , year = 2004 } @InCollection{bmsssw-a- , author = BaderDA #and# MeyerhenkeH #and# SandersP #and# SchulzC #and# SchummA #and# WagnerD , title = {{Benchmarking for Graph Clustering and Partitioning}} , booktitle = {{Encyclopedia of Social Network Analysis and Mining}} , note = {to appear} , publisher = pub-springer , year = 2013 } @Article{bmw-qiiit-07 , author = BungartzH #and# MeinelC #and# WilhelmR , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 1 einer Nachlese zum Perspektiven-Workshop in Dagstuhl}} , journal = j-is , month = jun , number = 3 , pages = {207--211} , url = "http://springerlink.com" , volume = 30 , year = 2007 } @Article{bmw-qiiit2-07 , author = BungartzH #and# MeinelC #and# WilhelmR , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 2 einer Nachlese zum Perspektiven Workshop in Dagstuhl im November 2006}} , journal = j-is , month = aug , number = 4 , pages = {291--296} , url = "http://springerlink.com" , volume = 30 , year = 2007 } @Article{bmw-qiiit3-07 , author = BungartzH #and# MeinelC #and# WilhelmR , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 3 einer Nachlese zum Perspektiven-Workshop in Dagstuhl im November 2006}} , journal = j-is , month = oct , number = 5 , pages = {374--377} , url = "http://springerlink.com" , volume = 30 , year = 2007 } @Article{bmw-qiiit4-07 , author = BungartzH #and# MeinelC #and# WilhelmR , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 4 einer Nachlese zum Perspektiven-Workshop in Dagstuhl im November 2006}} , journal = j-is , month = dec , number = 6 , pages = {458--459} , url = "http://springerlink.com" , volume = 30 , year = 2007 } @InProceedings{bn-ialmo-07 , author = BenkertM #and# NollenburgM , title = {{Improved Algorithms for Length-Minimal One-Sided Boundary Labeling}} , booktitle = {{Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07)}} , pages = {190--193} , pdf = "http://i11www.ira.uka.de/extra/publications/bn-ialmo-07.pdf" , year = 2007 } @InProceedings{bnpw-oarcd-08 , author = BeenK #and# NollenburgM #and# PoonSH #and# WolffA , title = {{Optimizing Active Ranges for Consistent Dynamic Map Labeling}} , booktitle = {{Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)}} , pages = {10--19} , pdf = "http://i11www.ira.uka.de/extra/publications/bnpw-oarcd-08.pdf" , publisher = pub-acm , url = "http://dl.acm.org/authorize?087167" , year = 2008 } @InProceedings{bnpw-oarcd-08ecg , author = BeenK #and# NollenburgM #and# PoonSH #and# WolffA , title = {{Optimizing Active Ranges for Consistent Dynamic Map Labeling}} , booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)}} , pages = {55--58} , pdf = "http://i11www.ira.uka.de/extra/publications/bnpw-oarcd-08ecg.pdf" , year = 2008 } @Article{bnpw-oarcd-10 , author = BeenK #and# NollenburgM #and# PoonSH #and# WolffA , title = {{Optimizing Active Ranges for Consistent Dynamic Map Labeling}} , journal = j-cgta , note = {Special issue of SoCG 2008} , number = 3 , pages = {312--328} , pdf = "http://i11www.ira.uka.de/extra/publications/bnpw-oarcd-10.pdf" , url = "http://dx.doi.org/10.1016/j.comgeo.2009.03.006" , volume = 43 , year = 2010 } @Article{bnsww-pnasp-99 , author = BrandesU #and# NeyerG #and# SchlickenriederW #and# WagnerD #and# WeiheK , title = {{\textsc{PlaNet}---A Software Package for Algorithms and Heuristics on Planar Networks}} , journal = j-dam , pages = {91--110} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bnsww-pspah-99.pdf" , volume = 92 , year = 1999 } @InProceedings{bnuw-miecw-07 , author = BenkertM #and# NollenburgM #and# UnoT #and# WolffA , title = {{Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps}} , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}} , month = jan , pages = {270--281} , pdf = "http://i11www.ira.uka.de/extra/publications/bnuw-miecw-07.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-70904-6_27" , volume = 4372 , year = 2007 } @techreport{bnw-edppg-96 , author = BrandesU #and# NeyerG #and# WagnerD , title = {{Edge-Disjoint Paths in Planar Graphs with Minimum Total Length}} , institution = "Universit{\"a}t Konstanz" , note = {Konstanzer Schriften in Mathematik und Informatik} , number = 19 , year = 1996 } @misc{boost , title = {{Boost C++ Libraries}} , url = "http://www.boost.org/" } @article{bop-acg-02 , author = BeinekeLW #and# OellermannOR #and# PippertRE , title = {{The average connectivity of a graph}} , journal = j-dima , month = may , number = 1 , pages = {31--45} , volume = 252 , year = 2002 } @article{bp-alhws-98 , author = BrinS #and# PageL , title = {{The Anatomy of a Large-Scale Hypertextual Web Search Engine}} , journal = j-cn_isdn , number = {1--7} , pages = {107--117} , volume = 30 , year = 1998 } @Article{bp-celn-07 , author = BrandesU #and# PichC , title = {{Centrality Estimation in Large Networks}} , journal = j-ijbc , number = 7 , pages = {2303--2318} , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bp-celn-06.pdf" , volume = 17 , year = 2007 } @incollection{bp-dvn-85 , author = BondJ #and# PeyratC , editor = AlaviY #and# ChartrandG #and# LesniakL #and# LickDR #and# WallCE , title = {{Diameter Vulnerability in Networks}} , booktitle = {{Graph Theory with Applications to Algorithms and Computer Science}} , pages = {123--149} , publisher = pub-wiley , year = 1985 } @InProceedings{bp-empms-07 , author = BrandesU #and# PichC , title = {{Eigensolver Methods for Progressive Multidimensional Scaling of Large Data}} , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}} , month = jan , pages = {42--53} , pdf = "http://www.inf.uni-konstanz.de/cgip/bib/files/BrPi06.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/8651606146q45707/" , volume = 4372 , year = 2007 } @Article{bpda-m-04 , author = BogunaM #and# PastorSatorrasR #and# DiazGuileraA #and# ArenasA , title = {{Models of social networks based on social distance attachment}} , journal = j-pr-e , month = nov , volume = 70 , year = 2004 } @InProceedings{br-drpse-12 , author = BlaesiusT #and# RutterI , title = {{Disconnectivity and Relative Positions in Simultaneous Embeddings}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 7704 , year = 2013 } @incollection{br-mrsfr-02 , author = BollobasB #and# RiordanOM , title = {{Mathematical results on scale-free random graphs}} , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}} , pages = {1--34} , publisher = pub-wiley-vch , url = "http://dx.doi.org/10.1002/3527602755.fmatter" , year = 2002 } @InProceedings{br-spqoa-13 , author = BlaesiusT #and# RutterI , title = {{Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems}} , booktitle = {{Proceedings of the 24th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'13)}} , publisher = pub-siam , year = 2013 } @inproceedings{brrt-fahfl-01 , author = BorodinA #and# RobertsGO #and# RosenthalJS #and# TsaparasP , title = {{Finding authorities and hubs from link structures on the World Wide Web}} , address = "Hong Kong" , booktitle = {{Proceedings of the 10th International World Wide Web Conference (WWW10)}} , pages = {415--429} , year = 2001 } @article{brs-sah-92 , author = BotafogoRA #and# RivlinE #and# ShneidermanB , title = {{Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics}} , journal = j-acm-tois , number = 2 , pages = {142--180} , volume = 10 , year = 1992 } @article{brst-dssfr-01 , author = BollobasB #and# RiordanOM #and# SpencerJ #and# TusnadyG , title = {{The Degree Sequence of a Scale-Free Random Graph Process}} , journal = j-rsa , pages = {279--290} , volume = 18 , year = 2001 } @Article{brt-sudsp-08 , author = BuriolL #and# ResendeM #and# ThorupM , title = {{Speeding Up Dynamic Shortest-Path Algorithms}} , journal = j-ijc2 , number = 2 , pages = {191--204} , volume = 20 , year = 2008 } @InProceedings{brw-dulpd-07 , author = BurriN #and# RickenbachPv #and# WattenhoferM , title = {{Dozer: Ultra-Low Power Data Gathering in Sensor Networks}} , booktitle = {{Sixth International Symposium on Information Processing in Sensor Networks (IPSN 2007)}} , pages = {450--459} , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=1236360.1236417" , year = 2007 } @Article{brw-envsd-01 , author = BrandesU #and# RaabJ #and# WagnerD , title = {{Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections}} , journal = j-ss , month = oct , number = 4 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/brw-envsd-01.pdf" , volume = 2 , year = 2001 } @InProceedings{brw-oogdc-13 , author = BlaesiusT #and# RutterI #and# WagnerD , title = {{Optimal Orthogonal Graph Drawing with Convex Bend Costs}} , booktitle = {{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , volume = 7965 , year = 2013 } @InProceedings{bs-aamas-90 , author = BergerB #and# ShorPW , title = {{Approximation Algorithms for the Maximum Acyclic Subgraph Problem}} , booktitle = {{Proceedings of the 1st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'90)}} , month = jan , pages = {236--243} , year = 1990 } @techreport{bs-dgdv-08 , author = BaurM #and# SchankT , title = {{Dynamic Graph Drawing in visone}} , institution = iti_wagner , number = {2008-5} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/244200" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007990" , year = 2008 } @Article{bs-fmirs-94 , author = BarnardST #and# SimonH , title = {{Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems}} , journal = j-ccpe , number = 2 , pages = {101--117} , volume = 6 , year = 1994 } @article{bs-gdmbm-98 , author = BunkeH #and# ShearerK , title = {{A graph distance metric based on the maximal common subgraph}} , journal = j-patrl , pages = {255--259} , url = "http://citeseer.ist.psu.edu/bunke98graph.html" , volume = 19 , year = 1998 } @Book{bs-hgn-02 , editor = BornholdtS #and# SchusterHG , title = {{Handbook of Graphs and Networks: From the Genome to the Internet}} , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}} , publisher = pub-wiley-vch , url = "http://dx.doi.org/10.1002/3527602755.fmatter" , year = 2002 } @InCollection{bs-nm-05 , author = BaumannN #and# StillerS , title = {{Network Models}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {341--372} , pdf = "http://springerlink.metapress.com/content/2h2khh83uwtuvxjp/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/2h2khh83uwtuvxjp/" , volume = 3418 , year = 2005 } @InCollection{bs-ns-05 , author = BrinkmeierM #and# SchankT , title = {{Network Statistics}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {293--317} , pdf = "http://springerlink.metapress.com/content/u4fwpdqqp4rn3jtw/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/u4fwpdqqp4rn3jtw/" , volume = 3418 , year = 2005 } @Article{bs-rcgp-95 , author = BarnesTM #and# SavageCD , title = {{A Recurrence for Counting Graphical Partitions}} , journal = j-ecomb , number = {R11} , pages = {1--10} , pdf = "http://www.emis.ams.org/journals/EJC/Volume_2/PDFFiles/v2i1r11.pdf" , url = "http://www.emis.ams.org/journals/EJC/Volume_2/volume2.html#R11" , volume = 2 , year = 1995 } @Article{bs-rpg-93 , author = BrightwellGR #and# ScheinermanER , title = {{Representations of Planar Graphs}} , journal = j-sidma , month = may , number = 2 , pages = {214--229} , volume = 6 , year = 1993 } @InProceedings{bs-tdrpg-12 , author = BatzV #and# SandersP , title = {{Time-Dependent Route Planning with Generalized Objective Functions}} , booktitle = {{Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 7501 , year = 2012 } @Article{bsst-drs-40 , author = BrooksRL #and# SmithCAB #and# StoneAH #and# TutteWT , title = {{The Dissection of Rectangles into Squares}} , journal = j-duke-mj , pages = {312--340} , url = "http://projecteuclid.org/euclid.dmj/1077492259" , volume = 7 , year = 1940 } @InProceedings{bstw-flmtg-01 , author = BrandesU #and# ShubinaG #and# TamassiaR #and# WagnerD , title = {{Fast Layout Methods for Timetable Graphs}} , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {127--138} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bstw-flmtg-01.ps.gz" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/6v3wl11ec42nh9lr/" , volume = 1984 , year = 2001 } @Article{bsww-gncsp-04 , author = BrandesU #and# SchulzF #and# WagnerD #and# WillhalmT , title = {{Generating Node Coordinates for Shortest-Path Computations in Transportation Networks}} , journal = j-acm-ea , pages = {1--16} , url = "http://jea.acm.org/volume9.html" , volume = 9 , year = 2004 } @InProceedings{bsww-tpsmm-01 , author = BrandesU #and# SchulzF #and# WagnerD #and# WillhalmT , title = {{Travel Planning with Self-Made Maps}} , booktitle = {{Proceedings of the 3rd International Workshop on Algorithm Engineering and Experiments (ALENEX'01)}} , pages = {132--144} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bsww-tpsmm-01.ps.gz" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/30tdmcanl0dfu5v3/" , volume = 2153 , year = 2001 } @inproceedings{bt-diplt-02 , author = BuT #and# TowsleyD , title = {{On Distinguishing between {Internet} Power Law Topology Generators}} , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , publisher = pub-ieeecs , volume = 1 , year = 2002 } @inproceedings{bt-ipt-89 , author = DiBattistaG #and# TamassiaR , title = {{Incremental Planarity Testing}} , booktitle = {{Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89)}} , month = oct , pages = {436--441} , year = 1989 } @article{bt-ogicn-70 , author = BoeschFT #and# ThomasRE , title = {{On Graphs of Invulnerable Communication Nets}} , journal = j-tct , volume = {CT-17} , year = 1970 } @article{bt-olmtc-96 , author = DiBattistaG #and# TamassiaR , title = {{On-Line Maintenance of Triconnected Components with {SPQR}-Trees}} , journal = j-alg , pages = {302--318} , volume = 15 , year = 1996 } @techreport{bt-rgar-03 , author = BodlaenderHL #and# TelG , title = {{Rectilinear Graphs and Angular Resolution}} , institution = "Department of Information and Computing Sciences, Utrecht University" , number = {UU-CS-2003} , pdf = "http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-033.pdf" , url = "http://www.cs.uu.nl/research/techreps/UU-CS-2003-033.html" , year = 2003 } @Article{bt-tmacl-04 , author = BaranyI #and# TokushigeN , title = {{The Minimum Area of Convex Lattice $n$-Gons}} , journal = j-comb , month = apr , number = 2 , pages = {171--185} , pdf = "http://www.springerlink.com/content/t20rrl7pf3hwk7n4/fulltext.pdf" , url = "http://www.springerlink.com/content/t20rrl7pf3hwk7n4/" , volume = 24 , year = 2004 } @Article{bu-tsdtc-89 , author = BairdD #and# UlanowiczRE , title = {{The Seasonal Dynamics of The Chesapeake Bay Ecosystem}} , journal = j-ecmo , month = dec , number = 4 , pages = {329--364} , url = "http://www.esajournals.org/doi/abs/10.2307/1943071" , volume = 59 , year = 1989 } @book{bv-co-04 , author = BoydS #and# VandenbergheL , title = {{Convex Optimization}} , publisher = pub-cup , year = 2004 } @Article{bvdj-oaccc-08 , author = BonizzoniP #and# VedovaGD #and# DondiR #and# JiangT , title = {{On the Approximation of Correlation Clustering and Consensus Clustering}} , journal = j-css , number = 5 , pages = {671--696} , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6WJ0-4P06CRB-2-1&_cdi=6864&_user=2149863&_o" , url = "http://dx.doi.org/10.1016/j.jcss.2007.06.024" , volume = 74 , year = 2008 } @Article{bvw-taar-06 , author = BerberichK #and# VazirgiannisM #and# WeikumG , title = {{Time-Aware Authority Ranking}} , journal = j-im , number = 3 , pages = {301--332} , pdf = "http://www.internetmathematics.org/volumes/2/3/Berberich.pdf" , url = "http://www.internetmathematics.org/volumes/2.htm" , volume = 2 , year = 2006 } @InProceedings{bvwz-sdchg-07 , author = BeregS #and# VolkerM #and# WolffA #and# ZhangY , title = {{Straightening Drawings of Clustered Hierarchical Graphs}} , booktitle = {{Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}} , isbn = "978-3-540-69506-6" , location = "Harrachov, Czech Republic" , month = jan , pages = {176--187} , pdf = "http://i11www.ira.uka.de/extra/publications/bvwz-sdchg-07.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/8164050221104v54/" , volume = 4362 , year = 2007 } @Article{bvz-faemg-01 , author = BoykovY #and# VekslerO #and# ZabihR , title = {{Fast Approximate Energy Minimization via Graph Cuts}} , journal = j-tpami , pages = {1222--1239} , volume = 23 , year = 2001 } @Article{bw-altaa-00 , author = BrandesU #and# WagnerD , title = {{A Linear Time Algorithm for the Arc Disjoint {Menger} Problem in Directed Planar Graphs}} , journal = j-alg , number = 1 , pages = {16--36} , pdf = "http://www.springerlink.de/content/8u5qnvlfytmpt3gy/fulltext.pdf" , url = "http://www.springerlink.de/content/8u5qnvlfytmpt3gy/" , volume = 28 , year = 2000 } @techreport{bw-bdss-tr , author = BauerR #and# WagnerD , title = {{Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study}} , institution = iti_wagner , number = {2009,6} , pdf = "http://i11www.ira.uka.de/extra/publications/bw-bdss-tr.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000010926" , year = 2009 } @InProceedings{bw-bdsss-09 , author = BauerR #and# WagnerD , title = {{Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study}} , booktitle = {{Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)}} , month = jun , pages = {51--62} , pdf = "http://i11www.ira.uka.de/extra/publications/bw-bdsss-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5526 , year = 2009 } @InProceedings{bw-bpdgl-98 , author = BrandesU #and# WagnerD , title = {{A {Bayesian} paradigm for dynamic graph layout}} , booktitle = {{Proceedings of the 5th International Symposium on Graph Drawing (GD'97)}} , location = "Rome, Italy" , month = jan , pages = {236--247} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/x7r71r316847/" , volume = 1353 , year = 1998 } @InProceedings{bw-cvass-00 , author = BrandesU #and# WagnerD , title = {{Contextual Visualization of Actor Status in Social Networks}} , booktitle = {{Proceedings of the 2nd Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym'00)}} , pages = {13--22} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bw-cvass-00.ps.gz" , publisher = pub-springer , year = 2000 } @InProceedings{bw-dgefb-98 , author = BrandesU #and# WagnerD , title = {{Dynamic Grid Embedding with Few Bends and Changes}} , booktitle = {{Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98)}} , pages = {89--98} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bw-dgefb-98.ps.gz" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/index/29mcxvep69mawk58.pdf" , volume = 1533 , year = 1998 } @InProceedings{bw-ltaad-97 , author = BrandesU #and# WagnerD , title = {{A linear time algorithm for the arc disjoint {Menger} problem in planar directed graphs}} , booktitle = {{Proceedings of the 5th Annual European Symposium on Algorithms (ESA'97)}} , month = sep , pages = {64--77} , publisher = pub-springer , series = ser-springer_lncs , volume = 1284 , year = 1997 } @Article{bw-n-04 , author = BrandesU #and# WagnerD , title = {{Netzwerkvisualisierung}} , journal = j-it , number = 3 , pages = {129--134} , volume = 46 , year = 2004 } @article{bw-pswnm-00 , author = BarratA #and# WeigtM , title = {{On the properties of small-world network models}} , journal = j-epjb , pages = {547--560} , volume = 13 , year = 2000 } @techreport{bw-rfmgl-97 , author = BrandesU #and# WagnerD , title = {{Random Field Models for Graph Layout}} , institution = "Universit{\"a}t Konstanz" , note = {Konstanzer Schriften in Mathematik und Informatik} , number = 33 , type = {techreport} , year = 1997 } @Article{bw-uglvt-00 , author = BrandesU #and# WagnerD , title = {{Using Graph Layout to Visualize Train Connection Data}} , journal = j-jgaa , number = 3 , pages = {135--155} , url = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bw-uglvt-00.ps.gz" , volume = 4 , year = 2000 } @InProceedings{bw-uglvt-99 , author = BrandesU #and# WagnerD , title = {{Using Graph Layout to Visualize Train Interconnection Data}} , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}} , location = "Montreal, Canada" , month = jan , pages = {44--56} , pdf = "http://www.springerlink.com/content/bm2e1r9cyrwy2p2a/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/bm2e1r9cyrwy2p2a/" , volume = 1547 , year = 1999 } @InCollection{bw-uzg-99 , author = BrandesU #and# WagnerD , title = {{{\"U}ber das Zeichnen von Graphen}} , booktitle = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}} , pages = {58--80} , publisher = pub-v , year = 1999 } @InCollection{bw-vavsn-03 , author = BrandesU #and# WagnerD , title = {{visone -- Analysis and Visualization of Social Networks.}} , booktitle = {{Graph Drawing Software}} , isbn = "3-540-00881-0" , pages = {321--340} , publisher = pub-springer , url = "http://www.springer.com/math/cse/book/978-3-540-00881-1" , year = 2003 } @InProceedings{bw-vbnrlm-02 , author = WillhalmT #and# BrandesU , title = {{Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor}} , booktitle = {{Proceedings of the 4th Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym '02)}} , location = "Barcelona, Spain" , pages = {159--164} , pdf = "http://i11www.ira.uka.de/members/willhalm/publications/bw-vbnrlm-02.pdf" , publisher = pub-acm , year = 2002 } @Article{bw-vv-00 , author = BrandesU #and# WagnerD , title = {{Visualisierung von Verkehrsdaten}} , journal = j-dmvm , pages = {11--16} , volume = {1--2000} , year = 2000 } @Article{bwk-ctlb-06 , author = BodlaenderHL #and# WolleT #and# KosterAM , title = {{Contraction and Treewidth Lower Bounds}} , journal = j-jgaa , number = 1 , pages = {5--49} , volume = 10 , year = 2006 } @unpublished{bz-acdn-03 , author = BatageljV #and# ZaversnikM , title = {{An $O(m)$ Algorithm for Cores Decomposition of Networks}} , month = oct , note = {electronically published at \url{http://arxiv.org/abs/cs.DS/0310049}} , pages = {1--11} , pdf = "http://arxiv.org/pdf/cs/0310049v1" , url = "http://arxiv.org/abs/cs.DS/0310049" , year = 2003 } @techreport{bz-gc-02 , author = BatageljV #and# ZaversnikM , title = {{Generalized Cores}} , institution = "IMFM Ljublana, Ljubljana" , number = 799 , pdf = "http://vlado.fmf.uni-lj.si/pub/preprint/imfm0799.pdf" , type = {Preprint} , url = "http://vlado.fmf.uni-lj.si/pub/networks/doc/" , year = 2002 } @techreport{bz-oacdn-02 , author = BatageljV #and# ZaversnikM , title = {{An {$\mathcal{O}(m)$} Algorithm for Cores Decomposition of Networks}} , institution = "IMFM Ljublana, Ljubljana" , number = 798 , year = 2002 } %% -------------------------------------------------------------- @article{c-acmftn-77 , author = CherkasskyBV , title = {{An algorithm for constructing a maximal flow through a network requiring {$\mathcal{O}(n^2\sqrt{p})$} operations}} , journal = "Mathematical Me" , note = {(In Russian)} , pages = {117--126} , volume = 7 , year = 1977 } @Article{c-aghsc-79 , author = ChvatalV , title = {{A Greedy Heuristic for the Set-Covering Problem}} , journal = j-moor , number = 3 , pages = {233--235} , volume = 4 , year = 1979 } @InProceedings{c-alval-88 , author = ClarksonKL , title = {{A Las Vegas Algorithm for Linear Programming When the Dimension Is Small}} , booktitle = {{Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS'88)}} , pages = {452--456} , publisher = pub-ics , year = 1988 } @Article{c-ambcp-96 , author = ChlebikovaJ , title = {{Approximating the Maximally Balanced Connected Partition Problem in Graphs}} , journal = j-ipl , number = 5 , pages = {223--230} , volume = 60 , year = 1996 } @InProceedings{c-apca-93 , author = ClarksonKL , title = {{Algorithms for Polytope Covering and Approximation}} , booktitle = {{Proceedings of the 3rd International Workshop on Algorithms and Data Structures (WADS'93)}} , pages = {246--252} , publisher = pub-springer , series = ser-springer_lncs , volume = 709 , year = 1993 } @Article{c-dgcpa-97 , author = CohenJD , title = {{Drawing Graphs to Convey Proximity: An Incremental Arrangement Method}} , journal = j-acm-tchi , month = sep , number = 3 , pages = {197--229} , url = "http://portal.acm.org/citation.cfm?doid=264645.264657" , volume = 4 , year = 1997 } @incollection{c-facmftn-94 , author = CherkasskyBV , title = {{A Fast Algorithm for Constructing a Maximum Flow Through a Network}} , booktitle = {{Selected Topics in Discrete Mathematics: Proceedings of the Moscow Discrete Mathematics Seminar, 197}} , pages = {23--30} , publisher = {AMS} , series = "American Mathematica" , volume = 158 , year = 1994 } @inproceedings{c-gaafdcg-00 , author = CharikarM , title = {{Greedy approximation algorithms for finding dense components in a graph}} , booktitle = {{Proceedings of the 3rd International Workshop on Approximatin Algorithms for Combinatorial Optimizat}} , pages = {84--95} , publisher = pub-springer , series = ser-springer_lncs , volume = 1931 , year = 2000 } @article{c-gtacp-66 , author = ChartrandG , title = {{A graph-theoretic approach to a communications problem}} , journal = j-sijam , month = jul , number = 5 , pages = {778--781} , volume = 14 , year = 1966 } @article{c-iadts-98 , author = GawronC , title = {{An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model}} , journal = j-impc , number = 3 , pages = {393--408} , volume = 9 , year = 1998 } @Article{c-mafdg-03 , author = WalshawC , title = {{A Multilevel Algorithm for Force-Directed Graph-Drawing}} , journal = j-jgaa , month = aug , number = 3 , pages = {253--285} , pdf = "http://www.cs.brown.edu/sites/jgaa/accepted/2003/Walshaw2003.7.3.pdf" , url = "http://www.cs.brown.edu/sites/jgaa/volume07.html" , volume = 7 , year = 2003 } @article{c-mdpdg-00 , author = CzygrinowA , title = {{Maximum dispersion problem in dense graphs}} , journal = j-orl , number = 5 , pages = {223-227} , volume = 27 , year = 2000 } @misc{c-occh-09 , author = ColumbusT , title = {{On the Complexity of Contraction Hierarchies}} , note = {Student's thesis - Karlsruhe Institute of Technology - ITI Wagner} , school = "Karlsruhe Institute of Technology - ITI Wagner" , year = 2009 } @Article{c-ofmrn-61 , author = CaldwellT , title = {{On Finding Minimum Routes in a Network With Turn Penalties}} , journal = j-comm-acm , number = 2 , volume = 4 , year = 1961 } @Article{c-re-82 , author = ConnellyR , title = {{Rigidity and Energy}} , journal = j-i , pages = {11--33} , volume = 66 , year = 1982 } @book{c-sgt-97 , author = ChungFRK , title = {{Spectral Graph Theory}} , publisher = pub-ams , series = ser-ams_cbms , year = 1997 } @mastersthesis{c-sssch-12 , author = ColumbusT , title = {{Search Space Size in Contraction Hierarchies}} , month = oct , school = "Karlsruhe Institute of Technology" , type = {Master's Thesis} , url = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/da-columbus-12.pdf" , year = 2012 } @InProceedings{c-t-71 , author = CookSA , title = {{The complexity of theorem-proving procedures}} , booktitle = {{Proceedings of the 3rd Annual {ACM} Symposium on the Theory of Computing (STOC'71)}} , month = may , pages = {151--158} , publisher = pub-acm , year = 1971 } @article{c-tghc-73 , author = ChvatalV , title = {{Tough Graphs and Hamiltionian Circuits}} , journal = j-dima , volume = 5 , year = 1973 } @InProceedings{c-ulmrc-93 , author = ChalmersM , title = {{Using a Landscape Metaphor to Represent a Corpus of Documents}} , booktitle = {{Proceedings of the European Conference on Spatial Information Theory (COSIT'93)}} , pages = {377--390} , publisher = pub-springer , volume = 716 , year = 1993 } @misc{c-vitms-03 , author = Caida , title = {{Visualizing {I}nternet Topology at a Macroscopic Scale}} , url = "http://www.caida.org/research/topology/as_core_network/" , year = 2003 } @techreport{c-wahts-76 , author = ChristofidesN , title = {{Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem}} , institution = "Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh" , number = {Technical Report 388} , year = 1976 } @misc{c-wgvt-02 , author = Caida , title = {{Walrus -- Graph Visualization Tool}} , url = "http://www.caida.org/tools/visualization/walrus/" , year = 2002 } @Article{cbb-rpmpd-07 , author = ChenYa #and# BellMG #and# BogenbergerK , title = {{Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System}} , journal = j-ieeetits , month = mar , number = 1 , pages = {14--20} , volume = 8 , year = 2007 } @Article{cbm-aprob-07 , author = ChardaireP #and# BarakeM #and# McKeownGP , title = {{A PROBE-Based Heuristic for Graph Partitioning}} , journal = j-tc , number = 12 , pages = {1707--1720} , url = "http://doi.ieeecomputersociety.org/10.1109/TC.2007.70760" , volume = 56 , year = 2007 } @InProceedings{cbmb-aspam-07 , author = CrobakJR #and# BerryJW #and# MadduriK #and# BaderDA , title = {{Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture}} , booktitle = {{Workshop on Multithreaded Architectures and Applications (MTAAP 2007)}} , pages = {1--8} , year = 2007 } @Article{cbs-dstgo-97 , author = ChristofidesN #and# BadraHO #and# SharaihaYM , title = {{Data structures for topological and geometric operations on networks}} , journal = j-aor , pages = {259--289} , url = "http://www.springerlink.com/content/l6828vu5x1t30470/" , volume = 71 , year = 1997 } @InProceedings{cc-aesac-05 , author = ChoH #and# ChungC , title = {{An Efficient and Scalable Approach to CNN Queries in a Road Network}} , booktitle = {{Proceedings of the 31st International Conference on Very Large Databases (VLDB 2005)}} , pages = {865--876} , year = 2005 } @book{cc-mds-01 , author = CoxTF #and# CoxMAA , title = {{Multidimensional Scaling}} , edition = second , publisher = pub-ch , series = ser-msap , year = 2001 } @article{cc-pgo-82 , author = CardonA #and# CrochemoreM , title = {{Partitioning a Graph in $\mathcal{O}(|A|\log_2|V|)$}} , journal = j-tcs , pages = {85--98} , volume = 19 , year = 1982 } @InProceedings{ccfm-icdir-97 , author = CharikarM #and# ChekuriC #and# FederT #and# MotwaniR , title = {{Incremental Clustering and Dynamic Information Retrieval}} , booktitle = {{Proceedings of the 29th Annual {ACM} Symposium on the Theory of Computing (STOC'97)}} , pages = {626--635} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=258657&type=pdf&coll=GUIDE&dl=GUIDE&CFID=26594007&CFTOKEN=60" , publisher = pub-ap , url = "http://doi.acm.org/10.1145/258533.258657" , year = 1997 } @InProceedings{ccgj-oplit-02 , author = ChenQ #and# ChangH #and# GovindanR #and# JaminS , title = {{The Origin of Power Laws in Internet Topologies Revisited}} , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , pages = {608--617} , pdf = "http://ieeexplore.ieee.org/iel5/7943/21922/01019306.pdf" , publisher = pub-ieeecs , volume = 1 , year = 2002 } @Article{cdfk-tgmog-03 , author = CorneDW #and# DebK #and# FlemingPJ #and# KnowlesJD , title = {{The Good of the Many Outweighs the Good of the One: Evolutionary Multi- Objective Optimization}} , journal = j-c , number = 1 , pages = {9--13} , volume = 1 , year = 2003 } @Article{cdgk-dpgca-01 , author = ChengCC #and# DuncanCA #and# GoodrichMT #and# KobourovSG , title = {{Drawing Planar Graphs with Circular Arcs}} , journal = dcg , number = 3 , pages = {405--418} , volume = 25 , year = 2001 } @inproceedings{cdks-tele-02 , author = ChienS #and# DworkC #and# KumarR #and# SivakumarD , title = {{Towards Exploiting Link Evolution}} , booktitle = {{proc-amwg-02}} , month = nov , year = 2002 } @book{cds-sg-95 , author = CvetkovicDM #and# DoobM #and# SachsH , title = {{Spectra of Graphs}} , publisher = pub-jab , year = 1995 } @InProceedings{cdw-ptlcr-01 , author = CornelsenS #and# DinitzY #and# WagnerD , title = {{Planarity of the Two-Level Cactus Representation}} , booktitle = {{Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01)}} , pages = {91--102} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/cdw-p2lcr-01.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/link.asp?id=5uge4xgtv6hdal7m" , volume = 2204 , year = 2001 } @article{cdz-mit-97 , author = CalvertKL #and# DoarMB #and# ZeguraEW , title = {{Modeling {Internet} Topology}} , journal = j-cm , month = jun , pages = {160--163} , volume = 35 , year = 1997 } @InProceedings{ce-tcfoa-07 , author = CarlsonJ #and# EppsteinD , title = {{Trees with Convex Faces and Optimal Angles}} , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}} , month = jan , pages = {77--88} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-70904-6_9" , volume = 4372 , year = 2007 } @article{cebh-rirb-00 , author = CohenR #and# ErezK #and# BenAvrahamD #and# HavlinS , title = {{Resilience of the {Internet} to random breakdown}} , journal = j-phrl , month = nov , number = 85 , pages = {4626--4628} , volume = 21 , year = 2000 } @Article{ceh-fcomf-01 , author = ChanTM #and# EfratA #and# Har-PeledS , title = {{Fly Cheaply: On the Minimum Fuel Consumption Problem}} , journal = j-jalg , number = 2 , pages = {330--337} , volume = 41 , year = 2001 } @unpublished{cf-csg-08 , author = CastellanoC #and# FortunatoS , title = {{Community Structure in Graphs}} , note = {to appear as chapter of Springer's Encyclopedia of Complexity and Systems Science; arXiv:0712.2716v1} , url = "http://arxiv.org/abs/0712.2716" , year = 2008 } @Article{cf-gmlga-06 , author = ChakrabartiD #and# FaloutsosC , title = {{Graph Mining: Laws, Generators, and Algorithms}} , doi = "http://doi.acm.org/10.1145/1132952.1132954" , journal = j-acm-csur , month = mar , number = 1 , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1132952.1132954" , volume = 38 , year = 2006 } @article{cf-gmwg-03 , author = CooperC #and# FriezeAM , title = {{A General Model of Web Graphs}} , journal = j-rsa , pages = {311--335} , volume = 22 , year = 2003 } @InProceedings{cfh-ahacp-12 , author = CvijicS #and# FeldmannP #and# HieM , title = {{Applications of Homotopy for solving AC Power Flow and AC Optimal Power Flow}} , booktitle = {{Power and Energy Society General Meeting}} , note = {IEEE Conference Publications, 2012} , pages = {1--8} , publisher = pub-ieee , year = 2012 } @InProceedings{cfj-lklth-04 , author = ChorB #and# FellowsMR #and# JuedesD , title = {{Linear Kernels in Linear Time, or How to Save $k$ Colors in O($n^2$) Steps}} , booktitle = {{Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)}} , pages = {257--269} , publisher = pub-springer , series = ser-springer_lncs , year = 2004 } @InProceedings{cfk-a-96 , author = CowenL #and# FeigenbaumJ #and# KannanS , title = {{A formal framework for evaluating heuristic programs}} , booktitle = {{Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96)}} , month = jul , pdf = "http://www.springerlink.com/content/y4l32017vp448844/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = {1099/1996} , year = 1996 } @article{cfm-ubdg-94 , author = ChungFRK #and# FaberV #and# ManteuffelTA , title = {{An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian}} , journal = j-sidma , number = 3 , pages = {443--457} , volume = 7 , year = 1994 } @InProceedings{cg-cepod-03 , author = ChandaA #and# GargA , title = {{Compact Encodings of Planar Orthogonal Drawings}} , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {174--185} , publisher = pub-springer , series = ser-springer_lncs , volume = 2528 , year = 2003 } @InProceedings{cg-epgig-09 , author = ChalopinJ #and# GoncalvesD , title = {{Every Planar Graph is the Intersection Graph of Segments in the Plane}} , booktitle = {{Proceedings of the 41st Annual {ACM} Symposium on the Theory of Computing (STOC'09)}} , pages = {631--638} , publisher = pub-acm , year = 2009 } @Article{cg-tja-06 , author = CantnerU #and# GrafH , title = {{The network of innovators in Jena: An application of social network analysis}} , journal = j-rp , month = apr , number = 4 , pages = {463--480} , url = "http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V77-4JMKMP7-1&_user=2149863&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000056383&_version=1&_urlVersion=0&_userid=2149863&md5=04bd9266349a1cbd333d96d2ced563e2" , volume = 35 , year = 2006 } @misc{cgal , title = {{\textsc{Cgal}, {C}omputational {G}eometry {A}lgorithms {L}ibrary}} , url = "http://www.cgal.org" } @InProceedings{cghkl-cepgc-98 , author = ChuangRC #and# GargA #and# HeXi #and# KaoM #and# LuH , title = {{Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses}} , booktitle = {{Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98)}} , note = {Extended version with proofs: arXiv:cs/0102005v2 [cs.DS]} , pages = {118--129} , publisher = pub-springer , series = ser-springer_lncs , volume = 1443 , year = 1998 } @Article{cgjsw-tcras-04 , author = ChangH #and# GovindanR #and# JaminS #and# ShenkerSJ #and# WillingerW , title = {{Towards Capturing Representative AS-level Internet Topologies}} , journal = j-cn , month = apr , number = 1 , pages = {737--755} , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6VRG-4B22S07-1-1T&_cdi=6234&_user=2149863&_" , url = "http://dx.doi.org/10.1016/j.comnet.2003.03.001" , volume = 44 , year = 2004 } @InProceedings{cgmw-ivpg-09 , author = ChimaniM #and# GutwengerC #and# MutzelP #and# WolfC , title = {{Inserting a Vertex into a Planar Graph}} , booktitle = {{Proceedings of the 20st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'09)}} , pages = {375--383} , year = 2009 } @Article{cgr-s-96 , author = CherkasskyBV #and# GoldbergAV #and# RadzikT , title = {{Shortest paths algorithms}} , journal = j-math-prog-a , pages = {129--174} , volume = 73 , year = 1996 } @InProceedings{cgs-bhlmp-97 , author = CherkasskyBV #and# GoldbergAV #and# SilversteinC , title = {{Buckets, Heaps, Lists, and Monotone Priority Queues}} , booktitle = {{Proceedings of the 8th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'97)}} , pages = {83--92} , pdf = "http://xenon.stanford.edu/~csilvers/papers/hotq-soda.ps" , publisher = pub-ieeecs , year = 1997 } @InProceedings{cgw-cqi-03 , author = CharikarM #and# GuruswamiV #and# WirthA , title = {{Clustering with Qualitative Information}} , booktitle = {{Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03)}} , isbn = "0272-5428" , pdf = "http://ieeexplore.ieee.org/iel5/8767/27770/01238225.pdf?isnumber=&arnumber=1238225" , publisher = pub-ieeecs , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1238225" , year = 2003 } @Article{cgw-cqi-05 , author = CharikarM #and# GuruswamiV #and# WirthA , title = {{Clustering with Qualitative Information}} , journal = j-css , month = oct , number = 3 , pages = {360--383} , url = "http://dx.doi.org/10.1016/j.jcss.2004.10.012" , volume = 71 , year = 2005 } @Article{ch-acspp-09 , author = ChandranBG #and# HochbaumDS , title = {{A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem}} , journal = j-or , month = feb , number = 2 , pages = {358--376} , volume = 57 , year = 2009 } @Article{ch-m-92 , author = ChengC #and# HuTC , title = {{Maximum Concurrent Flows and Minimum Cuts}} , journal = j-alg , pages = {233--249} , volume = 8 , year = 1992 } @Book{ch-mgd-07 , editor = CookDJ #and# HolderLB , title = {{Mining Graph Data}} , booktitle = {{Mining Graph Data}} , publisher = pub-wiley , url = "http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0471731900.html" , year = 2007 } @article{ch-rmfa-95 , author = CheriyanJ #and# HagerupT , title = {{A Randomized Maximum-Flow Algorithm}} , journal = j-sicomp , number = 2 , pages = {203--226} , volume = 24 , year = 1995 } @Article{ch-tsrtn-66 , author = CookeK #and# HalseyE , title = {{The Shortest Route Through a Network with Time-Dependent Intermodal Transit Times}} , journal = j-maa , number = 3 , pages = {493--498} , volume = 14 , year = 1966 } @article{chb-gfib-80 , author = CarringtonPJ #and# HeilGH #and# BerkowitzSD , title = {{A Goodness-of-Fit Index for Blockmodels}} , journal = j-sn , pages = {219--234} , volume = 2 , year = 1980 } @InCollection{chb-spsfn-97 , author = CohenR #and# HavlinS #and# ben-AvrahamD , title = {{Structural Properties of Scale-Free Networks}} , booktitle = {{Handbook of Discrete and Computational Geometry}} , isbn = "0-8493-8524-5" , pages = {85--110} , publisher = {CRC Press LLC, Boca} , year = 1997 } @InProceedings{chk-ddguo-03 , author = CarmelL #and# HarelD #and# KorenY , title = {{Drawing Directed Graphs Using One-Dimensional Optimization}} , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {311--330} , pdf = "http://www.springerlink.com/content/cr3574jvb3xld9p0/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/cr3574jvb3xld9p0/" , volume = 2528 , year = 2003 } @Article{chkss-mitus-07 , author = CarmiS #and# HavlinS #and# KirkpatrickS #and# ShavittY #and# ShirE , title = {{A Model of Internet Topology Using $k$-Shell Decomposition}} , journal = j-pnas , pages = {11150--11154} , pdf = "http://www.pnas.org/cgi/reprint/104/27/11150" , url = "http://www.pnas.org/cgi/content/abstract/104/27/11150" , volume = 104 , year = 2007 } @Article{chkz-rdqhl-03 , author = CohenE #and# HalperinE #and# KaplanH #and# ZwickU , title = {{Reachability and Distance Queries via 2-Hop Labels}} , journal = j-sicomp , number = 5 , pages = {1338--1355} , volume = 32 , year = 2003 } @Article{chl-l-10 , author = CafieriS #and# HansenP #and# LibertiL , title = {{Loops and multiple edges in modularity maximization of networks}} , journal = j-pr-e , number = 4 , pages = 046102 , url = "http://link.aps.org/doi/10.1103/PhysRevE.81.046102" , volume = 81 , year = 2010 } @Article{chl-vrfpg-09 , author = ChenCY #and# HungY #and# LuH , title = {{Visibility Representations of Four-connected Plane Graphs with Near Optimal Heights}} , journal = j-cg , pages = {865--872} , volume = 42 , year = 2009 } @article{chm-tmfa-96 , author = CheriyanJ #and# HagerupT #and# MehlhornK , title = {{An $o(n^3)$-Time Maximum-Flow Algorithm}} , journal = j-sicomp , month = dec , number = 6 , pages = {144--1170} , volume = 25 , year = 1996 } @article{cjtw-dddcm-93 , author = ChartrandG #and# JohnsGL #and# TianS #and# WintersSJ , title = {{Directed Distance on Digraphs: Centers and Medians.}} , journal = j-jgt , number = 4 , pages = {509--521} , volume = 17 , year = 1993 } @Article{ck-agppp-01 , author = CondonA #and# KarpRM , title = {{Algorithms for Graph Partitioning on the Planted Partition Model}} , journal = j-rsa , number = 2 , pages = {116--140} , url = "http://dx.doi.org/10.1002/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2" , volume = 18 , year = 2001 } @Article{ck-cgdcp-97 , author = ChrobakM #and# KantG , title = {{Convex Grid Drawings of $3$-Connected Planar Graphs}} , journal = j-ijcga , number = 3 , pages = {211--223} , volume = 7 , year = 1997 } @InProceedings{ckkk-msdra-10 , author = CooganK #and# KhareV #and# KobourovSG #and# KatzB , title = {{Multi-Scale Dead-Reckoning Algorithm for Distributed Force-Directed Sensor Network Localization}} , booktitle = {{Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)}} , series = ser-springer_lncs , year = 2010 } @Article{ckkknt-acmwr-12 , author = ChunJ #and# KaothanthongN #and# KasaiR #and# KormanM #and# NollenburgM #and# TokuyamaT , title = {{Algorithms for computing the maximum weight region decomposable into elementary shapes}} , journal = j-cviu , number = 7 , pages = {803--814} , url = "http://dx.doi.org/10.1016/j.cviu.2012.03.003" , volume = 116 , year = 2012 } @techreport{cklrw-opmsh-13 , author = ChenJ #and# KaoMJ #and# LeeD #and# RutterI #and# WagnerD , title = {{Online Power-Managing Strategy with Hard Real-Time Guarantees }} , institution = kit_wagner , url = "http://arxiv.org/abs/1304.1590 " , year = 2013 } @InProceedings{ckmst-e-11 , author = ChristianoP #and# KelnerJA #and# MadryA #and# SpielmanDA #and# TengS , title = {{Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs}} , booktitle = {{Proceedings of the 43rd Annual {ACM} Symposium on the Theory of Computing (STOC'11)}} , pages = {273--282} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1993636.1993674" , year = 2011 } @InProceedings{cknt-cdr-08 , author = ChunJ #and# KormanM #and# NollenburgM #and# TokuyamaT , title = {{Consistent Digital Rays}} , booktitle = {{Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)}} , pages = {355--364} , pdf = "http://i11www.ira.uka.de/extra/publications/cknt-cdr-08.pdf" , publisher = pub-acm , url = "http://dl.acm.org/authorize?087105" , year = 2008 } @InProceedings{cknt-cdr-08ecg , author = ChunJ #and# KormanM #and# NollenburgM #and# TokuyamaT , title = {{Consistent Digital Rays}} , booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)}} , pages = {169--172} , pdf = "http://i11www.ira.uka.de/extra/publications/cknt-cdr-08ecg.pdf" , year = 2008 } @Article{cknt-cdr-09 , author = ChunJ #and# KormanM #and# NollenburgM #and# TokuyamaT , title = {{Consistent Digital Rays}} , journal = dcg , note = {Special issue of SoCG 2008} , number = 3 , pages = {359--378} , pdf = "http://i11www.ira.uka.de/extra/publications/cknt-cdr-09.pdf" , url = "http://dx.doi.org/10.1007/s00454-009-9166-2" , volume = 42 , year = 2009 } @article{cks-gsdg-98 , author = ChartrandG #and# KubickiG #and# SchultzM , title = {{Graph similarity and distance in graphs}} , journal = j-am , number = {1-2} , pages = {129--145} , volume = 55 , year = 1998 } @unpublished{cks-piaatn-02 , author = CarpenterT #and# KarakostasG #and# ShallcrossD , title = {{Pracical Issues and Algorithms for Analyzing Terrorist Networks}} , note = {invited talk at WMC 2002} , url = "http://www.cas.mcmaster.ca/~gk/papers/wmc2002.pdf" , year = 2002 } @InProceedings{ckt-ec-06 , author = ChakrabartiD #and# KumarR #and# TomkinsAS , title = {{Evolutionary Clustering}} , booktitle = {{Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}} , pages = {554--560} , pdf = "http://www.cs.cmu.edu/~deepay/mywww/papers/kdd06-evolutionary.pdf" , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1150402.1150467" , year = 2006 } @Article{ckvw-admmc-06 , author = ChengD #and# KannanR #and# VempalaS #and# WangG , title = {{A Divide-and-Merge Methodology for Clustering}} , journal = j-acmtds , number = 4 , pages = {1499--1525} , url = "http://doi.acm.org/10.1145/1189769.1189779" , volume = 31 , year = 2006 } @InProceedings{ckx-ipubv-06 , author = ChenJianer #and# KanjIA #and# XiaG , title = {{Improved Parameterized Upper Bounds for Vertex Cover }} , booktitle = {{Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS'06)}} , pages = {238--249} , publisher = pub-springer , series = ser-springer_lncs , year = 2006 } @Article{cl-ccrgg-02 , author = ChungFRK #and# LuL , title = {{Connected Components in Random Graphs Graphs with Given Expected Degree Sequences }} , journal = j-ac , number = 2 , pages = {125--145} , url = "http://www.combinatorics.net/aoc/toc/v6n2/Chung/6_2_125.htm" , volume = 6 , year = 2002 } @Article{cll-osta-05 , author = ChiangY #and# LinC #and# LuH , title = {{Orderly Spanning Trees with Applications}} , journal = j-sicomp , number = 4 , pages = {924--945} , volume = 34 , year = 2005 } @InProceedings{cll-ostag-01 , author = ChiangY #and# LinC #and# LuH , title = {{Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing}} , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}} , pages = {506--515} , year = 2001 } @InProceedings{clly-saost-03 , author = ChenHo #and# LiaoC #and# LuH #and# YenH , title = {{Some Applications of Orderly Spanning Trees in Graph Drawing}} , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {332--343} , publisher = pub-springer , series = ser-springer_lncs , volume = 2528 , year = 2003 } @book{clrs-ia-01 , author = CormenTH #and# LeisersonCE #and# RivestRL #and# SteinC , title = {{Introduction to Algorithms}} , edition = second , publisher = pub-mitpr , year = 2001 } @Book{cls-dimac-95 , editor = CookW #and# LovaszL #and# SeymourPD , title = {{DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, Volume 20 on the ``Year of Combinatorial Optimization''}} , booktitle = {{DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, Volume 20 on the ``Year of Combinatorial Optimization''}} , publisher = pub-ams , year = 1995 } @Article{clv-erpg-03 , author = ChungFRK #and# LuL #and# VuV , title = {{Eigenvalues of Random Power Law Graphs}} , journal = j-ac , pages = {21--33} , pdf = "http://www.math.ucsd.edu/~fan/wp/eigen.pdf" , volume = 7 , year = 2003 } @article{clv-srged-03 , author = ChungFRK #and# LuL #and# VuV , title = {{The spectra of random graphs with given expected degree}} , journal = j-pnas , month = may , number = 11 , pages = {6313--6318} , url = "http://www.math.ucsd.edu/~fan/wp/specp.pdf" , volume = 100 , year = 2003 } @Article{cm-fnici-88 , author = CheriyanJ #and# MaheshwariSN , title = {{Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs}} , journal = j-jalg , pages = {507--537} , volume = 9 , year = 1988 } @Article{cm-gptea-84 , author = ClevelandWS #and# McGillR , title = {{Graphical Perception: Theory, Experimentation, and Application to the Development of Graphical Methods}} , journal = j-jasa , month = sep , number = 387 , pages = {531--554} , url = "http://links.jstor.org/sici?sici=0162-1459(198409)79\%3A387\%3C531\%3AGPTEAA\%3E2.0.CO\%3B2-Y" , volume = 79 , year = 1984 } @article{cm-sgaos-79 , author = CapobiancoMF #and# MolluzzoJC , title = {{The Strength of a Graph and its Application to Organizational Structure}} , journal = j-sn , pages = {275--283} , volume = 2 , year = 1979 } @Article{cmwy-a-07 , author = ChataignerF #and# ManicG #and# WakabayashiY #and# YusterR , title = {{Approximation algorithms and hardness results for the clique packing problem}} , journal = j-endima , pages = {397--401} , url = "http://www.sciencedirect.com/science/article/B75GV-4PCHPN5-2B/2/9b2344d3c2954b524ba9f6c609e7422d" , volume = 29 , year = 2007 } @Article{cn-mwgdp-98 , author = ChrobakM #and# NakanoS , title = {{Minimum-Width Grid Drawings of Plane Graphs}} , journal = j-cg , number = 1 , pages = {29--54} , volume = 11 , year = 1998 } @Article{cnm-fcsln-04 , author = ClausetA #and# NewmanMEJ #and# MooreC , title = {{Finding community structure in very large networks}} , doi = "doi://10.1103/PhysRevE.70.066111" , journal = j-pr-e , number = 066111 , url = "http://link.aps.org/abstract/PRE/v70/e066111" , volume = 70 , year = 2004 } @article{cnsw-nrfpr-00 , author = CallawayDS #and# NewmanMEJ #and# StrogatzSH #and# WattsDJ , title = {{Network Robustness and Fragility: {Percolation} on Random Graphs}} , journal = j-phrl , month = dec , number = 85 , pages = {5468-5471} , url = "http://arXiv.org/abs/cond-mat/0007300" , volume = 25 , year = 2000 } @article{co-wglii-00 , author = ChungFRK #and# OdenK , title = {{Weighted Graph Laplacians and Isoperimetric Inequalities}} , journal = j-pjm , pages = {257--274} , url = "http://citeseer.nj.nec.com/381180.html" , volume = 192 , year = 2000 } @Article{cp-altad-95 , author = ChrobakM #and# PayneTH , title = {{A Linear-Time Algorithm for Drawing a Planar Graph on a Grid}} , journal = j-ipl , number = 4 , pages = {241--246} , volume = 54 , year = 1995 } @Article{cp-irgi-08 , author = CzajkaT #and# PanduranganG , title = {{Improved Random Graph Isomorphism}} , journal = j-jda , month = mar , number = 1 , pages = {85--92} , pdf = "http://www.cs.purdue.edu/homes/gopal/gi.pdf" , volume = 6 , year = 2008 } @Article{cp-ptsco-08 , author = ChevalierC #and# PellegriniF , title = {{PT-SCOTCH: A Tool for Efficient Parallel Graph Ordering}} , journal = j-pc , pages = {318--331} , volume = 34 , year = 2008 } @misc{cplex , title = {{CPLEX}} , institution = "ILOG" , note = {Mathematical programming optimizer, ILOG, {http://www.ilog.com/products/cplex}} , url = "http://www.ilog.com/products/cplex" } @inproceedings{cr-dstn-92 , author = CheriyanJ #and# ReifJH , title = {{Directed $s$-$t$ Numberings, Rubber Bands, and Testing Digraph $k$-Vertex Connectivity}} , booktitle = {{Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)}} , month = jan , pages = {335--344} , year = 1992 } @book{crs-eg-97 , author = CvetkovicDM #and# RowlinsonP #and# SimicS , title = {{Eigenspaces of Graphs}} , publisher = pub-cup , year = 1997 } @Article{cs-pd-98 , author = CulbersonJC #and# SchaefferJ , title = {{Pattern Databases}} , journal = j-ci , number = 3 , pages = {318--334} , volume = 14 , year = 1998 } @Article{csw-airbc-07 , author = ChataignerF #and# SalgadoLB #and# WakabayashiY , title = {{Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs}} , journal = j-dmtcs , number = 1 , pages = {177--192} , url = "http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/85" , volume = 9 , year = 2007 } @InProceedings{csw-dgttl-03 , author = CornelsenS #and# SchankT #and# WagnerD , title = {{Drawing Graphs on Two and Three Lines}} , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {31--41} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/csw-dg23l-03.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 2528 , year = 2003 } @Article{csw-dgttl-04 , author = CornelsenS #and# SchankT #and# WagnerD , title = {{Drawing Graphs on Two and Three Lines}} , journal = j-jgaa , number = 2 , pages = {161--177} , pdf = "http://jgaa.info/accepted/2004/CornelsenSchankWagner2004.8.2.pdf" , volume = 8 , year = 2004 } @InProceedings{csx-gadbd-02 , author = ChenDZ #and# SmidM #and# XuB , title = {{Geometric Algorithms for Density-Based Data Clustering}} , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}} , pages = {284--296} , pdf = "http://www.springerlink.com/content/gvr26cunkyhmh5rf/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/gvr26cunkyhmh5rf/" , volume = 2461 , year = 2002 } @InProceedings{cszy-mpnnr-09 , author = ChenZ #and# ShenHT #and# ZhouX #and# YuJeff , title = {{Monitoring Path Nearest Neighbor in Road Networks}} , booktitle = {{Proceedings of the 2009 ACM SIGMOD international conference on Management of data (SIGMOD'09)}} , pages = {591--602} , publisher = pub-acm , year = 2009 } @Book{ct-eit-91 , author = CoverTM #and# ThomasJA , title = {{Elements of Information Theory}} , booktitle = {{Elements of Information Theory}} , publisher = pub-wileys , url = "http://www.elementsofinformationtheory.com/" , year = 1991 } @article{ct-fasnc-99 , author = CheriyanJ #and# ThurimellaR , title = {{Fast Algorithms for $k$-Shredders and $k$-Node Connectivity Augmentation}} , journal = j-jalg , pages = {15--50} , volume = 33 , year = 1999 } @Article{ct-m-04 , author = ChangJ #and# TassiulasL , title = {{Maximum lifetime routing in wireless sensor networks}} , journal = j-ton , volume = 12 , year = 4 } @InProceedings{ctlw-eetcw-05 , author = CardeiM #and# ThaiMT #and# LiY #and# WuW , title = {{Energy-Efficient Target Coverage in Wireless Sensor Networks}} , booktitle = {{Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , month = mar , pages = {1976--1984} , publisher = pub-ieeecs , volume = 4 , year = 2005 } @book{cv-lssdc-07 , editor = CaldarelliG #and# VespignaniA , title = {{Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science}} , booktitle = {{Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science}} , publisher = pub-wsp , series = ser-csic , volume = 2 , year = 2007 } @InProceedings{cw-cccg-03 , author = CornelsenS #and# WagnerD , title = {{Completely Connected Clustered Graphs}} , booktitle = {{Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)}} , pages = {168--179} , publisher = pub-springer , series = ser-springer_lncs , url = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/cw-cccg-03.ps.gz" , volume = 2880 , year = 2003 } @Article{cw-cccg-06 , author = CornelsenS #and# WagnerD , title = {{Completely Connected Clustered Graphs}} , journal = j-jda , number = 2 , pages = {313--323} , url = "http://dx.doi.org/10.1016/j.jda.2005.06.002" , volume = 4 , year = 2006 } @Article{cw-e-06 , author = CardeiM #and# WuW , title = {{Energy-efficient coverage problems in wireless ad-hoc sensor networks}} , journal = j-comcom , number = 4 , pages = {413--420} , volume = 29 , year = 2006 } @article{cw-mmap-90 , author = CoppersmithD #and# WinogradS , title = {{Matrix multiplication via arithmetic progressions}} , journal = j-sc , number = 3 , pages = {251--280} , volume = 9 , year = 1990 } @Article{cw-u-79 , author = CarterL #and# WegmanMN , title = {{Universal classes of hash functions}} , journal = j-css , number = 2 , pages = {143--154} , volume = 18 , year = 1979 } @InProceedings{cww-rfccf-10 , author = ChenDZ #and# WangChao #and# WangH , title = {{Representing a Functional Curve by Curves with Fewer Peaks}} , booktitle = {{Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10)}} , month = jun , pages = {200--211} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-13731-0_20" , volume = 6139 , year = 2010 } @InProceedings{cy-efsg-97 , author = ChungFRK #and# YauS , title = {{Eigenvalues, Flows and Separators of Graphs}} , booktitle = {{Proceedings of the 29th Annual ACM Symposium on Theory of Computing}} , pages = {1--8} , publisher = pub-acm , year = 1997 } @InProceedings{cy-noaes-94 , author = ChungFRK #and# YauS , title = {{A Near Optimal Algorithm for Edge Separators}} , booktitle = {{Proceedings of the 26th Annual ACM Symposium on Theory of Computing}} , pages = {1--8} , publisher = pub-acm , year = 1994 } @InProceedings{cy-oesdq-09 , author = ChengJ #and# YuJX , title = {{On-line Exact Shortest Distance Query Processing}} , booktitle = {{Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT '09)}} , pages = {481--492} , publisher = pub-acm , year = 2009 } %% -------------------------------------------------------------- @Article{d-a-87 , author = DwyerRA , title = {{A faster divide-and-conquer algorithm for constructing delaunay triangulations}} , journal = j-alg , number = 1 , pages = {137--151} , url = "http://dx.doi.org/10.1007/BF01840356" , volume = 2 , year = 1987 } @Article{d-aassp-69 , author = DreyfusSE , title = {{An Appraisal of Some Shortest-Path Algorithms}} , journal = j-or , number = 3 , pages = {395--412} , volume = 17 , year = 1969 } @mastersthesis{d-aevg-06 , author = DellingD , title = {{Analyse und Evaluierung von Vergleichsma{\ss}en f{\"u}r Graphclusterungen}} , month = feb , pdf = "http://i11www.ira.uka.de/extra/publications/d-aevg-06.pdf" , school = inf_ka , type = {Diplomarbeit} , year = 2006 } @Article{d-arp-64 , author = DurstenfeldR , title = {{Algorithm 235: Random Permutation}} , journal = j-comm-acm , month = jul , number = 7 , pages = {420--421} , url = "http://portal.acm.org/citation.cfm?doid=364520.364540" , volume = 7 , year = 1964 } @Article{d-ascnp-09 , author = DunlaingCO , title = {{A Simple Criterion for Nodal 3-connectivity in Planar Graphs}} , journal = j-entcs , pages = {245--253} , volume = 225 , year = 2009 } @InProceedings{d-asmag-08 , author = DjidjevHN , title = {{A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection}} , booktitle = {{Algorithms and Models for the Web-Graph, Proceedings of the 4th International Workshop, WAW 2006}} , pages = {117--128} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/6870084453701423/" , year = 2008 } @inproceedings{d-asmtp-51 , author = DantzigGB , editor = KoopmansTC , title = {{Application of the Simplex Method to a Transportation Problem}} , booktitle = {{Activity Analysis of Production and Allocation}} , pages = {359--373} , publisher = pub-wiley , series = "Cowles Commission fo" , volume = 13 , year = 1951 } @Article{d-aspft-69 , author = DialRB , title = {{Algorithm 360: Shortest-Path Forest with Topological Ordering [H]}} , journal = j-comm-acm , number = 11 , pages = {632--633} , volume = 12 , year = 1969 } @Article{d-aspmf-70 , author = DinitzY , title = {{Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation}} , journal = j-sov-math-dokl , month = sep , number = 5 , pages = {1277--1280} , pdf = "http://www.cs.bgu.ac.il/~dinitz/D70.pdf" , volume = 11 , year = 1970 } @inproceedings{d-bmgn-96 , author = DoarMB , title = {{A Better Model for Generating Test Networks}} , booktitle = {{IEEE GLOBECOM'96}} , year = 1996 } @incollection{d-brdmttp-73 , author = DinitzY , editor = FridmanAA , title = {{Bitwise residual decreasing method and transportation type problems}} , booktitle = {{Studies in Discrete Mathematics}} , note = {(In Russian)} , pages = {46--57} , publisher = pub-nauka , year = 1973 } @mastersthesis{d-carrn-10 , author = DeesJ , title = {{Computing Alternative Routes in Road Networks}} , month = apr , school = "Karlsruhe Institut f{\"u}r Technologie, Fakult{\"a}t f{\"u}r Informatik" , year = 2010 } @mastersthesis{d-ctdsp-99 , author = DeanBC , title = {{Continuous-Time Dynamic Shortest Path Algorithms}} , pdf = "http://www.cs.clemson.edu/~bcdean/bdean_masters_thesis.pdf" , school = "Massachusetts Institute of Technology" , year = 1999 } @phdthesis{d-earpa-09 , author = DellingD , title = {{Engineering and Augmenting Route Planning Algorithms}} , pdf = "http://i11www.ira.uka.de/extra/publications/d-earpa-09.pdf" , school = inf_ka , url = "url{http://i11www.ira.uka.de/extra/publications/d-earpa-09.pdf}" , year = 2009 } @article{d-ettg-63 , author = DiracGA , title = {{Extensions of Tur{\'a}n's theorem on graphs}} , journal = j-amash , pages = {417--422} , volume = 14 , year = 1963 } @phdthesis{d-fdapp-01 , author = DemetrescuC , title = {{Fully Dynamic Algorithms for Path Problems on Directed Graphs}} , month = apr , school = "University of Rome La Sapienza, Department of Computer and Systems Science" , year = 2001 } @inproceedings{d-fspn-78 , author = DinitzY , editor = PopkovY #and# ShmulyianB , title = {{Finding shortest paths in a network}} , booktitle = {{Transportation Modeling Systems}} , pages = {36--44} , publisher = {Institute for System} , year = 1978 } @InProceedings{d-gdt-08 , author = DhandapaniR , title = {{Greedy Drawings of Triangulations}} , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}} , pages = {102--111} , year = 2008 } @Book{d-gt-00 , author = DiestelR , title = {{Graph Theory}} , booktitle = {{Graph Theory}} , edition = second , publisher = pub-springer , series = ser-springer_gtm , year = 2000 } @Book{d-gt-10 , author = DiestelR , title = {{Graph Theory}} , booktitle = {{Graph Theory}} , publisher = pub-springer , series = ser-springer_gtm , year = 2010 } @misc{d-hccds-11 , author = DollC , title = {{Hierarchical Cut Clustering in Dynamic Scenarios}} , institution = "Karlsruhe Institute of Technology (KIT)" , month = feb , note = {Student Project, Studienarbeit} , school = "Department of Informatics" , year = 2011 } @Book{d-lpe-62 , author = DantzigGB , title = {{Linear Programming and Extensions}} , booktitle = {{Linear Programming and Extensions}} , publisher = pub-pup , year = 1962 } @Book{d-lpe-63 , author = DantzigGB , title = {{Linear Programming and Extensions}} , booktitle = {{Linear Programming and Extensions}} , publisher = pub-pup , year = 1963 } @mastersthesis{d-mhrs-12 , author = DrewsF , title = {{Multi-Hop Ride Sharing}} , institution = "Karlsruhe Institute of Technology" , month = may , type = {bachelor thesis} , year = 2012 } @inproceedings{d-mlfvsli-51 , author = DantzigGB , editor = KoopmansTC , title = {{Maximization of a Linear Function of Variables Subject to Linear Inequalities}} , booktitle = {{Activity Analysis of Production and Allocation}} , pages = {339--347} , publisher = pub-wiley , series = "Cowles Commission fo" , volume = 13 , year = 1951 } @Article{d-ntpcg-59 , author = DijkstraEW , title = {{A Note on Two Problems in Connexion with Graphs}} , journal = j-nummat , pages = {269--271} , volume = 1 , year = 1959 } @Article{d-rd-90 , author = DillencourtMB , title = {{Realizability of Delaunay triangulations}} , journal = j-ipl , number = 6 , pages = {283--287} , volume = 33 , year = 1990 } @techreport{d-spfif-04 , author = DeanBC , title = {{Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms}} , institution = "Massachusetts Institute Of Technology" , year = 2004 } @Book{d-sv-02 , editor = DiehlS , title = {{Software Visualization}} , booktitle = {{Software Visualization}} , publisher = pub-springer , series = ser-springer_lncs , volume = 2269 , year = 2002 } @InProceedings{d-tdsr-08 , author = DellingD , title = {{Time-Dependent SHARC-Routing}} , booktitle = {{Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)}} , month = sep , note = {Best Student Paper Award - ESA Track B} , pages = {332--343} , pdf = "http://i11www.ira.uka.de/extra/publications/d-tdsr-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5193 , year = 2008 } @Article{d-tdsr-11 , author = DellingD , title = {{Time-Dependent SHARC-Routing}} , journal = j-alg , month = may , number = 1 , pages = {60--94} , pdf = "http://i11www.ira.uka.de/extra/publications/d-tdsr-09.pdf" , url = "http://dx.doi.org/10.1007/s00453-009-9341-0" , volume = 60 , year = 2011 } @article{d-umnat-88 , author = DoreianP , title = {{Using Multiple Network Analytic Tools for a Single Social Network}} , journal = j-sn , pages = {287--312} , volume = 10 , year = 1988 } @Article{da-cdcne-05 , author = DuchJ #and# ArenasA , title = {{Community Detection in Complex Networks using Extremal Optimization}} , journal = j-pr-e , number = 027104 , pages = {1--4} , url = "http://link.aps.org/abstract/PRE/v72/e027104" , volume = 72 , year = 2005 } @article{da-ppan-89 , author = DoreianP #and# AlbertLH , title = {{Partitioning Political Actor Networks: Some Quantitative Tools for Analyzing Qualitative Networks}} , journal = j-qa , pages = {279--291} , volume = 1 , year = 1989 } @InProceedings{db-rahnu-97 , author = DasB #and# BharghavanV , title = {{Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets}} , booktitle = {{Proceedings of the IEEE International Conference on Communications 1997}} , pages = {376--380} , year = 1997 } @Book{dbf-gb-05 , author = DoreianP #and# BatageljV #and# FerligojA , title = {{Generalized Blockmodeling}} , booktitle = {{Generalized Blockmodeling}} , publisher = pub-cup , series = ser-sass , url = "http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=9780521840859" , volume = 25 , year = 2005 } @article{dbf-gbtmn-04 , author = DoreianP #and# BatageljV #and# FerligojA , title = {{Generalized Blockmodeling of Two-Mode Network Data}} , journal = j-sn , number = 1 , pages = {29--53} , volume = 26 , year = 2004 } @Article{dbf-sadn-00 , author = DoreianP #and# BatageljV #and# FerligojA , title = {{Symmetric-Acyclic Decompositions of Networks}} , journal = j-c2 , number = 1 , pages = {3--28} , volume = 17 , year = 2000 } @Article{dbhhv-zdmsp-02 , author = DevineK #and# BomanE #and# HeaphyR #and# HendricksonB #and# VaughanC , title = {{Zoltan Data Management Services for Parallel Dynamic Applications}} , journal = j-cse , number = 2 , pages = {90--97} , pdf = "http://www.sandia.gov/~egboman/papers/Zoltan_CSE.pdf" , url = "http://dx.doi.org/10.1109/5992.988653" , volume = 4 , year = 2002 } @InProceedings{dbs-a-10 , author = DemiryurekU #and# Banaei-KashaniF #and# ShahabiC , title = {{A case for time-dependent shortest path computation in spatial networks}} , booktitle = {{Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS'10)}} , pages = {474--477 } , year = 2010 } @InProceedings{dbsl-csdge-12 , author = DuschlM #and# BrennerT #and# SchimkeA #and# LuxenD , title = {{Contribution and Spatial Dimension of Geolocated External Factors to the Growth of Firms -- Empirical Evidence for Germany }} , booktitle = {{Geography of Innovation 2012}} , pdf = "ftp://137.248.191.199/RePEc/pum/wpaper/WP14.pdf" , year = 2012 } @Book{dcko-cgaa-08 , author = deBergM #and# CheongO #and# KreveldMv #and# OvermarsMH , title = {{Computational Geometry: Algorithms and Applications}} , booktitle = {{Computational Geometry: Algorithms and Applications}} , publisher = pub-springer , url = "http://www.springer.com/computer/theoretical+computer+science/book/978-3-540-77973-5" , year = 2008 } @Article{dd-cs-99 , author = DellingG #and# DellingD , title = {{Computergest{\"u}tzte Spracherkennung}} , journal = j-dp , pages = {115--119} , volume = 20 , year = 1999 } @book{dd-llpib-85 , author = DomschkeW #and# DrexlA , title = {{Location and Layout Planning: An International Bibliography}} , address = "Berlin" , publisher = pub-springer , year = 1985 } @misc{dd-ocncf-11 , author = DasGuptaB #and# DevineK , title = {{On the Complexity of Newman's Community Finding Approach for Biological and Social Networks}} , note = {On the arxiv eprint repository} , pdf = "http://arxiv.org/pdf/1102.0969v1" , url = "http://arxiv.org/abs/1102.0969" , year = 2011 } @Article{dda-t-06 , author = DanonL #and# DiazGuileraA #and# ArenasA , title = {{The effect of size heterogeneity on community identification in complex networks}} , journal = j-smte , number = {P11010} , url = "10.1088/1742-5468/2006/11/P11010" , year = 2006 } @Article{ddda-ccsi-05 , author = DanonL #and# DiazGuileraA #and# DuchJ #and# ArenasA , title = {{Comparing Community Structure Identification}} , journal = j-smte , number = {P09008} , pages = {1--10} , pdf = "http://www.iop.org/EJ/article/1742-5468/2005/09/P09008/jstat5_09_p09008.pdf" , url = "http://www.iop.org/EJ/abstract/1742-5468/2005/09/P09008" , volume = 09 , year = 2005 } @InProceedings{ddfv-fdmaf-12 , author = DangeloG #and# DEmidioM #and# FrigioniD #and# VitaleC , title = {{Fully Dynamic Maintenance of Arc-Flags in Road Networks}} , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}} , pages = {135--147} , publisher = pub-springer , series = ser-springer_lncs , volume = 7276 , year = 2012 } @Article{ddl-rdggc-08 , author = DiGiacomoE #and# DidimoW #and# LiottaG , title = {{Radial Drawings of Graphs: Geometric Constraints and Trade-Offs}} , journal = j-jda , month = mar , number = 1 , pages = {109--124} , url = "http://www.springerlink.com/content/w23872u835n24w31/" , volume = 6 , year = 2008 } @Article{ddlw-ccdpg-05 , author = DiGiacomoE #and# DidimoW #and# LiottaG #and# WismathSK , title = {{Curve-Constrained Drawings of Planar Graphs}} , journal = j-cg , number = 2 , pages = {1--23} , volume = 30 , year = 2005 } @InProceedings{ddlw-dpgc-03 , author = DiGiacomoE #and# DidimoW #and# LiottaG #and# WismathSK , title = {{Drawing Planar Graphs on a Curve}} , booktitle = {{Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)}} , pages = {192--204} , publisher = pub-springer , series = ser-springer_lncs , volume = 2880 , year = 2003 } @techreport{ddpww-cemj-12 , author = DellingD #and# DibbeltJ #and# PajorT #and# WagnerD #and# WerneckR , title = {{Computing and Evaluating Multimodal Journeys}} , institution = "Faculty of Informatics, Karlsruhe Institute of Technology" , number = {2012-20} , pdf = "http://i11www.ira.uka.de/extra/publications/ddpww-cemj-12.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000030757" , year = 2012 } @InProceedings{ddpww-cmjp-13 , author = DellingD #and# DibbeltJ #and# PajorT #and# WagnerD #and# WerneckR , title = {{Computing Multimodal Journeys in Practice}} , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}} , pages = {260--271} , pdf = "http://i11www.ira.uka.de/extra/publications/ddpww-cmjp-13.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 7933 , year = 2013 } @InProceedings{degkn-dtpar-10 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM , title = {{Drawing Trees with Perfect Angular Resolution and Polynomial Area}} , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}} , note = {Full version available at \url{http://arxiv.org/abs/1009.0581}.} , pages = {183--194} , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-dtpar-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_17" , volume = 6502 , year = 2011 } @Article{degkn-dtpar-13 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM , title = {{Drawing Trees with Perfect Angular Resolution and Polynomial Area}} , journal = dcg , number = 2 , pages = {157--182} , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-dtpar-12.pdf" , url = "http://dx.doi.org/10.1007/s00454-012-9472-y" , volume = 49 , year = 2013 } @InProceedings{degkn-ldg-10 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM , title = {{Lombardi Drawings of Graphs}} , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}} , note = {Full version available at \url{http://arxiv.org/abs/1009.0579}.} , pages = {195--207} , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-ldg-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_18" , volume = 6502 , year = 2011 } @Article{degkn-ldg-12 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM , title = {{Lombardi Drawings of Graphs}} , journal = j-jgaa , note = {Special issue of GD 2010.} , number = 1 , pages = {85--108} , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-ldg-12.pdf" , url = "http://jgaa.info/accepted/2012/Duncan+2012.16.1.pdf" , volume = 16 , year = 2012 } @InProceedings{dekw-dfe-02 , author = DuncanCA #and# EfratA #and# KobourovSG #and# WenkC , title = {{Drawing with Fat Edges}} , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}} , month = jan , pages = {162--177} , publisher = pub-springer , series = ser-springer_lncs , url = "http://gdea.informatik.uni-koeln.de/archive/00000509/" , volume = 2265 , year = 2002 } @InProceedings{del-dgrac-09 , author = DidimoW #and# EadesP #and# LiottaG , title = {{Drawing Graphs with Right Angle Crossings}} , booktitle = {{Algorithms and Data Structures, 11th International Symposium (WADS'09)}} , month = aug , pages = {206--217} , publisher = pub-springer , series = ser-springer_lncs , volume = 5664 , year = 2009 } @Book{dem-titcn-11 , editor = DehmerM #and# Emmert-StreibF #and# MehlerA , title = {{Towards an Information Theory of Complex Networks: Statistical Methods and Applications}} , booktitle = {{Towards an Information Theory of Complex Networks: Statistical Methods and Applications}} , publisher = {Birkh{"a}user Verlag} , year = 2011 } @Article{dett-adgab-94 , author = DiBattistaG #and# EadesP #and# TamassiaR #and# TollisIG , title = {{Algorithms for Drawing Graphs: an Annotated Bibliography}} , journal = j-cg , pages = {235--282} , volume = 4 , year = 1994 } @Article{df-fptci-95 , author = DowneyRG #and# FellowsMR , title = {{Fixed-Parameter Tractability and Completeness I: Basic Results}} , journal = j-sicomp , number = 4 , pages = {873--921} , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SMJCAT000024000004000873000001" , url = "http://link.aip.org/link/?SMJCAT/24/873/1" , volume = 24 , year = 1995 } @Article{df-fptcii-95 , author = DowneyRG #and# FellowsMR , title = {{Fixed-Parameter Tractability and Completeness {II}. On Completeness for {{\cal W}[1]}}} , journal = j-tcs , number = {1--2} , pages = {109--131} , url = "http://dx.doi.org/10.1016/0304-3975(94)00097-3" , volume = 141 , year = 1995 } @incollection{df-mfmctn-56 , author = DantzigGB #and# FulkersonDR , title = {{On the max-flow min-cut theorem of networks}} , booktitle = {{Linear Inequalities and Related Systems}} , pages = {215--221} , publisher = pub-pup , series = ser-ann_math_stud , volume = 38 , year = 1956 } @book{df-pc-99 , author = DowneyRG #and# FellowsMR , title = {{Parameterized Complexity}} , publisher = pub-springer , series = ser-springer_mcs , year = 1999 } @Article{df-srmrp-79 , author = DenardoEV #and# FoxBL , title = {{Shortest-Route Methods: 1. Reaching, Pruning, and Buckets}} , journal = j-or , number = 1 , pages = {161--186} , volume = 27 , year = 1979 } @InProceedings{dffgk-opset-12 , author = DiGiacomoE #and# FratiF #and# FulekR #and# GrilliL #and# KrugM , title = {{Orthogeodesic Point-Set Embedding of Trees}} , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}} , note = {to appear} , publisher = pub-springer , series = ser-springer_lncs , year = 2012 } @techreport{dffgk-opset-24 , author = DiGiacomoE #and# FratiF #and# FulekR #and# GrilliL #and# KrugM , title = {{Orthogeodesic Point-Set Embedding of Trees}} , institution = kit_wagner , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024215" , year = 2011 } @Book{dffgktw-spc-03 , editor = DongarraJ #and# FosterI #and# FoxG #and# GroppW #and# KennedyK #and# TorczonL #and# WhiteA , title = {{Sourcebook of Parallel Computing}} , booktitle = {{Sourcebook of Parallel Computing}} , publisher = pub-mk , year = 2003 } @InCollection{dfin-vaett-02 , author = DemetrescuC #and# FinocchiI #and# ItalianoGF #and# NaeherS , title = {{Visualization in Algorithm Engineering: Tools and Techniques}} , booktitle = {{Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software}} , pages = {24--50} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/8tlg4unm4bu3g00c/" , volume = 2547 , year = 2002 } @Article{dfk-fpaos-08 , author = DujmovicV #and# FernauH #and# KaufmannM , title = {{Fixed Parameter Algorithms for One-Sided Crossing Minimization Revisited}} , journal = j-jda , month = jun , number = 2 , pages = {313--323} , url = "http://www.springerlink.com/content/jwhew5fck9a3456d/" , volume = 6 , year = 2008 } @InProceedings{dfkvv-clgm-99 , author = DrineasP #and# FriezeAM #and# KannanR #and# VempalaS #and# VinayV , title = {{Clustering in Large Graphs and Matrices}} , booktitle = {{Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)}} , pages = {291--299} , publisher = pub-siam , url = "http://portal.acm.org/citation.cfm?id=314500.314576" , year = 1999 } @Article{dfkvv-clgsv-04 , author = DrineasP #and# FriezeAM #and# KannanR #and# VempalaS #and# VinayV , title = {{Clustering Large Graphs via the Singular Value Decomposition}} , journal = j-ma , number = {1-3} , pages = {9--33} , pdf = "http://springerlink.com/content/u424k6nn6k622788/fulltext.pdf" , url = "http://springerlink.com/content/u424k6nn6k622788/" , volume = 56 , year = 2004 } @Article{dflj-adcss-07 , author = DuH #and# FeldmanMW #and# LiS #and# JinX , title = {{An algorithm for detecting community structure of social networks based on prior knowledge and modularity}} , journal = j-complexity , month = jan , number = 3 , pages = {53--60} , url = "http://www3.interscience.wiley.com/cgi-bin/abstract/114068028/ABSTRACT" , volume = 12 , year = 2007 } @Article{dfls-bsrgc-04 , author = DuchonP #and# FlajoletP #and# LouchardG #and# SchaefferG , title = {{Boltzmann Samplers for the Random Generation of Combinatorial Structures}} , journal = j-cpc , number = {4-5} , pages = {577--625} , volume = 13 , year = 2004 } @InProceedings{dfmn-mspda-01 , author = DemetrescuC #and# FrigioniD #and# MarchettiSpaccamelaA #and# NanniU , title = {{Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study}} , booktitle = {{Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 1982 , year = 2001 } @InProceedings{dfv-dafrn-11 , author = DangeloG #and# FrigioniD #and# VitaleC , title = {{Dynamic Arc-Flags in Road Networks}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {88--99} , publisher = pub-springer , series = ser-springer_lncs , volume = 6630 , year = 2011 } @InProceedings{dggnw-ectea-07 , author = DellingD #and# GaertlerM #and# GoerkeR #and# NikoloskiZ #and# WagnerD , title = {{Evaluating Clustering Techniques - An Engineering Approach Inspired by Unit-Tests}} , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'07)}} , month = oct , note = {Poster} , pdf = "http://i11www.ira.uka.de/extra/publications/dggnw-ectea-07.pdf" , url = "http://cssociety.org/ECCS07-Programme" , year = 2007 } @techreport{dggnw-hect-06 , author = DellingD #and# GaertlerM #and# GoerkeR #and# NikoloskiZ #and# WagnerD , title = {{How to Evaluate Clustering Techniques}} , institution = iti_wagner , number = {2006-24} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3149" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007104" , year = 2006 } @techreport{dggw-ecgc-06 , author = DellingD #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{Experiments on Comparing Graph Clusterings}} , institution = iti_wagner , number = {2006-16} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005167" , year = 2006 } @InProceedings{dggw-ecgc-07 , author = DellingD #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{Engineering Comparators for Graph Clusterings}} , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'07)}} , month = oct , note = {as poster} , pdf = "http://www.springerlink.com/content/u172637452372n03/fulltext.pdf" , url = "http://dx.doi.org/10.1007/978-3-540-68880-8_14" , year = 2007 } @InProceedings{dggw-ecgc-08 , author = DellingD #and# GaertlerM #and# GoerkeR #and# WagnerD , title = {{Engineering Comparators for Graph Clusterings}} , booktitle = {{Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08)}} , month = jun , pages = {131--142} , pdf = "http://i11www.ira.uka.de/extra/publications/dggw-ecgc-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5034 , year = 2008 } @Book{dgj-spndi-09 , editor = DemetrescuC #and# GoldbergAV #and# JohnsonDS , title = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @InProceedings{dgklr-hoap-12 , author = DiGiacomoE #and# GrilliL #and# KrugM #and# LiottaG #and# RutterI , title = {{Hamiltonian Orthogeodesic Alternating Paths}} , booktitle = {{Proceedings of the 22nd International Workshop on Combinatorial Algorithms}} , pages = {170--181} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/f6u552unx28353jw/" , year = 2012 } @Article{dgklr-hogap-12 , author = DiGiacomoE #and# GrilliL #and# KrugM #and# LiottaG #and# RutterI , title = {{Hamiltonian orthogeodesic alternating paths}} , journal = j-jda , note = {Special issue of IWOCA'11} , pages = {34--52} , url = "http://dx.doi.org/10.1016/j.jda.2012.04.012" , volume = 16 , year = 2012 } @InProceedings{dgkrtw-hagbg-10 , author = deBergM #and# GerritsD #and# KhosraviA #and# RutterI #and# TsirogiannisC #and# WolffA , title = {{How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians}} , booktitle = {{Proceedings of the 26th European Workshop on Computational Geometry (EuroCG'10)}} , pages = {73--76} , year = 2010 } @Article{dglttv-ecfgd-97 , author = DiBattistaG #and# GargA #and# LiottaG #and# TamassiaR #and# TassinariE #and# VargiuF , title = {{An Experimental Comparison of Four Graph Drawing Algorithms}} , journal = j-cgta , month = apr , number = {5-6} , pages = {303--325} , url = "http://portal.acm.org/citation.cfm?id=280655" , volume = 7 , year = 1997 } @Article{dgm-cocn-06 , author = DorogovtsevSN #and# GoldbergAV #and# MendesJFF , title = {{$k$-Core Organization of Complex Networks}} , journal = j-phrl , month = feb , number = 040601 , pages = {1--4} , url = "http://link.aps.org/abstract/PRL/v96/e040601" , volume = 96 , year = 2006 } @InProceedings{dgnp-psrs-10 , author = DellingD #and# GemsaA #and# NollenburgM #and# PajorT , title = {{Path Schematization for Route Sketches}} , booktitle = {{Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10)}} , month = jun , pages = {285--296} , pdf = "http://i11www.ira.uka.de/extra/publications/dgnp-psrs-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-13731-0_27" , volume = 6139 , year = 2010 } @techreport{dgnp-psrs-tr10 , author = DellingD #and# GemsaA #and# NollenburgM #and# PajorT , title = {{Path Schematization for Route Sketches}} , institution = "Faculty of Informatics, Karlsruhe Institute of Technology" , number = {2010-02} , pdf = "http://i11www.ira.uka.de/extra/publications/dgnp-psrs-tr10.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000016078" , year = 2010 } @techreport{dgnw-phast-10 , author = DellingD #and# GoldbergAV #and# NowatzykA #and# WerneckR , title = {{PHAST: Hardware-Accelerated Shortest Path Trees}} , institution = "Microsoft Research" , number = {MSR-TR-2010-125} , year = 2010 } @InProceedings{dgnw-phast-11 , author = DellingD #and# GoldbergAV #and# NowatzykA #and# WerneckR , title = {{PHAST: Hardware-Accelerated Shortest Path Trees}} , booktitle = {{25th International Parallel and Distributed Processing Symposium (IPDPS'11)}} , note = {Best Paper Award - Algorithms Track} , pages = {921--931} , publisher = pub-ics , year = 2011 } @Article{dgnw-phast-13 , author = DellingD #and# GoldbergAV #and# NowatzykA #and# WerneckR , title = {{PHAST: Hardware-accelerated shortest path trees}} , journal = j-pdc , number = 7 , pages = {940--952} , pdf = "http://i11www.ira.uka.de/extra/publications/dgnw-phast-12.pdf" , url = "http://www.sciencedirect.com/science/article/pii/S074373151200041X" , volume = 73 , year = 2013 } @InProceedings{dgpw-crp-11 , author = DellingD #and# GoldbergAV #and# PajorT #and# WerneckR , title = {{Customizable Route Planning}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {376--387} , pdf = "http://i11www.ira.uka.de/extra/publications/dgpw-crp-11.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 6630 , year = 2011 } @InProceedings{dgrw-ecbbg-12 , author = DellingD #and# GoldbergAV #and# RazenshteynI #and# WerneckR , title = {{Exact Combinatorial Branch-and-Bound for Graph Bisection}} , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}} , pages = {30--44} , publisher = pub-siam , year = 2012 } @techreport{dgrw-gpnc-10 , author = DellingD #and# GoldbergAV #and# RazenshteynI #and# WerneckR , title = {{Graph Partitioning with Natural Cuts}} , institution = "Microsoft Research" , number = {MSR-TR-2010-164} , year = 2010 } @InProceedings{dgrw-gpnc-11 , author = DellingD #and# GoldbergAV #and# RazenshteynI #and# WerneckR , title = {{Graph Partitioning with Natural Cuts}} , booktitle = {{25th International Parallel and Distributed Processing Symposium (IPDPS'11)}} , pages = {1135--1146} , publisher = pub-ics , year = 2011 } @techreport{dgsb-dcarr-10 , author = DeesJ #and# GeisbergerR #and# SandersP #and# BaderR , title = {{Defining and Computing Alternative Routes in Road Networks}} , institution = "ITI Sanders, Faculty of Informatics, Karlsruhe Institute of Technology" , year = 2010 } @InProceedings{dgsw-orca-09 , author = DellingD #and# GoerkeR #and# SchulzC #and# WagnerD , title = {{ORCA Reduction and ContrAction Graph Clustering}} , booktitle = {{Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09)}} , month = jun , pages = {152--165} , pdf = "http://www.springerlink.com/content/vn74777wj087k748/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-02158-9_14" , volume = 5564 , year = 2009 } @InProceedings{dgw-fbspr-11 , author = DellingD #and# GoldbergAV #and# WerneckR , title = {{Faster Batched Shortest Paths in Road Networks}} , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}} , pages = {52--63} , series = ser-oasioasi , volume = 20 , year = 2011 } @InProceedings{dgw-gsgc-06 , author = DellingD #and# GaertlerM #and# WagnerD , title = {{Generating Significant Graph Clusterings}} , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'06)}} , month = sep , pdf = "http://i11www.ira.uka.de/extra/publications/dgw-gsgc-06.pdf" , url = "http://cssociety.org/tiki-index.php?page=ECCS'06+Programme" , year = 2006 } @InProceedings{dgw-hlc-13 , author = DellingD #and# GoldbergAV #and# WerneckR , title = {{Hub Label Compression}} , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}} , pages = {18--29} , publisher = pub-springer , series = ser-springer_lncs , volume = 7933 , year = 2013 } @Article{dgw-sprnf-11 , author = DellingD #and# GoldbergAV #and# WerneckR , title = {{Shortest Paths in Road Networks: From Practice to Theory and Back}} , journal = j-it , month = dec , pages = {294--301} , url = "http://www.oldenbourg-link.com/toc/itit/53/6" , volume = 53 , year = 2011 } @techreport{dgwz-ctin-08 , author = DellingD #and# GiannakopoulouK #and# WagnerD #and# ZaroliagisC , title = {{Contracting Timetable Information Networks}} , institution = "Arrival Technical Report" , number = 144 , pdf = "http://arrival.cti.gr/uploads/Documents.0144/ARRIVAL-TR-0144.pdf" , year = 2008 } @techreport{dgwz-tiucd-08 , author = DellingD #and# GiannakopoulouK #and# WagnerD #and# ZaroliagisC , title = {{Timetable Information Updating in Case of Delays: Modeling Issues}} , institution = "Arrival Technical Report" , number = 133 , pdf = "http://arrival.cti.gr/uploads/Documents.0133/ARRIVAL-TR-0133.pdf" , year = 2008 } @Article{dh-dgnsa-96 , author = DavidsonR #and# HarelD , title = {{Drawing Graphs Nicely using Simulated Annealing}} , journal = j-acmtg , number = 4 , pages = {301--331} , volume = 15 , year = 1996 } @book{dh-fl-02 , editor = DreznerZ #and# HamacherHW , title = {{Facility Location: Application and Theory}} , booktitle = {{Facility Location: Application and Theory}} , publisher = pub-springer , year = 2002 } @InProceedings{dh-kmcpc-04 , author = DingCHQ #and# HeX , title = {{K-Means Clustering via Principal Component Analysis}} , booktitle = {{Proceedings of the twenty-first international conference on Machine learning}} , pages = {29--39} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1015408&type=pdf&coll=GUIDE&dl=GUIDE&CFID=18274057&CFTOKEN=7" , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1015330.1015408" , volume = 69 , year = 2004 } @article{dh-lbpg-73 , author = DonathWE #and# HoffmanAJ , title = {{Lower bounds for the partitioning of graphs}} , journal = j-ijrd , number = 5 , pages = {420--425} , volume = 17 , year = 1973 } @techreport{dhhzs-prhuf-01 , author = DingCHQ #and# HeX #and# HusbandsP #and# ZhaH #and# SimonHD , title = {{PageRank, HITS and a unified framework for link analysis}} , address = "Berkeley, CA, USA" , institution = "NERSC Division, Lawrence Berkeley National Laboratory, University of California" , month = {Nov} , note = {updated Sept. 2002 (LBNL-50007), presented in the poster session of the Third SIAM International Con} , number = 49372 , type = {LBNL Tech Report} , year = 2001 } @book{dhjlm-es-95 , author = DalyF #and# HandDJ #and# JonesMC #and# LunnAD #and# McConwayKJ , title = {{Elements of Statistics}} , isbn = "0-201-42278-6" , publisher = {The Open University,} , year = 1995 } @InProceedings{dhk-cdhmf-11 , author = DemaineED #and# HajiaghayiM #and# KawarabayashiK , title = {{Contraction Decomposition in $H$-Minor-Free Graphs and Algorithmic Applications}} , booktitle = {{Proceedings of the 43rd Annual {ACM} Symposium on the Theory of Computing (STOC'11)}} , pages = {441--450} , publisher = pub-acm , year = 2011 } @InCollection{dhmps-gads-06 , author = DellnitzM #and# HesselM #and# MetznerP #and# PreisR #and# SchutteC , title = {{Graph Algorithms for Dynamical Systems}} , booktitle = {{Analysis, Modeling and Simulation of Multiscale Problems}} , pages = {619--645} , publisher = pub-springer , year = 2006 } @InProceedings{dhmsw-hpmlg-06 , author = DellingD #and# HolzerM #and# MuellerK #and# SchulzF #and# WagnerD , title = {{High-Performance Multi-Level Graphs}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}} , month = nov , pdf = "http://i11www.ira.uka.de/extra/publications/dhmsw-hpmlg-06.pdf" , url = "http://www.dis.uniroma1.it/~challenge9/papers.shtml" , year = 2006 } @InCollection{dhmsw-hpmlr-09 , author = DellingD #and# HolzerM #and# MuellerK #and# SchulzF #and# WagnerD , title = {{High-Performance Multi-Level Routing}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {73--92} , pdf = "http://i11www.ira.uka.de/extra/publications/dhmsw-hpmlr-09.pdf" , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @misc{dhs-cltw-06 , author = DijkTv #and# HeuvelJ #and# SlobW , title = {{Computing treewidth with LibTW}} , institution = "Applied Computer Science - Utrecht University" , url = "http://www.treewidth.com/" , year = 2006 } @InProceedings{dhs-nlrkm-05 , author = DingCHQ #and# HeX #and# SimonHD , title = {{Nonnegative Lagrangian Relaxation of K-Means and Spectral Clustering }} , booktitle = {{Proceedings of the 16th European Conference on Machine Learning}} , pages = {530--538} , pdf = "http://www.springerlink.com/content/f4722m7103u59qpr/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/11564096" , volume = 3720 , year = 2005 } @InProceedings{dhs-oenmf-05 , author = DingCHQ #and# HeX #and# SimonHD , title = {{On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering}} , booktitle = {{Proceedings of the fifth SIAM International Conference on Data Mining}} , pages = {606--610} , pdf = "http://www.siam.org/proceedings/datamining/2005/dm05_70dingc.pdf" , publisher = pub-siam , url = "http://www.siam.org/proceedings/datamining/2005/dm05.php" , year = 2005 } @techreport{dhw-dhgcum-11 , author = DollC #and# HartmannT #and# WagnerD , title = {{Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees}} , institution = kit_wagner , note = {Karlsruhe Reports in Informatics 2011-10} , pdf = "http://i11www.ira.uka.de/extra/publications/dhw-dhgcum-11.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022450" , year = 2011 } @InProceedings{dhw-dhmctc-11 , author = DollC #and# HartmannT #and# WagnerD , title = {{Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees}} , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}} , month = aug , pages = {338--349} , publisher = pub-springer , series = ser-springer_lncs , volume = 6844 , year = 2011 } @InProceedings{dhzgs-amcag-01 , author = DingCHQ #and# HeX #and# ZhaH #and# GuM #and# SimonHD , title = {{A Min-max Cut Algorithm for Graph Partitioning and Data Clustering}} , booktitle = {{Proceedings of the 2001 IEEE International Conference on Data Mining}} , pages = {107--114} , pdf = "http://ieeexplore.ieee.org/iel5/7762/21329/00989507.pdf?tp=&arnumber=989507&isnumber=21329" , publisher = pub-ics , url = "http://dx.doi.org/10.1109/ICDM.2001.989507" , year = 2001 } @Article{di-da-06 , author = DemetrescuC #and# ItalianoGF , title = {{Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures}} , journal = j-jda , month = sep , number = 3 , pages = {353--383} , volume = 4 , year = 2006 } @inproceedings{di-dapsp-03 , author = DemetrescuC #and# ItalianoGF , title = {{A New Approach to Dynamic All Pairs Shortest Paths}} , booktitle = {{Proceedings of the 35th Annual {ACM} Symposium on the Theory of Computing (STOC'03)}} , month = jun , pages = {159--166} , year = 2003 } @InProceedings{di-espa-04 , author = DemetrescuC #and# ItalianoGF , title = {{Engineering Shortest Path Algorithms}} , booktitle = {{Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04)}} , pages = {191--198} , publisher = pub-springer , series = ser-springer_lncs , volume = 3059 , year = 2004 } @InProceedings{djpsy-cmc-92 , author = DahlhausE #and# JohnsonDS #and# PapadimitriouCH #and# SeymourPD #and# YannakakisM , title = {{The Complexity of Multiway Cuts (Extended Abstract)}} , booktitle = {{Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'92)}} , pages = {241--251} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=129736&type=pdf&coll=GUIDE&dl=&CFID=26591050&CFTOKEN=8351605" , publisher = pub-acm , url = "http://doi.acm.org/10.1145/129712.129736" , year = 1992 } @Article{djpsy-tcmc-94 , author = DahlhausE #and# JohnsonDS #and# PapadimitriouCH #and# SeymourPD #and# YannakakisM , title = {{The Complexity of Multiterminal Cuts}} , journal = j-sicomp , number = 4 , pages = {864--894} , pdf = "https://eprints.kfupm.edu.sa/69233/1/69233.pdf" , volume = 23 , year = 1994 } @InCollection{dkhs-cs-10 , author = DellingD #and# KandybaM #and# HoffmannR #and# SchulzeA , title = {{Case Studies}} , booktitle = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}} , pages = {389--445} , publisher = pub-springer , series = ser-springer_lncs , volume = 5971 , year = 2010 } @incollection{dkl-otsotsomec-76 , author = DinitzY #and# KarzanovAV #and# LomonosovMV , editor = FridmanAA , title = {{On the structure of the system of minimum edge cuts in a graph}} , booktitle = {{In Studies in Discrete Optimization}} , pages = {290-306} , publisher = pub-nauka , year = 1976 } @InProceedings{dklw-rmrpl-12 , author = DellingD #and# KobitzschM #and# LuxenD #and# WerneckR , title = {{Robust Mobile Route Planning with Limited Connectivity}} , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}} , pages = {150--159} , pdf = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/026.pdf" , publisher = pub-siam , year = 2012 } @InProceedings{dkm-smooc-06 , author = DwyerT #and# KorenY #and# MarriottK , title = {{Stress Majorization with Orthogonal Ordering Constraints}} , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}} , month = jan , pages = {141--152} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/f136086184711p48/" , volume = 3843 , year = 2006 } @article{dkmrst-ssw-02 , author = DillS #and# KumarR #and# McCurleyKS #and# RajagopalanS #and# SivakumarD #and# TomkinsAS , title = {{Self-Similarity in the Web}} , journal = j-tit , month = aug , number = 3 , pages = {205--223} , volume = 2 , year = 2002 } @InProceedings{dkp-pcbcp-10 , author = DellingD #and# KatzB #and# PajorT , title = {{Parallel Computation of Best Connections in Public Transportation Networks}} , booktitle = {{24th International Parallel and Distributed Processing Symposium (IPDPS'10)}} , pages = {1--12} , pdf = "http://i11www.ira.uka.de/extra/publications/dkp-pcbcp-10.pdf" , publisher = pub-ics , year = 2010 } @Article{dkp-pcbcp-12 , author = DellingD #and# KatzB #and# PajorT , title = {{Parallel Computation of Best Connections in Public Transportation Networks}} , journal = j-acm-ea , month = jul , number = 1 , pages = {4.4:4.1--4.4:4.26} , url = "http://dl.acm.org/citation.cfm?id=2345678" , volume = 17 , year = 2012 } @techreport{dkp-pcbcp-tr-09 , author = DellingD #and# KatzB #and# PajorT , title = {{Parallel Computation of Best Connections in Public Transportation Networks}} , institution = "Faculty of Informatics, Karlsruhe Institute of Technology" , number = 16 , pdf = "http://i11www.ira.uka.de/extra/publications/dkp-pcbcp-tr-09.pdf" , year = 2009 } @Article{dks-g-09 , author = DingG #and# KannoJ #and# SuJ , title = {{Generating 5-regular planar graphs}} , journal = j-jgt , month = jul , number = 3 , pages = {219--240} , volume = 61 , year = 2009 } @InProceedings{dkw-gdcr-06 , author = DuncanCA #and# KobourovSG #and# WagnerD , title = {{Graph Drawing Contest Report}} , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}} , month = jan , pages = {528--531} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/11618058" , volume = 3843 , year = 2006 } @InProceedings{dllpsz-tcepi-06 , author = DehneF #and# LangstonMA #and# LuoX #and# PitreS #and# ShawP #and# ZhangYy , title = {{The Cluster Editing Problem: Implementations and Experiments}} , booktitle = {{Parameterized and Exact Computation}} , month = sep , pages = {13--24} , pdf = "http://www.springerlink.com/content/dt56l0mn081034j7/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/dt56l0mn081034j7" , volume = {4169/2006} , year = 2006 } @Article{dm-bss-07 , author = deFraysseixH #and# MendezPO , title = {{Barycentric Systems and Stretchability}} , journal = j-dam , pages = {1079--1095} , volume = 155 , year = 2007 } @InProceedings{dm-csmud-08 , author = DwyerT #and# MarriottK , title = {{Constrained Stress Majorization Using Diagonally Scaled Gradient Projection}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , pages = {219--230} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/f38344l830h83265/" , volume = 4875 , year = 2008 } @article{dm-en-02 , author = DorogovtsevSN #and# MendesJFF , title = {{Evolution of Networks}} , journal = j-ap , month = jun , number = 4 , pages = {1079--1187} , volume = 51 , year = 2002 } @book{dm-en-03 , author = DorogovtsevSN #and# MendesJFF , title = {{Evolution of Networks}} , publisher = pub-oup , year = 2003 } @InProceedings{dmada-mlmee-12 , author = DemestichasK #and# MasikosM #and# AdamopoulouE #and# DreherS #and# ArkayaAD , title = {{Machine-Learning Methodology for Energy Efficient Routing}} , booktitle = {{the 19th World Congress on Intelligent Transport Systems}} , month = oct , year = 2012 } @Article{dmcrg-tdvrpacs-08 , author = DonatiAV #and# MontemanniR #and# CasagrandeN #and# RizzoliAE #and# GambardellaLM , title = {{Time dependent vehicle routing problem with a multi ant colony system}} , journal = j-ejor , pages = {1174--1191} , volume = 185 , year = 2008 } @Article{dml-daaas-09 , author = DangC #and# MaW #and# LiangJ , title = {{A Deterministic Annealing Algorithm for Approximating a Solution of the Min-Bisection Problem }} , journal = j-nn , number = 1 , pages = {58--66} , url = "http://dx.doi.org/10.1016/j.neunet.2008.09.008" , volume = 22 , year = 2009 } @Book{dmm-abco-97 , editor = DellamicoM #and# MaffioliF #and# MartelloS , title = {{Annotated Bibliographies in Combinatorial Optimization}} , booktitle = {{Annotated Bibliographies in Combinatorial Optimization}} , publisher = pub-wiley , year = 1997 } @InProceedings{dmm-clglt-97 , author = DogrusozU #and# MaddenB #and# MaddenP , title = {{Circular Layout in the {G}raph {L}ayout {T}oolkit}} , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}} , location = "Berkeley, California, USA" , month = jan , pages = {92--100} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/27295q2174557g1u/" , volume = 1090 , year = 1997 } @Article{dmr-bor-95 , author = deFraysseixH #and# MendezPO #and# RosenstiehlP , title = {{Bipolar Orientations Revisited}} , journal = j-dam , month = jan , number = {2--3} , pages = {157--179} , volume = 56 , year = 1995 } @Article{dmr-otcg-94 , author = deFraysseixH #and# MendezPO #and# RosenstiehlP , title = {{On Triangle Contact Graphs}} , journal = j-cpc , pages = {233--246} , volume = 3 , year = 1994 } @article{dmrtw-aacms-00 , author = DoddiS #and# MaratheMV #and# RaviSS #and# TaylorDS #and# WidmayerP , title = {{Approximation Algorithms for Clustering to Minimize the Sum of Diameters}} , journal = j-njc , number = 3 , pages = {185--203} , volume = 7 , year = 2000 } @InProceedings{dms-mcspt-08 , author = DisserY #and# MuellerHannemannM #and# SchneeM , title = {{Multi-Criteria Shortest Paths in Time-Dependent Train Networks}} , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}} , month = jun , pages = {347--361} , publisher = pub-springer , series = ser-springer_lncs , volume = 5038 , year = 2008 } @unpublished{dms-sgnesbam-00 , author = DorogovtsevSN #and# MendesJFF #and# SamukhinAN , title = {{Structure of Growing Networks: Exact Solution of the Barab{\' a}si-Albert's Model}} , month = apr , note = {http://xxx.sissa.it/ps/cond-mat/0004434} , year = 2000 } @InProceedings{dn-alcms-95 , author = DinitzY #and# NutovZ , title = {{A 2-Level Cactus Model for the System of Minimum and Minimum+1 Edge-Cuts in a Graph and its Incremental Maintenance}} , booktitle = {{Proceedings of the 27th Annual {ACM} Symposium on the Theory of Computing (STOC'95)}} , month = may , pages = {509--518} , url = "http://portal.acm.org/citation.cfm?id=225268" , year = 1995 } @InProceedings{dn-bcbrd-08 , author = DellingD #and# NanniciniG , title = {{Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks}} , booktitle = {{Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08)}} , month = dec , pages = {813--824} , pdf = "http://i11www.ira.uka.de/extra/publications/dn-bcbrd-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5369 , year = 2008 } @Article{dn-crdtd-12 , author = DellingD #and# NanniciniG , title = {{Core Routing on Dynamic Time-Dependent Road Networks}} , journal = j-ijc2 , number = 2 , pages = {187--201} , volume = 24 , year = 2012 } @inproceedings{dn-imeccg-00 , author = DinitzY #and# NossensonR , title = {{Incremental Maintenance of the $5$-Edge-Connectivity Classes of a Graph}} , booktitle = {{Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT'00)}} , month = jul , pages = {272--285} , publisher = pub-springer , series = ser-springer_lnm , volume = 1851 , year = 2000 } @article{do-bacg-03 , author = DankelmannP #and# OellermannOR , title = {{Bounds on the average connectivity of a graph}} , journal = j-dam , month = aug , pages = {305--318} , volume = 129 , year = 2003 } @Article{dos-sptdf-12 , author = DehneF #and# OmranMT #and# SackJ , title = {{Shortest Paths in Time-Dependent FIFO Networks}} , journal = j-alg , pages = {416--435} , volume = 62 , year = 2012 } @Article{dp-st-84 , author = DeoN #and# PangC , title = {{Shortest-path algorithms: Taxonomy and annotation}} , journal = j-networks , number = 2 , pages = {275--323} , url = "dx.doi.org/10.1002/net.3230140208" , volume = 14 , year = 1984 } @Article{dps-asglp-02 , author = DiazGuileraA #and# PetitJ #and# SernaM , title = {{A Survey of Graph Layout Problems}} , journal = j-acm-csur , number = 3 , pages = {313--356} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=568523&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36303563&CFTOKEN=98" , url = "http://doi.acm.org/10.1145/568522.568523" , volume = 34 , year = 2002 } @InProceedings{dpsw-isftr-13 , author = DibbeltJ #and# PajorT #and# StrasserB #and# WagnerD , title = {{Intriguingly Simple and Fast Transit Routing}} , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}} , pages = {43--54} , pdf = "http://i11www.ira.uka.de/extra/publications/dpsw-isftr-13.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 7933 , year = 2013 } @Article{dpv-cprn-05 , author = DerenyiI #and# PallaG #and# VicsekT , title = {{Clique Percolation in Random Networks}} , journal = j-phrl , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=PRLTAO000094000016160202000001" , url = "http://link.aps.org/abstract/PRL/v94/e160202" , volume = 94 , year = 2005 } @InProceedings{dpw-ammrp-09 , author = DellingD #and# PajorT #and# WagnerD , title = {{Accelerating Multi-Modal Route Planning by Access-Nodes}} , booktitle = {{Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09)}} , month = sep , pages = {587--598} , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-ammrp-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5757 , year = 2009 } @InProceedings{dpw-etegf-08 , author = DellingD #and# PajorT #and# WagnerD , title = {{Engineering Time-Expanded Graphs for Faster Timetable Information}} , booktitle = {{Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}} , month = sep , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-etegf-08.pdf" , series = ser-oasioasi , year = 2008 } @InCollection{dpw-etegf-09 , author = DellingD #and# PajorT #and# WagnerD , title = {{Engineering Time-Expanded Graphs for Faster Timetable Information}} , booktitle = {{Robust and Online Large-Scale Optimization}} , pages = {182--206} , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-etegf-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5868 , year = 2009 } @InProceedings{dpw-rbptr-12 , author = DellingD #and# PajorT #and# WerneckR , title = {{Round-Based Public Transit Routing}} , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}} , pages = {130--140} , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-rbptr-12.pdf" , publisher = pub-siam , url = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/024.pdf" , year = 2012 } @InProceedings{dpw-ucmmr-12 , author = DibbeltJ #and# PajorT #and# WagnerD , title = {{User-Constrained Multi-Modal Route Planning}} , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}} , pages = {118--129} , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-ucmmr-12.pdf" , publisher = pub-siam , year = 2012 } @InProceedings{dpwz-erpfn-09 , author = DellingD #and# PajorT #and# WagnerD #and# ZaroliagisC , title = {{Efficient Route Planning in Flight Networks}} , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}} , pdf = "http://i11www.ira.uka.de/extra/publications/dpwz-erpfn-09.pdf" , series = ser-oasioasi , year = 2009 } @InProceedings{drr-eloud-06 , author = DelprattO #and# RahmanN #and# RamanR , title = {{Engineering the LOUDS Succinct Tree Representation}} , booktitle = {{Proceedings of the 5th Workshop on Experimental Algorithms (WEA'06)}} , pages = {134--145} , publisher = pub-springer , series = ser-springer_lncs , volume = 4007 , year = 2006 } @InProceedings{drvw-mapcv-06 , author = DeshpandeA #and# RademacherL #and# VempalaS #and# WangC , title = {{Matrix Approximation and Projective Clustering via Volume Sampling}} , booktitle = {{Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)}} , isbn = "0-89871-605-5" , pages = {1117--1126} , url = "http://doi.acm.org/10.1145/1109557.1109681" , year = 2006 } @Article{ds-atk-54 , author = DiracGA #and# SchusterS , title = {{A Theorem of Kuratowski}} , journal = j-indmath , pages = {343--348} , volume = 16 , year = 1954 } @book{ds-esn-97 , editor = DoreianP #and# StokmanFN , title = {{Evolution of Social Networks}} , booktitle = {{Evolution of Social Networks}} , publisher = pub-gb , year = 1997 } @Article{dsd-r-84 , author = DesrosiersJ #and# SoumisF #and# DesrochersM , title = {{Routing with time windows by column generation}} , journal = j-networks , month = oct , number = 4 , pages = {545--565} , volume = 14 , year = 1984 } @InCollection{dssw-erpa-09 , author = DellingD #and# SandersP #and# SchultesD #and# WagnerD , title = {{Engineering Route Planning Algorithms}} , booktitle = {{Algorithmics of Large and Complex Networks}} , pages = {117--139} , pdf = "http://i11www.ira.uka.de/extra/publications/dssw-erpa-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5515 , year = 2009 } @InProceedings{dssw-hhs-06 , author = DellingD #and# SandersP #and# SchultesD #and# WagnerD , title = {{Highway Hierarchies Star}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}} , month = nov , pdf = "http://i11www.ira.uka.de/extra/publications/dssw-hhs-06.pdf" , url = "http://www.dis.uniroma1.it/~challenge9/papers.shtml" , year = 2006 } @InCollection{dssw-hhs-09 , author = DellingD #and# SandersP #and# SchultesD #and# WagnerD , title = {{Highway Hierarchies Star}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {141--174} , pdf = "http://i11www.ira.uka.de/extra/publications/dssw-hhs-09.pdf" , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @InProceedings{dsw-rsgd-05 , author = DujmovicV #and# SudermanM #and# WoodDR , title = {{Really Straight Graph Drawings}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {122--132} , publisher = pub-springer , series = ser-springer_lncs , volume = 3383 , year = 2005 } @Article{dt-aprad-88 , author = DiBattistaG #and# TamassiaR , title = {{Algorithms for Plane Representations of Acyclic Digraphs}} , journal = j-tcs , number = {2-3} , pages = {175--198} , url = "http://dx.doi.org/10.1016/0304-3975(88)90123-5" , volume = 61 , year = 1988 } @InProceedings{dt-dncsi-10 , author = DerbelB #and# TalbiEG , title = {{Distributed Node Coloring in the SINR Model}} , booktitle = {{Proceedings of the 30th International Conference on Distributed Computing Systems}} , pages = {708--717} , publisher = pub-ics , year = 2010 } @InProceedings{dt-rndau-10 , author = DerbelB #and# TalbiEG , title = {{Radio Network Distributed Algorithms in the Unknown Neighborhood Model}} , booktitle = {{Proceedings of the 11th International Conference on Distributed Computing and Networking }} , pages = {155--166} , publisher = pub-springer , series = ser-springer_lncs , year = 2010 } @Article{dt-tocdf- , author = DinhTN #and# ThaiMT , title = {{Towards Optimal Community Detection: From Trees to General Weighted Networks}} , journal = j-im , note = {accepted pending revision.} } @Article{dtv-osrdp-99 , author = DiBattistaG #and# TamassiaR #and# VismaraL , title = {{Output-Sensitive Reporting of Disjoint Paths}} , journal = j-alg , number = 4 , pages = {302--340} , volume = 23 , year = 1999 } @InProceedings{dv-aptg-93 , author = DiBattistaG #and# VismaraL , title = {{Angles of Planar Triangular Graphs}} , booktitle = {{Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)}} , month = may , pages = {431--437} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=167207&type=pdf&coll=GUIDE&dl=ACM&CFID=25109407&CFTOKEN=9006" , url = "http://doi.acm.org/10.1145/167088.167207" , year = 1993 } @Article{dv-aptg-96 , author = DiBattistaG #and# VismaraL , title = {{Angles of Planar Triangular Graphs}} , journal = j-sidma , number = 3 , pages = {349--359} , url = "http://dx.doi.org/10.1137/S0895480194264010" , volume = 9 , year = 1996 } @Article{dvw-t-96 , author = DeniseA #and# VasconcellosM #and# WelshDJ , title = {{The random planar graph}} , journal = j-congr-num , pages = {61--79} , volume = 113 , year = 1996 } @InProceedings{dvzlp-mlsna-06 , author = DhawanA #and# VuCT #and# ZelikovskyA #and# LiY #and# PrasadSK , title = {{Maximum Lifetime of Sensor Networks with Adjustable Sensing Range}} , booktitle = {{Proceedings of the International Workshop on Self-Assembling Wireless Networks, 2006}} , publisher = pub-ics , year = 2006 } @InProceedings{dw-bbgb-12 , author = DellingD #and# WerneckR , title = {{Better Bounds for Graph Bisection}} , booktitle = {{Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)}} , pages = {407--418} , pdf = "http://i11www.ira.uka.de/extra/publications/dw-bbgb-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 7501 , year = 2012 } @Article{dw-dplp-60 , author = DantzigGB #and# WolfeP , title = {{Decomposition Principle for Linear Programs}} , journal = j-or , month = jan , number = 1 , pages = {101--110} , volume = 8 , year = 1960 } @InProceedings{dw-fcrn-13 , author = DellingD #and# WerneckR , title = {{Faster Customization of Road Networks}} , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}} , pages = {30--42} , publisher = pub-springer , series = ser-springer_lncs , volume = 7933 , year = 2013 } @InProceedings{dw-lbrdg-07 , author = DellingD #and# WagnerD , title = {{Landmark-Based Routing in Dynamic Graphs}} , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}} , month = jun , pages = {52--65} , pdf = "http://i11www.ira.uka.de/extra/publications/dw-lbrdg-07.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/r18l738744xmn68v/?p=c3fb56d3275b4389bd305aef88ad40c8&pi=2" , volume = 4525 , year = 2007 } @InProceedings{dw-pps-09 , author = DellingD #and# WagnerD , title = {{Pareto Paths with SHARC}} , booktitle = {{Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)}} , month = jun , pages = {125--136} , pdf = "http://i11www.ira.uka.de/extra/publications/dw-pps-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5526 , year = 2009 } @InCollection{dw-tdrp-09 , author = DellingD #and# WagnerD , title = {{Time-Dependent Route Planning}} , booktitle = {{Robust and Online Large-Scale Optimization}} , pages = {207--230} , pdf = "http://i11www.ira.uka.de/extra/publications/dw-tdrp-09.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5868 , year = 2009 } @InProceedings{dwn-tita-02 , author = DillenburgJ #and# WolfsonO #and# NelsonPC , title = {{The Intelligent Travel Assistant}} , booktitle = {{ITSS 2002: Proceedings of the 5h International Conference on Intelligent Transportation Systems}} , month = sep , pages = {691--696} , pdf = "http://www.cs.uic.edu/~wolfson/mobile_ps/ita02.pdf" , publisher = pub-ics , year = 2002 } @InProceedings{dynm-atesd-06 , author = DucheneautN #and# YeeN #and# NickellE #and# MooreRJ , title = {{{A}lone {T}ogether?: Exploring the Social Dynamics of Massively Multiplayer Online Games}} , booktitle = {{Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI'06)}} , pages = {407--416} , pdf = "http://doi.acm.org/10.1145/1124772.1124834" , publisher = pub-acm , year = 2006 } @article{dzhhs-la-04 , author = DingCHQ #and# ZhaH #and# HeX #and# HusbandsP #and# SimonHD , title = {{Link Analysis: Hubs and authorities on the World Wide Web}} , journal = j-sr , note = {to appear, published electronically May, 3, 2004} , number = 2 , volume = 46 , year = 2004 } %% -------------------------------------------------------------- @book{e-ac-73 , author = EvenS , title = {{Algorithmic Combinatorics}} , publisher = pub-macmillan , year = 1973 } @article{e-adwcg-75 , author = EvenS , title = {{An algorithm for determining whether the connectivity of a graph is at least $k$}} , journal = j-sicomp , month = sep , number = 3 , pages = {393--396} , volume = 4 , year = 1975 } @article{e-cpm-31 , author = EgervaryE , title = {{On combinatorial properties of matrices}} , journal = "Mat. Lapok" , pages = {16-28} , volume = 38 , year = 1931 } @inproceedings{e-edb-73 , author = EdmondsJ , title = {{Edge-Disjoint Branchings}} , booktitle = {{Courant Computer Science Symposium~9: Combinatorial Algorithms (1972)}} , pages = {91--96} , publisher = {Algorithmics Press} , year = 1973 } @Article{e-eds-58 , author = EulerL , title = {{Elementa doctrinae solidorum}} , journal = j-ncasp , note = {repreinted in Opera Omnia Series I vol 26 p. 71-93} , pages = {109--140} , volume = 4 , year = 1758 } @InProceedings{e-f-94 , author = EppsteinD , title = {{Finding the $k$ shortest paths}} , booktitle = {{Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS'94)}} , pages = {154--165} , year = 1994 } @article{e-fhcoa-00 , author = EppsteinD , title = {{Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs}} , doi = "http://doi.acm.org/10.1145/351827.351829" , journal = j-acm-ea , pages = {1-23} , volume = 5 , year = 2000 } @book{e-ga-79 , author = EvenS , title = {{Graph Algorithms}} , address = "Rockville, Maryland" , publisher = pub-csp , series = "Computer Software En" , year = 1979 } @article{e-gtbpc-82 , author = EverettMG , title = {{Graph theoretic blockings $k$-plexes and $k$-cutpoints}} , journal = j-jms , pages = {75--84} , volume = 9 , year = 1982 } @Article{e-hgd-84 , author = EadesP , title = {{A Heuristic for Graph Drawing}} , journal = j-congr-num , pages = {149--160} , volume = 42 , year = 1984 } @article{e-lbcg-85 , author = EsfahanianAH , title = {{Lower-Bounds on the Connectivities of a Graph}} , journal = j-jgt , number = 4 , pages = {503--511} , volume = 9 , year = 1985 } @misc{e-npefv-05 , author = EppsteinD , title = {{Nineteen Proofs of Euler's Formula: $V-E+F=2$ }} , booktitle = {{The Geometry Junkyard}} , url = "http://www.ics.uci.edu/~eppstein/junkyard/euler/" , year = 2005 } @Article{e-ovbg-83 , author = EbertJ , title = {{$st$-Ordering the Vertices of Biconnected Graphs}} , journal = j-comput , pages = {19--33} , volume = 30 , year = 1983 } @InProceedings{e-rrntq-11 , author = EisenstatD , title = {{Random Road Networks: The Quadtree Model}} , booktitle = {{Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO '11)}} , month = jan , pages = {76--84} , publisher = pub-siam , year = 2011 } @Article{e-s-98 , author = ErtlG , title = {{Shortest path calculation in large road networks}} , journal = j-ors , number = 1 , pages = {15--20} , url = "http://dx.doi.org/10.1007/BF01545524" , volume = 20 , year = 1998 } @Article{e-samfn-64 , author = ElmaghrabySE , title = {{Sensivity Analysis of Multiterminal Flow Networks}} , journal = j-or , number = 5 , pages = {680--688} , volume = 12 , year = 1964 } @Article{e-tgvda-00 , author = ErwigM , title = {{The Graph Voronoi Diagram with Applications}} , journal = j-networks , pages = {156--163} , volume = 36 , year = 2000 } @misc{e-zw-07 , editor = eVB , title = {{Zukunft digitale Wirtschaft}} , pdf = "http://www.bitkom.org/files/documents/Zukunft_digitale_Wirtschaft_BITKOM-Roland_Berger_Studie.pdf" , publisher = pub-r , year = 2007 } @misc{eagg-zzika-08 , editor = eVMK #and# AGDT #and# GmbHTI #and# GmbHEC , title = {{Zukunft \& Zukunftsf{\"a}higkeit der deutschen Informations- und Kommunikationstechnologie. Abschlussbericht der ersten Projektphase}} , month = dec , pdf = "http://www.bmwi.de/BMWi/Redaktion/PDF/Publikationen/Technologie-und-Innovation/studie-zukunftsfaehig" , year = 2008 } @article{eb-aco-98 , author = EverettMG #and# BorgattiSP , title = {{Analyzing clique overlap}} , journal = j-c , number = 1 , pages = {49--61} , volume = 21 , year = 1998 } @incollection{eb-ec-04 , author = EverettMG #and# BorgattiSP , editor = CarringtonPJ #and# ScottJ #and# WassermanS , title = {{Extending Centrality}} , booktitle = {{Models and Methods in Social Network Analysis}} , note = {To appear} , publisher = pub-cup , year = 2005 } @article{eb-pcs-99 , author = EverettMG #and# BorgattiSP , title = {{Peripheries of cohesive subsets}} , journal = j-sn , number = 4 , pages = {397--407} , volume = 21 , year = 1999 } @article{eb-rcg-91 , author = EverettMG #and# BorgattiSP , title = {{Role Colouring a Graph}} , journal = j-mss , pages = {183--188} , volume = 21 , year = 1991 } @article{eb-regt-94 , author = EverettMG #and# BorgattiSP , title = {{Regular Equivalence: General Theory}} , journal = j-jms , number = 1 , pages = {29--52} , volume = 18 , year = 1994 } @InProceedings{ef-ccmda-03 , author = EmanuelD #and# FiatA , title = {{Correlation Clustering -- Minimizing Disagreements on Arbitrary Weighted Graphs}} , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}} , doi = "http://doi.acm.org/10.1007/b13632" , pages = {208--220} , pdf = "http://www.springerlink.com/content/7a59247c5j6x06lf/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/7a59247c5j6x06lf/" , volume = 2832 , year = 2003 } @inproceedings{ef-mvcg-96 , author = EadesP #and# FengQ , title = {{Multilevel Visualization of Clustered Graphs}} , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}} , location = "Berkeley, California, USA" , month = jan , pages = {101--112} , publisher = pub-springer , series = ser-springer_lncs , volume = 1090 , year = 1997 } @InProceedings{ef-srqgt-12 , author = EisnerJ #and# FunkeS , title = {{Sequenced Route Queries: Getting Things done on the way back Home}} , booktitle = {{Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)}} , pages = {502--505} , publisher = pub-acm , year = 2012 } @InProceedings{ef-tnlbr-12 , author = EisnerJ #and# FunkeS , title = {{Transit Nodes -- Lower Bounds and Refined Construction}} , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}} , pages = {141--149} , pdf = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/025.pdf" , publisher = pub-siam , year = 2012 } @InProceedings{efhss-ampt-11 , author = EisnerJ #and# FunkeS #and# HerbstA #and# SpillnerA #and# StorandtS , title = {{Algorithms for Matching and Predicting Trajectories}} , booktitle = {{Proceedings of the 13th Workshop on Algorithm Engineering and Experiments (ALENEX'11)}} , pages = {84--95} , publisher = pub-siam , year = 2011 } @InCollection{efk-ogd-01 , author = EiglspergerM #and# FeketeSP #and# KlauGW , title = {{Orthogonal Graph Drawing}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {121--171} , pdf = "http://springerlink.metapress.com/content/kbnwla90v8vk7rnk/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/kbnwla90v8vk7rnk/" , volume = 2025 , year = 2001 } @article{efs-nmftn-56 , author = EliasP #and# FeinsteinA #and# ShannonCE , title = {{A Note on the Maximum Flow Through a Network}} , journal = j-ire-trans-it , month = dec , number = 4 , pages = {117--119} , volume = 2 , year = 1956 } @InProceedings{efs-orpev-11 , author = EisnerJ #and# FunkeS #and# StorandtS , title = {{Optimal Route Planning for Electric Vehicles in Large Network}} , booktitle = {{Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence}} , month = aug , pdf = "http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/download/3637/4005" , publisher = pub-aaaip , url = "http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3637" , year = 2011 } @article{eg-gpdv-60 , author = ErdoesP #and# GallaiT , title = {{Graphs with Prescribed Degrees of Vertices (in hungarian)}} , journal = "Matematikai Lap" , pages = {264--274} , volume = 11 , year = 1960 } @Book{eg-mcosa-02 , editor = EhrgottM #and# GandibleuxX , title = {{Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys}} , booktitle = {{Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys}} , publisher = pub-kapg , year = 2002 } @InBook{eg-ovjp-02 , author = EichelbergerH #and# GudenbergJW , title = {{On the Visualization of Java Programs}} , booktitle = {{Software Visualization}} , pages = {295--306} , publisher = pub-springer , series = ser-springer_lncs , volume = 2269 , year = 2002 } @InProceedings{eg-s-08 , author = EppsteinD #and# GoodrichMT , title = {{Studying (non-planar) road networks through an algorithmic lens}} , booktitle = {{Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems (GIS '08)}} , pages = {1--10} , publisher = pub-acm , year = 2008 } @Article{egp-trgsi-66 , author = ErdoesP #and# GoodmanA #and# PosaL , title = {{The Representation of a Graph by Set Intersections}} , journal = j-cjm , number = 1 , pages = {106--112} , volume = 18 , year = 1966 } @article{eh-ccgd-84 , author = EsfahanianAH #and# HakimiSL , title = {{On Computing the Connectivities of Graphs and Digraphs}} , journal = j-networks , number = 2 , pages = {355--366} , volume = 14 , year = 1984 } @article{eh-tolbccn-03 , author = EngebretsenL #and# HolmerinJ , title = {{Towards optimal lower bounds for clique and chromatic number}} , journal = j-tcs , number = {1-3} , pages = {537--584} , volume = 299 , year = 2003 } @article{eh-wgads-03 , author = DamERv #and# HaemersW , title = {{Which graphs are determined by their spectrum?}} , journal = j-laa , pages = {241--272} , volume = 373 , year = 2003 } @InProceedings{ehhm-ndvdq-06 , author = ErlebachT #and# HallA #and# HoffmannM #and# MihalakM , title = {{Network Discovery and Verification with Distance Queries}} , booktitle = {{Proceedings of the 6th Conference on Algorithms and Complexity (CIAC'06)}} , month = jun , pages = {69--80} , pdf = "http://www.springerlink.com/content/87g03q2325w04g32/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/87g03q2325w04g32/" , volume = 3998 , year = 2006 } @InProceedings{ehlnsv-scd-13 , author = EppsteinD #and# HoltenD #and# LofflerM #and# NollenburgM #and# SpeckmannB #and# VerbeekK , title = {{Strict Confluent Drawing}} , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , year = 2014 } @Article{ek-hrcln-86 , author = EadesP #and# KellyD , title = {{Heuristics for Reducing Crossings in 2-Layered Networks}} , journal = j-arsc , number = {A} , pages = {89--98} , volume = 21 , year = 1986 } @InProceedings{ek-sepgf-05 , author = ErtenC #and# KobourovSG , title = {{Simultaneous Embedding of Planar Graphs with Few Bends}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {195--205} , publisher = pub-springer , series = ser-springer_lncs , volume = 3383 , year = 2005 } @Article{ek-sepgi-05 , author = ErtenC #and# KobourovSG , title = {{Simultaneous Embedding of a Planar Graph and Its Dual on the Grid}} , journal = j-tocs , month = may , number = 3 , pages = {313--327} , volume = 38 , year = 2005 } @article{ek-tiaenf-72 , author = EdmondsJ #and# KarpRM , title = {{Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems}} , journal = j-acm , month = apr , number = 2 , pages = {248--264} , volume = 19 , year = 1972 } @techreport{ekms-gaaog-11 , author = EffingerP #and# KaufmannM #and# MeinertS #and# StegmaierM , title = {{GraphArchive - An Online Graph Data Store }} , institution = "Wilhelm-Schickard-Institut, Eberhard-Karls-Universit{\"a}t T{\"u}bingen" , number = 3 , pdf = "http://i11www.ira.uka.de/extra/publications/ekms-gaaog-11.pdf" , url = "http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-57549" , year = 2011 } @inproceedings{ekmsw-saamsn-04 , author = EubankS #and# KumarVSA #and# MaratheMV #and# SrinivasanA #and# WangN , title = {{Structural and Algorithmic Aspects of Massive Social Networks}} , booktitle = {{Proceedings of the 15th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'04)}} , pages = {718-727} , year = 2004 } @techreport{el-p-11 , author = EnsorA #and# LilloF , title = {{Partial order approach to compute shortest paths in multimodal networks}} , institution = "http://arxiv.org/abs/1112.3366v1" , year = 2011 } @InProceedings{elmn-odarl-10 , author = EppsteinD #and# LofflerM #and# MumfordE #and# NollenburgM , title = {{Optimal 3D Angular Resolution for Low-Degree Graphs}} , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}} , note = {Full version available at \url{http://arxiv.org/abs/1009.0045}.} , pages = {208--219} , pdf = "http://i11www.ira.uka.de/extra/publications/elmn-odarl-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_19" , volume = 6502 , year = 2011 } @Article{elmn-odarl-13 , author = EppsteinD #and# LofflerM #and# MumfordE #and# NollenburgM , title = {{Optimal 3D Angular Resolution for Low-Degree Graphs}} , journal = j-jgaa , number = 3 , pages = {173--200} , pdf = "http://i11www.ira.uka.de/extra/publications/elmn-odarl-13.pdf" , url = "http://dx.doi.org/10.7155/jgaa.00290" , volume = 17 , year = 2013 } @InProceedings{elms-pmmd-91 , author = LaiW #and# EadesP #and# MisueK #and# SugiyamaK , title = {{Preserving the Mental Map of a Diagram}} , booktitle = {{Proceedings of Compugraphics '91}} , pages = {24--33} , year = 1991 } @Article{els-fehfa-93 , author = EadesP #and# LinX #and# SmythWF , title = {{A Fast and Effective Heuristic for the Feedback Arc Set Problem}} , journal = j-ipl , number = 6 , pages = {319--323} , pdf = "http://www.cas.mcmaster.ca/~bill/fas.ps" , url = "http://dx.doi.org/10.1016/0020-0190(93)90079-O" , volume = 47 , year = 1993 } @inproceedings{em-lbust-03 , author = ElsaesserR #and# MonienB , title = {{Load Balancing of Unit Size Tokens and Expansion Properties of Graphs}} , booktitle = {{Proceedings of the 15th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'03)}} , pages = {266--273} , year = 2003 } @Article{emmps-fm-10 , author = EFClementiA #and# MacciC #and# MontiA #and# PasqualeF #and# SilvestriR , title = {{Flooding time in edge-Markovian dynamic graphs}} , journal = j-sidma , number = 4 , pages = {1694--1712} , url = "http://epubs.siam.org/doi/abs/10.1137/090756053" , volume = 24 , year = 2010 } @Article{ems-aocta-12 , author = ElmasryA #and# MehlhornK #and# SchmidtJM , title = {{An {$\mathcal{O}(n+ m)$} Certifying Triconnnectivity Algorithm for Hamiltonian Graphs}} , journal = j-alg , pages = {754--766} , volume = 62 , year = 2012 } @InProceedings{enrs-fagpa-97 , author = EvenG #and# NaorJ #and# RaoF #and# SchieberB , title = {{Fast Approximate Graph Partitioning Algorithms}} , booktitle = {{Proceedings of the 8th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'97)}} , pages = {639--648} , publisher = pub-ieeecs , url = "http://portal.acm.org/citation.cfm?id=314161.314405" , year = 1997 } @Article{er-a-94 , author = EngelsmanEC #and# RaanAF , title = {{A patent-based cartography of technology }} , journal = j-rp , month = jan , number = 1 , pages = {1--26} , url = "http://dx.doi.org/10.1016/0048-7333(94)90024-8" , volume = 23 , year = 1994 } @Article{er-gp-93 , author = ErdoesP #and# RichmondLB , title = {{On Graphical Partitions}} , journal = j-comb , month = mar , number = 1 , pages = {57--63} , pdf = "http://www.springerlink.com/content/q640413118505j22/fulltext.pdf" , url = "http://www.springerlink.com/content/q640413118505j22/" , volume = 13 , year = 1993 } @Article{er-i-93 , author = EngelsmanEC #and# RaanAF , title = {{International comparison of technological activities and specializations: a patent-based monitoring system}} , journal = j-tasm , number = 2 , pages = {113--136 } , url = "http://www.informaworld.com/smpp/content~db=all~content=a779923576" , volume = 5 , year = 1993 } @article{er-rg-59 , author = ErdoesP #and# RenyiA , title = {{On Random Graphs~I}} , journal = j-pmd , pages = {290--297} , volume = 6 , year = 1959 } @Article{ers-hvc-05 , author = EvenG #and# RawitzD #and# ShaharS , title = {{Hitting sets when the VC-dimension is small}} , journal = j-ipl , number = 2 , pages = {358--362} , volume = 95 , year = 2005 } @Article{es-hddg-90 , author = EadesP #and# SugiyamaK , title = {{How to Draw a Directed Graph}} , journal = j-jip , number = 4 , pages = {424--437} , volume = 13 , year = 1990 } @unpublished{esd-scrnao-04 , author = EverettMG #and# SinclairP #and# DankelmannP , title = {{Some Centrality Results New and Old}} , note = {Submitted} , year = 2004 } @InProceedings{esk-atsma-03 , author = EiglspergerM #and# SiebenhallerM #and# KaufmannM , title = {{A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram}} , booktitle = {{Proceedings ACM 2003 Symposium on Software Visualization (SOFTVIS'03)}} , month = jun , pages = {189--198} , publisher = pub-acm , year = 2003 } @Article{et-ap-76 , author = EswaranKP #and# TarjanRE , title = {{Augmentation Problems}} , journal = j-sicomp , month = dec , number = 4 , volume = 5 , year = 1976 } @Article{et-ccn-77 , author = EvenS #and# TarjanRE , title = {{Corrigendum: Computing an $st$-Numbering}} , journal = j-tcs , number = 1 , pages = 123 , volume = 4 , year = 1977 } @Article{et-cn-76 , author = EvenS #and# TarjanRE , title = {{Computing an $st$-Numbering}} , journal = j-tcs , month = sep , number = 3 , pages = {339--344} , volume = 2 , year = 1976 } @article{et-nftgc-75 , author = EvenS #and# TarjanRE , title = {{Network Flow and Testing Graph Connectivity}} , journal = j-sicomp , month = dec , number = 4 , pages = {507--518} , volume = 4 , year = 1975 } @InProceedings{etp-ccrsp-12 , author = EfentakisA #and# TheodorakisD #and# PfoserD , title = {{Crowdsourcing Computing Resources for Shortest-Path Computation}} , booktitle = {{Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)}} , pages = {434--437} , publisher = pub-acm , year = 2012 } @techreport{evh-sait-01 , author = ErlebachT #and# VukadinovicD #and# HuangP , title = {{A Spectral Analysis of the Internet Topology}} , institution = "Eidgen{\"o}ssische Technische Hochschule Z{\"u}rich (ETH)" , pdf = "http://e-collection.ethbib.ethz.ch/eserv/eth:24444/eth-24444-01.pdf" , url = "http://e-collection.ethbib.ethz.ch/view/eth:24444" } @Article{ew-ecdbg-94 , author = EadesP #and# WormaldN , title = {{Edge Crossings in Drawings of Bipartite Graphs}} , journal = j-alg , month = apr , number = 4 , volume = 11 , year = 1994 } @inproceedings{ew-fac-01 , author = EppsteinD #and# WangJ , title = {{Fast Approximation of Centrality}} , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}} , year = 2001 } @Article{ew-felgd-90 , author = EadesP #and# WormaldN , title = {{Fixed Edge-Length Graph Drawing is NP-hard}} , journal = j-dam , number = 2 , pages = {111--134} , url = "http://dx.doi.org/10.1016/0166-218X(90)90110-X" , volume = 28 , year = 1990 } @InProceedings{ew-hdcwc-86 , author = El-HamdouchiA #and# WillettP , title = {{Hierarchic Document Classification using Ward's Clustering Method}} , booktitle = {{Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval}} , pages = {149--156} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=253200&type=pdf&coll=GUIDE&dl=GUIDE&CFID=18706479&CFTOKEN=10" , publisher = pub-acm , url = "http://doi.acm.org/10.1145/253168.253200" , year = 1986 } @InProceedings{ex-hddg-98 , author = EadesP #and# XueminL , title = {{How to Draw a Directed Graph}} , booktitle = {{IEEE Workshop on Visual Languages}} , pages = {13--17} , pdf = "http://ieeexplore.ieee.org/iel2/266/2565/00077035.pdf?tp=&isnumber=&arnumber=77035" , publisher = pub-ieeecs , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=77035" , year = 1998 } %% -------------------------------------------------------------- @Article{f-aavpc-67 , author = FrischIT , title = {{An Algorithm for Vertex-Pair Connectivity}} , journal = j-ijc , number = 6 , pages = {579--593} , volume = 6 , year = 1967 } @article{f-acg-73 , author = FiedlerM , title = {{Algebraic connectivity of graphs}} , journal = j-cmj , number = 98 , pages = {289--305} , volume = 23 , year = 1973 } @inproceedings{f-adsdec-91 , author = FredericksonGN , title = {{Ambivalent Data Structures for Dynamic $2$-Edge-connectivity and $k$ Smallest Spanning Trees}} , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}} , month = oct , pages = {632--641} , year = 1991 } @Article{f-agpas-98 , author = FjallstromP , title = {{Algorithms for Graph Partitioning: A Survey}} , journal = j-eacis , month = sep , number = 10 , pages = {1--34} , url = "http://www.ep.liu.se/ea/cis/1998/010/" , volume = 3 , year = 1998 } @InProceedings{f-albar-08 , author = FratiF , title = {{A Lower Bound on the Area Requirements of Series-Parallel Graphs}} , booktitle = {{Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'08)}} , pages = {159--170} , publisher = pub-springer , series = ser-springer_lncs , volume = 5344 , year = 2008 } @techreport{f-arwca-99 , author = FasuloD , title = {{An Analysis of Recent Work on Clustering Algorithm}} , address = "Box 352350, University of Washington, Seattle WA 98195" , institution = "Department of Computer Science \& Engineering" , month = apr , number = {01-03-02} , year = 1999 } @article{f-asp-62 , author = FloydRW , title = {{Algorithm 97: Shortest path}} , journal = j-comm-acm , number = 6 , pages = 345 , volume = 5 , year = 1962 } @mastersthesis{f-astca-12 , author = FuchsF , title = {{Analysis of Scheduling and Topology-Control Algorithms for Wireless Ad Hoc Networks}} , pdf = "http://i11www.ira.uka.de/extra/publications/f-astca-12.pdf" , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie" , year = 2012 } @article{f-bcacroamc-99 , author = FleischerL , title = {{Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time}} , journal = j-jalg , month = oct , number = 1 , pages = {51--72} , volume = 33 , year = 1999 } @Article{f-c-09 , author = FortunatoS , title = {{Community detection in graphs}} , journal = j-pr , number = {3--5} , pages = {75--174} , url = "http://www.sciencedirect.com/science/journal/03701573" , volume = 486 , year = 2010 } @Article{f-cdpgo-01 , author = FelsnerS , title = {{Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes}} , journal = j-order , number = 1 , pages = {19--37} , volume = 18 , year = 2001 } @article{f-cmpa-88 , author = FaustK , title = {{Comparison of Methods for Positional Analysis: {Structural} and General Equivalences}} , journal = j-sn , pages = {313--341} , volume = 10 , year = 1988 } @article{f-csn-79 , author = FreemanLC , title = {{Centrality in Social Networks: Conceptual Clarification~I}} , journal = j-sn , pages = {215--239} , volume = 1 , year = 1979 } @book{f-dsna-04 , author = FreemanLC , title = {{The Development of Social Network Analysis: A Study in the Sociology of Science}} , publisher = pub-bsp , year = 2004 } @book{f-fm-51 , author = FerrarWL , title = {{Finite Matrices}} , address = "London" , publisher = pub-oup , year = 1951 } @Article{f-gepg-03 , author = FelsnerS , title = {{Geodesic Embeddings and Planar Graphs}} , journal = j-order , number = 2 , pages = {135--150} , volume = 20 , year = 2003 } @Book{f-gga-04 , author = FelsnerS , title = {{Geometric Graphs and Arrangements}} , booktitle = {{Geometric Graphs and Arrangements}} , publisher = pub-v , year = 2004 } @techreport{f-gip-96 , author = FortinS , title = {{The Graph Isomorphism Problem}} , institution = "University of Alberta, Edmonton, Canada" , number = {96-20} , url = "ftp://ftp.cs.ualberta.ca/pub/TechReports/1996/TR96-20/TR96-20.ps.gz" , year = 1996 } @misc{f-ibs-05 , author = FusyE , title = {{Implementation of a Boltzman Sampler for planar graphs}} , url = "http://www.lix.polytechnique.fr/~fusy/Programs/BoltzmannPlanarGraphs.tar.gz" , year = 2005 } @article{f-ieabe-89 , author = FernandezJC , title = {{An Implementation of an Efficient Algorithm for Bisimulation Equivalence}} , journal = "Science of Comp" , number = 1 , pages = {219--236} , volume = 13 , year = 1989 } @Article{f-lspg-04 , author = FelsnerS , title = {{Lattice Structure from Planar Graphs}} , journal = j-ecomb , number = 1 , volume = 11 , year = 2004 } @Article{f-ltafc-84 , author = FredericksonGN , title = {{On linear-time algorithms for five-coloring planar graphs}} , journal = j-ipl , number = 5 , pages = {219--224} , volume = 19 , year = 1984 } @misc{f-mss-07 , author = FreidingerM , title = {{Minimale Schnitte und Schnittb{\"a}ume}} , institution = uni_ka , month = feb , note = {Student Project, Studienarbeit} , pdf = "http://i11www.ira.uka.de/extra/publications/f-mss-07.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished" , year = 2007 } @article{f-nbcspp-76 , author = FredmanML , title = {{New bounds on the complexity of the shortest path problem.}} , journal = j-sicomp , pages = {49--60} , volume = 5 , year = 1975 } @techreport{f-nft-56 , author = FordLR , title = {{Network Flow Theory}} , institution = "Rand Corporation, Santa Monica, California" , number = {P-923} , year = 1956 } @Article{f-ooplm-03 , author = FloaterMS , title = {{One-to-One Piecewise Linear Mappings Over Triangulations}} , journal = j-mc , number = 241 , pages = {685--696} , volume = 72 , year = 2003 } @misc{f-opalt-10 , author = FuchsF , title = {{On Preprocessing the ALT-Algorithm}} , note = {Student's thesis - Karlsruhe Institute of Technology - ITI Wagner} , school = "Karlsruhe Institute of Technology - ITI Wagner" , year = 2010 } @Article{f-osrpg-48 , author = FaryI , title = {{On Straight line Representation of Planar Graphs}} , journal = j-asms , number = 4 , pages = {229--233} , volume = 11 , year = 1946 } @article{f-pensm-73 , author = FiedlerM , title = {{A Property of Eigenvectors of Nonnegative Symmetric matrices and its Applications to Graph Theory}} , journal = j-cmj , number = 100 , pages = {619-633} , volume = 25 , year = 1975 } @article{f-pensm-75 , author = FiedlerM , title = {{A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory}} , journal = j-cmj , pages = {619--633} , volume = 1 , year = 1975 } @phdthesis{f-rpacn-04 , author = FlinsenbergIC , title = {{Route Planning Algorithms for Car Navigation}} , school = "Technische Universiteit Eindhoven" , year = 2004 } @article{f-scees-84 , author = FriedkinNE , title = {{Structural Cohesion and Equivalence Explanations of Social Homogeneity}} , journal = j-smr , pages = {235--261} , volume = 12 , year = 1984 } @Article{f-smcbb-77 , author = FreemanLC , title = {{A Set of Measures of Centrality Based Upon Betweeness}} , journal = j-socm , pages = {35--41} , pdf = "http://moreno.ss.uci.edu/23.pdf" , volume = 40 , year = 1977 } @phdthesis{f-taal-07 , author = FleischerD , title = {{Theory and Applications of the Laplacian}} , month = sep , school = "Department of Computer \& Information Science, University of Konstanz" , year = 2007 } @phdthesis{f-tal-07 , author = FleischerD , title = {{Theory and Applications of the Laplacian}} , url = "http://www.ub.uni-konstanz.de/kops/volltexte/2008/4625" , year = 2007 } @phdthesis{f-tsema-08 , author = FlotterodG , title = {{Traffic State Estimation with Multi-Agent Simulations}} , school = "Technische Universi{\"a}t Berlin" , url = "http://opus.kobv.de/tuberlin/volltexte/2008/1980/" , year = 2008 } @Article{f-u-09 , author = FusyE , title = {{Uniform random sampling of planar graphs in linear time}} , journal = j-rsa , month = dec , number = 4 , pages = {464--522} , volume = 35 , year = 2009 } @Article{f-vsn-00 , author = FreemanLC , title = {{Visualizing Social Networks}} , journal = j-ss , number = 1 , pdf = "http://www.cmu.edu/joss/content/articles/volume1/Freeman.pdf" , url = "http://www.cmu.edu/joss/content/articles/volume1/Freeman.html" , volume = 1 , year = 2000 } @Article{fa-afdom-04 , author = FarinaM #and# AmatoP , title = {{A Fuzzy Definition of ``Optimality'' for Many-Criteria Optimization Problems}} , journal = j-ieeetsmcpa , number = 3 , pages = {315--326} , volume = 34 , year = 2004 } @InProceedings{fak-srdcg-09 , author = FratiF #and# AngeliniP #and# KaufmannM , title = {{Straight-line Rectangular Drawings of Clustered Graphs}} , booktitle = {{Algorithms and Data Structures, 11th International Symposium (WADS'09)}} , month = aug , pages = {25--36} , pdf = "http://www.springerlink.com/content/b6p3597671888883/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/b6p3597671888883/" , volume = 5664 , year = 2009 } @article{fbw-cvg-91 , author = FreemanLC #and# BorgattiSP #and# WhiteDR , title = {{Centrality in valued graphs: A measure of betweenness based on network flow}} , journal = j-sn , number = 2 , pages = {141--154} , volume = 13 , year = 1991 } @InCollection{fc-csg-09 , author = FortunatoS #and# CastellanoC , title = {{Community Structure in Graphs}} , booktitle = {{Encyclopedia of Complexity and Systems Science}} , month = apr , publisher = pub-springer , url = "http://www.springer.com/physics/book/978-0-387-75888-6" , year = 2009 } @article{fd-cmfn-55 , author = FulkersonDR #and# DantzigGB , title = {{Computation of Maximal Flows in Networks}} , journal = j-nrlq , pages = {277-283} , volume = 2 , year = 1955 } @article{fdb-oab-96 , author = FerligojA #and# DoreianP #and# BatageljV , title = {{Optimizational Approach to Blockmodeling}} , journal = j-jcit , pages = {63--90} , volume = 4 , year = 1996 } @article{fdbv-srwg-01 , author = FarkasI #and# DerenyiI #and# BarabasiAL #and# VicsekT , title = {{Spectra of ``real-world'' graphs: {Beyond} the semicircle law}} , journal = j-phre , month = aug , url = "http://arXiv.org/abs/cond-mat/0102335" , volume = 64 , year = 2001 } @InProceedings{ff-crpgc-11 , author = FelsnerS #and# FrancisMC , title = {{Contact Representations of Planar Graphs with Cubes}} , booktitle = {{Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11)}} , pages = {315--320} , publisher = pub-acm , year = 2011 } @book{ff-fn-62 , author = FordLR #and# FulkersonDR , title = {{Flows in Networks}} , publisher = pub-pup , year = 1962 } @article{ff-mftn-56 , author = FordLR #and# FulkersonDR , title = {{Maximal flow through a network}} , journal = j-cjm , pages = {399--404} , volume = 8 , year = 1956 } @article{ff-safmnf-57 , author = FordLR #and# FulkersonDR , title = {{A simple algorithm for finding maximal network flows and an application to the Hitchcock problem}} , journal = j-cjm , pages = {210--218} , volume = 9 , year = 1957 } @inproceedings{fff-plrit-99 , author = FaloutsosM #and# FaloutsosP #and# FaloutsosC , title = {{On power-law relationships of the {Internet} topology}} , booktitle = {{SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication}} , doi = "http://doi.acm.org/10.1145/316188.316229" , isbn = "1-58113-135-6" , pages = {251--262} , publisher = pub-acm , year = 1999 } @article{fg-cfpcds-04 , author = EisenbrandF #and# GrandoniF , title = {{On the complexity of fixed parameter clique and dominating set}} , journal = j-tcs , number = {1--3} , pages = {57--67} , volume = 326 , year = 2004 } @Article{fg-imig-65 , author = FulkersonDR #and# GrossOA , title = {{Incidence Matrices and Interval Graphs}} , journal = j-pjm , number = 3 , pages = {835--855} , volume = 15 , year = 1965 } @Book{fg-mcdmt-79 , editor = FandelG #and# GalT , title = {{Multiple Criteria Decision Making -- Theory and Application --}} , booktitle = {{Multiple Criteria Decision Making -- Theory and Application --}} , publisher = pub-springer , year = 1979 } @article{fh-edb-76 , author = FulkersonDR #and# HardingGC , title = {{On Edge-Disjoint Branchings}} , journal = j-networks , number = 2 , pages = {97--104} , volume = 6 , year = 1976 } @InCollection{fh-gdia-01 , author = FleischerR #and# HirschC , title = {{Graph Drawing and Its Applications}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {1--22} , pdf = "http://springerlink.metapress.com/content/fqbuv7dec70dhcx9/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/fqbuv7dec70dhcx9/" , volume = 2025 , year = 2001 } @InProceedings{fhhklsww-dgphr-90 , author = FormannM #and# HagerupT #and# HaralambidesJ #and# KaufmannM #and# LeightonFT #and# SymvonisA #and# WelzlE #and# WoegingerGJ , title = {{Drawing Graphs in the Plane with High Resolution}} , booktitle = {{Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90)}} , month = oct , pages = {86--95} , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=89527" , year = 1990 } @InProceedings{fhkm-cgpp-99 , author = FederT #and# HellP #and# KleinS #and# MotwaniR , title = {{Complexity of Graph Partition Problems}} , booktitle = {{Proceedings of the 31st Annual {ACM} Symposium on the Theory of Computing (STOC'99)}} , pages = {464--472} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=301373&type=pdf&coll=GUIDE&dl=GUIDE&CFID=77555843&CFTOKEN=95" , publisher = pub-acm , url = "http://doi.acm.org/10.1145/301250.301373" , year = 1999 } @InProceedings{fhkr-owpas-92 , author = FurerM #and# HeXi #and# KaoM #and# RaghavachariB , title = {{$\mathcal{O}(n \log \log n)$-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs}} , booktitle = {{Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'92)}} , pages = {410--419} , publisher = pub-acm , year = 1992 } @InProceedings{fhnrsw-dmmbc-12 , author = FinkM #and# HaverkortH #and# NollenburgM #and# RobertsM #and# SchuhmannJ #and# WolffA , title = {{Drawing Metro Maps using B{\'e}zier Curves}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , pages = {463--474} , pdf = "http://i11www.ira.uka.de/extra/publications/fhnrsw-dmmbc-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.do.org/10.1007/978-3-642-36763-2_41" , volume = 7704 , year = 2013 } @article{fhns-rirg-02 , author = FlajoletP #and# HatzisKP #and# NikoletseasS #and# SpirakisP , title = {{On the Robustness of Interconnections in Random Graphs: A Symbolic Approach}} , journal = j-tcs , month = sep , number = 2 , pages = {515--534} , volume = 287 , year = 2002 } @InProceedings{fhs-octds-11 , author = FoschiniL #and# HershbergerJ #and# SuriSu , title = {{On the Complexity of Time-Dependent Shortest Paths}} , booktitle = {{Proceedings of the 22nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'11)}} , pages = {327--341} , publisher = pub-siam , year = 2011 } @InProceedings{fi-accel-65 , author = FiskCJ #and# IsettDD , title = {{{``ACCEL''} Automated Circuit Card Etching Layout}} , booktitle = {{Proceedings of the SHARE design automation project (DAC'65)}} , pages = {9.1--9.31} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=810762&type=pdf&coll=GUIDE&dl=GUIDE&CFID=37659938&CFTOKEN=52" , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=810762" , year = 1965 } @Article{finp-eadas-98 , author = FrigioniD #and# IoffredaM #and# NanniU #and# PasqualoneG , title = {{Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem}} , journal = j-acm-ea , number = 5 , pages = {1--20} , volume = 3 , year = 1998 } @article{fk-ersm-81 , author = FuerediZ #and# KomlosJ , title = {{The eigenvalues of random symmetric matrices}} , journal = j-comb , number = 3 , pages = {233--241} , volume = 1 , year = 1981 } @article{fk-fclhcsg-00 , author = FeigeU #and# KrauthgamerR , title = {{Finding and Certifying a large hidden clique in a semirandom graph}} , journal = j-rsa , number = 2 , pages = {195--208} , volume = 16 , year = 2000 } @Article{fk-pamb-02 , author = FeigeU #and# KrauthgamerR , title = {{A Polylogarithmic Approximation of the Minimum Bisection}} , journal = j-sicomp , number = 4 , pages = {1090--1118} , volume = 31 , year = 2002 } @InProceedings{fkk-vdpg-97 , author = FossmeierU #and# KantG #and# KaufmannM , title = {{$2$-Visibility Drawings of Planar Graphs}} , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}} , location = "Berkeley, California, USA" , month = jan , pages = {155--168} , publisher = pub-springer , series = ser-springer_lncs , volume = 1090 , year = 1997 } @article{fkp-dksp-01 , author = FeigeU #and# KortsarzG #and# PelegD , title = {{The dense $k$-subgraph problem}} , journal = j-alg , number = 3 , pages = {410--421} , volume = 29 , year = 2001 } @inproceedings{fkp-hot-02 , author = FabrikantA #and# KoutsoupiasE #and# PapadimitriouCH , title = {{Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the {Internet}}} , booktitle = {{Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'02)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 2380 , year = 2002 } @book{fkpt-swd-01 , author = FahrmeirL #and# KuenstlerR #and# PigeotI #and# TutzG , title = {{Statistik, Der Weg zur Datenanalyse}} , isbn = "3-540-67826-3" , publisher = pub-springer , year = 2001 } @Article{fkrw-tcpop-00 , author = FelsnerS #and# KantR #and# RanganCP #and# WagnerD , title = {{The Complexity of Partial Order Properties}} , journal = j-order , number = 2 , pages = {179--193} , volume = 17 , year = 2000 } @InProceedings{flg-eiwc-00 , author = FlakeGW #and# LawrenceS #and# GilesCL , title = {{Efficient Identification of Web Communities}} , booktitle = {{Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and Data Mining}} , pages = {150--160} , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=347121" , year = 2000 } @Article{flgc-soiwc-02 , author = FlakeGW #and# LawrenceS #and# GilesCL #and# CoetzeeFM , title = {{Self-Organization and Identification of Web Communities}} , journal = j-ieeec , number = 3 , pages = {66--71} , pdf = "http://privacy.cs.cmu.edu/dataprivacy/papers/socialnetworks/27.pdf" , url = "http://doi.ieeecomputersociety.org/10.1109/2.989932" , volume = 35 , year = 2002 } @unpublished{fll-semeplbec-04 , author = FennerT #and# LeveneM #and# LoizouG , title = {{A Stochastic Evolutionary Model Exhibiting Power-Law Behaviour with an Exponential Cutoff}} , month = jun , note = {http://xxx.sissa.it/ps/cond-mat/0209463} , year = 2004 } @InProceedings{flm-falau-95 , author = FrickAK #and# LudwigA #and# MehldauH , title = {{A Fast Adaptive Layout Algorithm for Undirected Graphs}} , booktitle = {{DIAMCS International Workshop}} , location = "Princeton, New Jersey, USE" , month = jan , pages = {388--403} , publisher = pub-springer , series = ser-springer_lncs , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/268794" , volume = 894 , year = 1995 } @unpublished{flr-nbcd-08 , author = FortunatoS #and# LancichinettiA #and# RadicchiF , title = {{New Benchmark in Community Detection}} , note = {arxiv.org/abs/0805.4770} , pdf = "http://arxiv.org/pdf/0805.4770v3" , url = "http://arxiv.org/abs/0805.4770" , year = 2008 } @Article{flzwd-a-07 , author = FanY #and# LiM #and# ZhangP #and# WuJ #and# DiZ , title = {{Accuracy and precision of methods for community identification in weighted networks}} , journal = j-physa , number = 1 , pages = {363--372} , url = "http://www.sciencedirect.com/science/article/pii/S0378437106012386" , volume = 377 , year = 2007 } @InProceedings{fm-a-82 , author = FiducciaCM #and# MattheysesRM , title = {{A linear-time heuristic for improving network partitions}} , booktitle = {{Proceedings of the 19th ACM/IEEE Conference on Design Automation}} , pages = {175--181} , url = "http://portal.acm.org/citation.cfm?id=800263.809204" , year = 1982 } @InProceedings{fm-anaap-98 , author = FialkoS #and# MutzelP , title = {{A New Approximation Algorithm for the Planar Augmentation Problem}} , booktitle = {{Proceedings of the 9th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'98)}} , pages = {260--269} , publisher = pub-siam , year = 1998 } @Article{fm-otao-01 , author = deFraysseixH #and# MendezPO , title = {{On Topological Aspects of Orientations}} , journal = j-dima , month = feb , number = {1--3} , pages = {57--72} , volume = 229 , year = 2001 } @article{fm-pcadba-85 , author = FlajoletP #and# MartinGN , title = {{Probabilistic Counting Algorithms for Data Base Applications}} , journal = j-css , number = 2 , pages = {182--209} , url = "citeseer.ist.psu.edu/flajolet85probabilistic.html" , volume = 31 , year = 1985 } @InProceedings{fm-roaa-95 , author = deFraysseixH #and# MendezPO , title = {{Regular Orientations, Arboricity, and Augmentation}} , booktitle = {{DIAMCS International Workshop}} , location = "Princeton, New Jersey, USE" , month = jan , pages = {111--118} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/pt8051p2070j/" , volume = 894 , year = 1995 } @Article{fmn-f-00 , author = FrigioniD #and# MarchettiSpaccamelaA #and# NanniU , title = {{Fully Dynamic Algorithms for Maintaining Shortest Paths trees}} , journal = j-jalg , month = feb , number = 2 , pages = {251--281} , volume = 34 , year = 2000 } @Article{fmn-f-03 , author = FrigioniD #and# MarchettiSpaccamelaA #and# NanniU , title = {{Fully dynamic shortest paths in digraphs with arbitrary arc weights}} , journal = j-jalg , month = oct , number = 1 , pages = {86--113} , volume = 49 , year = 2003 } @InProceedings{fmps-sscsp-13 , author = Fox-EpsteinE #and# MozesS #and# PhothilimthanaPM #and# SommerC , title = {{Short and Simple Cycle Separators in Planar Graphs}} , booktitle = {{Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX'13)}} , pages = {26--40} , publisher = pub-siam , year = 2013 } @Article{fmr-dspus-62 , author = FunCT #and# MullerME #and# RezuchaI , title = {{Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital-Computers}} , journal = j-jasa , number = 298 , pages = {387--402} , url = "http://www.jstor.org/stable/2281647" , volume = 57 , year = 1962 } @Book{fms-eafad-02 , editor = FleischerR #and# MoretB #and# SchmidtEM , title = {{Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software}} , booktitle = {{Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software}} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/0lfn7tr4lbbc/" , volume = 2547 , year = 2002 } @book{fmw-fll-92 , editor = FrancisRL #and# McGinnisLF #and# WhiteJA , title = {{Facility Layout and Location: An Analytical Approach}} , booktitle = {{Facility Layout and Location: An Analytical Approach}} , publisher = pub-ph , year = 1992 } @inproceedings{fp-ccrap-03 , author = FialaJ #and# PaulusmaD , title = {{The Computational Complexity of the Role Assignment Problem}} , booktitle = {{Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'03)}} , pages = {817--828} , publisher = pub-springer , series = ser-springer_lncs , year = 2003 } @Article{fpp-hdpgg-90 , author = deFraysseixH #and# PachJ #and# PollackR , title = {{How to Draw a Planar Graph on a Grid}} , journal = j-comb , number = 1 , pages = {41--51} , volume = 10 , year = 1990 } @InProceedings{fpp-sssfe-88 , author = deFraysseixH #and# PachJ #and# PollackR , title = {{Small Sets Supporting {F}{\'a}ry Embeddings of Planar Graphs}} , booktitle = {{Proceedings of the 20th Annual {ACM} Symposium on the Theory of Computing (STOC'88)}} , pages = {426--433} , publisher = pub-acm , year = 1988 } @Article{fr-gdfdp-91 , author = FruchtermanTMJ #and# ReingoldEM , title = {{Graph Drawing by Force-Directed Placement}} , address = "New York, NY, USA" , isbn = "0038-0644" , journal = j-spe , month = nov , number = 11 , pages = {1129--1164} , pdf = "http://cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol21/issue11/spe060tf.pdf" , publisher = pub-wileys , volume = 21 , year = 1991 } @Article{fr-pgnwe-06 , author = FakcharoenpholJ #and# RaoS , title = {{Planar Graphs, Negative Weight Edges, Shortest Paths, and near Linear Time}} , journal = j-css , number = 5 , pages = {868--889} , url = "http://dx.doi.org/10.1016/j.jcss.2005.05.007" , volume = 72 , year = 2006 } @InProceedings{frw-clmpg-09 , author = FrankeR #and# RutterI #and# WagnerD , title = {{Computing Large Matchings in Planar Graphs with Fixed Minimum Degree}} , booktitle = {{Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09)}} , pages = {872--881} , publisher = pub-springer , series = ser-springer_lncs , volume = 5878 , year = 2009 } @Article{frw-clmpg-10 , author = FrankeR #and# RutterI #and# WagnerD , title = {{Computing Large Matchings in Planar Graphs with Fixed Minimum Degree}} , journal = j-tcs , number = 32 , pages = {4092--4099} , url = "http://dx.doi.org/10.1016/j.tcs.2010.06.012" , volume = 412 , year = 2010 } @techreport{frw-clmpg-tr09 , author = FrankeR #and# RutterI #and# WagnerD , title = {{Computing Large Matchings in Planar Graphs with Fixed Minimum Degree}} , institution = iti_wagner , number = {2009-18} , pdf = "http://i11www.ira.uka.de/extra/publications/frw-clmpg-tr09.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000012970" , year = 2009 } @techreport{fs-dksp-97 , author = FeigeU #and# SeltserMA , title = {{On the densest $k$-subgraph problem}} , institution = "Department of Applied Mathematics and Computer Science, The Weizmann Institute of Scien" , number = {CS97-16} , year = 1997 } @article{fs-lman-99 , author = FaustK #and# SkvoretzJ , title = {{Logit Models for Affiliation Networks}} , journal = j-sm , number = 1 , pages = {253--280} , volume = 29 , year = 1999 } @article{fs-mg-86 , author = FrankO #and# StraussD , title = {{Markov Graphs}} , journal = j-jasa , pages = {832--842} , volume = 81 , year = 1986 } @InProceedings{fs-pcchm-13 , author = FunkeS #and# StorandtS , title = {{Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives}} , booktitle = {{Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX'13)}} , pages = {31--54} , publisher = pub-siam , year = 2013 } @InProceedings{fs-psaam-11 , author = FunkeS #and# StorandtS , title = {{Path Shapes: An Alternative Method for Map Matching and Fully Autonomous Self-Localization}} , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}} , pages = {319--328} , publisher = pub-acm , year = 2011 } @techreport{fs-wsm-10 , title = {{Walk Score Methodology}} , institution = "Front Seat Software" , pdf = "http://blog.walkscore.com/wp-content/uploads/2010/12/WalkScoreMethodology.pdf" , url = "http://blog.walkscore.com/wp-content/uploads/2010/12/WalkScoreMethodology.pdf" , year = 2010 } @Article{fsp-dotao-08 , author = FusyE #and# SchaefferG #and# PoulalhonD , title = {{Dissections, Orientations, and Trees with Applications to Optimal Mesh Encoding and Random Sampling.}} , journal = j-acmta , month = may , number = 2 , volume = 4 , year = 2008 } @Article{fsr-hspatasa-06 , author = FuL #and# SunD #and# RilettLR , title = {{Heuristic shortest path algorithms for transportation applications: State of the art }} , journal = j-copr , number = 11 , pages = {3324--3343} , volume = 33 , year = 2006 } @Article{fsr-oi-12 , author = FrankS #and# SteponaviceI #and# RebennackS , title = {{Optimal power flow: a bibliographic survey I}} , journal = j-es , month = sep , number = 3 , pages = {221--258} , url = "http://link.springer.com/journal/12667/3/3/page/1" , volume = 3 , year = 2012 } @Article{fsr-oii-12 , author = FrankS #and# SteponaviceI #and# RebennackS , title = {{Optimal power flow: a bibliographic survey II}} , journal = j-es , month = sep , number = 3 , pages = {259--289} , url = "http://link.springer.com/journal/12667/3/3/page/1" , volume = 3 , year = 2012 } @Article{ft-fhtui-87 , author = FredmanML #and# TarjanRE , title = {{Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms}} , journal = j-acm , month = jul , number = 3 , pages = {596--615} , volume = 34 , year = 1987 } @Article{ft-ppg-05 , author = FelsnerS #and# TrotterWT , title = {{Posets and Planar Graphs}} , journal = j-jgt , month = aug , number = 4 , pages = {273--284} , volume = 49 , year = 2005 } @Article{ftt-gcmct-04 , author = FlakeGW #and# TarjanRE #and# TsioutsiouliklisK , title = {{Graph Clustering and Minimum Cut Trees}} , journal = j-im , number = 4 , pages = {385--408} , pdf = "http://www.internetmathematics.org/volumes/1/4/Flake.pdf" , url = "http://www.internetmathematics.org/volumes/1.htm" , volume = 1 , year = 2004 } @InProceedings{fvw-satca-12 , author = FuchsF #and# VolkerM #and# WagnerD , title = {{Simulation-based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks}} , booktitle = {{Proceedings of the 1st Mediterranean Conference on Algorithms}} , pages = {188--202} , pdf = "http://i11www.ira.uka.de/extra/publications/fvw-satca-12.pdf" , publisher = pub-springer , url = "http://link.springer.com/chapter/10.1007/978-3-642-34862-4_14" , year = 2012 } @inproceedings{fw-cda-81 , author = FienbergSE #and# WassermanS , editor = LeinhardtS , title = {{Categorical Data Analysis of a Single Sociometric Relation}} , booktitle = {{Sociological Methodology}} , pages = {156--192} , publisher = pub-jb , year = 1981 } @Article{fw-cef-81 , author = FienbergSE #and# WassermanS , title = {{Comment on an Exponential Family of Probability Distributions}} , journal = j-jasa , month = mar , number = 373 , pages = {54--57} , volume = 76 , year = 1981 } @InProceedings{fw-cpop-92 , author = FelsnerS #and# WagnerD , title = {{On the complexity of partial order properties}} , booktitle = {{Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92)}} , month = jun , pages = {225--235} , publisher = pub-springer , series = ser-springer_lncs , volume = 657 , year = 1993 } @InProceedings{fw-olbsc-13 , author = FuchsF #and# WagnerD , title = {{On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model}} , booktitle = {{Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS'13)}} , note = {to appear} , year = 2013 } @article{fw-tdamssp-94 , author = FredmanML #and# WillardDE , title = {{Trans-dichotomous algorithms for minimum spanning trees and shortest paths}} , journal = j-css , number = 3 , pages = {533--551} , volume = 48 , year = 1994 } @InProceedings{fwl-agcfa-12 , author = FotiF #and# WaddellP #and# LuxenD , title = {{A Generalized Computational Framework for Accessibility: From the Pedestrian to the Metropolitan Scale}} , booktitle = {{Proceedings of the 4th TRB Conference on Innovations in Travel Modeling}} , publisher = pub-trb , url = "http://onlinepubs.trb.org/onlinepubs/conferences/2012/4thITM/Papers-A/0117-000062.pdf" , year = 2012 } @InProceedings{fww-rdcmt-91 , author = FormannM #and# WagnerD #and# WagnerF , title = {{Routing through a Dense Channel with Minimum Total Wire Length}} , booktitle = {{Proceedings of the 2nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'91)}} , pages = {475--482} , publisher = pub-acm , year = 1991 } @Article{fww-rdcmt-93 , author = FormannM #and# WagnerD #and# WagnerF , title = {{Routing through a Dense Channel with Minimum Total Wire Length}} , journal = j-jalg , number = 2 , pages = {267--283} , url = "http://dx.doi.org/10.1006/jagm.1993.1041" , volume = 15 , year = 1993 } @Book{fy-stbam-48 , author = FisherRA #and# YatesF , title = {{Statistical Tables for Biological, Agricultural and Medical Research}} , booktitle = {{Statistical Tables for Biological, Agricultural and Medical Research}} , publisher = pub-obl , url = "http://www.worldcat.org/oclc/14222135" , year = 1948 } @Article{fz-swos-08 , author = FelsnerS #and# ZickfeldF , title = {{Schnyder Woods and Orthogonal Surfaces}} , journal = dcg , month = aug , number = 1 , pages = {103--126} , volume = 40 , year = 2008 } @InCollection{fzy-spims-11 , author = FengQ #and# ZhengX #and# YanC , title = {{Study and Practice of an Improving Multi-path Search Algorithm in a City Public Transportation Network}} , booktitle = {{Advanced Electrical and Electronics Engineering}} , pages = {87--96} , publisher = pub-springer , series = ser-lnee , url = "http://dx.doi.org/10.1007/978-3-642-19712-3_11" , volume = 87 , year = 2011 } %% -------------------------------------------------------------- @phdthesis{g-aacte-07 , author = GaertlerM , title = {{Algorithmic Aspects of Clustering -- Theory, Experimental Evaluation, and Applications in Network Analysis and Visualization}} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3097" , school = inf_ka , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000006953" , year = 2007 } @phdthesis{g-aawsd-10 , author = GoerkeR , title = {{An Algorithmic Walk from Static to Dynamic Graph Clustering}} , institution = "KIT" , month = feb , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1344831" , school = "Fakult{\"a}t f{\"u}r Informatik" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000018288" , year = 2010 } @misc{g-afc-08 , author = GemsaA , title = {{Arc-Flag Compression}} , note = {Student Reseach Project} , pdf = "http://i11www.ira.uka.de/extra/publications/g-afc-08.pdf" , school = inf_ka , year = 2008 } @article{g-amfp-80 , author = GalilZ , title = {{An {$\mathcal{O}(V^{5/3}E^{2/3})$} Algorithm for the Maximal Flow Problem}} , journal = j-acta-inf , pages = {221--242} , volume = 14 , year = 1980 } @Article{g-apspa-08 , author = GoldbergAV , title = {{A Practical Shortest Path Algorithm with Linear Expected Time}} , journal = j-sicomp , pages = {1637--1655} , volume = 37 , year = 2008 } @phdthesis{g-arptn-11 , author = GeisbergerR , title = {{Advanced Route Planning in Transportation Networks}} , month = feb , pdf = "http://algo2.iti.kit.edu/download/diss_geisberger.pdf" , school = "Karlsruhe Institute of Technology" , year = 2011 } @misc{g-babc-08 , author = GeisbergerR , title = {{Better Approximation of Betweenness Centrality}} , note = {Student research project.} , school = inf_ka , year = 2008 } @Article{g-bcma-66 , author = GrahamRL , title = {{Bounds for Certain Multiprocessor Anomalics}} , journal = j-bstj , pages = {1563--1581} , volume = 45 , year = 1966 } @Article{g-bmta-69 , author = GrahamRL , title = {{Bounds on Multiprocessing Timing Anomalies}} , journal = j-sijam , number = 2 , pages = {416--429} , volume = 17 , year = 1969 } @InCollection{g-c-05 , author = GaertlerM , title = {{Clustering}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {178--215} , pdf = "http://springerlink.metapress.com/content/19b5r48lqx3nx7gc/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/19b5r48lqx3nx7gc" , volume = 3418 , year = 2005 } @article{g-cedst-83 , author = GusfieldD , title = {{Connectivity and Edge-Disjoint Spanning Trees}} , journal = j-ipl , number = 2 , pages = {87--89} , volume = 16 , year = 1983 } @mastersthesis{g-ch-08 , author = GeisbergerR , title = {{Contraction Hierarchies}} , note = {\url{http://algo2.iti.uni-karlsruhe.de/documents/routeplanning/geisberger_dipl.pdf}} , school = inf_ka , year = 2008 } @Article{g-cmmid-85 , author = GonzalezTF , title = {{Clustering to Minimize the Maximum Intercluster Distance}} , journal = j-tcs , pages = {293--306} , volume = 38 , year = 1985 } @mastersthesis{g-csm-02 , author = GaertlerM , title = {{Clustering with Spectral Methods}} , month = mar , school = "Fachbereich Informatik und Informationswissenschaft, Universit{\"a}t Konstanz" , type = {Diplomarbeit} , year = 2002 } @techreport{g-ctnrt-09 , author = GeisbergerR , title = {{Contraction of Timetable Networks with Realistic Transfers}} , institution = "ITI Sanders, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)" , year = 2009 } @InProceedings{g-ctnrt-10 , author = GeisbergerR , title = {{Contraction of Timetable Networks with Realistic Transfers}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {71--82} , publisher = pub-springer , series = ser-springer_lncs , volume = 6049 , year = 2010 } @mastersthesis{g-eskqp-04 , author = GoerkeR , title = {{Ein Schneller Konstruktionsalgorithmus f{\"u}r eine Quickest-Path-Map bez{\"u}glich der City-Metrik}} , institution = "Deptartment of Mathematics" , month = oct , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/g-skqpmbcm-04.pdf" , school = uni_ka , year = 2004 } @techreport{g-etota-10 , author = GeisbergerR , title = {{Engineering Time-dependent One-To-All Computation}} , institution = "ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology" , year = 2010 } @techreport{g-fmds-84 , author = GoldbergAV , title = {{Finding a maximum density subgraph}} , institution = "Department of Electrical Engineering and Computer Science, University of California, Ber" , number = {UCB/CSB/ 8} , year = 1984 } @book{g-glt-98 , author = GraetzerG , title = {{General Lattice Theory}} , publisher = pub-birk , year = 1998 } @techreport{g-hchag-10 , author = GeisbergerR , title = {{Heuristic Contraction Hierarchies with Approximation Guarantee}} , institution = "ITI Sanders, Faculty of Informatics, Karlsruhe Institute of Technology" , year = 2010 } @Article{g-mii-21 , author = GiniC , title = {{Measurement of Inequality of Incomes}} , journal = j-tej , month = mar , number = 121 , pages = {124--126} , url = "http://www.jstor.org/stable/10.2307/2223319" , volume = 31 , year = 1921 } @techreport{g-nmfa-85 , author = GoldbergAV , title = {{A New Max-Flow Algorithm}} , institution = "MIT Laboratory for Computer Science" , month = nov , number = {MIT/LCS/TM} , type = {Technical Memo} , year = 1985 } @article{g-noecg-81 , author = GoldsmithDL , title = {{On the $N$-th Order Edge-Connectivity of a Graph}} , journal = j-congr-num , month = dec , pages = {375--381} , volume = 32 , year = 1981 } @phdthesis{g-o-07 , author = GattoM , title = {{On the impact of uncertainty on some optimization problems }} , school = "ETH Z{\"u}rich" , year = 2007 } @article{g-pbdfssbc-00 , author = GabowHN , title = {{Path-based depth-first search for strong and biconnected components}} , journal = j-ipl , number = {3-4} , pages = {107--114} , volume = 74 , year = 2000 } @InProceedings{g-rbran-04 , author = GutmanRJ , title = {{Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks}} , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}} , pages = {100--111} , pdf = "http://i11www.ira.uka.de/extra/publications/g-rbran-04.pdf" , publisher = pub-siam , year = 2004 } @article{g-rg-59 , author = GilbertEN , title = {{Random Graphs}} , journal = j-ams , number = 4 , pages = {1141--1144} , volume = 30 , year = 1959 } @InProceedings{g-rtadi-84 , author = GuttmanA , title = {{R-Trees: A Dynamic Index Structure for Spatial Searching}} , booktitle = {{Proceedings of the 1984 ACM SIGMOD international conference on Management of data}} , pages = {47--57} , publisher = pub-acm , year = 1984 } @article{g-sanp-85 , author = GabowHN , title = {{Scaling Algorithms for Network Problems}} , journal = j-css , month = sep , number = 2 , pages = {148--168} , volume = 31 , year = 1985 } @Article{g-saspp-95 , author = GoldbergAV , title = {{Scaling Algorithms for the Shortest Paths Problem}} , journal = j-sicomp , number = 3 , pages = {494--504} , volume = 24 , year = 1995 } @article{g-soecg-80 , author = GoldsmithDL , title = {{On the Second Order Edge Connectivity of a Graph}} , journal = j-congr-num , month = dec , pages = {479--484} , volume = 29 , year = 1980 } @mastersthesis{g-svspr-09 , author = GemsaA , title = {{Schematized Visualization of Shortest Paths in Road Networks}} , month = nov , pdf = "http://i11www.ira.uka.de/extra/publications/g-svspr-09.pdf" , school = inf_ka , year = 2009 } @InProceedings{g-svspr-10 , author = GemsaA , title = {{Schematized Visualizations of Shortest Paths in Road Networks}} , booktitle = {{Informatiktage 2010}} , month = mar , pages = {19--22} , series = ser-gielnilni , volume = {S-9} , year = 2010 } @techreport{g-tla-89 , author = GodsilC , title = {{Tools from Linear Algebra}} , institution = "University of Waterloo" , type = {Research Report} , url = "http://quoll.uwaterloo.ca/pstuff/tools.ps" , year = 1989 } @Article{g-vsmap-90 , author = GusfieldD , title = {{Very simple methods for all pairs network flow analysis}} , journal = j-sicomp , number = 1 , pages = {143--155} , volume = 19 , year = 1990 } @mastersthesis{g-zgme-08 , author = GlaserD , title = {{Zeitexpandiertes Graphenclustern - Modellierung und Experimente}} , institution = uni_ka , month = feb , note = {Diplomarbeit} , pdf = "http://i11www.ira.uka.de/extra/publications/g-zgme-08.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished" , year = 2008 } @Article{ga-fccmn-05 , author = GuimeraR #and# AmaralLAN , title = {{Functional Cartography of Complex Metabolic Networks}} , journal = j-nature , month = feb , pages = {895--900} , pdf = "http://www.nature.com/nature/journal/v433/n7028/pdf/nature03288.pdf" , url = "http://www.nature.com/nature/journal/v433/n7028/full/nature03288.html" , volume = 433 , year = 2005 } @book{gcsr-bda-95 , author = GelmanA #and# CarlinJB #and# SternHS #and# RubinDB , title = {{Bayesian Data Analysis}} , edition = second , month = jun , publisher = pub-ch , series = ser-ch_tiss , year = 1995 } @InProceedings{gd-a-04 , author = GogateV #and# DechterR , title = {{A complete anytime algorithm for treewidth}} , booktitle = {{UAI'04 Proceedings of the 20th conference on Uncertainty in artificial intelligence}} , pages = {201--208} , publisher = pub-auaip , year = 2004 } @Article{gd-csj-03 , author = GleiserP #and# DanonL , title = {{Community Structure in Jazz}} , journal = j-acs , number = 4 , pages = {565--573} , volume = 6 , year = 2003 } @Article{gddga-s-03 , author = GuimeraR #and# DanonL #and# DiazGuileraA #and# GiraltF #and# ArenasA , title = {{Self-similar community structure in a network of human interactions}} , journal = j-pr-e , month = dec , number = 6 , volume = 68 , year = 2003 } @InProceedings{ge-s-03 , author = GoelA #and# EstrinD , title = {{Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk}} , booktitle = {{Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)}} , pages = {499--505} , url = "http://portal.acm.org/citation.cfm?id=644191" , year = 2003 } @Article{gg-alpac-61 , author = GilmorePC #and# GomoryRE , title = {{A Linear Programming Approach to the Cutting Stock Problem}} , journal = j-or , month = nov , number = 6 , pages = {849--859} , volume = 9 , year = 1961 } @Article{gg-alpac-63 , author = GilmorePC #and# GomoryRE , title = {{A Linear Programming Approach to the Cutting Stock Problem-Part II}} , journal = j-or , month = nov , number = 6 , pages = {863--888} , volume = 11 , year = 1963 } @InProceedings{gg-ccfnc-06 , author = GiotisI #and# GuruswamiV , title = {{Correlation Clustering with a Fixed Number of Clusters}} , address = "New York, NY, USA" , booktitle = {{Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)}} , doi = "http://doi.acm.org/10.1145/1109557.1109686" , isbn = "0-89871-605-5" , pages = {1167--1176} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1109686&type=pdf&coll=GUIDE&dl=GUIDE&CFID=8627208&CFTOKEN=18" , url = "http://portal.acm.org/citation.cfm?id=1109557.1109686" , year = 2006 } @Article{gghw-caldg-10 , author = GoerkeR #and# GaertlerM #and# HubnerF #and# WagnerD , title = {{Computational Aspects of Lucidity-Driven Graph Clustering}} , journal = j-jgaa , number = 2 , pages = {165--197} , pdf = "http://www.cs.brown.edu/sites/jgaa/accepted/2010/GoerkeGaertlerHuebnerWagner2010.14.2.pdf" , url = "http://www.cs.brown.edu/sites/jgaa/volume14.html" , volume = 14 , year = 2010 } @InProceedings{ggk-mafdl-01 , author = GajerP #and# GoodrichMT #and# KobourovSG , title = {{A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs}} , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {211--221} , pdf = "http://www.springerlink.com/content/6bnvbh219mcxe821/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/6bnvbh219mcxe821/" , volume = 1984 , year = 2001 } @Book{ggl-hcv-95 , editor = GrahamRL #and# GrotschelM #and# LovaszL , title = {{Handbook of Combinatorics (Vol. 2)}} , booktitle = {{Handbook of Combinatorics (Vol. 2)}} , publisher = pub-mitpr , year = 1995 } @InProceedings{ggpjw-rdmei-04 , author = GattoM #and# GlausB #and# PeetersL #and# JacobR #and# WidmayerP , title = {{Railway Delay Management: Exploring Its Algorithmic Complexity }} , booktitle = {{Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04)}} , pages = {199--211} , publisher = pub-springer , series = ser-springer_lncs , volume = 3111 , year = 2004 } @Article{ggt-dd-05 , author = GortlerSJ #and# GotsmanC #and# ThurstonD , title = {{Discrete one-forms on meshes and applications to 3D mesh parameterization}} , journal = j-cagd , number = 2 , pages = {83--112} , volume = 23 , year = 2005 } @Article{ggt-fpmfaa-89 , author = GalloG #and# GrigoriadisMD #and# TarjanRE , title = {{A fast parametric maximum flow algorithm and applications}} , journal = j-sicomp , number = 1 , pages = {30--55} , volume = 18 , year = 1989 } @InProceedings{ggw-fmfva-08 , author = GaertlerM #and# GoerkeR #and# WagnerD , title = {{Fingerprints - Means For Visual Analytics}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , note = {as poster, see \url{http://i11www.iti.uni-karlsruhe.de/algobib/files/ggw-fmfva-08.pdf}} , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gd07-poster.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gd07-posterAbstract.pdf" , volume = 4875 , year = 2008 } @InProceedings{ggw-lvavl-08 , author = GoerkeR #and# GaertlerM #and# WagnerD , title = {{LunarVis - Analytic Visualizations of Large Graphs}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , pages = {352--364} , pdf = "http://www.springerlink.com/content/aq444257835541w5/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/aq444257835541w5/" , volume = 4875 , year = 2008 } @InProceedings{ggw-sdgc-07 , author = GaertlerM #and# GoerkeR #and# WagnerD , title = {{Significance-Driven Graph Clustering}} , booktitle = {{Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07)}} , location = "Portland, USA" , month = jun , pages = {11--26} , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/ggw-sdgc-07.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/nrq6tlm286808887/?p=65f77ccbb2674a16b9a67da6bb370dc7&pi=5" , year = 2007 } @InProceedings{ggww-hceg-06 , author = GaertlerM #and# GoerkeR #and# WagnerD #and# WagnerS , title = {{How to Cluster Evolving Graphs}} , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'06)}} , month = sep , note = {online available at \url{http://complexsystems.lri.fr/FinalReview/FILES/PDF/p103.pdf}} , pdf = "http://complexsystems.lri.fr/FinalReview/FILES/PDF/p103.pdf" , url = "http://cssociety.org/tiki-index.php?page=ECCS'06+Programme" , year = 2006 } @techreport{gh-cspas-04 , author = GoldbergAV #and# HarrelsonC , title = {{Computing the Shortest Path: A* Search Meets Graph Theory}} , institution = "Microsoft Research" , number = {MSR-TR-200} , year = 2004 } @InProceedings{gh-cspas-05 , author = GoldbergAV #and# HarrelsonC , title = {{Computing the Shortest Path: A* Search Meets Graph Theory}} , booktitle = {{Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)}} , pages = {156--165} , pdf = "http://i11www.ira.uka.de/extra/publications/gh-cspas-05.pdf" , publisher = pub-siam , year = 2005 } @Article{gh-mtnf-61 , author = GomoryRE #and# HuTC , title = {{Multi-terminal network flows}} , journal = j-siam , month = dec , number = 4 , pages = {551--570} , volume = 9 , year = 1961 } @article{gh-scn-64 , author = GomoryRE #and# HuTC , title = {{Synthesis of a communication network}} , journal = j-siam , number = 2 , pages = {348--369} , volume = 12 , year = 1964 } @Book{gh-ufact-00 , author = GyugyiL #and# HingoraniNG , title = {{Understanding FACTS. Concepts and Technology of Flexible AC Transmission Systems}} , booktitle = {{Understanding FACTS. Concepts and Technology of Flexible AC Transmission Systems}} , publisher = pub-wieeep , year = 2000 } @InProceedings{ghk-ottg-11 , author = GansnerER #and# HuY #and# KobourovSG , title = {{On Touching Triangle Graphs}} , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}} , pages = {250--261} , publisher = pub-springer , series = ser-springer_lncs , volume = 6502 , year = 2011 } @InProceedings{ghkk-oprpg-10 , author = GansnerER #and# HuY #and# KaufmannM #and# KobourovSG , title = {{Optimal Polygonal Representation of Planar Graphs}} , booktitle = {{Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATIN'10)}} , pages = {417--432} , series = ser-springer_lncs , year = 2010 } @InCollection{ghm-m-09 , author = GeyerM #and# HillerB #and# MeinertS , title = {{Modeling}} , booktitle = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}} , pages = {16--57} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-14866-8_2" , volume = 5971 , year = 2010 } @InProceedings{ghn-blapi-11 , author = GemsaA #and# HaunertJ #and# NollenburgM , title = {{Boundary-Labeling Algorithms for Panorama Images}} , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}} , pages = {289--298} , pdf = "http://i11www.ira.uka.de/extra/publications/ghn-blapi-11.pdf" , publisher = pub-acm , url = "http://dl.acm.org/authorize?6536306" , year = 2011 } @Article{ghw-dcc-11 , author = GoerkeR #and# HartmannT #and# WagnerD , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}} , journal = j-jgaa , number = 2 , pages = {411--446} , volume = 16 , year = 2012 } @techreport{ghw-dgcum-09 , author = GoerkeR #and# HartmannT #and# WagnerD , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}} , institution = iti_wagner , note = {Informatik, Uni Karlsruhe, TR 2009-10} , pdf = "http://i11www.ira.uka.de/extra/publications/ghw-dgcum-09.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011476" , year = 2009 } @techreport{ghw-dgcum-11 , author = GoerkeR #and# HartmannT #and# WagnerD , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}} , institution = kit_wagner , note = {Karlsruhe Reports in Informatics 2011-12} , pdf = "http://i11www.ira.uka.de/extra/publications/ghw-dgcum-11.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022477 " , year = 2011 } @InProceedings{ghw-dmctc-09 , author = GoerkeR #and# HartmannT #and# WagnerD , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}} , booktitle = {{Algorithms and Data Structures, 11th International Symposium (WADS'09)}} , month = aug , pages = {339--350} , pdf = "http://www.springerlink.com/content/71l74772v0723j04/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-03367-4_30" , volume = 5664 , year = 2009 } @inproceedings{gi-dcp-04 , author = GrandoniF #and# ItalianoGF , title = {{Decremental Clique Problem}} , booktitle = {{Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)}} , publisher = pub-springer , series = ser-springer_lncs , year = 2004 } @inproceedings{gi-fdaec-91 , author = GalilZ #and# ItalianoGF , title = {{Fully Dynamic Algorithms for Edge Connectivity Problems}} , booktitle = {{Proceedings of the 23rd Annual {ACM} Symposium on the Theory of Computing (STOC'91)}} , month = may , pages = {317--327} , year = 1991 } @book{gj-ci-79 , author = GareyMR #and# JohnsonDS , title = {{Computers and Intractability. A Guide to the Theory of {$\mathcal{NP}$}-Completeness}} , publisher = pub-freeman , year = 1979 } @Article{gj-cnnpc-83 , author = GareyMR #and# JohnsonDS , title = {{Crossing Number is NP-Complete}} , journal = j-siamjadm , pages = {312--316} , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SJMAEL000004000003000312000001" , volume = 4 , year = 1983 } @InProceedings{gjkklm-anavu-03 , author = GutwengerC #and# JuengerM #and# KleinK #and# KupkeJ #and# LeipertS #and# MutzelP , title = {{A New Approach for Visualizing UML Class Diagrams}} , booktitle = {{Proceedings ACM 2003 Symposium on Software Visualization (SOFTVIS'03)}} , month = jun , pages = {179--188} , publisher = pub-acm , year = 2003 } @InProceedings{gjps-t-05 , author = GattoM #and# JacobR #and# PeetersL #and# SchoebelA , title = {{The computational complexity of delay management}} , booktitle = {{Proceedings of the 31th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05)}} , pages = {227--238} , publisher = pub-springer , series = ser-springer_lncs , volume = 3787 , year = 2005 } @InCollection{gjpw-o-07 , author = GattoM #and# JacobR #and# PeetersL #and# WidmayerP , title = {{On-line delay management on a single train line}} , booktitle = {{Algorithmic Methods for Railway Optimization}} , publisher = pub-springer , series = ser-springer_lncs , volume = 4359 , year = 2007 } @article{gjs-sscgp-76 , author = GareyMR #and# JohnsonDS #and# StockmeyerLJ , title = {{Some Simplified {$\mathcal{NP}$}-Complete Graph Problems}} , journal = j-tcs , pages = {237--267} , volume = 1 , year = 1976 } @InProceedings{gjzyjw-raspd-12 , author = GaoJun #and# JinR #and# ZhouJ #and# YuJX #and# JiangX #and# WangT , title = {{Relational Approach for Shortest Path Discovery over Large Graphs}} , booktitle = {{Proceedings of the 38th International Conference on Very Large Databases (VLDB 2012)}} , pages = {358--369} , pdf = "http://vldb.org/pvldb/vol5/p358_jungao_vldb2012.pdf" , year = 2012 } @InProceedings{gk-dglsn-05 , author = GotsmanC #and# KorenI , title = {{Distributed Graph Layout for Sensor Networks}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {273--284} , pdf = "http://www.springerlink.com/content/ynnhqatf9jnj551v/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/ynnhqatf9jnj551v" , volume = 3383 , year = 2005 } @InProceedings{gk-fsamf-98 , author = GargN #and# KoenemannJ , title = {{Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems}} , booktitle = {{Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98)}} , pages = {300--309} , publisher = pub-ics , year = 1998 } @Article{gk-ggdip-02 , author = GajerP #and# KobourovSG , title = {{GRIP: Graph Drawing with Intelligent Placement}} , journal = j-jgaa , month = jun , number = 3 , pages = {203--224} , pdf = "http://www.cs.brown.edu/sites/jgaa/accepted/2002/GajerKobourov2002.6.3.pdf" , url = "http://www.cs.brown.edu/sites/jgaa/volume06.html" , volume = 6 , year = 2002 } @InProceedings{gk-icl-07 , author = GansnerER #and# KorenY , title = {{Improved Circular Layouts}} , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}} , month = jan , pages = {386--398} , publisher = pub-springer , series = ser-springer_lncs , url = "http://gdea.informatik.uni-koeln.de/archive/00000794/" , volume = 4372 , year = 2007 } @InProceedings{gk-m-05 , author = GiridharA #and# KumarPR , title = {{Maximizing the functional lifetime of sensor networks}} , booktitle = {{Fourth International Symposium on Information Processing in Sensor Networks (IPSN 2005)}} , pages = {5--12} , pdf = "http://ieeexplore.ieee.org/iel5/9840/31018/01440885.pdf?tp=&isnumber=&arnumber=1440885" , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1440885" , year = 2005 } @Article{gkk-sesfn-01 , author = GohK #and# KahngB #and# KimD , title = {{Spectra and Eigenvectors of Scale-Free Networks}} , journal = j-pr-e , month = oct , number = 5 , pages = 051903 , url = "http://dx.doi.org/10.1103/PhysRevE.64.051903" , volume = 64 , year = 2001 } @InProceedings{gkmss-tprti-11 , author = GoerigkM #and# KnothM #and# MuellerHannemannM #and# SchmidtM #and# SchoebelA , title = {{The Price of Robustness in Timetable Information}} , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}} , pages = {76--87} , series = ser-oasioasi , volume = 20 , year = 2011 } @InProceedings{gkn-gdsm-05 , author = GansnerER #and# KorenY #and# NorthSC , title = {{Graph Drawing by Stress Majorization}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {239--250} , pdf = "http://www.springerlink.com/content/jrn52j7cx8grcy6v/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/jrn52j7cx8grcy6v/" , volume = 3383 , year = 2005 } @InProceedings{gks-rpfof-10 , author = GeisbergerR #and# KobitzschM #and# SandersP , title = {{Route Planning with Flexible Objective Functions}} , booktitle = {{Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10)}} , pages = {124--137} , pdf = "http://www.siam.org/proceedings/alenex/2010/alx10_012_geisbergerr.pdf" , publisher = pub-siam , year = 2010 } @techreport{gkssw-aegcd-12 , author = GoerkeR #and# KlugeR #and# SchummA #and# StaudtC #and# WagnerD , title = {{An Efficient Generator for Clustered Dynamic Random Networks}} , institution = kit_wagner , note = {Karlsruhe Reports in Informatics 2012,17} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2286280" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000029825 " , year = 2012 } @InProceedings{gkssw-aegcd-12-2 , author = GoerkeR #and# KlugeR #and# SchummA #and# StaudtC #and# WagnerD , title = {{An Efficient Generator for Clustered Dynamic Random Networks}} , booktitle = {{Proceedings of the 1st Mediterranean Conference on Algorithms}} , pages = {219--233} , publisher = pub-springer , year = 2012 } @Book{gkswz-amro-07 , author = GeraetsF #and# KroonLG #and# SchoebelA #and# WagnerD #and# ZaroliagisC , title = {{Algorithmic Methods for Railway Optimization}} , booktitle = {{Algorithmic Methods for Railway Optimization}} , publisher = pub-springer , series = ser-springer_lncs , volume = 4359 , year = 2007 } @InProceedings{gkw-blwr-07 , author = GoldbergAV #and# KaplanH #and# WerneckR , title = {{Better Landmarks Within Reach}} , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}} , month = jun , pages = {38--51} , publisher = pub-springer , series = ser-springer_lncs , volume = 4525 , year = 2007 } @techreport{gkw-mrcmd-06 , author = GaertlerM #and# KatzB #and# WagnerD , title = {{Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks}} , institution = iti_wagner , isbn = "1432-7864" , number = {2006-17} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3252" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005767" , year = 2006 } @InProceedings{gkw-mrcmd-07 , author = GaertlerM #and# KatzB #and# WagnerD , title = {{Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks}} , booktitle = {{Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}} , isbn = "978-3-540-69506-6" , location = "Harrachov, Czech Republic" , month = jan , pages = {330--341} , pdf = "http://www.springerlink.com/content/313001434674448r/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/313001434674448r/" , volume = 4362 , year = 2007 } @techreport{gkw-raepp-05 , author = GoldbergAV #and# KaplanH #and# WerneckR , title = {{Reach for A*: Efficient Point-to-Point Shortest Path Algorithms}} , institution = "Microsoft Research" , number = {MSR-TR-200} , pdf = "http://www.avglab.com/andrew/pub/msr-tr-2005-132.pdf" , year = 2005 } @InProceedings{gkw-raepp-06 , author = GoldbergAV #and# KaplanH #and# WerneckR , title = {{Reach for A*: Efficient Point-to-Point Shortest Path Algorithms}} , booktitle = {{Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)}} , pages = {129--143} , publisher = pub-siam , year = 2006 } @InProceedings{gkw-raspa-06 , author = GoldbergAV #and# KaplanH #and# WerneckR , title = {{Reach for A*: Shortest Path Algorithms with Preprocessing}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}} , month = nov , pdf = "http://i11www.ira.uka.de/extra/publications/gkw-raspa-06.pdf" , year = 2006 } @InCollection{gkw-raspa-09 , author = GoldbergAV #and# KaplanH #and# WerneckR , title = {{Reach for A*: Shortest Path Algorithms with Preprocessing}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {93--139} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @book{gl-mc-96 , author = GolubGH #and# LoanCF , title = {{Matrix Computations}} , edition = third , isbn = "0-8018-5414-8" , publisher = pub-tjhup , year = 1996 } @Article{gl-spgpt-98 , author = GrossiR #and# LodiE , title = {{Simple Planar Graph Partition into Three Forests}} , journal = j-dam , pages = {121--132} , volume = 84 , year = 1998 } @InCollection{gl-tla-95 , author = GodsilC #and# LovaszL , title = {{Tools from Linear Algebra}} , booktitle = {{Handbook of Combinatorics (Vol. 2)}} , pages = {1705--1748} , pdf = "http://quoll.uwaterloo.ca/pstuff/tools.pdf" , publisher = pub-mitpr , year = 1995 } @InProceedings{gllw-hocvd-12 , author = GemsaA #and# LeeD #and# LiuC #and# WagnerD , title = {{Higher Order City Voronoi Diagrams}} , booktitle = {{Proceedings of the 28th European Workshop on Computational Geometry (EuroCG'12)}} , pages = {245--248} , year = 2012 } @InProceedings{gllw-hocvd-swat-12 , author = GemsaA #and# LeeD #and# LiuC #and# WagnerD , title = {{Higher Order City Voronoi Diagrams }} , booktitle = {{Proceedings of the 13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'12)}} , month = jul , pages = {59--70} , publisher = pub-springer , series = ser-springer_lncs , volume = 7357 , year = 2012 } @techreport{glnsv-fdcrs-09 , author = GeisbergerR #and# LuxenD #and# NeubauerS #and# SandersP #and# VolkerL , title = {{Fast Detour Computation for Ride Sharing}} , institution = "ITI Sanders, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)" , year = 2009 } @InProceedings{glp-tcrd-11 , author = GoncalvesD #and# LevequeB #and# PinlouA , title = {{Triangle Contact Representations and Duality}} , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 6502 , year = 2011 } @Article{gls-t-81 , author = GrotschelM #and# LovaszL #and# SchrijverA , title = {{The ellipsoid method and its consequences in combinatorial optimization}} , journal = j-comb , month = jun , number = 2 , pages = {169--197} , volume = 1 , year = 1981 } @InProceedings{glsnv-fdcrs-10 , author = GeisbergerR #and# LuxenD #and# SandersP #and# NeubauerS #and# VolkerL , title = {{Fast Detour Computation for Ride Sharing}} , booktitle = {{Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10)}} , pages = {88--99} , pdf = "http://drops.dagstuhl.de/opus/volltexte/2010/2752/pdf/8.pdf" , series = ser-oasioasi , volume = 14 , year = 2010 } @InProceedings{glz-jsrle-07 , author = GuY #and# LiuH #and# ZhaoB , title = {{Joint Scheduling and Routing for Lifetime Elongation in Surveillance Sensor Networks}} , booktitle = {{Proceedings of the 2nd IEEE Asia-Pacific Service Computing Conference (APSCC)}} , pages = {304--311} , year = 2007 } @article{gm-crg-75 , author = GrimmettG #and# McDiarmidCJH , title = {{On colouring random graphs}} , journal = j-mpcps , pages = {313--324} , volume = 77 , year = 1975 } @Article{gm-laspp-08 , author = GutirrezE #and# MedagliaAL , title = {{Labeling Algorithm for the Shortest Path Problem with Turn Prohibitions with Application to Large-Scale Road Networks}} , journal = j-aor , month = jan , number = 1 , pages = {169--182} , volume = 157 , year = 2008 } @inproceedings{gm-ltist-01 , author = GutwengerC #and# MutzelP , title = {{A Linear Time Implementation of {SPQR}-Trees}} , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {70--90} , publisher = pub-springer , series = ser-springer_lncs , volume = 1984 , year = 2001 } @InProceedings{gm-ppdga-99 , author = GutwengerC #and# MutzelP , title = {{Planar Polyline Drawings with Good Angular Resolution}} , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}} , location = "Montreal, Canada" , month = jan , pages = {167--182} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/8cm2ulm1qtc9/" , volume = 1547 , year = 1999 } @misc{gmb-fcvtp-06 , author = GoerkeR #and# MeckeS #and# BohlF , title = {{Flow Commander, a Visualisation Tool for the Push Relabel Algorithm}} , note = {Graph Drawing Competition at GD'06, Honorable Mention} , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/bgm-flowCommanderDescription-06.pdf" , url = "http://i11www.iti.uni-karlsruhe.de/adw/jawsGD/GTVisualizer3D.jnlp" , year = 2006 } @InProceedings{gms-isntc-07 , author = GunkelT #and# MuellerHannemannM #and# SchneeM , title = {{Improved Search for Night Train Connections}} , booktitle = {{Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)}} , pages = {243--258} , pdf = "http://drops.dagstuhl.de/opus/volltexte/2007/1178/pdf/07001.GunkelThorsten.Paper.1178.pdf" , series = ser-oasioasi , url = "http://drops.dagstuhl.de/opus/volltexte/2007/1178" , year = 2007 } @techreport{gmssw-dgccm-11 , author = GoerkeR #and# MaillardP #and# SchummA #and# StaudtC #and# WagnerD , title = {{Dynamic Graph Clustering Combining Modularity and Smoothness}} , institution = kit_wagner , note = {Karlsruhe Reports in Informatics 2011-11 (and invitational submission to a Special Issue of the ACM Journal on Experimental Algorithmics)} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1644954" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022451" , year = 2011 } @Article{gmssw-dgccm-11a , author = GoerkeR #and# MaillardP #and# SchummA #and# StaudtC #and# WagnerD , title = {{Dynamic Graph Clustering Combining Modularity and Smoothness}} , journal = j-acm-ea , month = apr , number = 1 , pages = {1.5:1.1--1.5:1.29} , url = "http://doi.acm.org/http://dx.doi.org/10.1145/2444016.2444021" , volume = 18 , year = 2013 } @techreport{gmsw-mdcdg-10 , author = GoerkeR #and# MaillardP #and# StaudtC #and# WagnerD , title = {{Modularity-Driven Clustering of Dynamic Graphs}} , institution = kit_wagner , note = {Informatik, Uni Karlsruhe, TR 2010-5} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1393801" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000016558" , year = 2010 } @InProceedings{gmsw-mdcdg-10a , author = GoerkeR #and# MaillardP #and# StaudtC #and# WagnerD , title = {{Modularity-Driven Clustering of Dynamic Graphs}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {436--448} , pdf = "http://www.springerlink.com/content/5gn1w87h48035tu1/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-13193-6_37" , volume = 6049 , year = 2010 } @Article{gmt-ca-07 , author = GionisA #and# MannilaH #and# TsaparasP , title = {{Clustering Aggregation}} , journal = j-acmtkdd , month = mar , number = 1 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1217303&type=pdf&coll=GUIDE&dl=GUIDE&CFID=37429259&CFTOKEN=6" , url = "http://portal.acm.org/citation.cfm?id=1217299.1217303" , volume = 1 , year = 2007 } @InProceedings{gmw-iepg-01 , author = GutwengerC #and# MutzelP #and# WeiskircherR , title = {{Inserting an Edge into a Planar Graph.}} , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}} , pages = {246--255} , year = 2001 } @InProceedings{gmw-lbpim-08 , author = GoussevskaiaO #and# MoscibrodaT #and# WattenhoferR , title = {{Local Broadcasting in the Physical Interference Model}} , booktitle = {{Proceedings of the 2008 joint workshop on Foundations of Mobile Computing}} , pages = {35--44} , publisher = pub-acm , year = 2008 } @InCollection{gmw-mftsd-11 , author = GoerkeR #and# MeckeS #and# WagnerD , title = {{Maximum Flows - Towards the Stadium During Rush Hour}} , booktitle = {{Algorithms Unplugged}} , note = {http://www-i1.informatik.rwth-aachen.de/~algorithmus/} , pages = {333--344} , publisher = pub-springer , url = "http://www.springer.com/mathematics/book/978-3-642-15327-3" , year = 2011 } @Article{gmwhec-d-10 , author = GoerkeR #and# Meyer-BaseA #and# WagnerD #and# HeHuan #and# EmmettMR #and# ConradCA , title = {{Determining and interpreting correlations in lipidomic networks found in glioblastoma cells}} , journal = j-bmcsb , month = sep , number = 126 , url = "http://www.biomedcentral.com/1752-0509/4/126" , volume = 4 , year = 2010 } @InProceedings{gmz-sait-03 , author = GkantsidisC #and# MihailM #and# ZeguraEW , title = {{Spectral Analysis of Internet Topologies}} , booktitle = {{Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , month = mar , pages = {364--374} , publisher = pub-ieeecs , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1208688" , volume = 1 , year = 2003 } @Article{gn-a-09 , author = GimenezO #and# NoyM , title = {{Asymptotic enumeration and limit laws of planar graphs }} , journal = j-jams , month = apr , number = 2 , pages = {309--329} , volume = 22 , year = 2009 } @article{gn-amfp-80 , author = GalilZ #and# NaamadA , title = {{An {$\mathcal{O}(EV \log^2 V)$} algorithm for the maximal flow problem}} , journal = j-css , number = 2 , pages = {203--217} , volume = 21 , year = 1980 } @Article{gn-c-02 , author = GirvanM #and# NewmanMEJ , title = {{Community structure in social and biological networks}} , journal = j-pnas , number = 12 , pages = {7821--7826} , volume = 99 , year = 2002 } @Article{gn-emias-93 , author = GusfieldD #and# NaorD , title = {{Extracting Maximal Information About Sets of Minimum Cuts}} , journal = j-alg , pages = {64--89} , year = 1993 } @InProceedings{gn-ifdl-99 , author = GansnerER #and# NorthSC , title = {{Improved Force-Directed Layouts}} , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}} , location = "Montreal, Canada" , month = jan , pages = {364--373} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/8cm2ulm1qtc9/" , volume = 1547 , year = 1999 } @InProceedings{gnn-tbdml-13 , author = GemsaA #and# NiedermannB #and# NollenburgM , title = {{Trajectory-Based Dynamic Map Labeling}} , booktitle = {{Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)}} , year = 2013 } @InProceedings{gnpr-agrs-10 , author = GemsaA #and# NollenburgM #and# PajorT #and# RutterI , title = {{Automatic Generation of Route Sketches}} , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}} , note = {Poster abstract.} , pages = {391--392} , pdf = "http://i11www.ira.uka.de/extra/publications/gnpr-agrs-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_37" , volume = 6502 , year = 2011 } @techreport{gnpr-osep-10 , author = GemsaA #and# NollenburgM #and# PajorT #and# RutterI , title = {{On d-regular Schematization of Embedded Paths}} , institution = "Faculty of Informatics, Karlsruhe" , number = {2010-21} , pdf = "http://i11www.ira.uka.de/extra/publications/gnpr-osep-10.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020426" , year = 2010 } @InProceedings{gnpr-osep-11 , author = GemsaA #and# NollenburgM #and# PajorT #and# RutterI , title = {{On d-regular Schematization of Embedded Paths}} , booktitle = {{Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11)}} , month = jan , pages = {260--271} , pdf = "http://i11www.ira.uka.de/extra/publications/gnpr-osep-11.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-18381-2_22" , volume = 6543 , year = 2011 } @InProceedings{gnr-clrm-11 , author = GemsaA #and# NollenburgM #and# RutterI , title = {{Consistent Labeling of Rotating Maps}} , booktitle = {{Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11)}} , pages = {171--174} , pdf = "http://i11www.ira.uka.de/extra/publications/gnr-clrm-11.pdf" , year = 2011 } @InProceedings{gnr-clrm-w-11 , author = GemsaA #and# NollenburgM #and# RutterI , title = {{Consistent Labeling of Rotating Maps}} , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}} , month = aug , note = {Full version available at \url{http://arxiv.org/abs/1104.5634}.} , pages = {451--462} , pdf = "http://i11www.ira.uka.de/extra/publications/gnr-clrm-w-11.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-22300-6_38" , volume = 6844 , year = 2011 } @InProceedings{gnr-sldpl-11 , author = GemsaA #and# NollenburgM #and# RutterI , title = {{Sliding Labels for Dynamic Point Labeling}} , booktitle = {{Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11)}} , pdf = "http://i11www.ira.uka.de/extra/publications/gnr-sldpl-11.pdf" , publisher = pub-utp , year = 2011 } @Book{gnw-ss-01 , author = GlazJ #and# NausJ #and# WallensteinS , title = {{Scan Statistics}} , booktitle = {{Scan Statistics}} , publisher = pub-springer , series = ser-springer_stis , url = "http://www.springer.com/statistics/statistical+theory+and+methods/book/978-0-387-98819-1" , year = 2001 } @Article{gojkk-csfn-02 , author = GohK #and# OhE #and# JeongH #and# KahngB #and# KimD , title = {{Classification of Scale-Free Networks}} , journal = j-pnas , month = oct , number = 20 , pages = {12583--12588} , url = "http://www.pnas.org/content/99/20/12583.full" , volume = 99 , year = 2002 } @Article{gp-cldds-03 , author = GavoilleC #and# PelegD , title = {{Compact and Localized Distributed Data Structures}} , journal = j-dc , month = sep , number = {2--3} , pages = {111--120} , volume = 16 , year = 2003 } @InProceedings{gp-daasg-04 , author = GaertlerM #and# PatrignaniM , title = {{Dynamic Analysis of the Autonomous System Graph}} , booktitle = {{IPS 2004 -- Inter-Domain Performance and Simulation}} , location = "Budapest, Hunary" , month = mar , pages = {13--24} , url = "http://w3.tmit.bme.hu/ips2004/index.html" , year = 2004 } @Article{gppr-dlg-04 , author = GavoilleC #and# PelegD #and# PerennesS #and# RazR , title = {{Distance Labeling in Graphs}} , journal = j-jalg , pages = {85--112} , volume = 53 , year = 2004 } @InProceedings{gpwz-ecjr-13 , author = GemsaA #and# PajorT #and# WagnerD #and# ZuendorfT , title = {{Efficient Computation of Jogging Routes}} , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}} , pages = {272--283} , pdf = "http://i11www.ira.uka.de/extra/publications/gpwz-ecjr-13.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 7933 , year = 2013 } @book{gr-agt-01 , author = GodsilC #and# RoyleG , title = {{Algebraic Graph Theory}} , publisher = pub-springer , series = ser-springer_gtm , year = 2001 } @inproceedings{gr-aiidt-97 , author = GovindanR #and# ReddyA , title = {{An Analysis of {Internet} Inter-Domain Topology and Route Stability}} , booktitle = {{Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , publisher = pub-ieeecs , year = 1997 } @InProceedings{gr-aodsd-08 , author = GottliebL #and# RodittyL , title = {{An Optimal Dynamic Spanner for Doubling Metric Spaces}} , booktitle = {{Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)}} , month = sep , pages = {478--489} , publisher = pub-springer , series = ser-springer_lncs , volume = 5193 , year = 2008 } @Article{gr-bfdb-98 , author = GoldbergAV #and# RaoS , title = {{Beyond the Flow Decomposition Barrier}} , journal = j-acm , month = sep , note = {http://portal.acm.org/citation.cfm?id=290181} , number = 5 , pages = {783--797} , volume = 45 , year = 1998 } @article{gr-fuucn-99 , author = GoldbergAV #and# RaoS , title = {{Flows in Undirected Unit Capacity Networks}} , journal = j-sidma , number = 1 , pages = {1--5} , volume = 12 , year = 1999 } @book{gr-ibeo-94 , editor = GillesRP #and# RuysP , title = {{Imperfections and Behaviour in Economic Organizations}} , booktitle = {{Imperfections and Behaviour in Economic Organizations}} , publisher = pub-kapg , year = 1994 } @book{grs-mcmc-96 , author = GilksWR #and# RichardsonS #and# SpiegelhalterDJ , title = {{Markov Chain Monte Carlo in Practice}} , publisher = pub-ch , series = "Interdisciplinary St" , year = 1996 } @Article{grst-rpfer-12 , author = GeisbergerR #and# RiceM #and# SandersP #and# TsotrasV , title = {{Route Planning with Flexible Edge Restrictions}} , journal = j-acm-ea , number = 1 , pages = {1--20} , volume = 17 , year = 2012 } @techreport{gs-agdcr-09 , author = GoerkeR #and# StaudtC , title = {{A Generator for Dynamic Clustered Random Graphs}} , institution = iti_wagner , note = {Informatik, Uni Karlsruhe, TR 2009-7} , pdf = "http://i11www.ira.uka.de/extra/publications/gs-agdcr-09.pdf" , url = "http://i11www.iti.uni-karlsruhe.de/projects/spp1307/dyngen" , year = 2009 } @InProceedings{gs-etdmm-10 , author = GeisbergerR #and# SandersP , title = {{Engineering Time-Dependent Many-to-Many Shortest Paths Computation}} , booktitle = {{Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10)}} , series = ser-oasioasi , volume = 14 , year = 2010 } @InProceedings{gs-hchag-10 , author = GeisbergerR #and# SchieferdeckerD , title = {{Heuristic Contraction Hierarchies with Approximation Guarantee}} , booktitle = {{Proceedings of the 3rd International Symposium on Combinatorial Search (SoCS'10)}} , pdf = "http://i11www.ira.uka.de/extra/publications/gs-hchag-10.pdf" , publisher = pub-aaaip , year = 2010 } @techreport{gs-idaml-95 , author = GoldbergAV #and# SilversteinC , title = {{Implementations do Dijkstra's Algorithm based on Multi-Level Buckets}} , institution = "NEC Research Institute" , number = 187 , year = 1995 } @Book{gs-ip-97 , author = GrinsteadCM #and# SnellJL , title = {{Introduction to Probability}} , booktitle = {{Introduction to Probability}} , publisher = pub-ams , year = 1997 } @Article{gs-p-99 , author = GruppH #and# SchmochU , title = {{Patent statistics in the age of globalisation: new legal procedures, new analytical methods, new economic interpretation}} , journal = j-rp , month = apr , number = 4 , pages = {377--396} , url = "doi:10.1016/S0048-7333(98)00125-5 " , volume = 28 , year = 1999 } @Article{gsa-m-07 , author = GuimeraR #and# Sales-PardoM #and# AmaralLAN , title = {{Module identification in bipartite and directed networks}} , journal = j-pr-e , month = sep , pages = 036102 , url = "http://link.aps.org/doi/10.1103/PhysRevE.76.036102" , volume = 76 , year = 2007 } @Article{gsa-mfrgc-04 , author = GuimeraR #and# Sales-PardoM #and# AmaralLAN , title = {{Modularity from Fluctuations in Random Graphs and Complex Networks}} , journal = j-pr-e , number = 025101 , url = "http://arxiv.org/abs/cond-mat/0403660v2" , volume = 70 , year = 2004 } @InProceedings{gss-babc-08 , author = GeisbergerR #and# SandersP #and# SchultesD , title = {{Better Approximation of Betweenness Centrality}} , booktitle = {{Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08)}} , month = apr , pages = {90--100} , publisher = pub-siam , year = 2008 } @InProceedings{gssd-chfsh-08 , author = GeisbergerR #and# SandersP #and# SchultesD #and# DellingD , title = {{Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks}} , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}} , month = jun , pages = {319--333} , pdf = "http://i11www.ira.uka.de/extra/publications/gssd-chfsh-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5038 , year = 2008 } @Article{gssv-erlrn-12 , author = GeisbergerR #and# SandersP #and# SchultesD #and# VetterC , title = {{Exact Routing in Large Road Networks Using Contraction Hierarchies}} , journal = j-ts , month = aug , number = 3 , pages = {388--404} , volume = 46 , year = 2012 } @article{gst-egbdss-98 , author = GriggsJR #and# SimonovitsM #and# ThomasGR , title = {{Extremal graphs with bounded densities of small subgraphs}} , journal = j-jgt , number = 3 , pages = {185--207} , volume = 29 , year = 1998 } @techreport{gsw-dcgc-11 , author = GoerkeR #and# SchummA #and# WagnerD , title = {{Density-Constrained Graph Clustering}} , institution = kit_wagner , note = {Karlsruhe Reports in Informatics 2011-17} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1715676" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023084" , year = 2011 } @InProceedings{gsw-dcgc-11b , author = GoerkeR #and# SchummA #and# WagnerD , title = {{Density-Constrained Graph Clustering}} , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}} , month = aug , pages = {679--690} , publisher = pub-springer , series = ser-springer_lncs , url = "http://link.springer.com/chapter/10.1007/978-3-642-22300-6_58?null" , volume = 6844 , year = 2011 } @unpublished{gsw-edcgc-11 , author = GoerkeR #and# SchummA #and# WagnerD , title = {{Experiments on Density-Constrained Graph Clustering}} , month = dec , note = {arXiv report} , publisher = pub-apraha , series = ser-ac , url = "http://arxiv.org/abs/1112.2143v1" , year = 2011 } @InProceedings{gsw-edcgc-12 , author = GoerkeR #and# SchummA #and# WagnerD , title = {{Experiments on Density-Constrained Graph Clustering}} , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}} , pages = {1--15} , pdf = "http://i11www.ira.uka.de/extra/publications/gsw-edcgc-12.pdf" , publisher = pub-siam , url = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/013.pdf" , year = 2012 } @InProceedings{gt-ccurp-95 , author = GargA #and# TamassiaR , title = {{On the Computational Complexity of Upward and Rectilinear Planarity Testing}} , booktitle = {{DIAMCS International Workshop}} , location = "Princeton, New Jersey, USE" , month = jan , pages = {286--297} , pdf = "http://www.springerlink.com/content/p04802154821p278/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/p04802154821p278/" , volume = 894 , year = 1995 } @InProceedings{gt-cta-99 , author = GoldbergAV #and# TsioutsiouliklisK , title = {{Cut Tree Algorithms}} , booktitle = {{Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)}} , pages = {376--385} , publisher = pub-siam , url = "http://portal.acm.org/citation.cfm?id=314590" , year = 1999 } @article{gt-ctaes-01 , author = GoldbergAV #and# TsioutsiouliklisK , title = {{Cut Tree Algorithms: An Experimental Study}} , journal = j-jalg , month = jan , number = 1 , pages = {51--83} , volume = 38 , year = 2001 } @Book{gt-epdes-08 , author = GilbargD #and# TrudingerNS , title = {{Elliptic Partial Differential Equations of Second Order}} , booktitle = {{Elliptic Partial Differential Equations of Second Order}} , publisher = pub-springer , year = 2008 } @Article{gt-fsanp-89 , author = GabowHN #and# TarjanR , title = {{Faster Scaling Algorithms for Network Problems}} , journal = j-sicomp , number = 5 , pages = {1013--1036} , volume = 18 , year = 1989 } @Article{gt-namfp-88 , author = GoldbergAV #and# TarjanRE , title = {{A new approach to the maximum-flow problem}} , journal = j-acm , number = 4 , pages = {921--940} , pdf = "http://akira.ruc.dk/~keld/teaching/algoritmedesign_f03/artikler/08/goldberg88.pdf" , volume = 35 , year = 1988 } @InProceedings{gt-nmcfa-97 , author = GargA #and# TamassiaR , title = {{A New Minimum Cost Flow Algorithm with Applications to Graph Drawing}} , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}} , location = "Berkeley, California, USA" , month = jan , pages = {201--226} , pdf = "http://www.springerlink.com/content/l7461p241v868166/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/l7461p241v868166/" , volume = 1090 , year = 1997 } @InProceedings{gt-pdara-94 , author = GargA #and# TamassiaR , title = {{Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)}} , booktitle = {{Proceedings of the 2nd Annual European Symposium on Algorithms (ESA'94)}} , month = sep , pages = {12--23} , pdf = "http://www.springerlink.com/content/x5n04323wx67t41n/fulltext.pdf" , series = ser-springer_lncs , url = "http://www.springerlink.com/content/x5n04323wx67t41n/" , volume = 855 , year = 1994 } @Book{gt-tgt-87 , author = GrossJL #and# TuckerTW , title = {{Topological Graph Theory}} , booktitle = {{Topological Graph Theory}} , publisher = pub-wiley , series = ser-wisdmo , year = 1987 } @Article{gt-upt-95 , author = GargA #and# TamassiaR , title = {{Upward Planarity Testing}} , journal = j-order , month = jun , number = 2 , pages = {109--133} , pdf = "http://www.springerlink.com/content/g732801901558738/fulltext.pdf" , url = "http://www.springerlink.com/content/g732801901558738/" , volume = 12 , year = 1995 } @misc{gtf , author = gtf , title = {{\url{https://developers.google.com/transit/gtfs/}}} , year = 2010 } @InProceedings{gv-errnt-11 , author = GeisbergerR #and# VetterC , title = {{Efficient Routing in Road Networks with Turn Costs}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {100--111} , pdf = "http://algo2.iti.kit.edu/download/turn_ch.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 6630 , year = 2011 } @Article{gw-afdpg-00 , author = GoodrichMT #and# WagnerCG , title = {{A Framework for Drawing Planar Graphs with Curves and Polylines}} , journal = j-jalg , number = 2 , pages = {399--421} , volume = 37 , year = 2000 } @InProceedings{gw-ccv-05 , author = GoerkeR #and# WolffA , title = {{Constructing the City Voronoi diagram faster}} , booktitle = {{Proceedings of the 21st European Workshop on Computational Geometry (EWCG'05)}} , month = mar , pages = {155--158} , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gw-ccvdf-05a.pdf" , year = 2005 } @InProceedings{gw-ccv-05a , author = GoerkeR #and# WolffA , title = {{Constructing the City Voronoi diagram faster}} , booktitle = {{Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering (VD'05)}} , month = oct , note = {Best Presentation Award} , pages = {162--172} , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gw-ccvdf-05.pdf" , year = 2005 } @InProceedings{gw-cppsp-05 , author = GoldbergAV #and# WerneckR , title = {{Computing Point-to-Point Shortest Paths from External Memory}} , booktitle = {{Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05)}} , pages = {26--40} , pdf = "http://i11www.ira.uka.de/extra/publications/gw-cppsp-05.pdf" , publisher = pub-siam , year = 2005 } @InProceedings{gw-hmdde-05 , author = GaertlerM #and# WagnerD , title = {{A Hybrid Model for Drawing Dynamic and Evolving Graphs}} , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}} , doi = "http://dx.doi.org/10.1007/11618058_18" , month = jan , pages = {189--200} , pdf = "http://www.springerlink.com/content/711061543691865v/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/711061543691865v/" , volume = 3843 , year = 2006 } @InCollection{gw-vlcn-07 , author = GaertlerM #and# WagnerD , title = {{Visualizing Large and Complex Networks}} , booktitle = {{Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science}} , pages = {115--132} , publisher = pub-wsp , series = ser-csic , volume = 2 , year = 2007 } @Article{gws-ccv-08 , author = GoerkeR #and# WolffA #and# ShinC , title = {{Constructing the City Voronoi diagram faster}} , journal = j-ijcga , month = aug , number = 4 , pages = {275--294} , pdf = "http://i11www.ira.uka.de/extra/publications/gws-ccv-08.pdf" , url = "http://dx.doi.org/10.1142/S0218195908002623" , volume = 18 , year = 2008 } %% -------------------------------------------------------------- @Book{h-aanpp-96 , editor = HochbaumDS , title = {{Approximation Algorithms for NP-hard Problems}} , booktitle = {{Approximation Algorithms for NP-hard Problems}} , publisher = pub-cti , year = 1996 } @Book{h-ahp-04 , author = HromkovicJ , title = {{Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics}} , booktitle = {{Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics}} , publisher = pub-springer , series = ser-ttcs , year = 2004 } @Book{h-ai-10 , editor = HolldoblerS , title = {{Ausgezeichnete Informatikdissertationen 2009}} , booktitle = {{Ausgezeichnete Informatikdissertationen 2009}} , series = ser-lni , volume = {D-10} , year = 2010 } @Book{h-amibw-99 , editor = HorsterP , title = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}} , booktitle = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}} , publisher = pub-v , year = 1999 } @mastersthesis{h-anpcp-07 , author = HuangL , title = {{A Nodes Perspective of Changing Properties in Dynamic Graphs}} , month = dec , note = {Diplomarbeit Informatik} , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/da-huang-07.pdf" , school = inf_ka , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished" , year = 2007 } @InProceedings{h-apdmf-59 , author = HaibtLM , title = {{A Program to Draw Multilevel Flow Charts}} , booktitle = {{Proceedings of the Western Joint Computing Conference 1959}} , pages = {131--137} , year = 1959 } @mastersthesis{h-appsp-07 , author = HilgerM , title = {{Accelerating Point-to-Point Shortest Path Computations in Large Scale Networks}} , school = "Technische Universit{\"a}t Berlin" , year = 2007 } @article{h-aripc-95 , author = HsuW , title = {{$\cal{O}$({MN}) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs}} , journal = "SIAM Journal on" , pages = {411--439} , volume = 24 , year = 1995 } @unpublished{h-assbc-05 , author = HertelA , title = {{A Survey \& Strengthening of Barnette's Conjecture}} , note = {http://www.cs.utoronto.ca/~ahertel/} , year = 2005 } @InCollection{h-bpp-79 , author = HansenP , title = {{Bricriteria Path Problems}} , booktitle = {{Multiple Criteria Decision Making -- Theory and Application --}} , pages = {109--127} , publisher = pub-springer , year = 1979 } @Article{h-c-03 , author = HartvigsenD , title = {{Characterizing the flow equivalent trees of a network}} , journal = j-dam , month = jun , number = {2-3} , pages = {387 --394} , volume = 128 , year = 2003 } @book{h-ca-37 , author = HartiganJA , title = {{Clustering Algorithms}} , isbn = "0-471-35645-X" , publisher = pub-wileys , series = ser-wiley_ps , year = 1937 } @article{h-cbg-63 , author = HararyF , title = {{A Characterization of Block-Graphs}} , journal = j-can-math-bull , month = jan , number = 1 , pages = {1--6} , volume = 6 , year = 1963 } @article{h-cc-83 , author = HararyF , title = {{Conditional Connectivity}} , journal = j-networks , pages = {347--357} , volume = 13 , year = 1983 } @mastersthesis{h-cccaa-11 , author = HamannM , title = {{Complete hierarchical Cut-Clustering: An Analysis of Guarantee and Quality}} , note = {http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished} , school = "Department of Informatics, Karlsruhe Institute of Technology (KIT)" , type = {Bachelor's thesis} , year = 2011 } @article{h-cctfcn-03 , author = HolmeP , title = {{Congestion and centrality in traffic flow on complex networks}} , journal = j-acs , number = 2 , pages = {163-176} , volume = 6 , year = 2003 } @mastersthesis{h-cdggq-08 , author = HartmannT , title = {{Clustering Dynamic Graphs with Guaranteed Quality}} , institution = uni_ka , month = oct , note = {Diplomarbeit} , pdf = "http://i11www.ira.uka.de/extra/publications/h-cdggq-08.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished#diplomarbeiten" , year = 2008 } @InProceedings{h-cecdv-96 , author = HealeyCG , title = {{Choosing Effective Colours for Data Visualization}} , booktitle = {{Proceedings of the 7th IEEE Conference on Visualization '96 (VIS'96)}} , pages = {263--270} , publisher = pub-ics , url = "http://portal.acm.org/citation.cfm?id=244979.245597" , year = 1996 } @article{h-cha-99 , author = HastadJ , title = {{Clique is hard to approximate within $n^{1-\varepsilon}$}} , journal = j-actam , pages = {105--142} , volume = 182 , year = 1999 } @Book{h-dcn-08 , author = HoeferM , title = {{Distributed Competition in Networks}} , booktitle = {{Distributed Competition in Networks}} , publisher = pub-vdmvdmk , year = 2008 } @Article{h-dqpa-70 , author = HallKM , title = {{An r-Dimensional Quadratic Placement Algorithm}} , journal = j-msci , month = nov , number = 3 , pages = {219--229} , volume = 17 , year = 1970 } @Article{h-ebmn , author = HutschenreutherH , title = {{Einfacher Beweis des Matrix-Ger{\"u}st-Satzes der Netzwerktheorie}} , journal = j-wzthi , pages = {403--404} , volume = 13 , year = 1967 } @Article{h-egpdc-74 , author = HakimiSL , title = {{On the Existence of Graphs with Prescribed Degrees and Connectivity}} , journal = j-sijam , month = jan , number = 1 , pages = {154--164} , url = "http://www.jstor.org/view/00361399/di974678/97p0378s/0" , volume = 26 , year = 1974 } @phdthesis{h-epssp-08 , author = HolzerM , title = {{Engineering Planar-Separator and Shortest-Path Algorithms}} , institution = uni_ka , school = "Karlsruhe Institute of Technology (KIT) - Department of Informatics" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009237" , year = 2008 } @incollection{h-ev-79 , author = HaemersW , title = {{Eigenvalue Methods}} , booktitle = {{Packing and Covering in Combinatorics}} , pages = {15--38} , publisher = pub-mc , year = 1979 } @Article{h-fac-93 , author = HingoraniNG , title = {{Flexible AC transmission}} , journal = j-ieees , month = apr , number = 4 , pages = {40--45} , url = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=153872" , volume = 30 , year = 1993 } @inproceedings{h-gc-83 , author = HararyF , title = {{General Connectivity}} , booktitle = {{Proceedings of the 1st Southeast Asian Graph Theory Colloquium}} , pages = {83--92} , publisher = pub-springer , series = ser-springer_lnm , volume = 1073 , year = 1984 } @Article{h-gecpg-97 , author = HeXi , title = {{Grid Embedding of 4-Connected Plane Graphs}} , journal = dcg , number = 3 , pages = {339--358} , volume = 17 , year = 1997 } @Book{h-ggiv-94 , editor = HeckbertPS , title = {{Graphics Gems IV}} , booktitle = {{Graphics Gems IV}} , year = 1994 } @misc{h-ginc-06 , author = HopnerM , title = {{{G}ermany INC 1996 - 2002: The Dissolution of the {G}erman Company Network}} , pdf = "http://www.socio.ethz.ch/modsim/tagungen/koeln06/Krempel_koeln06.pdf" , year = 2006 } @article{h-gpm-85 , author = HendryG , title = {{On graphs with a prescribed median. I}} , journal = j-jgt , pages = {477-487} , volume = 9 , year = 1985 } @Book{h-gt-69 , author = HararyF , title = {{Graph Theory}} , booktitle = {{Graph Theory}} , publisher = pub-aw , year = 1969 } @phdthesis{h-h-07 , author = HeldenG , title = {{Hamiltonicity of maximal planar graphs and planar triangulations}} , school = "RWTH Aachen" , url = "http://darwin.bth.rwth-aachen.de/opus3/volltexte/2007/1949/" , year = 2007 } @Article{h-hebva-06 , author = HoltenD , title = {{Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data}} , journal = j-tvcg , number = 5 , pages = {741--748} , volume = 12 , year = 2006 } @mastersthesis{h-hstsp-03 , author = HolzerM , title = {{Hierarchical Speed-up Techniques for Shortest-Path Algorithms}} , month = feb , pdf = "http://i11www.ira.uka.de/algo/people/mholzer/publications/pdf/h-hstsp-03.pdf" , school = "University of Konstanz" , year = 2003 } @article{h-ioaci-65 , author = HubbellCH , title = {{In Input-Output Approach to Clique Identification}} , journal = j-socm , pages = {377--399} , volume = 28 , year = 1965 } @InProceedings{h-iram-00 , author = HagerupT , title = {{Improved shortest paths on the word RAM}} , booktitle = {{Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'00)}} , pages = {61--72} , series = ser-springer_lncs , year = 2000 } @article{h-mcg-62 , author = HararyF , title = {{The maximum connectivity of a graph}} , journal = j-pnas , month = jul , number = 7 , pages = {1142--1146} , volume = 48 , year = 1962 } @Book{h-mgma-85 , author = HackbuschW , title = {{Multi-Grid Methods and Applications}} , booktitle = {{Multi-Grid Methods and Applications}} , publisher = pub-springer , series = ser-sscm , year = 1985 } @inproceedings{h-ngdcm-89 , author = HolbertK , editor = KulliVR , title = {{A note on graphs with distant center and median}} , address = "Gulbarza, India" , booktitle = {{Recent Studies in Graph Theory}} , pages = {155-158} , publisher = {Vishwa International} , year = 1989 } @article{h-ocsp-74 , author = HuTC , title = {{Optimum communication spanning trees}} , journal = j-sicomp , pages = {188--195} , volume = 3 , year = 1974 } @Article{h-ofppg-99 , author = HeXi , title = {{On Floor-Plan of Plane Graphs}} , journal = j-sicomp , number = 6 , pages = {2150--2167} , volume = 28 , year = 1999 } @Article{h-ofrdp-93 , author = HeXi , title = {{On Finding the Rectangular Duals of Planar Triangular Graphs}} , journal = j-sicomp , pages = {1218--1226} , volume = 22 , year = 1993 } @article{h-olsca-64 , author = HakimiSL , title = {{Optimum location of switching centers and the absolute centers and medians of a graph}} , journal = j-or , pages = {450--459} , volume = 12 , year = 1964 } @article{h-pisbrv-63 , author = HoeffdingW , title = {{Probability inequalities for sums of bounded random variables}} , journal = j-jasa , number = 301 , pages = {713-721} , volume = 58 , year = 1963 } @Article{h-refg-55 , author = HavelV , title = {{A Remark on the Existence of Finite Graphs (in Czech)}} , journal = j-cpm , pages = {477--480} , volume = 80 , year = 1955 } @Article{h-rsidv-62 , author = HakimiSL , title = {{On Realizability of a Set of Integers as Degrees of the Vertices of a Graph. I}} , journal = j-siam , month = sep , number = 3 , pages = {496--506} , url = "http://www.jstor.org/view/03684245/di974608/97p0075x/0" , volume = 10 , year = 1962 } @Article{h-rsidvlg-62 , author = HakimiSL , title = {{On the Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph}} , journal = j-sijam , month = sep , number = 31 , pages = {496--506} , volume = 10 , year = 1962 } @Article{h-s-01 , author = HastadJ , title = {{Some optimal inapproximability results}} , journal = j-acm , month = jul , number = 4 , pages = {798--859} , volume = 48 , year = 2001 } @article{h-sc-59 , author = HararyF , title = {{Status and contrastatus}} , journal = j-socm , pages = {23--43} , volume = 22 , year = 1959 } @misc{h-sgita-07 , author = HuangL , title = {{Survey on Generators for Internet Topologies at the AS Level}} , month = jan , note = {Studienarbeit Informatik} , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-huang-07.pdf" , school = inf_ka , year = 2007 } @habilitation{h-srwve-03 , author = HausbergerS , title = {{Simulation of Real World Vehicle Exhaust Emissions}} , publisher = {Verlag der Technisch} , school = "Technische Universit{\"a}t Graz" , series = ser-mivt , volume = 82 , year = 2003 } @mastersthesis{h-tdgcp-08 , author = HubnerF , title = {{The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map}} , institution = uni_ka , month = may , note = {Diplomarbeit} , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/da-huebner-08.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished" , year = 2008 } @InCollection{h-tppdp-94 , author = HillFSJr , title = {{The Pleasures of ``Perp Dot'' Products}} , booktitle = {{Graphics Gems IV}} , pages = {138--148} , year = 1994 } @article{h-tspr-03 , author = HaveliwalaTH , title = {{Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search}} , journal = j-tkde , number = 4 , pages = {784--796} , volume = 15 , year = 2003 } @misc{hacon , author = hacon , title = {{\url{http://www.hacon.de}}} , year = 1984 } @InProceedings{hb-aipmn-01 , author = HeinM #and# BuhlerT , title = {{An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA}} , booktitle = {{Advances in Neural Information Processing Systems 23}} , pages = {847--855} , year = 2010 } @techreport{hb-est-07 , author = HartwigS #and# BuchmannM , title = {{Empty Seats Travelling}} , institution = "Nokia Research Center" , pdf = "http://research.nokia.com/files/NRC-TR-2007-003.pdf" , year = 2007 } @Article{hbb-m-09 , author = HolmstromE #and# BockN #and# BrannlundJ , title = {{Modularity density of network community divisions}} , journal = j-pdnp , number = 14 , pages = {1161--1167} , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TVK-4W0SJW8-1-R&_cdi=5537&_user=2149863&_p" , url = "http://www.sciencedirect.com/science/article/B6TVK-4W0SJW8-1/2/7d38fa63fc0a63a5adea7711ad44d741" , volume = 238 , year = 2009 } @misc{hbefa21 , author = infras , title = {{Handbook of Emission Factors for Road Transport 2.1}} , month = feb , url = "http://www.hbefa.net/" , year = 2004 } @misc{hbefa31 , author = infras , title = {{Handbook of Emission Factors for Road Transport 3.1}} , month = jan , url = "http://www.hbefa.net/" , year = 2010 } @Article{hbv-ocvt-01 , author = HalkidiM #and# BatistakisY #and# VazirgiannisM , title = {{On Clustering Validation Techniques}} , journal = j-jiis , pages = {107--145} , pdf = "http://www3.itu.edu.tr/~sgunduz/courses/verimaden/paper/validity_survey.pdf" , volume = 17 , year = 2001 } @InProceedings{hcb-eecpw-05 , author = HeinzelmanWR #and# ChandrakasanA #and# BalakrishnanH , title = {{Energy-Efficient Communication Protocol for Wireless Microsensor Networks}} , booktitle = {{Proceedings of the 33rd Hawaii International Conference on System Sciences}} , month = jan , pages = 8020 , url = "http://doi.ieeecomputersociety.org/10.1109/HICSS.2000.926982" , volume = 8 , year = 2000 } @InProceedings{hdb-f-04 , author = HohltB #and# DohertyL #and# BrewerEA , title = {{Flexible power scheduling for sensor networks}} , booktitle = {{Third International Symposium on Information Processing in Sensor Networks (IPSN 2004)}} , pages = {205--214} , publisher = pub-ics , url = "http://doi.acm.org/10.1145/984622.984653" , year = 2004 } @InProceedings{hdkms-ivaq-07 , author = HaoMC #and# DayalU #and# KeimDA #and# MorentD #and# SchneidewindJ , title = {{Intelligent Visual Analytics Queries}} , booktitle = {{IEEE Symposium on Visual Analytics and Technology (VAST 2007)}} , month = oct , pages = {91--98} , publisher = pub-ieeecs , url = "http://www.ieeexplore.ieee.org/xpls/abs_all.jsp?tp=&arnumber=4389001&isnumber=4388977" , year = 2007 } @InProceedings{hel-affcd-05 , author = HuangXi #and# EadesP #and# LaiW , title = {{A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization}} , booktitle = {{Proceedings of the Twenty-eighth Australasian conference on Computer Science}} , pages = {87--96} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1082171&type=pdf&coll=GUIDE&dl=GUIDE&CFID=20025274&CFTOKEN=3" , publisher = pub-acsi , url = "rtal.acm.org/citation.cfm?id=1082161.1082171" , year = 2005 } @InProceedings{heql-daspd-99 , author = HongS #and# EadesP #and# QuigleyA #and# LeeS , title = {{Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions}} , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}} , location = "Montreal, Canada" , month = jan , pages = {198--209} , pdf = "http://www.springerlink.com/content/fmb2gl991y4gdp3a/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/fmb2gl991y4gdp3a/" , volume = 1547 , year = 1999 } @article{hf-lbfdc-98 , author = HenzingerM #and# FredmanML , title = {{Lower Bounds for Fully Dynamic Connectivity Problems in Graphs}} , journal = j-alg , month = nov , number = 3 , pages = {351--362} , volume = 22 , year = 1998 } @InProceedings{hg-p-88 , author = HochbaumDS #and# GoldsmithDL , title = {{Polynomial algorithm for the k-cut problem}} , booktitle = {{Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS'88)}} , pages = {444--451} , publisher = pub-ics , url = "http://dx.doi.org/10.1109/SFCS.1988.21960" , year = 1988 } @Article{hgl-o-08 , author = HeilpornG #and# GiovanniLD #and# LabbeM , title = {{Optimization models for the single delay management problem in public transportation}} , journal = j-ejor , pages = {762--774} , volume = 189 , year = 2008 } @Article{hh-ecn-95 , author = HararyF #and# HageP , title = {{Eccentricity and centrality in networks}} , journal = j-sn , pages = {57--63} , url = "http://dx.doi.org/10.1016/0378-8733(94)00248-9" , volume = 17 , year = 1995 } @book{hh-sma-83 , author = HageP #and# HararyF , title = {{Structural models in anthropology}} , edition = first , publisher = pub-cup , year = 1983 } @InCollection{hhw-chcca-13 , author = HamannM #and# HartmannT #and# WagnerD , title = {{Complete Hierarchical Cut-Clustering: A Case Study on Expansion and Modularity}} , note = {tp appear} } @InProceedings{hhw-hpcc-13 , author = HamannM #and# HartmannT #and# WagnerD , title = {{Hierarchies of Predominantly Connected Communities}} , booktitle = {{Algorithms and Data Structures, 13th International Symposium (WADS'13)}} , note = {to appear} , publisher = pub-springer , series = ser-springer_lncs , year = 2013 } @Article{hjnwc-vnlan-98 , author = HuffakerB #and# JungJ #and# NemethE #and# WesselsD #and# ClaffyK , title = {{Visualization of the growth and topology of the NLANR caching hierarchy}} , journal = j-cn_isdn , month = nov , number = {22-23} , pages = {2131--2139} , url = "http://dx.doi.org/10.1016/S0169-7552(98)00239-6" , volume = 30 , year = 1998 } @InProceedings{hjr-egcpq-96 , author = HuangYW #and# JingN #and# RundensteinerEA , title = {{Effective Graph Clustering for Path Queries in Digital Maps}} , booktitle = {{Proceedings of the 5th International Conference on Information and Knowledge Management}} , pages = {215--222} , publisher = pub-acm , year = 1996 } @article{hk-avcn-02 , author = HolmeP #and# KimBJ #and# YoonCN #and# HanSK , title = {{Attack vulnerability of complex networks}} , journal = j-pr-e , number = 056109 , volume = 65 , year = 2002 } @inproceedings{hk-csdrw-01 , author = HarelD #and# KorenY , title = {{Clustering spatial data using random walks}} , booktitle = {{Proceedings of the seventh ACM SIGKDD international conference on Knowledge Discovery and Data Mining}} , doi = "http://doi.acm.org/10.1145/502512.502552" , isbn = "1-58113-391-X" , location = "San Francisco, California" , pages = {281--286} , publisher = pub-acm , year = 2001 } @InProceedings{hk-curw-01 , author = HarelD #and# KorenY , title = {{On Clustering Using Random Walks}} , booktitle = {{Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science}} , pages = {18--41} , publisher = pub-springer , series = ser-springer_lncs , volume = 2245 , year = 2001 } @InProceedings{hk-dgnuv-02 , author = HarelD #and# KorenY , title = {{Drawing Graphs with Non-Uniform Vertices}} , booktitle = {{Proceedings of the 6th Working Conference on Advanced Visual Interfaces (AVI'02)}} , pages = {157--166} , publisher = pub-acm , url = "http://citeseer.ist.psu.edu/harel02drawing.html" , year = 2002 } @techreport{hk-fdeca-97 , author = HenzingerM #and# KingV , title = {{Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation}} , address = "Palo Alto, California" , institution = "Digital Equipment Corporation, Systems Research Center" , month = jun , number = {1997-004a} , type = {SRC Technical Note} , year = 1997 } @article{hk-gcg-64 , author = HararyF #and# KodamaY , title = {{On the genus of an $n$-connected graph}} , journal = j-fm , pages = {7--13} , volume = 54 , year = 1964 } @InProceedings{hk-gdhde-03 , author = HarelD #and# KorenY , title = {{Graph Drawing by High-Dimensional Embedding}} , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {299--345} , pdf = "http://www.springerlink.com/content/u38pbq16hb7qt87u/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/u38pbq16hb7qt87u/" , volume = 2528 , year = 2003 } @Article{hk-gdhde-04 , author = HarelD #and# KorenY , title = {{Graph Drawing by High-Dimensional Embedding}} , journal = j-jgaa , number = 2 , pages = {195--214} , pdf = "http://www.emis.ams.org/journals/JGAA/accepted/2004/HarelKoren2004.8.2.pdf" , url = "http://www.emis.ams.org/journals/JGAA/volume08.html" , volume = 8 , year = 2004 } @article{hk-mmtb-79 , author = HararyF #and# KommelH , title = {{Matrix measures for transitivity and balance}} , journal = j-jms , pages = {199--210} , volume = 6 , year = 1979 } @InProceedings{hk-pccoc-93 , author = HeXi #and# KaoM , title = {{Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs}} , booktitle = {{Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93)}} , pages = {303--312} , publisher = pub-springer , series = ser-springer_lncs , volume = 762 , year = 1993 } @techreport{hk-pgcn-03 , author = HopnerM #and# KrempelL , title = {{The Politics of the {G}erman Company Network}} , institution = "MPI f{\"ur} Gesellschaftsforschung" , number = {03/9} , url = "http://www.mpi-fg-koeln.mpg.de/pu/workpap/wp03-9/wp03-9.html" , year = 2003 } @Article{hk-pgcn-04 , author = HopnerM #and# KrempelL , title = {{The Politics of the {G}erman Company Network}} , journal = j-cc , month = dec , number = 4 , pages = {339--356} , url = "http://dx.doi.org/10.1080/1024259042000304392" , volume = 8 , year = 2004 } @InProceedings{hk-reldp-95 , author = HeXi #and# KaoM , title = {{Regular Edge Labelings and Drawings of Planar Graphs}} , booktitle = {{DIAMCS International Workshop}} , location = "Princeton, New Jersey, USE" , month = jan , pages = {96--103} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/pt8051p2070j/" , volume = 894 , year = 1995 } @techreport{hk-tsegm-03 , author = HaveliwalaTH #and# KamvarSD , title = {{The second eigenvalue of the Google Matrix}} , institution = "Stanford University" , month = {Mar} , year = 2003 } @techreport{hkj-aacap-03 , author = HaveliwalaTH #and# KamvarSD #and# JehG , title = {{An analytical comparison of approaches to personalized PageRank}} , institution = "Stanford University" , month = {Jun} , year = 2003 } @techreport{hkkmg-cprpe-03 , author = HaveliwalaTH #and# KamvarSD #and# KleinD #and# ManningCD #and# GolubGH , title = {{Computing PageRank using Power extrapolation}} , institution = "Stanford University" , month = {Jul} , year = 2003 } @Article{hkks-tecl-04 , author = HopcroftJE #and# KhanO #and# KulisB #and# SelmanB , title = {{Tracking Evolving Communities in Large Linked Networks}} , journal = j-pnas , month = apr , pdf = "http://www.pnas.org/content/101/suppl.1/5249.abstract" , url = "http://www.pnas.org/content/101/suppl.1/5249.abstract" , volume = 101 , year = 2004 } @Article{hkl-ltsep-99 , author = HeXi #and# KaoM #and# LuH , title = {{Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings}} , journal = j-sidma , month = sep , number = 3 , pages = {317--325} , volume = 12 , year = 1999 } @InProceedings{hkms-fppsp-06 , author = HilgerM #and# KoehlerE #and# MoehringR #and# SchillingH , title = {{Fast Point-to-Point Shortest Path Computations with Arc-Flags}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}} , month = nov , year = 2006 } @InCollection{hkms-fppsp-09 , author = HilgerM #and# KoehlerE #and# MoehringR #and# SchillingH , title = {{Fast Point-to-Point Shortest Path Computations with Arc-Flags}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {41--72} , pdf = "http://i11www.ira.uka.de/extra/publications/hkms-fppsp-08.pdf" , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @unpublished{hkmst-zoldho-04 , author = HolzapfelK #and# KosubS #and# MaassMG #and# SouzaA #and# TaeubigH , title = {{A zero-one law for densities of higher order}} , note = {Manuscript} , year = 2004 } @inproceedings{hkmt-cdfdc-03 , author = HolzapfelK #and# KosubS #and# MaassMG #and# TaeubigH , title = {{The complexity of Detecting Fixed-Density Clusters}} , booktitle = {{Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC'03)}} , pages = {201--212} , publisher = pub-springer , series = ser-springer_lncs , volume = 2653 , year = 2003 } @InBook{hkn-dctrs-03 , author = HoTB #and# KawasakiS #and# NguyenNB , title = {{Documents Clustering Using Tolerance Rough Set Model and Its Application to Information Retrieval}} , address = "Heidelberg, Germany, Germany" , isbn = "3-7908-1529-2" , pages = {181--196} , publisher = pub-physica , url = "http://portal.acm.org/citation.cfm?id=941727&dl=&coll=GUIDE&CFID=15151515&CFTOKEN=6184618#" , year = 2003 } @Article{hkrs-fspap-97 , author = HenzingerM #and# KleinPN #and# RaoS #and# SubramanianA , title = {{Faster Shortest-Path Algorithms for Planar Graphs}} , journal = j-css , month = aug , number = 1 , pages = {3--23} , volume = 55 , year = 1997 } @Article{hkw-icg-13 , author = HartmannT #and# KappesA #and# WagnerD , title = {{Identifikation von Clustern in Graphen}} , journal = j-is , number = 2 , pages = {144--152} , url = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00287-013-0685-0" , volume = 36 , year = 2013 } @InProceedings{hl-amapg-95 , author = HendricksonB #and# LelandR , title = {{A Multilevel Algorithm for Partitioning Graphs}} , booktitle = {{Proceedings of the 1995 ACM/IEEE conference on Supercomputing (SC'05)}} , pages = 28 , publisher = pub-acm , year = 1995 } @techreport{hl-cfabf-97 , author = HenzingerM #and# LaPoutreJA , title = {{Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs}} , address = "Palo Alto, California" , institution = "Digital Equipment Corporation, Systems Research Center" , month = sep , number = {1997-021} , type = {SRC Technical Note} , year = 1997 } @article{hl-ef-81 , author = HollandPW #and# LeinhardtS , title = {{An Exponential Family of Probability Distributions for Directed Graphs}} , journal = j-jasa , month = mar , number = 373 , pages = {33--50} , volume = 76 , year = 1981 } @misc{hl-tcugv-95 , author = HendricksonB #and# LelandR , title = {{The Chaco User's Guide Version 2.0}} , institution = "Sandia National Laboratories Albuquerque, NM" , pdf = "http://www.sandia.gov/~bahendr/papers/guide.ps" , url = "http://www.sandia.gov/~bahendr/chaco.html" , year = 1995 } @article{hll-sb-83 , author = HollandPW #and# LaskeyKB #and# LeinhardtS , title = {{Stochastic Blockmodels: First Steps}} , journal = j-sn , pages = {109--137} , volume = 5 , year = 1983 } @InProceedings{hlsww-lnsrn-04 , author = HamacherHW #and# LiebersA #and# SchoebelA #and# WagnerF #and# WagnerD , title = {{Locating New Stops in a Railway Network}} , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}} , pages = {13--23} , pdf = "http://kluedo.ub.uni-kl.de/volltexte/2001/1263/pdf/gelb_76.pdf" , series = ser-entcs , url = "http://kluedo.ub.uni-kl.de/volltexte/2001/1263/index.html" , volume = 92 , year = 2004 } @article{hlt-pldfda-01 , author = HolmJ #and# LichtenbergK #and# ThorupM , title = {{Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, $2$-Edge, and Biconnectivity}} , journal = j-acm , month = jul , number = 4 , pages = {723--760} , volume = 48 , year = 2001 } @Article{hlw-e-06 , author = HooryS #and# LinialN #and# WigdersonA , title = {{Expander graphs and their applications}} , journal = j-bull-ams , pages = {439--561} , volume = 43 , year = 2006 } @Article{hm-avlsi-85 , author = HochbaumDS #and# MaassW , title = {{Approximation schemes for covering and packing problems in image processing and VLSI}} , journal = j-acm , month = jan , number = 1 , pages = {130--136} , volume = 32 , year = 1985 } @Article{hm-cgl-98 , author = HeW #and# MarriottK , title = {{Constrained Graph Layout}} , journal = j-const , month = oct , number = 4 , pages = {289--314} , pdf = "http://www.csse.monash.edu.au/~marriott/HeMar98.pdf" , url = "http://www.springerlink.com/content/w75t01q7j0375182/" , volume = 3 , year = 1998 } @InProceedings{hm-gsmrs-09 , author = HongS #and# MaderM , title = {{Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints}} , booktitle = {{Proceedings of the 16th International Symposium on Graph Drawing (GD'08)}} , pages = {278--283} , publisher = pub-springer , series = ser-springer_lncs , volume = 5417 , year = 2009 } @InProceedings{hm-ttblb-12 , author = HalldorssonMM #and# MitraPra , title = {{Towards Tight Bounds for Local Broadcasting}} , booktitle = {{The Eighth ACM International Workshop on Foundations of Mobile Computing}} , month = jul , publisher = pub-acm , year = 2012 } @Article{hmc-p-10 , author = HGB #and# MontjoyeYd #and# ClausetA , title = {{Performance of modularity maximization in practical contexts}} , journal = j-phre , number = 046106 , pdf = "http://pre.aps.org/pdf/PRE/v81/i4/e046106" , url = "http://pre.aps.org/abstract/PRE/v81/i4/e046106" , volume = 81 , year = 2010 } @misc{hmc-t-09 , author = HGB #and# MontjoyeYd #and# ClausetA , title = {{The performance of modularity maximization in practical contexts}} , month = oct , url = "http://arxiv.org/abs/0910.0165" , year = 2009 } @Article{hmm-gvniv-00 , author = HermanI #and# MelanconG #and# MarshallMS , title = {{Graph Visualization and Navigation in Information Visualization: a Survey }} , journal = j-tvcg , month = jan , number = 1 , pages = {24--43} , url = "http://doi.ieeecomputersociety.org/10.1109/2945.841119" , volume = 6 , year = 2000 } @Article{hmpv-lbfs-00 , author = HabibM #and# McConnellR #and# PaulC #and# ViennotL , title = {{Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing}} , journal = j-tcs , month = mar , number = {1-2} , pages = {59--84} , volume = 234 , year = 2000 } @Book{hmu-iatlc- , author = HopcroftJE #and# MotwaniR #and# UllmanJD , title = {{Introduction to Automata Theory, Languages, and Computation}} , booktitle = {{Introduction to Automata Theory, Languages, and Computation}} , publisher = pub-pie , year = 2007 } @article{hn-dcht-53 , author = HararyF #and# NormanR , title = {{The dissimilarity characteristic of Husimi trees}} , journal = j-amath , number = 2 , pages = {134--141} , volume = 58 , year = 1953 } @Article{hnr-afbhd-68 , author = HartPE #and# NilssonN #and# RaphaelB , title = {{A Formal Basis for the Heuristic Determination of Minimum Cost Paths}} , journal = j-ieeetssc , pages = {100--107} , volume = 4 , year = 1968 } @article{ho-acd-04 , author = HenningMA #and# OellermannOR , title = {{The average connectivity of a digraph}} , journal = j-dam , month = may , number = {1--3} , pages = {143--153} , volume = 140 , year = 2004 } @inproceedings{ho-fafmc-92 , author = HaoJ #and# OrlinJB , title = {{A Faster Algorithm for Finding the Minimum Cut in a Graph}} , booktitle = {{Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)}} , month = jan , pages = {165--174} , year = 1992 } @article{hp-bctg-66 , author = HararyF #and# PrinsG , title = {{The block-cutpoint-tree of a graph}} , journal = j-pmd , pages = {103--107} , volume = 13 , year = 1966 } @article{hp-frmma-98 , author = HuangX #and# PanVY , title = {{Fast rectangular matrix multiplication and applications}} , journal = j-comp , number = 2 , pages = {257--299} , volume = 14 , year = 1998 } @Book{hp-kdb-07 , editor = HuX #and# PanY , title = {{Knowledge Discovery in Bioinformatics}} , booktitle = {{Knowledge Discovery in Bioinformatics}} , month = may , publisher = pub-wileys , url = "http://www3.interscience.wiley.com/cgi-bin/bookhome/114268837/" , year = 2007 } @techreport{hp-leeaf-00 , author = HeuvelJ #and# PejicS , title = {{Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems}} , address = "Department of Mathematics, London School of Economics, Houghton Street, London WC2AE, UK" , institution = "Centre for Discrete and Applicable Mathematics" , month = dec , number = {LSE-CDAM-2} , url = "http://www.cdam.lse.ac.uk/Reports/Files/cdam-2000-20.pdf" , year = 2000 } @article{hp-tggpd-57 , author = HararyF #and# PaperH , title = {{Toward a General Calculus of Phonemic Distribution}} , journal = j-l , pages = {143--169} , volume = 33 , year = 1957 } @InProceedings{hpswz-epsa-05 , author = HolzerM #and# PrasinosG #and# SchulzF #and# WagnerD #and# ZaroliagisC , title = {{Engineering Planar Separator Algorithms}} , booktitle = {{Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05)}} , pages = {628--639} , publisher = pub-springer , series = ser-springer_lncs , volume = 3669 , year = 2005 } @InProceedings{hr-altat-91 , author = HsuT #and# RamachandranV , title = {{A Linear Time Algorithm for Triconnectivity Augmentation}} , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}} , month = oct , pages = {548--559} , year = 1991 } @Book{hr-i-05 , author = HannemanR #and# RiddleM , title = {{Introduction to social network methods}} , booktitle = {{Introduction to social network methods}} , publisher = pub-ucr , url = "http://faculty.ucr.edu/~hanneman/" , year = 2005 } @InProceedings{hr-ofsab-91 , author = HsuT #and# RamachandranV , title = {{On Finding a Smallest Augmentation to Biconnect a Graph}} , booktitle = {{Proceedings of the 2nd International Symposium on Algorithms (ISA'91)}} , pages = {326--335} , publisher = pub-springer , series = ser-springer_lncs , volume = 557 , year = 1991 } @article{hr-pcdugm-57 , author = HararyF #and# RossIC , title = {{A procedure for clique detection using the group matrix}} , journal = j-socm , pages = {205--215} , volume = 20 , year = 1957 } @inproceedings{hrg-cvc-96 , author = HenzingerM #and# RaoS #and# GabowHN , title = {{Computing Vertex Connectivity: New Bounds from Old Techniques}} , booktitle = {{Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS'96)}} , month = oct , pages = {462--471} , year = 1996 } @InProceedings{hrr-capg-12 , author = HartmannT #and# RollinJ #and# RutterI , title = {{Cubic Augmentation of Planar Graphs}} , booktitle = {{Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)}} , note = {http://arxiv.org/abs/1209.3865} , publisher = pub-springer , series = ser-springer_lncs , volume = 7676 , year = 2012 } @Book{hrrs-bhhci-08 , editor = HarperR #and# RoddenT #and# RogersY #and# SellenA , title = {{Being Human - Human-Computer Interaction in the Year 2020}} , booktitle = {{Being Human - Human-Computer Interaction in the Year 2020}} , pdf = "http://research.microsoft.com/en-us/um/cambridge/projects/hci2020/downloads/BeingHuman_A3.pdf" , publisher = pub-mrl , year = 2008 } @misc{hrs-sadbf-97 , author = HinzeS #and# ReissT #and# SchmochU , title = {{Statistical Analysis on the Distance Between Fields of Technology}} , institution = "Fraunhofer ISI" , note = {Report for Research Project Innovation Systems and European Integration (ISI), funded by the European Commission} , pdf = "http://publica.fraunhofer.de/eprints/urn:nbn:de:0011-px-570209.pdf" , url = "http://publica.fraunhofer.de/documents/PX-57020.html" , year = 1997 } @Article{hrt-a-06 , author = HamacherHW #and# RuzikaS #and# TjandraSA , title = {{Algorithms for time-dependent bicriteria shortest path problems}} , journal = j-do , month = sep , number = 3 , pages = {238--254} , url = "http://www.sciencedirect.com/science/article/B7GWV-4KF789Y-1/2/89819292a39b448f474c5dbbd4ebc432" , volume = 3 , year = 2006 } @techreport{hrzl-efmph-09 , author = HausbergerS #and# RexeisM #and# ZallingerM #and# LuzR , title = {{Emission Factors from the Model PHEM for the HBEFA Version 3}} , institution = "University of Technology, Graz" , number = {I-20/2009} , year = 2009 } @Article{hs-aasld-98 , author = HarelD #and# SardasM , title = {{An Algorithm for Straight-Line Drawing of Planar Graphs}} , journal = j-alg , pages = {119--135} , volume = 20 , year = 1998 } @Article{hs-cabgc-00 , author = HartuvE #and# ShamirR , title = {{A Clustering Algorithm based on Graph Connectivity}} , journal = j-ipl , number = {4-6} , pages = {175--181} , volume = 76 , year = 2000 } @Article{hs-dbsd-99 , author = HjaltasonG #and# SametH , title = {{Distance Browsing in Spatial Databases}} , journal = j-acmtds , pages = {265--318} , volume = 24 , year = 1999 } @Book{hs-gsama-97 , editor = HahnG #and# SabidussiG , title = {{Graph Symmetry: Algebraic Methods and Applications}} , booktitle = {{Graph Symmetry: Algebraic Methods and Applications}} , publisher = pub-kapg , series = ser-nato_ac , volume = 497 , year = 1997 } @misc{hs-ncda-04 , author = HeH #and# SykoraO , title = {{New Circular Drawing Algorithms}} , note = {unpublished manuscript} , pdf = "http://dspace.lboro.ac.uk/dspace/bitstream/2134/2386/3/HeSyk04.pdf" , year = 2004 } @article{hs-sctfg-89 , author = HoraudR #and# SkordasT , title = {{Stereo Correspondence Through Feature Grouping and Maximal Cliques}} , journal = j-tpami , number = 11 , pages = {1168--1180} , publisher = pub-ics , volume = 11 , year = 1989 } @Article{hs-u-87 , author = HochbaumDS #and# ShmoysDB , title = {{Using dual approximation algorithms for scheduling problems theoretical and practical results}} , journal = j-acm , month = jan , number = 1 , pages = {144--162} , volume = 34 , year = 1987 } @InProceedings{hss-eshqg-10 , author = HoltgreweM #and# SandersP #and# SchulzC , title = {{Engineering a Scalable High Quality Graph Partitioner}} , booktitle = {{24th International Parallel and Distributed Processing Symposium (IPDPS'10)}} , pages = {1--12} , publisher = pub-ics , year = 2010 } @InProceedings{hsw-cstsp-04 , author = HolzerM #and# SchulzF #and# WillhalmT , title = {{Combining Speed-up Techniques for Shortest-Path Computations}} , booktitle = {{Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04)}} , pages = {269--284} , publisher = pub-springer , series = ser-springer_lncs , volume = 3059 , year = 2004 } @InProceedings{hsw-emlog-06 , author = HolzerM #and# SchulzF #and# WagnerD , title = {{Engineering Multi-Level Overlay Graphs for Shortest-Path Queries}} , booktitle = {{Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)}} , pages = {156--170} , publisher = pub-siam , year = 2006 } @Article{hsw-emlog-08 , author = HolzerM #and# SchulzF #and# WagnerD , title = {{Engineering Multilevel Overlay Graphs for Shortest-Path Queries}} , journal = j-acm-ea , month = dec , number = {2.5} , pages = {1--26} , pdf = "http://i11www.ira.uka.de/algo/people/mholzer/publications/pdf/hsw-emlog-07.pdf" , volume = 13 , year = 2008 } @Article{hswpz-epsa-09 , author = HolzerM #and# SchulzF #and# WagnerD #and# PrasinosG #and# ZaroliagisC , title = {{Engineering planar separator algorithms}} , journal = j-acm-ea , number = 1 , pages = {1--31} , url = "http://doi.acm.org/10.1145/1498698.1571635" , volume = 14 , year = 2009 } @Article{hsww-cstsp-06 , author = HolzerM #and# SchulzF #and# WagnerD #and# WillhalmT , title = {{Combining Speed-up Techniques for Shortest-Path Computations}} , journal = j-acm-ea , number = {2.5} , pages = {1--18} , volume = 10 , year = 2006 } @article{ht-dgtc-73 , author = HopcroftJE #and# TarjanRE , title = {{Dividing a graph into triconnected components}} , journal = j-sicomp , month = sep , number = 3 , pages = {135--158} , volume = 2 , year = 1973 } @techreport{ht-dgtc-74 , author = HopcroftJE #and# TarjanRE , title = {{Dividing a Graph into Triconnected Components}} , address = "Ithaca, N.Y." , institution = "CS Dept., Cornell University" , month = feb , number = {TR 74-197} , year = 1974 } @article{ht-eagm-73 , author = HopcroftJE #and# TarjanRE , title = {{Efficient Algorithms for Graph Manipulation}} , journal = j-comm-acm , month = jun , number = 6 , pages = {372--378} , volume = 16 , year = 1973 } @article{ht-ept-74 , author = HopcroftJE #and# TarjanRE , title = {{Efficient Planarity Testing}} , journal = j-acm , month = oct , number = 4 , pages = {549--568} , volume = 21 , year = 1974 } @techreport{ht-ftcg-72 , author = HopcroftJE #and# TarjanRE , title = {{Finding the Triconnected Components of a Graph}} , address = "Ithaca, N.Y." , institution = "CS Dept., Cornell University" , month = aug , number = {TR 72-140} , year = 1972 } @Article{ht-tcpws-05 , author = HuangC #and# TsengY , title = {{The Coverage Problem in a Wireless Sensor Network}} , journal = j-mna , month = aug , number = 4 , pages = {519--528} , volume = 10 , year = 2005 } @InProceedings{hw-fsfdc-12 , author = HartmannT #and# WagnerD , title = {{Fast and Simple Fully-Dynamic Cut Tree Construction}} , booktitle = {{Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)}} , pages = {95--104} , publisher = pub-springer , series = ser-springer_lncs , volume = 7676 , year = 2012 } @inproceedings{hw-ltaip-74 , author = HopcroftJE #and# WongJK , title = {{A linear time algorithm for isomorphism of planar graphs}} , booktitle = {{proc-stoc-74}} , pages = {172--184} , year = 1974 } @InProceedings{hw-odaps-12 , author = HolzerS #and# WattenhoferR , title = {{Optimal Distributed All Pairs Shortest Paths and Applications}} , booktitle = {{Proceedings of the 31th ACM Symposium on Principles of Distributed Computing}} , pages = {355--364} , publisher = pub-acm , year = 2012 } @Article{hy-o-08 , author = HuaC #and# YumTP , title = {{Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks}} , journal = j-ton , volume = 16 , year = 2008 } @Article{hyi-ailsa-08 , author = HashimotoH #and# YagiuraM #and# IbarakiT , title = {{An Iterated Local Search Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows}} , journal = j-do , pages = {434--456} , volume = 5 , year = 2008 } %% -------------------------------------------------------------- @book{i-apl-62 , author = IversonK , title = {{A Programming Language}} , publisher = pub-wiley , year = 1962 } @InProceedings{ige-ddsrc-00 , author = IntanagonwiwatC #and# GovindanR #and# EstrinD , title = {{Directed Diffusion: a Scalable and Robust Communication Paradigm for Sensor Networks}} , booktitle = {{Proceedings of the 6th annual international conference on Mobile computing and networking}} , pages = {56--67} , url = "http://doi.acm.org/10.1145/345910.345920" , year = 2000 } @Article{igehs-d-03 , author = IntanagonwiwatC #and# GovindanR #and# EstrinD #and# HeidemannJ #and# SilvaF , title = {{Directed diffusion for wireless sensor networking}} , journal = j-ton , month = feb , number = 1 , pages = {2--16} , url = "http://portal.acm.org/citation.cfm?id=638335" , volume = 11 , year = 2003 } @Article{igp-vdtdt-03 , author = IchouaS #and# GendreauM #and# PotvinJY , title = {{Vehicle Dispatching with Time-Dependent Travel Times}} , journal = j-ejor , pages = {379--396} , volume = 144 , year = 2003 } @InProceedings{ihinshtm-aai-94 , author = IkedaT #and# HsuM #and# ImaiH #and# NishimuraS #and# ShimouraH #and# HashimotoT #and# TenmokuK #and# MitohK , title = {{A fast algorithm for finding better routes by AI search techniques}} , booktitle = {{Proceedings of the Vehicle Navigation and Information Systems Conference (VNSI'94)}} , pages = {291--296} , publisher = pub-acm , year = 1994 } @Article{ii-a-87 , author = ImaiH #and# IriM , title = {{An optimal algorithm for approximating a piecewise linear function}} , journal = j-jip , number = 3 , pages = {159--162} , volume = 9 , year = 1987 } @InProceedings{ik-a-08 , author = ILY #and# KikuoY , title = {{A framework for fast community extraction of large-scale networks}} , booktitle = {{Proceedings of the 17th International World Wide Web Conference (WWW2008)}} , pages = {1215--1216} , url = "http://doi.acm.org/10.1145/1367497.1367733" , year = 2008 } @Article{ik-faaks-75 , author = IbarraOH #and# KimCE , title = {{Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems}} , journal = j-acm , month = oct , number = 4 , pages = {463--468} , volume = 22 , year = 1975 } @inproceedings{im-lde-04 , author = IndykP #and# MatousekJ , editor = GoodmanJE #and# OrourkeJ , title = {{Low-Distortion Embeddings of Finite Metric Spaces}} , booktitle = {{Handbook of Discrete and Computational Geometry}} , edition = second , month = apr , publisher = pub-ch , year = 2004 } @InProceedings{ini-oamge-98 , author = IshiiT #and# NagamochiH #and# IbarakiT , title = {{Optimal Augmentaion to Make a Graph $k$-Edge-Connected and Triconnected}} , booktitle = {{Proceedings of the 9th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'98)}} , pages = {280--289} , publisher = pub-siam , year = 1998 } @InProceedings{ioai-mnsem-91 , author = IshikawaK #and# OgawaM #and# AzumaM #and# ItoT , title = {{Map Navigation Software of the Electro-Multivision of the 91 Toyoto Soarer}} , booktitle = {{Proceedings of the Vehicle Navigation and Information Systems Conference (VNIS'91)}} , pages = {463--473} , publisher = pub-ics , year = 1991 } @article{ir-fmcg-78 , author = ItaiA #and# RodehM , title = {{Finding a minimum circuit in a graph}} , journal = j-sicomp , number = 4 , pages = {413-423} , volume = 7 , year = 1978 } @Article{ir-tmtar-88 , author = ItaiA #and# RodehM , title = {{The Multi-Tree Approach to Reliability in Distributed Networks}} , journal = j-ic , number = 1 , pages = {43--59} , volume = 79 , year = 1988 } %% -------------------------------------------------------------- @Article{j-aacp-74 , author = JohnsonDS , title = {{Approximation Algorithms for Combinatorial Problems}} , journal = j-css , number = 3 , pages = {256--278} , volume = 9 , year = 1974 } @Article{j-andsp-73 , author = JohnsonDB , title = {{A Note on Dijkstra's Shortest Path Algorithm}} , journal = j-acm , month = jul , number = 3 , pages = {385--388} , url = "http://doi.acm.org/10.1145/321765.321768" , volume = 20 , year = 1973 } @article{j-asmisp-86 , author = JianT , title = {{An ${O}(2^{0.304n})$ Algorithm for Solving Maximum Independent Set Problem}} , journal = j-tc , number = 9 , pages = {847--851} , volume = {C-35} , year = 1986 } @phdthesis{j-dpch-02 , author = JacobR , title = {{Dynamic Planar Convex Hull}} , institution = "University of Aarhus" , pdf = "http://www.brics.dk/DS/02/3/BRICS-DS-02-3.pdf" , school = "BRICS Research Centre" , series = ser-bricsds , url = "http://www.brics.dk/DS/02/3/" , year = 2002 } @Article{j-easps-77 , author = JohnsonDB , title = {{Efficient Algorithms for Shortest Paths in Sparse Networks}} , journal = j-acm , month = jan , number = 1 , pages = {1--13} , volume = 24 , year = 1977 } @Book{j-gna-99 , author = JungnickelD , title = {{Graphs, Networks and Algorithms}} , booktitle = {{Graphs, Networks and Algorithms}} , publisher = pub-springer , series = ser-acm , url = "http://www.springerlink.com/content/u78m0u/" , volume = 5 , year = 1999 } @Book{j-ipa-92 , author = JaJaJ , title = {{Introduction to Parallel Algorithms}} , booktitle = {{Introduction to Parallel Algorithms}} , publisher = pub-aw , year = 1992 } @article{j-lcemp-92 , author = JerrumM , title = {{Large cliques elude the Metropolis process}} , journal = j-rsa , number = 4 , pages = {347--359} , volume = 3 , year = 1992 } @Article{j-nccog-82 , author = JohnsonDS , title = {{The NP-Completeness Column: An Ongoing Guide}} , journal = j-jalg , month = mar , number = 1 , pages = {89--99} , url = "http://dx.doi.org/10.1016/0196-6774(82)90011-6" , volume = 3 , year = 1982 } @article{j-orscc-93 , author = JiangB , title = {{I/O- and {CPU}-optimal recognition of strongly connected components}} , journal = j-ipl , month = mar , number = 3 , pages = {111--115} , volume = 45 , year = 1993 } @article{j-otsrg-78 , author = JuhaszF , title = {{On the spectrum of a random graph}} , journal = j-cmsjb , pages = {313--316} , volume = 25 , year = 1978 } @book{j-pca-2002 , author = JolliffeIT , title = {{Principal Component Analysis}} , publisher = pub-springer , year = 2002 } @article{j-sal-89 , author = JordanC , title = {{Sur les assemblages de lignes}} , journal = "Journal f{\"u}r" , pages = {185--190} , volume = 70 , year = 1869 } @Article{j-t-66 , author = JokschHC , title = {{The shortest route problem with constraints}} , journal = j-maa , number = 2 , pages = {191--197} , url = "http://dx.doi.org/10.1016/0022-247X(66)90020-5" , volume = 14 , year = 1966 } @InProceedings{j-tgeaa-02 , author = JohnsonDS , title = {{A Theoretician's Guide to the Experimental Analysis of Algorithms}} , booktitle = {{Data Structures, Near Neighbor Searches, and Methodology: Proceedings of the Fifth and Sixth DIMACS Implementation Challenges}} , pages = {215--250} , pdf = "http://public.research.att.com/~dsj/papers/experguide.pdf" , publisher = pub-ams , url = "http://public.research.att.com/~dsj/pub.html" , volume = 59 , year = 2002 } @techreport{jcj-itg-00 , author = JinC #and# ChenQ #and# JaminS , title = {{{Inet} Topology Generator}} , institution = "EECS Department, University of Michigan" , number = {CSE-TR-433} , type = {Technical Report} , year = 2000 } @book{jd-acd-88 , author = JainAK #and# DubesRC , title = {{Algorithms for Clustering Data}} , isbn = "0-13-022278-X" , publisher = pub-ph , year = 1988 } @Article{jh-gatdv-01 , author = JungS #and# HaghaniA , title = {{Genetic Algorithm for the Time-Dependent Vehicle Routing Problem }} , journal = j-jtrb , pages = {164--171} , volume = 1771 , year = 2001 } @Article{jhr-hepvp-98 , author = JingN #and# HuangYW #and# RundensteinerEA , title = {{Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation}} , journal = j-tkde , month = may , number = 3 , pages = {409--432} , volume = 10 , year = 1998 } @InProceedings{jk-dbsas-12 , author = JurdzinskiT #and# KowalskiDR , title = {{Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks}} , booktitle = {{Proceedings of the 26th International Symposium on Distributed Computing}} , month = oct , pages = {106--120} , publisher = pub-springer , series = ser-springer_lncs , year = 2012 } @InProceedings{jkkls-eeecg-11 , author = JungC #and# KarchD #and# KnoppS #and# LuxenD #and# SandersP , title = {{Engineering Efficient Error-Correcting Geocoding}} , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}} , pdf = "http://i11www.ira.uka.de/extra/publications/jkkls-eeecg-11.pdf" , publisher = pub-acm , year = 2011 } @InCollection{jklpt-aci-05 , author = JacobR #and# KoschutzkiD #and# LehmannK #and# PeetersL #and# TenfeldePodehlD , title = {{Algorithms for Centrality Indices}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {62--82} , pdf = "http://springerlink.metapress.com/content/lhknhyx1l42gru41/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/lhknhyx1l42gru41/" , volume = 3418 , year = 2005 } @Article{jkls-ptasm-05 , author = JansenK #and# KarpinskiM #and# LingasA #and# SeidelE , title = {{Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs}} , journal = j-sicomp , pages = {110--119} , volume = 35 , year = 2005 } @InProceedings{jkr-aktpp-11 , author = JelinekV #and# KratochvilJ #and# RutterI , title = {{A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs }} , booktitle = {{Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11)}} , pages = {107--116} , publisher = pub-acm , year = 2011 } @Article{jkr-akttp-12 , author = JelinekV #and# KratochvilJ #and# RutterI , title = {{A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs}} , journal = j-cgta , note = {Special issue of SoCG'11} , year = 2012 } @article{jlk-cndp-78 , author = JohnsonDS #and# LenstraJK #and# RinnooyKanAHG , title = {{The complexity of the network design problem}} , journal = j-networks , pages = {279--285} , volume = 9 , year = 1978 } @Book{jm-gds-03 , editor = JuengerM #and# MutzelP , title = {{Graph Drawing Software}} , booktitle = {{Graph Drawing Software}} , isbn = "3-540-00881-0" , publisher = pub-springer , url = "http://www.springer.com/math/cse/book/978-3-540-00881-1" , year = 2003 } @Article{jm-lscmp-97 , author = JuengerM #and# MutzelP , title = {{2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms}} , journal = j-jgaa , pages = {1--25} , volume = 1 , year = 1997 } @Book{jm-nfmfd-93 , editor = JohnsonDS #and# McGeochCC , title = {{Network Flows and Matching: First DIMACS Implementation Challenge}} , booktitle = {{Network Flows and Matching: First DIMACS Implementation Challenge}} , publisher = pub-ams , series = ser-dimacsb , url = "http://www.ams.org/bookstore?fn=20&arg1=dimacsseries&ikey=DIMACS-12" , volume = 12 , year = 1993 } @Article{jmbo-lcpn-01 , author = JeongH #and# MasonSP #and# BarabasiAL #and# OltvaiZN , title = {{Lethality and Centrality in Protein Networks}} , journal = j-nature , pages = {41--42} , volume = 411 , year = 2001 } @Article{jmf-dcr-99 , author = JainAK #and# MurtyMN #and# FlynnPJ , title = {{Data Clustering: A Review}} , doi = "http://doi.acm.org/10.1145/331499.331504" , isbn = "0360-0300" , journal = j-acm-csur , month = sep , number = 3 , pages = {264--323} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=331504&type=pdf&coll=GUIDE&dl=GUIDE&CFID=19217105&CFTOKEN=85" , url = "http://doi.acm.org/10.1145/331499.331504" , volume = 31 , year = 1999 } @InProceedings{jn-vcage-04 , author = JakelJ #and# NollenburgM , title = {{Validation in the Cluster Analysis of Gene Expression Data}} , booktitle = {{Proceedings of the 14th Workshop Fuzzy-Systeme und Computational Intelligence}} , pages = {13--32} , pdf = "http://i11www.ira.uka.de/extra/publications/jn-vcage-04.pdf" , publisher = pub-uk , year = 2004 } @misc{jostleS , author = WalshawC , title = {{JOSTLE --graph partitioning software}} , institution = "The University of Greenwich, London, UK" , note = {\url{http://staffweb.cms.gre.ac.uk/~wc06/jostle/}} , url = "http://staffweb.cms.gre.ac.uk/~wc06/jostle/" , year = 2005 } @Article{jp-aepcm-02 , author = JungSU #and# PramanikS , title = {{An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps}} , journal = j-tkde , month = sep , number = 5 , pages = {1029--1046} , volume = 14 , year = 2002 } @article{jpy-gamis-88 , author = JohnsonDS #and# PapadimitriouCH #and# YannakakisM , title = {{On generating all maximal independent sets}} , journal = j-ipl , number = 3 , pages = {119--123} , volume = 27 , year = 1988 } @article{js-fugrg-90 , author = JerrumM #and# SinclairA , title = {{Fast Uniform generation of regular graphs}} , journal = j-tcs , pages = {91--100} , volume = 73 , year = 1990 } @InProceedings{js-p-09 , author = JainA #and# ShivakumarN , title = {{Power system tracking and dynamic state estimation}} , booktitle = {{Power Systems Conference and Exposition (PSCE'09)}} , note = {15 - 18 March, 2009} , pages = {1--8} , publisher = pub-ieee , year = 2009 } @article{jt-rngr-92 , author = JaromczykJW #and# ToussaintGT , title = {{Relative Neighborhood Graphs and Their Relatives}} , journal = "Proceedings of" , number = 9 , pages = {1502--1517} , url = "http://cgm.cs.mcgill.ca/~godfried/publications.html" , volume = 80 , year = 1992 } @Article{jtaob-t-00 , author = JeongH #and# TomborB #and# AlbertR #and# OltvaiZN #and# BarabasiAL , title = {{The large-scale organization of metabolic networks.}} , journal = j-nature , month = oct , number = 6804 , pages = {651--654} , volume = 407 , year = 2000 } @article{jw-smsen-96 , author = JacksonMO #and# WolinskyA , title = {{A Strategic Model of Social and Economic Networks}} , journal = j-et , pages = {474-486} , volume = 71 , year = 1996 } @inproceedings{jw-spws-03 , author = JehG #and# WidomJ , title = {{Scaling personalized web search}} , address = "Budapest, Hungary" , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}} , pages = {271--279} , year = 2003 } %% -------------------------------------------------------------- @mastersthesis{k-a-10 , author = KarchD , title = {{An efficient algorithm for fault-tolerant geocoding}} , institution = "Algorithmics II" , school = "Karlsruhe Institute of Technology" , type = {Diplomarbeit} , year = 2010 } @phdthesis{k-adpg-03 , author = KantG , title = {{Algorithms for Drawing Planar Graphs}} , school = "Utrecht University" , year = 1993 } @mastersthesis{k-aepfv-10 , author = KerstingH , title = {{Algorithm Engineering in der Praxis am Fallbeispiel eines VRP}} , school = "Karlsruhe Institute of Technology" , year = 2010 } @Article{k-agulv-47 , author = KirchhoffG , title = {{{\"U}ber die Aufl{\"o}sung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Str{\"o}me gef{\"u}hrt wird}} , journal = j-aphch , pages = {497--508} , volume = 72 , year = 1847 } @Article{k-amcvr-97 , author = KantG , title = {{A More Compact Visibility Representation}} , journal = j-ijcga , number = 3 , pages = {197--210} , volume = 7 , year = 1997 } @Article{k-anagt-60 , author = KarpRM , title = {{A Note on the Application of Graph Theory to digital Computer Programming}} , journal = j-ico , pages = {179--190} , volume = 3 , year = 1960 } @Article{k-anpta-84 , author = KarmarkarN , title = {{A New Polynomial-Time Algorithm for Linear Programming}} , journal = j-comb , number = 4 , pages = {373--395} , volume = 4 , year = 1984 } @article{k-ashe-99 , author = KleinbergJM , title = {{Authoritative Sources in a Hyperlinked Environment}} , journal = j-acm , number = 5 , pages = {604--632} , url = "http://citeseer.nj.nec.com/article/kleinberg97authoritative.html" , volume = 46 , year = 1999 } @Article{k-bsaab-89 , author = KwaJB , title = {{BS*: An Admissible Bidirectional Staged Heuristic Search Algorithm}} , journal = j-ai , number = 1 , pages = {95--109} , volume = 38 , year = 1989 } @Article{k-cdf-63 , author = KnuthD , title = {{Computer-Drawn Flowcharts}} , journal = j-comm-acm , month = sep , number = 9 , pages = {555--563} , volume = 6 , year = 1963 } @inproceedings{k-cfg-80 , author = KishiG , editor = SaitoN #and# NishizekiT , title = {{On centrality functions of a graph}} , address = "Sendai, Japan" , booktitle = {{Proceedings of the 17th Symposium of Research Institute of Electrical Communication on Graph Theory}} , month = oct , pages = {45--52} , publisher = {Springer} , series = ser-springer_lncs , volume = 108 , year = 1980 } @Article{k-cvmcg-80 , author = KelmansAK , title = {{Concept of a Vertex in a Matroid and 3-Connected Graphs}} , journal = j-jgt , number = 1 , pages = {13--19} , volume = 4 , year = 1980 } @Article{k-dgetp-05 , author = KorenY , title = {{Drawing Graphs by Eigenvectors: Theory and Practice}} , journal = j-cma , pages = {1867--1888} , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYJ-4HDPX76-P-1&_cdi=5620&_user=2149863&_o" , url = "http://dx.doi.org/10.1016/j.camwa.2004.08.015" , volume = 49 , year = 2005 } @article{k-dmfnmp-74 , author = KarzanovAV , title = {{Determining the Maximal Flow in a Network by the Method of Preflows}} , journal = j-sov-math-dokl , number = 2 , pages = {434--437} , volume = 15 , year = 1974 } @Article{k-dnf-03 , author = KleinbergJM , title = {{Detecting a Network Failure}} , journal = j-im , number = 1 , pages = {37--55} , volume = 1 , year = 2003 } @InProceedings{k-dpgo-92 , author = KantG , title = {{Drawing Planar Graphs Using the lmc-Ordering}} , booktitle = {{Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'92)}} , pages = {101--110} , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=267814" , year = 1992 } @techreport{k-dpgo-92_tr , author = KantG , title = {{Drawing Planar Graphs Using the lmc-Ordering}} , institution = "Department of Information and Computing Sciences, Utrecht University" , number = {RUU-CS-92-33} , pdf = "http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-33.pdf" , url = "http://www.cs.uu.nl/research/techreps/RUU-CS-92-33.html" , year = 1992 } @techreport{k-dpguc-92 , author = KantG , title = {{Drawing Planar Graphs Using the Canonical Ordering}} , institution = "Utrecht University" , year = 1992 } @Article{k-dpguc-96 , author = KantG , title = {{Drawing Planar Graphs Using the Canonical Ordering}} , journal = j-alg , number = 4 , pages = {4--32} , pdf = "http://www.springerlink.com/content/h177nm7j6tn17ul0/fulltext.pdf" , url = "http://www.springerlink.com/content/h177nm7j6tn17ul0/" , volume = 16 , year = 1996 } @mastersthesis{k-dptdc-09 , author = KieritzT , title = {{Distributed Parallel Time Dependent Contraction Hierarchies}} , school = "Karlsruhe Institute of Technology" , year = 2009 } @Article{k-dspnt-72 , author = KlafszkyE , title = {{Determination of shortest path in a network with time-dependent edge-lengths}} , journal = j-mos , number = 4 , pages = {255--257} , volume = 3 , year = 1972 } @article{k-ecgpp-95 , author = KuceraL , title = {{Expected complexity of graph partitioning problems}} , journal = j-dam , number = {2--3} , pages = {193--212} , volume = 57 , year = 1995 } @mastersthesis{k-ecmms-06 , author = KnoppS , title = {{Efficient Computation of Many-to-Many Shortest Paths}} , month = oct , school = inf_ka , year = 2006 } @Book{k-fa-11 , author = KnuthD , title = {{Fundamental Algorithms}} , booktitle = {{Fundamental Algorithms}} , publisher = pub-aw , series = ser-tacp , volume = 1 , year = 2011 } @incollection{k-fmfnss-73 , author = KarzanovAV , title = {{On finding maximum flows in networks with special structure and some applications}} , booktitle = {{Matematicheskie Voprosy Upravleniya Proizvodstvom}} , note = {(In Russian)} , pages = {66--70} , publisher = {Moscow State Univers} , volume = 5 , year = 1973 } @Article{k-fpos-87 , author = KellyD , title = {{Fundamentals of Planar Ordered Sets}} , journal = j-dima , number = {2-3} , pages = {197--216} , url = "http://dx.doi.org/10.1016/0012-365X(87)90008-2" , volume = 63 , year = 1987 } @article{k-gm-31 , author = KoenigD , title = {{Graphen und {Matrizen}}} , journal = "Mat. Fiz. Lapok" , pages = {116-119} , volume = 38 , year = 1931 } @InProceedings{k-hgd-93 , author = KantG , title = {{Hexagonal Grid Drawings}} , booktitle = {{Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92)}} , month = jun , pages = {263--276} , publisher = pub-springer , series = ser-springer_lncs , volume = 657 , year = 1993 } @inproceedings{k-iaamccnagc-01 , author = KhotS , title = {{Improved Approximation Algorithms for Max Clique, Chromatic Number and Approximate Graph Coloring}} , booktitle = {{Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'01)}} , pages = {600--609} , publisher = pub-ieeecs , year = 2001 } @InProceedings{k-itc-02 , author = KleinbergJM , title = {{An Impossibility Theorem for Clustering}} , booktitle = {{Proceedings of 15th Conference: Neural Information Processing Systems}} , pdf = "http://www.cs.cornell.edu/home/kleinber/nips15.pdf" , url = "http://www.cs.cornell.edu/home/kleinber/kleinber.html" , year = 2002 } @Article{k-ka-36 , author = KoebeP , title = {{Kontaktprobleme der konformen Abbildung}} , journal = j-bvsawl , pages = {141--164} , volume = 88 , year = 1936 } @InCollection{k-ld-05 , author = KosubS , title = {{Local Density}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {112--142} , pdf = "http://springerlink.metapress.com/content/l7rua6uqvm57v3ag/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/l7rua6uqvm57v3ag/" , volume = 3418 , year = 2005 } @misc{k-lphgm-08 , author = KringsM , title = {{LP-basierte Heuristiken f{\"u}r Graphenclusterung mit Modularity als Qualit{\"a}tsma{\ss}}} , institution = uni_ka , month = feb , note = {Student Project, Studienarbeit} , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-krings-07.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished" , year = 2008 } @mastersthesis{k-mapsl-07 , author = KrugM , title = {{Minimizing the Area for Planar Straight-Line Grid Drawings}} , pdf = "http://i11www.iti.uni-karlsruhe.de/members/krug/publications/files/k-mapsl-2007.pdf" , school = "Universit{\"a}t Karlsruhe" , year = 2007 } @article{k-miclg-69 , author = KleitmanDJ , title = {{Methods for Investigating Connectivity of Large Graphs}} , journal = j-tct , month = may , number = 2 , pages = {232--233} , volume = 16 , year = 1969 } @article{k-ms-64 , author = KruskalJB , title = {{Multidimensional Scaling by Optimizing Goodness of Fit to a Nonparametric Hypothesis}} , journal = j-psy , month = mar , pages = {1--27} , volume = 29 , year = 1964 } @Article{k-msogf-64 , author = KruskalJB , title = {{Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis}} , journal = j-psy , month = mar , number = 1 , pages = {1--27} , url = "http://www.springerlink.com/content/010q1x323915712x/" , volume = 29 , year = 1964 } @InProceedings{k-msspp-05 , author = KleinPN , title = {{Multiple-Source Shortest Paths in Planar Graphs}} , booktitle = {{Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)}} , pages = {146--155} , publisher = pub-siam , year = 2005 } @article{k-nm-64 , author = KruskalJB , title = {{Nonmetric Multidimensional Scaling: A Numerical Method}} , journal = j-psy , month = jun , pages = {115--129} , volume = 29 , year = 1964 } @techreport{k-noa-63 , author = KnuthD , title = {{Notes on ``Open'' Addressing}} , institution = "Unknown institution" , url = "http://algo.inria.fr/AofA/Research/11-97.html" , year = 1963 } @article{k-nsids-53 , author = KatzL , title = {{A new status index derived from sociometric analysis}} , journal = j-psy , number = 1 , pages = {39--43} , volume = 18 , year = 1953 } @article{k-occcp-75 , author = KarpRM , title = {{On the computational complexity of combinatorial problems}} , journal = j-networks , pages = {45--68} , volume = 5 , year = 1975 } @InProceedings{k-olavo-92 , author = KarpRM , title = {{On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?}} , booktitle = {{Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92}} , pages = {416--429} , publisher = pub-acm , year = 1992 } @Article{k-opg-76 , author = KampenG , title = {{Orienting Planar Graphs.}} , journal = j-dima , number = 4 , pages = {337--341} , volume = 14 , year = 1976 } @incollection{k-pascsp-76 , author = KarpRM , editor = TraubJF , title = {{Probabilistic analysis of some combinatorial search problems}} , booktitle = {{Algorithms and Complexity: New Directions and Recent Results}} , pages = {1--19} , publisher = pub-ap , year = 1976 } @book{k-pcgg-91 , author = KratochvilJ , title = {{Perfect Codes in General Graphs}} , publisher = pub-apraha , year = 1991 } @Book{k-pssc-94 , editor = KundurP , title = {{Power System Stability and Control}} , booktitle = {{Power System Stability and Control}} , note = {ISBN 0-07-035958-X} , publisher = pub-mghi , year = 1994 } @phdthesis{k-pswsn-09 , author = KatzB , title = {{Positioning and Scheduling of Wireless Sensor Networks --- Models, Complexity, and Scalable Algorithms }} , month = jan , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/760243" , school = inf_ka , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011014" , year = 2009 } @InProceedings{k-racp-72 , author = KarpRM , title = {{Reducibility among Combinatorial Problems}} , booktitle = {{Complexity of Computer Computations}} , pages = {85--103} , publisher = pub-plenum , year = 1972 } @InCollection{k-rennf-56 , author = KleeneSC , title = {{Representation of Events in Nerve Nets and Finite Automata}} , booktitle = {{Automata Studies}} , pages = {3--42} , publisher = pub-pup , series = ser-ann_math_stud , year = 1956 } @inproceedings{k-roptasgmbdsbc-04 , author = KhotS , title = {{Ruling out {PTAS} for Graph Min-Bisection, Densest Subgraph and Bipartite Clique}} , booktitle = {{Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)}} , pages = {136--145} , publisher = pub-ieeecs , year = 2004 } @mastersthesis{k-rpfof-09 , author = KobitzschM , title = {{Route Planning with Flexible Objective Functions}} , school = "Karlsruhe Institute of Technology" , year = 2009 } @Article{k-s-30 , author = KuratowskiC , title = {{Sur le probl{\`e}me des courbes gauches en Topologie}} , journal = j-fm , pages = {271--283} , volume = 15 , year = 1930 } @InProceedings{k-sgd-03 , author = KorenY , title = {{On Spectral Graph Drawing}} , booktitle = {{Proceedings of the 9th Annual International Conference on Computing Combinatorics (COCOON'03)}} , pages = {496--508} , pdf = "http://www.springerlink.com/content/fpl2w4j6ug1aavyf/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/fpl2w4j6ug1aavyf/" , volume = 2697 , year = 2003 } @Article{k-snlnm-96 , author = KrackhardtD , title = {{Social Networks and the Liability of Newness for Managers}} , journal = j-tob , pages = {159--173} , pdf = "http://www.andrew.cmu.edu/user/krack/documents/pubs/1996/1996%20Social%20Networks%20and%20the%20Liab" , url = "http://www.andrew.cmu.edu/user/krack/publications.shtml" , volume = 3 , year = 1996 } @misc{k-ssg-09 , author = KringsM , title = {{Simultane Schnitte in Graphen}} , month = sep , pdf = "http://i11www.ira.uka.de/extra/publications/k-ssg-09.pdf" , school = "Karlsruhe Institute of Technology (KIT)" , year = 2009 } @InProceedings{k-swp-00 , author = KleinbergJM , title = {{The small-world phenomenon: {An} algorithmic perspective}} , booktitle = {{Proceedings of the 32nd Annual {ACM} Symposium on the Theory of Computing (STOC'00)}} , month = may , pages = {163--170} , year = 2000 } @Book{k-taocp-97 , author = KnuthD , title = {{The Art Of Computer Programming}} , booktitle = {{The Art Of Computer Programming}} , publisher = pub-aw , volume = 3 , year = 1997 } @article{k-tnn-90 , author = KnuthD , title = {{Two notes on notation}} , journal = j-amm , pages = {403--422} , volume = 99 , year = 1990 } @Book{k-tpt-04 , author = KernerBS , title = {{The Physics of Traffic}} , booktitle = {{The Physics of Traffic}} , publisher = pub-springer , year = 2004 } @Book{k-tsgb-93 , author = KnuthD , title = {{The Stanford GraphBase : a platform for combinatorial computing}} , booktitle = {{The Stanford GraphBase : a platform for combinatorial computing}} , publisher = pub-aw , year = 1993 } @Article{k-vhn-96 , author = KrebsVE , title = {{Visualizing Human Networks}} , journal = j-r , month = feb , pages = {1--25} , url = "http://radar.oreilly.com/r2/release1_0.html" , year = 1996 } @Book{k-vsgdn-05 , author = KrempelL , title = {{Visualisierung komplexer Strukturen. Grundlagen der Darstellung mehrdimensionaler Netzwerke}} , publisher = pub-c , year = 2005 } @InProceedings{kb-pgap-91 , author = KantG #and# BodlaenderHL , title = {{Planar Graph Augmentation Problems}} , booktitle = {{Proceedings of the 2nd International Workshop on Algorithms and Data Structures (WADS'91)}} , pages = {286--298} , publisher = pub-springer , series = ser-springer_lncs , volume = 519 , year = 1991 } @Article{kbb-lbawa-12 , author = KhabbazianM #and# BlakeIF #and# BhargavaVK , title = {{Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions}} , journal = j-ieeetmc , month = mar , number = 3 , pages = {402--413} , volume = 11 , year = 2012 } @Article{kbm-kpind-94 , author = KrackhardtD #and# BlytheJ #and# McGrathC , title = {{{KrackPlot} 3.0: An Improved Network Drawing Program}} , journal = j-c , number = 2 , pages = {53--55} , pdf = "http://www.isi.edu/~blythe/papers/pdf/kp3.pdf" , url = "http://www.isi.edu/~blythe/papers/kp3.html" , volume = 17 , year = 1994 } @unpublished{kbm-kpndp-06 , author = KrackhardtD #and# BlytheJ #and# McGrathC , title = {{{KrackPlot} 4.3 Network Drawing Program}} , url = "http://www.isi.edu/~blythe/KP/" , year = 2006 } @InProceedings{kc-ebgca-11 , author = KenleyEC #and# ChoY , title = {{Entropy-Based Graph Clustering: Application to Biological and Social Networks}} , booktitle = {{Proceedings of the 2011 IEEE International Conference on Data Mining}} , pages = {1116--1121} , publisher = pub-ics , year = 2011 } @Article{kc-rldr-04 , author = KorenY #and# CarmelL , title = {{Robust Linear Dimensionality Reduction}} , journal = j-tvcg , month = jul , number = 4 , pages = {459--470} , url = "http://doi.ieeecomputersociety.org/10.1109/TVCG.2004.17" , volume = 10 , year = 2004 } @InProceedings{kch-aceaf-02 , author = KorenY #and# CarmelL #and# HarelD , title = {{ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs}} , booktitle = {{Proceedings of the 2002 IEEE Symposium on Information Visualization}} , pages = {137--144} , publisher = pub-ieeecs , url = "http://doi.ieeecomputersociety.org/10.1109/INFVIS.2002.1173159" , year = 2002 } @Article{kch-dhgam-03 , author = KorenY #and# CarmelL #and# HarelD , title = {{Drawing Huge Graphs by Algebraic Multigrid Optimization}} , journal = j-mms , number = 4 , pages = {645--673} , pdf = "http://www.research.att.com/~yehuda/pubs/ace_journal.pdf" , url = "http://www.ncbi.nlm.nih.gov/CBBresearch/Fellows/Carmel/publications/Koren_Carmel_Harel_2003.html" , volume = 1 , year = 2003 } @InProceedings{kclrw-cdamm-12 , author = KaoMJ #and# ChenJ #and# LeeD #and# RutterI #and# WagnerD , title = {{Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem}} , booktitle = {{Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)}} , note = {Accepted for publication} , pages = {75--84} , publisher = pub-springer , series = ser-springer_lncs , volume = 7676 , year = 2012 } @Article{kdn-e-03 , author = KalpakisK #and# DasguptaK #and# NamjoshiP , title = {{Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks}} , journal = j-cn , number = 6 , pages = {697--716} , url = "http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6VRG-482YJY7-1&_user=2149863&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_acct=C000056383&_version=1&_urlVersion=0&_userid=2149863&md5=7d2932e5f8487f442277e8eb1949a3a7" , volume = 42 , year = 2003 } @Article{ke-hcsn-02 , author = KlemmK #and# EguiluzVM , title = {{Highly Clustered Scale-free Networks}} , journal = j-pr-e , month = feb , number = 3 , pages = 036123 , pdf = "http://prola.aps.org/pdf/PRE/v65/i3/e036123" , url = "http://dx.doi.org/10.1103/PhysRevE.65.036123" , volume = 63 , year = 2002 } @Book{kem-hcve-07 , author = KerrenA #and# EbertA #and# MeyerJ , title = {{Human-Centered Visualization Environments}} , booktitle = {{Human-Centered Visualization Environments}} , publisher = pub-springer , series = ser-springer_lncs , volume = 4417 , year = 2007 } @Article{kfhr-opasl-94 , author = KaoM #and# FurerM #and# HeXi #and# RaghavachariB , title = {{Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs}} , journal = j-sidma , number = 4 , pages = {632--646} , volume = 7 , year = 1994 } @Article{kfmut-crfws-03 , author = KrauseAE #and# FrankA #and# MasonDM #and# UlanowiczRE #and# TaylorWW , title = {{Compartments Revealed in Food-Web Structure}} , journal = j-nature , number = 6964 , pages = {282--285} , pdf = "http://www.nature.com/nature/journal/v426/n6964/pdf/nature02115.pdf" , url = "http://www.nature.com/nature/journal/v426/n6964/index.html" , volume = 426 , year = 2003 } @Article{kg-vectv-06 , author = KumarG #and# GarlandM , title = {{Visual Exploration of Complex Time-Varying Graphs}} , journal = j-tvcg , month = sep , number = 5 , pages = {805--812} , pdf = "http://graphics.cs.uiuc.edu/~garland/papers/graphstrat.pdf" , volume = 12 , year = 2006 } @Article{kgv-osa-83 , author = KirkpatrickS #and# GelattCD #and# VecchiMP , title = {{Optimization by Simulated Annealing}} , journal = j-science , month = may , number = 4598 , pages = {671--680} , pdf = "http://www.jstor.org/stable/pdfplus/1690046.pdf" , url = "http://links.jstor.org/sici?sici=0036-8075%2819830513%293%3A220%3A4598%3C671%3AOBSA%3E2.0.CO%3B2-8" , volume = 220 , year = 1983 } @Article{kh-aaanl-79 , author = KarivO #and# HakimiSL , title = {{An Algorithmic Approach to Network Location Problems. I: The $p$-Centers}} , journal = j-sijam , number = 3 , pages = {513--538} , volume = 37 , year = 1979 } @InProceedings{kh-aasm-05 , author = KorenY #and# HarelD , title = {{Axis-by-Axis Stress Minimization}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {450--459} , pdf = "http://www.springerlink.com/content/pm9fb9w400nxx1u8/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/pm9fb9w400nxx1u8/" , volume = 3383 , year = 2005 } @InProceedings{kh-atwvm-03 , author = KorenY #and# HarelD , title = {{A Two-Way Visualization Method for Clustered Data}} , booktitle = {{Proceedings of the nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}} , pages = {589--594} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=956824&type=pdf&coll=GUIDE&dl=GUIDE&CFID=77553250&CFTOKEN=60" , url = "http://doi.acm.org/10.1145/956750.956824" , year = 2003 } @proceedings{kh-gccrc-08 , editor = KavanaghJ #and# HallW , title = {{Grand Challenges in Computing Research Conference 2008}} , pdf = "http://www.ukcrc.org.uk/grand_challenges/news/gccr08final.pdf" , publisher = pub-ukcrc , year = 2008 } @Article{kh-relcp-97 , author = KantG #and# HeXi , title = {{Regular Edge Labeling of $4$-Connected Plane Graphs and its Applications in Graph Drawing Problems}} , journal = j-tcs , number = {1-2} , pages = {175--193} , volume = 172 , year = 1997 } @InProceedings{kh-tafrd-94 , author = KantG #and# HeXi , title = {{Two Algorithms for Finding Rectangular Duals of Planar Graphs}} , booktitle = {{Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)}} , pages = {396--410} , publisher = pub-springer , series = ser-springer_lncs , volume = 903 , year = 1994 } @techreport{khg-amcpr-03 , author = KamvarSD #and# HaveliwalaTH #and# GolubGH , title = {{Adaptive methods for the computation of PageRank}} , institution = "Stanford University" , month = {Apr} , year = 2003 } @techreport{khmg-ebswc-03 , author = KamvarSD #and# HaveliwalaTH #and# ManningCD #and# GolubGH , title = {{Exploiting the block structure of the Web for computing PageRank}} , institution = "Stanford University" , month = {Mar} , year = 2003 } @inproceedings{khmg-emapr-03 , author = KamvarSD #and# HaveliwalaTH #and# ManningCD #and# GolubGH , title = {{Extrapolation Methods for Accelerating PageRank Computations}} , address = "Budapest, Hungary" , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}} , pages = {261--270} , year = 2003 } @Article{kk-adgug-89 , author = KamadaT #and# KawaiS , title = {{An Algorithm for Drawing General Undirected Graphs}} , journal = j-ipl , month = apr , number = 1 , pages = {7--15} , url = "http://dx.doi.org/10.1016/0020-0190(89)90102-6" , volume = 31 , year = 1989 } @Article{kk-afhqm-99 , author = KarypisG #and# KumarG , title = {{A Fast and Highly Quality Multilevel Scheme for Partitioning Irregular Graphs}} , journal = j-sisccomp , number = 1 , pages = {359--392} , volume = 20 , year = 1999 } @inproceedings{kk-amgp-95 , author = KarypisG #and# KumarV , title = {{Analysis of Multilevel Graph Partitioning}} , booktitle = {{Proceedings of the 1995 ACM/IEEE conference on Supercomputing}} , doi = "http://doi.acm.org/10.1145/224170.224229" , isbn = "0-89791-816-9" , location = "San Diego, California, United States" , publisher = pub-acm , year = 1995 } @Article{kk-bhsr-97 , author = KaindlH #and# KainzG , title = {{Bidirectional Heuristic Search Reconsidered}} , journal = j-jair , month = dec , pages = {283--317} , volume = 7 , year = 1997 } @Article{kk-mspig-98 , author = KarypisG #and# KumarV , title = {{A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs}} , journal = j-sisccomp , number = 1 , pages = {359--392} , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SJOCE3000020000001000359000001" , url = "http://dx.doi.org/10.1137/S1064827595287997" , volume = 20 , year = 1998 } @InProceedings{kkklnrw-cttor-11 , author = KaoMJ #and# KatzB #and# KrugM #and# LeeD #and# NollenburgM #and# RutterI #and# WagnerD , title = {{Connecting Two Trees with Optimal Routing Cost}} , booktitle = {{Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11)}} , pages = {43--47} , pdf = "http://i11www.ira.uka.de/extra/publications/kkklnrw-cttor-11.pdf" , publisher = pub-utp , url = "http://www.cccg.ca/proceedings/2011/papers/paper35.pdf" , year = 2011 } @InProceedings{kkklrw-tdmpg-11 , author = KaoMJ #and# KatzB #and# KrugM #and# LeeD #and# RutterI #and# WagnerD , title = {{The Density Maximization Problem in Graphs}} , booktitle = {{Proceedings of the 17th Annual International Conference on Computing Combinatorics (COCOON'11)}} , pages = {25--36} , publisher = pub-springer , series = ser-springer_lncs , volume = 6842 , year = 2011 } @Article{kkklrw-tdmpg-12 , author = KaoMJ #and# KatzB #and# KrugM #and# LeeD #and# RutterI #and# WagnerD , title = {{The Density Maximization Problem in Graphs}} , journal = j-jco , note = {Special issue of COCOON'11} , year = 2012 } @techreport{kkklrw-trtdmpg-11 , author = KaoM #and# KatzB #and# KrugM #and# LeeD #and# RutterI #and# WagnerD , title = {{The Density Maximization Problem in Graphs}} , institution = kit_wagner , number = {2011-18} , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023123" , year = 2011 } @InProceedings{kkllw-cosdw-11 , author = KleinR #and# KrugM #and# LangetepeE #and# LeeD #and# WagnerD , title = {{Constructing Optimal Shortcuts in Directed Weighted Paths and Trees}} , booktitle = {{Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11)}} , year = 2011 } @InProceedings{kklrsw-gdcrp-10 , author = KatzB #and# KrugM #and# LochbihlerA #and# RutterI #and# SneltingG #and# WagnerD , title = {{Gateway Decompositions for Constrained Reachability Problems}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {449--461} , publisher = pub-springer , series = ser-springer_lncs , volume = 6049 , year = 2010 } @InProceedings{kkls-mtgig-06 , author = KaufmannM #and# KratochvilJ #and# LehmannK #and# SubramanianA , title = {{Max-Tolerance Graphs as Intersection Graphs}} , booktitle = {{Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)}} , isbn = "0-89871-605-5" , pages = {832--841} , year = 2006 } @article{kkm-fcsis-00 , author = KloksT #and# KratschD #and# MuellerH , title = {{Finding and counting small induced subgraphs efficiently}} , journal = j-ipl , number = {3--4} , pages = {115--121} , volume = 74 , year = 2000 } @techreport{kkn-cac-11 , author = KamperJH #and# KobourovSG #and# NollenburgM , title = {{Circular-Arc Cartograms}} , institution = "CoRR" , number = {1112.4626} , url = "http://arxiv.org/abs/1112.4626" , year = 2011 } @InProceedings{kkn-cac-13 , author = KamperJH #and# KobourovSG #and# NollenburgM , title = {{Circular-Arc Cartograms}} , booktitle = {{Proceedings of IEEE Pacific Visualization Symposium}} , note = {To appear.} , publisher = pub-ics , url = "http://arxiv.org/abs/1112.4626" , year = 2013 } @InProceedings{kkorssv-e-13 , author = KlavikP #and# KratochvilJ #and# OtachiY #and# RutterI #and# SaitohT #and# SaumellM #and# VyskocilT , title = {{Extending partial representations of proper and unit interval graphs}} , booktitle = {{Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)}} , note = {To appear.} , year = 2013 } @Article{kkp-fhptb-93 , author = KargerDR #and# KollerD #and# PhillipsS , title = {{Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths}} , journal = j-sicomp , number = 6 , pages = {1117--1349} , volume = 22 , year = 1993 } @InProceedings{kkrw-gepg-10 , author = KatzB #and# KrugM #and# RutterI #and# WolffA , title = {{Manhattan-Geodesic Embedding of Planar Graphs}} , booktitle = {{Proceedings of the 17th International Symposium on Graph Drawing (GD'09)}} , pages = {207--218} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/e1j7683r32134456/" , volume = 5849 , year = 2010 } @techreport{kkrw-mgpse-09 , author = KatzB #and# KrugM #and# RutterI #and# WolffA , title = {{Manhattan-Geodesic Point-Set Embeddability and Polygonization }} , institution = iti_wagner , number = {2009-17} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1106174" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000012949" , year = 2009 } @InProceedings{kl-dmpce-13 , author = KahlM #and# LeibfriedT , title = {{Decentralized Model Predictive Control of Electrical Power Systems}} , booktitle = {{Proceedings of the International Conference on Power Systems Transients (IPST'13)}} , note = {Vancouver, Canada, July 18-20, 2013} , publisher = pub-aaaip , year = 2013 } @Article{kl-efppg-70 , author = KernighanBW #and# LinS , title = {{An Efficient Heuristic Procedure for Partitioning Graphs}} , journal = j-bstj , month = feb , number = 2 , pages = {291--307} , pdf = "http://users.ece.gatech.edu/limsk/course/ece6133/papers/kl.pdf" , volume = 49 , year = 1970 } @inproceedings{kl-fmfug-98 , author = KargerDR #and# LevineMS , title = {{Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching}} , booktitle = {{Proceedings of the 30th Annual {ACM} Symposium on the Theory of Computing (STOC'98)}} , month = may , pages = {69--78} , year = 1998 } @InProceedings{klc-alcas-12 , author = KirchlerD #and# LibertiL #and# CalvoRW , title = {{A Label Correcting Algorithm for the Shortest Path Problem on a Multi-Modal Route Network}} , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 7276 , year = 2012 } @Article{klmpw-ats-03 , author = KratschD #and# LeH #and# MuellerH #and# PrisnerE #and# WagnerD , title = {{Additive Tree Spanners}} , journal = j-sidma , number = 2 , pages = {332--340} , url = "http://dx.doi.org/10.1137/S0895480195295471" , volume = 17 , year = 2003 } @Article{kln-tamac-11 , author = KuhnF #and# LynchN #and# NewportC , title = {{The Abstract MAC Layer}} , journal = j-dc , month = nov , number = {3-4} , pages = {187--206} , volume = 24 , year = 2011 } @Article{klp-ofmsv-75 , author = KungHT #and# LuccioF #and# PreparataFP , title = {{On Finding the Maxima of a Set of Vectors}} , journal = j-acm , number = 4 , pages = {469--476} , pdf = "http://portal.acm.org/ft_gateway.cfm?id=321910&type=pdf&coll=GUIDE&dl=GUIDE&CFID=100750199&CFTOKEN=3" , url = "http://doi.acm.org/10.1145/321906.321910" , volume = 22 , year = 1975 } @InProceedings{klpc-ualt-11 , author = KirchlerD #and# LibertiL #and# PajorT #and# CalvoRW , title = {{UniALT for Regular Language Constraint Shortest Paths on a Multi-Modal Transportation Network}} , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}} , pages = {64--75} , pdf = "http://i11www.ira.uka.de/extra/publications/klpc-ualt-11.pdf" , series = ser-oasioasi , url = "http://drops.dagstuhl.de/opus/volltexte/2011/3267/" , volume = 20 , year = 2011 } @InCollection{klprtz-ci-05 , author = KoschutzkiD #and# LehmannK #and# PeetersL #and# RichterS #and# TenfeldePodehlD #and# ZlotowskiO , title = {{Centrality Indices}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {16--61} , pdf = "http://springerlink.metapress.com/content/9ylyvje90wdev5ql/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/9ylyvje90wdev5ql/" , volume = 3418 , year = 2005 } @InProceedings{klr-tpfdm-04 , author = KeoghE #and# LonardiS #and# RatanamahatanaCA , title = {{Towards Parameter-Free Data Mining}} , booktitle = {{Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}} , pages = {206--215} , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=1014052.1014077" , year = 2004 } @InProceedings{kls-ifssd-10 , author = KarchD #and# LuxenD #and# SandersP , title = {{Improved Fast Similarity Search in Dictionaries }} , booktitle = {{Proceedings of the 17th Symposium on String Processing and Information Retrieval (Spire 2010)}} , month = oct , pdf = "http://www.springerlink.com/content/pk726w16u7747106/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , year = 2010 } @techreport{kls-ifssd-full-10 , author = KarchD #and# LuxenD #and# SandersP , title = {{Improved Fast Similarity Search in Dictionaries}} , institution = "Karlsruhe Institute of Technology" , year = 2010 } @InProceedings{klsv-dtdch-10 , author = KieritzT #and# LuxenD #and# SandersP #and# VetterC , title = {{Distributed Time-Dependent Contraction Hierarchies}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {83--93} , pdf = "http://i11www.ira.uka.de/extra/publications/klsv-dtdch-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 6049 , year = 2010 } @InCollection{kltz-acc-05 , author = KoschutzkiD #and# LehmannK #and# TenfeldePodehlD #and# ZlotowskiO , title = {{Advanced Centrality Concepts}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {83--111} , pdf = "http://springerlink.metapress.com/content/0rg1e5vrkue1hqh7/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/0rg1e5vrkue1hqh7/" , volume = 3418 , year = 2005 } @unpublished{kmr-ene-11 , author = KrugM #and# MeinertS #and# RutterI , title = {{Efficient Node Expansion}} , year = 2011 } @InProceedings{kms-aspcs-05 , author = KoehlerE #and# MoehringR #and# SchillingH , title = {{Acceleration of Shortest Path and Constrained Shortest Path Computation}} , booktitle = {{Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)}} , pages = {126--138} , publisher = pub-springer , series = ser-springer_lncs , volume = 3503 , year = 2005 } @InProceedings{kmw-esdht-08 , author = KatzB #and# MeckeS #and# WagnerD , title = {{Efficient Scheduling of Data Harvesting Trees}} , booktitle = {{Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08)}} , pages = {43--56} , pdf = "http://www.springerlink.com/content/a1l1157619867503/fulltext.pdf" , series = ser-springer_lncs , url = "http://www.springerlink.com/content/a1l1157619867503" , volume = 5389 , year = 2008 } @InProceedings{knrss-tsbla-13 , author = KindermannP #and# NiedermannB #and# RutterI #and# SchaeferM #and# SchulzA #and# WolffA , title = {{Two-Sided Boundary Labeling with Adjacent Sides}} , booktitle = {{Algorithms and Data Structures, 13th International Symposium (WADS'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , year = 2013 } @InProceedings{knrssw-tsbla-13 , author = KindermannP #and# NiedermannB #and# RutterI #and# SchaeferM #and# SchulzA #and# WolffA , title = {{Two-Sided Boundary Labeling with Adjacent Sides}} , booktitle = {{Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)}} , year = 2013 } @InProceedings{knrt-obeb-03 , author = KumarR #and# NovakJ #and# RaghavanP #and# TomkinsAS , title = {{On the Bursty Evolution of Blogspace}} , address = "Budapest, Hungary" , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}} , pages = {568--576} , url = "http://portal.acm.org/citation.cfm?id=775233" , year = 2003 } @Book{knt-gmdra-06 , editor = KoganJ #and# NicholasC #and# TeboulleM , title = {{Grouping Multidimensional Data: Recent Advances in Clustering}} , booktitle = {{Grouping Multidimensional Data: Recent Advances in Clustering}} , publisher = pub-springer , url = "http://www.springerlink.com/content/n78615/" , year = 2006 } @Article{knv-mepgn-07 , author = KorenY #and# NorthSC #and# VolinskyC , title = {{Measuring and Extracting Proximity Graphs in Networks}} , journal = j-acmtkdd , month = dec , number = 3 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1297336&type=pdf&coll=GUIDE&dl=&CFID=78697063&CFTOKEN=790973" , url = "http://portal.acm.org/citation.cfm?id=1297336&jmp=cit&coll=GUIDE&dl=" , volume = 1 , year = 2007 } @InProceedings{ko-lfanm-07 , author = KeimDA #and# OelkeD , title = {{Literature Fingerprinting: A New Method for Visual Literary Analysis}} , booktitle = {{IEEE Symposium on Visual Analytics and Technology (VAST 2007)}} , month = oct , pages = {115--122} , publisher = pub-ieeecs , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4389004" , year = 2007 } @Article{ko-pspaa-80 , author = KarpRM #and# OrlinJB , title = {{Parameter Shortest Path Algorithms with an Application to Cyclic Staffing}} , journal = j-dam , pages = {37--45} , volume = 2 , year = 1980 } @InProceedings{kp-anlta-09 , author = KargerDR #and# PanigrahiD , title = {{A Near-Linear Time Algorithm for Constructing a Cactus Representation of Minimum Cuts}} , booktitle = {{Proceedings of the 20st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'09)}} , pages = {246--255} , year = 2009 } @Article{kp-idpcf-04 , author = KellererH #and# PferschyU , title = {{Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem }} , journal = j-jco , number = 1 , pages = {5--11} , volume = 8 , year = 2004 } @Article{kp-tsppl-06 , author = KlunderGA #and# PostHN , title = {{The Shortest Path Problem on Large-Scale Real-Road Networks}} , journal = j-networks , number = 4 , pages = {182--194} , volume = 48 , year = 2006 } @InProceedings{kpp-of-07 , author = KaibelV #and# PeinhardtM #and# PfetschM , title = {{Orbitopal Fixing}} , booktitle = {{Proceedings of the 12th Integer Programming and Combinatorial Optimization Conference}} , pages = {74--88} , pdf = "http://www.springerlink.com/content/85xh141734m03561/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/85xh141734m03561/" , year = 2007 } @article{kr-bain-79 , author = KnokeD #and# RogersDL , title = {{A Blockmodel Analysis of Interorganizational Networks}} , journal = j-ssr , pages = {28--52} , volume = 64 , year = 1979 } @article{kr-grhbms-84 , author = KimKH #and# RoushFW , title = {{Group Relationships and Homomorphisms of Boolean Matrix Semigroups}} , journal = j-jmp , pages = {448--452} , volume = 28 , year = 1984 } @InProceedings{krg-iwclt-98 , author = KleinbergJM #and# RaghavanP #and# GibsonD , title = {{Inferring Web Communities from Link Topology}} , booktitle = {{Proceedings of the 9th ACM Conference on Hypertext and Hypermedia}} , pages = {225--234} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/276627.276652" , year = 1998 } @unpublished{krl-cgrn-00 , author = KrapivskyPL #and# RednerS #and# LeyvrazF , title = {{Connectivity of Growing Random Networks}} , month = sep , note = {http://xxx.sissa.it/ps/cond-mat/0005139} , year = 2000 } @Article{krr-lg-96 , author = KhullerS #and# RaghavachariB #and# RosenfeldA , title = {{Landmarks in Graphs}} , journal = j-dam , number = 3 , pages = {217--229} , pdf = "http://www.sciencedirect.com/science?_ob=MiamiImageURL&_imagekey=B6WJ0-4RFM9XW-3-1&_cdi=6864&_user=2" , url = "http://dx.doi.org/10.1016/0166-218X(95)00106-2" , volume = 70 , year = 1996 } @inproceedings{krrstu-smwg-00 , author = KumarR #and# RaghavanP #and# RajagopalanS #and# SivakumarD #and# TomkinsAS #and# UpfalE , title = {{Stochastic models for the web graph}} , booktitle = {{Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00)}} , year = 2000 } @article{krrt-twecc-99 , author = KumarR #and# RaghavanP #and# RajagopalanS #and# TomkinsAS , title = {{Trawling the web for emerging cyber-communities}} , journal = j-cn , number = {11--16} , pages = {1481--1493} , volume = 31 , year = 1999 } @InProceedings{krsw-sdaac-11 , author = KatzB #and# RutterI #and# StrasserB #and# WagnerD , title = {{Speed Dating: An Algorithmic Case Study Involving Matching and Scheduling}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {292--303} , publisher = pub-springer , series = ser-springer_lncs , volume = 6630 , year = 2011 } @inproceedings{krt-fdmfa-92 , author = KingV #and# RaoS #and# TarjanRE , title = {{A Faster Deterministic Maximum Flow Algorithm}} , booktitle = {{Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)}} , month = jan , pages = {157--164} , year = 1992 } @Article{krw-a-12 , author = KatzB #and# RutterI #and# WoegingerGJ , title = {{An algorithmic study of switch graphs}} , journal = j-acta-inf , number = 5 , pages = {295--312} , pdf = "http://i11www.ira.uka.de/extra/publications/krw-a-12.pdf" , volume = 49 , year = 2012 } @InProceedings{krw-assg-09 , author = KatzB #and# RutterI #and# WoegingerGJ , title = {{An Algorithmic Study of Switch Graphs}} , booktitle = {{Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'09)}} , month = jun , pages = {226--237} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/e6004264v60u2512/" , volume = 5911 , year = 2009 } @inproceedings{ks-amc-93 , author = KargerDR #and# SteinC , title = {{An {${\tilde{O}}(n^2)$} Algorithm for Minimum Cuts}} , booktitle = {{Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)}} , month = may , pages = {757--765} , year = 1993 } @Article{ks-anonr-09 , author = KliewerN #and# SuhlL , title = {{A Note on the Online Nature of the Railway Delay Management Problem}} , journal = j-networks , year = 2010 } @InProceedings{ks-dnd-80 , author = KruskalJB #and# SeeryJB , title = {{Designing Network Diagrams}} , booktitle = {{Proceedings of the First General Conference on Social Graphics}} , pages = {22--50} , publisher = pub-usdc , year = 1980 } @Article{ks-fptdn-93 , author = KaufmanDE #and# SmithRL , title = {{Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Application}} , journal = j-jits , number = 1 , pages = {1--11} , volume = 1 , year = 1993 } @Article{ksetb-gtivs-03 , author = KwatraV #and# SchodlA #and# EssaI #and# TurkG #and# BobickA , title = {{Graphcut Textures: Image and Video Synthesis using Graph Cuts}} , journal = j-acmtg , number = 3 , pages = {277--286} , volume = 22 , year = 2003 } @InProceedings{kss-spbvd-06 , author = KeimDA #and# SchneidewindJ #and# SipsM , title = {{Scalable Pixel Based Visual Data Exploration}} , booktitle = {{Pixelization Paradigm, Revised Selected Papers of the First Visual Information Expert Workshop}} , month = apr , pages = {12--24} , pdf = "http://www.springerlink.com/content/9x14431g468gl122/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/9x14431g468gl122/?p=4842f1faf28d4753a1e43cefb7c97300&pi=1" , volume = 1 , year = 2006 } @InProceedings{ksssw-cmmsp-07 , author = KnoppS #and# SandersP #and# SchultesD #and# SchulzF #and# WagnerD , title = {{Computing Many-to-Many Shortest Paths Using Highway Hierarchies}} , booktitle = {{Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)}} , pages = {36--45} , publisher = pub-siam , year = 2007 } @techreport{ksssw-fcdth-06 , author = KnoppS #and# SandersP #and# SchultesD #and# SchulzF #and# WagnerD , title = {{Fast Computation of Distance Tables using Highway Hierarchies}} , institution = inf_ka , year = 2006 } @article{kst-pz-54 , author = KoevariT #and# SosVT #and# TuranP , title = {{On a problem of Zarankiewicz}} , journal = j-cmpan , pages = {50--57} , volume = 3 , year = 1954 } @InProceedings{ksv-amcmr-10 , author = KarloffH #and# SuriS #and# VassilevskaV , title = {{A Model of Computation for MapReduce}} , booktitle = {{Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)}} , pages = {938--948} , publisher = pub-siam , year = 2010 } @InProceedings{ksw-teuss-04 , author = KleinbergJM #and# SlivkinsA #and# WexlerT , title = {{Triangulation and Embedding Using Small Sets of Beacons}} , booktitle = {{Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)}} , pages = {444--453} , publisher = pub-ieeecs , year = 2004 } @InProceedings{kt-a-01 , author = KingV #and# ThorupM , title = {{A space saving trick for directed dynamic transitive closure and shortest path algorithms.}} , booktitle = {{Proceedings of the 7th Annual International Conference on Computing Combinatorics (COCOON'01)}} , pages = {268--277} , publisher = pub-springer , series = ser-springer_lncs , volume = 2108 , year = 2001 } @InCollection{kt-c-05 , author = KammerF #and# TaeubigH , title = {{Connectivity}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {142--177} , pdf = "http://springerlink.metapress.com/content/xn9teuuwvq8j9xl4/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/xn9teuuwvq8j9xl4/" , volume = 3418 , year = 2005 } @inproceedings{kt-cfdg-78 , author = KishiG #and# TakeuchiM , title = {{On centrality functions of a non-directed graph}} , address = "Budapest" , booktitle = {{Proceedings of the 6th Colloquium on Microwave Communication}} , year = 1978 } @Article{kt-dgcei-07 , author = KohliP #and# TorrPH , title = {{Dynamic Graph Cuts for Efficient Inference in Markov Random Fields}} , journal = j-tpami , month = dec , number = 12 , pages = {2079--2088} , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4359296" , volume = 29 , year = 2007 } @article{kt-eaffamec-86 , author = KarzanovAV #and# TimofeevEA , title = {{Efficient algorithm for finding all minimal edge cuts of a nonoriented graph}} , journal = j-cy , number = 2 , pages = {156--162} , volume = 22 , year = 1986 } @inproceedings{ktbc-olmfc-91 , author = KanevskyA #and# TamassiaR #and# DiBattistaG #and# ChenJianer , title = {{On-Line Maintenance of the Four-Connected Components of a Graph}} , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}} , month = oct , pages = {793--801} , year = 1991 } @article{kts-iddsg-90 , author = KrishnamoorthyV #and# ThulasiramanK #and# SwamyMNS , title = {{Incremental Distance and Diameter Sequences of a Graph: {New} Measures of Network Performance}} , journal = j-tc , month = feb , number = 2 , pages = {230--237} , volume = 39 , year = 1990 } @unpublished{kv-aslg-99 , author = KannanR #and# VinayV , title = {{Analyzing the Structure of Large Graphs}} , note = {Manuscript} , year = 1999 } @Book{kv-cota-08 , author = KorteB #and# VygenJ , title = {{Combinatorial Optimization: Theory and Algorithms}} , booktitle = {{Combinatorial Optimization: Theory and Algorithms}} , publisher = pub-springer , series = ser-ac , volume = 21 , year = 2008 } @InProceedings{kvv-cgds-00 , author = KannanR #and# VempalaS #and# VettaA , title = {{On Clusterings - Good, Bad and Spectral}} , booktitle = {{Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00)}} , pages = {367--378} , year = 2000 } @Article{kvv-ocgbs-04 , author = KannanR #and# VempalaS #and# VettaA , title = {{On Clusterings: Good, Bad, Spectral}} , journal = j-acm , month = may , number = 3 , pages = {497--515} , pdf = "http://www.cc.gatech.edu/~vempala/papers/jacm-spectral.pdf" , volume = 51 , year = 2004 } @InProceedings{kvw-eespc-10 , author = KatzB #and# VolkerM #and# WagnerD , title = {{Energy Efficient Scheduling with Power Control for Wireless Networks}} , booktitle = {{Proceedings of the 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'10)}} , pages = {144--153} , pdf = "http://i11www.ira.uka.de/extra/publications/kvw-eespc-10.pdf" , publisher = pub-ics , url = "http://www.ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=5518815" , year = 2010 } @InProceedings{kvw-lslim-08 , author = KatzB #and# VolkerM #and# WagnerD , title = {{Link Scheduling in Local Interference Models}} , booktitle = {{Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08)}} , pages = {57--71} , pdf = "http://www.springerlink.com/content/t1u1n0043x013217/fulltext.pdf" , series = ser-springer_lncs , url = "http://www.springerlink.com/content/t1u1n0043x013217/" , volume = 5389 , year = 2008 } @book{kw-dgmm-01 , editor = KaufmannM #and# WagnerD , title = {{Drawing Graphs: Methods and Models}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/xkru1gvnyh5p/" , volume = 2025 , year = 2001 } @InProceedings{kw-madps-07 , author = KatzB #and# WagnerD , title = {{Multi-scale Anchor-free Distributed Positioning in Sensor Networks}} , booktitle = {{Proceedings of the International Workshop on Theoretical and Algorithmic Aspects of Sensor Networks (WTASA'07)}} , pages = {64--74} , pdf = "http://i11www.ira.uka.de/extra/publications/kw-madps-07.pdf" , year = 2007 } @InCollection{kw-madps-08 , author = KatzB #and# WagnerD , title = {{Multi-scale Anchor-free Distributed Positioning in Sensor Networks}} , booktitle = {{Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects}} , month = oct , pages = {203--220} , publisher = pub-springer , series = ser-lnee , url = "http://www.springer.com/engineering/signals/book/978-0-387-77319-3" , volume = 7 , year = 2008 } @InProceedings{kw-mapsl-08 , author = KrugM #and# WagnerD , title = {{Minimizing the Area for Planar Straight-Line Grid Drawings}} , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}} , month = jan , pages = {207--212} , pdf = "http://i11www.iti.uni-karlsruhe.de/members/krug/publications/files/kw-mapsl-2007.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 4875 , year = 2008 } @InProceedings{kw-mmmcd-03 , author = KaufmannM #and# WieseR , title = {{Maintaining the Mental Map for Circular Drawings}} , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {12--22} , publisher = pub-springer , series = ser-springer_lncs , volume = 2528 , year = 2003 } @InCollection{kw-rr-05 , author = KlauGW #and# WeiskircherR , title = {{Robustness and Resilience}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {417--437} , pdf = "http://springerlink.metapress.com/content/vrxjxbkvgel9e72d/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/vrxjxbkvgel9e72d/" , volume = 3418 , year = 2005 } @InProceedings{kw-wedl-96 , author = KuchemR #and# WagnerD , title = {{Wiring edge-disjoint layouts}} , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}} , location = "Berkeley, California, USA" , month = jan , pages = {271--285} , publisher = pub-springer , series = ser-springer_lncs , volume = 1090 , year = 1997 } @Article{kw-wpl-99 , author = KuchemR #and# WagnerD , title = {{Wiring Planar Layouts}} , journal = j-cgta , pages = {255--273} , volume = 14 , year = 1999 } @InProceedings{kww-aotlc-89 , author = KuchemR #and# WagnerD #and# WagnerF , title = {{Area-Optimal Three-Layer Channel Routing}} , booktitle = {{Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89)}} , month = oct , pages = {506--511} , year = 1989 } @Article{kww-oatlk-96 , author = KuchemR #and# WagnerD #and# WagnerF , title = {{Optimizing Area for Three-Layer Knock-Knee Channel Routing}} , journal = j-alg , month = may , number = 5 , pages = {496--519} , pdf = "http://www.springerlink.com/content/j1413w4435158464/fulltext.pdf" , url = "http://www.springerlink.com/content/j1413w4435158464/" , volume = 15 , year = 1996 } @InProceedings{kwy-rdc-05 , author = KeyanL #and# WanxingS #and# Yun-huaL , title = {{Research on parallel algorithm of DC optimal power flow in large interconnection power grids}} , booktitle = {{Proceedings of the 8th International Conference on Electrical Machines and Systems (ICEMS'05)}} , note = {Vol. 2} , pages = {1031--1036} , publisher = pub-aaaip , volume = 2 , year = 2005 } @InProceedings{kwz-wcoac-03 , author = KuhnF #and# WattenhoferR #and# ZollingerA , title = {{Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing}} , booktitle = {{Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03)}} , year = 2003 } %% -------------------------------------------------------------- @Book{l-a-05 , author = LangSe , title = {{Algebra}} , booktitle = {{Algebra}} , publisher = pub-springer , year = 2005 } @Book{l-aeee-11 , author = LeeJ , title = {{Advanced Electrical and Electronics Engineering}} , booktitle = {{Advanced Electrical and Electronics Engineering}} , publisher = pub-springer , series = ser-lnee , volume = 87 , year = 2011 } @InProceedings{l-aeept-06 , author = LautherU , title = {{An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}} , month = nov , year = 2006 } @InCollection{l-aeept-09 , author = LautherU , title = {{An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {19--40} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @InCollection{l-aefea-04 , author = LautherU , title = {{An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background}} , booktitle = {{Geoinformation und Mobilit{\"a}t - von der Forschung zur praktischen Anwendung}} , pages = {219--230} , publisher = pub-igi , volume = 22 , year = 2004 } @mastersthesis{l-amioch-12 , author = LaschingerM , title = {{A MapReduce Implementation of Contraction Hierarchies}} , month = may , school = "Karlsruhe Institute of Technology" , type = {bachelor thesis} , year = 2012 } @techreport{l-amric-12 , author = LaschingerM , title = {{A MapReduce Implementation of Contraction Hierarchies}} , institution = "ITI Sanders" , year = 2012 } @Article{l-atsc-07 , author = LuxburgUv , title = {{A Tutorial on Spectral Clustering}} , journal = j-ssc , month = dec , number = 4 , pages = {395--416} , pdf = "http://www.springerlink.com/content/jq1g17785n783661/fulltext.pdf" , url = "http://www.springerlink.com/content/jq1g17785n783661/" , volume = 17 , year = 2007 } @book{l-caicl-90 , author = LengauerT , title = {{Combinatorial Algorithms for Integrated Circuit Layout}} , publisher = pub-wiley , year = 1990 } @article{l-cd-73 , author = LovaszL , title = {{Connectivity in Digraphs}} , journal = j-jcombthb , month = aug , number = 2 , pages = {174--177} , volume = 15 , year = 1973 } @article{l-cgcsgs-50 , author = LuceRD , title = {{Connectivity and generalized cliques in sociometric group structure}} , journal = j-psy , pages = {169--190} , volume = 15 , year = 1950 } @article{l-cph-73 , author = LawlerEL , title = {{Cutsets and Partitions of hypergraphs}} , journal = j-networks , pages = {275--285} , volume = 3 , year = 1973 } @InCollection{l-dgd-01 , author = LandgrafB , title = {{3D Graph Drawing}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {172--192} , pdf = "http://springerlink.metapress.com/content/l3vv18dd6mn63ap8/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/l3vv18dd6mn63ap8/" , volume = 2025 , year = 2001 } @mastersthesis{l-dhpet-09 , author = LongJ , title = {{Developing high performance extensible transportation planning algorithm based on OSGI}} , school = "Karlsruhe Institute of Technology" , year = 2009 } @article{l-eapogb-66 , author = LeifmanLYa , title = {{An Efficient Algorithm for Partitioning an Oriented Graph into Bicomponents}} , journal = j-cy , number = 5 , pages = {15--18} , volume = 2 , year = 1966 } @misc{l-emg-10 , author = LafouOF , title = {{Engineering von Modularity-basiertem Graphenclustern,}} , institution = "Karlsruhe Institute of Technology (KIT)" , month = sep , note = {Student Project, Studienarbeit} , school = "Department of Informatics" , year = 2010 } @InProceedings{l-gapcg-81 , author = LauchliP , title = {{Generating All Planar 0-, 1-, 2-, 3-Connected Graphs}} , booktitle = {{Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG'80)}} , pages = {379--382} , publisher = pub-springer , series = ser-springer_lncs , year = 1981 } @misc{l-grg-09 , author = LovaszL , title = {{Geometric Representations of Graphs}} , url = "www.cs.elte.hu/~lovasz/geomrep.pdf" , year = 2009 } @article{l-igbvc-82 , author = LuksEM , title = {{Isomorphism of graphs of bounded valence can be tested in polynomial time}} , journal = j-css , pages = {42--65} , url = "http://www.cs.uoregon.edu/~luks/iso.pdf" , volume = 25 , year = 1982 } @Article{l-ipfnv-83 , author = LenstraHW , title = {{Integer Programming with a Fixed Number of Variables}} , journal = j-mmor , month = nov , number = 4 , pages = {538--548} , volume = 8 , year = 1983 } @Article{l-lpcm-82 , author = LloydS , title = {{Least squares quantization in PCM}} , journal = j-tinfth , number = 2 , pages = {129--137} , volume = 28 , year = 1982 } @mastersthesis{l-mcgof-11 , author = LisowskiD , title = {{Modularity-basiertes Clustern von dynamischen Graphen im Offline-Fall}} , note = {http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished} , school = "Department of Informatics, Karlsruhe Institute of Technology (KIT)" , year = 2011 } @misc{l-metis-07 , author = LabK , title = {{METIS - Family of Multilevel Partitioning Algorithms}} , url = "http://glaros.dtc.umn.edu/gkhome/views/metis" , year = 2007 } @article{l-npcgi-81 , author = LubiwA , title = {{Some {$\mathcal{NP}$}-complete problems similar to graph isomorphism}} , journal = j-sicomp , pages = {11--24} , volume = 10 , year = 1981 } @Article{l-opgsm-83 , author = LouiRP , title = {{Optimal Paths in Graphs with Stochastic or Multidimensional Weights}} , journal = j-comm-acm , number = 9 , pages = {670--676} , volume = 26 , year = 1983 } @article{l-otscg-79 , author = LovaszL , title = {{On the {Shannon} capacity of a graph}} , journal = j-tinfth , pages = {1--7} , volume = 25 , year = 1979 } @misc{l-p-07 , author = LangS , title = {{Protein domain decomposition using spectral graph partitioning}} , institution = uni_ka , month = apr , note = {Student Project, Studienarbeit} , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-lang-07.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished" , year = 2007 } @article{l-parsn-92 , author = LevinsonR , title = {{Pattern associativity and the retrieval of semantic networks}} , journal = j-cma , number = 2 , pages = {573--600} , url = "citeseer.lcs.mit.edu/levinson92pattern.html" , volume = 23 , year = 1992 } @InCollection{l-ra-05 , author = LernerJ , title = {{Role Assignments}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {216--252} , pdf = "http://springerlink.metapress.com/content/atcl0b2dxeyy2n63/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/atcl0b2dxeyy2n63/" , volume = 3418 , year = 2005 } @article{l-recg-74 , author = LesniakL , title = {{Results on the edge-connectivity of graphs}} , journal = j-dima , pages = {351--354} , volume = 8 , year = 1974 } @misc{l-spgef-97 , author = LautherU , title = {{Slow Preprocessing of Graphs for Extremely Fast Shortest Path Calculations}} , note = {Lecture at the Workshop on Computational Integer Programming at ZIB} , year = 1997 } @phdthesis{l-ssvn-07 , author = LernerJ , title = {{Structural Similarity of Vertices in Networks}} , url = "http://www.ub.uni-konstanz.de/kops/volltexte/2008/5330/" , year = 2007 } @book{l-tsh-97 , author = LehmannEL , title = {{Testing Statistical Hypotheses}} , edition = second , publisher = pub-springer , series = ser-springer_stis , year = 1997 } @misc{lapack , title = {{LAPACK -- Linear Algebra PACKage}} , note = {\url{http://www.netlib.org/lapack}} } @Article{lbohm-sebcl-11 , author = LiuJ #and# BenigniA #and# ObradovicD #and# HircheS #and# MontiA , title = {{State Estimation and Branch Current Learning Using Independent Local Kalman Filter with Virtual Disturbance Model}} , journal = j-ieeetim , month = sep , number = 9 , pages = {3026--3034} , volume = 60 , year = 2011 } @book{lc-tope-98 , author = LehmannEL #and# CasellaG , title = {{Theory of Point Estimation}} , edition = second , publisher = pub-springer , series = ser-springer_stis , year = 1998 } @InCollection{lchpz-cmppi-07 , author = LinCh #and# ChoY #and# HwangW #and# PeiP #and# ZhangA , title = {{Clustering Methods in a Protein-Protein Interaction Network}} , booktitle = {{Knowledge Discovery in Bioinformatics}} , month = may , pages = {319--355} , publisher = pub-wileys , url = "http://www3.interscience.wiley.com/cgi-bin/summary/114268853/SUMMARY" , year = 2007 } @Article{ld-stcg-05 , author = LubbeckeME #and# DesrosiersJ , title = {{Selected Topics in Column Generation}} , journal = j-or , month = nov , number = 6 , pages = {1017--1023} , volume = 53 , year = 2005 } @InProceedings{lec-aaptg-67 , author = LempelA #and# EvenS #and# CederbaumI , title = {{An Algorithm for Planarity Testing of Graphs}} , booktitle = {{Proceedings of the International Symposium on the Theory of Graphs}} , pages = {215--232} , publisher = pub-gb , year = 1967 } @Article{lf-b-09 , author = LancichinettiA #and# FortunatoS , title = {{Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities}} , journal = j-pr-e , number = 1 , pages = 016118 , volume = 80 , year = 2009 } @Article{lf-ca-09 , author = LancichinettiA #and# FortunatoS , title = {{Community detection algorithms: A comparative analysis}} , journal = j-pr-e , month = nov , number = 5 , url = "http://link.aps.org/doi/10.1103/PhysRevE.80.056117" , volume = 80 , year = 2009 } @Article{lfk-d-09 , author = LancichinettiA #and# FortunatoS #and# KertezJ , title = {{Detecting the overlapping and hierarchical community structure of complex networks}} , journal = j-njp , number = 033015 , pdf = "http://santo.fortunato.googlepages.com/njp9_3_033015.pdf" , url = "http://www.iop.org/EJ/njp" , volume = 11 , year = 2009 } @unpublished{lfk-dohcs-08 , author = LancichinettiA #and# FortunatoS #and# KertezJ , title = {{Detecting the Overlapping and Hierarchical Community Structure of Complex Networks}} , note = {http://arxiv.org/abs/0802.1218} , url = "http://arxiv.org/abs/0802.1218" , year = 2008 } @Article{lgh-slssu-06 , author = LammerS #and# GehlsenB #and# HelbingD , title = {{Scaling Laws in the Spatial Structure of Urban Road Networks}} , journal = j-physa , number = 1 , pages = {89--95} , pdf = "http://arxiv.org/pdf/physics/0603257" , url = "http://dx.doi.org/10.1016/j.physa.2006.01.051" , volume = 363 , year = 2006 } @InProceedings{lgr-eascr-09 , author = LuoJ #and# GirardA #and# RosenbergC , title = {{Efficient Algorithms to Solve a Class of Resource Allocation Problems in Large Wireless Networks}} , booktitle = {{7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)}} , month = jun , year = 2009 } @techreport{lgz-ftsac-03 , author = LeeCPC #and# GolubGH #and# ZeniosSA , title = {{A fast two-stage algorithm for computing PageRank}} , institution = "Stanford University" , number = {SCCM-03-15} , year = 2003 } @InProceedings{lh-psvli-08 , author = LeskovecJ #and# HorvitzE , title = {{Planetary-Scale Views on a Large Instant-Messaging Network}} , booktitle = {{Proceedings of the 17th International World Wide Web Conference (WWW2008)}} , pages = {915--924} , pdf = "http://research.microsoft.com/~horvitz/leskovec_horvitz_www2008.pdf" , url = "http://research.microsoft.com/~horvitz/Messenger_graph_www.htm" , year = 2008 } @InProceedings{lkf-gotdl-05 , author = LeskovecJ #and# KleinbergJM #and# FaloutsosC , title = {{Graphs Over Time: Densification Laws, Shrinking Diameters and Possible Explanations}} , booktitle = {{Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}} , pages = {177--187} , pdf = "http://www.cs.cornell.edu/home/kleinber/kdd05-time.pdf" , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=1081893" , year = 2005 } @InProceedings{lkr-aaeel-04 , author = LuG #and# KrishnamachariB #and# RaghavendraCS , title = {{An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Networks}} , booktitle = {{18th International Parallel and Distributed Processing Symopsium (IPDPS'04)}} , pages = {224a} , publisher = pub-ics , url = "http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303264" , year = 2004 } @Article{lksn-o-06 , author = LehmannK #and# KaufmannM #and# SteigeleS #and# NieseltK , title = {{On the maximal cliques in $c$-max-tolerance graphs and their application in clustering molecular sequences}} , journal = j-amb , number = 9 , volume = 1 , year = 2006 } @InProceedings{llld-e-07 , author = LuoH #and# LuoJ #and# LiuYh #and# DasSK , title = {{Energy efficient routing with adaptive data fusion in sensor networks}} , booktitle = {{DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computing}} , pages = {80--88} , publisher = pub-acm , year = 2005 } @inproceedings{llmm-aew-03 , author = LauraL #and# LeonardiS #and# MillozziS #and# MeyerU , title = {{Algorithms and Experiments for the Webgraph}} , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}} , publisher = pub-springer , series = ser-springer_lncs , volume = 2832 , year = 2003 } @article{llr-gamis-80 , author = LawlerEL #and# LenstraJK #and# RinnooyKanAHG , title = {{Generating all maximal independent sets: {$\mathcal{NP}$}-hardness and polynomial-time algorithms}} , journal = j-sicomp , number = 3 , pages = {558--565} , volume = 9 , year = 1980 } @Article{lls-icvrp-04 , author = LinC #and# LuH #and# SunI , title = {{Improved Compact Visibility Representation of Planar Graph via {S}chnyder's Realizer}} , journal = j-sidma , number = 1 , pages = {19--29} , volume = 18 , year = 2004 } @inproceedings{llw-pigcaa-86 , author = LinialN #and# LovaszL #and# WigdersonA , title = {{A Physical Interpretation of Graph Connectivity and Its Algorithmic Applications}} , booktitle = {{Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS'86)}} , month = oct , pages = {39--48} , year = 1986 } @article{llw-rbcegc-88 , author = LinialN #and# LovaszL #and# WigdersonA , title = {{Rubber Bands, Convex Embeddings and Graph Connectivity}} , journal = j-comb , number = 1 , pages = {91--102} , volume = 8 , year = 1988 } @Article{lly-cfpos-03 , author = LiaoC #and# LuH #and# YenH , title = {{Compact Floor-Planning via Orderly Spanning Trees}} , journal = j-jalg , pages = {441--451} , volume = 48 , year = 2003 } @techreport{lm-dipr-04 , author = LangvilleAN #and# MeyerCD , title = {{Deeper Inside PageRank}} , address = "Raleigh, NC, USA" , institution = "Department of Mathematics, North Carolina State University" , month = {Mar} , note = {accepted by {\em Internet Mathematics}} , year = 2004 } @article{lm-rsrsl-04 , author = LempelR #and# MoranS , title = {{Rank-Stability and rank-similarity of link-based web ranking algorithms in authority-connected graphs}} , journal = j-ir , note = {in press} , year = 2004 } @techreport{lm-semwir-04 , author = LangvilleAN #and# MeyerCD , title = {{A survey of eigenvector methods of web information retrieval}} , address = "Raleigh, NC, USA" , institution = "Department of Mathematics, North Carolina State University" , month = {Jan} , note = {accepted by {\em The SIAM Review}} , year = 2004 } @article{lm-tsals-00 , author = LempelR #and# MoranS , title = {{The stochastic approach for link-structure analysis ({SALSA}) and the {TKC} effect}} , journal = j-cn , pages = {387--401} , volume = 33 , year = 2000 } @Article{ln-csdn-08 , author = LeichtEA #and# NewmanMEJ , title = {{Community Structure in Directed Networks}} , journal = j-phrl , month = mar , number = 11 , pages = {118703+} , url = "http://dx.doi.org/10.1103/PhysRevLett.100.118703" , volume = 100 , year = 2008 } @InProceedings{ln-pldo-12 , author = LofflerM #and# NollenburgM , title = {{Planar {L}ombardi Drawings of Outerpaths}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , note = {Poster abstract.} , pages = {561--562} , pdf = "http://i11www.ira.uka.de/extra/publications/ln-pldo-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.og/10.1007/978-3-642-36763-2_53" , volume = 7704 , year = 2013 } @InProceedings{ln-sbolb-10 , author = LofflerM #and# NollenburgM , title = {{Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling }} , booktitle = {{Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG '10)}} , pages = {203--206} , pdf = "http://i11www.ira.uka.de/extra/publications/ln-sbolb-10.pdf" , publisher = pub-um , url = "http://cccg.ca/proceedings/2010/paper54.pdf" , year = 2010 } @article{lp-mmags-49 , author = LuceRD #and# PerryA , title = {{A method of matrix analysis of group structure}} , journal = j-psy , pages = {95--116} , volume = 14 , year = 1949 } @misc{lp_solve , title = {{lp-solve}} , note = {A Mixed Integer Linear Programming (MILP) solver, free under the LGPL, {http://lpsolve.sourceforge.net/}} , url = "http://lpsolve.sourceforge.net/" } @Article{lr-m-99 , author = LeightonFT #and# RaoS , title = {{Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}} , journal = j-acm , number = 6 , pages = {787--832} , url = "http://portal.acm.org/citation.cfm?doid=331524.331526" , volume = 46 , year = 1999 } @InProceedings{ls-csarr-12 , author = LuxenD #and# SchieferdeckerD , title = {{Candidate Sets for Alternative Routes in Road Networks}} , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}} , pages = {260--270} , pdf = "http://i11www.ira.uka.de/extra/publications/ls-csarr-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 7276 , year = 2012 } @Article{ls-csarr-13 , author = LuxenD #and# SchieferdeckerD , title = {{Candidate Sets for Alternative Routes in Road Networks}} , journal = j-acm-ea , note = {Submitted to} , year = 2013 } @Article{ls-dajmi-08 , author = LeydesdorffL #and# SchankT , title = {{Dynamic Animations of Journal Maps: Indicators of Structural Change and Interdisciplinary Developments}} , journal = j-jasist , number = 11 , pages = {1810--1818} , volume = 59 , year = 2008 } @techreport{ls-dmlca-12 , author = LuxenD #and# SchieferdeckerD , title = {{Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing}} , institution = "Karlsruhe Institute of Technology" , url = "http://arxiv.org/abs/1208.2543" , year = 2012 } @article{ls-dnmis-69 , author = LuccioF #and# SamiM , title = {{On the decomposition of networks in minimally interconnected subnetworks}} , journal = j-tct , pages = {184--188} , volume = {CT-16} , year = 1969 } @InProceedings{ls-hdfue-11 , author = LuxenD #and# SandersP , title = {{Hierarchy Decomposition for Faster User Equilibria on Road Networks}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {242--253} , pdf = "http://www.springerlink.com/content/w72328613527485u/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 6630 , year = 2011 } @Article{lsbhsd-tbdcd-04 , author = LusseauD #and# SchneiderK #and# BoisseauO #and# HaaseP #and# SlootenE #and# DawsonS , title = {{The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations}} , journal = j-bes , month = sep , number = 4 , pages = {396--405} , pdf = "http://www.springerlink.com/content/pepxvj4lu42ur2gw/fulltext.pdf" , url = "http://www.springerlink.com/content/pepxvj4lu42ur2gw/" , volume = 54 , year = 2004 } @Article{lssn-asn-08 , author = LeydesdorffL #and# SchankT #and# ScharnhorstA #and# NooyW , title = {{Animating the development of Social Networks over time using a dynamic extension of multidimensional scaling.}} , number = 6 , pages = {611--626} , volume = 17 , year = 2008 } @Article{lst-a-90 , author = LenstraJK #and# ShmoysDB #and# TardosE , title = {{Approximation algorithms for scheduling unrelated parallel machines}} , journal = j-mp , pages = {259--271} , volume = 46 , year = 1990 } @Article{lt-apst-80 , author = LiptonRJ #and# TarjanR , title = {{Applications of a Planar Separator Theorem}} , journal = j-sicomp , pages = {615--627} , volume = 9 , year = 1980 } @Article{lt-astpg-79 , author = LiptonRJ #and# TarjanRE , title = {{A Separator Theorem for Planar Graphs}} , journal = j-sijam , month = apr , number = 2 , pages = {177--189} , pdf = "http://www.cs.princeton.edu/courses/archive/fall06/cos528/handouts/sepplanar.pdf" , volume = 36 , year = 1979 } @article{lt-dfsagfmisgl-81 , author = LoukakisE #and# TsourosK , title = {{A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically}} , journal = j-comput , pages = {249--266} , volume = 27 , year = 1981 } @InProceedings{lt-tcamc-11 , author = LiA #and# TangL , title = {{The Complexity and Approximability of Minimum Contamination Problems}} , booktitle = {{Proceedings of the 8th annual conference on Theory and applications of models of computation}} , pages = {298--307} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-20877-5_30" , year = 2011 } @InProceedings{lv-rtros-11 , author = LuxenD #and# VetterC , title = {{Real-Time Routing with OpenStreetMap data}} , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}} , publisher = pub-acm , year = 2011 } @InProceedings{lw-rbttg-01 , author = LiebersA #and# WeiheK , title = {{Recognizing Bundles in Time Table Graphs - A Structural Approach}} , booktitle = {{Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00)}} , pages = {87--98} , publisher = pub-springer , series = ser-springer_lncs , volume = 1982 , year = 2001 } @article{lw-seisn-71 , author = LorrainF #and# WhiteHC , title = {{Structural Equivalence of Individuals in Social Networks}} , journal = j-jms , pages = {49--80} , volume = 1 , year = 1971 } @Article{lww-cdcas-11 , author = LiX #and# WangYa #and# WangYu , title = {{Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks}} , journal = j-tc , month = mar , number = 3 , pages = {386--399} , volume = 60 , year = 2011 } @Article{lww-cnke-96 , author = LiebersA #and# WagnerD #and# WeiheK , title = {{C++ im Nebenfachstudium: Konzepte und Erfahrungen}} , journal = j-is , month = oct , number = 5 , pages = {262--265} , pdf = "http://www.springerlink.com/content/y4n5fclpxajnc5bu/fulltext.pdf" , url = "http://www.springerlink.com/content/y4n5fclpxajnc5bu/" , volume = 19 , year = 1996 } @Article{lww-ohrbt-00 , author = LiebersA #and# WagnerD #and# WeiheK , title = {{On the Hardness of Recognizing Bundles in Time Table Graphs}} , journal = j-ijfcs , number = 3 , pages = {467--484} , volume = 11 , year = 2000 } @InProceedings{lww-ohrbt-99 , author = LiebersA #and# WagnerD #and# WeiheK , title = {{On the Hardness of Recognizing Bundles in Time Table Graphs}} , booktitle = {{Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99)}} , pages = {325--337} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/v42kx15y960rn58a/" , volume = 657 , year = 1999 } @techreport{lww-rbttg-99 , author = LiebersA #and# WeiheK #and# WagnerD , title = {{Recognizing Bundles in Time Table Graphs---a Structural Approach}} , institution = "Universit{\"a}t Konstanz" , note = {Konstanzer Schriften in Mathematik und Informatik} , number = 96 , year = 1999 } @Book{lwz-alcn-09 , editor = LernerJ #and# WagnerD #and# ZweigKA , title = {{Algorithmics of Large and Complex Networks}} , booktitle = {{Algorithmics of Large and Complex Networks}} , publisher = pub-springer , series = ser-springer_lncs , volume = 5515 , year = 2009 } @Article{ly-o-94 , author = LundC #and# YannakakisM , title = {{On the hardness of approximating minimization problems}} , journal = j-acm , month = sep , number = 5 , pages = {960--981} , volume = 41 , year = 1994 } @Book{lz-alcn-09 , editor = LernerJ #and# ZweigKA , title = {{Algorithmics of Large and Complex Networks}} , booktitle = {{Algorithmics of Large and Complex Networks}} , publisher = pub-springer , series = ser-springer_lncs , volume = 5515 , year = 2009 } @InProceedings{lzgt-iorte-05 , author = LiuY #and# ZhangH #and# GongiW #and# TowslefD , title = {{On the Interaction between Overlay Routing and Traffic Engineering}} , booktitle = {{Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , month = mar , pages = {2543--2553} , pdf = "http://ieeexplore.ieee.org/iel5/9990/32102/01498539.pdf" , publisher = pub-ieeecs , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1498539" , volume = 4 , year = 2005 } %% -------------------------------------------------------------- @Article{m-a-90 , author = MulmuleyK , title = {{A fast planar partition algorithm}} , journal = j-sc , month = aug , number = {3-4} , pages = {253--280} , url = "http://dx.doi.org/10.1016/S0747-7171(08)80064-8" , volume = 10 , year = 1990 } @Article{m-a-95 , author = McGeochCC , title = {{All-pairs shortest paths and the essential subgraph}} , journal = j-alg , month = may , number = 5 , pages = {426--441} , volume = 13 , year = 1995 } @Article{m-accpg-37 , author = MacLaneS , title = {{A Combinatorial Condition for Planar Graphs}} , journal = j-fm , pages = {22--32} , volume = 28 , year = 1937 } @Book{m-amsmp-06 , editor = MielkeA , title = {{Analysis, Modeling and Simulation of Multiscale Problems}} , booktitle = {{Analysis, Modeling and Simulation of Multiscale Problems}} , publisher = pub-springer , year = 2006 } @incollection{m-ana-89 , author = MitchellJC , editor = FreemanLC #and# WhiteDR #and# RomneyAK , title = {{Algorithms and Network Analysis: A Test of Some Analytical Procedures on {Kapferer's} Tailor Shop Material}} , booktitle = {{Research Methods in Social Network Analysis}} , pages = {365--391} , publisher = pub-gmup , year = 1989 } @Article{m-as-88 , author = MehlhornK , title = {{A faster approximation algorithm for the Steiner problem in graphs}} , journal = j-ipl , number = 3 , pages = {125--128} , volume = 27 , year = 1988 } @Article{m-asrah-83 , author = MurtaghF , title = {{A Survey of Recent Advances in Hierarchical Clustering Algorithms}} , journal = j-tcj , number = 4 , pages = {354--259} , url = "http://comjnl.oxfordjournals.org/cgi/content/abstract/26/4/354" , volume = 26 , year = 1983 } @misc{m-bpba-05 , author = MuellerK , title = {{Berechnung k{\"u}rzester Pfade unter Beachtung von Abbiegeverboten}} , note = {Student Research Project} , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/studienarbeit-kmueller-05.pdf" , school = inf_ka , year = 2005 } @article{m-bsamc-82 , author = McGregorJJ , title = {{Backtrack search algorithms and the maximal common subgraph problem}} , journal = j-spe , number = 1 , pages = {23--24} , volume = 12 , year = 1982 } @InProceedings{m-ccaav-05 , author = MeilaM , title = {{Comparing Clusterings - An Axiomatic View}} , booktitle = {{Proceedings of the 22nd International Conference on Machine Learning}} , publisher = pub-acm , year = 2005 } @article{m-ccc-79 , author = MokkenRJ , title = {{Cliques, clubs, and clans}} , journal = j-qq , pages = {161--173} , volume = 13 , year = 1979 } @Article{m-ccibd-07 , author = MeilaM , title = {{Comparing Clusterings---an Information Based Distance}} , journal = j-jma , number = 5 , pages = {873--895} , pdf = "http://dx.doi.org/10.1016/j.jmva.2006.11.013" , url = "http://dx.doi.org/10.1016/j.jmva.2006.11.013" , volume = 98 , year = 2007 } @article{m-ccsg-72 , author = MatulaDW , title = {{$k$-Components, Clusters, and Slicings in Graphs}} , journal = j-sijam , month = may , number = 3 , pages = {459--480} , volume = 22 , year = 1972 } @InProceedings{m-ccvi-03 , author = MeilaM , title = {{Comparing Clusterings by the Variation of Information}} , booktitle = {{Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, Proceedings}} , month = aug , pages = {173--187} , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/rdda4r5bm9ajlbw3/?p=253d02f94c964798a92556201df3d32c&pi=2" , year = 2003 } @Article{m-cl-88 , author = MakinenE , title = {{On Circular Layouts}} , journal = j-ijcm , year = 1988 } @Article{m-cpmpt-97 , author = MoharB , title = {{Circle Packings of Maps in Polynomial Time}} , journal = j-ejc , month = oct , number = 7 , pages = {785--805} , volume = 18 , year = 1997 } @inproceedings{m-csg-69 , author = MatulaDW , title = {{The cohesive strength of graphs}} , booktitle = {{The Many Facets of Graph Theory, Proc.}} , pages = {215--221} , publisher = pub-springer , series = ser-springer_lnm , volume = 110 , year = 1969 } @mastersthesis{m-dcdmv-09 , author = MukhtarS , title = {{Dynamische Clusteranalyse f{\"u}r DM-Verkaufsdaten}} , institution = uni_ka , month = apr , note = {Diplomarbeit} , school = inf_ka , year = 2009 } @inproceedings{m-dec-87 , author = MatulaDW , title = {{Determining Edge Connectivity in {$\mathcal{O}(nm)$}}} , booktitle = {{Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS'87)}} , month = oct , pages = {249--251} , year = 1987 } @article{m-dg-65 , author = MoonJW , title = {{On the Diameter of a Graph}} , journal = j-mmj , number = 3 , pages = {349--351} , volume = 12 , year = 1965 } @mastersthesis{m-diehs-06 , author = MuellerK , title = {{Design and Implementation of an Efficient Hierarchical Speed-up Technique for Computation of Exact Shortest Paths in Graphs}} , month = jun , school = inf_ka , year = 2006 } @InCollection{m-dtspd-01 , author = MuellerHannemannM , title = {{Drawing Trees, Series-Parallel Digraphs, and Lattices}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {46--70} , pdf = "http://springerlink.metapress.com/content/eqtf4rgr4vg6jtn4/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/eqtf4rgr4vg6jtn4/" , volume = 2025 , year = 2001 } @Book{m-ecss-09 , editor = MeyersRA , title = {{Encyclopedia of Complexity and Systems Science}} , booktitle = {{Encyclopedia of Complexity and Systems Science}} , month = apr , publisher = pub-springer , url = "http://www.springer.com/physics/book/978-0-387-75888-6" , year = 2009 } @phdthesis{m-edgre-11 , author = MeinertS , title = {{Engineering Data Generators for Robust Experimental Evaluations\\-- Planar Graphs, Artificial Road Networks, and Traffic Information --}} , month = dec , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1990047" , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie (KIT)" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000025685 " , year = 2011 } @article{m-edmdg-91 , author = MoharB , title = {{Eigenvalues, diameter and mean distance in graphs}} , journal = j-gc , pages = {53--64} , volume = 7 , year = 1991 } @article{m-edtcdg-71 , author = MunroI , title = {{Efficient Determination of the Transitive Closure of a Directed Graph}} , journal = j-ipl , number = 2 , pages = {56--58} , volume = 1 , year = 1971 } @InProceedings{m-egasl-96 , author = MoharB , title = {{Embedding Graphs in an Arbitrary Surface in Linear Time}} , booktitle = {{Proceedings of the 28th Annual {ACM} Symposium on the Theory of Computing (STOC'96)}} , pages = {392--397} , publisher = pub-acm , year = 1996 } @article{m-egmzg-72 , author = MaderW , title = {{Ecken vom Grad $n$ in minimalen $n$-fach zusammenh{\"a}ngenden Graphen}} , journal = j-arch-math , pages = {219--224} , volume = 23 , year = 1972 } @mastersthesis{m-escss-05 , author = MeinertS , title = {{Ein Softwareentwurf f{\"u}r ein Client/Server System zum Archivieren und Austauschen von Graphen im GraphML-Format basierend auf Web-Services}} , month = jan , school = "Universit{\"a}t T{\"u}bingen" , year = 2005 } @Article{m-fsscs-86 , author = MillerGL , title = {{Finding Small Simple Cycle Separators for 2–Connected Planar Graphs}} , journal = j-css , number = 3 , pages = {265--279} , volume = 32 , year = 1986 } @Article{m-grs-92 , author = MoritzH , title = {{Geodetic Reference System 1980}} , journal = j-jg , month = jun , number = 2 , pages = {187--192} , volume = 66 , year = 1992 } @inproceedings{m-gsama-97 , author = MoharB , title = {{Some Applications of Laplace Eigenvalues of Graphs}} , booktitle = {{Graph Symmetry: Algebraic Methods and Applications}} , pages = {227--275} , series = ser-nato_ac , volume = 497 , year = 1997 } @incollection{m-gttcaa-77 , author = MatulaDW , editor = VanRyzinJ , title = {{Graph Theoretic Techniques for Cluster Analysis Algorithms}} , booktitle = {{Classification and clustering}} , pages = {95--129} , publisher = pub-ap , year = 1977 } @article{m-ing-89 , author = MoharB , title = {{Isoperimetric numbers of graphs}} , journal = j-jcombthb , number = 3 , pages = {274--291} , volume = 47 , year = 1989 } @Article{m-larom-79 , author = MitchellSL , title = {{Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs}} , journal = j-ipl , month = dec , number = 5 , pages = {229--232} , url = "http://dx.doi.org/10.1016/0020-0190(79)90075-9" , volume = 9 , year = 1979 } @InCollection{m-lsg-91 , author = MoharB , title = {{The Laplacian Spectrum of Graphs}} , booktitle = {{Graph Theory, Combinatorics, and Applications}} , pages = {871--898} , pdf = "http://www.fmf.uni-lj.si/~mohar/Papers/Spec.pdf" , publisher = pub-wiley , volume = 2 , year = 1991 } @InCollection{m-maclc-07 , author = MeckeS , title = {{MAC Layer and Coloring}} , booktitle = {{Algorithms for Sensor and Ad Hoc Networks}} , pages = {63--80} , pdf = "http://www.springerlink.com/content/7377325x4q2352m1/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/j17361060k67/?p=d8a26cb8041d46709ce129f50ed743bb&pi=3" , volume = 4621 , year = 2007 } @Book{m-mptdd-07 , editor = MagoulesF , title = {{Mesh Partitioning Techniques and Domain Decomposition Techniques}} , booktitle = {{Mesh Partitioning Techniques and Domain Decomposition Techniques}} , publisher = pub-ccl , year = 2007 } @InProceedings{m-nem-02 , author = MagoniD , title = {{nem: A Software for Network Topology Analysis and Modeling}} , booktitle = {{Proceedings of the 10th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems}} , pdf = "http://doi.ieeecomputersociety.org/10.1109/MASCOT.2002.1167097" , publisher = pub-ics , year = 2002 } @article{m-ngicp-79 , author = MathonR , title = {{A Note on the Graph Isomorphism Counting Problem}} , journal = j-ipl , number = 3 , pages = {131--132} , volume = 8 , year = 1979 } @phdthesis{m-o-94 , author = MendezPO , title = {{Orientations bipolaires}} , school = "Ecole des Hautes Etudes en Sciences Sociales, Paris" , year = 1994 } @Article{m-omspp-84 , author = MartinsEQ , title = {{On a Multicriteria Shortest Path Problem}} , journal = j-ejor , number = 3 , pages = {236--245} , volume = 26 , year = 1984 } @mastersthesis{m-pgd-08 , author = MaderM , title = {{Planar Graph Drawing}} , school = "University of Konstanz" , year = 2008 } @article{m-pgi-81 , author = McKayBD , title = {{Practical graph isomorphism}} , journal = j-congr-num , pages = {45--87} , volume = 30 , year = 1981 } @Article{m-pgmrt-02 , author = MillerE , title = {{Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals}} , journal = j-dm , pages = {43--90} , volume = 7 , year = 2002 } @InCollection{m-saleg-97 , author = MoharB , title = {{Some Applications of Laplace Eigenvalues of Graphs}} , booktitle = {{Graph Symmetry: Algebraic Methods and Applications}} , pages = {225--275} , pdf = "http://www.fmf.uni-lj.si/~mohar/Papers/Montreal.pdf" , publisher = pub-kapg , series = ser-nato_ac , volume = 497 , year = 1997 } @mastersthesis{m-sb-03 , author = MeckeS , title = {{{S}tandortplanung von {B}ahnh{\"o}fen}} , pdf = "http://i11www.ira.uka.de/members/mecke/publications/files/diplomarbeit.pdf" , school = "Universit{\"a}t Konstanz" , year = 2003 } @article{m-scpcg-37 , author = MacLaneS , title = {{A Structural Characterization of Planar Combinatorial Graphs}} , journal = j-duke-mj , pages = {460--472} , volume = 3 , year = 1937 } @Article{m-sgpgw-70 , author = MontanariUG , title = {{Separable Graphs, Planar Graphs and Web Grammars}} , journal = j-ico , month = may , number = 3 , pages = {243--267} , volume = 16 , year = 1970 } @InProceedings{m-smcam-67 , author = MacQueenJ , title = {{Some Methods for Classification and Analysis of Multivariate Observations}} , booktitle = {{Fifth Berkeley Symposium on Mathematical Statistics and Probability}} , pages = {281--297} , year = 1967 } @InProceedings{m-ssspa-01 , author = MeyerU , title = {{Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time}} , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}} , pages = {797--806} , year = 2001 } @Article{m-swp-67 , author = MilgramS , title = {{The Small World Problem}} , journal = j-psyt , number = 1 , pages = {60--67} , volume = 1 , year = 1967 } @InCollection{m-tfpef-84 , author = MalkevitchJ , title = {{The First Proof of Euler's Formula}} , booktitle = {{Coxeter-Festschrift}} , pages = {77--82} , publisher = pub-smi , series = ser-mmsg , volume = 3 , year = 1984 } @InCollection{m-vvpgm-99 , author = MoehringR , title = {{Verteilte Verbindungssuche im {\"o}ffentlichen Personenverkehr -- Graphentheoretische Modelle und Algorithmen}} , booktitle = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}} , pages = {192--220} , publisher = pub-v , year = 1999 } @article{m-zak-27 , author = MengerK , title = {{Zur allgemeinen Kurventheorie}} , journal = j-fm , pages = {96--115} , volume = 10 , year = 1927 } @mastersthesis{m-zg-02 , author = MoellerB , title = {{Zentralit{\"a}ten in Graphen}} , month = jul , school = "Fachbereich Informatik und Informationswissenschaft, Universit{\"a}t Konstanz" , type = {Diplomarbeit} , year = 2002 } @Article{ma-tmcaa-84 , author = MoreyLC #and# AgrestiA , title = {{The Measurement of Classification Agreement: An Adjustment to the RAND Statistic for Chance Agreement}} , journal = j-epm , pages = {33--37} , pdf = "http://epm.sagepub.com/cgi/reprint/44/1/33.pdf" , url = "http://epm.sagepub.com/cgi/content/abstract/44/1/33" , volume = 44 , year = 1984 } @InProceedings{mabdhlc-pasls-10 , author = MalewiczG #and# AusternMH #and# BikAJ #and# DehnertJC #and# HornI #and# LeiserN #and# CzajkowskiG , title = {{Pregel: A System for Large-Scale Graph Processing}} , booktitle = {{Proceedings of the 2010 ACM SIGMOD international conference on Management of data (SIGMOD'10)}} , pages = {135--145} , pdf = "http://kowshik.github.com/JPregel/pregel_paper.pdf" , publisher = pub-acm , year = 2010 } @Article{man-cdrsl-05 , author = MiuraK #and# AzumaM #and# NishizekiT , title = {{Canonical Decomposition, Realizer, {S}chnyder Labeling and Orderly Spanning Trees of Plane Graphs}} , journal = j-ijfcs , number = 1 , pages = {117--141} , volume = 16 , year = 2005 } @InProceedings{mbbc-aesap-07 , author = MadduriK #and# BaderDA #and# BerryJW #and# CrobakJR , title = {{An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances}} , booktitle = {{Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)}} , pages = {23--35} , publisher = pub-siam , year = 2007 } @InCollection{mbbc-pspas-09 , author = MadduriK #and# BaderDA #and# BerryJW #and# CrobakJR , title = {{Parallel Shortest Path Algorithms for Solving Large-Scale Instances}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {249--290} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @Article{md-tdvrp-92 , author = MalandrakiC #and# DaskinMS , title = {{Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms}} , journal = j-ts , number = 3 , pages = {185--200} , volume = 26 , year = 1992 } @misc{metisM , author = KarypisG #and# KumarV , title = {{MeTiS, A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Version 4.0}} , institution = "University of Minnesota, MN" , pdf = "http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/manual.pdf" , url = "http://glaros.dtc.umn.edu/gkhome/views/metis" , year = 1998 } @misc{metisS , author = KarypisG #and# KumarV , title = {{MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 4.0}} , institution = "University of Minnesota, Minneapolis, MN" , note = {\url{http://www.cs.umn.edu/~metis}} , url = "http://www.cs.umn.edu/~metis" , year = 2009 } @book{mf-dlt-90 , editor = MirchandaniPB #and# FrancisRL , title = {{Discrete Location Theory}} , booktitle = {{Discrete Location Theory}} , publisher = pub-wiley , series = ser-wiley_dmo , year = 1990 } @InProceedings{mghemc-c-10 , author = Meyer-BaseA #and# GoerkeR #and# HeHuan #and# EmmettMR #and# MarshallAG #and# ConradCA , title = {{Computational techniques to the topology and dynamics of lipidomic networks found in glioblastoma cells}} , booktitle = {{Proceedings of SPIE 7704: Evolutionary and Bio-Inspired Computation: Theory and Applications IV (2010)}} , month = apr , publisher = pub-spietisoe , url = "http://dx.doi.org/10.1117/12.849903" , year = 2010 } @techreport{mgsz-sit-02 , author = MihailM #and# GkantsidisC #and# SaberiA #and# ZeguraEW , title = {{On the semantics of Internet topologies}} , institution = "Georgia Institute of Technology" , number = {GIT-CC-02-} , type = {Technical Report} , url = "http://www.cc.gatech.edu/fac/Milena.Mihail/www-papers/Inetsemantics.pdf" , year = 2002 } @InCollection{mgw-mfdss-08 , author = MeckeS #and# GoerkeR #and# WagnerD , title = {{Maximale Fl{\"u}sse - Die ganze Stadt will zum Stadion}} , booktitle = {{Taschenbuch der Algorithmen}} , pages = {361--372} , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/chapter4D.pdf" , publisher = pub-springer , url = "http://www-i1.informatik.rwth-aachen.de/~algorithmus/" , year = 2008 } @Article{mh-aecmb-01 , author = MeilaM #and# HeckermanD , title = {{An Experimental Comparison of Model-Based Clustering Methods}} , journal = j-ma , number = {1-2} , pages = {9--29} , pdf = "http://www.springerlink.com/content/h7500163314n0l20/fulltext.pdf" , url = "http://www.springerlink.com/content/h7500163314n0l20/" , volume = 42 , year = 2001 } @article{mhhk-gscc-77 , author = MullinsNC #and# HargensLL #and# HechtPK #and# KickEL , title = {{The Group Structure of Cocitation Clusters: A Comparative Study}} , journal = j-asr , pages = {552--562} , volume = 42 , year = 1977 } @Article{mih-tcccp-81 , author = MasuyamaS #and# IbarakiT #and# HasegawaT , title = {{The Computational Complexity of the m-Center Problems on the Plane}} , journal = j-ieicetj , number = 2 , pages = {57--64} , volume = {E64} , year = 1981 } @article{mkm-afmfn-78 , author = MalhotraVM #and# KumarMP #and# MaheshwariSN , title = {{An {$\mathcal{O}(|V|^3)$} algorithm for finding maximum flows in networks}} , journal = j-ipl , month = oct , number = 6 , pages = {277--278} , volume = 7 , year = 1978 } @InProceedings{mknf-onp-87 , author = MasudaS #and# KashiwabaraT #and# NakajimaK #and# FujisawaT , title = {{On the {$\mathcal{NP}$}-completeness of a computer network layout problem}} , booktitle = {{Proceedings of the 20th IEEE International Symposium on Circuits and Systems 1987}} , pages = {292--295} , publisher = pub-ics , year = 1987 } @Article{ml-damlr-06 , author = MadanR #and# LallS , title = {{Distributed Algorithms for Maximum Lifetime Routing in Wireless Sensor Networks}} , journal = j-ieeetwc , number = 8 , pages = {2185--2193} , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1687734" , volume = 5 , year = 2006 } @Article{ml-hmhls-03 , author = MartiR #and# LagunaM , title = {{Heuristics and Meta-Heuristics for 2-Layer Straight Line Crossing Minimization}} , journal = j-dam , month = may , number = 3 , pages = {665--678} , url = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X02003979" , volume = 127 , year = 2003 } @inproceedings{mlmb-bautg-01 , author = MedinaA #and# LakhinaA #and# MattaI #and# ByersJ , title = {{{BRITE}: An Approach to Universal Topology Generation}} , booktitle = {{Proceedings of the 9th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems}} , year = 2001 } @Book{mlpmkm-sahnt-08 , editor = MakkiSK #and# LiXY #and# PissinouN #and# MakkiS #and# KarimiM #and# MakkiK , title = {{Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects}} , booktitle = {{Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects}} , month = oct , publisher = pub-springer , series = ser-lnee , url = "http://www.springer.com/engineering/signals/book/978-0-387-77319-3" , volume = 7 , year = 2008 } @article{mm-cg-65 , author = MoonJW #and# MoserL , title = {{On Cliques in Graphs}} , journal = j-ijm , pages = {23--28} , volume = 3 , year = 1965 } @article{mm-dpcusn-74 , author = MoxleyR #and# MoxleyN , title = {{Determining Point-Centrality in Uncontrived Social Networks}} , journal = j-socm , pages = {122--130} , volume = 37 , year = 1974 } @Article{mm-mhsrm-12 , author = MachucaE #and# MandowL , title = {{Multiobjective Heuristic Search in Road Maps}} , journal = j-esa , month = jun , number = 7 , pages = {6435--6445} , url = "http://dx.doi.org/10.1016/j.eswa.2011.12.022" , volume = 39 , year = 2012 } @article{mm-redl-03 , author = MarxM #and# MasuchM , title = {{Regular Equivalence and Dynamic Logic}} , journal = j-sn , pages = {51--65} , volume = 25 , year = 2003 } @Book{mm-tigt-99 , author = McKeeTA #and# McMorrisFR , title = {{Topics in Intersection Graph Theory}} , booktitle = {{Topics in Intersection Graph Theory}} , publisher = pub-siam , series = ser-mdma , year = 1999 } @article{mmb-oplit-00 , author = MedinaA #and# MattaI #and# ByersJ , title = {{On the Origin of Power Laws in {Internet} Topologies}} , journal = j-ccr , month = apr , number = 2 , volume = 30 , year = 2000 } @InProceedings{mmpz-andgs-13 , author = MaliG #and# MichailP #and# ParaskevopoulosA #and# ZaroliagisC , title = {{A New Dynamic Graph Structure for Large-Scale Transportation Networks}} , booktitle = {{Proceedings of the 8th Conference on Algorithms and Complexity}} , month = may , pages = {312--323} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-38233-8_26" , volume = 7878 , year = 2013 } @Article{mms-a-09 , author = MeyerhenkeH #and# MonienB #and# SauerwaldT , title = {{A new diffusion-based multilevel algorithm for computing graph partitions}} , journal = j-pdc , number = 9 , pages = {750--761} , url = "http://dx.doi.org/10.1016/j.jpdc.2009.04.005" , volume = 69 , year = 2009 } @InProceedings{mms-asolb-06 , author = MeyerhenkeH #and# MonienB #and# SchambergerS , title = {{Accelerating Shape Optimizing Load Balancing for Parallel FEM Simulations by Algebraic Multigrid}} , booktitle = {{20th International Parallel and Distributed Processing Symopsium (IPDPS'06)}} , pages = 10 , pdf = "http://ieeexplore.ieee.org/iel5/10917/34366/01639295.pdf" , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1639295" , year = 2006 } @InProceedings{mmw-aamee-07 , author = MaierM #and# MeckeS #and# WagnerD , title = {{Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks}} , booktitle = {{Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}} , isbn = "978-3-540-69506-6" , location = "Harrachov, Czech Republic" , month = jan , pages = {410--421} , pdf = "http://i11www.ira.uka.de/algo/people/mecke/publications/pdf/mmw-aameedpwn-2007.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 4362 , year = 2007 } @InProceedings{mmw-tslpt-04 , author = MammanaF #and# MeckeS #and# WagnerD , title = {{The {Station Location} {Problem} on {Two} {Intersecting} {Lines}}} , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}} , pages = {52--64} , pdf = "http://i11www.ira.uka.de/members/mecke/publications/files/station_location.pdf" , series = ser-entcs , url = "http://www.elsevier.com/wps/find/journaldescription.cws_home/681021/description?navopenmenu=-2" , volume = 92 , year = 2004 } @Book{mn-eatm-98 , editor = MarcotteP #and# NguyenS , title = {{Equilibrium and Advanced Transportation Modelling}} , booktitle = {{Equilibrium and Advanced Transportation Modelling}} , publisher = pub-kapg , year = 1998 } @InProceedings{mnn-cgdfc-00 , author = MiuraK #and# NakanoS #and# NishizekiT , title = {{Convex Grid Drawings of Four-Connected Plane Graphs}} , booktitle = {{Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'00)}} , pages = {254--265} , series = ser-springer_lncs , year = 2000 } @InProceedings{mnn-gdfcp-00 , author = MiuraK #and# NakanoS #and# NishizekiT , title = {{Grid Drawings of Four-Connected Plane Graphs}} , booktitle = {{Proceedings of the 7th International Symposium on Graph Drawing (GD'99)}} , location = "Stirin Castle, Czech Republic" , month = jan , pages = {145--154} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/21wnxfa5l8dg/" , volume = 1731 , year = 2000 } @InProceedings{mnr-dpgpc-13 , author = MchedlidzeT #and# NollenburgM #and# RutterI , title = {{Drawing Planar Graphs with a Prescribed Cycle}} , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , year = 2014 } @InProceedings{mnwb-mplst-07 , author = MerrickD #and# NollenburgM #and# WolffA #and# BenkertM , title = {{Morphing Polygonal Lines: A Step Towards Continuous Generalization}} , booktitle = {{Proceedings of the 15th Annual Geographic Information Sciences Research Conference UK}} , pages = {390--399} , pdf = "http://i11www.ira.uka.de/extra/publications/mnwb-mplst-07.pdf" , year = 2007 } @InProceedings{mnwb-mplst-07ecg , author = MerrickD #and# NollenburgM #and# WolffA #and# BenkertM , title = {{Morphing Polygonal Lines: A Step Towards Continuous Generalization}} , booktitle = {{Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07)}} , pages = {6--9} , pdf = "http://i11www.ira.uka.de/extra/publications/mnwb-mplst-07ecg.pdf" , year = 2007 } @article{mp-aasnt-01 , author = MagoniD #and# PansiotJJ , title = {{Analysis of the Autonomous System Network Topology}} , journal = j-ccr , month = jul , number = 3 , pages = {26--37} , volume = 31 , year = 2001 } @InProceedings{mp-acitg-02 , author = MagoniD #and# PansiotJJ , title = {{Analysis and Comparison of Internet Topology Generators}} , booktitle = {{Proceedings of the 2nd International IFIP-TC6 Networking Conference}} , pages = {364--375} , publisher = pub-springer , year = 2002 } @Article{mp-apspa-98 , author = MohrT #and# PascheC , title = {{A Parallel Shortest Path Algorithm}} , journal = j-comput , month = dec , number = 4 , pages = {281--292} , volume = 40 , year = 1998 } @InProceedings{mp-arpg-92 , author = MalitzS #and# PapakostasA , title = {{On the Angular Resolution of Planar Graphs}} , booktitle = {{Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'92)}} , pages = {527--538} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/129712.129764" , year = 1992 } @incollection{mp-eco-93 , author = MoharB #and# PoljakS , title = {{Eigenvalues in Combinatorial Optimization}} , booktitle = {{Combinatorial and Graph-Theoretical Problems in Linear Algebra}} , pages = {107--151} , publisher = pub-springer , year = 1993 } @Article{mp-masch-10 , author = MandowL #and# Perez-de-la-CruzJL , title = {{Multiobjective A* Search with Consistent Heuristics}} , journal = j-acm , month = jun , number = 5 , pages = {27:1--27:24} , volume = 57 , year = 2010 } @InProceedings{mp-oepl-02 , author = MihailM #and# PapadimitriouCH , title = {{On the Eigenvalue Power Law}} , booktitle = {{Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM'02)}} , pages = {254--262} , series = ser-springer_lncs , volume = 2483 , year = 2002 } @Article{mr-ngtap-92 , author = MillerGL #and# RamachandranV , title = {{A New Graph Triconnectivity Algorithm and its Parallelization}} , journal = j-comb , number = 1 , pages = {53--76} , volume = 12 , year = 1992 } @Article{mrc-lmmnc-05 , author = MuffS #and# RaoF #and# CaflischA , title = {{Local Modularity Measure for Network Clusterizations}} , journal = j-pr-e , number = 056107 , pages = {1--4} , url = "http://link.aps.org/abstract/PRE/v72/e056107" , volume = 72 , year = 2005 } @InProceedings{mrsn-asghg-97 , author = MarksJ #and# RumlW #and# ShieberSM #and# NgoJT , title = {{A Seed-Growth Heuristic for Graph Bisection}} , booktitle = {{Proceedings of Algorithms and Experiments (ALEX'98)}} , pages = {76--87} , year = 1197 } @Article{mrwhctdt-dbndf-05 , author = MyersC #and# RobsonD #and# WibleA #and# HibbsM #and# ChiriacC #and# TheesfeldC #and# DolinskiK #and# TroyanskayaO , title = {{Discovery of Biological Networks from Diverse Functional Genomic Data}} , journal = j-gb , month = dec , number = 13 , pdf = "http://genomebiology.com/content/pdf/gb-2005-6-13-r114.pdf" , url = "http://genomebiology.com/2005/6/13/R114" , volume = 6 , year = 2005 } @Article{ms-a-98 , author = ModestiP #and# SciomachenA , title = {{A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks}} , journal = j-ejor , number = 3 , pages = {495--508} , volume = 111 , year = 1998 } @Book{ms-adstb-08 , author = MehlhornK #and# SandersP , title = {{Algorithms and Data Structures: The Basic Toolbox}} , booktitle = {{Algorithms and Data Structures: The Basic Toolbox}} , publisher = pub-springer , year = 2008 } @Book{ms-ae-10 , editor = MuellerHannemannM #and# SchirraS , title = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}} , booktitle = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}} , publisher = pub-springer , series = ser-springer_lncs , volume = 5971 , year = 2010 } @Article{ms-dsaps-03 , author = MeyerU #and# SandersP , title = {{$\Delta$-Stepping: A Parallelizable Shortest Path Algorithm}} , journal = j-jalg , number = 1 , pages = {114--152} , volume = 49 , year = 2003 } @InProceedings{ms-dsaps-98 , author = MeyerU #and# SandersP , title = {{$\Delta$-Stepping : A Parallel Single Source Shortest Path Algorithm}} , booktitle = {{Proceedings of the 6th Annual European Symposium on Algorithms (ESA'98)}} , pages = {393--404} , series = ser-springer_lncs , volume = 1461 , year = 1998 } @InProceedings{ms-edopg-12 , author = MozesS #and# SommerC , title = {{Exact Distance Oracles for Planar Graphs}} , booktitle = {{Proceedings of the 23rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'12)}} , pages = {209--222} , publisher = pub-siam , year = 2012 } @InCollection{ms-etipd-09 , author = MuellerHannemannM #and# SchneeM , title = {{Efficient Timetable Information in the Presence of Delays}} , booktitle = {{Robust and Online Large-Scale Optimization}} , pages = {249--272} , publisher = pub-springer , series = ser-springer_lncs , volume = 5868 , year = 2009 } @InCollection{ms-faatc-07 , author = MuellerHannemannM #and# SchneeM , title = {{Finding All Attractive Train Connections by Multi-Criteria Pareto Search}} , booktitle = {{Algorithmic Methods for Railway Optimization}} , pages = {246--263} , publisher = pub-springer , series = ser-springer_lncs , volume = 4359 , year = 2007 } @article{ms-fecdg-89 , author = MansourY #and# SchieberB , title = {{Finding the Edge Connectivity of Directed Graphs}} , journal = j-jalg , month = mar , number = 1 , pages = {76--85} , volume = 10 , year = 1989 } @InProceedings{ms-gpplh-04 , author = MonienB #and# SchambergerS , title = {{Graph Partitioning with the Party Library: Helpful-Sets in Practice}} , booktitle = {{Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'04)}} , pages = {198--205} , publisher = pub-ics , year = 2004 } @Book{ms-itv-06 , editor = MattfeldDC #and# SuhlL , title = {{Informationssysteme in Transport und Verkehr}} , booktitle = {{Informationssysteme in Transport und Verkehr}} , publisher = pub-bdgh , url = "http://books.google.com/books?id=Bv_T4VSoNzAC&printsec=frontcover&dq=Informationssysteme+in+Transport+und+Verkehr&hl=de" , year = 2006 } @Book{ms-lpcgc-99 , author = MehlhornK #and# NaeherS , title = {{LEDA, A platform for Combinatorial and Geometric Computing}} , isbn = "0-521-56329-1" , publisher = pub-cup , year = 1999 } @InProceedings{ms-pltcm-06 , author = MuellerHannemannM #and# SchneeM , title = {{Paying Less for Train Connections with MOTIS}} , booktitle = {{Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)}} , pages = 657 , pdf = "http://drops.dagstuhl.de/opus/volltexte/2006/657/pdf/06001.Mueller_HannemannMatthias.Paper.657.pdf" , series = ser-oasioasi , url = "http://drops.dagstuhl.de/opus/volltexte/2006/657/" , year = 2006 } @InCollection{ms-porod-06 , author = MellouliT #and# SuhlL , title = {{Passenger-Online Routing On Dynamic Networks}} , booktitle = {{Informationssysteme in Transport und Verkehr}} , pages = {17--30} , publisher = pub-bdgh , url = "http://books.google.com/books?id=Bv_T4VSoNzAC&printsec=frontcover&dq=Informationssysteme+in+Transport+und+Verkehr&hl=de" , year = 2006 } @unpublished{ms-tipda-08 , author = MuellerHannemannM #and# SchneeM , title = {{Timetable Information in the Presence of Delays: A Realistic Prototype}} , note = {online available at \url{http://www.diei.univaq.it/arrival/abstracts/Mueller-Hannemann.pdf}} , pdf = "http://www.diei.univaq.it/arrival/abstracts/Mueller-Hannemann.pdf" , year = 2008 } @InProceedings{msf-eotti-08 , author = MuellerHannemannM #and# SchneeM #and# FredeL , title = {{Efficient On-Trip Timetable Information in the Presence of Delays}} , booktitle = {{Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}} , month = sep , pdf = "http://drops.dagstuhl.de/opus/volltexte/2008/1584/pdf/08002.Frede.1584.pdf" , series = ser-oasioasi , year = 2008 } @article{msikca-nm-02 , author = MiloR #and# ShenOrrS #and# ItzkovitzS #and# KashtanN #and# ChklovskiiD #and# AlonU , title = {{Network Motifs: {Simple} Building Blocks of Complex Networks}} , journal = j-science , month = oct , pages = {824--827} , volume = 298 , year = 2002 } @InProceedings{msm-gdspq-06 , author = MaueJ #and# SandersP #and# MatijevicD , title = {{Goal Directed Shortest Path Queries Using Precomputed Cluster Distances}} , booktitle = {{Proceedings of the 5th Workshop on Experimental Algorithms (WEA'06)}} , pages = {316--328} , publisher = pub-springer , series = ser-springer_lncs , volume = 4007 , year = 2006 } @Article{msm-gdspq-09 , author = MaueJ #and# SandersP #and# MatijevicD , title = {{Goal-Directed Shortest-Path Queries Using Precomputed Cluster Distances}} , journal = j-acm-ea , pages = {3.2:1--3.2:27} , volume = 14 , year = 2009 } @InProceedings{msm-uslsc-00 , author = MatuszewskiC #and# SchoenfeldR #and# MolitorP , title = {{Using Sifting for k -Layer Straightline Crossing Minimization}} , booktitle = {{Proceedings of the 7th International Symposium on Graph Drawing (GD'99)}} , location = "Stirin Castle, Czech Republic" , month = jan , pages = {217--224} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/21wnxfa5l8dg/" , volume = 1731 , year = 2000 } @Article{mssww-pgsda-06 , author = MoehringR #and# SchillingH #and# SchuetzB #and# WagnerD #and# WillhalmT , title = {{Partitioning Graphs to Speedup Dijkstra's Algorithm}} , journal = j-acm-ea , number = {2.8} , pages = {1--29} , volume = 11 , year = 2006 } @InProceedings{mssww-pgsud-05 , author = MoehringR #and# SchillingH #and# SchuetzB #and# WagnerD #and# WillhalmT , title = {{Partitioning Graphs to Speed Up Dijkstra's Algorithm}} , booktitle = {{Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)}} , pages = {189--202} , publisher = pub-springer , series = ser-springer_lncs , volume = 3503 , year = 2005 } @InProceedings{msv-vl-11 , author = MontgolfierFd #and# SotoM #and# ViennotL , title = {{Asymptotic Modularity of Some Graph Classes}} , booktitle = {{Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11)}} , pages = {435--444} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-25591-5\_45" , volume = 7074 , year = 2011 } @InProceedings{msw-slca-06 , author = MeckeS #and# SchoebelA #and# WagnerD , title = {{Station Location -- Complexity and Approximation}} , booktitle = {{Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)}} , pdf = "http://drops.dagstuhl.de/portals/ATMOS/fulltext_link.php?id=661" , series = ser-oasioasi , url = "http://drops.dagstuhl.de/opus/volltexte/2006/661" , year = 2006 } @InProceedings{msw-tlwpp-94 , author = MolitorP #and# SparmannU #and# WagnerD , title = {{Two-layer wiring with pin preassignment is easier if the power supply nets are already generated}} , booktitle = {{Proceedings of the 7th International Conference on VLSI Design}} , pages = {149--154} , year = 1994 } @InCollection{mswz-tima-07 , author = MuellerHannemannM #and# SchulzF #and# WagnerD #and# ZaroliagisC , title = {{Timetable Information: Models and Algorithms}} , booktitle = {{Algorithmic Methods for Railway Optimization}} , pages = {67--90} , publisher = pub-springer , series = ser-springer_lncs , volume = 4359 , year = 2007 } @misc{mta , author = mta , title = {{\url{http://www.mta.info/}}} , year = 1966 } @Article{mu-cah-84 , author = MaierD #and# UllmanJD , title = {{Connections in Acyclic Hypergraphs}} , journal = j-tcs , month = jul , number = {1-2} , pages = {185--199} , volume = 32 , year = 1984 } @InProceedings{mw-aesgp-11 , author = MeinertS #and# WagnerD , title = {{An Experimental Study on Generating Planar Graphs}} , booktitle = {{Proceedings of the 7th International Conference on Algorithmic Aspects in Information and Management (AAIM'11)}} , pages = {375--387} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-21204-8_39" , volume = 6681 , year = 2011 } @InCollection{mw-ctvls-97 , author = MoehringR #and# WagnerD , title = {{Combinatorial Topics in {VLSI} Design, Annotated Bibliography}} , booktitle = {{Annotated Bibliographies in Combinatorial Optimization}} , pages = {429--444} , publisher = pub-wiley , year = 1997 } @Article{mw-curn-08 , author = MoscibrodaT #and# WattenhoferM , title = {{Coloring Unstructured Radio Networks}} , journal = j-dc , number = 4 , pages = {271--284} , volume = 21 , year = 2008 } @Article{mw-frspg-95 , author = MendelzonAO #and# WoodPT , title = {{Finding Regular Simple Paths in Graph Databases}} , journal = j-sicomp , number = 6 , pages = {1235--1258} , volume = 24 , year = 1995 } @InProceedings{mw-gtdrn-11 , author = MeinertS #and# WagnerD , title = {{Generating Time Dependencies in Road Networks}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {434--446} , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-20662-7_37" , volume = 6630 , year = 2011 } @InProceedings{mw-pspof-01 , author = MuellerHannemannM #and# WeiheK , title = {{Pareto Shortest Paths is Often Feasible in Practice}} , booktitle = {{Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01)}} , pages = {185--197} , publisher = pub-springer , series = ser-springer_lncs , volume = 2141 , year = 2001 } @InProceedings{mw-sgcpd-04 , author = MeckeS #and# WagnerD , title = {{Solving Geometric Covering Problems by Data Reduction}} , booktitle = {{Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04)}} , pages = {760--771} , pdf = "http://i11www.ira.uka.de/extra/publications/mw-sgcpd-04.pdf" , series = ser-springer_lncs , url = "http://www.springeronline.com/sgw/cda/frontpage/0,11855,5-164-22-34333238-0,00.html" , volume = 3221 , year = 2004 } @InProceedings{mw-tccwn-06 , author = MoscibrodaT #and# WattenhoferR , title = {{The Complexity of Connectivity in Wireless Networks}} , booktitle = {{Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , month = apr , pages = {1--13} , publisher = pub-ieeecs , year = 2006 } @Article{mw-ti-96 , author = MatternF #and# WagnerD , title = {{Terra incognita. (Rezension des dtv-Atlas zur Informatik)}} , journal = j-is , month = feb , number = 1 , pages = {44--45} , pdf = "http://www.vs.inf.ethz.ch/publ/papers/dtv_inf.pdf" , volume = 19 , year = 1996 } @article{mw-ugrrgmd-90 , author = McKayBD #and# WormaldNC , title = {{Uniform generation of random regular graphs of moderate degree}} , journal = j-jalg , pages = {52--67} , volume = 11 , year = 1990 } @InCollection{mww-vlsin-95 , author = MoehringR #and# WagnerD #and# WagnerF , title = {{{VLSI} Network Design: a Survey}} , booktitle = {{Handbooks in Operations Research/Management Science, Volume on Networks}} , pages = {625--712} , publisher = pub-nh , year = 1995 } @InProceedings{mwz-tcmsi-06 , author = MoscibrodaT #and# WattenhoferR #and# ZollingerA , title = {{Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies}} , booktitle = {{Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'06)}} , pages = {310--321} , publisher = pub-acm , year = 2006 } @InProceedings{mz-fcoad-07 , author = MullerLF #and# ZachariasenM , title = {{Fast and Compact Oracles for Approximate Distances in Planar Graphs}} , booktitle = {{Proceedings of the 14th Annual European Symposium on Algorithms (ESA'07)}} , pages = {657--668} , publisher = pub-springer , series = ser-springer_lncs , volume = 4698 , year = 2007 } %% -------------------------------------------------------------- @techreport{n-admm-05 , author = NollenburgM , title = {{Automated Drawing of Metro Maps}} , institution = iti_wagner , number = {2005-25} , pdf = "http://i11www.ira.uka.de/extra/publications/n-admm-05.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000004123" , year = 2005 } @mastersthesis{n-admm-05da , author = NollenburgM , title = {{Automated Drawing of Metro Maps}} , month = aug , pdf = "http://i11www.ira.uka.de/extra/publications/n-admm-05da.pdf" , school = "Universit{\"a}t Karlsruhe" , year = 2005 } @Article{n-amdsr-40 , author = NorthwayML , title = {{A Method for Depicting Social Relationships Obtained by Sociometric Testing}} , journal = j-socm , month = apr , number = 2 , pages = {144--150} , url = "http://links.jstor.org/sici?sici=0038-0431(194004)3\%3A2\%3C144\%3AAMFDSR\%3E2.0.CO\%3B2-3" , volume = 3 , year = 1940 } @article{n-amn-02 , author = NewmanMEJ , title = {{Assortative Mixing in Networks}} , journal = j-phrl , number = 208701 , volume = 89 , year = 2002 } @Article{n-awn-04 , author = NewmanMEJ , title = {{Analysis of Weighted Networks}} , journal = j-pr-e , number = 056131 , pages = {1--9} , pdf = "http://prola.aps.org/pdf/PRE/v70/i5/e056131" , url = "http://link.aps.org/abstract/PRE/v70/e056131" , volume = 70 , year = 2004 } @Article{n-ccrpl-92 , author = NummenmaaJ , title = {{Constructing Compact Rectiliner Planar Layouts Using Canonical Representation of Planar Graphs}} , journal = j-tcs , number = 2 , pages = {213--230} , volume = 99 , year = 1992 } @article{n-cdg-73 , author = NieminenUJ , title = {{On the Centrality in a Directed Graph}} , journal = j-ssre , pages = {371--378} , volume = 2 , year = 1973 } @mastersthesis{n-cldmu-12 , author = NiedermannB , title = {{Consistent Labeling of Dynamic Maps Using Smooth Trajectories}} , institution = "Fakult{\"a}t f{\"u}r Informatik" , month = jun , pdf = "http://i11www.ira.uka.de/extra/publications/n-cldmu-12.pdf" , school = "Karlsruher Institut f{\"u}r Technologie (KIT)" , year = 2012 } @Article{n-cmcgd-07 , author = NagamochiH , title = {{Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex}} , journal = j-tis , number = 2 , pages = {428--431} , url = "http://ietisy.oxfordjournals.org/cgi/content/abstract/E90-D/2/428" , volume = {E90-D} , year = 2007 } @Article{n-dcsn-04 , author = NewmanMEJ , title = {{Detecting Community Structure in Networks}} , journal = j-epjb , number = 2 , pages = {321--330} , pdf = "http://www.springerlink.com/content/5gtdacx17bqv6cdc/fulltext.pdf" , url = "http://www.springerlink.com/content/5GTDACX17BQV6CDC" , volume = 38 , year = 2004 } @Article{n-dfgf-64 , author = NashWilliamsC , title = {{Decomposition of Finite Graphs into Forests}} , journal = j-jlms , pages = 12 , volume = 39 , year = 1964 } @Article{n-ebses-84 , author = NefW , title = {{Ein einfacher Beweis des Satzes von Euler-Schl{\"a}fli}} , journal = j-em , number = 1 , volume = 39 , year = 1984 } @Article{n-f-06 , author = NewmanMEJ , title = {{Finding community structure in networks using the eigenvectors of matrices}} , journal = j-pr-e , number = 3 , volume = 74 , year = 2006 } @unpublished{n-fadcs-03 , author = NewmanMEJ , title = {{Fast algorithm for detecting community structure in networks}} , month = sep , note = {Phys. Rev. E 69, 066133 (2004)} , url = "http://arxiv.org/abs/cond-mat/0309508" , year = 2003 } @Article{n-fadcs-04 , author = NewmanMEJ , title = {{Fast Algorithm for Detecting Community Structure in Networks}} , journal = j-phre , pages = 066133 , pdf = "http://prola.aps.org/pdf/PRE/v69/i6/e066133" , url = "http://prola.aps.org/abstract/PRE/v69/i6/e066133" , volume = 69 , year = 2004 } @Article{n-fcsne-06 , author = NewmanMEJ , title = {{Finding Community Structure in Networks using the Eigenvectors of Matrices}} , journal = j-pr-e , number = 036104 , url = "http://link.aps.org/abstract/PRE/v74/e036104" , volume = 74 , year = 2006 } @Article{n-fcsnu-06 , author = NewmanMEJ , title = {{Finding Community Structure in Networks Using the Eigenvectors of Matrices}} , journal = j-pr-e , month = sep , number = 3 , url = "http://link.aps.org/doi/10.1103/PhysRevE.74.036104" , volume = 74 , year = 2006 } @Article{n-gancp-04 , author = NagamochiH , title = {{Graph Algorithms for Network Connectivity Problems}} , journal = j-jorsj , number = 4 , pages = {199--223} , volume = 47 , year = 2004 } @InCollection{n-gv-07 , author = NollenburgM , title = {{Geographic Visualization}} , booktitle = {{Human-Centered Visualization Environments}} , pages = {257--294} , pdf = "http://i11www.ira.uka.de/extra/publications/n-gv-07.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-540-71949-6_6" , volume = 4417 , year = 2007 } @InProceedings{n-iamlc-10 , author = NollenburgM , title = {{An Improved Algorithm for the Metro-Line Crossing Minimization Problem}} , booktitle = {{Proceedings of the 17th International Symposium on Graph Drawing (GD'09)}} , pages = {381--392} , pdf = "http://i11www.ira.uka.de/extra/publications/n-iamlc-10.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-11805-0_36" , volume = 5849 , year = 2010 } @Book{n-ifpa-06 , author = NiedermeierR , title = {{Invitation to Fixed Parameter Algorithms}} , booktitle = {{Invitation to Fixed Parameter Algorithms}} , publisher = pub-oup , year = 2006 } @Article{n-lms-61 , author = NashWilliamsC , title = {{London Mathematical Society}} , journal = j-jlms , pages = {445--450} , volume = 36 , year = 1961 } @unpublished{n-mbcbr-03 , author = NewmanMEJ , title = {{A Measure of Betweenness Centrality Based on Random Walks}} , note = {arXiv cond-mat/0309045} , url = "http://arxiv.org/ps/cond-mat/0309045" , year = 2003 } @Article{n-mbcbr-05 , author = NewmanMEJ , title = {{A Measure of Betweenness Centrality Based on Random Walks}} , journal = j-sn , month = jan , number = 1 , pages = {39--54} , url = "http://linkinghub.elsevier.com/retrieve/pii/S0378873304000681" , volume = 27 , year = 2005 } @Article{n-mcsn-06 , author = NewmanMEJ , title = {{Modularity and Community Structure in Networks}} , journal = j-pnas , month = jun , number = 23 , pages = {8577--8582} , url = "http://www.pnas.org/cgi/content/abstract/0601602103v1" , volume = 103 , year = 2006 } @InCollection{n-mlagd-01 , author = NeyerG , title = {{Map Labeling with Application to Graph Drawing}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {247--273} , pdf = "http://springerlink.metapress.com/content/fm58a78e047fdgd3/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/fm58a78e047fdgd3/" , volume = 2025 , year = 2001 } @phdthesis{n-nvaac-09 , author = NollenburgM , title = {{Network Visualization: Algorithms, Applications, and Complexity}} , month = feb , pdf = "http://i11www.ira.uka.de/extra/publications/n-nvaac-09.pdf" , school = "Fakult{\"a}t f{\"u}r Informatik, Universit{\"a}t Karlsruhe (TH)" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011456" , year = 2009 } @mastersthesis{n-ocaic-08 , author = NagelS , title = {{Optimisation of Clustering Algorithms for the Identification of Customer Profiles from Shopping Cart Data}} , institution = uni_ka , month = oct , note = {Diplomarbeit} , pdf = "http://i11www.ira.uka.de/extra/publications/n-ocaic-08.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished#diplomarbeiten" , year = 2008 } @Article{n-pdpg-00 , author = NakanoS , title = {{Planar Drawings of Plane Graphs}} , journal = j-tis , number = 3 , pages = {384--391} , volume = {E83-D} , year = 2000 } @mastersthesis{n-prs-10 , author = NeubauerS , title = {{Planung energieeffizienter Routen in Stra\ss{}ennetzwerken}} , month = mar , school = inf_ka , url = "http://algo2.iti.kit.edu/1663.php" , year = 2010 } @Article{n-psslp-54 , author = NorthwayML , title = {{A Plan for Sociometric Studies in a Longitudinal Programme of Research in Child Development}} , journal = j-socm , month = aug , number = 3 , pages = {272--281} , url = "http://www.jstor.org/pss/2785820" , volume = 17 , year = 1954 } @Article{n-scnsp-01 , author = NewmanMEJ , title = {{Scientific Collaboration Networks. II. Shortest Paths, Weighted Networks, and Centrality}} , journal = j-pr-e , pages = 016132 , pdf = "http://prola.aps.org/pdf/PRE/v64/i1/e016132" , url = "http://dx.doi.org/10.1103/PhysRevE.64.016132" , volume = 64 , year = 2001 } @mastersthesis{n-seapl-09 , author = NeubauerS , title = {{Space Efficient Approximation of Piecewise Linear Functions}} , note = {\url{http://algo2.iti.kit.edu/download/neubauer_sa.pdf}} , school = inf_ka , type = {Studienarbeit} , year = 2009 } @Article{n-sin-01 , author = NewmanMEJ , title = {{Scientific collaboration networks. I. Network construction and fundamental results.}} , journal = j-pr-e , month = jul , number = {1 Pt 2} , url = "http://view.ncbi.nlm.nih.gov/pubmed/11461355" , volume = 64 , year = 2001 } @Article{n-t-01 , author = NewmanMEJ , title = {{The structure of scientific collaboration networks}} , journal = j-pnas , month = jan , number = 2 , pages = {404--409} , volume = 98 , year = 2001 } @Article{n-t-95 , author = NachtigallK , title = {{Time depending shortest-path problems with applications to railway networks}} , journal = j-ejor , number = 1 , pages = {154--166} , volume = 83 , year = 1995 } @incollection{n-tn-03 , author = NagelK , title = {{Traffic networks}} , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}} , publisher = pub-wiley-vch , url = "http://dx.doi.org/10.1002/3527602755.fmatter" , year = 2002 } @book{n-tss-57 , author = NadelSF , title = {{The Theory of Social Structure}} , publisher = pub-cw , year = 1957 } @InCollection{n-vnaak-10 , author = NollenburgM , title = {{Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexit{\"a}t}} , booktitle = {{Ausgezeichnete Informatikdissertationen 2009}} , pages = {161--170} , pdf = "http://i11www.ira.uka.de/extra/publications/n-vnaak-10.pdf" , series = ser-lni , volume = {D-10} , year = 2010 } @Book{nbw-tsdn-06 , author = NewmanMEJ #and# BarabasiAL #and# WattsDJ , title = {{The Structure and Dynamics of Networks}} , booktitle = {{The Structure and Dynamics of Networks}} , publisher = pub-pup , series = ser-psc , url = "http://press.princeton.edu/titles/8114.html" , year = 2006 } @InProceedings{ndls-bastd-08 , author = NanniciniG #and# DellingD #and# LibertiL #and# SchultesD , title = {{Bidirectional A* Search for Time-Dependent Fast Paths}} , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}} , month = jun , pages = {334--346} , pdf = "http://i11www.ira.uka.de/extra/publications/ndls-bastd-08.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 5038 , year = 2008 } @Article{ndls-bastd-12 , author = NanniciniG #and# DellingD #and# LibertiL #and# SchultesD , title = {{Bidirectional A* Search on Time-Dependent Road Networks}} , journal = j-networks , note = {Journal version of WEA'08.} , pages = {240--251} , volume = 59 , year = 2012 } @Article{ng-fecsn-04 , author = NewmanMEJ #and# GirvanM , title = {{Finding and evaluating community structure in networks}} , journal = j-pr-e , number = 026113 , pages = {1--16} , url = " http://link.aps.org/abstract/PRE/v69/e026113" , volume = 69 , year = 2004 } @InCollection{ng-mpcsn-03 , author = NewmanMEJ #and# GirvanM , title = {{Mixing Patterns and Community Structure in Networks}} , booktitle = {{Statistical Mechanics of Complex Networks}} , pages = {66--87} , pdf = "http://springerlink.metapress.com/content/up95b47kkr8p5mfh/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lnp , url = "http://springerlink.metapress.com/content/up95b47kkr8p5mfh/" , volume = 625 , year = 2003 } @article{ng-nrmnf-90 , author = NajjarW #and# GaudiotJL , title = {{Network Resilience: A Measure of Network Fault Tolerance}} , journal = j-tc , month = feb , number = 2 , pages = {174--181} , volume = 39 , year = 1990 } @Book{ni-aagc-08 , author = NagamochiH #and# IbarakiT , title = {{Algorithmic Aspects of Graph Connectivity}} , booktitle = {{Algorithmic Aspects of Graph Connectivity}} , publisher = pub-cup , series = ser-ema , volume = 123 , year = 2008 } @InProceedings{njw-oscaa-01 , author = NgAY #and# JordanMI #and# WeissY , title = {{On Spectral Clustering: Analysis and an Algorithm}} , booktitle = {{Proceedings of 14th Conference: Neural Information Processing Systems}} , pages = {849--856} , pdf = "http://www.robotics.stanford.edu/~ang/papers/nips01-spectral.pdf" , year = 2001 } @Article{nk-ccrmc-96 , author = NagamochiH #and# KamedaT , title = {{Constructing Cactus Representation for all Minimum Cuts in an Undirected Network}} , journal = j-jorsj , month = jun , number = 2 , pages = {135--158} , volume = 39 , year = 1996 } @Book{nmb-esnap-05 , author = NooyW #and# MrvarA #and# BatageljV , title = {{Exploratory Social Network Analysis with Pajek}} , booktitle = {{Exploratory Social Network Analysis with Pajek}} , publisher = pub-cup , series = ser-sass , url = "http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=0521602629" , volume = 27 , year = 2005 } @Article{nmcm-edmdg-09 , author = NicosiaV #and# MangioniG #and# CarchioloV #and# MalgeriM , title = {{Extending the Definition of Modularity to Directed Graphs with Overlapping Communities}} , journal = j-smte , number = 03 , pages = {p03024 (23pp)} , pdf = "http://www.iop.org/EJ/article/1742-5468/2009/03/P03024/jstat9_03_p03024.pdf" , url = "http://stacks.iop.org/1742-5468/2009/P03024" , volume = 2009 , year = 2009 } @unpublished{nmcm-emddg-08 , author = NicosiaV #and# MangioniG #and# CarchioloV #and# MalgeriM , title = {{Extending Modularity Definition for Directed Graphs with Overlapping Communities}} , month = jan , url = "http://arxiv.org/abs/0801.1647" , year = 2008 } @Article{nmwb-mpast-08 , author = NollenburgM #and# MerrickD #and# WolffA #and# BenkertM , title = {{Morphing Polylines: A Step Towards Continuous Generalization}} , journal = j-ceus , note = {Special issue of GISRUK 2007} , number = 4 , pages = {248--260} , pdf = "http://i11www.ira.uka.de/extra/publications/nmwb-mpast-08.pdf" , url = "http://dx.doi.org/10.1016/j.compenvurbsys.2008.06.004" , volume = 32 , year = 2008 } @InProceedings{nn-altaf-00 , author = NagaiS #and# NakanoS , title = {{A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs}} , booktitle = {{Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'00)}} , pages = {290--301} , publisher = pub-springer , series = ser-springer_lncs , volume = 1928 , year = 2000 } @article{np-csp-85 , author = NesetrilJ #and# PoljakS , title = {{On the complexity of the subgraph problem}} , journal = j-cmuc , number = 2 , pages = {415--419} , volume = 26 , year = 1985 } @InProceedings{np-egdt-13 , author = NollenburgM #and# PrutkinR , title = {{Euclidean Greedy Drawings of Trees}} , booktitle = {{Proceedings of the 21st Annual European Symposium on Algorithms (ESA'13)}} , note = {To appear.} , publisher = pub-springer , series = ser-springer_lncs , url = "http://arxiv.org/abs/1306.5224" , year = 2013 } @Article{np-oi-03 , author = NewmanMEJ #and# ParkJ , title = {{Origin of degree correlations in the Internet and other networks}} , journal = j-pr-e , number = 2 , url = "http://prola.aps.org/abstract/PRE/v68/i2/e026112" , volume = 68 , year = 2003 } @article{np-wsndtn-03 , author = NewmanMEJ #and# ParkJ , title = {{Why social networks are different from other types of networks}} , journal = j-phre , number = 036122 , volume = 68 , year = 2003 } @InProceedings{npb-ruon-03 , author = NakaoA #and# PetersonL #and# BavierA , title = {{A Routing Underlay for Overlay Networks}} , booktitle = {{SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications}} , pages = {11--18} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/863955.863958" , year = 2003 } @InProceedings{npr-e-12 , author = NollenburgM #and# PrutkinR #and# RutterI , title = {{Edge-weighted Contact Representations of Planar Graphs}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , pages = {224--235} , pdf = "http://i11www.ira.uka.de/extra/publications/npr-e-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_20" , volume = 7704 , year = 2013 } @Article{npr-e-13 , author = NollenburgM #and# PrutkinR #and# RutterI , title = {{Edge-weighted contact representations of planar graphs}} , journal = j-jgaa , note = {Special issue of GD 2012.} , number = 4 , pages = {441--473} , pdf = "http://i11www.ira.uka.de/extra/publications/npr-e-13.pdf" , url = "http://dx.doi.org/10.7155/jgaa.00299" , volume = 17 , year = 2013 } @InProceedings{nps-dosbl-10 , author = NollenburgM #and# PolishchukV #and# SysikaskiM , title = {{Dynamic One-Sided Boundary Labeling}} , booktitle = {{Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}} , month = nov , pages = {310--319} , pdf = "http://i11www.ira.uka.de/extra/publications/nps-dosbl-10.pdf" , publisher = pub-acm , url = "http://dl.acm.org/authorize?316206" , year = 2010 } @InProceedings{nr-mamc-09 , author = NoackA #and# RottaR , title = {{Multi-level Algorithms for Modularity Clustering}} , booktitle = {{Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)}} , month = jun , pages = {257--268} , pdf = "http://www.springerlink.com/content/qugv7708h3806230/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/qugv7708h3806230/" , volume = 5526 , year = 2009 } @Book{nr-pgd-04 , author = NishizekiT #and# RahmanS , title = {{Planar Graph Drawing}} , booktitle = {{Planar Graph Drawing}} , publisher = pub-wsp , series = ser-lnsc , volume = 12 , year = 2004 } @Article{nrn-a-97 , author = NakanoS #and# RahmanS #and# NishizekiT , title = {{A linear-time algorithm for four-partitioning four-connected planar graphs}} , journal = j-ipl , pages = {315--322} , volume = 62 , year = 1997 } @Book{nrtv-agt-07 , editor = NisanN #and# RoughgardenT #and# TardosE #and# VaziraniVV , title = {{Algorithmic Game Theory}} , booktitle = {{Algorithmic Game Theory}} , publisher = pub-cup , year = 2007 } @InCollection{ns-b-05 , author = NunkesserM #and# SawitzkiD , title = {{Blockmodels}} , booktitle = {{Network Analysis: Methodological Foundations}} , month = feb , pages = {253--292} , pdf = "http://springerlink.metapress.com/content/dxf4kw1hramavgev/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/dxf4kw1hramavgev/" , volume = 3418 , year = 2005 } @article{ns-epsb-01 , author = NowickiK #and# SnijdersTAB , title = {{Estimation and Prediction for Stochastic Blockstructures}} , journal = j-jasa , pages = {1077--1087} , volume = 96 , year = 2001 } @article{ns-fsccdg-94 , author = NuutilaE #and# SoisalonSoininenE , title = {{On finding the strongly connected components in a directed graph}} , journal = j-ipl , month = jan , number = 1 , pages = {9--14} , volume = 49 , year = 1994 } @Article{nst-ndasp-00 , author = NarvaezP #and# SiuK #and# TzengH , title = {{New Dynamic Algorithms for Shortest Path Tree Computation}} , journal = j-ton , number = 6 , pages = {734--746} , volume = 8 , year = 2000 } @article{nsw-rgadd-01 , author = NewmanMEJ #and# WattsDJ #and# StrogatzSH , title = {{Random graphs with arbitrary degree distributions and their applications}} , journal = j-phre , pages = 026118 , volume = 64 , year = 2001 } @techreport{nsww-pdpap-96-tr , author = NeyerG #and# SchlickenriederW #and# WagnerD #and# WeiheK , title = {{PlaNet---A Demonstration Package for Algorithms on Planar Networks}} , institution = "Universit{\"a}t Konstanz" , note = {Konstanzer Schriften in Mathematik und Informatik} , number = 5 , year = 1996 } @inproceedings{ntjn-sitmg-87 , author = NicholsonV #and# TsaiCC #and# JohnsonMA #and# NaimM , title = {{A Subgraph Isomorphism Theorem for Molecular Graphs}} , booktitle = {{proc-gttc}} , pages = {226--230} , year = 1987 } @InProceedings{nvwh-dbtae-09 , author = NollenburgM #and# VolkerM #and# WolffA #and# HoltenD , title = {{Drawing Binary Tanglegrams: An Experimental Evaluation}} , booktitle = {{Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09)}} , month = apr , pages = {106--119} , pdf = "http://i11www.ira.uka.de/extra/publications/nvwh-dbtae-09.pdf" , publisher = pub-siam , url = "http://www.siam.org/proceedings/alenex/2009/alenex09.php" , year = 2009 } @InProceedings{nw-amipd-06 , author = NollenburgM #and# WolffA , title = {{A Mixed-Integer Program for Drawing High-Quality Metro Maps}} , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}} , month = jan , pages = {321--333} , pdf = "http://i11www.ira.uka.de/extra/publications/nw-amipd-06.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/11618058_29" , volume = 3843 , year = 2006 } @Article{nw-dlhqm-11 , author = NollenburgM #and# WolffA , title = {{Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming}} , journal = j-tvcg , month = may , number = 5 , pages = {626--641} , pdf = "http://i11www.ira.uka.de/extra/publications/nw-dlhqm-10.pdf" , url = "http://dx.doi.org/10.1109/TVCG.2010.81" , volume = 17 , year = 2011 } @book{nw-ico-88 , author = NemhauserGL #and# WolseyLA , title = {{Integer and Combinatorial Optimization}} , publisher = pub-wiley , year = 1988 } @article{nws-rgmsn-02 , author = NewmanMEJ #and# StrogatzSH #and# WattsDJ , title = {{Random graph models of social networks}} , journal = j-pnas , pages = {2566--2572} , url = "http://www.pnas.org/cgi/reprint/99/suppl_1/2566.pdf" , volume = 99 , year = 2002 } @InProceedings{nz-diedt-02 , author = NaeherS #and# ZlotowskiO , title = {{Design and Implementation of Efficient Data Types for Static Graphs}} , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}} , pages = {157--164} , pdf = "http://www.springerlink.com/content/1u1jw0kfa9lgnrwn/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 2461 , year = 2002 } @inproceedings{nzj-laes-01 , author = NgAY #and# ZhengAX #and# JordanMI , title = {{Link Analysis, Eigenvectors and Stability}} , address = "Seattle, Washington" , booktitle = {{Proceedings of the 17th international joint conference on artificial intelligence}} , pages = {903--910} , year = 2001 } %% -------------------------------------------------------------- @Article{o-aspml-73 , author = ONeilP , title = {{A Short Proof of Mac Lane's Planarity Theorem}} , journal = j-pams , pages = {617--618} , volume = 37 , year = 1973 } @article{o-lcg-87 , author = OellermannOR , title = {{On the $l$-Connectivity of a Graph}} , journal = j-gc , pages = {285--291} , volume = 3 , year = 1987 } @InCollection{o-mcg-07 , author = OkadaT , title = {{Mining from Chemical Graphs}} , booktitle = {{Mining Graph Data}} , pages = {347--379} , publisher = pub-wiley , url = "http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0471731900.html" , year = 2007 } @article{o-ncfg-87 , author = OellermannOR , title = {{A Note on the $\ell$-Connectivity Function of a Graph}} , journal = j-congr-num , month = dec , pages = {181--188} , volume = 60 , year = 1987 } @Book{o-pmlam-98 , editor = OttmannT , title = {{Prinzipien des Algorithmenentwurfs. Multimediales Lehrbuch}} , booktitle = {{Prinzipien des Algorithmenentwurfs. Multimediales Lehrbuch}} , publisher = pub-sav , year = 1998 } @Book{od-lvmp-09 , editor = OsawaT #and# DAlexandriFL , title = {{Lipidomics Volume 2: Methods and Protocols }} , booktitle = {{Lipidomics Volume 2: Methods and Protocols }} , publisher = pub-springer , series = ser-mmb , url = "http://www.springerlink.com/content/x44337/?p=ebd7feef805040b8bd7702f42b879af5&pi=0" , volume = 2009 , year = 2009 } @InProceedings{og-ccmm-10 , author = OvelgonneM #and# Geyer-SchulzA , title = {{Cluster Cores and Modularity Maximization}} , booktitle = {{Data Mining Workshops (ICDMW), 2010 IEEE International Conference on}} , month = dec , pages = {1204--1213} , publisher = pub-ics , year = 2010 } @article{ohl-xcapscpm-04 , author = OrtizMGR #and# HoyosJRC #and# LopezMGR , title = {{The social networks of academic performance in a student context of poverty in Mexico}} , journal = j-sn , number = 2 , pages = {175--188} , volume = 26 , year = 2004 } @Article{olghklp-asgpc-07 , author = OwensJD #and# LuebkeD #and# GovindarajuN #and# HarrisM #and# KruegerJ #and# LefohnA #and# PurcellTJ , title = {{A Survey of General-Purpose Computation on Graphics Hardware}} , journal = j-cgf , number = 1 , pages = {80--113} , url = "http://www.blackwell-synergy.com/doi/pdf/10.1111/j.1467-8659.2007.01012.x" , volume = 26 , year = 2007 } @misc{oneworld , author = oneworld , title = {{\url{http://www.oneworld.com}}} , year = 1999 } @Article{or-mwptd-91 , author = OrdaA #and# RomR , title = {{{Minimum Weight Paths in Time-Dependent Networks}}} , journal = j-networks , pages = {295--319} , volume = 21 , year = 1991 } @Article{or-spmda-90 , author = OrdaA #and# RomR , title = {{Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length}} , journal = j-acm , number = 3 , pages = {607--625} , volume = 37 , year = 1990 } @InProceedings{os-nlgp-10 , author = OsipovV #and# SandersP , title = {{$n$-Level Graph Partitioning}} , booktitle = {{Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10)}} , pages = {278--289} , publisher = pub-springer , series = ser-springer_lncs , volume = 6346 , year = 2010 } @InProceedings{osknn-drbrl-04 , author = OhtaM #and# ShinodaK #and# KumadaY #and# NakashimaH #and# NodaI , title = {{Is Dial-a-Ride Bus Reasonable in Large Scale Towns? --- Evaluation of Usability of Dial-a-Ride Systems by Simulation ---}} , booktitle = {{Multiagent for Mass User Support - First International Workshop}} , pages = {105--119} , pdf = "http://www.springerlink.com/content/32gxmm3fuqchcu3q/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/32gxmm3fuqchcu3q/" , volume = 3012 , year = 2004 } @book{ot-hdcg-97 , editor = OrourkeJ #and# ToussaintGT , title = {{Handbook of Discrete and Computational Geometry}} , booktitle = {{Handbook of Discrete and Computational Geometry}} , isbn = "0-8493-8524-5" , publisher = {CRC Press LLC, Boca} , year = 1997 } @inproceedings{ot-pr-97 , author = OrourkeJ #and# ToussaintGT , title = {{Pattern recognition}} , booktitle = {{Handbook of Discrete and Computational Geometry}} , isbn = "0-8493-8524-5" , pages = {779-796} , publisher = {CRC Press LLC, Boca} , year = 1997 } @Article{oyt-fpspm-91 , author = OrlinJB #and# YoungNE #and# TarjanR , title = {{Faster Parametric Shortest Path and Minimum Balance Algorithms}} , journal = j-networks , number = 2 , pages = {205--221} , volume = 21 , year = 1991 } %% -------------------------------------------------------------- @Article{p-a-04 , author = PettieS , title = {{A new approach to all-pairs shortest paths on real-weighted graphs}} , journal = j-tcs , month = jan , number = 1 , pages = {47--74} , volume = 312 , year = 2004 } @article{p-abcg-71 , author = PatonK , title = {{An Algorithm for the Blocks and Cutnodes of a Graph}} , journal = j-comm-acm , month = jul , number = 7 , pages = {468--475} , volume = 14 , year = 1971 } @book{p-amsn-93 , author = PattisonP , title = {{Algebraic Models for Social Networks}} , publisher = pub-cup , year = 1993 } @techreport{p-bdhsp-69 , author = PohlI , title = {{Bi-Directional and Heuristic Search in Path Problems}} , institution = "Stanford Linear Accelerator Center, Stanford, California" , number = {SLAC-104} , url = "http://www.slac.stanford.edu/cgi-wrap/getdoc/slac-r-104.pdf" , year = 1969 } @InProceedings{p-bs-71 , author = PohlI , title = {{Bi-directional Search}} , booktitle = {{Proceedings of the Sixth Annual Machine Intelligence Workshop}} , pages = {124--140} , publisher = pub-eup , volume = 6 , year = 1971 } @Article{p-coc-01 , author = PatrignaniM , title = {{On the Complexity of Orthogonal Compaction}} , journal = j-cgta , pages = {47--67} , volume = 19 , year = 2001 } @Book{p-dcals-00 , author = PelegD , title = {{Distributed Computing: A Locality-Sensitive Approach}} , booktitle = {{Distributed Computing: A Locality-Sensitive Approach}} , publisher = pub-sim , year = 2000 } @article{p-dvg-84 , author = PeyratC , title = {{Diameter Vulnerability of Graphs}} , journal = j-dam , volume = 9 , year = 1984 } @Book{p-hissc-84 , author = PearlJ , title = {{Heuristics: Intelligent Search Strategies for Computer Problem Solving}} , booktitle = {{Heuristics: Intelligent Search Strategies for Computer Problem Solving}} , publisher = pub-aw , year = 1984 } @Article{p-hsvpf-70 , author = PohlI , title = {{Heuristic Search Viewed as Path Finding in a Graph }} , journal = j-ai , number = 3 , pages = {193--204} , volume = 1 , year = 1970 } @Article{p-iemas-74 , author = PapeU , title = {{Implementation and Efficiency of Moore-Algorithms for the Shortest Route Problem}} , journal = j-mp , pages = {212--222} , volume = 7 , year = 1974 } @mastersthesis{p-mmrp-09 , author = PajorT , title = {{Multi-Modal Route Planning}} , institution = "Fakultät für Informatik" , month = mar , school = "Universität Karlsruhe (TH)" , url = "http://i11www.ira.uka.de/extra/publications/p-mmrp-09.pdf" , year = 2009 } @Article{p-ppls-00 , author = PelegD , title = {{Proximity-Preserving Labeling Schemes}} , journal = j-jgt , number = 3 , pages = {167--176} , volume = 33 , year = 2000 } @misc{p-scotc-07 , author = PellegriniF , title = {{SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package}} , institution = "Laboratoire Bordelais de Recherche en Informatique, Bordeaux, France" , note = {\url{http://www.labri.fr/perso/pelegrin/scotch/}} , url = "http://www.labri.fr/perso/pelegrin/scotch/" , year = 2007 } @techreport{p-scotc-08 , author = PellegriniF , title = {{SCOTCH 5.1 User's guide}} , institution = "Laboratoire Bordelais de Recherche en Informatique, Bordeaux, France" , pdf = "http://gforge.inria.fr/docman/view.php/248/5709/scotch_user5.1.pdf" , url = "http://www.labri.fr/perso/pelegrin/scotch/" , year = 2008 } @book{p-sep-98 , author = ParlettBN , title = {{The Symmetric Eigenvalue Problem}} , publisher = pub-siam , year = 1998 } @misc{p-sutsp-08 , author = PajorT , title = {{Goal Directed Speed-Up Techniques for Shortest Path Queries in Timetable Networks}} , month = jan , note = {Student Research Project} , pdf = "http://i11www.ira.uka.de/extra/publications/p-sutsp-08.pdf" , school = inf_ka , year = 2008 } @techreport{p-tca-68 , author = PurdomPW , title = {{A Transitive Closure Algorithm}} , institution = "University of Wisconsin" , month = jul , number = 33 , type = {Computer Sciences Te} , year = 1968 } @article{p-tca-70 , author = PurdomPW , title = {{A Transitive Closure Algorithm}} , journal = j-bit , pages = {76--94} , volume = 10 , year = 1970 } @Article{p-tulgg-61 , author = ParterSV , title = {{The Use of Linear Graphs in Gauss Elimination}} , journal = j-sr , month = apr , number = 2 , pages = {119--130} , volume = 3 , year = 1961 } @InProceedings{p-wageh-98 , author = PurchaseHC , title = {{Which Aesthetic has the Greatest Effect on Human Understanding? }} , booktitle = {{Proceedings of the 5th International Symposium on Graph Drawing (GD'97)}} , location = "Rome, Italy" , month = jan , pages = {248--261} , publisher = pub-springer , series = ser-springer_lncs , url = "http://portal.acm.org/citation.cfm?id=647549.728779" , volume = 1353 , year = 1998 } @techreport{partyM , author = PreisR #and# DiekmannR , title = {{The PARTY Partitioning Library, User Guide }} , institution = "University of Paderborn, Germany" , note = {tr-rsfb-96-02} , pdf = "http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/PARTY/manual.ps.gz" , url = "http://www2.cs.uni-paderborn.de/cs/robsy/party.html" , year = 1996 } @misc{partyS , author = PreisR , title = {{PARTY Partitioning Library }} , institution = "University of Paderborn, Germany" , note = {\url{http://www2.cs.uni-paderborn.de/cs/robsy/party.html}} , url = "http://www2.cs.uni-paderborn.de/cs/robsy/party.html" , year = 1996 } @article{pbm-dsdcs-00 , author = PoulinR #and# BoilyMC #and# MasseBR , title = {{Dynamical systems to define centrality in social networks}} , journal = j-sn , pages = {187--220} , volume = 22 , year = 2000 } @InProceedings{pbm-eufad-10 , author = PatwaryMM #and# BlairJ #and# ManneF , title = {{Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure}} , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}} , month = may , pages = {411--423} , publisher = pub-springer , series = ser-springer_lncs , volume = 6049 , year = 2010 } @unpublished{pbmw-prcr-99 , author = PageL #and# BrinS #and# MotwaniR #and# WinogradT , title = {{The {PageRank} Citation Ranking: {Bringing} Order to the Web}} , note = {Manuscript} , year = 1999 } @Article{pbv-q-07 , author = PallaG #and# BarabasiAL #and# VicsekT , title = {{Quantifying social group evolution}} , journal = j-nature , month = apr , pages = {664--667} , pdf = "http://www.nature.com/nature/journal/v446/n7136/pdf/nature05670.pdf" , url = "http://www.nature.com/nature/journal/v446/n7136/abs/nature05670.html" , volume = 446 , year = 2007 } @InProceedings{pfp-scnem-06 , author = PhilippidesA #and# FineP #and# PaoloED , title = {{Spatially Constrained Networks and the Evolution of Modular Control Systems}} , booktitle = {{Proc. 9th International Conference on Simulation of Adaptive Behavior}} , pages = {546--557} , pdf = "http://www.springerlink.com/content/l2639334n317348w/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/l2639334n317348w/" , year = 2006 } @techreport{pg-fdwcd-04 , author = ParthasarathyS #and# GandhiR , title = {{Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks}} , institution = "University of Maryland" , year = 2004 } @techreport{pgf-fanfmg-01 , author = PalmerC #and# GibbonsP #and# FaloutsosC , title = {{Fast Approximation of the ``Neighbourhood'' Function for Massive Graphs}} , institution = "Carnegie Mellon Uiversity" , number = {CMUCS-01-1} , year = 2001 } @phdthesis{phd-dongen-02 , author = DongenS , title = {{Graph Clustering by Flow Simulation}} , school = "University of Utrecht" , url = "http://micans.org/mcl/lit/" , year = 2000 } @phdthesis{phd-holzapfel-04 , author = HolzapfelK , title = {{Density-based clustering in large-scale networks}} , institution = "Fakult{\"a}t f{\"u}r Informatik" , school = "Technische Universit{\"a}t M{\"u}nchen" , year = 2004 } @InProceedings{phnk-otulg-12 , author = PurchaseHC #and# HamerJ #and# NollenburgM #and# KobourovSG , title = {{On The Usability of Lombardi Graph Drawings}} , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}} , pages = {451--462} , pdf = "http://i11www.ira.uka.de/extra/publications/phnk-otulg-12.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_40" , volume = 7704 , year = 2013 } @article{phv-tmii-04 , author = PalaciosHuertaI #and# VolijO , title = {{The measurement of intellectual influence}} , journal = j-e , note = {accepted for publication} , year = 2004 } @Article{pk-ppo-08 , author = PfetschM #and# KaibelV , title = {{Packing and Partitioning Orbitopes}} , journal = j-math-prog-a , number = 1 , pages = {1--36} , pdf = "http://www.springerlink.com/content/154658wqp0r700h6/fulltext.pdf" , url = "http://www.springerlink.com/content/154658wqp0r700h6/" , volume = 114 , year = 2008 } @incollection{pl-asd-51 , author = ProctorCH #and# LoomisCP , editor = JahodaM #and# DeutschM #and# CookSW , title = {{Analysis of sociometric data}} , booktitle = {{Research Methods in Social Relations}} , pages = {561--586} , publisher = {Dryden Press} , year = 1951 } @Article{pl-cclnu-06 , author = PonsP #and# LatapyM , title = {{Computing Communities in Large Networks Using Random Walks}} , journal = j-jgaa , number = 2 , pages = {191--218} , pdf = "http://www-rp.lip6.fr/~latapy/Publis/communities.pdf" , url = "http://www.cs.brown.edu/publications/jgaa/" , volume = 10 , year = 2006 } @techreport{plo-mccg-90 , author = LaPoutreJA #and# LeeuwenJv #and# OvermarsMH , title = {{Maintenance of $2$- and $3$-Connected Components of Graphs, Part~I: $2$- and $3$-Edge-Connected Components}} , institution = "Dept. of Computer Science, Utrecht University" , month = jul , number = {RUU-CS-90-} , year = 1990 } @inproceedings{pm-sbssg-96 , author = PapadopoulosA #and# ManolopoulosY , title = {{Structure-Based Similarity Search with Graph Histograms}} , booktitle = {{{DEXA} Workshop}} , pages = {174--178} , year = 1999 } @article{pn-cijas-76 , author = PinskiG #and# NarinF , title = {{Citation influence for journal aggregates of scientific publications: theory, with application to the literature of physics}} , journal = j-ipm , pages = {297--312} , volume = 12 , year = 1976 } @Book{pn-mots-01 , editor = PursulaM #and# NiittymakiJ , title = {{Mathematical methods on Optimization in Transportation Systems}} , booktitle = {{Mathematical methods on Optimization in Transportation Systems}} , year = 2001 } @Article{pp-a-09 , author = PijlsW #and# PostHN , title = {{A new bidirectional search algorithm with shortened postprocessing}} , journal = j-ejor , month = oct , number = 2 , pages = {363--369} , volume = 198 , year = 2009 } @article{pq-nfssn-82 , author = PicardJC #and# QueyranneM , title = {{A network flow solution to some nonlinear $0$-$1$ programming problems, with an application to graph theory}} , journal = j-networks , pages = {141--159} , volume = 12 , year = 1982 } @Article{pq-osamc-82 , author = PicardJC #and# QueyranneM , title = {{On the Structure of All Minimum Cuts in a Network and Applications}} , journal = j-math-prog-a , month = dec , number = 1 , pages = 121 , url = "http://www.springerlink.com/content/k12w829253122g22/" , volume = 22 , year = 1982 } @Article{pr-dsdis-03 , author = PradhanSS #and# RamchandranK , title = {{Distributed source coding using Syndromes (DISCUS): Design and Construction}} , journal = j-tinfth , month = mar , number = 3 , pages = {626--643} , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1184140" , volume = 49 , year = 2003 } @article{pr-mcrp-75 , author = PicardJC #and# RatliffHD , title = {{Minimum Cuts and Related Problems}} , journal = j-networks , number = 4 , pages = {357--370} , volume = 5 , year = 1975 } @article{pr-mepeg-00 , author = PapendiekB #and# RechtP , title = {{On maximal entries in the principal eigenvector of graphs}} , journal = j-laa , pages = {129--138} , volume = 310 , year = 2000 } @article{pr-ramnf-01 , author = PekecA #and# RobertsFS , title = {{The Role Assignment Model Nearly Fits Most Social Networks}} , journal = j-mss , pages = {275--293} , volume = 41 , year = 2001 } @InProceedings{pr-sa-96 , author = PellegriniF #and# RomanJ , title = {{SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs}} , booktitle = {{High-Performance Computing and Networking}} , pages = {493--498} , pdf = "http://www.springerlink.com/content/fg24302095611p34/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/fg24302095611p34/" , volume = 1067 , year = 1996 } @Book{prd-smcn-03 , editor = PastorSatorrasR #and# RubiM #and# DiazGuileraA , title = {{Statistical Mechanics of Complex Networks}} , booktitle = {{Statistical Mechanics of Complex Networks}} , publisher = pub-springer , series = ser-springer_lnp , url = "http://dx.doi.org/10.1007/b12331" , volume = 625 , year = 2003 } @InProceedings{prs-eensp-02 , author = PettieS #and# RamachandranV #and# SridharS , title = {{Experimental Evaluation of a New Shortest Path Algorithm}} , booktitle = {{Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)}} , pages = {105--120} , publisher = pub-springer , series = ser-springer_lncs , volume = 2409 , year = 2002 } @inproceedings{pru-uprcw-02 , author = PanduranganG #and# RaghavanP #and# UpfalE , title = {{Using PageRank to characterize Web structure}} , booktitle = {{Proceedings of the 8th Annual International Conference on Computing Combinatorics (COCOON'02)}} , pages = {330--339} , series = ser-springer_lncs , volume = 2387 , year = 2002 } @Article{ps-bsfes-06 , author = PererA #and# ShneidermanB , title = {{Balancing Systematic and Flexible Exploration of Social Networks}} , journal = j-tvcg , number = 5 , pages = {693--700} , pdf = "http://hcil.cs.umd.edu/trs/2006-25/2006-25.pdf" , volume = 12 , year = 2006 } @Book{ps-cgai-85 , author = PreparataFP #and# ShamosMI , title = {{Computational Geometry: An Introduction}} , booktitle = {{Computational Geometry: An Introduction}} , publisher = pub-springer , year = 1985 } @Article{ps-gs-89 , author = PelegD #and# SchafferAA , title = {{Graph Spanners}} , journal = j-jgt , number = 1 , pages = {99--116} , volume = 13 , year = 1989 } @InCollection{ps-spatm-98 , author = PallottinoS #and# ScutellaMG , title = {{Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects}} , booktitle = {{Equilibrium and Advanced Transportation Modelling}} , pages = {245--281} , publisher = pub-kapg , year = 1998 } @inproceedings{psffg-cftit-01 , author = PalmerC #and# SiganosG #and# FaloutsosM #and# FaloutsosC #and# GibbonsP , title = {{The connectivity and fault-tolerance of the {Internet} topology}} , booktitle = {{Workshop on Network-Related Data Management (NRDM 2001)}} , year = 2001 } @Article{psw-segcr-96 , author = PittelB #and# SpencerJ #and# WormaldNC , title = {{Sudden Emergence of a Giant $k$-Core in a Random Graph}} , journal = j-jcombthb , month = may , number = 1 , pages = {111--151} , url = "http://dx.doi.org/10.1006/jctb.1996.0036" , volume = 67 , year = 1996 } @InProceedings{pswz-ecspa-04 , author = PyrgaE #and# SchulzF #and# WagnerD #and# ZaroliagisC , title = {{Experimental Comparison of Shortest Path Approaches for Timetable Information}} , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}} , pages = {88--99} , pdf = "http://i11www.ira.uka.de/algo/people/fschulz/publications/pdf/pswz-ecspa-04.pdf" , publisher = pub-siam , year = 2004 } @Article{pswz-emtip-08 , author = PyrgaE #and# SchulzF #and# WagnerD #and# ZaroliagisC , title = {{Efficient Models for Timetable Information in Public Transportation Systems}} , journal = j-acm-ea , number = {2.4} , pages = {1--39} , volume = 12 , year = 2008 } @InProceedings{pswz-trmtt-04 , author = PyrgaE #and# SchulzF #and# WagnerD #and# ZaroliagisC , title = {{Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach}} , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}} , pages = {85--103} , series = ser-entcs , volume = 92 , year = 2004 } @Article{pt-aaeod-98 , author = PapakostasA #and# TollisIG , title = {{Algorithms for Area-Efficient Orthogonal Drawings}} , journal = j-cgta , number = {1--2} , pages = {83--110} , volume = 9 , year = 1998 } @Article{pt-apo-10 , author = PapamanthouC #and# TollisIG , title = {{Applications of Parameterized $st$-Orientations}} , journal = j-jgaa , number = 2 , pages = {337--365} , volume = 14 , year = 2010 } @InProceedings{pt-apogd-06 , author = PapamanthouC #and# TollisIG , title = {{Applications of Parameterized $st$-Orientations in Graph Drawing Algorithms}} , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}} , month = jan , pages = {355--367} , publisher = pub-springer , series = ser-springer_lncs , volume = 3843 , year = 2006 } @Unpublished{pt-cnrgrp-01 , author = PoenitzA #and# TittmannP , title = {{Computing Network Reliability in Graphs of Restricted Pathwidth}} , note = {http://www.peter.htwm.de/publications/Reliability.ps} , year = 2001 } @article{pt-tpra-87 , author = PaigeR #and# TarjanRE , title = {{Three Partition Refinement Algorithms}} , journal = j-sicomp , number = 6 , pages = {973--983} , volume = 16 , year = 1987 } @misc{ptv , author = ptv , title = {{\url{http://www.ptv.de}}} , year = 1979 } @book{ptvf-nrc-92 , author = PressWH #and# TeukolskySA #and# VetterlingWT #and# FlanneryBP , title = {{Numerical Recipes in C}} , publisher = pub-cup , url = "http://www.library.cornell.edu/nr/bookcpdf.html" , year = 1992 } @article{pu-mnsisssf-59 , author = PaullMC #and# UngerSH , title = {{Minimizing the number of states in incompletely specified sequential switching functions}} , journal = j-ire-tec , pages = {356--367} , volume = {EC-8} , year = 1959 } @Book{pub-gmfa-04 , title = {{Geoinformation und Mobilit{\"a}t - von der Forschung zur praktischen Anwendung}} , booktitle = {{Geoinformation und Mobilit{\"a}t - von der Forschung zur praktischen Anwendung}} , publisher = pub-igi , volume = 22 , year = 2004 } @incollection{pv-eisfn-02 , author = PastorSatorrasR #and# VespignaniA , title = {{Epidemics and Immunization in Scale-Free Networks}} , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}} , publisher = pub-wiley-vch , url = "http://dx.doi.org/10.1002/3527602755.fmatter" , year = 2002 } @Book{pv-esisp-04 , author = PastorSatorrasR #and# VespignaniA , title = {{Evolution and Structure of the Internet: A Statistical Physics Approach}} , publisher = pub-cup , year = 2004 } @Article{pvv-dcpi-01 , author = PastorSatorrasR #and# VazquezA #and# VespignaniA , title = {{Dynamical and Correlation Properties of the Internet}} , journal = j-phrl , number = 258701 , pdf = "http://prola.aps.org/pdf/PRL/v87/i25/e258701" , url = "http://prola.aps.org/abstract/PRL/v87/i25/e258701" , volume = 87 , year = 2001 } @article{pw-lmlrs-99 , author = PattisonP #and# WassermanS , title = {{Logit Models and Logistic Regressions for Social Networks: {II.~Multivariate} Relations}} , journal = j-bjmsp , pages = {169--193} , volume = 52 , year = 1999 } @inproceedings{pw-olbnf-93 , author = PhillipsS #and# WestbrookJ , title = {{Online Load Balancing and Network Flow}} , booktitle = {{Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)}} , month = may , pages = {402--411} , year = 1993 } @article{pw-olbnf-98 , author = PhillipsS #and# WestbrookJ , title = {{On-Line Load Balancing and Network Flow}} , journal = j-alg , month = jul , number = 3 , pages = {245--261} , volume = 21 , year = 1998 } @Book{px-ahsn-05 , editor = PanY #and# XiaoY , title = {{Ad Hoc and Sensor Networks}} , booktitle = {{Ad Hoc and Sensor Networks}} , publisher = pub-nsp , series = ser-wnmc , volume = 2 , year = 2005 } @article{px-mcp-94 , author = PardalosPM #and# XueJ , title = {{The Maximum Clique Problem}} , journal = j-jgo , pages = {301--328} , volume = 4 , year = 1994 } @InProceedings{py-o-88 , author = PapadimitriouCH #and# YannakakisM , title = {{Optimization, approximation, and complexity classes}} , booktitle = {{Proceedings of the 20th Annual {ACM} Symposium on the Theory of Computing (STOC'88)}} , pages = {229--234} , publisher = pub-acm , year = 1988 } @InProceedings{pzmt-qpsnd-03 , author = PapadiasD #and# ZhangA #and# MamoulisN #and# TaoY , title = {{Query Processing in Spatial Network Databases}} , booktitle = {{Proceedings of the 29th International Conference on Very Large Databases (VLDB 2003)}} , pages = {802--813} , year = 2003 } %% -------------------------------------------------------------- @InProceedings{qe-fgdcv-01 , author = QuigleyA #and# EadesP , title = {{FADE: Graph Drawing, Clustering, and Visual Abstraction }} , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {197--210} , pdf = "http://www.springerlink.com/content/mlbkplfwx7cmk4hf/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/mlbkplfwx7cmk4hf/" , volume = 1984 , year = 2001 } %% -------------------------------------------------------------- @Article{r-a-69 , author = RuspiniEH , title = {{A new approach to clustering}} , journal = j-ico , number = 1 , pages = {22--32} , url = "dx.doi.org/10.1016/S0019-9958(69)90591-9" , volume = 15 , year = 1969 } @article{r-amis-86 , author = RobsonJM , title = {{Algorithms for Maximum Independent Sets}} , journal = j-jalg , number = 3 , pages = {425--440} , volume = 7 , year = 1986 } @Article{r-anmdg-87 , author = ReadRC , title = {{A New Method for Drawing a Graph Given the Cyclic Order of the Edges at Each Vertex}} , journal = j-congr-num , pages = {31--44} , volume = 56 , year = 1987 } @phdthesis{r-crcs-74 , author = RosenthalA , title = {{Computing Reliability of Complex Systems}} , school = "University of California" , year = 1974 } @InProceedings{r-dvoob-93 , author = RudellR , title = {{Dynamic Variable Ordering for Ordered Binary Decision Diagrams}} , booktitle = {{Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design}} , pages = {42--47} , publisher = pub-ics , year = 1993 } @article{r-ec-00 , author = RuhnauB , title = {{Eigenvector-centrality -- a node-centrality?}} , journal = j-sn , pages = {357--365} , volume = 22 , year = 2000 } @book{r-ipm-03 , author = RossSM , title = {{Introduction to Probability Models}} , edition = eighth , publisher = pub-ap , year = 2003 } @Book{r-ir-79 , author = RijsbergenCJ , title = {{Information Retrieval}} , booktitle = {{Information Retrieval}} , publisher = pub-bh , year = 1979 } @book{r-ms-95 , author = RiceJA , title = {{Mathematical Statistics and Data Analysis}} , edition = second , publisher = pub-dp , year = 1995 } @InCollection{r-obcg-69 , author = RobertsFS , title = {{On the Boxicity and Cubicity of a Graph}} , booktitle = {{Recent Progresses in Combinatorics}} , pages = {301--310} , publisher = pub-ap , year = 1969 } @Article{r-ocecm-71 , author = RandWM , title = {{Objective Criteria for the Evaluation of Clustering Methods}} , journal = j-jasa , month = dec , number = 336 , pages = {846--850} , pdf = "http://www.jstor.org/stable/pdfplus/2284239.pdf" , url = "http://www.jstor.org/stable/2284239?origin=crossref" , volume = 66 , year = 1971 } @InProceedings{r-ohdcm-08 , author = RackeH , title = {{Optimal Hierarchical Decompositions for Congestion Minimization in Networks}} , booktitle = {{Proceedings of the 40th Annual {ACM} Symposium on the Theory of Computing (STOC'08)}} , pages = {255--263} , publisher = pub-acm , year = 2008 } @article{r-rrssspp-97 , author = RamanR , title = {{Recent results on the single-source shortest paths problem}} , journal = j-sigact-news , number = 2 , pages = {81--87} , volume = 28 , year = 1997 } @InCollection{r-sa-08 , author = RossmanithP , title = {{Simulated Annealing}} , booktitle = {{Taschenbuch der Algorithmen}} , pages = {423--431} , publisher = pub-springer , url = "http://www-i1.informatik.rwth-aachen.de/~algorithmus/" , year = 2008 } @mastersthesis{r-sbm-07 , author = RutterI , title = {{Schnelle Berechnung von gro\ss{}en Matchings}} , month = apr , pdf = "http://i11www.ira.uka.de/extra/publications/r-sbm-07.pdf" , school = "Fakult{\"a}t f{\"u}r Informatik, Universit{\"a}t Karlsruhe" , year = 2007 } @InProceedings{r-scdpg-05 , author = RoteG , title = {{Strictly Convex Drawings of Planar Graphs}} , booktitle = {{Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)}} , pages = {728--734} , publisher = pub-siam , year = 2005 } @article{r-tadgc-87 , author = ReifJH , title = {{A Topological Approach to Dynamic Graph Connectivity}} , journal = j-ipl , month = apr , number = 1 , pages = {65--70} , volume = 25 , year = 1987 } @InCollection{r-tmfpm-12 , author = RutterI , title = {{The Many Faces of Planarity -- Matching, Augmentation, and Embedding Algorithms for Planar Graphs --}} , booktitle = {{Ausgezeichnete Informatikdissertationen 2011}} , pages = {161--170} , pdf = "http://i11www.ira.uka.de/extra/publications/r-tmfpm-12.pdf" , series = ser-lni , volume = {D-12} , year = 2012 } @phdthesis{r-tmp-11 , author = RutterI , title = {{The Many Faces of Planarity -- Matching, Augmentation, and Embedding Algorithms for Planar Graphs --}} , month = jul , pdf = "http://i11www.ira.uka.de/extra/publications/r-tmp-11.pdf" , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie (KIT)" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024304" , year = 2011 } @Article{r-ttmpb-93 , author = RingelG , title = {{Two Trees in Maximal Planar Bipartite Graphs}} , journal = j-jgt , pages = {755--758} , volume = 17 , year = 1993 } @article{r-vdped-87 , author = WhittyRW , title = {{Vertex-Disjoint Paths and Edge-Disjoint Branchings in Directed Graphs}} , journal = j-jgt , number = 3 , pages = {349--358} , volume = 11 , year = 1987 } @Book{ra-esnam-12 , editor = RokneJ #and# AlhajjR , title = {{Encyclopedia of Social Network Analysis and Mining}} , booktitle = {{Encyclopedia of Social Network Analysis and Mining}} , publisher = pub-springer , year = 2013 } @Article{rb-dfcsc-04 , author = ReichardtJ #and# BornholdtS , title = {{Detecting Fuzzy Community Structures in Complex Networks with a Potts Model}} , journal = j-phrl , month = nov , number = 21 , pages = 218701 , url = "http://link.aps.org/doi/10.1103/PhysRevLett.93.218701" , volume = 93 , year = 2004 } @Article{rb-smcd-06 , author = ReichardtJ #and# BornholdtS , title = {{Statistical Mechanics of Community Detection}} , journal = j-pr-e , number = 016110 , pages = {1--16} , pdf = "http://www.itp.uni-bremen.de/complex/pre016110.pdf" , volume = 74 , year = 2006 } @article{rc-gid-77 , author = ReadRC #and# CorneilDG , title = {{The Graph Isomorphism Disease}} , journal = j-jgt , pages = {339--363} , volume = 1 , year = 1977 } @Article{rcnsdc-kfbdp-13 , author = Roshany-YamchiS #and# CychowskiM #and# NegenbornR #and# SchutterBD #and# DelaneyK #and# ConnellJ , title = {{Kalman Filter-Based Distributed Predictive Control of Large-Scale Multi-Rate Systems: Application to Power Networks}} , journal = j-ieeetcst , month = jan , number = 1 , pages = {27--39} , volume = 21 , year = 2013 } @Article{rg-sabg-77 , author = RosenthalAr #and# GoldnerA , title = {{Smallest Augmentations to Biconnect a Graph}} , journal = j-sicomp , month = mar , number = 1 , pages = {55--66} , volume = 6 , year = 1977 } @article{rgw-rcgsm-02 , author = RaymondJW #and# GardinerEJ #and# WilletP , title = {{{RASCAL}: {Calculation} of Graph Similarity using Maximum Common Edge Subgraphs}} , journal = j-tcj , number = 6 , pages = {631--644} , volume = 45 , year = 2002 } @InProceedings{rhks-taocs-02 , author = RatnasamyS #and# HandleyM #and# KarpRM #and# ShenkerSJ , title = {{Topologically-Aware Overlay Construction and Server Selection}} , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , pages = {1190--1199} , pdf = "http://ieeexplore.ieee.org/iel5/7943/21923/01019369.pdf" , publisher = pub-ieeecs , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1019369" , volume = 1 , year = 2002 } @Article{rls-otnre-97 , author = RingelG #and# LladoA #and# SerraO , title = {{On the Tree Number of REgular Graphs}} , journal = j-dima , pages = {587--595} , volume = {165--166} , year = 1997 } @Article{rm-pmrh-88 , author = ReggianiMG #and# MarchettiFE , title = {{A Proposed Method for Representing Hierarchies}} , journal = j-ieeetsmc , number = 1 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=87050" , volume = 18 , year = 1988 } @Article{rn-m-11 , author = RottaR #and# NoackA , title = {{Multilevel local search algorithms for modularity clustering}} , journal = j-acm-ea , month = jul , pages = {2.3:2.1--2.3:2.27} , url = "http://doi.acm.org/10.1145/1963190.1970376" , volume = 16 , year = 2011 } @Article{rpkl-a-07 , author = RobinsG #and# PattisonPip #and# KalishY #and# LusherD , title = {{An introduction to exponential random graph (p*) models for social networks}} , journal = j-sn , number = 2 , pages = {173--191} , url = "http://www.sciencedirect.com/science/article/pii/S0378873306000372" , volume = 29 , year = 2007 } @article{rpw-lmlrs-99 , author = RobinsG #and# PattisonP #and# WassermanS , title = {{Logit Models and Logistic Regressions for Social Networks: {III.~Valued} Relations}} , journal = j-psy , pages = {371--394} , volume = 64 , year = 1999 } @Article{rr-aiags-96 , author = RepsT #and# RamalingamG , title = {{An Incremental Algorithm for a Generalization of the Shortest-Path Problem}} , journal = j-jalg , month = sep , number = 2 , pages = {267--305} , volume = 21 , year = 1996 } @Article{rr-o-96 , author = RamalingamG #and# RepsT , title = {{On the computational complexity of dynamic graph problems}} , journal = j-tcs , month = may , number = 1 , pages = {233--277} , volume = 158 , year = 1996 } @Article{rs-fadp-59 , author = RabinMO #and# ScottD , title = {{Finite Automata and their Decision Problems}} , journal = j-ijrd , pages = {114--125} , volume = 3 , year = 1559 } @techreport{rs-npc2ra-97 , author = RobertsFS #and# ShengL , title = {{{$\mathcal{NP}$}-Completeness for 2-Role Assignability}} , institution = "Rutgers Center for Operation Research" , number = 8 , type = {Technical Report} , year = 1997 } @InProceedings{rt-basaa-12 , author = RiceM #and# TsotrasV , title = {{Bidirectional A$^*$ Search with Additive Approximation Bounds}} , booktitle = {{Proceedings of the 5th International Symposium on Combinatorial Search (SoCS'12)}} , publisher = pub-aaaip , year = 2012 } @InProceedings{rt-egsag-12 , author = RiceJA #and# TsotrasV , title = {{Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems}} , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}} , pages = {344--355} , publisher = pub-springer , series = ser-springer_lncs , volume = 7276 , year = 2012 } @InProceedings{rt-girns-11 , author = RiceM #and# TsotrasV , title = {{Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions}} , booktitle = {{Proceedings of the 37th International Conference on Very Large Databases (VLDB 2011)}} , pages = {69--80} , pdf = "dl.acm.org/ft_gateway.cfm?id=1921074&type=pdf" , year = 2011 } @InProceedings{rt-gsagt-12 , author = RiceM #and# TsotrasV , title = {{Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems}} , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}} , pages = {344--355} , publisher = pub-springer , series = ser-springer_lncs , volume = 7276 , year = 2012 } @Article{rt-rplbo-86 , author = RosenstiehlP #and# TarjanRE , title = {{Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs}} , journal = dcg , number = 1 , pages = {343--353} , volume = 1 , year = 1986 } @Article{rt-tdt-81 , author = ReingoldEM #and# TilfordJS , title = {{Tidier Drawings of Trees}} , journal = j-ieeetse , number = 2 , pages = {223--227} , volume = 7 , year = 1981 } @techreport{rtygse-cntat-00 , author = RadoslavovP #and# TangmunarunkitH #and# YuH #and# GovindanR #and# ShenkerSJ #and# EstrinD , title = {{On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design}} , institution = "Computer Science Department, University of Southern California" , month = feb , number = {00-731} , type = {Technical Report} , url = "ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/00-731.ps.Z" , year = 2000 } @Article{rup-sepsc-12 , author = RakpenthaiC #and# UatrongjitS #and# PremrudeepreechacharnS , title = {{State Estimation of Power System Considering Network Parameter Uncertainty Based on Parametric Interval Linear Systems}} , journal = j-ieeetps , month = feb , number = 1 , pages = {305--313} , volume = 27 , year = 2012 } @InProceedings{rw-acpgg-08 , author = RutterI #and# WolffA , title = {{Augmenting the connectivity of planar and geometric graphs}} , booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)}} , pages = {71--74} , pdf = "http://i11www.ira.uka.de/extra/publications/rw-acpgg-08.pdf" , year = 2008 } @Article{rw-acpgg-12 , author = RutterI #and# WolffA , title = {{Augmenting the Connectivity of Planar and Geometric Graphs}} , journal = j-jgaa , number = 2 , pages = {599--628} , url = "http://dx.doi.org/10.7155/jgaa.00275" , volume = 16 , year = 2012 } @Article{rw-acpgg-endm08 , author = RutterI #and# WolffA , title = {{Augmenting the Connectivity of Planar and Geometric Graphs}} , journal = j-endima , pages = {53--56} , url = "http://dx.doi.org/10.1016/j.endm.2008.06.009" , volume = 31 , year = 2008 } @InProceedings{rw-acpgg-tggt08 , author = RutterI #and# WolffA , title = {{Augmenting the connectivity of planar and geometric graphs}} , booktitle = {{Topological & Geometric Graph Theory (TGGT'08)}} , pages = {55--58} , pdf = "http://i11www.ira.uka.de/extra/publications/rw-acpgg-tggt08.pdf" , year = 2008 } @techreport{rw-acpgg-tr08 , author = RutterI #and# WolffA , title = {{Augmenting the Connectivity of Planar and Geometric Graphs}} , institution = iti_wagner , number = {2008-3} , pdf = "http://i11www.ira.uka.de/extra/publications/rw-acpgg-tr08.pdf" , year = 2008 } @Article{rw-afsls-07 , author = ResendeM #and# WerneckR , title = {{A Fast Swap-based Local Search Procedure for Location Problems}} , journal = j-aor , pages = {205--230} , volume = 150 , year = 2007 } @InProceedings{rw-clmf-08 , author = RutterI #and# WolffA , title = {{Computing Large Matchings Fast}} , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}} , pages = {183--192} , pdf = "http://i11www.ira.uka.de/extra/publications/rw-clmf-08.pdf" , year = 2008 } @Article{rw-clmf-10 , author = RutterI #and# WolffA , title = {{Computing Large Matchings Fast}} , journal = j-acmta , number = 1 , volume = 7 , year = 2010 } @techreport{rw-clmf-tr07 , author = RutterI #and# WolffA , title = {{Computing large matchings fast}} , institution = iti_wagner , number = {2007-19} , pdf = "http://i11www.ira.uka.de/extra/publications/rw-c-07.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007350" , year = 2007 } @article{rw-ptpng-95 , author = RendlF #and# WolkowiczH , title = {{A Projection Technique for Partitioning the Nodes of a Graph}} , journal = j-aor , pages = {155--180} , volume = 58 , year = 1995 } @Article{rww-ladtp-96 , author = RipphausenLipaH #and# WagnerD #and# WeiheK , title = {{Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs}} , journal = j-ijfcs , number = 2 , pages = {95--110} , volume = 7 , year = 1996 } @InProceedings{rww-ltadt-93 , author = RipphausenLipaH #and# WagnerD #and# WeiheK , title = {{Linear time algorithms for disjoint two-face paths problem in planar graphs}} , booktitle = {{Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93)}} , pages = {343--352} , publisher = pub-springer , series = ser-springer_lncs , volume = 762 , year = 1993 } @InCollection{rww-seadp-95 , author = RipphausenLipaH #and# WagnerD #and# WeiheK , title = {{Survey on Efficient Algorithms for Disjoint Paths Problems in Planar Graphs}} , booktitle = {{DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, Volume 20 on the ``Year of Combinatorial Optimization''}} , pages = {295--354} , publisher = pub-ams , year = 1995 } @techreport{rww-vdmpp-92 , author = RipphausenLipaH #and# WagnerD #and# WeiheK , title = {{The Vertex-Disjoint Menger Problem in Planar Graphs}} , institution = "Fachbereich Mathematik, Technische Universit{\"a}t Berlin" , number = 324 , year = 1992 } @InProceedings{rww-vdmpp-93 , author = RipphausenLipaH #and# WagnerD #and# WeiheK , title = {{The vertex-disjoint Menger-problem in planar graphs}} , booktitle = {{Proceedings of the 4th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'93)}} , pages = {112--119} , year = 1993 } @Article{rww-vmppg-97 , author = RipphausenLipaH #and# WagnerD #and# WeiheK , title = {{The vertex-disjoint Menger problem in planar graphs}} , journal = j-sicomp , number = 2 , pages = {331--349} , volume = 26 , year = 1997 } @inproceedings{rz-dspp-04 , author = RodittyL #and# ZwickU , title = {{On Dynamic Shortest Paths Problems}} , booktitle = {{Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04)}} , pages = {580--591} , series = ser-springer_lncs , volume = 3221 , year = 2004 } @InProceedings{rz-rpssp-05 , author = RodittyL #and# ZwickU , title = {{Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs}} , booktitle = {{Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP'05)}} , pages = {249--260} , publisher = pub-springer , series = ser-springer_lncs , volume = 3580 , year = 2005 } %% -------------------------------------------------------------- @Article{s-a-01 , author = SchoebelA , title = {{A model for the delay management problem based on mixed-integer programming}} , journal = j-entcs , number = 1 , pages = {1--10} , volume = 50 , year = 2001 } @Article{s-a-06 , author = ScutellaMG , title = {{A note on the parametric maximum flow problem and some related reoptimization issues}} , journal = j-aor , month = dec , number = 1 , pages = {231--244} , volume = 150 , year = 2006 } @phdthesis{s-aatbn-07 , author = SchankT , title = {{Algorithmic Aspects of Triangle-Based Network Analysis}} , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/4541" , school = inf_ka , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007159" , year = 2007 } @Article{s-acbsp-00 , author = SkriverAJ , title = {{A Classification of Bricriterion Shortest Path (BSP) Algorithms}} , journal = j-apjor , pages = {199--212} , volume = 17 , year = 2000 } @article{s-aceum-95 , author = ScottJA , title = {{An Arnoldi code for computing selected eigenvalues of sparse real unsymmetric matrices}} , journal = j-acm-tms , pages = {423--475} , volume = 21 , year = 1995 } @InCollection{s-aeaad-09 , author = SandersP , title = {{Algorithm Engineering -- An Attempt at a Definition}} , booktitle = {{Efficient Algorithms}} , pages = {321--340} , pdf = "http://algo2.iti.kit.edu/documents/definition.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://dx.doi.org/10.1007/978-3-642-03456-5_22" , volume = 5760 , year = 2009 } @Book{s-afgdc-03 , author = StoneM , title = {{A Field Guide to Digital Color}} , booktitle = {{A Field Guide to Digital Color}} , publisher = pub-akpl , series = ser-ams_cbms , year = 2003 } @Article{s-amtc-01 , author = ShannonCE , title = {{A Mathematical Theory of Communication}} , journal = j-acm-mccr , month = jan , number = 1 , pages = {3--55} , volume = 5 , year = 2001 } @Article{s-anisg-82 , author = SchreiberR , title = {{A New Implementation of Sparse Gaussian Elimination}} , journal = j-acm-tms , month = sep , number = 3 , pages = {256--276} , volume = 8 , year = 1982 } @book{s-argc-93 , author = SinclairA , title = {{Algorithms for Random Generation and Counting: A Markov Chain Approach}} , publisher = pub-birk , year = 1993 } @InProceedings{s-aspg-09 , author = SenS , title = {{Approximating Shortest Paths in Graphs}} , booktitle = {{Proceedings of the 3rd Workshop on Algorithms and Computation (WALCOM'09)}} , month = feb , pages = {32--43} , publisher = pub-springer , series = ser-springer_lncs , volume = 5431 , year = 2009 } @phdthesis{s-avn-13 , author = StorandtS , title = {{Algorithms for vehicle navigation}} , month = feb , school = "Universit{\"a}t Stuttgart" , url = "http://elib.uni-stuttgart.de/opus/volltexte/2013/8112" , year = 2013 } @article{s-becun-79 , author = SchnorrCP , title = {{Bottlenecks and edge connectivity in unsymmetrical networks}} , journal = j-sicomp , month = may , number = 2 , pages = {265--274} , volume = 8 , year = 1979 } @techreport{s-bteaj-07 , author = SonntagG , title = {{Bonner Thesen - Ein Aktionsplan der Jungen Informatik}} , institution = "Deutsche Forschungsgemeinschaft" , pdf = "http://www.bonner-thesen.de/Bonner-Thesen.pdf" , year = 2007 } @Article{s-cgpcm-94 , author = SachsH , title = {{Coin Graphs, Polyhedra, and Conformal Mapping}} , journal = j-dima , pages = {133--138} , volume = 134 , year = 1994 } @Article{s-cicg-85 , author = ScheinermanER , title = {{Characterizing Intersection Classes of Graphs}} , journal = j-dima , month = jul , number = 2 , pages = {185--193} , volume = 55 , year = 1985 } @article{s-cig-66 , author = SabidussiG , title = {{The Centrality Index of a Graph}} , journal = j-psy , pages = {581--603} , volume = 31 , year = 1966 } @article{s-clsdn-80 , author = SeidmanSB , title = {{Clique-like structures in directed networks}} , journal = j-jsbs , pages = {43--54} , volume = 3 , year = 1980 } @Article{s-cm-51 , author = SteinSK , title = {{Convex Maps}} , journal = j-pams , number = 3 , pages = {464--466} , volume = 2 , year = 1951 } @book{s-cope-03 , author = SchrijverA , title = {{Combinatorial Optimization: Polyhedra and Efficiency}} , publisher = pub-springer , year = 2003 } @InCollection{s-cpadc-96 , author = ShmoysDB , title = {{Cut Problems and their Application to Divide-and-Conquer}} , booktitle = {{Approximation Algorithms for NP-hard Problems}} , pages = {192--235} , publisher = pub-cti , url = "http://www.orie.cornell.edu/~shmoys/multicut.ps" , year = 1996 } @techreport{s-cppac-07 , author = SchrammO , title = {{Combinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps}} , institution = "Princeton University" , note = {Modiefied version of Ph. D. thesis, Princeton University, 1990} , url = "http://arxiv.org/abs/0709.0710v1" , year = 2007 } @InProceedings{s-cscc-10 , author = SchmidtJM , title = {{Construction Sequences and Certifying 3-Connectedness}} , booktitle = {{Proceedings of the 27nd International Symposium on Theoretical Aspects of Computer Science (STACS'10)}} , pages = {633--644} , publisher = pub-springer , series = ser-springer_lncs , year = 2010 } @misc{s-ctccc-08 , author = SchmochU , title = {{Concept of a Technology Classification for Country Comparisons}} , month = jun , note = {Final Report to the World Intellectual Property Organisation (WIPO)} , pdf = "http://www.wipo.int/export/sites/www/ipstats/en/statistics/patents/pdf/wipo_ipc_technology.pdf" , url = "http://www.wipo.int/ipstats/en/" , year = 2008 } @misc{s-deelg-08 , author = SchulzC , title = {{Design and Experimental Evaluation of a Local Graph Clustering Algorithm}} , institution = uni_ka , month = jun , note = {Student Project, Studienarbeit} , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/studienarbeit-schulz-08.pdf" , school = "Department of Informatics" , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished" , year = 2008 } @phdthesis{s-dmptc-10 , author = SchachtebeckM , title = {{Delay Management in Public Transportation: Capacities, Robustness, and Integration}} , pdf = "http://webdoc.sub.gwdg.de/diss/2010/schachtebeck/schachtebeck.pdf" , school = "Georg-August-Universit{\"a}t G{\"o}ttingen" , year = 2010 } @mastersthesis{s-drsrt-12 , author = StrasserB , title = {{Delay-Robust Stochastic Routing in Timetable Networks}} , institution = "Karlsruhe Institute of Technology" , month = jul , pdf = "http://i11www.ira.uka.de/extra/publications/s-drsrt-12.pdf" , year = 2012 } @Book{s-dsbkg-07 , author = StegerA , title = {{Diskrete Strukturen Band 1. Kombinatorik, Graphentheorie, Algebra}} , booktitle = {{Diskrete Strukturen Band 1. Kombinatorik, Graphentheorie, Algebra}} , publisher = pub-springer , year = 2007 } @Book{s-e-12 , editor = SchwabA , title = {{Elektroenergiesysteme}} , booktitle = {{Elektroenergiesysteme}} , note = {3. Auflage, ISBN 3-540-29664-6} , publisher = pub-springer , year = 2012 } @incollection{s-ecrmb-77 , author = SchwartzJE , editor = HeiseDR , title = {{An Examination of {CONCOR} and Related Methods for Blocking Sociometric Data}} , booktitle = {{Sociological Methodology 1977}} , pages = {255-282} , publisher = pub-jb , year = 1977 } @misc{s-eedgca-09 , author = StaudtC , title = {{Experimental Evaluation of Dynamic Graph Clustering Algorithms}} , institution = iti_wagner , month = feb , note = {Student Project, Studienarbeit} , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/studienarbeit-staudt-09.pdf" , url = "http://i11www.iti.uni-karlsruhe.de/projects/spp1307/dyneval" , year = 2010 } @InProceedings{s-epgg-90 , author = SchnyderW , title = {{Embedding Planar Graphs on the Grid}} , booktitle = {{Proceedings of the 1st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'90)}} , month = jan , pages = {138--148} , year = 1990 } @Article{s-eupsc-91 , author = SchrammO , title = {{Existence and Uniqueness of Packings with Specified Combinatorics}} , journal = j-ijm , month = oct , number = 3 , pages = {321--341} , volume = 73 , year = 1991 } @article{s-famcdg-04 , author = StixV , title = {{Finding All Maximal Cliques in Dynamic Graphs}} , journal = j-coa , number = 2 , pages = {173--186} , volume = 27 , year = 2004 } @Book{s-ga-50 , author = SchlafliL , title = {{Gesammelte mathematische Abhandlungen}} , booktitle = {{Gesammelte mathematische Abhandlungen}} , publisher = {Birkh{"a}user Verlag} , volume = 1 , year = 1950 } @Article{s-gc-07 , author = SchaefferSE , title = {{Graph Clustering}} , journal = j-csr , month = aug , number = 1 , pages = {27--64} , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B8JDG-4PBG1S7-1-1&_cdi=43614&_user=2149863&_" , url = "http://dx.doi.org/10.1016/j.cosrev.2007.05.001" , volume = 1 , year = 2007 } @article{s-gilh-88 , author = SchoeningU , title = {{Graph Isomorphism is in the Low Hierarchy}} , journal = j-css , pages = {312--323} , volume = 37 , year = 1988 } @mastersthesis{s-hasp-09 , author = SchummA , title = {{Heuristic Algorithms for the Shortcut Problem}} , month = jul , pdf = "http://i11www.ira.uka.de/extra/publications/s-hasp-09.pdf" , school = "Karlsruhe Institute of Technology (KIT)" , year = 2009 } @InCollection{s-i-07 , author = SchoebelA , title = {{Integer programming approaches for solving the delay management problem}} , booktitle = {{Algorithmic Methods for Railway Optimization}} , pages = {145--170} , publisher = pub-springer , series = ser-springer_lncs , volume = 4359 , year = 2007 } @article{s-iclssg-83 , author = SeidmanSB , title = {{Internal Cohesion of {LS} Sets in Graphs}} , journal = j-sn , month = jun , number = 2 , pages = {97--107} , volume = 5 , year = 1983 } @phdthesis{s-icmip-84 , author = ScheinermanER , title = {{Intersection Classes and Multiple Intersection Parameters of Graphs}} , school = "Princeton University" , year = 1984 } @book{s-icptt-05 , author = StephensonK , title = {{Introduction to Circle Packing: The Theory of Discrete Analytic Functions}} , publisher = pub-cup , year = 2005 } @Article{s-imiwi-85 , author = ScheinermanER , title = {{Irrepresentability by Multiple Intersection, or Why the Interval Number is Unbounded}} , journal = j-dima , month = jul , number = 2 , pages = {195--211} , volume = 55 , year = 1985 } @InProceedings{s-lbeag-01 , author = SensenN , title = {{Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows}} , booktitle = {{Proceedings of the 9th Annual European Symposium on Algorithms (ESA'01)}} , pages = {391--403} , series = ser-springer_lncs , volume = 2161 , year = 2001 } @article{s-mcmc-02 , author = SnijdersTAB , title = {{Markov Chain Monte Carlo Estimation of Exponential Random Graph Models}} , journal = j-ss , month = apr , number = 2 , pdf = "www.cmu.edu/joss/content/articles/volume3/Snijders.pdf" , volume = 3 , year = 2002 } @misc{s-md-08 , author = StadtentwicklungBf , title = {{{Mobilit{\"a}t in Deutschland 2008}}} , type = {Case Study} , year = 2008 } @techreport{s-mfa-78 , author = ShiloachY , title = {{An {$\mathcal{O}(n\cdot I\log^2 I)$} Maximum-Flow Algorithm}} , institution = "Computer Science Department, Stanford University" , month = dec , number = {STAN-CS-78} , year = 1978 } @article{s-mfl-75 , author = SlaterP , title = {{Maximin Facility Location}} , journal = j-nationalb , pages = {107--115} , volume = {79B} , year = 1975 } @article{s-nri-49 , author = SeeleyJR , title = {{The Net of Reciprocal Influence}} , journal = j-cjp , number = 4 , pages = {234--240} , volume = {III} , year = 1949 } @article{s-nsmd-83 , author = SeidmanSB , title = {{Network Structure and Minimum Degree}} , journal = j-sn , pages = {269--287} , volume = 5 , year = 1983 } @Book{s-opt-06 , author = SchoebelA , title = {{Optimization in Public Transportation}} , booktitle = {{Optimization in Public Transportation}} , publisher = pub-springer , series = ser-soia , volume = 3 , year = 2006 } @book{s-pcc-79 , editor = SchrijverA , title = {{Packing and Covering in Combinatorics}} , booktitle = {{Packing and Covering in Combinatorics}} , publisher = pub-mc , year = 1979 } @article{s-pfhs-93 , author = SchrijverA , title = {{Paths and Flows---a Historical Survey}} , journal = j-cwi-qu , month = sep , number = 3 , pages = {169--183} , volume = 6 , year = 1993 } @Article{s-pgpd-89 , author = SchnyderW , title = {{Planar Graphs and Poset Dimension}} , journal = j-order , number = 4 , pages = {323--343} , volume = 5 , year = 1989 } @Book{s-pr-14 , author = SteinitzE , title = {{Polyeder und Raumeinteilungen}} , booktitle = {{Polyeder und Raumeinteilungen}} , publisher = pub-t , series = "Encyklop{"a}die der " , year = 1914 } @InProceedings{s-q-12 , author = StorandtS , title = {{Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles}} , booktitle = {{Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science}} , pages = {20--25} , publisher = pub-acm , url = "http://dx.doi.org/10.1145/2442942.2442947" , year = 2012 } @inbook{s-r-09 , author = SantosJL , title = {{Real-world applications of shortest path algorithms}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @phdthesis{s-rapln-06 , author = SchillingH , title = {{Route Assignment Problems in Large Networks}} , school = "Technische Universit{\"a}t Berlin" , year = 2006 } @InProceedings{s-rpbec-12 , author = StorandtS , title = {{Route Planning for Bicycles -- Exact Constrained Shortest Paths Made Practical Via Contraction Hierarchy }} , booktitle = {{Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling}} , pages = {234--242} , year = 2012 } @phdthesis{s-rprn-08 , author = SchultesD , title = {{Route Planning in Road Networks}} , month = feb , note = {\url{http://algo2.iti.uka.de/schultes/hwy/schultes_diss.pdf}} , pdf = "http://algo2.iti.uni-karlsruhe.de/schultes/hwy/schultes_diss.pdf" , school = inf_ka , year = 2008 } @mastersthesis{s-rprnt-11 , author = SasseJ , title = {{Route Planning in Road Networks with Turn Costs and Multi Edge Restrictions}} , month = nov , school = "Karlsruhe Institute of Technology" , type = {Diploma Thesis} , year = 2011 } @article{s-scaadfa-81 , author = SharirM , title = {{A Strong-Connectivity Algorithm and its Applications in Data Flow Analysis}} , journal = j-cma , number = 1 , pages = {67--72} , volume = 7 , year = 1981 } @phdthesis{s-sccg-11 , author = SchmidtJM , title = {{Structure and Constructions of 3-Connected Graphs}} , month = mar , school = "Fachbereich Mathematik und Informatik, Freie Universit{\"a}t Berlin" , year = 2011 } @mastersthesis{s-scsut-08 , author = SchieferdeckerD , title = {{Systematic Combination of Speed-Up Techniques for exact Shortest-Path Queries}} , month = jan , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/da-schief-08.pdf" , school = inf_ka , year = 2008 } @article{s-semdca-78 , author = SailerLD , title = {{Structural Equivalence: Meaning and Definition, Computation and Application}} , journal = j-sn , pages = {73--90} , volume = 1 , year = 1978 } @article{s-spcn-53 , author = ShimbelA , title = {{Structural Parameters of Communication Networks}} , journal = j-bmb , pages = {501--507} , volume = 15 , year = 1953 } @misc{s-spqsn-12 , author = SommerC , title = {{Shortest-Path Queries in Static Networks}} , note = {submitted. Preprint available at \url{http://www.sommer.jp/spq-survey.htm}} , pdf = "http://www.sommer.jp/spq-survey.pdf" , url = "http://www.sommer.jp/spq-survey.htm" , year = 2012 } @Article{s-tinpg-83 , author = ScheinermanER , title = {{The Interval Number of a Planar Graph: Three Intervals Suffice}} , journal = j-jcombthb , month = dec , number = 3 , pages = {224--239} , volume = 35 , year = 1983 } @phdthesis{s-tisp-05 , author = SchulzF , title = {{Timetable Information and Shortest Paths}} , school = inf_ka , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000002042" , year = 2005 } @InCollection{s-tk-50 , author = SchlafliL , title = {{Theorie der vielfachen Kontinuit{\"a}t}} , booktitle = {{Gesammelte mathematische Abhandlungen}} , publisher = {Birkh{"a}user Verlag} , volume = 1 , year = 1950 } @book{s-tlip-86 , author = SchrijverA , title = {{Theory of linear and integer programming}} , publisher = pub-wiley , year = 1986 } @misc{s-tolei-08 , author = SloaneNJ , title = {{The On-Line Encyclopedia of Integer Sequences}} , note = {\url{www.research.att.com/~njas/sequences/}} , url = "www.research.att.com/~njas/sequences/" , year = 2008 } @Article{s-tsesn-01 , author = SnijdersTAB , title = {{The Statistical Evaluation of Social Network Dynamics}} , journal = j-sm , number = 1 , pages = {361--395} , url = "http://onlinelibrary.wiley.com/doi/10.1111/0081-1750.00099/abstract" , volume = 31 , year = 2001 } @misc{s-ttnh-12 , author = SchillingH , title = {{TomTom Navigation - How mathematics help getting through traffic faster}} , note = {Talk given at ISMP} , url = "http://ismp2012.mathopt.org/show-abs?abs=1893" , year = 2012 } @InProceedings{sa-idrno-06 , author = SeetharamanS #and# AmmarM , title = {{On the Interaction Between Dynamic Routing in Native and Overlay Layers}} , booktitle = {{Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , month = apr , pages = {1--12} , pdf = "http://ieeexplore.ieee.org/iel5/4146652/4146653/04146974.pdf" , publisher = pub-ieeecs , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4146974" , year = 2006 } @inproceedings{sark-cihmv-02 , author = SubramanianL #and# AgarwalS #and# RexfordJ #and# KatzRH , title = {{Characterizing the Internet Hierarchy from Multiple Vantage Points}} , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}} , pages = {618--627} , pdf = "http://www.ieee-infocom.org/2002/papers/594.pdf" , publisher = pub-ieeecs , volume = 1 , year = 2002 } @InProceedings{sas-eqpsn-05 , author = SankaranarayananJ #and# AlborziH #and# SametH , title = {{Efficient Query Processing on Spatial Networks}} , booktitle = {{Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems (GIS'05)}} , pages = {200--209} , year = 2005 } @Article{sb-af-71 , author = SteiglitzK #and# BrunoJ , title = {{A new derivation of Frisch's algorithm for calculating vertex-pair connectivity}} , journal = j-bit , month = mar , number = 1 , pages = {94--106} , volume = 11 , year = 1971 } @book{sb-ina-93 , author = StoerJ #and# BulirschR , title = {{Introduction to Numerical Analysis}} , publisher = pub-springer , year = 1993 } @InProceedings{sbb-s-12 , author = SamaranayakeS #and# BlandinS #and# BayenA , title = {{Speedup Techniques for the Stochastic on-time Arrival Problem}} , booktitle = {{Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12)}} , pages = {83--96} , series = ser-oasioasi , year = 2012 } @Article{sc-emomg-08 , author = SchuetzP #and# CaflischA , title = {{Efficient Modularity Optimization by Multistep Greedy Algorithm and Vertex Mover Refinement}} , journal = j-phre , number = 046112 , url = "http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=PLEEE8000077000004046112000001&idtype=cvips&gifs=yes" , volume = 77 , year = 2008 } @InProceedings{sf-cbpvn-12 , author = StorandtS #and# FunkeS , title = {{Cruising with a Battery-Powered Vehicle and Not Getting Stranded}} , booktitle = {{Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence}} , pdf = "http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4794/5311" , publisher = pub-aaaip , year = 2012 } @InProceedings{sf-eemfl-13 , author = StorandtS #and# FunkeS , title = {{Enabling E-Mobility: Facility Location for Battery Loading Stations}} , booktitle = {{Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence}} , publisher = pub-aaaip , year = 2013 } @article{sf-gtgcc-78 , author = SeidmanSB #and# FosterBL , title = {{A graph-theoretic generalization of the clique concept}} , journal = j-jms , pages = {139--154} , volume = 6 , year = 1978 } @article{sf-npgcfbam-78 , author = SeidmanSB #and# FosterBL , title = {{A note on the potential for genuine cross-fertilization between anthropology and mathematics}} , journal = j-sn , pages = {65--72} , volume = 172 , year = 1978 } @InProceedings{sg-achla-10 , author = SturtevantNR #and# GeisbergerR , title = {{A Comparison of High-Level Approaches for Speeding Up Pathfinding}} , booktitle = {{Proceedings of the 6th Artificial Intelligence for Interactive Digital Entertainment Conference (AIIDE'10)}} , publisher = pub-aaaip , year = 2010 } @unpublished{sg-cdcn-04 , author = SinghB #and# GupteN , title = {{Congestion and Decongestion in a communication network}} , note = {arXiv cond-mat/0404353} , url = "http://arxiv.org/ps/cond-mat/0404353" , year = 2004 } @Article{sg-cekrf-03 , author = StrehlA #and# GhoshJ , title = {{Cluster Ensembles - a Knowledge Reuse Framework For Combining Multiple Partitions}} , journal = j-ml , pages = {583--617} , url = "http://portal.acm.org/citation.cfm?id=944935" , volume = 3 , year = 2003 } @Article{sg-pcap-76 , author = SahniSK #and# GonzalezTF , title = {{P-Complete Approximation Problems }} , journal = j-acm , month = jul , number = 3 , pages = {555--565} , volume = 23 , year = 1976 } @InProceedings{sgg-mspfs-02 , author = SaroiuS #and# GummadiPK #and# GribbleSD , title = {{A Measurement Study of Peer-to-Peer File Sharing Systems}} , booktitle = {{Proceedings of SPIE/ACM Conference on Multimedia Computing and Networking (MMCN) 2002}} , month = jan , pdf = "http://www.cs.toronto.edu/~stefan/publications/mmcn/2002/mmcn.pdf" , year = 2002 } @misc{sgw-sdvac-07 , author = SchankT #and# GoerkeR #and# WagnerD , title = {{Static and Dynamic Visual Analysis of a Co-Author Network}} , note = {Graph Drawing Contest at GD'07, 2nd Prize} , pdf = "http://i11www.iti.uni-karlsruhe.de/people/schank/gd07cont/schank-gd07cont.pdf" , url = "http://i11www.iti.uni-karlsruhe.de/people/schank/gd07cont/" , year = 2007 } @Article{sh-scisg-91 , author = SierksmaG #and# HoogeveenH , title = {{Seven Criteria for Integer Sequences being Graphic}} , journal = j-jgt , number = 2 , pages = {223--231} , pdf = "http://www3.interscience.wiley.com/cgi-bin/fulltext/113389079/PDFSTART" , url = "http://dx.doi.org/10.1002/jgt.3190150209" , volume = 15 , year = 1991 } @InProceedings{shg-desam-09 , author = SatishN #and# HarrisM #and# GarlandM , title = {{Designing Efficient Sorting Algorithms for Manycore GPUs}} , booktitle = {{23rd International Parallel and Distributed Processing Symposium (IPDPS'09)}} , pages = {1--10} , publisher = pub-ics , year = 2009 } @techreport{shlw-cslpp-03 , author = SchoebelA #and# HamacherHW #and# LiebersA #and# WagnerD , title = {{The Continuous Stop Location Problem in Public Transportation Networks}} , institution = "Universit{\"a}t Konstanz" , year = 2003 } @Article{shlw-tcslp-09 , author = SchoebelA #and# HamacherHW #and# LiebersA #and# WagnerD , title = {{The Continuous Stop Location Problem in Public Transportation Networks}} , journal = j-apjor , month = feb , number = 1 , pages = {13--30} , volume = 26 , year = 2009 } @Article{shs-f-11 , author = SweetingWJ #and# HutchinsonAR #and# SavageSD , title = {{Factors affecting electric vehicle energy consumption}} , journal = j-ijse , number = 3 , pages = {192--201} , url = "http://dx.doi.org/10.1080/19397038.2011.592956" , volume = 4 , year = 2011 } @InCollection{skk-gphps-03 , author = SchloegelK #and# KarypisG #and# KumarV , title = {{Graph Partitioning for High-Performance Scientific Simulations}} , booktitle = {{Sourcebook of Parallel Computing}} , pages = {491--541} , publisher = pub-mk , year = 2003 } @Article{skk-p-02 , author = SchloegelK #and# KarypisG #and# KumarG , title = {{Parallel static and dynamic multi-constraint graph partitioning}} , journal = j-ccpe , number = 3 , pages = {219--240} , pdf = "http://glaros.dtc.umn.edu/gkhome/fetch/papers/pmcCCPE02.pdf" , volume = 14 , year = 2002 } @InProceedings{slah-eeore-11 , author = SachenbacherM #and# LeuckerM #and# ArtmeierA #and# HaselmayrJ , title = {{Efficient Energy-Optimal Routing for Electric Vehicles}} , booktitle = {{Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence}} , month = aug , publisher = pub-aaaip , url = "http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3735" , year = 2011 } @Book{sll-tbglu-02 , author = SiekJG #and# LeeL #and# LumsdaineA , title = {{The Boost Graph Library: User Guide and Reference Manual}} , booktitle = {{The Boost Graph Library: User Guide and Reference Manual}} , publisher = pub-aw , year = 2002 } @misc{slpf-ltais-03 , author = SchmochU #and# LavilleF #and# PatelP #and# FrietschR , title = {{Linking Technology Areas to Industrial Sectors}} , month = nov , note = {Final Report to the European Comission, DG Research} , pdf = "ftp://ftp.cordis.europa.eu/pub/indicators/docs/ind_report_isi_ost_spru.pdf" , url = "http://cordis.europa.eu/indicators/publications.htm" , year = 2003 } @Article{slzlc-t-03 , author = SunS #and# LingL #and# ZhangN #and# LiG #and# ChenR , title = {{Topological structure analysis of the protein-protein interaction network in budding yeast}} , journal = j-nar , number = 9 , pages = {2443--2450} , pdf = "http://www.imb-jena.de/jcb/ppi/PPI_PDF_free/bu2003.pdf" , url = "http://nar.oxfordjournals.org/cgi/content/abstract/31/9/2443" , volume = 31 , year = 2003 } @Book{sm-as-56 , editor = ShannonCE #and# McCarthyJ , title = {{Automata Studies}} , booktitle = {{Automata Studies}} , publisher = pub-pup , series = ser-ann_math_stud , year = 1956 } @InProceedings{sm-dagcu-06 , author = SahaB #and# MitraP , title = {{Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree}} , booktitle = {{Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops}} , month = dec , pages = {667--671} , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4063709" , year = 2006 } @InProceedings{sm-dagcu-07 , author = SahaB #and# MitraP , title = {{Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree}} , booktitle = {{Proceedings of the 2007 SIAM International Conference on Data Mining}} , pages = {581--586} , pdf = "http://www.siam.org/proceedings/datamining/2007/dm07_065Saha.pdf" , publisher = pub-siam , url = "http://www.siam.org/proceedings/datamining/2007/dm07.php" , year = 2007 } @Article{sm-ncis-00 , author = ShiJ #and# MalikJ , title = {{Normalized Cuts and Image Segmentation}} , journal = j-tpami , number = 8 , pages = {888--905} , pdf = "http://www.cs.virginia.edu/~gfx/Courses/2006/DataDriven/bib/matting/shi00.pdf" , url = "http://doi.ieeecs.org/10.1109/34.868688" , volume = 22 , year = 2000 } @Article{smobwrasi-casei-3 , author = ShannonP #and# MarkielA #and# OzierO #and# BaligaNS #and# WangJT #and# RamageD #and# AminN #and# SchwikowskiB #and# IdekerT , title = {{Cytoscape: A Software Environment for Integrated Models of Biomolecular Interaction Networks}} , journal = j-gb , pages = {2498--2504} , pdf = "http://genome.cshlp.org/cgi/reprint/13/11/2498.pdf" , url = "http://genome.cshlp.org/cgi/content/full/13/11/2498" , volume = 13 , year = 2003 } @InProceedings{smsn-dlcha-06 , author = SchaefferSE #and# MarinoniS #and# SarelaM #and# NikanderP , title = {{Dynamic Local Clustering for Hierarchical Ad Hoc Networks}} , booktitle = {{Proceedings of Sensor and Ad Hoc Communications and Networks, 2006. }} , month = sep , pages = {667--672} , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4068329" , volume = 2 , year = 2006 } @article{sn-epsb-97 , author = SnijdersTAB #and# NowickiK , title = {{Estimation and Prediction of Stochastic Blockmodels for Graphs with Latent Block Structure}} , journal = j-jc , pages = {75--100} , volume = 14 , year = 1997 } @misc{sonivis , author = sonivis , title = {{{SONIVIS} Tool Version 0.8}} , url = "http://www.sonivis.org/" , year = 2008 } @InProceedings{sp-p-01 , author = SlijepcevicS #and# PotkonjakM , title = {{Power efficient organization of wireless sensor networks}} , booktitle = {{Proceedings of the IEEE International Conference on Communications 2001}} , month = jun , pages = {472--476} , year = 2001 } @techreport{spb-fabp-97 , author = ScottK #and# PabonJimenezG #and# BernsteinD , title = {{Finding Alternatives to the Best Path}} , note = {Presented at the 76th Annual Meeting of the Transportation Research Board} , pages = {1--13} , year = 1997 } @Article{sr-cdtn-83 , author = SupowitKJ #and# ReingoldEM , title = {{The Complexity of Drawing Trees Nicely}} , journal = j-acta-inf , number = 4 , pages = {377--392} , volume = 18 , year = 1983 } @misc{sr-pn-97 , author = SearyAJ #and# RichardsWD , title = {{The Physics of Networks}} , url = "http://www.sfu.ca/~richards/Pdf-ZipFiles/physics.pdf" , year = 1997 } @Book{sr-vtp-34 , author = SteinitzE #and# RademacherH , title = {{Vorlesungen {\"u}ber die Theorie der Polyeder}} , booktitle = {{Vorlesungen {\"u}ber die Theorie der Polyeder}} , publisher = pub-springer , year = 1934 } @InProceedings{srs-aodsp-08 , author = ScheidelerC #and# RichaAW #and# SantiP , title = {{An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model}} , booktitle = {{Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'08)}} , pages = {91--100} , year = 2008 } @article{ss-cmcs-99 , author = SmartC #and# SlaterP , title = {{Center, Median and Centroid Subgraphs}} , journal = j-networks , pages = {303--311} , volume = 34 , year = 1999 } @unpublished{ss-dcfp-79 , author = SimFM #and# SchwartzMR , title = {{Does {CONCOR} Find Positions?}} , note = {Unpublished manuscript} , year = 1979 } @InProceedings{ss-degp-12 , author = SandersP #and# SchulzC , title = {{Distributed Evolutionary Graph Partitioning}} , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}} , pages = {16--29} , pdf = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/014.pdf" , publisher = pub-siam , year = 2012 } @InProceedings{ss-dhnr-07 , author = SchultesD #and# SandersP , title = {{Dynamic Highway-Node Routing}} , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}} , month = jun , pages = {66--79} , publisher = pub-springer , series = ser-springer_lncs , volume = 4525 , year = 2007 } @InProceedings{ss-efrpa-07 , author = SandersP #and# SchultesD , title = {{Engineering Fast Route Planning Algorithms}} , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}} , month = jun , pages = {23--36} , publisher = pub-springer , series = ser-springer_lncs , volume = 4525 , year = 2007 } @InProceedings{ss-ehh-06 , author = SandersP #and# SchultesD , title = {{Engineering Highway Hierarchies}} , booktitle = {{Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06)}} , pages = {804--816} , publisher = pub-springer , series = ser-springer_lncs , volume = 4168 , year = 2006 } @unpublished{ss-ehh-07 , author = SandersP #and# SchultesD , title = {{Engineering Highway Hierarchies}} , note = {submitted for publication, preliminary version at \url{http://algo2.iti.uka.de/schultes/hwy/}} , url = "http://algo2.iti.uka.de/schultes/hwy/" , year = 2007 } @Article{ss-ehh-12 , author = SandersP #and# SchultesD , title = {{Engineering Highway Hierarchies}} , journal = j-acm-ea , number = 1 , pages = {1--40} , volume = 17 , year = 2012 } @unpublished{ss-feosm-09 , author = SandersP #and# SchieferdeckerD , title = {{Finding Energy-Optimal Schedules for Monitoring Sensor Networks}} , year = 2009 } @InProceedings{ss-hhhes-05 , author = SandersP #and# SchultesD , title = {{Highway Hierarchies Hasten Exact Shortest Path Queries}} , booktitle = {{Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05)}} , pages = {568--579} , publisher = pub-springer , series = ser-springer_lncs , volume = 3669 , year = 2005 } @techreport{ss-ltate-09 , author = SchachtebeckM #and# SchoebelA , title = {{LinTim - A Toolbox for the Experimental Evaluation of the Interaction of Different Planning Stages in Public Transportation}} , institution = "ARRIVAL Project" , number = 0206 , year = 2009 } @book{ss-nt-73 , author = SneathPHA #and# SokalRR , title = {{Numerical Taxonomy: {The} Principles and Practice of Numerical Classification}} , publisher = pub-freeman , year = 1973 } @InProceedings{ss-racts-06 , author = SandersP #and# SchultesD , title = {{Robust, Almost Constant Time Shortest-Path Queries in Road Networks}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}} , month = nov , year = 2006 } @InCollection{ss-racts-09 , author = SandersP #and# SchultesD , title = {{Robust, Almost Constant Time Shortest-Path Queries in Road Networks}} , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}} , pages = {193--218} , publisher = pub-ams , series = ser-dimacsb , volume = 74 , year = 2009 } @Article{ss-rbd-10 , author = SankaranarayananJ #and# SametH , title = {{Roads Belong in Databases}} , journal = j-ieeedeb , number = 2 , pages = {4--11} , volume = 33 , year = 2010 } @Article{ss-tdmpd-10 , author = SchachtebeckM #and# SchoebelA , title = {{To wait or not to wait and who goes first? Delay Management with Priority Decisions}} , journal = j-ts , number = 3 , pages = {307--321} , volume = 44 , year = 2010 } @InProceedings{ss-tlagh-13 , author = SandersP #and# SchulzC , title = {{Think Locally, Act Globally: Highly Balanced Graph Partitioning}} , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}} , pages = {164--175} , publisher = pub-springer , series = ser-springer_lncs , volume = 7933 , year = 2013 } @Article{ssa-d-09 , author = SawardeckerEN #and# Sales-PardoM #and# AmaralLAN , title = {{Detection of node group membership in networks with group overlap}} , journal = j-epjb , pages = {277--284} , url = "http://dx.doi.org/10.1140/epjb/e2008-00418-0" , volume = 67 , year = 2009 } @InProceedings{ssa-posn-09 , author = SankaranarayananJ #and# SametH #and# AlborziH , title = {{Path Oracles for Spatial Networks}} , booktitle = {{Proceedings of the 35th International Conference on Very Large Databases (VLDB 2009)}} , pages = {1210--1221} , year = 2009 } @InProceedings{ssa-sndbs-08 , author = SametH #and# SankaranarayananJ #and# AlborziH , title = {{Scalable Network Distance Browsing in Spatial Databases}} , booktitle = {{Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD'08)}} , pages = {43--54} , publisher = pub-acm , year = 2008 } @InProceedings{ssk-aibav-08 , author = SchreckT #and# SchneidewindJ #and# KeimDA , title = {{An Image-Based Approach to Visual Feature Space Analysis}} , booktitle = {{Proceedings of the 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG'2008)}} , note = {to appear} , pdf = "http://infovis.uni-konstanz.de/papers/2008/wscg08som.pdf" , year = 2008 } @Book{sskz-iew-03 , editor = SzczepaniakPS #and# SegoviaJ #and# KacprzykJ #and# ZadehLA , title = {{Intelligent exploration of the web}} , address = "Heidelberg, Germany, Germany" , isbn = "3-7908-1529-2" , publisher = pub-physica , url = "http://portal.acm.org/citation.cfm?id=941713&coll=GUIDE&dl=&CFID=15151515&CFTOKEN=6184618#" , year = 2003 } @techreport{ssmgw-sdasc-12 , author = StaudtC #and# SchummA #and# MeyerhenkeH #and# GoerkeR #and# WagnerD , title = {{Static and Dynamic Aspects of Scientific Collaboration Networks}} , institution = kit_wagner , number = {2012-11 } , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000028493" , year = 2012 } @InProceedings{ssmgw-sdasc-asonam-12 , author = StaudtC #and# SchummA #and# MeyerhenkeH #and# GoerkeR #and# WagnerD , title = {{Static and Dynamic Aspects of Scientific Collaboration Networks}} , booktitle = {{Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining}} , pages = {522--526} , publisher = pub-ics , year = 2012 } @techreport{sssh-msien-07 , author = SnijdersTAB #and# SteglichCE #and# SchweinbergerM #and# HuismanM , title = {{Manual for {SIENA} Version 3.1}} , institution = "University of Groningen: ICS / Department of Sociology" , pdf = "http://stat.gamma.rug.nl/sie_man31.pdf" , year = 2007 } @InProceedings{sssv-becn-94 , author = ShahrokhiF #and# SykoraO #and# SzekelyLA #and# VrtoI , title = {{Book Embeddings and Crossing Numbers}} , booktitle = {{Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)}} , pages = {256--268} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/y06w57u47h515345/" , volume = 903 , year = 1994 } @InProceedings{sst-cgmp-02 , author = ShamirR #and# SharanR #and# TsurD , title = {{Cluster Graph Modification Problems}} , booktitle = {{Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02)}} , pages = {379--390} , pdf = "http://www.springerlink.com/content/43fhrcdqkp6c36bf/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/43fhrcdqkp6c36bf/" , volume = 2573 , year = 2002 } @InProceedings{sst-mfaue-03 , author = SellmannM #and# SensenN #and# TimajevL , title = {{Multicommodity Flow Approximation Used for Exact Graph Partitioning}} , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}} , pages = {752--764} , publisher = pub-springer , series = ser-springer_lncs , volume = 2832 , year = 2003 } @InProceedings{ssv-mrp-08 , author = SandersP #and# SchultesD #and# VetterC , title = {{Mobile Route Planning}} , booktitle = {{Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)}} , month = sep , pages = {732--743} , publisher = pub-springer , series = ser-springer_lncs , volume = 5193 , year = 2008 } @Article{st-a-90 , author = SatyanarayanaA #and# TungL , title = {{A characterization of partial 3-trees}} , journal = j-networks , number = 3 , pages = {299--322} , volume = 20 , year = 1990 } @InProceedings{st-afugc-04 , author = SixJM #and# TollisIG , title = {{A Framework for User-Grouped Circular Drawings}} , booktitle = {{Proceedings of the 11th International Symposium on Graph Drawing (GD'03)}} , month = jan , pages = {135--146} , publisher = pub-springer , series = ser-springer_lncs , volume = 2912 , year = 2004 } @InProceedings{st-cdbg-99 , author = SixJM #and# TollisIG , title = {{Circular Drawings of Biconnected Graphs}} , booktitle = {{Selected Papers from the 1st International Workshop on Algorithm Engineering and Experimentation (ALENEX'99)}} , pages = {57--73} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/4cnm5ck4m6eprygv/" , volume = 1619 , year = 1999 } @article{st-dsdt-83 , author = SleaterDD #and# TarjanRE , title = {{A data structure for dynamic trees}} , journal = j-css , month = jun , number = 3 , pages = {362--391} , volume = 26 , year = 1983 } @Article{st-gvlmn-02 , author = SilvaVd #and# TenenbaumJB , title = {{Global Versus Local Methods in Nonlinear Dimensionality Reduction}} , journal = j-nips , pages = {705--712} , pdf = "http://web.mit.edu/cocosci/Papers/nips02-localglobal-in-press.pdf" , volume = 15 , year = 2002 } @article{st-oggvecmd-03 , author = SinghM #and# TripathiA , title = {{Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree}} , journal = j-endima , month = oct , volume = 15 , year = 2003 } @InProceedings{st-spwpg-96 , author = SpielmanDA #and# TengS , title = {{Spectral Partitioning Works: Planar Graphs and Finite Element Meshes}} , booktitle = {{Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS'96)}} , month = oct , pages = {96--106} , year = 1996 } @misc{staralliance , author = staralliance , title = {{\url{http://www.staralliance.com}}} , year = 1997 } @Article{stt-mvuhs-81 , author = SugiyamaK #and# TagawaS #and# TodaM , title = {{Methods for Visual Understanding of Hierarchical System Structures}} , journal = j-ieeetsmc , number = 2 , pages = {109--125} , url = "http://dx.doi.org/10.1109/TSMC.1981.4308636" , volume = {SMC-11} , year = 1981 } @Article{suf-a-00 , author = SchwikowskiB #and# UetzP #and# FieldsS , title = {{A network of protein-protein interactions in yeast}} , journal = j-nb , pages = {1257--1261} , pdf = "http://www.nature.com/nbt/journal/v18/n12/pdf/nbt1200_1257.pdf" , url = "http://www.nature.com/nbt/journal/v18/n12/abs/nbt1200_1257.html" , volume = 18 , year = 2000 } @Article{sv-speg-86 , author = SedgewickR #and# VitterJS , title = {{Shortest Paths in Euclidean Graphs}} , journal = j-alg , number = 1 , pages = {31--48} , volume = 1 , year = 1986 } @techreport{sv-swpt-03 , author = SlutzkiG #and# VolijO , title = {{Scoring of Web pages and tournaments -- axiomatizations}} , address = "Ames, USA" , institution = "Iowa State University" , month = {Feb} , year = 2003 } @InProceedings{svgwsm-aaiip-10 , author = SchmidJ #and# VolkerM #and# GaedekeT #and# WeberP #and# StorkW #and# MullerGlaserKD , title = {{An Approach to Infrastructure-Independent Person Localization with an IEEE 802.15.4 WSN}} , booktitle = {{Proceedings of the 2010 International Conference on Indoor Positioning and Indoor Navigation (IPIN'10)}} , pages = {906--914} , pdf = "http://i11www.ira.uka.de/extra/publications/svgwsm-aaiip-10.pdf" , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?tp=&arnumber=5646831&tag=1" , year = 2010 } @InProceedings{svw-eaddh-11 , author = SchieferdeckerD #and# VolkerM #and# WagnerD , title = {{Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks}} , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}} , pages = {388--399} , pdf = "http://i11www.ira.uka.de/extra/publications/svw-eaddh-11.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/1828g7262223654n" , volume = 6630 , year = 2011 } @techreport{svw-eaddh2-11 , author = SchieferdeckerD #and# VolkerM #and# WagnerD , title = {{Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks}} , institution = "Karlsruhe Institute of Technology" , number = {2011-8} , pdf = "http://i11www.ira.uka.de/extra/publications/svw-eaddh2-11.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022438" , year = 2011 } @techreport{sw-acct-04 , author = SchankT #and# WagnerD , title = {{Approximating Clustering-Coefficient and Transitivity}} , institution = iti_wagner , number = {2004-9} , url = "http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=ira/2004/9" , year = 2004 } @Article{sw-acct-05 , author = SchankT #and# WagnerD , title = {{Approximating Clustering Coefficient and Transitivity}} , journal = j-jgaa , number = 2 , pages = {265--275} , pdf = "http://www.emis.ams.org/journals/JGAA/accepted/2005/SchankWagner2005.9.2.pdf" , url = "http://www.emis.ams.org/journals/JGAA/volume09.html" , volume = 9 , year = 2005 } @proceedings{sw-ae-13 , editor = SandersP #and# WagnerD , title = {{Algorithm Engineering}} , note = {in print} , number = 2 , publisher = pub-springer , series = ser-is , volume = 36 , year = 2013 } @InProceedings{sw-caeis-04 , author = SagieG #and# WoolA , title = {{A Clustering Approach for Exploring the {I}nternet Structure}} , booktitle = {{Proceedings of the 23rd IEEE Convention of Electrical and Electronics Engineers in Israel}} , pages = {149--152} , pdf = "http://www.eng.tau.ac.il/~yash/ieeei04-clustering.pdf" , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1361111" , year = 2004 } @Article{sw-epmii-96 , author = SchikarskiA #and# WagnerD , title = {{Efficient Parallel Matrix Inversion on Interconnection Networks}} , journal = j-pdc , number = 2 , pages = {196--201} , volume = 34 , year = 1996 } @InProceedings{sw-fcltl-05 , author = SchankT #and# WagnerD , title = {{Finding, Counting and Listing all Triangles in Large Graphs, an Experimental Study}} , booktitle = {{Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)}} , pages = {606--609} , pdf = "http://www.springerlink.com/content/rgfr3df7k1rr3cvb/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/rgfr3df7k1rr3cvb/" , volume = 3503 , year = 2005 } @inproceedings{sw-fdssp-98 , author = SrivastavA #and# WolfK , title = {{Finding dense subgraphs with semidefinite programming}} , booktitle = {{Proceedings of the 1st International Workshop on Approximatin Algorithms for Combinatorial Optimizat}} , pages = {181--191} , publisher = pub-springer , series = ser-springer_lncs , volume = 1444 , year = 1998 } @article{sw-grrgq-99 , author = StegerA #and# WormaldNC , title = {{Generating random regular graphs quickly}} , journal = j-cpc , pages = {377--396} , volume = 8 , year = 1999 } @Book{sw-ppsa-05 , editor = SteinmetzR #and# WehrleK , title = {{Peer-to-Peer Systems and Applications}} , booktitle = {{Peer-to-Peer Systems and Applications}} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/g6h805426g7t/" , volume = 3485 , year = 2005 } @article{sw-smca-97 , author = StoerM #and# WagnerF , title = {{A Simple Min-Cut Algorithm}} , journal = j-acm , month = jul , number = 4 , pages = {585--591} , volume = 44 , year = 1997 } @Article{swc-acesm-04 , author = SoperAJ #and# WalshawC #and# CrossM , title = {{A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph Partitioning}} , journal = j-jgo , number = 2 , pages = {225--241} , pdf = "http://staffweb.cms.gre.ac.uk/~c.walshaw/papers/fulltext/SoperJoGO04.pdf" , url = "http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/#SoperJoGO04" , volume = 29 , year = 2004 } @misc{swc-tgpa-04 , author = SoperAJ #and# WalshawC #and# CrossM , title = {{The Graph Partitioning Archive}} , institution = "University of Greenwich, London, UK" , note = {\url{http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/}} , url = "http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/" , year = 2004 } @Article{sww-daola-00 , author = SchulzF #and# WagnerD #and# WeiheK , title = {{Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport}} , journal = j-acm-ea , number = 12 , pages = {1--23} , volume = 5 , year = 2000 } @InProceedings{sww-daola-99 , author = SchulzF #and# WagnerD #and# WeiheK , title = {{Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport}} , booktitle = {{Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE'99)}} , pages = {110--123} , publisher = pub-springer , series = ser-springer_lncs , url = "http://portal.acm.org/citation.cfm?id=720630" , volume = 1668 , year = 1999 } @Article{swww-wkkla-94 , author = SarrafzadehM #and# WagnerD #and# WagnerF #and# WeiheK , title = {{Wiring Knock-Knee Layouts: A Global Approach}} , journal = j-tc , month = may , number = 5 , pages = {581--489} , pdf = "http://ieeexplore.ieee.org/iel1/12/6965/00280805.pdf" , url = "http://ieeexplore.ieee.org/iel1/12/6965/6965.html" , volume = 43 , year = 1994 } @InProceedings{swww-wkklg-92 , author = SarrafzadehM #and# WagnerD #and# WagnerF #and# WeiheK , title = {{Wiring knock-knee layouts: a global approach}} , booktitle = {{Proceedings of the 3rd International Symposium on Algorithms and Computation (ISAAC'92)}} , pages = {388--399} , publisher = pub-springer , series = ser-springer_lncs , volume = 650 , year = 1992 } @InProceedings{swz-umlgt-02 , author = SchulzF #and# WagnerD #and# ZaroliagisC , title = {{Using Multi-Level Graphs for Timetable Information in Railway Systems}} , booktitle = {{Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)}} , pages = {43--59} , pdf = "http://i11www.iti.uni-karlsruhe.de/extra/publications/swz-umlgt-02.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 2409 , year = 2002 } @InProceedings{sxzf-lmcmd-07 , author = SunJ #and# XieY #and# ZhangHui #and# FaloutsosC , title = {{Less is More: Compact Matrix Decomposition for Large Sparse Graphs}} , booktitle = {{Proceedings of the seventh SIAM International Conference on Data Mining}} , pages = {366--377} , pdf = "http://www.siam.org/proceedings/datamining/2007/dm07_033Sun.pdf" , publisher = pub-siam , url = "http://www.siam.org/proceedings/datamining/2007/dm07.php" , year = 2007 } @InProceedings{sypf-gspfm-07 , author = SunJ #and# YuPS #and# PapadimitriouS #and# FaloutsosC , title = {{GraphScope: Parameter-Free Mining of Large Time-Evolving Graphs}} , booktitle = {{Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}} , pages = {687--696} , pdf = "http://www.cs.cmu.edu/~spapadim/pdf/gscope_kdd07.pdf" , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=1281192.1281266&coll=Portal&dl=GUIDE&CFID=54298929&CFTOKEN=41087406" , year = 2007 } @Article{sz-npcop-10 , author = SadasivamS #and# ZhangHu , title = {{NP-Completeness of $st$-Orientations for Plane Graphs}} , journal = j-tcs , number = {7--9} , pages = {995--1003} , volume = 411 , year = 2010 } @article{sz-rc-89 , author = StephensonKA #and# ZelenM , title = {{Rethinking Centrality: Methods and Examples}} , journal = j-sn , pages = {1--37} , volume = 11 , year = 1989 } %% -------------------------------------------------------------- @Article{t-arkt-84 , author = ThomassenC , title = {{A Refinement of Kuratowski's Theorem}} , journal = j-jcombthb , number = 37 , pages = {245--253} , year = 1984 } @article{t-ccug-85 , author = TruszczynskiM , title = {{Centers and Centroids of unicyclic graphs}} , journal = j-ms , pages = {223--228} , volume = 35 , year = 1985 } @book{t-cg-66 , author = TutteWT , title = {{Connectivity in graphs}} , number = 15 , publisher = pub-utp , series = ser-utp_me , year = 1966 } @InProceedings{t-corad-01 , author = ThorupM , title = {{Compact Oracles for Reachability and Approximate Distances in Planar Digraphs}} , booktitle = {{Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'01)}} , pages = {242--251} , publisher = pub-ieeecs , year = 2001 } @Article{t-corad-04 , author = ThorupM , title = {{Compact Oracles for Reachability and Approximate Distances in Planar Digraphs }} , journal = j-acm , number = 6 , pages = {993--1024} , volume = 51 , year = 2004 } @Article{t-crg-60 , author = TutteWT , title = {{Convex Representations of Graphs}} , journal = j-plms , pages = {304--320} , volume = 10 , year = 1960 } @Article{t-dfslg-72 , author = TarjanRE , title = {{Depth-first search and linear graph algorithms}} , journal = j-sicomp , month = jun , number = 2 , pages = {146--160} , url = "http://siamdl.aip.org/dbt/dbt.jsp?KEY=SMJCAT&Volume=1&Issue=2" , volume = 1 , year = 1972 } @Book{t-dsna-83 , author = TarjanR , title = {{Data Structures and Network Algorithms}} , booktitle = {{Data Structures and Network Algorithms}} , publisher = pub-siam , year = 1983 } @Article{t-eggmn-87 , author = TamassiaR , title = {{On Embedding a Graph in the Grid with the Minimum Number of Bends}} , journal = j-sicomp , number = 3 , pages = {421--444} , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SMJCAT000016000003000421000001" , url = "http://dx.doi.org/10.1137/0216030" , volume = 16 , year = 1987 } @Book{t-ei-90 , author = TufteE , title = {{Envisioning Information}} , booktitle = {{Envisioning Information}} , publisher = pub-gp , year = 1990 } @article{t-epgt-41 , author = TuranP , title = {{On an extremal problem in graph theory}} , journal = j-mfl , pages = {436--452} , volume = 48 , year = 1941 } @inproceedings{t-fdapsp-04 , author = ThorupM , title = {{Fully Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles}} , booktitle = proc-swat-04 , pages = {384--396} , publisher = pub-springer , series = ser-springer_lncs , volume = 3111 , year = 2004 } @InProceedings{t-fdmc-01 , author = ThorupM , title = {{Fully-Dynamic Min-Cut}} , booktitle = {{Proceedings of the 33rd Annual {ACM} Symposium on the Theory of Computing (STOC'01)}} , month = jul , pages = {224--230} , url = "http://portal.acm.org/citation.cfm?id=380804" , year = 2001 } @techreport{t-fmc-72 , author = TarjanRE , title = {{Finding a maximum clique}} , institution = "Department of Computer Science, Cornell University, Ithaca, NY" , number = {72-123} , year = 1972 } @Article{t-hdg-63 , author = TutteWT , title = {{How to Draw a Graph}} , journal = j-plms , number = 1 , pages = {743--767} , pdf = "http://plms.oxfordjournals.org/cgi/reprint/s3-13/1/743.pdf" , url = "http://plms.oxfordjournals.org/cgi/reprint/s3-13/1/743" , volume = {s3-13} , year = 1963 } @Book{t-hgdv-13 , editor = TamassiaR , title = {{Handbook of Graph Drawing and Visualization }} , booktitle = {{Handbook of Graph Drawing and Visualization }} , note = {to appear} , publisher = pub-crcp , year = 2013 } @InProceedings{t-ipqdk-03 , author = ThorupM , title = {{Integer Priority Queues with Decrease Key in Constant Time and the Single Source Shortest Paths Problem}} , booktitle = {{Proceedings of the 35th Annual {ACM} Symposium on the Theory of Computing (STOC'03)}} , month = jun , pages = {149--158} , year = 2003 } @Article{t-ipqdk-04 , author = ThorupM , title = {{Integer Priority Queues with Decrease Key in Constant Time and the Single Source Shortest Paths Problem}} , journal = j-css , number = 3 , pages = {330--353} , volume = 69 , year = 2004 } @Article{t-irpg-86 , author = ThomassenC , title = {{Interval Representation of Planar Graphs}} , journal = j-jcombthb , month = feb , number = 1 , pages = {9--20} , volume = 40 , year = 1986 } @InProceedings{t-jigle-98 , author = TunkelangD , title = {{JIGGLE: Java Interactive Graph Layout Environment}} , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}} , location = "Montreal, Canada" , month = jan , pages = {413--422} , pdf = "http://www.springerlink.com/content/edqjm95w63e7lart/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/edqjm95w63e7lart/" , volume = 1547 , year = 1999 } @Article{t-kt-81 , author = ThomassenC , title = {{Kuratowski's Theorem}} , journal = j-jgt , number = 3 , pages = {225--241} , volume = 5 , year = 1981 } @Article{t-mdstm-52 , author = TorgersonWS , title = {{Multidimensional Scaling: I. Theory and Method}} , journal = j-psy , month = dec , number = 4 , pages = {401--419} , url = "http://www.springerlink.com/content/86u3178hvh181k57/" , volume = 17 , year = 1952 } @article{t-ndnrm-76 , author = TainiterM , title = {{A New Deterministic Network Reliability Measure}} , journal = j-networks , number = 3 , pages = {191--204} , volume = 6 , year = 1976 } @article{t-nfbg-74 , author = TarjanRE , title = {{A Note on Finding the Bridges of a Graph}} , journal = j-ipl , month = apr , number = 6 , pages = {160--161} , volume = 2 , year = 1974 } @phdthesis{t-noagd-99 , author = TunkelangD , title = {{A Numerical Optimization Approach to General Graph Drawing}} , institution = "Carnegie-Mellon University Pittsburgh" , month = jan , pdf = "http://reports-archive.adm.cs.cmu.edu/anon/1998/CMU-CS-98-189.pdf" , url = "http://reports-archive.adm.cs.cmu.edu/anon/1998/abstracts/98-189.html" , year = 1999 } @article{t-ogrggpkd-79 , author = TinhoferG , title = {{On the generation of random graphs with given properties and known distribution}} , journal = "Appl. Comput. S" , pages = {265--296} , volume = 13 , year = 1979 } @Article{t-pdfig-80 , author = ThomassenC , title = {{Planarity and Duality of Finite and Infinite Graphs.}} , journal = j-jcombthb , month = oct , number = 2 , pages = {244--271} , volume = 29 , year = 1980 } @InCollection{t-prg-84 , author = ThomassenC , title = {{Plane Representations of Graphs}} , booktitle = {{Progress in Graph Theory}} , pages = {43--69} , publisher = pub-ap , year = 1984 } @misc{t-rales-04 , author = TeamRD , title = {{R: A Language and Environment for Statistical Computing}} , url = "http://www.r-project.org" , year = 2004 } @article{t-rampq-00 , author = ThorupM , title = {{On RAM Priority Queues}} , journal = j-sicomp , number = 1 , pages = {86--109} , volume = 30 , year = 2000 } @inproceedings{t-rampq-96 , author = ThorupM , title = {{On RAM Priority Queues}} , booktitle = proc-soda-96 , pages = {59--67} , year = 1996 } @phdthesis{t-rmlw-95 , author = TheuneD , title = {{Robuste und effiziente Methoden zur L{\"o}sung von Wegproblemen}} , school = "Universit{\"a}t Paderborn" , year = 1995 } @Book{t-rpc-69 , editor = TutteWT , title = {{Recent Progresses in Combinatorics}} , booktitle = {{Recent Progresses in Combinatorics}} , publisher = pub-ap , year = 1969 } @article{t-stc-75 , author = TainiterM , title = {{Statistical Theory of Connectivity~I: Basic Definitions and Properties}} , journal = j-dima , number = 4 , pages = {391--398} , volume = 13 , year = 1975 } @Article{t-t3cg-61 , author = TutteWT , title = {{A Theory of 3-Connected Graphs}} , journal = j-indmath , pages = {441--455} , volume = 23 , year = 1961 } @misc{t-tgttm-02 , author = ThurstonWP , title = {{The Geometry and Topology of Three-Manifolds}} , month = mar , school = "Princeton University" , url = "http://www.msri.org/publications/books/gt3m/" , year = 2002 } @Article{t-tjstc-92 , author = ThomassenC , title = {{The Jordan-Sch{\"o}nfliess Theorem and the Classification of Sufaces}} , journal = j-amm , month = feb , pages = {116--130} , volume = 99 , year = 1992 } @Book{t-tlr-54 , author = TolkienJR , title = {{The Lord of the Rings}} , booktitle = {{The Lord of the Rings}} , note = {In three volumes} , publisher = pub-gau , year = 1954 } @Article{t-tsdfs-86 , author = TarjanRE , title = {{Two Streamlined Depth-First Search Algorithms}} , journal = j-fi , pages = {85--94} , volume = 9 , year = 1986 } @Article{t-tst-04 , author = ThomassenC , title = {{Tutte's Spring Theorem}} , journal = j-jgt , number = 4 , pages = {275--280} , volume = 45 , year = 2004 } @Book{t-tvdqi-07 , author = TufteE , title = {{The Visual Display of Quantitative Information.}} , booktitle = {{The Visual Display of Quantitative Information.}} , publisher = pub-gp , volume = {2nd ed.} , year = 2007 } @article{t-usssppiwlt-99 , author = ThorupM , title = {{Undirected Single Source Shortest Paths with Positive Integer Weights in Linear Time}} , journal = j-acm , number = 3 , pages = {362--394} , volume = 46 , year = 1999 } @InProceedings{tcl-csvda-98 , author = ThomasianA #and# CastelliV #and# LiC , title = {{Clustering and Singular Value Decomposition for Approximate Indexing in High Dimensional Spaces}} , booktitle = {{Proceedings of the 7th International Conference on Information and Knowledge Management}} , pages = {201--207} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/288627.288658" , year = 1998 } @techreport{tgjsw-ntplh-01 , author = TangmunarunkitH #and# GovindanR #and# JaminS #and# ShenkerSJ #and# WillingerW , title = {{Network Topologies, Power Laws, and Hierarchy}} , institution = "Computer Science Department, University of Southern California" , number = {01-746} , type = {Technical Report} , url = "http://citeseer.nj.nec.com/tangmunarunkit01network.html" , year = 2001 } @article{tgjsw-ntplh-02 , author = TangmunarunkitH #and# GovindanR #and# JaminS #and# ShenkerSJ #and# WillingerW , title = {{Network Topologies, Power Laws, and Hierarchy}} , journal = j-acm-ccr , number = 1 , pages = 76 , volume = 32 , year = 2002 } @article{tias-nagamis-77 , author = TsukiyamaS #and# IdeM #and# AriyoshiH #and# ShirakawaI , title = {{A new algorithm for generating all the maximal independent sets}} , journal = j-sicomp , number = 3 , pages = {505--517} , volume = 6 , year = 1977 } @misc{tiger , title = {{\url{http://www.census.gov/geo/www/tiger/}}} , publisher = pub-usdc , year = 2010 } @InProceedings{tk-eewcs-03 , author = ToyodaM #and# KitsuregawaM , title = {{Extracting Evolution of Web Communities from a Series of Web Archives}} , booktitle = {{Proceedings of the 14th ACM Conference on Hypertext and Hypermedia}} , pages = {28--37} , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=900059" , year = 2003 } @Article{tl-ampop-92 , author = TungTungC #and# LinChewK , title = {{A Multicriteria Pareto-Optimal Path Algorithm}} , journal = j-ejor , number = 2 , pages = {203--209} , volume = 62 , year = 1992 } @article{tl-fafedb-83 , author = TongP #and# LawlerEL , title = {{A Faster Algorithm for Finding Edge-Disjoint Branchings}} , journal = j-ipl , month = aug , number = 2 , pages = {73--76} , volume = 17 , year = 1983 } @InProceedings{trhlh-cvx-12 , author = TielertT #and# RiegerD #and# HartensteinH #and# LuzR #and# HausbergerS , title = {{Can V2X communication help electric vehicles save energy?}} , booktitle = {{12th International Conference on ITS Telecommunications}} , month = nov , pages = {232--237} , publisher = pub-ieee , url = "http://dx.doi.org/10.1109/ITST.2012.6425172" , year = 2012 } @Book{ts-gta-92 , author = ThulasiramanK #and# SwamyMNS , title = {{Graphs: Theory and Algorithms}} , booktitle = {{Graphs: Theory and Algorithms}} , publisher = pub-wiley , year = 1992 } @Book{tsk-idm-06 , author = TanP #and# SteinbachM #and# KumarV , title = {{Introduction to Data Mining}} , booktitle = {{Introduction to Data Mining}} , publisher = pub-aw , url = "http://www.pearsonhighered.com/educator/academic/product/0,1144,0321321367,00.html" , year = 2006 } @Article{tt-auavr-86 , author = TamassiaR #and# TollisIG , title = {{A Unified Approach to Visibility Representations of Planar Graphs}} , journal = dcg , pages = {321--341} , volume = 1 , year = 1986 } @article{tt-fmis-77 , author = TarjanRE #and# TrojanowskiAE , title = {{Finding a maximum independent set}} , journal = j-sicomp , number = 3 , pages = {537-546} , volume = 6 , year = 1977 } @Article{ttiw-pcads-07 , author = TaokaS #and# TakafujiD #and# IguchiT #and# WatanabeT , title = {{Performance Comparison of Algorithms for the Dynamic Shortest Path Problem}} , journal = j-ieicetfeccs , month = apr , number = 4 , volume = {E90-A} , year = 2007 } @Book{tv-tvrp-01 , editor = TothP #and# VigoD , title = {{The Vehicle Routing Problem}} , booktitle = {{The Vehicle Routing Problem}} , publisher = pub-siam , year = 2001 } @InProceedings{tw-stbds-07 , author = TurauV #and# WeyerC , title = {{Scheduling Transmission of Bulk Data in Sensor Networks Using a Dynamic TDMA Protocol}} , booktitle = {{8th International Conference on Mobile Data Management (MDM 2007)}} , pages = {321--325} , publisher = pub-ieeecs , url = "http://dx.doi.org/10.1109/MDM.2007.68" , year = 2007 } @InProceedings{tw-tdmas-07 , author = TurauV #and# WeyerC , title = {{TDMA-Schemes for Tree-Routing in Data Intensive Wireless Sensor Networks}} , booktitle = {{Proc. First Int. Workshop on Protocols and Algorithms for Reliable and Data Intensive Sensor Networks (PARIS)}} , pages = {1--6} , publisher = pub-ieeecs , url = "10.1109/MOBHOC.2007.4428749" , year = 2007 } @Article{ty-s-84 , author = TarjanR #and# YannakakisM , title = {{Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs}} , journal = j-sicomp , month = aug , number = 3 , pages = {566--579} , volume = 13 , year = 1984 } @Article{tz-ado-05 , author = ThorupM #and# ZwickU , title = {{Approximate Distance Oracles}} , journal = j-acm , number = 1 , pages = {1--24} , volume = 52 , year = 2005 } %% -------------------------------------------------------------- @techreport{u-gcti-08 , author = UngererT , title = {{Grand Challenges der Technischen Informatik}} , institution = "Informationstechnische Gesellschaft im VDE (ITG) und Gesellschaft f{\"u}r Informatik (GI)" , url = "http://www.gi-ev.de/gliederungen/fachbereiche/technische-informatik-ti/fa-arcs/" , year = 2008 } @misc{ucinet , author = AnalyticTech , title = {{{UCINET} 6 - Social Network Analysis Software}} , url = "http://www.analytictech.com/ucinet/" , year = 2008 } %% -------------------------------------------------------------- @Book{v-aa-03 , author = VaziraniVV , title = {{Approximation Algorithms}} , booktitle = {{Approximation Algorithms}} , publisher = pub-springer , year = 2003 } @phdthesis{v-aaclw-12 , author = VolkerM , title = {{Algorithmic Aspects of Communication and Localization in Wireless Sensor Networks}} , month = may , pdf = "http://i11www.ira.uka.de/extra/publications/v-aaclw-12.pdf" , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie (KIT)" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000028910" , year = 2012 } @Article{v-agagc-91 , author = VaidyaPM , title = {{A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions}} , journal = dcg , number = 4 , pages = {369--381} , volume = 6 , year = 1991 } @article{v-ccp-79 , author = ValiantLG , title = {{The complexity of computing the permanent}} , journal = j-tcs , pages = {189--201} , volume = 8 , year = 1979 } @article{v-ccsrpg-01 , author = VadhanSP , title = {{The complexity of counting in sparse, regular, and planar graphs}} , journal = j-sicomp , number = 2 , pages = {398--427} , volume = 31 , year = 2001 } @article{v-cerp-79 , author = ValiantLG , title = {{The complexity of enumeration and reliability problems}} , journal = j-sicomp , number = 3 , pages = {410--421} , volume = 8 , year = 1979 } @mastersthesis{v-femno-10 , author = VetterC , title = {{Fast and Exact Mobile Navigation with OpenStreetMap Data}} , school = "Karlsruhe Institute of Technology" , year = 2010 } @Article{v-gp-03 , author = VazquezA , title = {{Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations}} , journal = j-pr-e , month = may , pages = 056104 , url = "http://link.aps.org/doi/10.1103/PhysRevE.67.056104" , volume = 67 , year = 2003 } @InProceedings{v-npwgh-08 , author = VassilevskaV , title = {{Nondecreasing Paths in a Weighted Graph or: How to Optimally Read a Train Schedule}} , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}} , pages = {465--472} , pdf = "http://www.cs.cmu.edu/~virgi/nondecpaths.pdf" , year = 2008 } @techreport{v-ptdch-09 , author = VetterC , title = {{Parallel Time-Dependent Contraction Hierarchies}} , institution = "Karlsruhe Institute of Technology" , note = {\url{http://algo2.iti.kit.edu/download/vetter_sa.pdf}} , year = 2009 } @misc{v-rprnt-08 , author = VolkerL , title = {{Route Planning in Road Networks with Turn Costs}} , note = {Student Research Project. \url{http://algo2.iti.uni-karlsruhe.de/documents/routeplanning/volker_sa.pdf}} , school = inf_ka , year = 2008 } @mastersthesis{v-stcws-08 , author = VolkerM , title = {{Scheduling and Topology Control in Wireless Sensor Networks}} , month = oct , pdf = "http://i11www.ira.uka.de/extra/publications/v-stcws-08.pdf" , school = "Universit{\"a}t Karlsruhe" , year = 2008 } @Book{v-ta-08 , editor = VockingB #and# AltH #and# DietzfelbingerM #and# ReischukR #and# ScheidelerC #and# VollmerH #and# WagnerD , title = {{Taschenbuch der Algorithmen}} , booktitle = {{Taschenbuch der Algorithmen}} , publisher = pub-springer , url = "http://www-i1.informatik.rwth-aachen.de/~algorithmus/" , year = 2008 } @InProceedings{v-zbg-05 , author = VolkerM , title = {{Zeichnen von Begrenzungen ungenau definierter Gebiete}} , booktitle = {{Informatiktage 2005. Fachwissenschaftlicher Informatik-Kongress, 8. und 9. April 2005, Schloss Birlinghoven, Sankt Augustin}} , pages = {105--108} , series = ser-gielnilni , url = "http://subs.emis.de/LNI/Seminar/Seminar2.html" , volume = {S-2} , year = 2005 } @Book{vadrsvw-au-11 , editor = VockingB #and# AltH #and# DietzfelbingerM #and# ReischukR #and# ScheidelerC #and# VollmerH #and# WagnerD , title = {{Algorithms Unplugged}} , booktitle = {{Algorithms Unplugged}} , note = {http://www-i1.informatik.rwth-aachen.de/~algorithmus/} , publisher = pub-springer , url = "http://www.springer.com/mathematics/book/978-3-642-15327-3" , year = 2011 } @Article{vc-oucrf-71 , author = VapnikVN #and# ChervonenkisAY , title = {{On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities}} , journal = j-tpa , number = 2 , pages = {264--280} , pdf = "http://att.zju88.org/files/186216.1fd279f6.pdf" , volume = 16 , year = 1971 } @article{vf-ir-98 , author = ValenteTW #and# ForemanRK , title = {{Integration and radiality: measuring the extent of an individual's connectedness and reachability in a network}} , journal = j-sn , pages = {89--105} , volume = 1 , year = 1998 } @InProceedings{vhe-ssitg-02 , author = VukadinovicD #and# HuangP #and# ErlebachT , title = {{On the Spectrum and Structure of Internet Topology Graphs}} , booktitle = {{Proceedings of the 2nd International Workshop on Innovative Internet Computing Systems}} , month = aug , pages = {83--95} , pdf = "http://www.springerlink.com/content/ty8n1r9k6xf81vwl/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/ty8n1r9k6xf81vwl/" , volume = 2346 , year = 2002 } @techreport{vkw-ocspc-09 , author = VolkerM #and# KatzB #and# WagnerD , title = {{On the Complexity of Scheduling with Power Control in Geometric SINR}} , institution = iti_wagner , number = {2009-15} , pdf = "http://i11www.iti.uni-karlsruhe.de/extra/publications/vkw-ocspc-09.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000012389" , year = 2009 } @Article{vkz-diepq-77 , author = VanEmdeBoasP #and# KaasR #and# ZijlstraE , title = {{Design and Implementation of an Efficient Priority Queue}} , journal = j-mst , pages = {99--127} , volume = 10 , year = 1977 } @InProceedings{vl-esgrs-05 , author = VigerF #and# LatapyM , title = {{Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence}} , booktitle = {{Proceedings of the 11th Annual International Conference on Computing Combinatorics (COCOON'05)}} , pages = {440--449} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/0g56uq72lx8tn687/" , year = 2005 } @techreport{vm-csca-03 , author = VermaD #and# MeilaM , title = {{A Comparison of Spectral Clustering Algorithms}} , institution = "University of Washington CSE Technical report" , number = {03-05-01} , url = "http://www.stat.washington.edu/mmp/" , year = 2003 } @InProceedings{vnd-ppcso-06 , author = VazirgiannisM #and# NorvaagK #and# DoulkeridisC , title = {{Peer-to-Peer Clustering for Semantic Overlay Network Generation}} , booktitle = {{Proceedings of the 6th International Workshop on Pattern Recognition in Information Systems (PRIS 2006)}} , year = 2006 } @InProceedings{vs-f-91 , author = VaziraniVV #and# SaranH , title = {{Finding k-cuts within twice the optimal}} , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}} , month = oct , pages = {743--751} , url = "http://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185443" , year = 1991 } @InProceedings{vsgmw-fdtwn-12 , author = VolkerM #and# SchmidJ #and# GaedekeT #and# MullerGlaserKD #and# WagnerD , title = {{Force-Directed Tracking in Wireless Networks using Signal Strength and Step Recognition}} , booktitle = {{Proceedings of the International Conference on Localization and GNSS (ICL-GNSS '12)}} , pages = {1--8} , pdf = "http://i11www.ira.uka.de/extra/publications/vsgmw-fdtwn-12.pdf" , publisher = pub-ics , url = "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6253126" , year = 2012 } @Article{vtl-trspd-82 , author = ValdesJ #and# TarjanRE #and# LawlerEL , title = {{The Recognition of Series Parallel Digraphs}} , journal = j-sicomp , number = 2 , pages = {298--313} , volume = 11 , year = 1982 } %% -------------------------------------------------------------- @Book{w-aee-06 , author = WankaR , title = {{Approximationsalgorithmen: Eine Einf{\"u}hrung}} , booktitle = {{Approximationsalgorithmen: Eine Einf{\"u}hrung}} , publisher = pub-t , series = ser-li , year = 2006 } @InProceedings{w-aerpa-11 , author = WagnerD , title = {{Algorithm Engineering for Route Planning -- An Update --}} , booktitle = {{Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11)}} , pages = {1--5} , publisher = pub-springer , series = ser-springer_lncs , volume = 7074 , year = 2011 } @Article{w-ah-64 , author = WilliamsJ , title = {{Algorithm 232: Heapsort}} , journal = j-acm , month = jun , number = 6 , pages = {347--348} , volume = 7 , year = 1964 } @InProceedings{w-amro-07 , author = WagnerD , title = {{Algorithms and Models for Railway Optimization}} , booktitle = {{Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'03)}} , note = {Invited Talk} , pages = {198--206} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.de/openurl.asp?genre=article&issn=0302-9743&volume=2748&spage=198" , volume = 2748 , year = 2003 } @Article{w-apomo-87 , author = WarburtonA , title = {{Approximation of Pareto Optima in Multiple-Objective Shortest-Path Problems}} , journal = j-or , number = 1 , pages = {70--79} , volume = 35 , year = 1987 } @Article{w-astig-33 , author = WhitneyH , title = {{A Set of Topological Invariants for Graphs}} , journal = j-ajm , pages = {231--235} , volume = 55 , year = 1933 } @InProceedings{w-avsn-04 , author = WagnerD , title = {{Analysis and Visualization of Social Networks}} , booktitle = {{Proceedings of the 2nd Workshop on Experimental Algorithms (WEA'03)}} , note = {Invited Talk} , pages = {261--266} , publisher = pub-springer , series = ser-springer_lncs , volume = 2647 , year = 2003 } @Article{w-br-93 , author = WagnerD , title = {{Book review of \emph{Paths, Flows, and VLSI-Layout} by A.~Schrijver and L.~Lovasz (B.~Korte, H.~J.~Promel and R.~L.~Graham (eds.))}} , journal = j-mmor , month = feb , number = 1 , pages = {102--103} , pdf = "http://www.springerlink.com/content/v8571u8mn274m357/fulltext.pdf" , url = "http://www.springerlink.com/content/v8571u8mn274m357/" , volume = 38 , year = 1993 } @Article{w-brcgt-92 , author = WagnerD , title = {{Book Review of \textit{Computational Graph Theory} by Gottfried Tinhofer, Ernst Mayr, Hartmut Noltemeier and Maciej Syslo (eds.), Springer-Verlag, 1990, 282 p.}} , journal = j-mmor , note = {Book Review} , number = 1 , pages = {106--109} , volume = 36 , year = 1992 } @Article{w-bv-36 , author = WagnerK , title = {{Bemerkungen zum Vierfarbenproblem}} , journal = j-jdmvdmv , pages = {26--32} , volume = 46 , year = 1936 } @article{w-cgcg-32 , author = WhitneyH , title = {{Congruent graphs and the connectivity of graphs}} , journal = j-ajm , pages = {150--168} , volume = 54 , year = 1932 } @article{w-cvbmi-55 , author = WignerEP , title = {{Characteristic vectors of bordered matrices with infinite dimensions}} , journal = j-amath , pages = {548--564} , volume = 62 , year = 1955 } @habilitation{w-darcl-92 , author = WagnerD , title = {{Discrete Algorithms for Routing in Chip Layout}} , school = "Technische Universit{\"a}t Berlin" , year = 1992 } @Article{w-dfgsa-03 , author = WagnerD , title = {{{DFG-Schwerpunktprogramm \emph{Algorithmik gro{\ss}er und komplexer Netzwerke}}}} , journal = j-it , pages = {162--169} , volume = 3 , year = 2003 } @article{w-dmnf-01 , author = WattsA , title = {{A Dynamic Model of Network Formation}} , journal = j-geb , pages = {331--341} , volume = 34 , year = 2001 } @InCollection{w-dpg-01 , author = WeiskircherR , title = {{Drawing Planar Graphs}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {23--45} , pdf = "http://springerlink.metapress.com/content/bh97fl80jqp4njvc/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/bh97fl80jqp4njvc/" , volume = 2025 , year = 2001 } @Article{w-dpo-90 , author = WagnerD , title = {{Decomposition of Partial Orders}} , journal = j-order , pages = {335--350} , volume = 6 , year = 1990 } @Article{w-dr-90 , author = WagnerD , title = {{Decomposition of $k$-ary Relations}} , journal = j-dima , pages = {303--322} , volume = 81 , year = 1990 } @article{w-drcsm-58 , author = WignerEP , title = {{On the distribution of the roots of certain symmetric matrices}} , journal = j-amath , pages = {325--327} , volume = 67 , year = 1958 } @phdthesis{w-dsmzs-86 , author = WagnerD , title = {{{Die Splitdekomposition als Methode zur Zerlegung diskreter Strukturen}}} , school = "Rheinisch Westf{\"a}lische Technische Hochschule Aachen" , year = 1986 } @inproceedings{w-eahp-03 , author = WoegingerGJ , title = {{Exact Algorithms for {$\mathcal{NP}$}-Hard Problems: A Survey}} , booktitle = {{Proceedings of the 5th International Workshop on Combinatorial Optimization (Aussois'2001)}} , pages = {185--207} , publisher = pub-springer , series = ser-springer_lncs , volume = 2570 , year = 2003 } @phdthesis{w-espla-05 , author = WillhalmT , title = {{Engineering Shortest Paths and Layout Algorithms for Large Graphs}} , pdf = "http://www.ubka.uni-karlsruhe.de/vvv/2005/informatik/3/3.pdf" , school = inf_ka , url = "http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=2005/informatik/3" , year = 2005 } @InProceedings{w-frp-11 , author = WilliamsVV , title = {{Faster Replacement Paths}} , booktitle = {{Proceedings of the 22nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'11)}} , pages = {1337--1346} , publisher = pub-siam , year = 2011 } @Article{w-g-33 , author = WhitneyH , title = {{$2$-isomorphic Graphs}} , journal = j-ajm , pages = {245--254} , volume = 55 , year = 1933 } @book{w-g-94 , author = WilfHS , title = {{generatingfunctionology}} , publisher = pub-ap , year = 1994 } @Article{w-hvbm-75 , author = WalshTR , title = {{Hypermaps Versus Bipartite Maps}} , journal = j-jcombthb , month = apr , number = 2 , pages = {155--163} , volume = 18 , year = 1975 } @book{w-iarf-03 , author = WinklerG , title = {{Image Analysis, Random Fields, and Markov Chain Monte Carlo Methods}} , edition = second , publisher = pub-springer , year = 2003 } @book{w-igt-01 , author = WestDB , title = {{Introduction to Graph Theory}} , edition = second , publisher = pub-ph , year = 2001 } @Book{w-ivsep-07 , author = WareC , title = {{Information Visualization, Second Edition: Perception for Design}} , booktitle = {{Information Visualization, Second Edition: Perception for Design}} , publisher = pub-mk , year = 2007 } @book{w-kgea-03 , author = WegenerI , title = {{Komplexit{\"a}tstheorie - Grenzen der Effizienz von Algorithm}} , booktitle = {{Komplexit{\"a}tstheorie - Grenzen der Effizienz von Algorithm}} , isbn = "3-540-00161-1" , publisher = pub-springer , year = 2003 } @techreport{w-kvlo-99 , author = WeiheK , title = {{Kurzskript zur Vorlesung: Lineare Optimierung}} , month = mar , number = 86 , pages = {1--36} , school = "Konstanzer Schriften in Mathematik und Informatik" , year = 1999 } @InProceedings{w-mafdg-01 , author = WalshawC , title = {{A Multilevel Algorithm for Force-Directed Graph Drawing}} , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}} , month = jan , pages = {31--55} , pdf = "http://www.springerlink.com/content/99vvynnyq901tylm/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/99vvynnyq901tylm/" , volume = 1984 , year = 2001 } @InCollection{w-mb-98 , author = WagnerD , title = {{Minimal spannende B{\"a}ume}} , booktitle = {{Prinzipien des Algorithmenentwurfs. Multimediales Lehrbuch}} , pages = {173--182} , publisher = pub-sav , year = 1998 } @Article{w-mctrp-02 , author = WinterS , title = {{Modeling Costs of Turns in Route Planning}} , journal = j-geoi , number = 4 , pages = {345--361} , volume = 6 , year = 2002 } @InProceedings{w-nakkc-91 , author = WagnerD , title = {{A new approach to knock-knee channel routing}} , booktitle = {{Proceedings of the 2nd International Symposium on Algorithms (ISA'91)}} , pages = {83--93} , publisher = pub-springer , series = ser-springer_lncs , volume = 557 , year = 1991 } @Article{w-nspg-32 , author = WhitneyH , title = {{Non-Separable and Planar Graphs}} , journal = j-tams , month = apr , number = 2 , pages = {339--338} , volume = 34 , year = 1932 } @InProceedings{w-nwi-98 , author = WillsGJ , title = {{NicheWorks ? Interactive visualization of very large graphs}} , booktitle = {{Proceedings of the 5th International Symposium on Graph Drawing (GD'97)}} , location = "Rome, Italy" , month = jan , pages = {403--414} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/x7r71r316847/" , volume = 1353 , year = 1998 } @Article{w-ocg-33 , author = WhitneyH , title = {{On the Classification of Graphs}} , journal = j-ajm , pages = {236--244} , volume = 55 , year = 1933 } @Article{w-ortdc-93 , author = WagnerD , title = {{Optimal Routing Through Dense Chanels}} , journal = j-ijcga , number = 3 , pages = {269--289} , volume = 3 , year = 1993 } @article{w-qaep-00 , author = WatkinsDS , title = {{{QR}-like Algorithms for Eigenvalue Problems}} , journal = j-cam , pages = {67--83} , volume = 123 , year = 2000 } @article{w-rmc-88 , author = WaxmanBM , title = {{Routing of multipoint connections}} , journal = j-jsac , number = 9 , pages = {1617--1622} , volume = 6 , year = 1988 } @Article{w-sastp-93 , author = WagnerD , title = {{Simple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs}} , journal = j-cwi-qu , number = 3 , pages = {219--240} , url = "http://www.cwi.nl/publications/QUARTERLY/Quarter/V6-3-93.html" , volume = 6 , year = 1993 } @Book{w-scs-43 , author = WhyteWF , title = {{Street Corner Society}} , booktitle = {{Street Corner Society}} , publisher = pub-ucp , url = "http://www.press.uchicago.edu/presssite/metadata.epl?mode=synopsis&bookkey=53397" , year = 1943 } @article{w-sdpbp-47 , author = WienerH , title = {{Structural Determination of Paraffin Boiling Points}} , journal = j-jacs , pages = {17--20} , volume = 69 , year = 1947 } @book{w-si-09 , author = WeberA , title = {{{\"U}ber den Standort der Industrien}} , address = "T{\"u}bingen" , publisher = pub-mohr , year = 1909 } @InCollection{w-sp-01 , author = WillhalmT , title = {{Software Packages}} , booktitle = {{Drawing Graphs: Methods and Models}} , isbn = "3-540-42062-2" , pages = {274--281} , pdf = "http://springerlink.metapress.com/content/kqyawf54r9p9y4hm/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://springerlink.metapress.com/content/kqyawf54r9p9y4hm/" , volume = 2025 , year = 2001 } @Book{w-st-99 , author = WattsDJ , title = {{Small worlds: The dynamics of networks between order and randomness}} , booktitle = {{Small worlds: The dynamics of networks between order and randomness}} , publisher = pub-pup , year = 1999 } @book{w-taep-65 , author = WilkinsonJH , title = {{The Algebraic Eigenvalue Problem}} , publisher = pub-cp , year = 1965 } @article{w-tbm-62 , author = WarshallS , title = {{A Theorem on Boolean Matrices}} , journal = j-acm , number = 1 , pages = {11-12} , volume = 9 , year = 1962 } @Article{w-tefl-05 , author = WenkMR , title = {{The Emerging Field of Lipidomics}} , journal = j-nrdd , month = jul , pages = {594--610} , pdf = "http://www.nature.com/nrd/journal/v4/n7/pdf/nrd1776.pdf" , url = "doi:10.1038/nrd1776" , volume = 4 , year = 2005 } @Book{w-tgfns-79 , author = WilliamsR , title = {{The Geometrical Foundation of Natural Structure: A Source Book of Design}} , booktitle = {{The Geometrical Foundation of Natural Structure: A Source Book of Design}} , month = jun , publisher = pub-tdp , year = 1979 } @Article{wa-pypn-05 , author = WuchtyS #and# AlmaasE , title = {{Peeling the Yeast Protein Network}} , journal = j-p , number = 2 , pages = {444--449} , pdf = "http://doi.wiley.com/10.1002/pmic.200400962" , volume = 5 , year = 2005 } @article{wb-bcmdg-94 , author = WhiteDR #and# BorgattiSP , title = {{Betweenness Centrality Measures for Directed Graphs}} , journal = j-sn , pages = {335--346} , volume = 16 , year = 1994 } @InProceedings{wblmww-edga-99 , author = WeiheK #and# BrandesU #and# LiebersA #and# MuellerHannemannM #and# WagnerD #and# WillhalmT , title = {{Empirical Design of Geometric Algorithms}} , booktitle = {{Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG'99)}} , pages = {86--94} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/blmwww-edga-99.pdf" , publisher = pub-acm , url = "http://portal.acm.org/citation.cfm?id=304893.304918" , year = 1999 } @InCollection{wc-jostl-07 , author = WalshawC #and# CrossM , title = {{JOSTLE: Parallel Multilevel Graph-Partitioning Software -- An Overview}} , booktitle = {{Mesh Partitioning Techniques and Domain Decomposition Techniques}} , pages = {27--58} , publisher = pub-ccl , year = 2007 } @InProceedings{wc-lappp-98 , author = WadaK #and# ChenW , title = {{Linear Algorithms for a $k$-Partition Problem of Planar Graphs}} , booktitle = {{Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'98)}} , pages = {324--336} , publisher = pub-springer , series = ser-springer_lncs , year = 1998 } @Article{we-chacm-89 , author = WilletP #and# El-HamdouchiA , title = {{Comparison of Hierarchic Agglomerative Clustering Methods for Document Retrieval}} , journal = j-tcj , number = 3 , pages = {220--227} , url = "http://dx.doi.org/10.1093/comjnl/32.3.220" , volume = 32 , year = 1989 } @misc{web:routeviews , author = MeyerD , title = {{University of Oregon Route Views Project}} , note = {web page; [Online at \url{http://routeviews.org/}; accessed 31-August-2007]} , url = "http://routeviews.org/" , year = 2007 } @book{wf-sna-94 , author = WassermanS #and# FaustK , title = {{Social Network Analysis: Methods and Applications}} , publisher = pub-cup , year = 1994 } @InProceedings{wgw-ppsrs-06 , author = WuYH #and# GuanLJ #and# WinterS , title = {{Peer-to-Peer Shared Ride Systems}} , booktitle = {{GeoSensor Networks}} , month = aug , pages = {252--270} , pdf = "http://www.springerlink.com/content/x71ng3432m32271v/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/x71ng3432m32271v/" , volume = 4540 , year = 2006 } @InCollection{wgydkso-bsal-09 , author = WheelockCE #and# GotoS #and# YetukuriL #and# DAlexandriFL #and# KlukasC #and# SchreiberF #and# OresicM , title = {{Bioinformatics Strategies for the Analysis of Lipids}} , booktitle = {{Lipidomics Volume 2: Methods and Protocols }} , pages = {339--368} , pdf = "http://www.springerlink.com/content/l0j8m4237h040225/fulltext.pdf" , publisher = pub-springer , series = ser-mmb , url = "http://www.springerlink.com/content/l0j8m4237h040225/" , volume = 2009 , year = 2009 } @Article{wh-fcltp-04 , author = WuF #and# HubermanBA , title = {{Finding communities in linear time: a physics approach}} , journal = j-epjb , month = mar , number = 2 , pages = {331--338} , pdf = "http://www.springerlink.com/content/h6jfb70vqxadydrm/fulltext.pdf" , url = "http://www.springerlink.com/content/h6jfb70vqxadydrm/" , volume = 38 , year = 2004 } @misc{wiki:Gnutella , author = Wikipedia , title = {{Gnutella --- Wikipedia, the free encyclopedia}} , note = {[Online at \url{http://en.wikipedia.org/wiki/Gnutella}; accessed 31-August-2007]} , url = "http://en.wikipedia.org/wiki/Gnutella" , year = 2007 } @Article{wiw-mhgsm-93 , author = WagnerD #and# IhlerE #and# WagnerF , title = {{Modeling Hypergraphs by Graphs with the Same Mincut Properties}} , journal = j-ipl , number = 4 , pages = {171--175} , volume = 45 , year = 1993 } @techreport{wj-iitg-02 , author = WinickJ #and# JaminS , title = {{Inet-3.0: {I}nternet Topology Generator}} , institution = "EECS, University of Michigan" , number = {CSE-TR-456} , pdf = "http://topology.eecs.umich.edu/inet/inet-3.0.pdf" , url = "http://topology.eecs.umich.edu/inet/" , year = 2002 } @Article{wl-aogta-93 , author = WuZ #and# LeahyR , title = {{An Optimal Graph Theoretic Approach to Data Clustering: Theory and its Application to Image Segmentation}} , journal = j-tpami , number = 11 , pages = {1101--1113} , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=244673" , volume = 15 , year = 1993 } @InProceedings{wm-gcl-96 , author = WangX #and# MiyamotoI , title = {{Generating Customized Layouts}} , booktitle = {{Proceedings of the 3rd International Symposium on Graph Drawing (GD'95)}} , location = "Passau, Germany" , month = jan , pages = {504--515} , publisher = pub-springer , series = ser-springer_lncs , url = "http://gdea.informatik.uni-koeln.de/archive/00000232/" , volume = 1027 , year = 1996 } @Article{wm-vsnph-90 , author = WagnerD #and# MuellerR , title = {{$\alpha$-Vertex Separator is NP-Hard Even for 3-Regular Graphs}} , journal = j-mor , pages = {291--293} , pdf = "http://www.springerlink.com/content/796647kp0v256403/fulltext.pdf" , url = "http://www.springerlink.com/content/796647kp0v256403/" , volume = 62 , year = 1990 } @Article{wm-vsnph-91 , author = WagnerD #and# MuellerR , title = {{{$\alpha$}-Vertex Separator is NP-Hard Even for 3-Regular Graphs}} , journal = j-comput , pages = {343--353} , volume = 46 , year = 1991 } @Article{wn-a-06 , author = WinterS #and# NittelS , title = {{Ad-hoc shared ride trip planning by mobile geosensor networks}} , journal = j-ijgis , month = sep , number = 8 , pages = {899--916} , pdf = "http://www.informaworld.com/smpp/ftinterface~content=a758004880~fulltext=713240930" , url = "http://www.informaworld.com/smpp/content~content=a758004880~db=all" , volume = 20 , year = 2006 } @Article{wn-amcag-93 , author = WatanabeT #and# NakamuraA , title = {{A Minimum 3-Connectivity Augmentation of a Graph}} , journal = j-css , month = feb , number = 1 , pages = {91--128} , volume = 46 , year = 1993 } @Article{wn-asag-90 , author = WatanabeT #and# NakamuraA , title = {{A Smallest Augmentation to 3-connect a Graph}} , journal = j-dam , number = 2 , pages = {183--186} , volume = 28 , year = 1990 } @article{wp-lmlrs-96 , author = WassermanS #and# PattisonP , title = {{Logit Models and Logistic Regressions for Social Networks: I.~An Introduction to Markov Graphs and $p^{*}$}} , journal = j-psy , pages = {401--426} , volume = 60 , year = 1996 } @InProceedings{wpswmt-sssgc-08 , author = WangB #and# PhillipsJM #and# SchreiberR #and# WilkinsonD #and# MishraN #and# TarjanRE , title = {{Spatial Scan Statistics for Graph Clustering}} , booktitle = {{Proceedings of the 2008 SIAM International Conference on Data Mining}} , pages = {727--738} , pdf = "http://www.siam.org/proceedings/datamining/2008/dm08_66_WangPhillips.pdf" , publisher = pub-siam , url = "http://www.siam.org/proceedings/datamining/2008/dm08.php" , year = 2008 } @misc{wr-figtt-08 , editor = WahlsterW #and# RafflerH , title = {{Forschen f{\"u}r die Internet-Gesellschaft: Trends, Technologien, Anwendungen. Trends und Handlungsempfehlungen 2008 des Feldafinger Kreises}} , pdf = "http://www.feldafinger-kreis.de/Feldafinger-Kreis_Studie_2008.pdf" , publisher = pub-fk , year = 2008 } @article{wr-gshnr-83 , author = WhiteDR #and# ReitzKP , title = {{Graph and Semigroup Homomorphisms on Networks of Relations}} , journal = j-sn , pages = {193--234} , volume = 5 , year = 1983 } @InProceedings{ws-aerin-03 , author = WhiteS #and# SmythP , title = {{Algorithms for Estimating Relative Importance in Networks}} , booktitle = {{Proceedings of the nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}} , url = "http://doi.acm.org/10.1145/956750.956782" , year = 2003 } @Article{ws-c-98 , author = WattsDJ #and# StrogatzSH , title = {{Collective dynamics of 'small-world' networks}} , journal = j-nature , month = jun , number = 6684 , pages = {440--442} , volume = 393 , year = 1998 } @article{ws-cdswn-98 , author = WattsDJ #and# StrogatzSH , title = {{Collective Dynamics of ``Small-World'' Networks}} , journal = j-nature , pages = {440--442} , volume = 393 , year = 1998 } @article{ws-cocn-03 , author = WuchtyS #and# StadlerPF , title = {{Centers of complex networks}} , journal = j-jtb , pages = {45--53} , volume = 223 , year = 2003 } @InProceedings{ws-scafc-05 , author = WhiteS #and# SmythP , title = {{A Spectral Clustering Approach to Finding Communities in Graphs}} , booktitle = {{Proceedings of the fifth SIAM International Conference on Data Mining}} , pages = {274--285} , pdf = "http://www.siam.org/proceedings/datamining/2005/dm05_25whites.pdf" , publisher = pub-siam , url = "http://www.siam.org/proceedings/datamining/2005/dm05.php" , year = 2005 } @article{ws-trlml-00 , author = WuK #and# SimonH , title = {{Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems}} , journal = j-sjmaa , number = 2 , pages = {602--616} , volume = 22 , year = 2000 } @misc{wt-fcsms-07 , author = WakitaK #and# TsurumiT , title = {{Finding Community Structure in Mega-scale Social Networks}} , month = feb , note = {Technical Report on arXiv} , url = "http://arxiv.org/abs/cs/0702048v1" , year = 2007 } @article{wt-mbcbcol-92 , author = WestbrookJ #and# TarjanRE , title = {{Maintaining Bridge-Connected and Biconnected Components On-Line}} , journal = j-alg , pages = {433--464} , volume = 7 , year = 1992 } @Article{ww-aeplt-92 , author = WagnerD #and# WagnerF , title = {{An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem}} , journal = j-dam , number = 1 , pages = {73--81} , url = "http://dx.doi.org/10.1016/0166-218X(92)90022-3" , volume = 40 , year = 1992 } @Article{ww-agzop-91 , author = WagnerD #and# WagnerF , title = {{A Generalization of the Zero-One Principle for Sorting Algorithms}} , journal = j-dam , pages = {265--273} , url = "http://dx.doi.org/10.1016/0166-218X(91)90050-7" , volume = 30 , year = 1991 } @InProceedings{ww-alcvr-95 , author = WeiheK #and# WagnerD , title = {{An animated library for combinatorial VLSI routing algorithms}} , booktitle = {{Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG'95)}} , pages = {428--429} , publisher = pub-acm , year = 1995 } @Book{ww-asahn-07 , editor = WagnerD #and# WattenhoferR , title = {{Algorithms for Sensor and Ad Hoc Networks}} , booktitle = {{Algorithms for Sensor and Ad Hoc Networks}} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springer.com/computer/communications/book/978-3-540-74990-5" , volume = 4621 , year = 2007 } @InProceedings{ww-bmcgb-93 , author = WagnerD #and# WagnerF , title = {{Between Min Cut and Graph Bisection}} , address = "London, UK" , booktitle = {{Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS'93)}} , isbn = "3-540-57182-5" , pages = {744--750} , publisher = pub-springer , series = ser-springer_lncs , volume = 711 , year = 1993 } @techreport{ww-ccao-07 , author = WagnerS #and# WagnerD , title = {{Comparing Clusterings -- An Overview}} , institution = iti_wagner , number = {2006-04} , pdf = "http://i11www.ira.uka.de/extra/publications/ww-cco-06.pdf" , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011477" , year = 2007 } @Article{ww-crudo-90 , author = WagnerD #and# WagnerF , title = {{Channel Routing Under Different Optimization Criteria}} , journal = j-mor , pages = {295--305} , volume = 62 , year = 1990 } @InProceedings{ww-dgsus-05 , author = WagnerD #and# WillhalmT , title = {{Drawing Graphs to Speed Up Shortest-Path Computations}} , booktitle = {{Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05)}} , pages = {15--24} , publisher = pub-siam , year = 2005 } @Article{ww-gsnpc-89 , author = WagnerD #and# WagnerF , title = {{Graph Separation is NP-Complete}} , journal = j-mor , pages = {269--274} , volume = 60 , year = 1989 } @InProceedings{ww-gsutf-03 , author = WagnerD #and# WillhalmT , title = {{Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs}} , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}} , pages = {776--787} , publisher = pub-springer , series = ser-springer_lncs , volume = 2832 , year = 2003 } @InProceedings{ww-ltaed-93 , author = WagnerD #and# WeiheK , title = {{A linear time algorithm for edge-disjoint paths in planar graphs}} , booktitle = {{Proceedings of the 1st European Symposium on Algorithms (ESA'93)}} , pages = {744--750} , series = ser-springer_lncs , volume = 726 , year = 1993 } @Article{ww-ltaed-95 , author = WagnerD #and# WeiheK , title = {{A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs}} , journal = j-comb , month = mar , number = 1 , pages = {135--150} , pdf = "http://www.springerlink.com/content/0m6542766n708351/fulltext.pdf" , url = "http://www.springerlink.com/content/0m6542766n708351/" , volume = 15 , year = 1995 } @article{ww-sbdg-87 , author = WangYJ #and# WongGY , title = {{Stochastic Blockmodels for Directed Graphs}} , journal = j-jasa , pages = {8--19} , volume = 82 , year = 1987 } @InProceedings{ww-sutsp-07 , author = WagnerD #and# WillhalmT , title = {{Speed-Up Techniques for Shortest-Path Computations}} , booktitle = {{Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)}} , note = {Invited Talk} , pages = {23--36} , pdf = "http://i11www.ira.uka.de/extra/publications/ww-sutsp-07.pdf" , publisher = pub-springer , series = ser-springer_lncs , volume = 4393 , year = 2007 } @InProceedings{wwmz-docsn-08 , author = WeiF #and# WangC #and# MaL #and# ZhouA , title = {{Detecting Overlapping Community Structures in Networks with Global Partition and Local Expansion}} , booktitle = {{Proceedings of the 10th Asia-Pacific Web Conference}} , month = apr , pages = {43--55} , pdf = "http://www.springerlink.com/content/k52h674032w2g31h/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/k52h674032w2g31h/" , year = 2008 } @InProceedings{wwz-dspc-04 , author = WagnerD #and# WillhalmT #and# ZaroliagisC , title = {{Dynamic Shortest Path Containers}} , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}} , pages = {65--84} , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/wwz-dspc-03.pdf" , series = ser-entcs , volume = 92 , year = 2004 } @Article{wwz-gcesp-05 , author = WagnerD #and# WillhalmT #and# ZaroliagisC , title = {{Geometric Containers for Efficient Shortest-Path Computation}} , journal = j-acm-ea , number = {1.3} , pages = {1--30} , volume = 10 , year = 2005 } %% -------------------------------------------------------------- @Article{xckp-fdsew-12 , author = XieL #and# ChoiD #and# KarS #and# PoorH , title = {{Fully Distributed State Estimation for Wide-Area Monitoring Systems}} , journal = j-ieeetsg , month = sep , number = 3 , pages = {1154--1169} , volume = 3 , year = 2012 } @Article{xlhzl-ad-07 , author = XuMH #and# LiuYQ #and# HuangQL #and# ZhangYX #and# LuanGF , title = {{An improved Dijkstra’s shortest path algorithm for sparse network}} , journal = j-amc , month = feb , number = 1 , pages = {247--254} , volume = 185 , year = 2007 } @Article{xox-mstge-01 , author = XuY #and# OlmanV #and# XuD , title = {{Minimum Spanning Trees for Gene Expression Data Clustering}} , journal = j-gi , pages = {24--33} , volume = 12 , year = 2001 } @InProceedings{xrcgbge-awsns-04 , author = XuN #and# RangwalaS #and# ChintalapudiKK #and# GanesanD #and# BroadA #and# GovindanR #and# EstrinD , title = {{A Wireless Sensor Network for Structural Monitoring}} , booktitle = {{2nd international conference on Embedded networked sensor systems (SenSys'04)}} , pages = {13--24} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1031495.1031498" , year = 2004 } @Article{xtp-fcscn-07 , author = XuG #and# TsokaS #and# PapageorgiouLG , title = {{Finding Community Structures in Complex Networks using Mixed Integer Optimisation }} , journal = j-epjb , month = nov , number = 2 , pages = {231--239} , pdf = "http://www.springerlink.com/content/x2962u53427q782r/fulltext.pdf" , url = "http://www.springerlink.com/content/X2962U53427Q782R/" , volume = 60 , year = 2007 } @InProceedings{xwnh-smize-09 , author = XingX #and# WardenT #and# NicolaiT #and# HerzogO , title = {{SMIZE: A spontaneous Ride-Sharing System for Individual Urban Transit}} , booktitle = {{Proceedings of the 7th German Conference on Multiagent System Technologies (MATES 2009)}} , month = sep , pages = {165--176} , pdf = "http://www.springerlink.com/content/4734714336082j0r/fulltext.pdf" , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/4734714336082j0r/" , volume = 5774 , year = 2009 } %% -------------------------------------------------------------- @InProceedings{y-amslc-10 , author = YanagisawaH , title = {{A Multi-Source Label-Correcting Algorithm for the All-Pairs Shortest Paths Problem}} , booktitle = {{24th International Parallel and Distributed Processing Symposium (IPDPS'10)}} , pages = {1--10} , publisher = pub-ics , year = 2010 } @Article{y-fkslp-71 , author = YenJY , title = {{Finding the K Shortest Loopless Paths in a Network}} , journal = j-msci , number = 11 , pages = {712--716} , volume = 17 , year = 1971 } @InProceedings{yags-nsdaa-06 , author = YaoY #and# AlamSMN #and# GehrkeJ #and# ServettoSD , title = {{Network Scheduling for Data Archiving Applications in Sensor Networks}} , booktitle = {{Proceedings of the 3rd Workshop on Data Management for Sensor Networks (DMSN'06)}} , pages = {19--25} , publisher = pub-acm , url = "http://doi.acm.org/10.1145/1315903.1315909" , year = 2006 } @InProceedings{ydxzw-pa-12 , author = YanX #and# DongZY #and# XuZ #and# ZhangR #and# WongKP , title = {{Power system transient stability-constrained optimal power flow: A comprehensive review}} , booktitle = {{Power and Energy Society General Meeting}} , pages = {1--7} , publisher = pub-ieee , year = 2012 } @misc{yed , author = yworks , title = {{{yEd} - Java Graph Editor}} , url = "http://www.yworks.com/en/products_yed_about.html" , year = 2008 } @misc{yfiles , author = yworks , title = {{yFiles for Java}} , url = "http://www.yworks.com/en/products_yfiles_about.html" , year = 2008 } @InProceedings{yhwl-aodaa-12 , author = YuD #and# HuaQ #and# WangY #and# LauFC , title = {{An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks}} , booktitle = {{Proceedings of the 2012 International Conference on Distributed Computing in Sensor Systems}} , pages = {132--139} , publisher = pub-ics , year = 2012 } @Article{yhy-acacd-08 , author = YeZ #and# HuS #and# YuJ , title = {{Adaptive Clustering Algorithm for Community Detection in Complex Networks}} , journal = j-pr-e , number = 4 , url = "http://link.aps.org/doi/10.1103/PhysRevE.78.046115 " , volume = 78 , year = 2008 } @InProceedings{yl-a-12 , author = YuHai #and# LuF , title = {{Advanced multi-modal routing approach for pedestrians}} , booktitle = {{2nd International Conference on Consumer Electronics, Communications and Networks}} , pages = {2349--2352} , year = 2012 } @InProceedings{ysp-ossp- , author = YaoS #and# ShengC #and# PeiP , title = {{On k-Skip Shortest Paths}} , booktitle = {{Proceedings of the 2011 ACM SIGMOD international conference on Management of data (SIGMOD'11)}} , pages = {421--432} , publisher = pub-acm , year = 2011 } @InProceedings{yvwfvs-crwdm-05 , author = YenL #and# VanvyveD #and# WoutersF #and# FoussF #and# VerleysenM #and# SaerensM , title = {{Clustering using a Random Walk based Distance Measure}} , booktitle = {{Proceedings of the 13th European Symposium on Artifical Neural Networks}} , pages = {317--324} , pdf = "http://www.dice.ucl.ac.be/Proceedings/esann/esannpdf/es2005-105.pdf" , url = "http://www.dice.ucl.ac.be/esann/proceedings/papers.php?ann=2005" , year = 2005 } @InProceedings{ywhl-ddcpm-11 , author = YuD #and# WangY #and# HuaQ #and# LauFC , title = {{Distributed ($\Delta$ + 1) Coloring in the Physical Model}} , booktitle = {{Proceedings of the 7th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'11)}} , pages = {145--160} , publisher = pub-springer , series = ser-springer_lncs , year = 2011 } @InProceedings{ywhl-dlbap-11 , author = YuD #and# WangY #and# HuaQ #and# LauFC , title = {{Distributed Local Broadcasting Algorithms in the Physical Interference Model}} , booktitle = {{Proceedings of the 2011 International Conference on Distributed Computing in Sensor Systems}} , pages = {1--8} , publisher = pub-ics , year = 2011 } %% -------------------------------------------------------------- @techreport{z-anhma-69 , author = ZobristAL , title = {{A New Hashing Method with Application for Game Playing}} , institution = "Computer Sciences Department, University of Wisconsin, Madison" , number = 88 , pdf = "https://www.cs.wisc.edu/techreports/1970/TR88.pdf" , year = 1969 } @mastersthesis{z-apga-08 , author = ZeyBT , title = {{Algorithms for Planar Graph Augmentation}} , school = "TU Dortmund University" , year = 2008 } @article{z-apspbsrmm-00 , author = ZwickU , title = {{All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication}} , journal = "Electronic Coll" , number = 7 , url = "citeseer.ist.psu.edu/article/zwick00all.html" , volume = 60 , year = 2000 } @InProceedings{z-e-01 , author = ZwickU , title = {{Exact and approximate distances in graphs - a survey}} , booktitle = {{Proceedings of the 9th Annual European Symposium on Algorithms (ESA'01)}} , pages = {33--48} , series = ser-springer_lncs , volume = 2161 , year = 2001 } @mastersthesis{z-ebj-12 , author = ZuendorfT , title = {{Effiziente Berechnung guter Joggingrouten}} , month = oct , school = "Karlsruhe Institute of Technology" , type = {Bachelor Thesis} , year = 2012 } @Article{z-fl-88 , author = ZadehLA , title = {{Fuzzy Logic}} , journal = j-ieeec , number = 4 , pages = {83--93} , volume = 21 , year = 1988 } @Article{z-fs-65 , author = ZadehLA , title = {{Fuzzy Sets}} , journal = j-ico , number = 3 , pages = {338--353} , pdf = "http://www-bisc.cs.berkeley.edu/Zadeh-1965.pdf" , volume = 8 , year = 1965 } @phdthesis{z-gcsg-07 , author = ZickfeldF , title = {{Geometric and Combinatorial Structures on Graphs}} , school = "Fakult{\"a}t II -- Mathematik und Naturwissenschaften, Technische Universit{\"a}t Berlin" , year = 2007 } @article{z-gmddg-71 , author = ZahnCT , title = {{Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters}} , journal = j-tc , pages = {68-86} , volume = {C-20} , year = 1971 } @article{z-ifmcf-77 , author = ZacharyWW , title = {{An Information Flow Model for Conflict and Fission in Small Groups}} , journal = j-jar , pages = {452--473} , volume = 33 , year = 1977 } @Book{z-lp-95 , author = ZieglerG , title = {{Lectures on Polytopes}} , booktitle = {{Lectures on Polytopes}} , publisher = pub-springer , series = ser-springer_gtm , year = 1995 } @article{z-mpt-68 , author = ZelinkaB , title = {{Medians and Peripherians Tree}} , journal = "Archivum Mathem" , pages = {87--95} , volume = 4 , year = 1968 } @Article{z-nb-03 , author = ZhouH , title = {{Network landscape from a Brownian particle's perspective}} , journal = j-pr-e , pages = 041908 , url = "http://link.aps.org/doi/10.1103/PhysRevE.67.041908" , volume = 67 , year = 2003 } @misc{z-rr-12 , author = ZubkovR , title = {{Routenkompression f\"ur hybride Routenplanung}} , note = {Bachelor thesis, in German.} , school = "Karlsruhe Institute of Technology (KIT)" , year = 2012 } @article{z-teeka-72 , author = ZadehN , title = {{Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows}} , journal = j-acm , month = jan , number = 1 , pages = {184--192} , volume = 19 , year = 1972 } @Article{za-aipmt-08 , author = ZografosKG #and# AndroutsopoulosKN , title = {{Algorithms for Itinerary Planning in Multi-modal Transportation Networks}} , journal = j-ieeetits , month = mar , number = 1 , volume = 9 , year = 2008 } @Article{zas-daopi-09 , author = ZografosKG #and# AndroutsopoulosKN #and# SpitadakisV , title = {{Design and Assessment of an Online Passenger Information System for Integrated Multimodal Trip Planning}} , journal = j-ieeetits , month = jun , number = 2 , pages = {311--323} , volume = 10 , year = 2009 } @InProceedings{zb-neats-07 , author = ZhaH #and# BuchheimC , title = {{A New Exact Algorithm for the Two-Sided Crossing Minimization Problem}} , booktitle = {{Proceedings of the 1st International Conference on Combinatorial Optimization and Applications}} , pages = {301--310} , publisher = pub-springer , series = ser-springer_lncs , url = "http://www.springerlink.com/content/x720282rw8803001/" , volume = 4616 , year = 2007 } @Article{zh-cotta-05 , author = ZhangHu #and# HeXi , title = {{Canonical Ordering Trees and Their Applications in Graph Drawing}} , journal = dcg , month = feb , number = 2 , pages = {321--344} , volume = 33 , year = 2005 } @InProceedings{zh-cvrsl-03 , author = ZhangHu #and# HeXi , title = {{Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs}} , booktitle = {{Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'03)}} , pages = {493--504} , publisher = pub-springer , series = ser-springer_lncs , volume = 2748 , year = 2003 } @Article{zh-ivrpg-05 , author = ZhangHu #and# HeXi , title = {{Improved Visibility Representation of Plane Graphs}} , journal = j-cg , pages = {29--39} , volume = 30 , year = 2005 } @InProceedings{zh-ntbvr-05 , author = ZhangHu #and# HeXi , title = {{New Theoretical Bounds of Visibility Representation of Plane Graphs}} , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}} , month = jan , pages = {425--430} , publisher = pub-springer , series = ser-springer_lncs , volume = 3383 , year = 2005 } @InProceedings{zh-oopt-07 , author = ZhangHu #and# HeXi , title = {{Optimal $st$-Orientations for Plane Triangulations}} , booktitle = {{Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07)}} , location = "Portland, USA" , month = jun , pages = {296--305} , publisher = pub-springer , series = ser-springer_lncs , year = 2007 } @Article{zh-vrpgc-05 , author = ZhangHu #and# HeXi , title = {{Visibility Representation of Plane Graphs via Canonical Ordering Tree}} , journal = j-ipl , month = oct , number = 2 , pages = {41--48} , volume = 96 , year = 2005 } @Article{zi-ttp-89 , author = ZehaviA #and# ItaiA , title = {{Three Tree-Paths}} , journal = j-jgt , number = 2 , pages = {175--188} , volume = 13 , year = 1989 } @Article{zmw-itanm-05 , author = ZivE #and# MiddendorfM #and# WigginsCH , title = {{Information-Theoretic Approach to Network Modularity}} , journal = j-pr-e , number = 046117 , pages = {1--9} , url = "http://link.aps.org/abstract/PRE/v71/e046117" , volume = 71 , year = 2005 } @misc{zoltanS , author = BomanE #and# DevineK #and# FiskCJ #and# HeaphyR #and# HendricksonB #and# LeungV #and# VaughanC #and# CatalyurekU #and# BozdagD #and# MitchellW , title = {{Zoltan: Data-Management Services for Parallel Applications, homepage}} , note = {\url{http://www.cs.sandia.gov/Zoltan}} , url = "http://www.cs.sandia.gov/Zoltan" , year = 1999 }