1 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
2 %% --------------------------------------------------------------
5 %% --------------------------------------------------------------
7 %% * STRING DEFINITIONS
12 %% - conference proceedings
13 %% * MONOGRAPHS, PAPERS, THESES
14 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
16 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
17 %% STRINGS DEFINITIONS
18 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
20 %% --------------------------------------------------------------
22 %% --------------------------------------------------------------
24 @string{and = " and " }
25 @string{jan = "January" }
26 @string{feb = "February" }
27 @string{mar = "March" }
28 @string{apr = "April" }
30 @string{jun = "June" }
31 @string{jul = "July" }
32 @string{aug = "August" }
33 @string{sep = "September" }
34 @string{oct = "October" }
35 @string{nov = "November" }
36 @string{dec = "December" }
37 @string{first = "1st" }
38 @string{second = "2nd" }
39 @string{third = "3rd" }
40 @string{fourth = "4th" }
41 @string{fifth = "5th" }
42 @string{sixth = "6th" }
43 @string{seventh = "7th" }
44 @string{eighth = "8th" }
45 @string{ninth = "9th" }
46 @string{tenth = "10th" }
47 @string{iti_wagner = "ITI Wagner, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)" }
48 @string{inf_ka = "Universit{\"a}t Karlsruhe (TH), Fakult{\"a}t f{\"u}r Informatik" }
49 @string{uni_ka = "Universit{\"a}t Karlsruhe (TH)" }
50 @string{kit_wagner = "ITI Wagner, Department of Informatics, Karlsruhe Institute of Technology (KIT)" }
52 %% --------------------------------------------------------------
54 %% --------------------------------------------------------------
55 @string{AbelloJ = "James Abello" }
56 @string{AbiteboulS = "Serge Abiteboul" }
57 @string{AbrahamI = "Ittai Abraham" }
58 @string{Abu-KhzamFN = "Faisal N. Abu-Khzam" }
59 @string{ActonFS = "Forman S. Acton" }
60 @string{AdamicLA = "Lada A. Adamic" }
61 @string{AdamopoulouE = "E. Adamopoulou" }
62 @string{AdamsonP = "P. Adamson" }
64 @string{aft = "testbja af" }
66 @string{AgarwalG = "Gaurav Agarwal" }
67 @string{AgarwalS = "Sharad Agarwal" }
68 @string{AGDT = "Deutsche Telekom AG" }
69 @string{AggarwalCC = "Charu C. Aggarwal" }
70 @string{AggarwalV = "Vinay Aggarwal" }
71 @string{AgrawalD = "Divyakant Agrawal" }
72 @string{AgrestiA = "Alan Agresti" }
73 @string{AhlswedeR = "Rudolf Ahlswede" }
74 @string{AhoAV = "Alfred V. Aho" }
75 @string{AhujaRK = "Ravindra K. Ahuja" }
76 @string{AielloW = "William Aiello" }
77 @string{AifadopoulouG = "Georgia Aifadopoulou" }
78 @string{AignerM = "Martin Aigner" }
79 @string{AingworthD = "Donald Aingworth" }
80 @string{AkhanMB = "Mehmet B.\ Akhan" }
81 @string{AkiyamaJ = "Jin Akiyama" }
82 @string{AkonMM = "Mohammad Mursalin Akon" }
83 @string{AlamJ = "Md. Jawaherul Alam" }
84 @string{AlamSMN = "S.~M.~Nazrul Alam" }
85 @string{AlaviY = "Yousef Alavi" }
86 @string{AlbaRD = "Richard D. Alba" }
87 @string{AlberJ = "Jochen Alber" }
88 @string{AlbersS = "Susanne Albers" }
89 @string{AlbertLH = "Louis H. Albert" }
90 @string{AlbertR = "R{\'e}ka Albert" }
91 @string{AlborziH = "Houman Alborzi" }
92 @string{AldecoaR = "Rodrigo Aldecoa" }
93 @string{AldenderferMS = "Mark S. Aldenderfer" }
94 @string{AleardiLC = "Luca Castelli Aleardi" }
95 @string{AlhajjR = "Reda Alhajj" }
96 @string{AlmaasE = "Eivind Almaas" }
97 @string{AlonN = "Noga Alon" }
98 @string{AlonU = "Uri Alon" }
99 @string{AlpertCJ = "Charles J.\ Alpert" }
100 @string{AltH = "Helmut Alt" }
101 @string{AltmannM = "Michael Altmann" }
102 @string{AlvarezHamelinJI = "Jos{\'e} Ignacio Alvarez-Hamelin" }
103 @string{AmaralLAN = "Lu{\'i}s A. Nunes Amaral" }
104 @string{AmatoP = "Paolo Amato" }
105 @string{AmdahlG = "Gene Amdahl" }
106 @string{AminAT = "Ashok T. Amin" }
107 @string{AminN = "Nada Amin" }
108 @string{AmmarM = "Mostafa Ammar" }
109 @string{AnalyticTech = "{Analytic Technologies}" }
110 @string{AnderbergMR = "Michael R.~Anderberg" }
111 @string{AndersenR = "Reid Andersen" }
112 @string{AndersonBDO = "Brian D. O. Anderson" }
113 @string{AndersonCJ = "Carolyn J. Anderson" }
114 @string{AndersonJG = "James G. Anderson" }
115 @string{AndersonMR = "Michael R.\ Anderson" }
116 @string{AndreevEM = "E. M. Andreev" }
117 @string{AndreevK = "Konstantin Andreev" }
118 @string{AndreevSD = "Simeon Danailov Andreev" }
119 @string{AndroutsopoulosKN = "Konstantinos N. Androutsopoulos" }
120 @string{AngeliniP = "Patrizio Angelini" }
121 @string{AnnexsteinFD = "Fred D. Annexstein" }
122 @string{AnthonisseJ = "Jacob M. Anthonisse" }
123 @string{AntsfeldL = "Leonid Antsfeld" }
124 @string{AnY = "Yuan An" }
125 @string{ArabieP = "Phipps Arabie" }
126 @string{ArasuA = "Arvind Arasu" }
127 @string{ArchakovAI = "Alexander I. Archakov" }
128 @string{ArchambaultD = "Daniel Archambault" }
129 @string{ArenasA = "Alex Arenas" }
130 @string{ArgyriouE = "Evmorfia N. Argyriou" }
131 @string{ArikushiK = "Karin Arikushi" }
132 @string{AriyoshiH = "Hiromu Ariyoshi" }
133 @string{ArkayaAD = "A. Diaz de Arkaya" }
134 @string{ArnauV = "Vicente Arnau" }
135 @string{ArnborgS = "Stefan Arnborg" }
136 @string{ArnoldL = "Ludwig Arnold" }
137 @string{AroraS = "Sanjeev Arora" }
138 @string{ArtmeierA = "Andreas Artmeier" }
139 @string{ArzJ = "Julian Arz" }
140 @string{AsaduzzamanS = "Shah Asaduzzaman" }
141 @string{AsahiroY = "Yuichi Asahiro" }
142 @string{AtallahM = "Mikhail Atallah" }
143 @string{AthenstadtJC = "Jan Christoph Athenst{\"a}dt" }
144 @string{AtienzaN = "Nieves Atienza" }
145 @string{AuberD = "David Auber" }
146 @string{AurenhammerF = "Franz Aurenhammer" }
147 @string{AusielloG = "Giorgio Ausiello" }
148 @string{AusternMH = "Matthew H. Austern" }
149 @string{AvinC = "Chen Avin" }
150 @string{AvrachenkovK = "Avrachenkov Konstantin" }
151 @string{AxenovichM = "Maria Axenovich" }
152 @string{AzarY = "Yossi Azar" }
153 @string{AzumaM = "Machiko Azuma" }
154 @string{AzumaS = "Shigetoshi Azuma" }
156 @string{BaakeP = "Pio Baake" }
157 @string{BabaiL = "L{\'a}szl{\'o} Babai" }
158 @string{BabenkoM = "Maxim Babenko" }
159 @string{BachFR = "Francis R. Bach" }
160 @string{BachlS = "Sabine Bachl" }
161 @string{BachmaierC = "Christian Bachmaier" }
162 @string{BadentM = "Melanie Badent" }
163 @string{BaderDA = "David A. Bader" }
164 @string{BaderR = "Roland Bader" }
165 @string{BadoiuM = "Mihai B\u{a}doiu" }
166 @string{BadraHO = "H. O. Badra" }
167 @string{Baeza-YatesR = "Ricardo Baeza-Yates" }
168 @string{BaggaJ = "Jay Bagga" }
169 @string{BagrowJ = "James Bagrow" }
170 @string{BairdD = "Daniel Baird" }
171 @string{BalakrishnanH = "Hari Balakrishnan" }
172 @string{BalasubramanianNV = "N. V. Balasubramanian" }
173 @string{BalbuenaC = "Camino Balbuena" }
174 @string{BaligaNS = "Nitin S. Baliga" }
175 @string{BallMO = "Michael~O.~Ball" }
176 @string{BaltzA = "Andreas Baltz" }
177 @string{BalzerM = "Michael Balzer" }
178 @string{Banaei-KashaniF = "Farnoush Banaei-Kashani" }
179 @string{BanerjiRB = "Ranan B. Banerji" }
180 @string{BansalN = "Nikhil Bansal" }
181 @string{Bar-GeraH = "Hillel Bar-Gera" }
182 @string{Bar-NoyA = "Amotz Bar-Noy" }
183 @string{BarabasiAL = "Albert-L{\'a}szl{\'o} Barab{\'a}si" }
184 @string{BarakeM = "Musbah Barake" }
185 @string{BaraldiA = "A. Baraldi" }
186 @string{BaranyI = "Imre B{\'a}r{\'a}ny" }
187 @string{BarbayJ = "J{\'e}r{\'e}my Barbay" }
188 @string{BarequetG = "Gill Barequet" }
189 @string{BarnardST = "Stephen T. Barnard" }
190 @string{BarnesJ = "Josh Barnes" }
191 @string{BarnesTM = "Tiffany M.\ Barnes" }
192 @string{BarnetteDW = "David W. Barnette" }
193 @string{BarratA = "Alain Barrat" }
194 @string{BarrettC = "Chris Barrett" }
195 @string{BartalY = "Y. Bartal" }
196 @string{BarthD = "D.\ Barth" }
197 @string{BarthelemyM = "Marc Barth{\'e}lemy" }
198 @string{BarYosseffZ = "Ziv Bar-Yosseff" }
199 @string{BastertO = "Oliver Bastert" }
200 @string{BastH = "Holger Bast" }
201 @string{BastH2 = "Hannah Bast" }
202 @string{BatageljV = "Vladimir Batagelj" }
203 @string{BatistakisY = "Yannis Batistakis" }
204 @string{BatzV = "Gernot Veit Batz" }
205 @string{BauerA = "Andreas Bauer" }
206 @string{BauerD = "Douglas Bauer" }
207 @string{BauerM = "Michel Bauer" }
208 @string{BauerR = "Reinhard Bauer" }
209 @string{BaumannH = "Herv{\'e} Baumann" }
210 @string{BaumannN = "Nadine Baumann" }
211 @string{BaumM = "Moritz Baum" }
212 @string{BaurM = "Michael Baur" }
213 @string{BavelasA = "Alex Bavelas" }
214 @string{BavierA = "Andy Bavier" }
215 @string{BayenA = "Alex Bayen" }
216 @string{BayikT = "Tolga Bayik" }
217 @string{BeauchampM = "Murray A. Beauchamp" }
218 @string{BeckerM = "M. Becker" }
219 @string{BeenK = "Ken Been" }
220 @string{BeeriC = "Catriel Beeri" }
221 @string{BeerliovaZ = "Zuzana Beerliova" }
222 @string{BehrendsE = "Ehrhard Behrends" }
223 @string{BeierR = "Rene Beier" }
224 @string{BeigelR = "Richard Beigel" }
225 @string{BeilnerH = "Heinz Beilner" }
226 @string{BeinekeLW = "Lowell W. Beineke" }
227 @string{BekosM = "Michael Bekos" }
228 @string{BelhumeuPN = "Peter N. Belhumeu" }
229 @string{BellmanR = "Richard Bellman" }
230 @string{BellMG = "Michael G. H. Bell" }
232 @string{ben-AvrahamD = "Daniel ben-Avraham" }
234 @string{BenadeG = "Gerhard Benade" }
235 @string{BenAvrahamD = "ben-Avraham, Daniel" }
236 @string{BenderS = "Stefan Bender" }
237 @string{BenigniA = "A. Benigni" }
238 @string{BenkertM = "Marc Benkert" }
239 @string{BenzerS = "Seymour Benzer" }
240 @string{BenzurA = "Andr{\'a}s A. Benz{\'u}r" }
241 @string{BerberichK = "Klaus Berberich" }
242 @string{BeregS = "Sergey Bereg" }
243 @string{BergeC = "Claude Berge" }
244 @string{Berger-WolfT = "Tanya Berger-Wolf" }
245 @string{BergerA = "Annabell Berger" }
246 @string{BergerAndre = "Andre Berger" }
247 @string{BergerB = "Bonnie Berger" }
248 @string{BergerN = "Noam Berger" }
249 @string{BerkhinP = "Pavel Berkhin" }
250 @string{BerkowitzSD = "Stephen D. Berkowitz" }
251 @string{BermanKA = "Kenneth A. Berman" }
252 @string{BermanP = "Piotr Berman" }
253 @string{BermondJC = "J.-C. Bermond" }
254 @string{BernsteinA = "Abraham Bernstein" }
255 @string{BernsteinD = "David Bernstein" }
256 @string{BerretiniE = "Emanuele Berretini" }
257 @string{BerryJW = "Jonathan W. Berry" }
258 @string{BerthomeP = "Pascal Berthom{\'e}" }
259 @string{BertolazziP = "Paola Bertolazzi" }
260 @string{BesagJE = "Julian E. Besag" }
261 @string{BetzG = "Gregor Betz" }
262 @string{BetzlerN = "Nadja Betzler" }
263 @string{BeyererJ = "J{\"u}rgen Beyerer" }
264 @string{BezrukovS = "Sergej Bezrukov" }
265 @string{BhalgatA = "Anand Bhalgat" }
266 @string{BhargavaVK = "Vijay K. Bhargava" }
267 @string{BharghavanV = "Vaduvur Bharghavan" }
268 @string{BhattSN = "Sandeep N. Bhatt" }
269 @string{BianchiniM = "Bianchini, Monica" }
270 @string{BiederbickC = "Claus Biederbick" }
271 @string{BiedlT = "Therese Biedl" }
272 @string{BiedlTC = "Therese C. Biedl" }
273 @string{BielliM = "Maurizio Bielli" }
274 @string{BikAJ = "Aart J. Bik" }
275 @string{BingmannT = "Timo Bingmann" }
276 @string{BinucciC = "Carla Binucci" }
277 @string{BissetK = "Keith Bisset" }
278 @string{BixbyRE = "Robert E. Bixby" }
279 @string{BlaesiusT = "Thomas Bl{\"a}sius" }
280 @string{BlairJ = "Jean Blair" }
281 @string{BlakeIF = "Ian F. Blake" }
282 @string{BlandfordDK = "Daniel K. Blandford" }
283 @string{BlandinS = "Sebastien Blandin" }
284 @string{BlashfieldRK = "Roger K. Blashfield" }
285 @string{BlellochGE = "Guy E. Blelloch" }
286 @string{BlomeA = "Abian Blome" }
287 @string{BlondaP = "P. Blonda" }
288 @string{BlondelV = "Vincent Blondel" }
289 @string{BloomBH = "Burton H. Bloom" }
290 @string{BlumA = "Avrim Blum" }
291 @string{BlytheJ = "Jim Blythe" }
292 @string{BMBFBf = "Bundesministerium (BMBF)" }
293 @string{BobickA = "Aaron Bobick" }
294 @string{BockN = "Nicolas Bock" }
295 @string{BodirskyM = "Manuel Bodirsky" }
296 @string{BodlaenderHL = "Hans L. Bodlaender" }
297 @string{BoeckerS = "Sebastian B{\"o}cker" }
298 @string{BoerP = "P. Boer" }
299 @string{BoeschFT = "Francis T. Boesch" }
300 @string{BogenbergerK = "Klaus Bogenberger" }
301 @string{BogunaM = "Mari{\'a}n Bogu{\~n}{\'a}" }
302 @string{BohlF = "Florian B{\"o}hl" }
303 @string{BohmC = "Christian B{\"o}hm" }
304 @string{BoilyMC = "M.-C.\ Boily" }
305 @string{BoisseauO = "Oliver Boisseau" }
306 @string{BoitmanisK = "Krists Boitmanis" }
307 @string{BoldiP = "Paolo Boldi" }
308 @string{BollobasB = "B{\'e}la Bollob{\'a}s" }
309 @string{BomanE = "Erik Boman" }
310 @string{BomzeIM = "Immanuel M. Bomze" }
311 @string{BonacichP = "Phillip Bonacich" }
312 @string{BondJ = "J.~Bond" }
313 @string{BondyJA = "John Adrian Bondy" }
314 @string{BonichonN = "Nicolas Bonichon" }
315 @string{BonifaciV = "Vincenzo Bonifaci" }
316 @string{BonizzoniP = "Paola Bonizzoni" }
317 @string{BoormanSA = "Scott A.\ Boorman" }
318 @string{BoorstynRR = "Robert~R.~Boorstyn" }
319 @string{BoothKS = "Kellogg S. Booth" }
320 @string{BoppanaRB = "Ravi B. Boppana" }
321 @string{BorgattiSP = "Stephen P. Borgatti" }
322 @string{BorgsC = "Christian Borgs" }
323 @string{BornholdtS = "Stefan Bornholdt" }
324 @string{BorodinA = "Borodin, Allan" }
325 @string{BorosE = "Endre Boros" }
326 @string{BorzyszkowskiAM = "Andrzej M. Borzyszkowski" }
327 @string{BoseP = "Prosenjit Bose" }
328 @string{BotafogoRA = "Rodrigo A. Botagfogo" }
329 @string{BoteaA = "Adi Botea" }
330 @string{BoulmakoulA = "Azedine Boulmakoul" }
331 @string{BowenR = "Rufus Bowen" }
332 @string{BoydJP = "John P.\ Boyd" }
333 @string{BoydS = "Stephen Boyd" }
334 @string{BoykovY = "Yuri Boykov" }
335 @string{BozdagD = "Doruk Bozdag" }
336 @string{BraeysyO = "Olli Br{\"a}ysy" }
337 @string{BrandenburgFJ = "Franz J. Brandenburg" }
338 @string{BrandesU = "Ulrik Brandes" }
339 @string{BrandstaedtA = "Andreas Brandst{\"a}dt" }
340 @string{BrandtF = "Felix Brandt" }
341 @string{BrankeJ = "J{\"u}rgen Branke" }
342 @string{BrannlundJ = "Johan Br{\"a}nnlund" }
343 @string{BrehmE = "Enno Brehm" }
344 @string{BreigerRL = "Ronald L.\ Breiger" }
345 @string{BrennerT = "Thomas Brenner" }
346 @string{BreuH = "Heinz Breu" }
347 @string{BrewerCA = "Cynthia A. Brewer" }
348 @string{BrewerEA = "Eric A. Brewer" }
349 @string{BriesemeisterS = "Sebastian Briesemeister" }
350 @string{BrightwellGR = "Graham R. Brightwell" }
351 @string{BrilloutR = "Romuald Brillout" }
352 @string{BrinkmannG = "Gunnar Brinkmann" }
353 @string{BrinkmeierM = "Michael Brinkmeier" }
354 @string{BrinkRvd = "van den Brink, Ren{\'e}" }
355 @string{BrinS = "Sergey Brin" }
356 @string{BroadA = "Alan Broad" }
357 @string{BrockenauerR = "Ralf Brockenauer" }
358 @string{BrodalG = "Gerth Brodal" }
359 @string{BroderA = "Andrei Broder" }
360 @string{BronC = "Coen Bron" }
361 @string{BronnimannH = "Herv{\'e} Br{\"o}nnimann" }
362 @string{BrooksRL = "R. L. Brooks" }
363 @string{BrualdiRA = "Richard A. Brualdi" }
364 @string{BruckdorferT = "Till Bruckdorfer" }
365 @string{BruckJ = "Jehoshua Bruck" }
366 @string{BrueraF = "Francesco Bruera" }
367 @string{BruggesserH = "Heinz Bruggesser" }
368 @string{BrunelE = "Edith Brunel" }
369 @string{BrunoJ = "John Bruno" }
370 @string{BuchananM = "Mark Buchanan" }
371 @string{BuchheimC = "Christoph Buchheim" }
372 @string{BuchinK = "Kevin Buchin" }
373 @string{BuchinM = "Maike Buchin" }
374 @string{BuchmannM = "Michael Buchmann" }
375 @string{BuchsbaumAL = "Adam L. Buchsbaum" }
376 @string{BudinichM = "Marco Budinich" }
377 @string{BudiuM = "Mihai Budiu" }
378 @string{BuesingC = "Christina B{\"u}sing" }
379 @string{BuhlerT = "Thomas B{\"u}hler" }
380 @string{BuiTN = "Thang Nguyen Bui" }
381 @string{BulirschR = "Roland Bulirsch" }
382 @string{BungartzH = "Hans-Joachim Bungartz" }
383 @string{BunkeH = "Horst Bunke" }
384 @string{BurgardW = "Wolfram Burgard" }
385 @string{BuriolL = "Luciana Buriol" }
386 @string{BurkardRE = "Rainer E. Burkard" }
387 @string{BurriN = "Nicolas Burri" }
388 @string{BurtRS = "Ronald S.\ Burt" }
389 @string{BuT = "Tian Bu" }
390 @string{ByersJ = "John Byers" }
391 @string{ByrkaJ = "Jaroslaw Byrka" }
393 @string{CaceresR = "Ramon Caceres" }
394 @string{CafieriS = "Sonia Cafieri" }
395 @string{CaflischA = "Amedeo Caflisch" }
396 @string{Caida = "{CAIDA: The Cooperative Association for Internet Data Analysis}" }
397 @string{CaiN = "Ning Cai" }
398 @string{CaldarelliG = "Guido Caldarelli" }
399 @string{CaldwellT = "Tom Caldwell" }
400 @string{CalinescuG = "Gruia Calinescu" }
401 @string{CallawayDS = "Duncan S. Callaway" }
402 @string{CalvertKL = "Kenneth L. Calvert" }
403 @string{CalvoRW = "Roberto Wolfler Calvo" }
404 @string{CantnerU = "Uwe Cantner" }
405 @string{CapobiancoMF = "Michael F. Capobianco" }
406 @string{CapocciA = "Andrea Capocci" }
407 @string{CarchioloV = "V. Carchiolo" }
408 @string{CardeiM = "Mihaela Cardei" }
409 @string{CardeneoA = "Andreas Cardeneo" }
410 @string{CardonA = "A. Cardon" }
411 @string{CarleyKM = "Kathleen M. Carley" }
412 @string{CarlinJB = "John B.\ Carlin" }
413 @string{CarlsonJ = "Josiah Carlson" }
414 @string{CarlssonE = "Erik Carlsson" }
415 @string{CarmelL = "Liran Carmel" }
416 @string{CarmiP = "Paz Carmi" }
417 @string{CarmiS = "Shai Carmi" }
418 @string{CarmonaA = "{\'A}ngeles Carmona" }
419 @string{CarpenterT = "Tami Carpenter" }
420 @string{CarringtonPJ = "Peter J. Carrington" }
421 @string{CarterL = "Larry Carter" }
422 @string{CasagrandeN = "Norman Casagrande" }
423 @string{CasellaG = "George Casella" }
424 @string{CastellanoC = "Claudio Castellano" }
425 @string{CastelliV = "Vittorio Castelli" }
426 @string{CatalyurekU = "Umit Catalyurek" }
427 @string{CederbaumI = "Israel Cederbaum" }
428 @string{ChakrabartiD = "Deepayan Chakrabarti" }
429 @string{ChalmersM = "M. Chalmers" }
430 @string{ChalopinJ = "J{\'e}r{\'e}mie Chalopin" }
431 @string{ChandaA = "Amrita Chanda" }
432 @string{ChandrakasanA = "Anantha Chandrakasan" }
433 @string{ChandranBG = "Bala G. Chandran" }
434 @string{ChangH = "Hyunseok Chang" }
435 @string{ChangJ = "Jae-Hwan Chang" }
436 @string{ChanTM = "Timothy M. Chan" }
437 @string{ChardaireP = "Pierre Chardaire" }
438 @string{CharikarM = "Moses Charikar" }
439 @string{ChartrandG = "Gary Chartrand" }
440 @string{ChataignerF = "Fr{\'e}d{\'e}ric Chataigner" }
441 @string{ChaudhuriS = "Soma Chaudhuri" }
442 @string{ChawlaS = "Shuchi Chawla" }
443 @string{ChayesJ = "Jennifer Chayes" }
444 @string{ChekuriC = "Chandra Chekuri" }
445 @string{ChenCY = "Chieh-Yu Chen" }
446 @string{ChenDZ = "Danny Z. Chen" }
447 @string{ChengC = "C.K. Cheng" }
448 @string{ChengCC = "C. C. Cheng" }
449 @string{ChengD = "David Cheng" }
450 @string{ChengJ = "Jiefeng Cheng" }
451 @string{ChenHo = "Ho-Lin Chen" }
452 @string{ChenJ = "Jian-Jia Chen" }
453 @string{ChenJiamo = "Jiamo Chen" }
454 @string{ChenJianer = "Jianer Chen" }
455 @string{ChenQ = "Qian Chen" }
456 @string{ChenR = "Runsheng Chen" }
457 @string{ChenW = "Wei Chen" }
458 @string{ChenY = "Yubin Chen" }
459 @string{ChenYa = "Yanyan Chen" }
460 @string{ChenYj = "Yijia Chen" }
461 @string{ChenZ = "Zaiben Chen" }
462 @string{CheongO = "Otfried Cheong" }
463 @string{CheriyanJ = "Joseph Cheriyan" }
464 @string{CherkasskyBV = "Boris V. Cherkassky" }
465 @string{ChervonenkisAY = "Alexey Ya. Chervonenkis" }
466 @string{ChevalierC = "C{\'e}dric Chevalier" }
467 @string{ChiangY = "Yi-Ting Chiang" }
468 @string{ChibaN = "Norishige Chiba" }
469 @string{ChickeringM = "Max Chickering" }
470 @string{ChienS = "Steve Chien" }
471 @string{ChimaniM = "Markus Chimani" }
472 @string{ChinFYL = "F. Y. L. Chin" }
473 @string{ChintalapudiKK = "Krishna Kant Chintalapudi" }
474 @string{ChiriacC = "Camelia Chiriac" }
475 @string{ChklovskiiD = "Dmitri Chklovskii" }
476 @string{ChlebikovaJ = "Janka Chleb{\'{\i}}kov{\'a}" }
477 @string{ChoH = "Hyung-Ju Cho" }
478 @string{ChoiD = "Dae-Hyun Choi" }
479 @string{ChoJD = "J. D. Cho" }
480 @string{ChorB = "Benny Chor" }
481 @string{ChoY = "Young-rae Cho" }
482 @string{ChrisohoouE = "Evangelia Chrisohoou" }
483 @string{ChristianoP = "Paul Christiano" }
484 @string{ChristofidesN = "Nicos Christofides" }
485 @string{ChrobakM = "Marek Chrobak" }
486 @string{ChuangRC = "Richie Chih-Nan Chuang" }
487 @string{ChungC = "Chin-Wan Chung" }
488 @string{ChungFRK = "Fan R. K. Chung" }
489 @string{ChunJ = "Jinhee Chun" }
490 @string{ChvatalV = "Va{\v s}ek Chv{\'a}tal" }
491 @string{ChwaK = "Kyung-Yong Chwa" }
492 @string{CiceroneS = "Serafino Cicerone" }
493 @string{ClaffyK = "K. Claffy" }
494 @string{ClarksonKL = "Kenneth L. Clarkson" }
495 @string{ClausetA = "Aaron Clauset" }
496 @string{ClevelandWS = "William S. Cleveland" }
497 @string{CobenaG = "Gregory Cobena" }
498 @string{CodenottiB = "Bruno Codenotti" }
499 @string{CoetzeeFM = "Frans M. Coetzee" }
500 @string{CohenE = "Edith Cohen" }
501 @string{CohenJD = "Johnathan D. Cohen" }
502 @string{CohenR = "Reuven Cohen" }
503 @string{ColbournCJ = "Charles J. Colbourn" }
504 @string{CollinsRL = "Rebecca L. Collins" }
505 @string{ColumbusT = "Tobias Columbus" }
506 @string{CondonA = "Anne Condon" }
507 @string{ConnellJ = "J. Connell" }
508 @string{ConnellyR = "Robert Connelly" }
509 @string{ConradCA = "Charles A. Conrad" }
510 @string{CooganK = "Kevin Coogan" }
511 @string{CookDJ = "Diane J.\ Cook" }
512 @string{CookeK = "K. Cooke" }
513 @string{CookSA = "Stephen A. Cook" }
514 @string{CookSW = "Stuart W. Cook" }
515 @string{CookW = "William Cook" }
516 @string{CooperC = "Colin Cooper" }
517 @string{CoppersmithD = "Don Coppersmith" }
518 @string{CormanSR = "Steven R. Corman" }
519 @string{CormenTH = "Thomas H. Cormen" }
520 @string{CorneDW = "David W. Corne" }
521 @string{CorneilDG = "Derek G. Corneil" }
522 @string{CornelsenS = "Sabine Cornelsen" }
523 @string{CortesC = "Cort{\'e}s, Carmen" }
524 @string{CoverTM = "Thomas M. Cover" }
525 @string{CowenL = "Lenore Cowen" }
526 @string{CoxMAA = "Michael A. A. Cox" }
527 @string{CoxR = "Russ Cox" }
528 @string{CoxTF = "Trevor F.\ Cox" }
529 @string{CrescenziP = "Pierluigi Crescenzi" }
530 @string{CrobakJR = "Joseph R. Crobak" }
531 @string{CrochemoreM = "Maxime Crochemore" }
532 @string{CrossM = "Mark Cross" }
533 @string{CrouchB = "Bradley Crouch" }
534 @string{CsardiG = "G{\'a}bor Cs{\'a}rdi" }
535 @string{CulbersonJC = "Joseph C. Culberson" }
536 @string{CvetkovicDM = "Drago{\v s} M. Cvetkovi{\'c}" }
537 @string{CvijicS = "S. Cvijic" }
538 @string{CychowskiM = "M. Cychowski" }
539 @string{CzajkaT = "Tomek Czajka" }
540 @string{CzajkowskiG = "Grzegorz Czajkowski" }
541 @string{CzygrinowA = "Andrzej Czygrinow" }
543 @string{DabekF = "Frank Dabek" }
544 @string{DahlhausE = "Elias Dahlhaus" }
545 @string{DAlexandriFL = "Fabio Luiz D'Alexandri" }
546 @string{DallAstaL = "Luca Dall'Asta" }
547 @string{DalyF = "F.\ Daly" }
548 @string{DamERv = "Edwin R. van Dam" }
549 @string{DangC = "Chuangyin Dang" }
550 @string{DangeloG = "Gianlorenzo D'Angelo" }
551 @string{DankelmannP = "Peter Dankelmann" }
552 @string{DanonL = "Leon Danon" }
553 @string{DantzigGB = "George B. Dantzig" }
554 @string{DasB = "Bevan Das" }
555 @string{DasGuptaB = "Bhaskar DasGupta" }
556 @string{DasguptaK = "Koustuv Dasgupta" }
557 @string{DaskinMS = "Mark S.\ Daskin" }
558 @string{DasS = "Sandip Das" }
559 @string{DasSK = "Sajal K. Das" }
560 @string{DavidsonR = "Ron Davidson" }
561 @string{DawsonS = "Steve Dawson" }
562 @string{DayalU = "Umeshwar Dayal" }
563 @string{DeanBC = "Brian C. Dean" }
565 @string{deBergM = "Mark de Berg" }
567 @string{DebK = "Kalyanmoy Deb" }
569 @string{deCastroN = "de Castro, Natalia" }
571 @string{DechterR = "Rina Dechter" }
572 @string{DeesJ = "Jonathan Dees" }
574 @string{deFraysseixH = "de Fraysseix, Hubert" }
576 @string{DegenhardtW = "W. Degenhardt" }
577 @string{DehmerM = "Matthias Dehmer" }
578 @string{DehneF = "Frank Dehne" }
579 @string{DehnertJC = "James C. Dehnert" }
580 @string{DelaneyK = "K. Delaney" }
581 @string{DellamicoM = "Mauro Dell'Amico" }
582 @string{DellingD = "Daniel Delling" }
583 @string{DellingG = "G{\"u}nter Delling" }
584 @string{DellingM = "Markus Delling" }
585 @string{DellnitzM = "Michael Dellnitz" }
586 @string{DeLosRiosP = "De Los Rios, Paolo" }
587 @string{DelprattO = "O'Neil Delpratt" }
588 @string{DemaineED = "Erik D. Demaine" }
589 @string{DemestichasK = "K. Demestichas" }
590 @string{DemetrescuC = "Camil Demetrescu" }
591 @string{DEmidioM = "Mattia D'Emidio" }
592 @string{DemiryurekU = "Ugur Demiryurek" }
593 @string{DenardoEV = "Eric V. Denardo" }
594 @string{DeniseA = "Alain Denise" }
595 @string{DeoN = "Narsingh Deo" }
596 @string{DerbelB = "Bilel Derbel" }
597 @string{DerenyiI = "Imre Der{\'e}nyi" }
598 @string{DesaiD = "Devendra Desai" }
599 @string{DeshpandeA = "Amit Deshpande" }
600 @string{DesrochersM = "Martin Desrochers" }
601 @string{DesrosiersJ = "Jacques Desrosiers" }
602 @string{DeussenO = "Oliver Deussen" }
603 @string{DeutschM = "Morton Deutsch" }
604 @string{DevillersO = "Olivier Devillers" }
605 @string{DevineK = "Karen Devine" }
606 @string{DhandapaniR = "Raghavan Dhandapani" }
607 @string{DhawanA = "Akshaye Dhawan" }
608 @string{DialloM = "Madiagne Diallo" }
609 @string{DialRB = "Robert B. Dial" }
610 @string{DiazGuileraA = "Albert D{\'i}az-Guilera" }
611 @string{DiBattistaG = "Di Battista, Giuseppe" }
612 @string{DibbeltJ = "Julian Dibbelt" }
613 @string{DidimoW = "Walter Didimo" }
614 @string{DiehlS = "Stephan Diehl" }
615 @string{DiekmannR = "Ralf Diekmann" }
616 @string{DiestelR = "Reinhard Diestel" }
617 @string{DietzfelbingerM = "Martin Dietzfelbinger" }
618 @string{DiGiacomoE = "Di Giacomo, Emilio" }
619 @string{DijkstraEW = "Edsger W. Dijkstra" }
620 @string{DijkTv = "Thomas van Dijk" }
621 @string{DillenburgJ = "John F. Dillenburg" }
622 @string{DillencourtMB = "Michael B. Dillencourt" }
623 @string{DillmannR = "R{\"u}diger Dillmann" }
624 @string{DillS = "Stephen Dill" }
625 @string{DingCHQ = "Ding, Chris H. Q." }
626 @string{DingG = "Guoli Ding" }
627 @string{DinhTN = "Thang N. Dinh" }
628 @string{DinitzY = "Yefim Dinitz" }
629 @string{DiracGA = "Gabriel A. Dirac" }
630 @string{DisserY = "Yann Disser" }
631 @string{DiStefanoG = "Gabriele Di Stefano" }
632 @string{DiZ = "Zengru Di" }
633 @string{DjidjevHN = "Hristo N. Djidjev" }
634 @string{DoarMB = "Matthew B. Doar" }
635 @string{DoddiS = "Srinivas Doddi" }
636 @string{DoenhardtJ = "J{\"u}rgen Doenhardt" }
637 @string{DogrusozU = "Ugur Dogrus{\"o}z" }
638 @string{DohertyL = "Lance Doherty" }
639 @string{DolinskiK = "Kara Dolinski" }
640 @string{DollC = "Christof Doll" }
641 @string{DollevoetT = "Twan Dollevoet" }
642 @string{DomschkeW = "Wolfgang Domschke" }
643 @string{DonahooMJ = "Michael J. Donahoo" }
644 @string{DonathWE = "William E. Donath" }
645 @string{DonatiAV = "Alberto V. Donati" }
646 @string{DondiR = "Riccardo Dondi" }
647 @string{DongarraJ = "Jack Dongarra" }
648 @string{DongenS = "van Dongen, Stijn M." }
649 @string{DongQ = "Qunfeng Dong" }
650 @string{DongY = "Yingfei Dong" }
651 @string{DongZY = "Zhao Yang Dong" }
652 @string{DoobM = "Michael Doob" }
653 @string{DoreianP = "Patrick Doreian" }
654 @string{DornF = "Frederic Dorn" }
655 @string{DorogovtsevSN = "Sergey N. Dorogovtsev" }
656 @string{DoslicT = "Tomislav Do{\v s}li{\' c}" }
657 @string{DoulkeridisC = "Christos Doulkeridis" }
658 @string{DowneyRG = "Rodney G. Downey" }
659 @string{DreherS = "S. Dreher" }
660 @string{DreierT = "Thomas Dreier" }
661 @string{DrewsF = "Florian Drews" }
662 @string{DrexlA = "Andreas Drexl" }
663 @string{DreyfusSE = "Stuart E. Dreyfus" }
664 @string{DreznerZ = "Zvi Drezner" }
665 @string{DrineasP = "Petros Drineas" }
666 @string{DubanovAV = "Alexander V. Dubanov" }
667 @string{DubesRC = "Richard C. Dubes" }
668 @string{DucheneautN = "Nicolas Ducheneaut" }
669 @string{DuchJ = "Jordi Duch" }
670 @string{DuchonP = "Philippe Duchon" }
671 @string{DuDZ = "Ding-Zhu Du" }
672 @string{DuffusD = "D. Duffus" }
673 @string{DuH = "Haifeng Du" }
674 @string{DuijnMAJ = "van Duijn, Marijtje A.J." }
675 @string{DujmovicV = "Vida Dujmovi{\'c}" }
676 @string{DuncanCA = "Christian A. Duncan" }
677 @string{DunlaingCO = "Colm {\'O} D{\'u}nlaing" }
678 @string{DurstenfeldR = "Richard Durstenfeld" }
679 @string{DuschlM = "Matthias Duschl" }
680 @string{DworkC = "Cynthia Dwork" }
681 @string{DwyerRA = "Rex A. Dwyer" }
682 @string{DwyerT = "Tim Dwyer" }
684 @string{EadesP = "Peter Eades" }
685 @string{EberhardF = "Felix Eberhard" }
686 @string{EbertA = "Achim Ebert" }
687 @string{EbertJ = "J{\"u}rgen Ebert" }
688 @string{EdmondsJ = "Jack Edmonds" }
689 @string{EFClementiA = "Andrea E.~F.~Clementi" }
690 @string{EfentakisA = "Alexandros Efentakis" }
691 @string{EffingerP = "Philip Effinger" }
692 @string{EfratA = "Alon Efrat" }
693 @string{EgervaryE = "Eugene Egerv\'ary" }
694 @string{EguiluzVM = "V{'i}ctor M. Egu{'i}luz" }
695 @string{EhrgottM = "Matthias Ehrgott" }
696 @string{EichelbergerH = "Holger Eichelberger" }
697 @string{EidenbenzS = "Stephan Eidenbenz" }
698 @string{EigenwilligA = "Arno Eigenwillig" }
699 @string{EiglspergerM = "Markus Eiglsperger" }
700 @string{EisenbrandF = "Friedrich Eisenbrand" }
701 @string{EisenstatD = "David Eisenstat" }
702 @string{EisnerJ = "Jochen Eisner" }
703 @string{El-HamdouchiA = "Abdelmoula El-Hamdouchi" }
704 @string{ElAbbadiA = "Amr {El~Abbadi}" }
705 @string{EliasP = "Peter Elias" }
706 @string{ElmaghrabySE = "Salah E. Elmaghraby" }
707 @string{ElmasryA = "Amr Elmasry" }
708 @string{ElsaesserR = "Robert Els{\"a}sser" }
709 @string{EmanuelD = "Dotan Emanuel" }
710 @string{EmdenWeinertT = "Thomas Emden-Weinert" }
711 @string{Emmert-StreibF = "Frank Emmert-Streib" }
712 @string{EmmettMR = "Mark R. Emmett" }
713 @string{EngebretsenL = "Lars Engebretsen" }
714 @string{EngelsmanEC = "E. C. Engelsman" }
715 @string{EnnisJG = "James G. Ennis" }
716 @string{EnsorA = "Andrew Ensor" }
717 @string{EppsteinD = "David Eppstein" }
718 @string{EpsteinL = "Leah Epstein" }
719 @string{EraH = "Hiroshi Era" }
720 @string{ErdoesP = "Paul Erd{\H o}s" }
721 @string{ErenT = "Tolga Eren" }
722 @string{ErezK = "Keren Erez" }
723 @string{ErlebachT = "Thomas Erlebach" }
724 @string{ErtenC = "Cesim Erten" }
725 @string{ErtlG = "Gerhard Ertl" }
726 @string{ErwigM = "Martin Erwig" }
727 @string{EsfahanianAH = "Abdol-Hossein Esfahanian" }
728 @string{EssaI = "Irfan Essa" }
729 @string{EstrinD = "Deborah Estrin" }
730 @string{EswaranKP = "{Kapali P.} Eswaran" }
731 @string{EubankS = "Stephen Eubank" }
732 @string{EulerL = "Leonhard Euler" }
733 @string{EvansJR = "Jim R. Evans" }
735 @string{eVB = "BITKOM e.V." }
737 @string{EvenG = "Guy Even" }
738 @string{EvenS = "Shimon Even" }
739 @string{EverettMG = "Martin G.\ Everett" }
741 @string{eVMK = "M{\"u}nchner Kreis e.V." }
743 @string{FaberV = "Vance Faber" }
744 @string{FabregaJ = "Josep F{\`a}brega" }
745 @string{FabrikantA = "Alex Fabrikant" }
746 @string{FaginR = "Ronald Fagin" }
747 @string{FahrmeirL = "Ludwig Fahrmeir" }
748 @string{FakcharoenpholJ = "Jittat Fakcharoenphol" }
749 @string{FaloutsosC = "Christos Faloutsos" }
750 @string{FaloutsosM = "Michalis Faloutsos" }
751 @string{FaloutsosP = "Petros Faloutsos" }
752 @string{FandelG = "G{\"u}nter Fandel" }
753 @string{FanH = "Hongbing Fan" }
754 @string{FanY = "Ying Fan" }
755 @string{FarinaM = "Marco Farina" }
756 @string{FarkasI = "Ill{\'e}s Farkas" }
757 @string{FarshiM = "Mohammad Farshi" }
758 @string{FaryI = "Istv{\'a}n F{\'a}ry" }
759 @string{FasuloD = "Daniel Fasulo" }
760 @string{FaustK = "Katherine Faust" }
761 @string{FederT = "Tom{\'a}s Feder" }
762 @string{FeigenbaumJ = "Joan Feigenbaum" }
763 @string{FeigeU = "Uriel Feige" }
764 @string{FeinsteinA = "Amiel Feinstein" }
765 @string{FeketeSP = "S{\'a}ndor P. Fekete" }
766 @string{FeldmanMW = "Marcus W.\ Feldman" }
767 @string{FeldmannA = "Anja Feldmann" }
768 @string{FeldmannP = "P. Feldmann" }
769 @string{FellowsMR = "Michael R. Fellows" }
770 @string{FelsnerS = "Stefan Felsner" }
771 @string{FengQ = "Qing-Wen Feng" }
772 @string{FengX = "Xiangyang Feng" }
773 @string{FennerT = "Trevor Fenner" }
774 @string{FerligojA = "Anu{\v s}ka Ferligoj" }
775 @string{FerligojAs = "Anu{\v s}ka Ferligoj" }
776 @string{FernandezA = "Alberto Fernandez" }
777 @string{FernandezJC = "Jean-Claude Fernandez" }
778 @string{FernauH = "Henning Fernau" }
779 @string{FerraginaP = "Paolo Ferragina" }
780 @string{FerrarWL = "William L. Ferrar" }
781 @string{FerreiraA = "Afonso Ferreira" }
782 @string{FestaP = "Paola Festa" }
783 @string{FeuersteinE = "E. Feuerstein" }
784 @string{FialaJ = "Ji{\v r}{\'i} Fiala" }
785 @string{FialkoS = "Sergej Fialko" }
786 @string{FiatA = "Amos Fiat" }
787 @string{FiducciaCM = "C. M. Fiduccia" }
788 @string{FiedlerH = "Herbert Fiedler" }
789 @string{FiedlerM = "Miroslav Fiedler" }
790 @string{FieldsS = "Stanley Fields" }
791 @string{FienbergSE = "Stephen E. Fienberg" }
792 @string{FiessC = "Christian Fiess" }
793 @string{FineP = "Peter Fine" }
794 @string{FinkM = "Martin Fink" }
795 @string{FinocchiI = "Irene Finocchi" }
796 @string{FiolMA = "Miguel A. Fiol" }
797 @string{FischettiM = "Matteo Fischetti" }
798 @string{FisherRA = "Ronald Aylmer Fisher" }
799 @string{FiskCJ = "C. J. Fisk" }
800 @string{FiskLA = "Lee Ann Fisk" }
801 @string{FiskS = "Stephen Fisk" }
802 @string{FjallstromP = "Per-Olof Fj{\"a}llstr{\"o}m" }
803 @string{FlajoletP = "Philippe Flajolet" }
804 @string{FlakeGW = "Gary William Flake" }
805 @string{FlanneryBP = "Brian P. Flannery" }
806 @string{FleischerD = "Daniel Fleischer" }
807 @string{FleischerL = "Lisa Fleischer" }
808 @string{FleischerR = "Rudolf Fleischer" }
809 @string{FlemingPJ = "Peter J. Fleming" }
810 @string{FlinsenbergIC = "Ingrid C.M. Flinsenberg" }
811 @string{FloaterMS = "Michael S. Floater" }
812 @string{FlotterodG = "Gunnar Fl{\"o}tter{\"o}d" }
813 @string{FloydRW = "Robert W. Floyd" }
814 @string{FlynnPJ = "Patrick J. Flynn" }
815 @string{FoggiaP = "Pasquale Foggia" }
816 @string{FominFV = "Fedor V. Fomin" }
817 @string{FordLR = "Ford, Jr., Lester R." }
818 @string{ForemanRK = "Robert K. Foreman" }
819 @string{FormannM = "Michael Formann" }
820 @string{ForsterM = "Michael Forster" }
821 @string{FortinS = "Scott Fortin" }
822 @string{FortunatoS = "Santo Fortunato" }
823 @string{FoschiniL = "Luca Foschini" }
824 @string{FossmeierU = "Ulrich F{\"o}{\ss}meier" }
825 @string{FosterBL = "Brian L. Foster" }
826 @string{FosterI = "Ian Foster" }
827 @string{FotiF = "Fletcher Foti" }
828 @string{FoussF = "Fran{\c{c}}ois Fouss" }
829 @string{Fox-EpsteinE = "Eli Fox-Epstein" }
830 @string{FoxBL = "Bennett L. Fox" }
831 @string{FoxG = "Geoffrey Fox" }
832 @string{FraigniaudP = "Pierre Fraigniaud" }
833 @string{FrancisMC = "Mathew C. Francis" }
834 @string{FrancisRL = "Richard L.\ Francis" }
835 @string{FrankA = "Andr{\'a}s Frank" }
836 @string{FrankeR = "Robert Franke" }
837 @string{FrankH = "Howard Frank" }
838 @string{FrankKA = "Kenneth A. Frank" }
839 @string{FrankO = "Ove Frank" }
840 @string{FrankS = "Stephen Frank" }
841 @string{FratiF = "Fabrizio Frati" }
842 @string{FredAL = "Ana L. Fred" }
843 @string{FredeL = "Lennart Frede" }
844 @string{FredericksonGN = "Greg N. Frederickson" }
845 @string{FredmanML = "Michael L. Fredman" }
846 @string{FreemanLC = "Linton Clarke Freeman" }
847 @string{FreidingerM = "Myriam Freidinger" }
848 @string{FrickAK = "Arne K.\ Frick" }
849 @string{FridmanAA = "A. A. Fridman" }
850 @string{FriedkinNE = "Noah E. Friedkin" }
851 @string{FriedlandS = "Shmuel Friedland" }
852 @string{FrietschR = "Rainer Frietsch" }
853 @string{FriezeAM = "Alan M. Frieze" }
854 @string{FrigioniD = "Daniele Frigioni" }
855 @string{FrischIT = "Ivan T. Frisch" }
856 @string{FruchtermanTMJ = "Thomas M. J. Fruchterman" }
857 @string{FuB = "Bin Fu" }
858 @string{FuchsF = "Fabian Fuchs" }
859 @string{FuerediZ = "Zolt{\'a}n F{\"u}redi" }
860 @string{FujisawaT = "Toshio Fujisawa" }
861 @string{FukunagaT = "Takuro Fukunaga" }
862 @string{FuL = "L. Fu" }
863 @string{FulekR = "Radoslav Fulek" }
864 @string{FulkersonDR = "Delbert R. Fulkerson" }
865 @string{FunCT = "C. T. Fan" }
866 @string{FunkeS = "Stefan Funke" }
867 @string{FurerM = "Martin F{\"u}rer" }
868 @string{FusyE = "{\'E}ric Fusy" }
870 @string{GabowHN = "Harold N. Gabow" }
871 @string{GaedekeT = "Tobias G{\"a}deke" }
872 @string{GaertlerM = "Marco Gaertler" }
873 @string{GajerP = "Pawel Gajer" }
874 @string{GalilZ = "Zvi Galil" }
875 @string{GallaiT = "Tibor Gallai" }
876 @string{GalloG = "Giorgio Gallo" }
877 @string{GalT = "T. Gal" }
878 @string{GaltierJ = "J. Galtier" }
879 @string{GambardellaLM = "Luca M. Gambardella" }
880 @string{GambosiG = "Giorgio Gambosi" }
881 @string{GandhiR = "Rajiv Gandhi" }
882 @string{GandibleuxX = "Xavier Gandibleux" }
883 @string{GanesanD = "Deepak Ganesan" }
884 @string{GansnerER = "Emden R. Gansner" }
885 @string{GaoJ = "Jie Gao" }
886 @string{GaoJun = "Jun Gao" }
887 @string{GaoL = "Lixin Gao" }
888 @string{Garcia-Luna-AcevesJJ = "J. J. Garcia-Luna-Aceves" }
889 @string{GardinerEJ = "Eleanor J. Gardiner" }
890 @string{GareyMR = "Michael R. Garey" }
891 @string{GargA = "Ashim Garg" }
892 @string{GargN = "Naveen Garg" }
893 @string{GarlandM = "Michael Garland" }
894 @string{GarridoMA = "Garrido, M. {\'A}ngeles" }
895 @string{GattoM = "Michael Gatto" }
896 @string{GaudiotJL = "Jean-Luc Gaudiot" }
897 @string{GaulW = "Wolfgang Gaul" }
898 @string{GavlasH = "Heather Gavlas" }
899 @string{GavoilleC = "Cyril Gavoille" }
900 @string{GavrilovaM = "Marina Gavrilova" }
901 @string{GawronC = "Christian Gawron" }
902 @string{GebhardtA = "Andreas Gebhardt" }
903 @string{GehlsenB = "Bj{\"o}rn Gehlsen" }
904 @string{GehrkeJ = "Johannes Gehrke" }
905 @string{GeisbergerR = "Robert Geisberger" }
906 @string{GelattCD = "C. D. Gelatt" }
907 @string{GellerD = "Dennis Geller" }
908 @string{GelmanA = "Andrew Gelman" }
909 @string{GemsaA = "Andreas Gemsa" }
910 @string{GendreauM = "Michel Gendreau" }
911 @string{GeraetsF = "Frank Geraets" }
912 @string{GerritsD = "Dirk Gerrits" }
913 @string{Geyer-SchulzA = "Andreas Geyer-Schulz" }
914 @string{GeyerM = "Markus Geyer" }
915 @string{GhoshJ = "Joydeep Ghosh" }
916 @string{GiannakopoulouK = "Kalliopi Giannakopoulou" }
917 @string{GibbonsP = "Phillip Gibbons" }
918 @string{GibsonD = "David Gibson" }
919 @string{GilbargD = "David Gilbarg" }
920 @string{GilbertEN = "Horst Gilbert" }
921 @string{GilesCL = "C.\ Lee Giles" }
922 @string{GilksWR = "Walter R.\ Gilks" }
923 @string{GillesRP = "Gilles, Robert P." }
924 @string{GilmorePC = "Paul C. Gilmore" }
925 @string{GimenezO = "Omar Gim{\'e}nez" }
926 @string{GiniC = "Corrado Gini" }
927 @string{GinkelA = "Andreas Ginkel" }
928 @string{GionisA = "Aristides Gionis" }
929 @string{GiordanoF = "Francesco Giordano" }
930 @string{GiotisI = "Ioannis Giotis" }
931 @string{GiovanniLD = "Luigi De Giovanni" }
932 @string{GiraltF = "Francesc Giralt" }
933 @string{GirardA = "Andre Girard" }
934 @string{GiridharA = "Arvind Giridhar" }
935 @string{GirvanM = "Michelle Girvan" }
936 @string{GkantsidisC = "Christos Gkantsidis" }
937 @string{GlanceN = "Natalie Glance" }
938 @string{GlaserD = "Dieter Glaser" }
939 @string{GlausB = "Bj{\"o}rn Glaus" }
940 @string{GlazJ = "Joseph Glaz" }
941 @string{GleiserP = "Pablo Gleiser" }
942 @string{GmbHEC = "EICT GmbH" }
943 @string{GmbHTI = "TNS Infratest GmbH" }
944 @string{GoddardW = "Wayne Goddard" }
945 @string{GodsilC = "Chris Godsil" }
946 @string{GoelA = "Ashish Goel" }
947 @string{GoerigkM = "Marc Goerigk" }
948 @string{GoerkeR = "Robert G{\"o}rke" }
949 @string{GogateV = "Vibhav Gogate" }
950 @string{GohK = "Kwang-Il Goh" }
951 @string{GoldbergAV = "Andrew V. Goldberg" }
952 @string{GoldenbergDK = "David K. Goldenberg" }
953 @string{GoldnerA = "Anita Goldner" }
954 @string{GoldsmithDL = "Donald L. Goldsmith" }
955 @string{GoldwasserMH = "Michael H. Goldwasser" }
956 @string{GolinelliO = "Olivier Golinelli" }
957 @string{GolubGH = "Gene H.\ Golub" }
958 @string{GomezS = "Sergio Gomez" }
959 @string{GomoryRE = "Ralph E. Gomory" }
960 @string{GoncalvesD = "Daniel Gon{\c{c}}alves" }
961 @string{GongiW = "Weibo Gongi" }
962 @string{GonzalezTF = "Teofilo F.\ Gonzalez" }
963 @string{GoodmanA = "Arnold Goodman" }
964 @string{GoodmanJE = "Jacob E.\ Goodman" }
965 @string{GoodrichMT = "Michael T. Goodrich" }
966 @string{GoriM = "Gori, Marco" }
967 @string{GortlerSJ = "Steven J. Gortler" }
968 @string{GotoS = "Susumu Goto" }
969 @string{GotsmanC = "Craig Gotsman" }
970 @string{GottliebL = "Lee-Ad Gottlieb" }
971 @string{GoussevskaiaO = "Olga Goussevskaia" }
972 @string{GoverdeR = "Rob Goverde" }
973 @string{GovindanR = "Ramesh Govindan" }
974 @string{GovindarajuN = "Naga Govindaraju" }
975 @string{GovorunVM = "Vadim M. Govorun" }
976 @string{GraetzerG = "George Gr{\"a}tzer" }
977 @string{GrafH = "Holger Graf" }
978 @string{GrahamRL = "Ronald L. Graham" }
979 @string{GrandoniF = "Fabrizio Grandoni" }
980 @string{GranovetterMS = "Mark S.\ Granovetter" }
981 @string{GrassW = "Werner Grass" }
982 @string{GribbleSD = "Steven D.\ Gribble" }
983 @string{GriggsJR = "Jerrold R. Griggs" }
984 @string{GrigoriadisMD = "Michail D. Grigoriadis" }
985 @string{GrilliL = "Luca Grilli" }
986 @string{GrimaCI = "Grima, Clara I." }
987 @string{GrimmerM = "Martin Grimmer" }
988 @string{GrimmettG = "Geoffrey Grimmett" }
989 @string{GrinsteadCM = "Charles Miller Grinstead" }
990 @string{GroeplC = "Clemens Gr{\"o}pl" }
991 @string{GroneR = "Robert Grone" }
992 @string{GroppW = "William Gropp" }
993 @string{GrossiR = "Roberto Grossi" }
994 @string{GrossJL = "Jonathan L. Gross" }
995 @string{GrossM = "Markus Gross" }
996 @string{GrossOA = "O. A. Gross" }
997 @string{GrotschelM = "M. Gr{\"o}tschel" }
998 @string{GruenbaumB = "Branko Gr{\"u}nbaum" }
999 @string{GruppH = "Hariolf Grupp" }
1001 @string{gtf = "{General Transit Feed}" }
1003 @string{GuanLJ = "Lin Jie Guan" }
1004 @string{GudenbergJW = "J{\"u}rgen Wolff Gudenberg" }
1005 @string{GudmundssonJ = "Joachim Gudmundsson" }
1006 @string{GuentherO = "Oliver G{\"u}nther" }
1007 @string{GuidobaldiC = "Corrado Guidobaldi" }
1008 @string{GuillaumeJ = "Jean-Loup Guillaume" }
1009 @string{GuimeraR = "Roger Guimer{\`a}" }
1010 @string{GuM = "Ming Gu" }
1011 @string{GummadiPK = "P. Krishna Gummadi" }
1012 @string{GunkelT = "Thorsten Gunkel" }
1013 @string{GuptaA = "Anupam Gupta" }
1014 @string{GupteN = "Neelima Gupte" }
1015 @string{GuruswamiV = "Venkatesan Guruswami" }
1016 @string{GusfieldD = "Dan Gusfield" }
1017 @string{GutirrezE = "Eli{\'e}cer Guti{\'e}rrez" }
1018 @string{GutmanRJ = "Ronald J. Gutman" }
1019 @string{GuttmanA = "Antonin Guttman" }
1020 @string{GutwengerC = "Carsten Gutwenger" }
1021 @string{GuY = "Yu Gu" }
1022 @string{GyugyiL = "Laszlo Gyugyi" }
1024 @string{HaaseP = "Patti Haase" }
1025 @string{HabibM = "Michel Habib" }
1026 @string{HackbuschW = "Wolfgang Hackbusch" }
1028 @string{hacon = "{HaCon - Ingenieurgesellschaft mbH}" }
1030 @string{HaemersW = "Willem H.\ Haemers" }
1031 @string{HageP = "Per Hage" }
1032 @string{HagerupT = "Torben Hagerup" }
1033 @string{HaghaniA = "Ali Haghani" }
1034 @string{HahnG = "Ge{\v n}a Hahn" }
1035 @string{HaibtLM = "Lois M. Haibt" }
1036 @string{HajiaghayiM = "MohammadTaghi Hajiaghayi" }
1037 @string{HakimiSL = "Hakimi, S. Louis" }
1038 @string{HalinR = "Rudolf Halin" }
1039 @string{HalkidiM = "Maria Halkidi" }
1040 @string{HallA = "Alexander Hall" }
1041 @string{HalldorssonMM = "Magn{\'u}s M. Halld{\'o}rsson" }
1042 @string{HallKM = "Kenneth M. Hall" }
1043 @string{HallW = "Wendy Hall" }
1044 @string{HalperinE = "Eran Halperin" }
1045 @string{HalpernJ = "Joseph Halpern" }
1046 @string{HalseyE = "E. Halsey" }
1047 @string{HamacherHW = "Horst W.\ Hamacher" }
1048 @string{HamannM = "Michael Hamann" }
1049 @string{HamerJ = "John Hamer" }
1050 @string{HamF = "Frank van Ham" }
1051 @string{HammerPL = "Peter L. Hammer" }
1052 @string{HanCC = "Chih-Chieh Han" }
1053 @string{HandDJ = "D.\ J.\ Hand" }
1054 @string{HandleyM = "Mark Handley" }
1055 @string{HanebeckUD = "Uwe D. Hanebeck" }
1056 @string{HannemanR = "Robert Hanneman" }
1057 @string{HansenP = "Pierre Hansen" }
1058 @string{HanSK = "Seung Kee Han" }
1059 @string{HanusseN = "Nicolas Hanusse" }
1060 @string{HaoJ = "Jianxiu Hao" }
1061 @string{HaoMC = "Ming C.\ Hao" }
1062 @string{Har-PeledS = "Sariel Har-Peled" }
1063 @string{HaraborD = "Daniel Harabor" }
1064 @string{HaralambidesJ = "James Haralambides" }
1065 @string{HararyF = "Frank Harary" }
1066 @string{HardingGC = "G. C. Harding" }
1067 @string{HarelD = "David Harel" }
1068 @string{HargensLL = "L. L. Hargens" }
1069 @string{HariharanR = "Ramesh Hariharan" }
1070 @string{HarperR = "Richard Harper" }
1071 @string{HarrelsonC = "Chris Harrelson" }
1072 @string{HarrisM = "Mark Harris" }
1073 @string{HarrisonMA = "Michael A. Harrison" }
1074 @string{HartensteinH = "Hannes Hartenstein" }
1075 @string{HartiganJA = "John A.\ Hartigan" }
1076 @string{HartmannT = "Tanja Hartmann" }
1077 @string{HartPE = "Peter E. Hart" }
1078 @string{HartuvE = "Erez Hartuv" }
1079 @string{HartvigsenD = "David Hartvigsen" }
1080 @string{HartwigS = "Stephan Hartwig" }
1081 @string{HartyM = "Martha Harty" }
1082 @string{HasegawaT = "Toshiharu Hasegawa" }
1083 @string{HaselmayrJ = "Julian Haselmayr" }
1084 @string{HashimotoH = "Hideki Hashimoto" }
1085 @string{HashimotoT = "T. Hashimoto" }
1086 @string{HassinR = "Refael Hassin" }
1087 @string{HastadJ = "Johan H{\r a}stad" }
1088 @string{HatzisKP = "Kostas P. Hatzis" }
1089 @string{HaunertJ = "Jan-Henrik Haunert" }
1090 @string{HausbergerS = "Stefan Hausberger" }
1091 @string{HaveliwalaTH = "Haveliwala, Taher H." }
1092 @string{HavelV = "Vaclav Havel" }
1093 @string{HaverkortH = "Herman Haverkort" }
1094 @string{HavlinS = "Shlomo Havlin" }
1095 @string{HealeyCG = "Christopher G. Healey" }
1096 @string{HeaphyR = "Robert Heaphy" }
1097 @string{HechtPK = "P. K. Hecht" }
1098 @string{HeckbertPS = "Paul S. Heckbert" }
1099 @string{HeckermanD = "David Heckerman" }
1100 @string{HeH = "Hongmei He" }
1101 @string{HeHuan = "Huan He" }
1102 @string{HeidemannJ = "John Heidemann" }
1103 @string{HeilGH = "Greg H.\ Heil" }
1104 @string{HeilpornG = "Geraldine Heilporn" }
1105 @string{HeinM = "Matthias Hein" }
1106 @string{HeinzelmanWR = "Wendi Rabiner Heinzelman" }
1107 @string{HeiseDR = "D. R. Heise" }
1108 @string{HelbingD = "Dirk Helbing" }
1109 @string{HeldenG = "Guido Helden" }
1110 @string{HellP = "Pavol Hell" }
1111 @string{HeM = "Meng He" }
1112 @string{HendricksonB = "Bruce Hendrickson" }
1113 @string{HendryG = "George R. T. Hendry" }
1114 @string{HenningMA = "Michael A. Henning" }
1115 @string{HenzingerM = "Monika R.\ Henzinger" }
1116 @string{HerbstA = "Andre Herbst" }
1117 @string{HermanI = "Ivan Herman" }
1118 @string{HernandezG = "Hern{\'a}ndez, Gregorio" }
1119 @string{HershbergerJ = "John Hershberger" }
1120 @string{HertelA = "Alex Hertel" }
1121 @string{HertelS = "Stefan Hertel" }
1122 @string{HerzogO = "Otthein Herzog" }
1123 @string{HesselM = "Mirko {Hessel-von Molo}" }
1124 @string{HeuvelJ = "Jan van den Heuvel" }
1125 @string{HeviaH = "Hector Hevia" }
1126 @string{HeW = "Weiqing He" }
1127 @string{HeX = "He, Xiaofeng" }
1128 @string{HeXi = "Xin He" }
1129 @string{HGB = "Benjamin H. Good" }
1130 @string{HibbsM = "Matthew Hibbs" }
1131 @string{HieM = "M. Hie" }
1132 @string{HilgerM = "Moritz Hilger" }
1133 @string{HillerB = "Benjamin Hiller" }
1134 @string{HillFSJr = "F. S. {Hill Jr.}" }
1135 @string{HimsoltM = "Michael Himsolt" }
1136 @string{HingoraniNG = "Narain G. Hingorani" }
1137 @string{HinzeS = "Sybille Hinze" }
1138 @string{HircheS = "S. Hirche" }
1139 @string{HirschC = "Colin Hirsch" }
1140 @string{HjaltasonG = "G\'{\i}sli Hjaltason" }
1141 @string{HochbaumDS = "Dorit S. Hochbaum" }
1142 @string{HoeferM = "Martin H{\"o}fer" }
1143 @string{HoeffdingW = "Wassily Hoeffding" }
1144 @string{HoelldoberS = "Steffen H{\"o}lldober" }
1145 @string{HoffmanAJ = "Alan J. Hoffman" }
1146 @string{HoffmannM = "Michael Hoffmann" }
1147 @string{HoffmannR = "Roberto Hoffmann" }
1148 @string{HoffmannRalf = "Ralf Hoffmann" }
1149 @string{HohltB = "Barbara Hohlt" }
1150 @string{HolbertK = "Karen S. Holbert" }
1151 @string{HolderLB = "Lawrence B.\ Holder" }
1152 @string{HollandPW = "Paul W.\ Holland" }
1153 @string{HolldoblerS = "Steffen H{\"o}lldobler" }
1154 @string{HolmeP = "Petter Holme" }
1155 @string{HolmerinJ = "Jonas Holmerin" }
1156 @string{HolmJ = "Jacob Holm" }
1157 @string{HolmstromE = "Erik Holmstr{\"o}m" }
1158 @string{HoltenD = "Danny Holten" }
1159 @string{HoltgreweM = "Manuel Holtgrewe" }
1160 @string{HolzapfelK = "Klaus Holzapfel" }
1161 @string{HolzerM = "Martin Holzer" }
1162 @string{HolzerS = "Stephan Holzer" }
1163 @string{HongS = "Seok-Hee Hong" }
1164 @string{HoogeveenH = "Han Hoogeveen" }
1165 @string{HooryS = "Shlomo Hoory" }
1166 @string{HopcroftJE = "John E. Hopcroft" }
1167 @string{HopnerM = "Martin H{\"o}pner" }
1168 @string{HoraudR = "Radu Horaud" }
1169 @string{HornI = "Ilan Horn" }
1170 @string{HorsterP = "Patrick Horster" }
1171 @string{HorvitzE = "Eric Horvitz" }
1172 @string{HoTB = "Tu Bao Ho" }
1173 @string{HotellingH = "Harold Hotelling" }
1174 @string{HotzG = "G{\"u}nter Hotz" }
1175 @string{HougardyS = "Stefan Hougardy" }
1176 @string{HoyosJRC = "Jose R.C. Hoyos" }
1177 @string{HromkovicJ = "Juraj Hromkovic" }
1178 @string{HsuM = "Min-Yao Hsu" }
1179 @string{HsuT = "{Tsan-sheng} Hsu" }
1180 @string{HsuW = "Wen-Lian Hsu" }
1181 @string{HuaC = "Cunqing Hua" }
1182 @string{HuangC = "Chi-Fu Huang" }
1183 @string{HuangL = "Lin Huang" }
1184 @string{HuangP = "Polly Huang" }
1185 @string{HuangQL = "Q. L. Huang" }
1186 @string{HuangX = "Xiaohan Huang" }
1187 @string{HuangXi = "Xiaodi Huang" }
1188 @string{HuangYW = "Yun-Wu Huang" }
1189 @string{HuaQ = "Qiang-Sheng Hua" }
1190 @string{HubbellCH = "Charles H.\ Hubbell" }
1191 @string{HubermanBA = "Bernardo A. Huberman" }
1192 @string{HubnerF = "Florian H{\"u}bner" }
1193 @string{HuffakerB = "Bradley Huffaker" }
1194 @string{HuismanD = "Dennis Huisman" }
1195 @string{HuismanM = "Mark Huisman" }
1196 @string{HummonNP = "Norman P. Hummon" }
1197 @string{HungY = "Ya-Fei Hung" }
1198 @string{HurtadoF = "Ferran Hurtado" }
1199 @string{HuS = "Songnian Hu" }
1200 @string{HusbandsP = "Husbands, Parry" }
1201 @string{HustonG = "Geoff Huston" }
1202 @string{HuTC = "T.C. Hu" }
1203 @string{HutchinsonAR = "Allan R. Hutchinson" }
1204 @string{HutP = "Piet Hut" }
1205 @string{HutschenreutherH = "H.\ Hutschenreuther" }
1206 @string{HuX = "Xiaohua Hu" }
1207 @string{HuY = "Yifan Hu" }
1208 @string{HwangW = "Woo-chang Hwang" }
1210 @string{IaconoJ = "John Iacono" }
1211 @string{IbarakiT = "Toshihide Ibaraki" }
1212 @string{IbarraOH = "Oscar H. Ibarra" }
1213 @string{IchouaS = "Soumia Ichoua" }
1214 @string{IdekerT = "Trey Ideker" }
1215 @string{IdeM = "Mikio Ide" }
1216 @string{IguchiT = "Takashi Iguchi" }
1217 @string{IhlerE = "Edmund Ihler" }
1218 @string{IkedaM = "Michael Ikeda" }
1219 @string{IkedaT = "T. Ikeda" }
1220 @string{ILY = "Leon-Suematsu, Yutaka I." }
1221 @string{ImaiH = "H. Imai" }
1222 @string{InagakiY = "Y. Inagaki" }
1223 @string{IndykP = "Piotr Indyk" }
1225 @string{infras = "INFRAS AG" }
1227 @string{IntanagonwiwatC = "Chalermek Intanagonwiwat" }
1228 @string{IoffredaM = "Mario Ioffreda" }
1229 @string{IriM = "Masao Iri" }
1230 @string{IsettDD = "D. D. Isett" }
1231 @string{IshiiT = "Toshimasa Ishii" }
1232 @string{IshikawaK = "Kunihiro Ishikawa" }
1233 @string{ItaiA = "Alon Itai" }
1234 @string{ItalianoGF = "Giuseppe F.\ Italiano" }
1235 @string{ItoT = "Tooru Ito" }
1236 @string{ItzkovitzS = "Shalev Itzkovitz" }
1237 @string{IvanovYD = "Yuri D. Ivanov" }
1238 @string{IversonK = "Kenneth E. Iverson" }
1239 @string{IwamaK = "Kazuo Iwama" }
1241 @string{JacksonMO = "Matthew O. Jackson" }
1242 @string{JacobR = "Riko Jacob" }
1243 @string{JahodaM = "Marie Jahoda" }
1244 @string{JainA = "A. Jain" }
1245 @string{JainAK = "Anil K. Jain" }
1246 @string{JaJaJ = "Joseph JaJa" }
1247 @string{JakelJ = "Jens J{\"a}kel" }
1248 @string{JaminS = "Sugih Jamin" }
1249 @string{JansenD = "Dorothea Jansen" }
1250 @string{JansenK = "Klaus Jansen" }
1251 @string{JanssenJ = "Jeannette Janssen" }
1252 @string{JanssenP = "Paul Janssen" }
1253 @string{JaromczykJW = "Jerzy W.\ Jaromczyk" }
1254 @string{JaySJ = "Stephen J. Jay" }
1255 @string{JehG = "Jeh, Glen" }
1256 @string{JelinekV = "V{\'\i}t Jel{\'\i}nek" }
1257 @string{JeongH = "Hawoong Jeong" }
1258 @string{JerrumM = "Mark Jerrum" }
1259 @string{JessJA = "Jochen A. Jess" }
1260 @string{JiangAA = "Anxiao (Andrew) Jiang" }
1261 @string{JiangB = "Bin Jiang" }
1262 @string{JiangT = "Tao Jiang" }
1263 @string{JiangX = "Xiao Jiang" }
1264 @string{JianT = "Tang Jian" }
1265 @string{JinC = "Cheng Jin" }
1266 @string{JingN = "Ning Jing" }
1267 @string{JinR = "Ruoming Jin" }
1268 @string{JinX = "Xiaoyi Jin" }
1269 @string{JohnesMC = "M.\ C.\ Jones" }
1270 @string{JohnsGL = "Gary L. Johns" }
1271 @string{JohnsonDB = "Donald B. Johnson" }
1272 @string{JohnsonDS = "David S. Johnson" }
1273 @string{JohnsonMA = "Marc A. Johnson" }
1274 @string{JokschHC = "H.C. Joksch" }
1275 @string{JolliffeIT = "Ian T. Jolliffe" }
1276 @string{JonesA = "Alan Jones" }
1277 @string{JonesMC = "M.~C.~Jonas" }
1278 @string{JordanC = "Camille Jordan" }
1279 @string{JordanMI = "Jordan, Micheal I." }
1280 @string{JuedesD = "David Juedes" }
1281 @string{JuengerM = "Michael J{\"u}nger" }
1282 @string{JuhaszF = "Ferenc Juh{\'a}sz" }
1283 @string{JungC = "Christian Jung" }
1284 @string{JungJ = "Jaeyeon Jung" }
1285 @string{JungnickelD = "Dieter Jungnickel" }
1286 @string{JungS = "Soojung Jung" }
1287 @string{JungSU = "Sungwon Jung" }
1288 @string{JurdzinskiT = "Tomasz Jurdzinski" }
1290 @string{KaashoekF = "Frans Kaashoek" }
1291 @string{KaasR = "R. Kaas" }
1292 @string{KabellJA = "Jerald A.~Kabell" }
1293 @string{KacprzykJ = "Janusz Kacprzyk" }
1294 @string{KaeaebV = "Vanessa K{\"a}{\"a}b" }
1295 @string{KahlM = "Matthias Kahl" }
1296 @string{KahngAB = "Andrew B. Kahng" }
1297 @string{KahngB = "Byungnam Kahng" }
1298 @string{KaibelV = "Volker Kaibel" }
1299 @string{KaindlH = "Hermann Kaindl" }
1300 @string{KainzG = "Gerhard Kainz" }
1301 @string{KalishY = "Yuval Kalish" }
1302 @string{KalpakisK = "Konstantinos Kalpakis" }
1303 @string{KamadaT = "Tomihisa Kamada" }
1304 @string{KamathC = "Chandrika Kamath" }
1305 @string{KamedaT = "Tiko Kameda" }
1306 @string{KammerF = "Frank Kammer" }
1307 @string{KampenG = "G. R. Kampen" }
1308 @string{KamperJH = "Jan-Hinrich K{\"a}mper" }
1309 @string{KamvarSD = "Kamvar, Sepandar D." }
1310 @string{KandybaM = "Maria Kandyba" }
1311 @string{KanevskyA = "Arkady Kanevsky" }
1312 @string{KangM = "Mihyun Kang" }
1313 @string{KaninkeG = "G. Kaninke" }
1314 @string{KanjIA = "Iyad A. Kanj" }
1315 @string{KannanR = "Ravi Kannan" }
1316 @string{KannanS = "Sampath Kannan" }
1317 @string{KannoJ = "Jinko Kanno" }
1318 @string{KannV = "Viggo Kann" }
1319 @string{KantG = "Goos Kant" }
1320 @string{KantR = "Ravi Kant" }
1321 @string{KaoM = "Ming-Yang Kao" }
1322 @string{KaoMJ = "Mong-Jen Kao" }
1323 @string{KaothanthongN = "Natsuda Kaothanthong" }
1324 @string{KaplanH = "Haim Kaplan" }
1325 @string{KapoorSF = "S. F. Kapoor" }
1326 @string{KappesA = "Andrea Kappes" }
1327 @string{KarakostasG = "George Karakostas" }
1328 @string{KarchD = "Daniel Karch" }
1329 @string{KargerDR = "David R. Karger" }
1330 @string{KarguptaH = "Hillol Kargupta" }
1331 @string{KarimiM = "Masoumeh Karimi" }
1332 @string{KarivO = "Oded Kariv" }
1333 @string{KarlinA = "Anna R. Karlin" }
1334 @string{KarloffH = "Howard Karloff" }
1335 @string{KarmarkarN = "Narendra Karmarkar" }
1336 @string{KarpinskiM = "Marek Karpinski" }
1337 @string{KarpRM = "Richard M. Karp" }
1338 @string{KarrerA = "Annette Karrer" }
1339 @string{KarS = "S. Kar" }
1340 @string{KarypisG = "George Karypis" }
1341 @string{KarzanovAV = "Alexander V. Karzanov" }
1342 @string{KasaiR = "Ryosei Kasai" }
1343 @string{KashIA = "Ian A. Kash" }
1344 @string{KashiwabaraT = "Toshinobu Kashiwabara" }
1345 @string{KashtanN = "Nadav Kashtan" }
1346 @string{KaskiP = "Petteri Kaski" }
1347 @string{KatonaG = "Gyula Katona" }
1348 @string{KatzB = "Bastian Katz" }
1349 @string{KatzL = "Leo Katz" }
1350 @string{KatzRH = "Randy H. Katz" }
1351 @string{KaufmanDE = "David E. Kaufman" }
1352 @string{KaufmannM = "Michael Kaufmann" }
1353 @string{KavanaghJ = "John Kavanagh" }
1354 @string{KavithaT = "Telikepalli Kavitha" }
1355 @string{KawaiS = "Satoru Kawai" }
1356 @string{KawarabayashiK = "Ken-ichi Kawarabayashi" }
1357 @string{KawasakiS = "Saori Kawasaki" }
1358 @string{KeberW = "W. Keber" }
1359 @string{KeimDA = "Daniel A.\ Keim" }
1360 @string{KellererH = "Hans Kellerer" }
1361 @string{KelleyC = "Colin Kelley" }
1362 @string{KellyD = "David Kelly" }
1363 @string{KelmansAK = "A. K. Kelmans" }
1364 @string{KelnerJA = "Jonathan A. Kelner" }
1365 @string{KempeD = "David Kempe" }
1366 @string{KenisP = "Patrick Kenis" }
1367 @string{KenleyEC = "Edward Casey Kenley
\r
1369 @string{KennedyK = "Ken Kennedy" }
1370 @string{KeoghE = "Eamonn Keogh" }
1371 @string{KerboschJAGM = "Joep A. G. M. Kerbosch" }
1372 @string{KernerBS = "Boris S. Kerner" }
1373 @string{KernighanBW = "Brian W. Kernighan" }
1374 @string{KerrenA = "Andreas Kerren" }
1375 @string{KerstingH = "Hanno Kersting" }
1376 @string{KertezJ = "J{\'a}nos Kert{\'e}z" }
1377 @string{KeszeghB = "Bal{\'a}zs Keszegh" }
1378 @string{KeyanL = "Liu Keyan" }
1379 @string{KhabbazianM = "Majid Khabbazian" }
1380 @string{KhachiyanLG = "Leonid G. Khachiyan" }
1381 @string{KhanO = "Omar Khan" }
1382 @string{KhareV = "Varun Khare" }
1383 @string{KhosraviA = "Amirali Khosravi" }
1384 @string{KhotS = "Subhash Khot" }
1385 @string{KhullerS = "Samir Khuller" }
1386 @string{KickEL = "Edward L. Kick" }
1387 @string{KieritzT = "Tim Kieritz" }
1388 @string{KikuoY = "Yuta, Kikuo" }
1389 @string{KimBJ = "Kim, Beom Jun" }
1390 @string{KimCE = "Chul E.\ Kim" }
1391 @string{KimD = "Doochul Kim" }
1392 @string{KimKH = "K. H.\ Kim" }
1393 @string{KindermannP = "Philipp Kindermann" }
1394 @string{KingV = "Valerie King" }
1395 @string{KintaliS = "Shiva Kintali" }
1396 @string{KirchhoffG = "Gustav Kirchhoff" }
1397 @string{KirchlerD = "Dominik Kirchler" }
1398 @string{KirkpatrickS = "Scott Kirkpatrick" }
1399 @string{KishiG = "G.~Kishi" }
1400 @string{KitsuregawaM = "Masaru Kitsuregawa" }
1401 @string{KlafszkyE = "Emil Klafszky" }
1402 @string{KlasingR = "R. Klasing" }
1403 @string{KlauGW = "Gunnar W. Klau" }
1404 @string{KlavikP = "Pavel Klav{\'i}k" }
1405 @string{KleeneSC = "Stephen Cole Kleene" }
1406 @string{KleeV = "Victor Klee" }
1407 @string{KleinbergJM = "Jon M. Kleinberg" }
1408 @string{KleinD = "Klein, Dan" }
1409 @string{KleinK = "Karsten Klein" }
1410 @string{KleinPN = "Philip N. Klein" }
1411 @string{KleinR = "Rolf Klein" }
1412 @string{KleinS = "Sulamita Klein" }
1413 @string{KleitmanDJ = "Daniel J. Kleitman" }
1414 @string{KlemmK = "Konstantin Klemm" }
1415 @string{KliemannL = "Lasse Kliemann" }
1416 @string{KliewerN = "Natalia Kliewer" }
1417 @string{KloksT = "Ton Kloks" }
1418 @string{KlugeR = "Roland Kluge" }
1419 @string{KlukasC = "Christian Klukas" }
1420 @string{KlunderGA = "G. A. Klunder" }
1421 @string{KnokeD = "David Knoke" }
1422 @string{KnoppS = "Sebastian Knopp" }
1423 @string{KnothM = "Martin Knoth" }
1424 @string{KnowlesJD = "Joshua D. Knowles" }
1425 @string{KnuthD = "Donald E. Knuth" }
1426 @string{KobitzschM = "Moritz Kobitzsch" }
1427 @string{KobourovSG = "Stephen G. Kobourov" }
1428 @string{KodamaY = "Yukihiro Kodama" }
1429 @string{KoebeP = "Paul Koebe" }
1430 @string{KoeblerJ = "Johannes K{\"{o}}bler" }
1431 @string{KoehlerE = "Ekkehard K{\"o}hler" }
1432 @string{KoenemannJ = "Jochen K{\"o}nemann" }
1433 @string{KoenigD = "D\'enes K{\H o}nig" }
1434 @string{KoepfB = "Boris K{\"o}pf" }
1435 @string{KoevariT = "Tam{\'a}s K{\H{o}}v{\'a}ri" }
1436 @string{KoganJ = "Jacob Kogan" }
1437 @string{KohKM = "Khee Meng Koh" }
1438 @string{KohliP = "Pushmeet Kohli" }
1439 @string{KollerD = "Daphne Koller" }
1440 @string{KolmanP = "Petr Kolman" }
1441 @string{KomlosJ = "J{\'a}nos Koml{\'o}s" }
1442 @string{KommelH = "Helene J. Kommel" }
1443 @string{KonjevodG = "Goran Konjevod" }
1444 @string{KoopmansTC = "Tjalling C. Koopmans" }
1445 @string{KorenI = "Israel Koren" }
1446 @string{KorenY = "Yehuda Koren" }
1447 @string{KorenZ = "Zahava Koren" }
1448 @string{KormanM = "Matias Korman" }
1449 @string{KorteB = "Bernhard Korte" }
1450 @string{KortewegP = "Peter Korteweg" }
1451 @string{KortsarzG = "Guy Kortsarz" }
1452 @string{KoschutzkiD = "Dirk Kosch{\"u}tzki" }
1453 @string{KosterAM = "Arie M.C.A. Koster" }
1454 @string{KosubS = "Sven Kosub" }
1455 @string{KoutsoupiasE = "Elias Koutsoupias" }
1456 @string{KowalskiDR = "Dariusz R. Kowalski" }
1457 @string{KrackhardtD = "David Krackhardt" }
1458 @string{KrapivskyPL = "Paul L.\ Krapivsky" }
1459 @string{KratochvilJ = "Jan Kratochv{\'\i}l" }
1460 @string{KratschD = "Dieter Kratsch" }
1461 @string{KrauseAE = "Ann E. Krause" }
1462 @string{KrauthgamerR = "Robert Krauthgamer" }
1463 @string{KravetzA = "Alan Kravetz" }
1464 @string{KrebsVE = "Valdis E. Krebs" }
1465 @string{KrempelL = "Lothar Krempel" }
1466 @string{KreuterB = "Bernd Kreuter" }
1467 @string{KreveldMv = "Marc van Kreveld" }
1468 @string{KringsM = "Manuel Krings" }
1469 @string{KrishnaCM = "Krishna, C. Mani" }
1470 @string{KrishnamachariB = "Bhaskar Krishnamachari" }
1471 @string{KrishnamoorthyV = "V. Krishnamoorthy" }
1472 @string{KrishnanN = "Neeraj Krishnan" }
1473 @string{KrivelevichM = "Michael Krivelevich" }
1474 @string{KrollM = "Moritz Kroll" }
1475 @string{KroonLG = "Leo G. Kroon" }
1476 @string{KruegerJ = "Jens Kr{\"u}ger" }
1477 @string{KrugM = "Marcus Krug" }
1478 @string{KrummJ = "John Krumm" }
1479 @string{KruskalJB = "Joseph B.\ Kruskal" }
1480 @string{KubickiG = "Grzegorz Kubicki" }
1481 @string{KuceraL = "Lud{\v e}k Ku{\v c}era" }
1482 @string{KuchemR = "Ruth Kuchem" }
1483 @string{KuenstlerR = "Rita K{\"u}nstler" }
1484 @string{KuhnF = "Fabian Kuhn" }
1485 @string{KuhnHW = "Harold W. Kuhn" }
1486 @string{KuhnW = "Werner Kuhn" }
1487 @string{KulisB = "Brian Kulis" }
1488 @string{KulliVR = "V.~R.~Kulli" }
1489 @string{KumadaY = "Yoichiro Kumada" }
1490 @string{KumarG = "Gautam Kumar" }
1491 @string{KumarMP = "Kumar, M. Pramodh" }
1492 @string{KumarPR = "P. R. Kumar" }
1493 @string{KumarR = "Ravi Kumar" }
1494 @string{KumarV = "Vipin Kumar" }
1495 @string{KumarVSA = "Kumar, V. S. Anil" }
1496 @string{KundurP = "P. Kundur" }
1497 @string{KungHT = "H. T. Kung" }
1498 @string{KupkeJ = "Joachim Kupke" }
1499 @string{KuratowskiC = "Casimir Kuratowski" }
1500 @string{KwaJB = "James B. Kwa" }
1501 @string{KwatraV = "Vivek Kwatra" }
1503 @string{LabbeM = "Martine Labbe" }
1504 @string{LabK = "George Karypis" }
1505 @string{LabovitzC = "Craig Labovitz" }
1506 @string{LabrinidisA = "Alexandros Labrinidis" }
1507 @string{LafouOF = "Oscar Fofie Lafou" }
1508 @string{LagunaM = "Manuel Laguna" }
1509 @string{LaiW = "Wei Lai" }
1510 @string{LakamrajuV = "Vijay Lakamraju" }
1511 @string{LakhinaA = "Anukool Lakhina" }
1512 @string{LallS = "Sanjay Lall" }
1513 @string{LambiotteR = "Renaud Lambiotte" }
1514 @string{LammerS = "Stefan L{\"a}mmer" }
1515 @string{LancichinettiA = "Andrea Lancichinetti" }
1516 @string{LandgrafB = "Britta Landgraf" }
1517 @string{LangetepeE = "Elmar Langetepe" }
1518 @string{LangKJ = "Kevin J. Lang" }
1519 @string{LangS = "Steffen Lang" }
1520 @string{LangSe = "Serge Lang" }
1521 @string{LangstonMA = "Michael A. Langston" }
1522 @string{LangvilleAN = "Amy N. Langville" }
1523 @string{LaPoutreJA = "La Poutr{\'e}, Johannes A." }
1524 @string{LarsenKG = "Kim Guldstrand Larsen" }
1525 @string{LaschingerM = "Moritz Laschinger" }
1526 @string{LaskeyKB = "Kathryn B.\ Laskey" }
1527 @string{LatapyM = "Matthieu Latapy" }
1528 @string{LauchliP = "Peter L{\"a}uchli" }
1529 @string{LauFC = "Francis C. M. Lau" }
1530 @string{LauraL = "Luigi Laura" }
1531 @string{LautherU = "Ulrich Lauther" }
1532 @string{LavilleF = "Fran{\c{c}}oise Laville" }
1533 @string{LawlerEL = "Eugene L. Lawler" }
1534 @string{LawrenceS = "Steve Lawrence" }
1535 @string{LeahyR = "Richard Leahy" }
1536 @string{LeeCPC = "Lee, Chris Pan-Chi" }
1537 @string{LeeD = "D.T. Lee" }
1538 @string{LeeJ = "Jian Lee" }
1539 @string{LeeL = "Lie-Quan Lee" }
1540 @string{LeeRCT = "Richard C. T. Lee" }
1541 @string{LeeS = "Sang-Ho Lee" }
1542 @string{LeeuwenJv = "van Leeuwen, Jan" }
1543 @string{LeeuwJW = "Jan W. de Leeuw" }
1544 @string{LefebvreE = "Etienne Lefebvre" }
1545 @string{LefohnA = "Aaron Lefohn" }
1546 @string{LeH = "Hoang-Oanh Le" }
1547 @string{LehmannEL = "Erich L. Lehmann" }
1548 @string{LehmannK = "Katharina A. Lehmann" }
1549 @string{LehmannKA = "Katharina A. Lehmann" }
1550 @string{LeibfriedT = "Thomas Leibfried" }
1551 @string{LeichtEA = "E. A. Leicht" }
1552 @string{LeifmanLYa = "L. Ya. Leifman" }
1553 @string{LeightonFT = "Frank Thomson Leighton" }
1554 @string{LeinhardtS = "Samuel Leinhardt" }
1555 @string{LeipertS = "Sebastian Leipert" }
1556 @string{LeiserN = "Naty Leiser" }
1557 @string{LeisersonCE = "Charles E. Leiserson" }
1558 @string{LelandR = "Robert Leland" }
1559 @string{LempelA = "Abraham Lempel" }
1560 @string{LempelR = "Ronny Lempel" }
1561 @string{LengauerT = "Thomas Lengauer" }
1562 @string{LenstraHW = "Hendrik Willem Lenstra" }
1563 @string{LenstraJK = "Jan Karel Lenstra" }
1564 @string{LeonardiS = "Stefano Leonardi" }
1565 @string{LeonardJ = "John Leonard" }
1566 @string{LernerJ = "J{\"u}rgen Lerner" }
1567 @string{LeskovecJ = "Jure Leskovec" }
1568 @string{LesniakL = "Linda Lesniak" }
1569 @string{LeuckerM = "Martin Leucker" }
1570 @string{LeungV = "Vitus Leung" }
1571 @string{LeveneM = "Mark Levene" }
1572 @string{LevequeB = "Benjamin L\'ev\^eque" }
1573 @string{LevineMS = "Matthew S. Levine" }
1574 @string{LevinsonR = "Robert Levinson" }
1575 @string{LewinerT = "Thomas Lewiner" }
1576 @string{LewiP = "Paul Lewi" }
1577 @string{LeydesdorffL = "Loet Leydesdorff" }
1578 @string{LeyvrazF = "Francois Leyvraz" }
1579 @string{LiA = "Angsheng Li" }
1580 @string{LiangJ = "Jiye Liang" }
1581 @string{LiangW = "Weifa Liang" }
1582 @string{LiaoC = "Chien-Chih Liao" }
1583 @string{LibertiL = "Leo Liberti" }
1584 @string{LiC = "Chung-Sheng Li" }
1585 @string{LichtenbergK = "de Lichtenberg, Kristian" }
1586 @string{LickDR = "Don R. Lick" }
1587 @string{LiebchenC = "Christian Liebchen" }
1588 @string{LiebersA = "Annegret Liebers" }
1589 @string{LiereR = "Robert van Liere" }
1590 @string{LiG = "Guojie Li" }
1591 @string{LiggesmeyerP = "Peter Liggesmeyer" }
1592 @string{LightnerMR = "Michael R. Lightner" }
1593 @string{LiJ = "Jiandong Li" }
1594 @string{LiJin = "Jinyang Li" }
1595 @string{LilloF = "Felipe Lillo" }
1596 @string{LiM = "Menghui Li" }
1597 @string{LinC = "Ching-Chi Lin" }
1598 @string{LinCh = "Chuan Lin" }
1599 @string{LinChewK = "Kim Lin Chew" }
1600 @string{LingasA = "Andrzej Lingas" }
1601 @string{LingL = "Lunjiang Ling" }
1602 @string{LinialN = "Nathan Linial" }
1603 @string{LinS = "S. Lin" }
1604 @string{LinX = "Xuemin Lin" }
1605 @string{LiottaG = "Giuseppe Liotta" }
1606 @string{LipmanMJ = "Marc J. Lipman" }
1607 @string{LiptonRJ = "Richard J. Lipton" }
1608 @string{LiS = "Shuzhuo Li" }
1609 @string{LisowskiD = "David Lisowski" }
1610 @string{LiSYR = "Shuo-Yen Robert Li" }
1611 @string{LitvakN = "Litvak, Nelly" }
1612 @string{LiuC = "Chih-Hung Liu" }
1613 @string{LiuH = "Hengchang Liu" }
1614 @string{LiuJ = "Junqi Liu" }
1615 @string{LiuY = "Yong Liu" }
1616 @string{LiuYh = "Yonghe Liu" }
1617 @string{LiuYQ = "Y. Q. Liu" }
1618 @string{LiX = "Xiang-Yang Li" }
1619 @string{LiXY = "Xiang-Yang Li" }
1620 @string{LiY = "Yingshu Li" }
1621 @string{LladoA = "Anna S. Llad{\'o}" }
1622 @string{LloydS = "Stuart Lloyd" }
1623 @string{LoanCF = "Van Loan, Charles F." }
1624 @string{LochbihlerA = "Andreas Lochbihler" }
1625 @string{LodiE = "Elena Lodi" }
1626 @string{LoehA = "Andres L{\"o}h" }
1627 @string{LoehrK = "Klaus-Peter L{\"o}hr" }
1628 @string{LofflerM = "Maarten L{\"o}ffler" }
1629 @string{LoizouG = "George Loizou" }
1630 @string{LomonosovMV = "M. V. Lomonosov" }
1631 @string{LonardiS = "Stefano Lonardi" }
1632 @string{LongJ = "Jun Long" }
1633 @string{LoomisCP = "C. P. Loomis" }
1634 @string{Lopez-OrtizA = "Alejandro L{\'o}pez-Ortiz" }
1635 @string{LopezMGR = "Maria G.R. Lopez" }
1636 @string{LorenzU = "Ulf Lorenz" }
1637 @string{LorrainF = "Fran{\c{c}}ois Lorrain" }
1638 @string{LotkerZ = "Zvi Lotker" }
1639 @string{LouchardG = "Guy Louchard" }
1640 @string{LouiRP = "Ronald Prescott Loui" }
1641 @string{LoukakisE = "Emmanuel Loukakis" }
1642 @string{LourenccoA = "Andr{\'e} Louren{\c{c}}o" }
1643 @string{LovaszL = "L{\'a}szl{\'o} Lov{\'a}sz" }
1644 @string{LuanGF = "G. F. Luan" }
1645 @string{LubbeckeME = "Marco E. L{\"u}bbecke" }
1646 @string{LubbersMJ = "Miranda J.\ Lubbers" }
1647 @string{LubiwA = "Anna Lubiw" }
1648 @string{LuccioF = "Fabrizio Luccio" }
1649 @string{LuceRD = "R. Duncan Luce" }
1650 @string{LudwigA = "Andreas Ludwig" }
1651 @string{LuebkeD = "David Luebke" }
1652 @string{LuekerGS = "George S. Lueker" }
1653 @string{LuF = "Feng Lu" }
1654 @string{LuG = "Gang Lu" }
1655 @string{LuH = "Hsueh-I Lu" }
1656 @string{LukoseRM = "Rajan M. Lukose" }
1657 @string{LuksEM = "Eugene M. Luks" }
1658 @string{LuL = "Linyuan Lu" }
1659 @string{LumsdaineA = "Andrew Lumsdaine" }
1660 @string{LundC = "Carsten Lund" }
1661 @string{LunnAD = "A.\ D.\ Lunn" }
1662 @string{LuoH = "Hong Luo" }
1663 @string{LuoJ = "Jun Luo" }
1664 @string{LuoX = "Xuemei Luo" }
1665 @string{LusherD = "Dean Lusher" }
1666 @string{LusseauD = "David Lusseau" }
1667 @string{LuxburgUv = "Ulrike von Luxburg" }
1668 @string{LuxenD = "Dennis Luxen" }
1669 @string{LuzR = "Raphael Luz" }
1670 @string{LynchN = "Nancy Lynch" }
1672 @string{MaassMG = "Moritz G. Maa{\ss}" }
1673 @string{MaassW = "Wolfgang Maass" }
1674 @string{MacciC = "Claudio Macci" }
1675 @string{MachucaE = "Enrique Machuca" }
1676 @string{MacLaneS = "Mac Lane, Saunders" }
1677 @string{MacQueenJ = "J.\ MacQueen" }
1678 @string{MadanR = "Ritesh Madan" }
1679 @string{MaddenB = "Brendan Madden" }
1680 @string{MaddenP = "Patrick Madden" }
1681 @string{MaddenS = "Samuel Madden" }
1682 @string{MadduriK = "Kamesh Madduri" }
1683 @string{MaderM = "Martin Mader" }
1684 @string{MaderW = "Wolfgang Mader" }
1685 @string{MadryA = "Aleksander Madry" }
1686 @string{MaffioliF = "Francesco Maffioli" }
1687 @string{MaghoulF = "Farzin Maghoul" }
1688 @string{MagnantiTL = "Thomas L. Magnanti" }
1689 @string{MagoniD = "Damien Magoni" }
1690 @string{MagoulesF = "Fr{\'e}d{\'e}ric Magoul{\`e}s" }
1691 @string{MaheshwariA = "Anil Maheshwari" }
1692 @string{MaheshwariSN = "S. N. Maheshwari" }
1693 @string{MaierD = "David Maier" }
1694 @string{MaierM = "Markus Maier" }
1695 @string{MaillardP = "Pascal Maillard" }
1696 @string{MakinenE = "E. M{\"a}kinen" }
1697 @string{MakkiK = "Kia Makki" }
1698 @string{MakkiS = "Shamila Makki" }
1699 @string{MakkiSK = "S. Kami Makki" }
1700 @string{MaL = "Li Ma" }
1701 @string{MalandrakiC = "Chryssi Malandraki" }
1702 @string{MalewiczG = "Grzegorz Malewicz" }
1703 @string{MalgeriM = "M. Malgeri" }
1704 @string{MalhotraVM = "Vishv M. Malhotra" }
1705 @string{MaliG = "Georgia Mali" }
1706 @string{MalikJ = "Jitendra Malik" }
1707 @string{MalitzS = "Seth Malitz" }
1708 @string{MalkevitchJ = "Joseph Malkevitch" }
1709 @string{MammanaF = "Flavia Mammana" }
1710 @string{MamoulisN = "Nikos Mamoulis" }
1711 @string{MandowL = "Lawrence Mandow" }
1712 @string{MangioniG = "G. Mangioni" }
1713 @string{ManicG = "G. Manic" }
1714 @string{ManiP = "Peter Mani" }
1715 @string{ManneF = "Fredrik Manne" }
1716 @string{MannilaH = "Heikki Mannila" }
1717 @string{ManningCD = "Manning, Christopher D." }
1718 @string{ManninoC = "Carlo Mannino" }
1719 @string{ManolopoulosY = "Yannis Manolopoulos" }
1720 @string{MansourY = "Yishay Mansour" }
1721 @string{ManteuffelTA = "Thomas A. Manteuffel" }
1722 @string{MaratheMV = "Madhav V. Marathe" }
1723 @string{MarchettiFE = "Franco E. Marchetti" }
1724 @string{MarchettiSpaccamelaA = "Alberto Marchetti-Spaccamela" }
1725 @string{MarcotteP = "Patrice Marcotte" }
1726 @string{MarianiF = "Federico Mariani" }
1727 @string{MarinI = "Ignacio Mar{\'\i}n" }
1728 @string{MarinoniS = "Stefano Marinoni" }
1729 @string{MarionJ = "Jean-Yves Marion" }
1730 @string{MarkielA = "Andrew Markiel" }
1731 @string{MarksJ = "Joe Marks" }
1732 @string{MarquezA = "M{\'a}rquez, Alberto" }
1733 @string{MarriottK = "Kim Marriott" }
1734 @string{MarshallAG = "Alan G. Marshall" }
1735 @string{MarshallMS = "M. Scott Marshall" }
1736 @string{MarsS = "Sergio Mars" }
1737 @string{MartelC = "Charles Martel" }
1738 @string{MartelloS = "Silvano Martello" }
1739 @string{MartinGN = "G. Nigel Martin" }
1740 @string{MartinsEQ = "Ernesto Queiros Martins" }
1741 @string{MartiR = "Rafael Mart{\'i}" }
1742 @string{MarxM = "Maarten Marx" }
1743 @string{MasikosM = "M. Masikos" }
1744 @string{MasonDM = "Doran M. Mason" }
1745 @string{MasonSP = "Sean P. Mason" }
1746 @string{MasseBR = "B.R.\ M{\^{a}}sse" }
1747 @string{MasuchM = "Michael Masuch" }
1748 @string{MasudaS = "Sumio Masuda" }
1749 @string{MasuyamaS = "Shigeru Masuyama" }
1750 @string{MathonR = "Rudi Mathon" }
1751 @string{MatijevicD = "Domagoj Matijevic" }
1752 @string{MatousekJ = "Ji{\v r}{\' i} Matou{\v s}ek" }
1753 @string{MattaI = "Ibrahim Matta" }
1754 @string{MatternF = "Friedemann Mattern" }
1755 @string{MattfeldDC = "Dirk Christian Mattfeld" }
1756 @string{MattheysesRM = "R. M. Mattheyses" }
1757 @string{MatulaDW = "David W. Matula" }
1758 @string{MatuszewskiC = "Christian Matuszewski" }
1759 @string{MaueJ = "Jens Maue" }
1760 @string{MaW = "Wei Ma" }
1761 @string{MayrEW = "Ernst W. Mayr" }
1762 @string{McCainKW = "Katherine W.\ McCain" }
1763 @string{McCarthyJ = "John McCarthy" }
1764 @string{McCartyC = "Chris McCarty" }
1765 @string{McConnellR = "Ross McConnell" }
1766 @string{McConwayKJ = "K.~J.~McConway" }
1767 @string{McCurleyKS = "Kevin S.\ McCurley" }
1768 @string{McDiarmidCJH = "Colin J. H. McDiarmid" }
1769 @string{McGeochCC = "Catherine C. McGeoch" }
1770 @string{McGillR = "Robert McGill" }
1771 @string{McGinnisLF = "Leon F.\ McGinnis" }
1772 @string{McGrathC = "Cathleen McGrath" }
1773 @string{McGregorJJ = "James J. McGregor" }
1774 @string{MchedlidzeT = "Tamara Mchedlidze" }
1775 @string{McKayBD = "Brendan D.\ McKay" }
1776 @string{McKeeTA = "Terry A. McKee" }
1777 @string{McKeownGP = "Geoff P. McKeown" }
1778 @string{McMorrisFR = "F. R. McMorris" }
1779 @string{McSherryF = "Frank McSherry" }
1780 @string{MeckeS = "Steffen Mecke" }
1781 @string{MedagliaAL = "Andr{\'e}s L. Medaglia" }
1782 @string{MedinaA = "Alberto Medina" }
1783 @string{MeekC = "Christopher Meek" }
1784 @string{MehldauH = "Heiko Mehldau" }
1785 @string{MehlerA = "Alexander Mehler" }
1786 @string{MehlhornK = "Kurt Mehlhorn" }
1787 @string{MeilaM = "Marina Meil{\u{a}}" }
1788 @string{MeinelC = "Christoph Meinel" }
1789 @string{MeinertS = "Sascha Meinert" }
1790 @string{MelanconG = "Guy Melan\c{c}on" }
1791 @string{MellouliT = "Taieb Mellouli" }
1792 @string{MeltzerB = "Bernard Meltzer" }
1793 @string{MendelzonAO = "Alberto O. Mendelzon" }
1794 @string{MendesJFF = "Jose Ferreira F. Mendes" }
1795 @string{MendezPO = "Ossona de Mendez, Patrice" }
1796 @string{MengerK = "Karl Menger" }
1797 @string{MerrickD = "Damian Merrick" }
1798 @string{MerrisR = "Russell Merris" }
1799 @string{MesaJA = "Juan A. Mesa" }
1800 @string{MetznerP = "Philipp Metzner" }
1801 @string{Meyer-BaseA = "Anke Meyer-B{\"a}se" }
1802 @string{MeyerADHF = "Friedhelm {Meyer auf der Heide}" }
1803 @string{MeyerCD = "Carl D. Meyer" }
1804 @string{MeyerD = "David Meyer" }
1805 @string{MeyerhenkeH = "Henning Meyerhenke" }
1806 @string{MeyerJ = "Joerg Meyer" }
1807 @string{MeyersRA = "Robert A. Meyers" }
1808 @string{MeyerU = "Ulrich Meyer" }
1809 @string{MeyerW = "W. Fr. Meyer" }
1810 @string{MichailP = "Panagiotis Michail" }
1811 @string{MichieD = "Donald Michie" }
1812 @string{MiddendorfM = "Manuel Middendorf" }
1813 @string{MielkeA = "Alexander Mielke" }
1814 @string{MihailM = "Milena Mihail" }
1815 @string{MihalakM = "Mat{\'u}{\v s} Mihal'{\'a}k" }
1816 @string{MilgramS = "Stanley Milgram" }
1817 @string{MiliosEE = "Evangelos E. Milios" }
1818 @string{MillerE = "Ezra Miller" }
1819 @string{MillerGL = "Gary L. Miller" }
1820 @string{MillerRE = "Raymond E. Miller" }
1821 @string{MillozziS = "Stefano Millozzi" }
1822 @string{MilmanVD = "Vitali D. Milman" }
1823 @string{MiloR = "Ron Milo" }
1824 @string{MirchandaniPB = "Pitu B.\ Mirchandani" }
1825 @string{MishraN = "Nina Mishra" }
1826 @string{MisueK = "K. Misue" }
1827 @string{MitchellJC = "J. Clyde Mitchell" }
1828 @string{MitchellSL = "Sandra L. Mitchell" }
1829 @string{MitchellW = "William Mitchell" }
1830 @string{MitohK = "K. Mitoh" }
1831 @string{MitraP = "Pabitra Mitra" }
1832 @string{MitraPra = "Pradipta Mitra" }
1833 @string{MitzenmacherM = "Michael Mitzenmacher" }
1834 @string{MiuraK = "Kazuyuki Miura" }
1835 @string{MiyamotoI = "Isao Miyamoto" }
1836 @string{ModestiP = "Paola Modesti" }
1837 @string{MoehringR = "Rolf H. M{\"o}hring" }
1838 @string{MoellerB = "Burkhard M{\"{o}}ller" }
1839 @string{MoharB = "Bojan Mohar" }
1840 @string{MohrmannH = "H. Mohrmann" }
1841 @string{MohrT = "Th. Mohr" }
1842 @string{MokbelMF = "Mohamed F. Mokbel" }
1843 @string{MokkenRJ = "Robert J. Mokken" }
1844 @string{MolinaJL = "Jos{\'e} Luis Molina" }
1845 @string{MolitorP = "Paul Molitor" }
1846 @string{MolluzzoJC = "John C. Molluzzo" }
1847 @string{MonienB = "Burkhard Monien" }
1848 @string{MonmaCL = "Clyde L. Monma" }
1849 @string{MontanariUG = "Ugo G. Montanari" }
1850 @string{MontecchianiF = "Fabrizio Montecchiani" }
1851 @string{MontemanniR = "Roberto Montemanni" }
1852 @string{MontgolfierFd = "Fabien de Montgolfier" }
1853 @string{MontiA = "Angelo Monti" }
1854 @string{MontjoyeYd = "Yves-Alexandre de Montjoye" }
1855 @string{MoonJW = "John W. Moon" }
1856 @string{MoorBD = "Bart De Moor" }
1857 @string{MooreC = "Cristopher Moore" }
1858 @string{MooreD = "David Moore" }
1859 @string{MooreRJ = "Robert J. Moore" }
1860 @string{MoralesN = "N. Morales" }
1861 @string{MoranS = "Shlomo Moran" }
1862 @string{MorenoA = "Moreno, Auxiliadora" }
1863 @string{MorentD = "Dominik Morent" }
1864 @string{MoretB = "Bernard Moret" }
1865 @string{MoreyLC = "Leslie C. Morey" }
1866 @string{MoricF = "Filip Moric" }
1867 @string{MoritzH = "Helmut Moritz" }
1868 @string{MorrisR = "Robert Morris" }
1869 @string{MorseAS = "A. Stephen Morse" }
1870 @string{MosbahM = "Mohamed Mosbah" }
1871 @string{MoscibrodaT = "Thomas Moscibroda" }
1872 @string{MoserL = "L. Moser" }
1873 @string{MoshkovitzD = "Dana Moshkovitz" }
1874 @string{MotwaniR = "Rajeev Motwani" }
1875 @string{MouncifH = "Hicham Mouncif" }
1876 @string{MoxleyN = "Nancy F. Moxley" }
1877 @string{MoxleyR = "Robert L. Moxley" }
1878 @string{MozesS = "Shay Mozes" }
1879 @string{MrvarA = "Andrej Mrvar" }
1881 @string{mta = "{Metropolitan Transportation Authority of the State of New York}" }
1883 @string{MuellerH = "Haiko M{\"{u}}ller" }
1884 @string{MuellerHannemannM = "Matthias {M{\"u}ller--Hannemann}" }
1885 @string{MuellerK = "Kirill M{\"u}ller" }
1886 @string{MuellerR = "Rudolf M{\"u}ller" }
1887 @string{MuffS = "Stefanie Muff" }
1888 @string{MukhtarS = "Selma Mukhtar" }
1889 @string{MullerGlaserKD = "K.D. M{\"u}ller-Glaser" }
1890 @string{MullerLF = "Laurent Flindt Muller" }
1891 @string{MullerME = "Mervin E. Muller" }
1892 @string{MullinsNC = "N. C. Mullins" }
1893 @string{MulmuleyK = "Ketan Mulmuley" }
1894 @string{MumfordE = "Elena Mumford" }
1895 @string{MunozMA = "M. A. Mu{\~{n}}oz" }
1896 @string{MunroI = "Ian Munro" }
1897 @string{MunroJI = "J. Ian Munro" }
1898 @string{MunznerT = "Tamara Munzner" }
1899 @string{MurtaghF = "F. Murtagh" }
1900 @string{MurtyMN = "M. N. Murty" }
1901 @string{MurtyUS = "U. S. Murty" }
1902 @string{MutzelP = "Petra Mutzel" }
1903 @string{MyersC = "Chad Myers" }
1905 @string{NaamadA = "Amnon Naamad" }
1906 @string{NachtigallK = "Karl Nachtigall" }
1907 @string{NadelSF = "Siegfried F.\ Nadel" }
1908 @string{NaeherS = "Stefan N{\"a}her" }
1909 @string{NagaiS = "Sayaka Nagai" }
1910 @string{NagamochiH = "Hiroshi Nagamochi" }
1911 @string{NagarajanV = "Viswanath Nagarajan" }
1912 @string{NagelK = "Kai Nagel" }
1913 @string{NagelS = "Stefanie Nagel" }
1914 @string{NaglM = "Manfred Nagl" }
1915 @string{NaimM = "Mary Naim" }
1916 @string{NajjarW = "Walid Najjar" }
1917 @string{NakajimaK = "Kazuo Nakajima" }
1918 @string{NakamuraA = "Akira Nakamura" }
1919 @string{NakanoS = "Shin-Ichi Nakano" }
1920 @string{NakaoA = "Akihiro Nakao" }
1921 @string{NakashimaH = "Hideyuki Nakashima" }
1922 @string{NamjoshiP = "Parag Namjoshi" }
1923 @string{NamSH = "S. H. Nam" }
1924 @string{NanniciniG = "Giacomo Nannicini" }
1925 @string{NanniU = "Umberto Nanni" }
1926 @string{NaorD = "Dalit Naor" }
1927 @string{NaorJ = "Joseph Naor" }
1928 @string{NardelliE = "Enrico Nardelli" }
1929 @string{NarinF = "Narin, Francis" }
1930 @string{NarvaezP = "Paolo Narv{\'a}ez" }
1931 @string{NashWilliamsC = "Crispin St. Nash-Williams" }
1932 @string{NausJ = "Joseph Naus" }
1933 @string{NefW = "Walter Nef" }
1934 @string{NegenbornR = "R.R. Negenborn" }
1935 @string{NelsonPC = "Peter C. Nelson" }
1936 @string{NemethE = "Evi Nemeth" }
1937 @string{NemhauserGL = "Georg L. Nemhauser" }
1938 @string{NepuszT = "Tam{'a}s Nepusz" }
1939 @string{NesetrilJ = "Jaroslav Ne{\v s}et{\v r}il" }
1940 @string{NeubauerS = "Sabine Neubauer" }
1941 @string{NeumannG = "Gustaf Neumann" }
1942 @string{NewmanMEJ = "Mark E. J. Newman" }
1943 @string{NewportC = "Calvin Newport" }
1944 @string{NeyerG = "Gabriele Neyer" }
1945 @string{NgAY = "Ng, Andrew Y." }
1946 @string{NgKW = "K. W. Ng" }
1947 @string{NgoJT = "J. Thomas Ngo" }
1948 @string{NguyenNB = "Ngoc Binh Nguyen" }
1949 @string{NguyenS = "Sang Nguyen" }
1950 @string{NicholasC = "Charles Nicholas" }
1951 @string{NicholsonV = " Victor Nicholson" }
1952 @string{NickellE = "Eric Nickell" }
1953 @string{NicolaiT = "Tom Nicolai" }
1954 @string{NicosiaV = "Vincenzo Nicosia" }
1955 @string{NiedermannB = "Benjamin Niedermann" }
1956 @string{NiedermeierR = "Rolf Niedermeier" }
1957 @string{NieminenUJ = "U. J. Nieminen" }
1958 @string{NieseltK = "Kay Nieselt" }
1959 @string{NiittymakiJ = "Jarko Niittym{\"a}ki" }
1960 @string{NikanderP = "Pekka Nikander" }
1961 @string{NikoletseasS = "Sotiris Nikoletseas" }
1962 @string{NikoloskiZ = "Zoran Nikoloski" }
1963 @string{NilssonN = "Nils Nilsson" }
1964 @string{NisanN = "Noam Nisan" }
1965 @string{NishimuraK = "Kazuhiro Nishimura" }
1966 @string{NishimuraS = "S. Nishimura" }
1967 @string{NishizekiT = "Takao Nishizeki" }
1968 @string{NittelS = "Silvia Nittel" }
1969 @string{NoackA = "Andreas Noack" }
1970 @string{NodaI = "Itsuki Noda" }
1971 @string{NollenburgM = "Martin N{\"o}llenburg" }
1972 @string{NoltemeierH = "Hartmut Noltemeier" }
1973 @string{NooyW = "Wouter de Nooy" }
1974 @string{NooyWD = "Wouter De Nooy" }
1975 @string{NormanR = "Robert Z. Norman" }
1976 @string{NorthSC = "Stephen C. North" }
1977 @string{NorthwayML = "Mary L. Northway" }
1978 @string{NorvaagK = "Kjetil N{\o}rv{\aa}g" }
1979 @string{NossensonR = "Ronit Nossenson" }
1980 @string{NovakJ = "Novak, Jasmine" }
1981 @string{NowatzykA = "Andreas Nowatzyk" }
1982 @string{NowickiK = "Krzysztof Nowicki" }
1983 @string{NoyM = "Marc Noy" }
1984 @string{NummenmaaJ = "J. Nummenmaa" }
1985 @string{NunesAmaralLA = "Lu{\acute i}s Amaral" }
1986 @string{NunkesserM = "Marc Nunkesser" }
1987 @string{NutovZ = "Zeev Nutov" }
1988 @string{NuutilaE = "Esko Nuutila" }
1990 @string{ObradovicD = "D. Obradovic" }
1991 @string{OdenK = "Kevin Oden" }
1992 @string{OelkeD = "Daniela Oelke" }
1993 @string{OellermannOR = "Ortrud R. Oellermann" }
1994 @string{OgawaM = "Michima Ogawa" }
1995 @string{OgiharaM = "Mitsunori Ogihara" }
1996 @string{OhE = "Eulsik Oh" }
1997 @string{OhtaM = "Masyuku Ohta" }
1998 @string{OkadaT = "Takashi Okada" }
1999 @string{OkamotoY = "Yoshio Okamoto" }
2000 @string{OlmanV = "Victor Olman" }
2001 @string{OltvaiZN = "Zoltan N.\ Oltvai" }
2002 @string{OmranMT = "Masoud T. Omran" }
2003 @string{ONeilP = "P. V. O'Neil" }
2005 @string{oneworld = "{Oneworld Management Ltd}" }
2007 @string{OpitzO = "Otto Opitz" }
2008 @string{OrdaA = "Ariel Orda" }
2010 @string{oregon = "{University of Oregon Routeviews Project}" }
2012 @string{OresicM = "Matej Oresic" }
2013 @string{OrlinJB = "James B. Orlin" }
2014 @string{OrourkeJ = "Joseph O'Rourke" }
2015 @string{OrtizMGR = "Maria G.R. Ortiz" }
2016 @string{OsangG = "Georg Osang" }
2017 @string{OsawaT = "Toshihiko Osawa" }
2018 @string{OsipovV = "Vitaly Osipov" }
2020 @string{osm = "OpenStreetMap E" }
2022 @string{OstrowskiM = "Martin Ostrowski" }
2023 @string{OtachiY = "Yota Otachi" }
2024 @string{OttmannT = "Thomas Ottmann" }
2025 @string{OvelgonneM = "Michael Ovelg{\"o}nne" }
2026 @string{OvermarsMH = "Mark H. Overmars" }
2027 @string{OwensJD = "John D. Owens" }
2028 @string{OzierO = "Owen Ozier" }
2030 @string{PabonJimenezG = "Glarycelis Pab{'o}n-Jim{'e}nez" }
2031 @string{PachJ = "J{\'a}nos Pach" }
2032 @string{PadbergM = "Manfred Padberg" }
2033 @string{PageL = "Lawrence Page" }
2034 @string{PageLB = "Lavon B.\ Page" }
2035 @string{PaigeR = "Robert Paige" }
2036 @string{PajorT = "Thomas Pajor" }
2037 @string{PalaciosHuertaI = "Palacios-Huerta, Ignacio" }
2038 @string{PalemK = "Krishna Palem" }
2039 @string{PalladinoP = "Pietro Palladino" }
2040 @string{PallaG = "Gergely Palla" }
2041 @string{PallottinoS = "Stefano Pallottino" }
2042 @string{PalmerC = "Christopher Palmer" }
2043 @string{PanduranganG = "Gopal Pandurangan" }
2044 @string{PangC = "{Chi-Yin} Pang" }
2045 @string{PanigrahiD = "Debmalya Panigrahi" }
2046 @string{PanJ = "Jia-Yu Pan" }
2047 @string{PansiotJJ = "Jean Jacques Pansiot" }
2048 @string{PanVY = "Victor Y. Pan" }
2049 @string{PanY = "Yi Pan" }
2050 @string{PaoloED = "Ezequiel Di Paolo" }
2051 @string{PapadiasD = "Dimitris Papadias" }
2052 @string{PapadimitriouCH = "Christos H. Papadimitriou" }
2053 @string{PapadimitriouS = "Spiros Papadimitriou" }
2054 @string{PapadopoulosA = "Apostolos Papadopoulos" }
2055 @string{PapageorgiouLG = "Lazaros G. Papageorgiou" }
2056 @string{PapakostasA = "Achilleas Papakostas" }
2057 @string{PapamanthouC = "Charalampos Papamanthou" }
2058 @string{PapendiekB = "Britta Papendiek" }
2059 @string{PaperH = "Herbert H. Paper" }
2060 @string{PapeU = "U. Pape" }
2061 @string{ParaskevopoulosA = "Andreas Paraskevopoulos" }
2062 @string{PardalosPM = "Panos M. Pardalos" }
2063 @string{ParkJ = "Juyong Park" }
2064 @string{ParlettBN = "Beresford N.\ Parlett" }
2065 @string{ParmiggianiF = "F. Parmiggiani" }
2066 @string{ParterSV = "Seymour V. Parter" }
2067 @string{ParthasarathyS = "Srinivasan Parthasarathy" }
2068 @string{PascheC = "C. Pasche" }
2069 @string{PasqualeF = "Francesco Pasquale" }
2070 @string{PasqualoneG = "Giulio Pasqualone" }
2071 @string{PastorSatorrasR = "Romualdo Pastor-Satorras" }
2072 @string{PatelP = "Pari Patel" }
2073 @string{PatonK = "Keith Paton" }
2074 @string{PatrignaniM = "Maurizio Patrignani" }
2075 @string{PattisonP = "Philippa Pattison" }
2076 @string{PattisonPip = "Pip Pattison" }
2077 @string{PatwaryMM = "Md. Mostofa Patwary" }
2078 @string{PaulC = "Christophe Paul" }
2079 @string{PaullMC = "Marvin C. Paull" }
2080 @string{PaulusmaD = "Dani{\"e}l Paulusma" }
2081 @string{PayneTH = "Thomas H. Payne" }
2082 @string{PearlJ = "Judea Pearl" }
2083 @string{PeetersL = "Leon Peeters" }
2084 @string{PeinhardtM = "Matthias Peinhardt" }
2085 @string{PeiP = "Pengjun Pei" }
2086 @string{PejicS = "Sne{\v z}ana Peji{\'c}" }
2087 @string{PekecA = "Aleksandar Peke{\v c}" }
2088 @string{PelegD = "David Peleg" }
2089 @string{PelilloM = "Marcello Pelillo" }
2090 @string{PellegriniF = "Francois Pellegrini" }
2091 @string{PenttonenM = "Martti Penttonen" }
2092 @string{PerennesS = "St\'{e}phane P\'{e}rennes" }
2093 @string{PererA = "Adam Perer" }
2094 @string{Perez-de-la-CruzJL = "Jos{\'e}-Luis {P{\'e}rez-de-la-Cruz}" }
2095 @string{PerryA = "Albert Perry" }
2096 @string{PerryJE = "Jo Ellen Perry" }
2097 @string{PetersonL = "Larry Peterson" }
2098 @string{PetitJ = "Jordi Petit" }
2099 @string{PettieS = "Seth Pettie" }
2100 @string{PeyratC = "Claudine Peyrat" }
2101 @string{PferschyU = "Ulrich Pferschy" }
2102 @string{PfetschM = "Marc Pfetsch" }
2103 @string{PfoserD = "Dieter Pfoser" }
2104 @string{PhilippidesA = "Andrew Philippides" }
2105 @string{PhillipsJM = "Jeff M. Phillips" }
2106 @string{PhillipsS = "Steven Phillips" }
2107 @string{PhothilimthanaPM = "Phitchaya Mangpo Phothilimthana" }
2108 @string{PicardJC = "Jean-Claude Picard" }
2109 @string{PichC = "Christian Pich" }
2110 @string{PickholtzR = "Raymond Pickholtz" }
2111 @string{PigeotI = "Iris Pigeot" }
2112 @string{PignoletY = "Yvonne-Anne Pignolet" }
2113 @string{PijlsW = "Wim Pijls" }
2114 @string{PinlouA = "Alexandre Pinlou" }
2115 @string{PinskiG = "Pinski, Gabriel" }
2116 @string{PippertRE = "Raymond E. Pippert" }
2117 @string{PissinouN = "Niki Pissinou" }
2118 @string{PitreS = "Sylvain Pitre" }
2119 @string{PittelB = "Boris Pittel" }
2120 @string{PizzoniaM = "Maurizio Pizzonia" }
2121 @string{PlantC = "Claudia Plant" }
2122 @string{PoenitzA = "Andr{\'e} P{\"o}nitz" }
2123 @string{PohlI = "Ira Pohl" }
2124 @string{PolishchukV = "Valentin Polishchuk" }
2125 @string{PoljakS = "Svatopluk Poljak" }
2126 @string{PollackR = "Richard Pollack" }
2127 @string{PonsP = "Pascal Pons" }
2128 @string{PoonSH = "Sheung-Hung Poon" }
2129 @string{PoorH = "H.V. Poor" }
2130 @string{PopkovY = "Y.~Popkov" }
2131 @string{PortilloJR = "Portillo, Jos{\'e} Ramon" }
2132 @string{PosaL = "Louis P{\'o}sa" }
2133 @string{PostHN = "Henk N. Post" }
2134 @string{PotkonjakM = "Miodrag Potkonjak" }
2135 @string{PotvinJY = "Jean-Yves Potvin" }
2136 @string{PoulalhonD = "Dominique Poulalhon" }
2137 @string{PoulinR = "R.\ Poulin" }
2138 @string{PradhanSS = "S. Sandeep Pradhan" }
2139 @string{PramanikS = "Sakti Pramanik" }
2140 @string{PrasadSK = "Sushil K. Prasad" }
2141 @string{PrasinosG = "Grigorios Prasinos" }
2142 @string{PredaM = "Mihai Preda" }
2143 @string{PreisR = "Robert Preis" }
2144 @string{PremrudeepreechacharnS = "S. Premrudeepreechacharn" }
2145 @string{PreparataFP = "Franco P. Preparata" }
2146 @string{PressWH = "William H. Press" }
2147 @string{PrinsG = "Geert Prins" }
2148 @string{PrisnerE = "Erich Prisner" }
2149 @string{ProctorCH = "C.H. Proctor" }
2150 @string{ProemelHJ = "Hans J. Pr{\"o}mel" }
2151 @string{ProiettiG = "Guido Proietti" }
2152 @string{ProskurowskiA = "Andrzej Proskurowski" }
2153 @string{ProvanJS = "J. Scott Provan" }
2154 @string{PrutkinR = "Roman Prutkin" }
2156 @string{ptv = "{PTV AG -- Planung Transport Verkehr}" }
2158 @string{PuniyaniAR = "Amit R. Puniyani" }
2159 @string{PuppeT = "Thomas Puppe" }
2160 @string{PurcellTJ = "Timothy J. Purcell" }
2161 @string{PurchaseHC = "Helen C. Purchase" }
2162 @string{PurdomPW = "Purdom, Jr., Paul W." }
2163 @string{PursulaM = "Matti Pursula" }
2164 @string{PyrgaE = "Evangelia Pyrga" }
2166 @string{QuanW = "Wu Quan" }
2167 @string{QueyranneM = "Maurice Queyranne" }
2168 @string{QuigleyA = "Aaron Quigley" }
2170 @string{RaabJ = "J{\"o}rg Raab" }
2171 @string{RaanAF = "A. F. Van Raan" }
2172 @string{RabinMO = "Michael Oser Rabin" }
2173 @string{RackeH = "Harald R{\"a}cke" }
2174 @string{RademacherH = "Hans Rademacher" }
2175 @string{RademacherL = "Luis Rademacher" }
2176 @string{RadicchiF = "Filippo Radicchi" }
2177 @string{RadoslavovP = "Pavlin Radoslavov" }
2178 @string{RadzikT = "Tomasz Radzik" }
2179 @string{RafflerH = "Hartmut Raffler" }
2180 @string{RaghavachariB = "Balaji Raghavachari" }
2181 @string{RaghavanP = "Prabhakar Raghavan" }
2182 @string{RaghavendraCS = "Cauligi S.~Raghavendra" }
2183 @string{RahmanN = "Naila Rahman" }
2184 @string{RahmanS = "Md. Saidur Rahman" }
2185 @string{RajagopalanS = "Sridhar Rajagopalan" }
2186 @string{RakpenthaiC = "C. Rakpenthai" }
2187 @string{RamachandranV = "Vijaya Ramachandran" }
2188 @string{RamageD = "Daniel Ramage" }
2189 @string{RamalingamG = "G. Ramalingam" }
2190 @string{RamamoorthyCV = "C. V. Ramamoorthy" }
2191 @string{RamanR = "Rajeev Raman" }
2192 @string{RamchandranK = "Kannan Ramchandran" }
2193 @string{RamLS = "L. Shankar Ram" }
2194 @string{RandWM = "William M. Rand" }
2195 @string{RanganCP = "C. Pandu Rangan" }
2196 @string{RangwalaS = "Sumit Rangwala" }
2197 @string{RaoF = "Francesco Rao" }
2198 @string{RaoS = "Satish Rao" }
2199 @string{RaphaelB = "Bertram Raphael" }
2200 @string{RatanamahatanaCA = "Chotirat Ann Ratanamahatana" }
2201 @string{RatliffHD = "H. D. Ratliff" }
2202 @string{RatnasamyS = "Sylvia Ratnasamy" }
2203 @string{RaubalM = "Martin Raubal" }
2204 @string{RaviSS = "S.\ S.\ Ravi" }
2205 @string{RawitzD = "Dror Rawitz" }
2206 @string{RaychevV = "Veselin Raychev" }
2207 @string{RaymondJW = "John W. Raymond" }
2208 @string{RazenshteynI = "Ilya Razenshteyn" }
2209 @string{RazR = "Ran Raz" }
2210 @string{ReadRC = "Ronald C. Read" }
2211 @string{RebennackS = "Steffen Rebennack" }
2212 @string{RechtP = "Peter Recht" }
2213 @string{ReddyA = "Anoop Reddy" }
2214 @string{RednerS = "Sidney Redner" }
2215 @string{ReggianiMG = "Marcello G. Reggiani" }
2216 @string{ReichardtJ = "J{\"o}rg Reichardt" }
2217 @string{ReifJH = "John H. Reif" }
2218 @string{ReineltG = "Gerhard Reinelt" }
2219 @string{ReingoldEM = "Edward M. Reingold" }
2220 @string{ReischukR = "R{\"u}diger Reischuk" }
2221 @string{ReissT = "Thomas Rei{\ss{}}" }
2222 @string{ReitzKP = "Karl P.\ Reitz" }
2223 @string{RendlF = "Franz Rendl" }
2224 @string{RenyiA = "Alfred R{\'e}nyi" }
2225 @string{RepsT = "Thomas Reps" }
2226 @string{ResendeM = "Mauricio Resende" }
2227 @string{RexeisM = "Martin Rexeis" }
2228 @string{RexfordJ = "Jennifer Rexford" }
2229 @string{ReyesP = "Reyes, Pedro" }
2230 @string{RezuchaI = "Ivan Rezucha" }
2231 @string{RiceJA = "John A.\ Rice" }
2232 @string{RiceM = "Michael Rice" }
2233 @string{RichaAW = "Andrea W. Richa" }
2234 @string{RichardsonS = "Sylvia Richardson" }
2235 @string{RichardsWD = "William D.\ Richards" }
2236 @string{RichmondLB = "L.\ Bruce Richmond" }
2237 @string{RichterS = "Stefan Richter" }
2238 @string{RickenbachPv = "Pascal von Rickenbach" }
2239 @string{RiddleM = "Mark Riddle" }
2240 @string{RiegerD = "David Rieger" }
2241 @string{RijsbergenCJ = "C. J. Rijsbergen" }
2242 @string{RilettLR = "L. R. Rilett" }
2243 @string{RileyC = "Chris Riley" }
2244 @string{RinaldiG = "Giovanni Rinaldi" }
2245 @string{RingelG = "Gerhard Ringel" }
2246 @string{RinnooyKanAHG = "Alexander H. G. Rinnooy Kan" }
2247 @string{RiordanOM = "Oliver M. Riordan" }
2248 @string{RipphausenLipaH = "Heike Ripphausen-Lipa" }
2249 @string{RivestRL = "Ronald L. Rivest" }
2250 @string{RivlinE = "Ehud Rivlin" }
2251 @string{RizzoliAE = "Andrea E. Rizzoli" }
2252 @string{RobertsFS = "Fred S.\ Roberts" }
2253 @string{RobertsGO = "Roberts, Gareth O." }
2254 @string{RobertsM = "Maxwell Roberts" }
2255 @string{RobinsG = "Garry Robins" }
2256 @string{RobsonD = "Drew Robson" }
2257 @string{RobsonJM = "John Michael Robson" }
2258 @string{RoddenT = "Tom Rodden" }
2259 @string{RodehM = "Michael Rodeh" }
2260 @string{RodittyL = "Liam Roditty" }
2261 @string{RogersDL = "David L. Rogers" }
2262 @string{RogersY = "Yvonne Rogers" }
2263 @string{RohnertH = "Hans Rohnert" }
2264 @string{RokneJ = "Jon Rokne" }
2265 @string{RollinJ = "Jonathan Rollin" }
2266 @string{RomanJ = "Jean Roman" }
2267 @string{RomneyAK = "A. Kimbal Romney" }
2268 @string{RomR = "Raphael Rom" }
2269 @string{RosamondF = "Frances Rosamond" }
2270 @string{RosenA = "A. Rosen" }
2271 @string{RosenbergC = "Catherine Rosenberg" }
2272 @string{RosenfeldA = "Azriel Rosenfeld" }
2273 @string{RosenstiehlP = "Pierre Rosenstiehl" }
2274 @string{RosenthalA = "Arnon S.~Rosenthal" }
2275 @string{RosenthalAr = "Arnie Rosenthal" }
2276 @string{RosenthalJS = "Rosenthal, Jeffrey S." }
2277 @string{Roshany-YamchiS = "S. Roshany-Yamchi" }
2278 @string{RossIC = "Ian C. Ross" }
2279 @string{RossmanithP = "Peter Rossmanith" }
2280 @string{RossSM = "Sheldon M. Ross" }
2281 @string{RoteG = "G{\"u}nter Rote" }
2282 @string{RothD = "Dan Roth" }
2283 @string{RottaR = "Randolf Rotta" }
2284 @string{RoughgardenT = "Tim Roughgarden" }
2285 @string{RoushFW = "F. W.\ Roush" }
2286 @string{RowlinsonP = "Peter Rowlinson" }
2287 @string{RoyleG = "Gordon Royle" }
2288 @string{RubiM = "Miguel Rubi" }
2289 @string{RubinDB = "Donald B.\ Rubin" }
2290 @string{RudellR = "Richard Rudell" }
2291 @string{RuhnauB = "Britta Ruhnau" }
2292 @string{RuiZ = "Zhang Rui" }
2293 @string{RumlW = "Wheeler Ruml" }
2294 @string{RundensteinerEA = "Elke A. Rundensteiner" }
2295 @string{RusD = "Daniela Rus" }
2296 @string{RuspiniEH = "Enrique H. Ruspini" }
2297 @string{RustinR = "Randall Rustin" }
2298 @string{RutterI = "Ignaz Rutter" }
2299 @string{RuttNE = "Norman E. Rutt" }
2300 @string{RuysP = "Picter H.M. Ruys" }
2301 @string{RuzikaS = "Stefan Ruzika" }
2303 @string{SaberiA = "Amin Saberi" }
2304 @string{SabidussiG = "Gert Sabidussi" }
2305 @string{SachenbacherM = "Martin Sachenbacher" }
2306 @string{SachsH = "Horst Sachs" }
2307 @string{SackJ = "J{\"o}rg-R{\"u}diger Sack" }
2308 @string{SadasivamS = "Sadish Sadasivam" }
2309 @string{SaerensM = "Marco Saerens" }
2310 @string{SafraS = "Shmuel Safra" }
2311 @string{SagieG = "Gonen Sagie" }
2312 @string{SahaB = "Barna Saha" }
2313 @string{SahniSK = "Sartaj K.\ Sahni" }
2314 @string{SaiaJ = "Jared Saia" }
2315 @string{SailerLD = "Lee Douglas Sailer" }
2316 @string{SaitohT = "Toshiki Saitoh" }
2317 @string{SaitoN = "N.~Saito" }
2318 @string{Sales-PardoM = "Marta Sales-Pardo" }
2319 @string{SalgadoLB = "Liliane Benning Salgado" }
2320 @string{SamaranayakeS = "Samitha Samaranayake" }
2321 @string{SametH = "Hanan Samet" }
2322 @string{SamiM = "Mariagiovanna Sami" }
2323 @string{SamukhinAN = "Alexander N. Samukhin" }
2324 @string{SandersP = "Peter Sanders" }
2325 @string{SankaranarayananJ = "Jagan Sankaranarayanan" }
2326 @string{SansoneC = "Carlo Sansone" }
2327 @string{SantiniM = "Massimo Santini" }
2328 @string{SantiP = "Paolo Santi" }
2329 @string{SantoroN = "Nicola Santoro" }
2330 @string{SantosJL = "Jose L. Santos" }
2331 @string{SaranH = "Huzur Saran" }
2332 @string{SardasM = "Meir Sardas" }
2333 @string{SarelaM = "Mikko S{\"a}rel{\"a}" }
2334 @string{SaroiuS = "Stefan Saroiu" }
2335 @string{SarrafzadehM = "Majid Sarrafzadeh" }
2336 @string{SasseJ = "Jan-Ole Sasse" }
2337 @string{SatalinoG = "G. Satalino" }
2338 @string{SatishN = "Nadathur Satish" }
2339 @string{SatyanarayanaA = "A. Satyanarayana" }
2340 @string{SauerwaldT = "Thomas Sauerwald" }
2341 @string{SaulL = "Lawrence Saul" }
2342 @string{SaumellM = "Maria Saumell" }
2343 @string{SaupeD = "Dietmar Saupe" }
2344 @string{SavageCD = "Carla D.\ Savage" }
2345 @string{SavageSD = "Shaun D. Savage" }
2346 @string{SavvidesA = "Andreas Savvides" }
2347 @string{SawardeckerEN = "E. N. Sawardecker" }
2348 @string{SawitzkiD = "Daniel Sawitzki" }
2349 @string{ScalaA = "Antonio Scala" }
2350 @string{ScarselliF = "Scarselli, Franco" }
2351 @string{SchachtebeckM = "Michael Schachtebeck" }
2352 @string{SchaderM = "Martin Schader" }
2353 @string{SchaeferM = "Marcus Schaefer" }
2354 @string{SchaefferG = "Gilles Schaeffer" }
2355 @string{SchaefferJ = "Jonathan Schaeffer" }
2356 @string{SchaefferSE = "Satu Elisa Schaeffer" }
2357 @string{SchafferAA = "Alejando A. Sch{\"a}ffer" }
2358 @string{SchambergerS = "Stefan Schamberger" }
2359 @string{SchankT = "Thomas Schank" }
2360 @string{ScharnhorstA = "Andrea Scharnhorst" }
2361 @string{ScheidelerC = "Christian Scheideler" }
2362 @string{ScheinermanER = "Edward R. Scheinerman" }
2363 @string{SchieberB = "Baruch Schieber" }
2364 @string{SchieferdeckerD = "Dennis Schieferdecker" }
2365 @string{SchikarskiA = "Andreas Schikarski" }
2366 @string{SchillingH = "Heiko Schilling" }
2367 @string{SchimkeA = "Antje Schimke" }
2368 @string{SchirraS = "Stefan Schirra" }
2369 @string{SchlafliL = "Ludwig Schl{\"a}fli" }
2370 @string{SchlickenriederW = "Wolfram Schlickenrieder" }
2371 @string{SchloegelK = "Kirk Schloegel" }
2372 @string{SchmeichelEF = "Edward F.~Schmeichel" }
2373 @string{SchmidJ = "Johannes Schmid" }
2374 @string{SchmidtEM = "Erik Meineche Schmidt" }
2375 @string{SchmidtJM = "Jens M. Schmidt" }
2376 @string{SchmidtM = "Marie Schmidt" }
2377 @string{SchmochU = "Ulrich Schmoch" }
2378 @string{SchneeM = "Mathias Schnee" }
2379 @string{SchneiderK = "Karsten Schneider" }
2380 @string{SchneiderV = "Volker Schneider" }
2381 @string{SchneidewindJ = "J{\"o}rn Schneidewind" }
2382 @string{SchnorrCP = "Claus P. Schnorr" }
2383 @string{SchnyderW = "Walter Schnyder" }
2384 @string{SchodlA = "Arno Sch{\"o}dl" }
2385 @string{SchoebelA = "Anita Sch{\"o}bel" }
2386 @string{SchoelkopfB = "Bernhard Sch{\"o}lkopf" }
2387 @string{SchoenfeldR = "Robby Sch{\"o}nfeld" }
2388 @string{SchoeningU = "Uwe Sch{\"o}ning" }
2389 @string{SchrammO = "Oded Schramm" }
2390 @string{SchreckT = "Tobias Schreck" }
2391 @string{SchreiberF = "Falk Schreiber" }
2392 @string{SchreiberR = "Robert Schreiber" }
2393 @string{SchrijverA = "Alexander Schrijver" }
2394 @string{SchuetzB = "Birk Sch{\"u}tz" }
2395 @string{SchuetzP = "Philipp Schuetz" }
2396 @string{SchuhmannJ = "Julian Schuhmann" }
2397 @string{SchultesD = "Dominik Schultes" }
2398 @string{SchultzM = "Michelle Schultz" }
2399 @string{SchultzT = "Tanja Schultz" }
2400 @string{SchulzA = "Andr{\'e} Schulz" }
2401 @string{SchulzC = "Christian Schulz" }
2402 @string{SchulzeA = "Anna Schulze" }
2403 @string{SchulzF = "Frank Schulz" }
2404 @string{SchummA = "Andrea Schumm" }
2405 @string{SchusterHG = "Heinz Georg Schuster" }
2406 @string{SchusterS = "S. Schuster" }
2407 @string{SchutteC = "Christof Sch{\"u}tte" }
2408 @string{SchutterBD = "Bart De Schutter" }
2409 @string{SchwabA = "A.J. Schwab" }
2410 @string{SchwartzJE = "Joseph E. Schwartz" }
2411 @string{SchwartzMR = "M. R. Schwartz" }
2412 @string{SchweinbergerM = "Michael Schweinberger" }
2413 @string{SchwenkAJ = "Allen J. Schwenk" }
2414 @string{SchwentickT = "Thomas Schwentick" }
2415 @string{SchwikowskiB = "Benno Schwikowski" }
2416 @string{SciomachenA = "Anna Sciomachen" }
2417 @string{ScottD = "Dana Scott" }
2418 @string{ScottJ = "John Scott" }
2419 @string{ScottJA = "Jennifer A.\ Scott" }
2420 @string{ScottK = "Kelley Scott" }
2421 @string{ScutellaMG = "Maria Grazia Scutell{\`a}" }
2422 @string{SearyAJ = "Andrew J. Seary" }
2423 @string{SedgewickR = "Robert Sedgewick" }
2424 @string{SeegerB = "Bernhard Seeger" }
2425 @string{SeeleyJR = "John R. Seeley" }
2426 @string{SeeryJB = "J. B. Seery" }
2427 @string{SeetharamanS = "Srinivasan Seetharaman" }
2428 @string{SegalM = "Michael Segal" }
2429 @string{SegoviaJ = "Javier Segovia" }
2430 @string{SeidelE = "Eike Seidel" }
2431 @string{SeidmanSB = "Stephen B.\ Seidman" }
2432 @string{SellenA = "Abigail Sellen" }
2433 @string{SellmannM = "Meinolf Sellmann" }
2434 @string{SelmanB = "Bart Selman" }
2435 @string{SeltserMA = "Michael A. Seltser" }
2436 @string{SenS = "Sandeep Sen" }
2437 @string{SensenN = "Norbert Sensen" }
2438 @string{SernaM = "Mar{\'i}a Serna" }
2439 @string{SerraO = "Oriol Serra" }
2440 @string{ServettoSD = "Sergio D.~Servetto" }
2441 @string{SeymourPD = "Paul D. Seymour" }
2442 @string{ShahabiC = "Cyrus Shahabi" }
2443 @string{ShaharS = "Shimon Shahar" }
2444 @string{ShahC = "C. Shah" }
2445 @string{ShahrokhiF = "Farhad Shahrokhi" }
2446 @string{ShallcrossD = "David Shallcross" }
2447 @string{ShamirR = "Ron Shamir" }
2448 @string{ShamosMI = "Michael I. Shamos" }
2449 @string{ShannonCE = "Claude E. Shannon" }
2450 @string{ShannonP = "Paul Shannon" }
2451 @string{SharaihaYM = "Y. M. Sharaiha" }
2452 @string{SharanR = "Roded Sharan" }
2453 @string{SharirM = "Micha Sharir" }
2454 @string{ShavittY = "Yuval Shavitt" }
2455 @string{ShawP = "Peter Shaw" }
2456 @string{ShearerK = "Kim Shearer" }
2457 @string{ShengC = "Cheng Sheng" }
2458 @string{ShengL = "Li Sheng" }
2459 @string{ShenH = "Hong Shen" }
2460 @string{ShenHT = "Heng Tao Shen" }
2461 @string{ShenkerS = "Scott Shenker" }
2462 @string{ShenkerSJ = "Scott J. Shenker" }
2463 @string{ShenOrrS = "Shai Shen-Orr" }
2464 @string{ShieberSM = "Stuart M. Shieber" }
2465 @string{ShierDR = "Douglas R. Shier" }
2466 @string{ShiJ = "Jianbo Shi" }
2467 @string{ShiloachY = "Yossi Shiloach" }
2468 @string{ShimbelA = "Alfonso Shimbel" }
2469 @string{ShimouraH = "H. Shimoura" }
2470 @string{ShinC = "Chan-Su Shin" }
2471 @string{ShinodaK = "Kosuke Shinoda" }
2472 @string{ShirakawaI = "Isao Shirakawa" }
2473 @string{ShirE = "Eran Shir" }
2474 @string{ShireyPR = "Paul R. Shirey" }
2475 @string{ShivakumarN = "N.R. Shivakumar" }
2476 @string{ShmoysDB = "David B. Shmoys" }
2477 @string{ShmulyianB = "B.~Shmulyian" }
2478 @string{ShneidermanB = "Ben Shneiderman" }
2479 @string{ShorPW = "Peter W. Shor" }
2480 @string{ShubinaG = "Galina Shubina" }
2481 @string{SiebenhallerM = "Martin Siebenhaller" }
2482 @string{SiekJG = "Jeremy G. Siek" }
2483 @string{SierksmaG = "Gerard Sierksma" }
2484 @string{SiganosG = "Georgos Siganos" }
2485 @string{SilvaF = "Fabio Silva" }
2486 @string{SilvaVd = "Vin de Silva" }
2487 @string{SilveiraRI = "Rodrigo I. Silveira" }
2488 @string{SilversteinC = "Craig Silverstein" }
2489 @string{SilvestriR = "Riccardo Silvestri" }
2490 @string{SimFM = "F. M. Sim" }
2491 @string{SimicS = "Slobodan Simic" }
2492 @string{SimonH = "Hort Simon" }
2493 @string{SimonHD = "Horst D. Simon" }
2494 @string{SimonovitsM = "Mikl{\'o}s Simonovits" }
2495 @string{SinclairA = "Alistair Sinclair" }
2496 @string{SinclairP = "Philip Sinclair" }
2497 @string{SinghB = "Brajendra K. Singh" }
2498 @string{SinghM = "Mohit Singh" }
2499 @string{SipserM = "Michael Sipser" }
2500 @string{SipsM = "Mike Sips" }
2501 @string{SiuK = "Kai-Yeung Siu" }
2502 @string{SivakumarD = "D. Sivakumar" }
2503 @string{SixJM = "Janet M. Six" }
2504 @string{SkordasT = "Thomas Skordas" }
2505 @string{SkriverAJ = "Anders J. Skriver" }
2506 @string{SkvoretzJ = "John Skvoretz" }
2507 @string{SkyumS = "Sven Skyum" }
2508 @string{SlaterP = "Peter J. Slater" }
2509 @string{SleaterDD = "Daniel D. Sleater" }
2510 @string{SlijepcevicS = "Sasa Slijepcevic" }
2511 @string{SlivkinsA = "Aleksandrs Slivkins" }
2512 @string{SliwinskiA = "Adam Sliwinski" }
2513 @string{SloaneNJ = "Neil James Alexander Sloane" }
2514 @string{SlobW = "Wouter Slob" }
2515 @string{SlootenE = "Elisabeth Slooten" }
2516 @string{SlutzkiG = "Slutzki, Giora" }
2517 @string{SmartC = "Christian Smart" }
2518 @string{SmidM = "Michiel Smid" }
2519 @string{SmidMH = "Michiel H. Smid" }
2520 @string{SmithCAB = "C. A. B. Smith" }
2521 @string{SmithRL = "Robert L. Smith" }
2522 @string{SmythP = "Padhraic Smyth" }
2523 @string{SmythWF = "William F. Smyth" }
2524 @string{SneathPHA = "Peter H. A. Sneath" }
2525 @string{SnellJL = "James Laurie Snell" }
2526 @string{SneltingG = "Gregor Snelting" }
2527 @string{SnijdersTAB = "Tom A.B.\ Snijders" }
2528 @string{SnoeyinkJ = "Jack Snoeyink" }
2529 @string{SoisalonSoininenE = "Eljas Soisalon-Soininen" }
2530 @string{SokalRR = "Robert R. Sokal" }
2531 @string{SokolowskiS = "Stefan Sokolowski" }
2532 @string{SommerC = "Christian Sommer" }
2534 @string{sonivis = "{SONIVIS} team" }
2536 @string{SonntagG = "Gerit Sonntag" }
2537 @string{SoperAJ = "A. J. Soper" }
2538 @string{SosVT = "Vera T. S{\'o}s" }
2539 @string{SotoM = "Mauricio Soto" }
2540 @string{SoumisF = "Francois Soumis" }
2541 @string{SouzaA = "Alexander Offtermatt-Souza" }
2542 @string{SparmannU = "Uwe Sparmann" }
2543 @string{SpeckJ = "Jochen Speck" }
2544 @string{SpeckmannB = "Bettina Speckmann" }
2545 @string{SpencerJ = "Joel Spencer" }
2546 @string{SpiegelhalterDJ = "David J.\ Spiegelhalter" }
2547 @string{SpielmanDA = "Daniel A.\ Spielman" }
2548 @string{SpiliopoulouM = "Myra Spiliopoulou" }
2549 @string{SpillnerA = "Andreas Spillner" }
2550 @string{SpirakisP = "Paul Spirakis" }
2551 @string{SpitadakisV = "Vassilis Spitadakis" }
2552 @string{SprinzenM = "Merle Sprinzen" }
2553 @string{SridharS = "Srinath Sridhar" }
2554 @string{SrinivasanA = "Aravind Srinivasan" }
2555 @string{SrivastavA = "Anand Srivastav" }
2556 @string{SrivastavaJ = "Jaideep Srivastava" }
2557 @string{StadlerPF = "Peter F. Stadler" }
2558 @string{StadtentwicklungBf = "Bundesministerium f{\"u}r Stadtentwicklung" }
2559 @string{StanleyHE = "H. Eugene Stanley" }
2561 @string{staralliance = "{Star Alliance}" }
2563 @string{StataR = "Raymie Stata" }
2564 @string{StaudtC = "Christian Staudt" }
2565 @string{StegerA = "Angelika Steger" }
2566 @string{StegeU = "Ulrike Stege" }
2567 @string{SteglichCE = "Christian E. Steglich" }
2568 @string{StegmaierM = "Matthias Stegmaier" }
2569 @string{SteigeleS = "Stephan Steigele" }
2570 @string{SteiglitzK = "Kenneth Steiglitz" }
2571 @string{SteinbachM = "Michael Steinbach" }
2572 @string{SteinC = "Clifford Stein" }
2573 @string{SteinitzE = "Erich Steinitz" }
2574 @string{SteinmetzR = "Ralf Steinmetz" }
2575 @string{SteinSK = "S. K. Stein" }
2576 @string{StephensonK = "Kenneth Stephenson" }
2577 @string{StephensonKA = "Karen A. Stephenson" }
2578 @string{SteponaviceI = "Ingrida Steponavice" }
2579 @string{SternHS = "Hal S.\ Stern" }
2580 @string{StillerS = "Sebastian Stiller" }
2581 @string{StixV = "Volker Stix" }
2582 @string{StockmeyerLJ = "Larry J. Stockmeyer" }
2583 @string{StoerJ = "Josef Stoer" }
2584 @string{StoerM = "Mechthild Stoer" }
2585 @string{StoerrleH = "Harald St{\"o}rrle" }
2586 @string{StokmanFN = "Frans N. Stokman" }
2587 @string{StoneAH = "A. H. Stone" }
2588 @string{StoneM = "Maureen Stone" }
2589 @string{StorandtS = "Sabine Storandt" }
2590 @string{StorkW = "Wilhelm Stork" }
2591 @string{StougieL = "Leen Stougie" }
2592 @string{StrasserB = "Ben Strasser" }
2593 @string{StraussD = "David Strauss" }
2594 @string{StrehlA = "Alexander Strehl" }
2595 @string{StrivastavaMB = "Mani B. Strivastava" }
2596 @string{StrogatzSH = "Steven H.\ Strogatz" }
2597 @string{SturtevantNR = "Nathan R.\ Sturtevant" }
2598 @string{SubramanianA = "Ashok Subramanian" }
2599 @string{SubramanianL = "Lakshminarayanan Subramanian" }
2600 @string{SudakovB = "Benny Sudakov" }
2601 @string{SudermanM = "Matthew Suderman" }
2602 @string{SugiyamaK = "Kozo Sugiyama" }
2603 @string{SuhlL = "Leena Suhl" }
2604 @string{SuJ = "Jianning Su" }
2605 @string{SunD = "D. Sun" }
2606 @string{SunderVS = "V. S. Sunder" }
2607 @string{SunF = "Feng Sun" }
2608 @string{SunI = "I-Fan Sun" }
2609 @string{SunJ = "Jimeng Sun" }
2610 @string{SunS = "Shiwei Sun" }
2611 @string{SupowitKJ = "Kenneth J. Supowit" }
2612 @string{SuriS = "Siddharth Suri" }
2613 @string{SuriSu = "Subhash Suri" }
2614 @string{SutersWH = "W. Henry Suters" }
2615 @string{SwamyMNS = "M. N. S. Swamy" }
2616 @string{SwartHC = "Henda C. Swart" }
2617 @string{SweetingWJ = "W. J. Sweeting" }
2618 @string{SykoraO = "Ondrej S{\'y}kora" }
2619 @string{SymonsCT = "Chris T. Symons" }
2620 @string{SymvonisA = "Antonios Symvonis" }
2621 @string{SysikaskiM = "Mikko Sysikaski" }
2622 @string{SzczepaniakPS = "Piotr S. Szczepaniak" }
2623 @string{SzekelyLA = "L{\'a}szl{\'o} A. Sz{\' e}kely" }
2625 @string{TaeubigH = "Hanjo T{\"a}ubig" }
2626 @string{TagawaS = "S. Tagawa" }
2627 @string{TainiterM = "Melvin Tainiter" }
2628 @string{TakafujiD = "Daisuke Takafuji" }
2629 @string{TakeuchiM = "M.~Takeuchi" }
2630 @string{TalbiEG = "El-Ghazali Talbi" }
2631 @string{TamakiH = "Hisao Tamaki" }
2632 @string{TamassiaR = "Roberto Tamassia" }
2633 @string{TangL = "Linqing Tang" }
2634 @string{TangmunarunkitH = "Hongsuda Tangmunarunkit" }
2635 @string{TanP = "Pang-Ning Tan" }
2636 @string{TantipathananandthC = "C. Tantipathananandth" }
2637 @string{TaokaS = "Satoshi Taoka" }
2638 @string{TaoY = "Yufei Tao" }
2639 @string{TardosE = "{\'E}va Tardos" }
2640 @string{TarjanR = "Robert Tarjan" }
2641 @string{TarjanRE = "Robert E. Tarjan" }
2642 @string{TaruiJ = "Jun Tarui" }
2643 @string{TassinariE = "Emanuele Tassinari" }
2644 @string{TassiulasL = "Leandros Tassiulas" }
2645 @string{TaubigH = "Hanjo T{\"a}ubig" }
2646 @string{TauroS = "Sudhir L. Tauro" }
2647 @string{TavaresG = "Gabriel Tavares" }
2648 @string{TaylorDS = "David S.\ Taylor" }
2649 @string{TaylorWW = "William W. Taylor" }
2650 @string{TeamRD = "{R Development Core Team}" }
2651 @string{TeboulleM = "Marc Teboulle" }
2652 @string{TelG = "Gerard Tel" }
2653 @string{TellerS = "Seth Teller" }
2654 @string{TenenbaumJB = "Joshua B. Tenenbaum" }
2655 @string{TenfeldePodehlD = "Dagmar Tenfelde-Podehl" }
2656 @string{TengS = "Shang-Hau Teng" }
2657 @string{TenmokuK = "K. Tenmoku" }
2658 @string{TeukolskySA = "Saul A. Teukolsky" }
2659 @string{ThaiMT = "My T. Thai" }
2660 @string{ThatcherJW = "James W. Thatcher" }
2661 @string{TheesfeldC = "Chandra Theesfeld" }
2662 @string{TheodorakisD = "Dimitris Theodorakis" }
2663 @string{TheuneD = "Dirk Theune" }
2664 @string{ThomasGR = "George Rubin Thomas" }
2665 @string{ThomasianA = "Alexander Thomasian" }
2666 @string{ThomasJA = "Joy A. Thomas" }
2667 @string{ThomasRE = "R. Emerson Thomas" }
2668 @string{ThomassenC = "Carsten Thomassen" }
2669 @string{ThorupM = "Mikkel Thorup" }
2670 @string{ThrunS = "Sebastian Thrun" }
2671 @string{ThulasiramanK = "K. Thulasiraman" }
2672 @string{ThurimellaR = "Ramakrishna Thurimella" }
2673 @string{ThurstonD = "Dylan Thurston" }
2674 @string{ThurstonWP = "William Paul Thurston" }
2675 @string{TianS = "Songlin Tian" }
2676 @string{TielertT = "Tessa Tielert" }
2677 @string{TilfordJS = "John S. Tilford" }
2678 @string{TillichJP = "Jean-Pierre Tillich" }
2679 @string{TimajevL = "Larissa Timajev" }
2680 @string{TimofeevEA = "Eugeniy A. Timofeev" }
2681 @string{TindellR = "Ralph Tindell" }
2682 @string{TinhoferG = "Gottfried Tinhofer" }
2683 @string{TittmannP = "Peter Tittmann" }
2684 @string{TjandraSA = "Stevanus A. Tjandra" }
2685 @string{TodaM = "M. Toda" }
2686 @string{TokushigeN = "Norihide Tokushige" }
2687 @string{TokuyamaT = "Takeshi Tokuyama" }
2688 @string{TolkienJR = "John Ronald Reuel Tolkien" }
2689 @string{TollisIG = "Ioannis G.~Tollis" }
2690 @string{TomborB = "B. Tombor" }
2691 @string{TomkinsAS = "Andrew S. Tomkins" }
2692 @string{TomlinJ = "Tomlin, John" }
2693 @string{TongP = "Po Tong" }
2694 @string{ToppJ = "Jerzy Topp" }
2695 @string{ToranJ = "Jacobo Toran" }
2696 @string{TorczonL = "Linda Torczon" }
2697 @string{TorgersonWS = "Warren S. Torgerson" }
2698 @string{TorrPH = "Philip H. Torr" }
2699 @string{TothC = "Csaba D. T{\'o}th" }
2700 @string{TothP = "Paolo Toth" }
2701 @string{ToussaintGT = "Godfried T.\ Toussaint" }
2702 @string{TowslefD = "Don Towslef" }
2703 @string{TowsleyD = "Don Towsley" }
2704 @string{ToyodaM = "Masashi Toyoda" }
2705 @string{TraubJF = "Joseph F. Traub" }
2706 @string{TrieschE = "Eberhard Triesch" }
2707 @string{TripathiA = "Amitabha Tripathi" }
2708 @string{TrojanowskiAE = "Anthony E. Trojanowski" }
2709 @string{TrottaF = "Francesco Trotta" }
2710 @string{TrotterWT = "William T. Trotter" }
2711 @string{TroyanskayaO = "Olga Troyanskaya" }
2712 @string{TrudingerNS = "Neil S. Trudinger" }
2713 @string{TruszczynskiM = "Miroslaw Truszczy{\'n}ski" }
2714 @string{TsaiCC = "Chun Che Tsai" }
2715 @string{TsaparasP = "Tsaparas, Panayiotis" }
2716 @string{TsengY = "Yu-Chee Tseng" }
2717 @string{TsioutsiouliklisK = "Kostas Tsioutsiouliklis" }
2718 @string{TsirogiannisC = "Constantinos Tsirogiannis" }
2719 @string{TsokaS = "Sophia Tsoka" }
2720 @string{TsotrasV = "Vassilis Tsotras" }
2721 @string{TsourosK = "Konstantinos-Klaudius Tsouros" }
2722 @string{TsukiyamaS = "Shuji Tsukiyama" }
2723 @string{TsurD = "Dekel Tsur" }
2724 @string{TsurumiT = "Toshiyuki Tsurumi" }
2725 @string{TuckerAW = "Albert William Tucker" }
2726 @string{TuckerTW = "Thomas W. Tucker" }
2727 @string{TufteE = "Edward Tufte" }
2728 @string{TungL = "L. Tung" }
2729 @string{TungTungC = "Chi Tung Tung" }
2730 @string{TunkelangD = "Daniel Tunkelang" }
2731 @string{TuranP = "P{\'a}l Tur{\'a}n" }
2732 @string{TurauV = "Volker Turau" }
2733 @string{TurkG = "Greg Turk" }
2734 @string{TusnadyG = "G{\'a}bor Tusn{\'a}dy" }
2735 @string{TutteWT = "William T. Tutte" }
2736 @string{TutzG = "Gerhard Tutz" }
2737 @string{TzengH = "Hong-Yi Tzeng" }
2739 @string{UatrongjitS = "S. Uatrongjit" }
2740 @string{UeharaR = "Ryuhei Uehara" }
2741 @string{UetzP = "Peter Uetz" }
2742 @string{UlanowiczRE = "Robert E. Ulanowicz" }
2743 @string{UllmanJD = "Jeffrey D. Ullman" }
2744 @string{UngererT = "Theo Ungerer" }
2745 @string{UngerSH = "Stephen H. Unger" }
2746 @string{UnoT = "Takeaki Uno" }
2747 @string{UpfalE = "Eli Upfal" }
2749 @string{VadhanSP = "Salil P. Vadhan" }
2750 @string{VahrenholdJ = "Jan Vahrenhold" }
2751 @string{VaidyaPM = "Pravin M. Vaidya" }
2752 @string{ValdesJ = "Jacobo Valdes" }
2753 @string{ValenteTW = "Thomas W. Valente" }
2754 @string{ValenzuelaJ = "Valenzuela, Jes{\'u}s" }
2755 @string{ValiantLG = "Leslie G. Valiant" }
2756 @string{VandenbergheL = "Lieven Vandenberghe" }
2757 @string{VanEmdeBoasP = "Peter van Emde Boas" }
2758 @string{VanRyzinJ = "Van Ryzin, J." }
2759 @string{VanvyveD = "Denis Vanvyve" }
2760 @string{VapnikVN = "Vladimir N. Vapnik" }
2761 @string{VargiuF = "Francesco Vargiu" }
2762 @string{VasconcellosM = "Marcio Vasconcellos" }
2763 @string{VassilevskaV = "Virginia Vassilevska" }
2764 @string{VassilvitskiiS = "Sergei Vassilvitskii" }
2765 @string{VaughanC = "Courtenay Vaughan" }
2766 @string{VaziraniU = "Umesh Vazirani" }
2767 @string{VaziraniVV = "Vijay V. Vazirani" }
2768 @string{VazirgiannisM = "Michalis Vazirgiannis" }
2769 @string{VazquezA = "Alexei V{\'a}zquez" }
2770 @string{VecchiMP = "Mario P. Vecchi" }
2771 @string{VedovaGD = "Gianluca Della Vedova" }
2772 @string{VekslerO = "Olga Veksler" }
2773 @string{VempalaS = "Santosh Vempala" }
2774 @string{VenkatacharyS = "Srinivasan Venkatachary" }
2775 @string{VentoM = "Mario Vento" }
2776 @string{VerbeekK = "Kevin Verbeek" }
2777 @string{VerleysenM = "Michel Verleysen" }
2778 @string{VermaD = "Deepak Verma" }
2779 @string{VeselovskyAV = "Alexander V. Veselovsky" }
2780 @string{VespignaniA = "Alessandro Vespignani" }
2781 @string{VettaA = "Adrian Vetta" }
2782 @string{VetterC = "Christian Vetter" }
2783 @string{VetterlingWT = "William T. Vetterling" }
2784 @string{VicsekT = "Tam{\'a}s Vicsek" }
2785 @string{ViennotL = "Laurent Viennot" }
2786 @string{VigerF = "Fabien Viger" }
2787 @string{VignaS = "Sebastiano Vigna" }
2788 @string{VigoD = "Daniele Vigo" }
2789 @string{VillarMT = "Villar, Maria Trinidad" }
2790 @string{VinayV = "V. Vinay" }
2791 @string{VismaraL = "Luca Vismara" }
2793 @string{visone = "visone project" }
2795 @string{VitaleC = "Camillo Vitale" }
2796 @string{VitterJS = "Jeffrey S. Vitter" }
2797 @string{VockingB = "Berthold V{\"o}cking" }
2798 @string{VolijO = "Volij, Oscar" }
2799 @string{VolinskyC = "Chris Volinsky" }
2800 @string{VolkerL = "Lars Volker" }
2801 @string{VolkerM = "Markus V{\"o}lker" }
2802 @string{VolkmannL = "Lutz Volkmann" }
2803 @string{VollmerH = "Heribert Vollmer" }
2804 @string{VriesRD = "Remco De Vries" }
2805 @string{VrtoI = "Imrich Vrto" }
2806 @string{VuCT = "Chinh T. Vu" }
2807 @string{VukadinovicD = "Danica Vukadinovi{\'c}" }
2808 @string{VuV = "Van Vu" }
2809 @string{VygenJ = "Jens Vygen" }
2810 @string{VyskocilT = "Tom{\'a}s Vyskocil" }
2812 @string{WadaK = "Koichi Wada" }
2813 @string{WaddellP = "Paul Waddell" }
2814 @string{WagnerCG = "Christopher G. Wagner" }
2815 @string{WagnerD = "Dorothea Wagner" }
2816 @string{WagnerF = "Frank Wagner" }
2817 @string{WagnerK = "Klaus Wagner" }
2818 @string{WagnerS = "Silke Wagner" }
2819 @string{WahlsterW = "Wolfgang Wahlster" }
2820 @string{WakabayashiY = "Yoshiko Wakabayashi" }
2821 @string{WakitaK = "Ken Wakita" }
2822 @string{WallCE = "Curtiss E. Wall" }
2823 @string{WallensteinS = "Sylvan Wallenstein" }
2824 @string{WalshawC = "Chris Walshaw" }
2825 @string{WalshT = "Toby Walsh" }
2826 @string{WalshTR = "T. R. Walsh" }
2827 @string{WangB = "Bei Wang" }
2828 @string{WangC = "Chen Wang" }
2829 @string{WangChao = "Chao Wang" }
2830 @string{WangG = "Grant Wang" }
2831 @string{WangH = "Haitao Wang" }
2832 @string{WangJ = "Joseph Wang" }
2833 @string{WangJT = "Jonathan T. Wang" }
2834 @string{WangN = "Nan Wang" }
2835 @string{WangT = "Tengjiao Wang" }
2836 @string{WangX = "Xiaobo Wang" }
2837 @string{WangY = "Yuexuan Wang" }
2838 @string{WangYa = "Yajun Wang" }
2839 @string{WangYJ = "Yuchung J.\ Wang" }
2840 @string{WangYu = "Yu Wang" }
2841 @string{WankaR = "Rolf Wanka" }
2842 @string{WanxingS = "Sheng Wanxing" }
2843 @string{WarburtonA = "Arthur Warburton" }
2844 @string{WardenT = "Tobias Warden" }
2845 @string{WareC = "Colin Ware" }
2846 @string{WarmuthMK = "Manfred K. Warmuth" }
2847 @string{WarnowT = "Tandy Warnow" }
2848 @string{WarshallS = "Stephen Warshall" }
2849 @string{WassermanS = "Stanley Wasserman" }
2850 @string{WatanabeT = "Toshimasa Watanabe" }
2851 @string{WatkinsDS = "David S.\ Watkins" }
2852 @string{WattenhoferM = "Mirjam Wattenhofer" }
2853 @string{WattenhoferR = "Roger Wattenhofer" }
2854 @string{WattsA = "Alison Watts" }
2855 @string{WattsDJ = "Duncan J.\ Watts" }
2856 @string{WaxmanBM = "Bernard M. Waxman" }
2857 @string{WeberA = "Alfred Weber" }
2858 @string{WeberP = "Pascal Weber" }
2859 @string{WegenerI = "Ingo Wegener" }
2860 @string{WegmanMN = "Mark N. Wegman" }
2861 @string{WehrleK = "Klaus Wehrle" }
2862 @string{WeiF = "Fang Wei" }
2863 @string{WeigtM = "Martin Weigt" }
2864 @string{WeiheK = "Karsten Weihe" }
2865 @string{WeikumG = "Gerhard Weikum" }
2866 @string{WeinerP = "Peter Weiner" }
2867 @string{WeiskircherR = "Ren{\'e} Weiskircher" }
2868 @string{WeissY = "Yair Weiss" }
2869 @string{WelshDJ = "Dominic J. A. Welsh" }
2870 @string{WelzlE = "Emo Welzl" }
2871 @string{WenkC = "Carola Wenk" }
2872 @string{WenkMR = "Markus R. Wenk" }
2873 @string{WerneckR = "Renato F. Werneck" }
2874 @string{WesselsD = "Duane Wessels" }
2875 @string{WestbrookJ = "Jeffery Westbrook" }
2876 @string{WestDB = "Douglas B.\ West" }
2877 @string{WestfechtelB = "Bernhard Westfechtel" }
2878 @string{WexlerT = "Tom Wexler" }
2879 @string{WeyerC = "Christoph Weyer" }
2880 @string{WheelockCE = "Craig E. Wheelock" }
2881 @string{WhiteA = "Andy White" }
2882 @string{WhitedDE = "D. E. Whited" }
2883 @string{WhiteDR = "Douglas R.\ White" }
2884 @string{WhiteHC = "Harrison C.\ White" }
2885 @string{WhiteHD = "Howard D.\ White" }
2886 @string{WhiteJA = "John A.\ White" }
2887 @string{WhiteleyW = "Walter Whiteley" }
2888 @string{WhiteS = "Scott White" }
2889 @string{WhitesidesSH = "Sue H.\ Whitesides" }
2890 @string{WhitneyH = "Hassler Whitney" }
2891 @string{WhittyRW = "R. W. Whitty" }
2892 @string{WhyteWF = "William F. Whyte" }
2893 @string{WibleA = "Adam Wible" }
2894 @string{WichmannA = "Arne Wichmann" }
2895 @string{WichmannT = "Thorsten Wichmann" }
2896 @string{WidmayerP = "Peter Widmayer" }
2897 @string{WidomJ = "Widom, Jennifer" }
2898 @string{WienerH = "Harry Wiener" }
2899 @string{WienerJ = "Janet Wiener" }
2900 @string{WieseR = "Roland Wiese" }
2901 @string{WigdersonA = "Avi Wigderson" }
2902 @string{WigginsCH = "Chris H.\ Wiggins" }
2903 @string{WignerEP = "Eugene P. Wigner" }
2904 @string{Wikipedia = "Wikipedia" }
2905 @string{WilfHS = "Herbert S. Wilf" }
2906 @string{WilhelmR = "Reinhard Wilhelm" }
2907 @string{WilkinsonD = "Dennis Wilkinson" }
2908 @string{WilkinsonJH = "James H. Wilkinson" }
2909 @string{WillardDE = "Dan E. Willard" }
2910 @string{WilletP = "Peter Willet" }
2911 @string{WillettP = "Peter Willett" }
2912 @string{WillhalmT = "Thomas Willhalm" }
2913 @string{WilliamsJ = "J.W.J. Williams" }
2914 @string{WilliamsonD = "David Williamson" }
2915 @string{WilliamsR = "Robert Williams" }
2916 @string{WilliamsT = "Thomas Williams" }
2917 @string{WilliamsVV = "Virginia Vassilevska Williams" }
2918 @string{WillingerW = "Walter Willinger" }
2919 @string{WillsGJ = "Graham J Wills" }
2920 @string{WinickJ = "Jared Winick" }
2921 @string{WinklerG = "Gerhard Winkler" }
2922 @string{WinogradS = "Shmuel Winograd" }
2923 @string{WinogradT = "Terry Winograd" }
2924 @string{WinskelG = "Glynn Winskel" }
2925 @string{WinstanleyA = "Adam Winstanley" }
2926 @string{WinterP = "Paul Winter" }
2927 @string{WinterS = "Stephan Winter" }
2928 @string{WintersSJ = "Steven J. Winters" }
2929 @string{WinterT = "Thomas Winter" }
2930 @string{WirthA = "Anthony Wirth" }
2931 @string{WismathSK = "Stephen K. Wismath" }
2932 @string{WoegingerGJ = "Gerhard J. Woeginger" }
2933 @string{WolfC = "Christian Wolf" }
2934 @string{WolfeP = "Philip Wolfe" }
2935 @string{WolffA = "Alexander Wolff" }
2936 @string{WolfK = "Katja Wolf" }
2937 @string{WolfsonO = "Ouri Wolfson" }
2938 @string{WolinskyA = "Asher Wolinsky" }
2939 @string{WolkowiczH = "Henry Wolkowicz" }
2940 @string{WolleT = "Thomas Wolle" }
2941 @string{WolseyLA = "Laurence A. Wolsey" }
2942 @string{WongGY = "George Y.\ Wong" }
2943 @string{WongJK = "J.K. Wong" }
2944 @string{WongKP = "Kit Po Wong" }
2945 @string{WoodDR = "David R. Wood" }
2946 @string{WoodPT = "Peter T. Wood" }
2947 @string{WoolA = "Avishai Wool" }
2948 @string{WormaldN = "Nicholas C.\ Wormald" }
2949 @string{WormaldNC = "Nicholas C.\ Wormald" }
2950 @string{WoutersF = "Fabien Wouters" }
2951 @string{WuchtyS = "Stefan Wuchty" }
2952 @string{WuF = "Fang Wu" }
2953 @string{WuJ = "Jinshan Wu" }
2954 @string{WuK = "Kesheng Wu" }
2955 @string{WuW = "Weili Wu" }
2956 @string{WuYH = "Yun Hui Wu" }
2957 @string{WuZ = "Zhenyu Wu" }
2959 @string{XiaG = "Ge Xia" }
2960 @string{XiaoY = "Yang Xiao" }
2961 @string{XieL = "Le Xie" }
2962 @string{XieY = "Yinglian Xie" }
2963 @string{XingX = "Xin Xing" }
2964 @string{XuB = "Bin Xu" }
2965 @string{XuD = "Dong Xu" }
2966 @string{XueJ = "Jue Xue" }
2967 @string{XueminL = "Lin Xuemin" }
2968 @string{XuG = "G. Xu" }
2969 @string{XuMH = "M. H. Xu" }
2970 @string{XuN = "Ning Xu" }
2971 @string{XuY = "Ying Xu" }
2972 @string{XuZ = "Zhao Xu" }
2974 @string{YagiuraM = "Mutsunori Yagiura" }
2975 @string{YanagisawaH = "Hiroki Yanagisawa" }
2976 @string{YanC = "Cairong Yan" }
2977 @string{YangYR = "Yang Richard Yang" }
2978 @string{YannakakisM = "Mihalis Yannakakis" }
2979 @string{YanX = "Xu Yan" }
2980 @string{YaoS = "So-Zen Yao" }
2981 @string{YaoY = "Yong Yao" }
2982 @string{YapHP = "Hian-Poh Yap" }
2983 @string{YatesF = "Frank Yates" }
2984 @string{YauS = "S.-T.\ Yau" }
2985 @string{YeeN = "Nicholas Yee" }
2986 @string{YenH = "Hsu-Chun Yen" }
2987 @string{YenJY = "Jin Y. Yen" }
2988 @string{YenL = "Luh Yen" }
2989 @string{YetukuriL = "Laxman Yetukuri" }
2990 @string{YeungRW = "Raymond W. Yeung" }
2991 @string{YeZ = "Zhenqing Ye" }
2992 @string{YoonCN = "Chang No Yoon" }
2993 @string{YoungNE = "Neal E. Young" }
2994 @string{YuD = "Dongxiao Yu" }
2995 @string{YuH = "Haobo Yu" }
2996 @string{YuHai = "Haicong Yu" }
2997 @string{YuJ = "Jun Yu" }
2998 @string{YuJeff = "Jeffrey Xu Yu" }
2999 @string{YuJX = "Jeffrey Xu Yu" }
3000 @string{YumTP = "Tak-Shing Peter Yum" }
3001 @string{Yun-huaL = "Li Yun-hua" }
3002 @string{YungM = "M. Yung" }
3003 @string{YuP = "Philip Yu" }
3004 @string{YuPS = "Philip S.\ Yu" }
3005 @string{YusterR = "Raphael Yuster" }
3006 @string{YuX = "Xiangdong Yu" }
3008 @string{yworks = "{yWorks GmbH}" }
3010 @string{ZabihR = "Ramin Zabih" }
3011 @string{ZachariasenM = "Martin Zachariasen" }
3012 @string{ZacharyWW = "Wayne W. Zachary" }
3013 @string{ZachosS = "Stathis Zachos" }
3014 @string{ZadehLA = "Lotfi A. Zadeh" }
3015 @string{ZadehN = "Norman Zadeh" }
3016 @string{ZahnCT = "C.\ T.\ Zahn" }
3017 @string{ZallingerM = "Michael Zallinger" }
3018 @string{ZaroliagisC = "Christos Zaroliagis" }
3019 @string{ZaversnikM = "Matja{\v z} Zaver{\v s}nik" }
3020 @string{ZeggelinkE = "E.P.H. Zeggelink" }
3021 @string{ZeguraEW = "Ellen W. Zegura" }
3022 @string{ZehaviA = "Avram Zehavi" }
3023 @string{ZelenM = "Marvin Zelen" }
3024 @string{ZelikovskyA = "Alexander Zelikovsky" }
3025 @string{ZelinkaB = "Bohdan Zelinka" }
3026 @string{ZeniosSA = "Stefanos A. Zenios" }
3027 @string{ZeyBT = "Bernd Thomas Zey" }
3028 @string{ZhaH = "Hongyuan Zha" }
3029 @string{ZhangA = "Aidong Zhang" }
3030 @string{ZhangH = "Honggang Zhang" }
3031 @string{ZhangHu = "Huaming Zhang" }
3032 @string{ZhangHui = "Hui Zhang" }
3033 @string{ZhangJ = "Jun Zhang" }
3034 @string{ZhangN = "Nan Zhang" }
3035 @string{ZhangP = "Peng Zhang" }
3036 @string{ZhangPu = "Pusheng Zhang" }
3037 @string{ZhangR = "Rui Zhang" }
3038 @string{ZhangY = "Yuanyi Zhang" }
3039 @string{ZhangYX = "Y. X. Zhang" }
3040 @string{ZhangYy = "Yun Zhang" }
3041 @string{ZhaoB = "Baohua Zhao" }
3042 @string{ZhaoX = "Xu Zhao" }
3043 @string{ZhaoYD = "Yang Dong Zhao" }
3044 @string{ZhengAX = "Alice X. Zheng" }
3045 @string{ZhengL = "Lanbo Zheng" }
3046 @string{ZhengX = "Xiaofei Zheng" }
3047 @string{ZhouA = "Aoying Zhou" }
3048 @string{ZhouH = "Haijun Zhou" }
3049 @string{ZhouJ = "Jiashuai Zhou" }
3050 @string{ZhouX = "Xiaofang Zhou" }
3051 @string{ZhouY = "Yunhong Zhou" }
3052 @string{ZhuB = "Binhai Zhu" }
3053 @string{ZickfeldF = "Florian Zickfeld" }
3054 @string{ZieglerG = "G{\"u}nter M. Ziegler" }
3055 @string{ZijlstraBJH = "Bonne J. H. Zijlstra" }
3056 @string{ZijlstraE = "E. Zijlstra" }
3057 @string{ZiliaskopoulosA = "Athanasios Ziliaskopoulos" }
3058 @string{ZivE = "Etay Ziv" }
3059 @string{ZlotowskiO = "Oliver Zlotowski" }
3060 @string{ZobristAL = "Albert Lindsey Zobrist" }
3061 @string{ZografosKG = "Konstantinos G. Zografos" }
3062 @string{ZollingerA = "Aaron Zollinger" }
3063 @string{ZubkovR = "Roman Zubkov" }
3064 @string{ZuendorfT = "Tobias Z{\"u}ndorf" }
3065 @string{ZweigKA = "Katharina A. Zweig" }
3066 @string{ZwickU = "Uri Zwick" }
3068 %% --------------------------------------------------------------
3070 %% --------------------------------------------------------------
3071 @string{pub-acm = "ACM Press" }
3072 @string{pub-ams = "American Mathematical Society" }
3073 @string{pub-ap = "Academic Press" }
3074 @string{pub-apraha = "Academia Praha" }
3075 @string{pub-aw = "Addison-Wesley" }
3076 @string{pub-birk = "Birkh{\"a}user Verlag" }
3077 @string{pub-bsp = "Booksurge Publishing" }
3078 @string{pub-ch = "Chapman~\& Hall/CRC" }
3079 @string{pub-cp = "Clarendon Press" }
3080 @string{pub-csp = "Computer Science Press" }
3081 @string{pub-cup = "Cambridge University Press" }
3082 @string{pub-cw = "Cohen~\& West LTD" }
3083 @string{pub-dp = "Duxbury Press" }
3084 @string{pub-freeman = "W.\,H.~Freeman and Company" }
3085 @string{pub-gb = "Gordon and Breach" }
3086 @string{pub-gmup = "George Mason University Press" }
3087 @string{pub-ics = "IEEE Computer Society" }
3088 @string{pub-ieeecs = "IEEE Computer Society Press" }
3089 @string{pub-jab = "Johann Ambrosius Barth Verlag" }
3090 @string{pub-jb = "Jossey Bass" }
3091 @string{pub-kapg = "Kluwer Academic Publishers Group" }
3092 @string{pub-lb = "Leske und Budrich" }
3093 @string{pub-maa = "Mathematical Association of America" }
3094 @string{pub-macmillan = "Macmillan" }
3095 @string{pub-mc = "Mathematisch Centrum" }
3096 @string{pub-mitpr = "MIT Press" }
3097 @string{pub-mohr = "J.\,C.\,B.~Mohr" }
3098 @string{pub-nauka = "Nauka" }
3099 @string{pub-nh = "North-Holland" }
3100 @string{pub-norton = "W.\,W.~Norton~\& Company" }
3101 @string{pub-oup = "Oxford University Press" }
3102 @string{pub-perseus = "Perseus Publishing" }
3103 @string{pub-ph = "Prentice Hall" }
3104 @string{pub-plenum = "Plenum Press" }
3105 @string{pub-pup = "Princeton University Press" }
3106 @string{pub-sage = "Sage" }
3107 @string{pub-siam = "SIAM" }
3108 @string{pub-springer = "Springer" }
3109 @string{pub-tjhup = "John Hopkins University Press" }
3110 @string{pub-utp = "University of Toronto Press" }
3111 @string{pub-wiley = "Wiley" }
3112 @string{pub-wileys = "John Wiley~\& Sons, Inc." }
3113 @string{pub-wiley-vch = "Wiley-VCH" }
3114 @string{pub-physica = "Physica-Verlag GmbH" }
3115 @string{pub-c = "Campus" }
3116 @string{pub-igi = "IfGI prints" }
3117 @string{pub-eup = "Edinburgh University Press" }
3118 @string{pub-sdg = "Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany" }
3119 @string{pub-cu = "Carleton University" }
3120 @string{pub-wsp = "World Scientific Publishing" }
3121 @string{pub-ucr = "University of California, Riverside" }
3122 @string{pub-bdgh = "Books on Demand GmbH" }
3123 @string{pub-ebv = "Elsevier B.V." }
3124 @string{pub-v = "Vieweg" }
3125 @string{pub-sav = "Spektrum Akademischer Verlag" }
3126 @string{pub-t = "Teubner" }
3127 @string{pub-usdc = "U.S. Department of the Census" }
3128 @string{pub-obl = "Oliver and Boyd, London" }
3129 @string{pub-bh = "Butterworth-Heinemann" }
3130 @string{pub-cti = "Course Technology Inc" }
3131 @string{pub-gp = "Graphics Press" }
3132 @string{pub-akpl = "AK Peters, Ltd." }
3133 @string{pub-mk = "Morgan Kaufmann" }
3134 @string{pub-asa = "American Statistical Association" }
3135 @string{pub-ucp = "University of Chicago Press" }
3136 @string{pub-uk = "Universit{\"a}tsverlag Karlsruhe" }
3137 @string{pub-acsi = "Australian Computer Society, Inc." }
3138 @string{pub-mrl = "Microsoft Research Ltd" }
3139 @string{pub-ukcrc = "UK Computer Research Committee" }
3140 @string{pub-fk = "Feldafinger Kreis" }
3141 @string{pub-r = "Ruksaldruck" }
3142 @string{pub-k = "K{\"o}nigsdruck" }
3143 @string{pub-dlgh = "Druckhaus Locher GmbH" }
3144 @string{pub-hniup = "Heinz Nixdorf Institut, Universit{\"at} Paderborn" }
3145 @string{pub-nsp = "Nova Science Publisher" }
3146 @string{pub-gau = "George Allen~\& Unwin" }
3147 @string{pub-vdmvdmk = "VDM Verlag Dr. Mueller e.K." }
3148 @string{pub-tdp = "The Dover Publications" }
3149 @string{pub-npg = "Nature Publishing Group" }
3150 @string{pub-uscb = "U.S. Census Bureau" }
3151 @string{pub-spietisoe = "SPIE--The International Society for Optical Engineering" }
3152 @string{pub-pie = "Pearson International Edition" }
3153 @string{pub-um = "University of Manitoba" }
3154 @string{pub-gi = "Gesellschaft f{\"u}r Informatik" }
3155 @string{pub-aaaip = "AAAI Press" }
3156 @string{pub-witp = "WIT Press" }
3157 @string{pub-ccl = "Civil-Comp Ltd." }
3158 @string{pub-auaip = "AUAI Press" }
3159 @string{pub-smi = "Selbstverlag des Mathematischen Instituts" }
3160 @string{pub-trb = "Transportation Research Board" }
3161 @string{pub-fvs = "Friedrick Vieweg~\& Son" }
3162 @string{pub-sim = "Society for Industrial Mathematics" }
3163 @string{pub-ov = "Oldenburg Verlag" }
3164 @string{pub-crcp = "CRC Press" }
3165 @string{pub-ieee = "IEEE" }
3166 @string{pub-wieeep = "Wiley-IEEE Press" }
3167 @string{pub-vtug = "Verlag der Technischen Universit{\"a}t Graz" }
3168 @string{pub-mghi = "MacGraw-Hill Inc." }
3170 %% --------------------------------------------------------------
3172 %% --------------------------------------------------------------
3174 @string{ser-ams_cbms = "CBMS Regional Conference Series in Mathematics" }
3175 @string{ser-ann_math_stud = "Annals of Mathematics Studies" }
3176 @string{ser-ch_tiss = "Chapman~\& Hall Texts in Statistical Science" }
3177 @string{ser-ima = "The IMA Volumes in Mathematics and its Applications" }
3178 @string{ser-lms_lns = "London Mathematical Society Lecture Note Series" }
3179 @string{ser-mct = "Mathematical Centre Tracts" }
3180 @string{ser-msap = "Monographs on Statistics and Applied Probability" }
3181 @string{ser-nato_ac = "NATO ASI Series C" }
3182 @string{ser-springer_gtm = "Graduate Texts in Mathematics" }
3183 @string{ser-springer_lncs = "Lecture Notes in Computer Science" }
3184 @string{ser-springer_lnm = "Lecture Notes in Mathematics" }
3185 @string{ser-springer_lnp = "Lecture Notes in Physics" }
3186 @string{ser-springer_mcs = "Monographs in Computer Science" }
3187 @string{ser-springer_stis = "Springer Texts in Statistics" }
3188 @string{ser-utp_me = "Mathematical Expositions" }
3189 @string{ser-wiley_dmo = "Discrete Mathematics and Optimization" }
3190 @string{ser-wiley_ps = "Wiley Series in Probability and Statistics" }
3191 @string{ser-dsp = "Dagstuhl Seminar Proceedings" }
3192 @string{ser-acm = "Algorithms and Computation in Mathmatics" }
3193 @string{ser-sass = "Structural Analysis in the Social Sciences" }
3194 @string{ser-csic = "Complex Systems and Interdisciplinary Science" }
3195 @string{ser-dimacsb = "DIMACS Book" }
3196 @string{ser-gielnilni = "GI-Edition---Lecture Notes in Informatics (LNI)" }
3197 @string{ser-entcs = "Electronic Notes in Theoretical Computer Science" }
3198 @string{ser-lnee = "Lecture Notes in Electrical Engineering" }
3199 @string{ser-bricsds = "BRICS Dissertation Series" }
3200 @string{ser-psc = "Princeton Studies in Complexity" }
3201 @string{ser-hniv = "HNI-Verlagsschriftenreihe" }
3202 @string{ser-wnmc = "Wireless Networks and Mobile Computing" }
3203 @string{ser-ms = "Mathematics and Statistics" }
3204 @string{ser-mmb = "Methods in Molecular Biology" }
3205 @string{ser-gtc = "Graph Theory and Combinatorics" }
3206 @string{ser-soia = "Springer Optimization and Its Applications" }
3207 @string{ser-oasioasi = "OpenAccess Series in Informatics (OASIcs)" }
3208 @string{ser-li = "Leitf{\"a}den der Informatik" }
3209 @string{ser-ttcs = "Texts in Theoretical Computer Science" }
3210 @string{ser-ema = "Encyclopedia of Mathematics and its Applications" }
3211 @string{ser-ewea = "Encyklop{\"a}die der mathematischen Wissenschaften mit Einschluss ihrer Anwendungen" }
3212 @string{ser-sscm = "Springer Series in Computational Mathematics" }
3213 @string{ser-lnsc = "Lecture Notes Series on Computing" }
3214 @string{ser-ac = "Algorithms and Combinatorics" }
3215 @string{ser-mmsg = "Mitteilungen aus dem Mathematischen Seminar Giessen" }
3216 @string{ser-tacp = "The Art of Computer Programming" }
3217 @string{ser-lni = "Lecture Notes in Informatics" }
3218 @string{ser-mdma = "Monographs on Discrete Mathematics and Applications" }
3219 @string{ser-wisdmo = "Wiley Interscience Series in Discrete Mathematics and Optimization" }
3220 @string{ser-is = "Informatik Spektrum" }
3221 @string{ser-it = "it--Information Technology" }
3222 @string{ser-tggs = "The Graphics Gems Series" }
3223 @string{ser-mivt = "Mitteilungen des Institutes f{\"u}r Verbrennungskraftmaschinen und Thermodynamik" }
3225 %% --------------------------------------------------------------
3227 %% --------------------------------------------------------------
3229 @string{dcg = "Discrete and Computational Geometry" }
3231 @string{j-abhmsuh = "Abhandlungen aus dem Mathematischen Seminar der Universit{\"a}t Hamburg" }
3232 @string{j-ac = "Annals of Combinatorics" }
3233 @string{j-acm = "Journal of the ACM" }
3234 @string{j-acm-ccr = "ACM SIGCOMM Computer Communication Review" }
3235 @string{j-acm-csur = "ACM Computing Surveys" }
3236 @string{j-acm-ea = "ACM Journal of Experimental Algorithmics" }
3237 @string{j-acm-mccr = "ACM SIGMOBILE Mobile Computing and Communications Review" }
3238 @string{j-acm-tchi = "ACM Transactions on Computer-Human Interaction" }
3239 @string{j-acm-tms = "ACM Transactions on Mathematical Software" }
3240 @string{j-acm-tois = "ACM Transactions on Information Systems" }
3241 @string{j-acmta = "ACM Transactions on Algorithms" }
3242 @string{j-acmtds = "ACM Transactions on Database Systems" }
3243 @string{j-acmtg = "ACM Transactions on Graphics" }
3244 @string{j-acmtkdd = "ACM Transactions on Knowledge Discovery from Data" }
3245 @string{j-acs = "Advances in Complex Systems" }
3246 @string{j-acta-inf = "Acta Informatica" }
3247 @string{j-actam = "Acta Mathematica" }
3248 @string{j-ai = "Artificial Intelligence" }
3249 @string{j-ajm = "American Journal of Mathematics" }
3250 @string{j-ajs = "American Journal of Sociology" }
3251 @string{j-alg = "Algorithmica" }
3252 @string{j-am = "Aequationes Mathematicae" }
3253 @string{j-amash = "Acta Mathematica Academiae Scientiarum Hungaricae" }
3254 @string{j-amath = "Annals of Mathematics" }
3255 @string{j-amb = "Algorithms for Molecular Biology" }
3256 @string{j-amc = "Applied Mathematics and Computation" }
3257 @string{j-amm = "American Mathematical Monthly" }
3258 @string{j-ams = "The Annals of Mathematical Statistics" }
3259 @string{j-aor = "Annals of Operations Research" }
3260 @string{j-ap = "Advances in Physics" }
3261 @string{j-apc = "Applied Physical Sciences" }
3262 @string{j-aphch = "Annalen der Physik und Chemie" }
3263 @string{j-apjor = "Asia-Pacific Journal of Operational Research (APJOR) " }
3264 @string{j-arch-math = "Archiv der Mathematik" }
3265 @string{j-arist = "Annual Review of Information Science and Technology" }
3266 @string{j-arsc = "Ars Combinatoria" }
3267 @string{j-asa = "Journal of the Acoustical Society of America" }
3268 @string{j-asms = "Acta Scientiarum Mathematicarum (Szeged)" }
3269 @string{j-asr = "American Sociological Review" }
3270 @string{j-au = "Algebra Universalis" }
3272 @string{j-b = "Bioinformatics" }
3273 @string{j-bes = "Behavioral Ecology and Sociobiology" }
3274 @string{j-bit = "BIT" }
3275 @string{j-bjmsp = "British Journal of Mathematical and Statistical Psychology" }
3276 @string{j-bmb = "Bulletin of Mathematical Biophysics" }
3277 @string{j-bmcsb = "BMC Systems Biology" }
3278 @string{j-bs = "Behavioral Science" }
3279 @string{j-bstj = "Bell System Technical Journal" }
3280 @string{j-bull-ams = "Bulletin of the American Mathematical Society" }
3281 @string{j-bvsawl = "Berichte {\"u}ber die Verhandlungen der S{\"a}chsischen Akademie der Wissenschaften zu Leipzig" }
3283 @string{j-c = "Connections" }
3284 @string{j-c2 = "Journal of Classification" }
3285 @string{j-cagd = "Computer Aided Geometric Design" }
3286 @string{j-cam = "Journal of Computational and Applied Mathematics" }
3287 @string{j-can-math-bull = "Canadian Mathematical Bulletin" }
3288 @string{j-cc = "Competition and Change" }
3289 @string{j-ccacaa = "Crotia Chemica ACTA" }
3290 @string{j-ccpe = "Concurrency and Computation: Practice and Experience" }
3291 @string{j-ccr = "Computer Communication Review" }
3292 @string{j-ceus = "Computers, Environment and Urban Systems" }
3293 @string{j-cg = "Computational Geometry" }
3294 @string{j-cgf = "Computer Graphics Forum" }
3295 @string{j-cgta = "Computational Geometry: Theory and Applications" }
3296 @string{j-ci = "Computational Intelligence" }
3297 @string{j-cjm = "Canadian Journal of Mathematics" }
3298 @string{j-cjp = "Canadian Journal of Psychology" }
3299 @string{j-cm = "IEEE Communications Magazine" }
3300 @string{j-cma = "Computers~\& Mathematics with Applications" }
3301 @string{j-cmj = "Czechoslovak Mathematical Journal" }
3302 @string{j-cmpan = "Colloquium Mathematicum" }
3303 @string{j-cmsjb = "Colloquia Mathematica Societatis J{\'a}nos Bolyai" }
3304 @string{j-cmuc = "Commentationes Mathematicae Universitatis Carolinae" }
3305 @string{j-cn = "Computer Networks: The International Journal of Computer and Telecommunications Networking" }
3306 @string{j-cn_isdn = "Computer Networks and ISDN Systems" }
3307 @string{j-coa = "Computational Optimization and Applications" }
3308 @string{j-comb = "Combinatorica" }
3309 @string{j-comcom = "Computer Communications" }
3310 @string{j-comm-acm = "Communications of the ACM" }
3311 @string{j-comp = "Journal of Complexity" }
3312 @string{j-complexity = "Complexity" }
3313 @string{j-comput = "Computing" }
3314 @string{j-congr-num = "Congressus Numerantium" }
3315 @string{j-const = "Constraints" }
3316 @string{j-copr = "Computers~\& Operations Research" }
3317 @string{j-copre = "Computers~\\& Operations Research" }
3318 @string{j-cor = "Computers~& Operations Research" }
3319 @string{j-cpc = "Combinatorics, Probability and Computing" }
3320 @string{j-cpm = "{\v C}eskoslovensk{\'a} Akademie V{\v e}d. {\v C}asopis Pro P{\v e}stov{\'a}n{\'i} Matematiky" }
3321 @string{j-cse = "Computing in Science and Engineering" }
3322 @string{j-csr = "Computer Science Review" }
3323 @string{j-css = "Journal of Computer and System Sciences" }
3324 @string{j-cviu = "Computer Vision and Image Understanding" }
3325 @string{j-cwi-qu = "CWI Quarterly" }
3326 @string{j-cwiq = "CWI Quarterly" }
3327 @string{j-cy = "Cybernetics" }
3329 @string{j-dam = "Discrete Applied Mathematics" }
3330 @string{j-dc = "Distributed Computing" }
3331 @string{j-dcg = "Discrete {\&} Computational Geometry" }
3332 @string{j-dima = "Discrete Mathematics" }
3333 @string{j-dm = "Documenta Mathematica" }
3334 @string{j-dmgt = "Discussiones Mathematicae Graph Theory" }
3335 @string{j-dmtcs = "Discrete Mathematics and Theoretical Computer Science" }
3336 @string{j-dmvm = "DMV Mitteilungen" }
3337 @string{j-do = "Discrete Optimization" }
3338 @string{j-dp = "Der Pathologe" }
3339 @string{j-duke-mj = "Duke Mathematical Journal" }
3341 @string{j-e = "Econometrica" }
3342 @string{j-eacis = "Electronic Articles in Computer and Information Science" }
3343 @string{j-ecmo = "Ecological Monographs" }
3344 @string{j-eco = "Economic Journal" }
3345 @string{j-ecomb = "The Electronic Journal of Combinatorics" }
3346 @string{j-eeetits = "EEE Transactions on Intelligent Transportation Systems" }
3347 @string{j-ejc = "European Journal of Combinatorics" }
3348 @string{j-ejor = "European Journal of Operational Research" }
3349 @string{j-em = "Elemente der Mathematik" }
3350 @string{j-endima = "Electronic Notes in Discrete Mathematics" }
3351 @string{j-entcs = "Electronic Notes in Theoretical Computer Science" }
3352 @string{j-epi = "El Profesional de la Informaci'on" }
3353 @string{j-epjb = "The European Physical Journal~B" }
3354 @string{j-epm = "Educational and Psychological Measurement" }
3355 @string{j-es = "Energy Systems" }
3356 @string{j-esa = "Expert Systems with Applications" }
3357 @string{j-et = "Journal of Economic Theory" }
3358 @string{j-expsysapp = "DELETEME" }
3360 @string{j-fi = "Fundamenta Informaticae" }
3361 @string{j-fm = "Fundamenta Mathematicae" }
3363 @string{j-gb = "Genome Biology" }
3364 @string{j-gc = "Graphs and Combinatorics" }
3365 @string{j-geb = "Games and Economic Behavior" }
3366 @string{j-geoi = "GeoInformatica" }
3367 @string{j-gi = "Genome Informatics" }
3368 @string{j-gr = "Genome Research" }
3370 @string{j-ho = "Human Organizations" }
3372 @string{j-i = "Inventiones mathematicae" }
3373 @string{j-ibioinfo = "Journal of Integrative Bioinformatics" }
3374 @string{j-ic = "Information and Computation" }
3375 @string{j-ico = "Information and Control" }
3376 @string{j-ieeec = "IEEE Computer" }
3377 @string{j-ieeedeb = "IEEE Data Engineering Bulletin" }
3378 @string{j-ieees = "IEEE Spectrum" }
3379 @string{j-ieeetcst = "IEEE Transactions on Control Systems Technology" }
3380 @string{j-ieeetim = "IEEE Transactions on Instrumentation and Measurement" }
3381 @string{j-ieeetits = "IEEE Transactions on Intelligent Transportation Systems" }
3382 @string{j-ieeetmc = "IEEE Transactions on Mobile Computing" }
3383 @string{j-ieeetps = "IEEE Transactions on Power Systems" }
3384 @string{j-ieeetse = "IEEE Transactions on Software Engineering" }
3385 @string{j-ieeetsg = "IEEE Transactions on Smart Grid" }
3386 @string{j-ieeetsmc = "IEEE Transactions on Systems, Man and Cybernetics" }
3387 @string{j-ieeetsmcpa = "IEEE Transactions on Systems, Man, and Cybernetics, Part A" }
3388 @string{j-ieeetssc = "IEEE Transactions on Systems Science and Cybernetics" }
3389 @string{j-ieeetwc = "IEEE Transactions on Wireless Communications" }
3390 @string{j-ieicetfeccs = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences" }
3391 @string{j-ieicetj = "IEICE Transactions Japan" }
3392 @string{j-iijci = "Informatica: An International Journal of Computing and Informatics" }
3393 @string{j-ijbc = "International Journal of Bifurcation and Chaos " }
3394 @string{j-ijc = "International Journal of Control" }
3395 @string{j-ijc2 = "Informs Journal on Computing" }
3396 @string{j-ijcga = "International Journal of Computational Geometry and Applications" }
3397 @string{j-ijcm = "International Journal of Computer Mathematics" }
3398 @string{j-ijfcs = "International Journal of Foundations of Computer Science" }
3399 @string{j-ijgis = "International Journal of Geographical Information Systems" }
3400 @string{j-ijm = "Israel Journal of Mathematics" }
3401 @string{j-ijrd = "IBM Journal of Research and Development" }
3402 @string{j-ijse = "International Journal of Sustainable Engineering" }
3403 @string{j-im = "Internet Mathematics" }
3404 @string{j-impc = "International Journal of Modern Physics~C" }
3405 @string{j-indmath = "Indagationes Mathematicae" }
3406 @string{j-infovis = "Journal of Information Visualization" }
3407 @string{j-int = "Integration: The VLSI Journal" }
3408 @string{j-ipj = "The Internet Protocol Journal" }
3409 @string{j-ipl = "Information Processing Letters" }
3410 @string{j-ipm = "Information Processing~\& Management" }
3411 @string{j-ir = "Information Retrieval, special issue on Advances in Mathematics/Formal Methods in Information Retrie" }
3412 @string{j-ire-tec = "IRE Transaction on Electronic Computers" }
3413 @string{j-ire-trans-it = "IRE Transactions on Information Theory" }
3414 @string{j-is = "Informatik Spektrum" }
3415 @string{j-it = "it---Information Technology" }
3417 @string{j-jacs = "Journal of the American Chemical Society" }
3418 @string{j-jair = "Journal of Artificial Intelligence Research" }
3419 @string{j-jalg = "Journal of Algorithms" }
3420 @string{j-jams = "Journal of the American Mathematical Society" }
3421 @string{j-jar = "Journal of Anthropological Research" }
3422 @string{j-jasa = "Journal of the American Statistical Association" }
3423 @string{j-jasist = "Journal of the American Society for Information Science and Technology" }
3424 @string{j-jc = "Journal of Classification" }
3425 @string{j-jcg = "Journal of Computational Geometry" }
3426 @string{j-jcit = "Journal of Computing and Information Technology" }
3427 @string{j-jco = "Journal of Combinatorial Optimization" }
3428 @string{j-jcombth = "Journal of Combinatorial Theory" }
3429 @string{j-jcombthb = "Journal of Combinatorial Theory Series~B" }
3430 @string{j-jda = "Journal of Discrete Algorithms" }
3431 @string{j-jdmvdmv = "Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV)" }
3432 @string{j-jg = "Journal of Geodesy" }
3433 @string{j-jgaa = "Journal of Graph Algorithms and Applications" }
3434 @string{j-jgo = "Journal of Global Optimization" }
3435 @string{j-jgt = "Journal of Graph Theory" }
3436 @string{j-jiis = "Journal of Intelligent Information Systems" }
3437 @string{j-jip = "Journal of Information Processing" }
3438 @string{j-jits = "Journal of Intelligent Transportation Systems" }
3439 @string{j-jlms = "Journal of the London Mathematical Society" }
3440 @string{j-jma = "Journal of Multivariate Analysis" }
3441 @string{j-jmp = "Journal of Mathematical Psychology" }
3442 @string{j-jms = "Journal of Mathematical Sociology" }
3443 @string{j-jorsj = "Journal of the Operations Research Society of Japan " }
3444 @string{j-jpp = "Journal of Parallel Programming" }
3445 @string{j-jrsssb = "Journal of the Royal Statistical Society, Series~B" }
3446 @string{j-js = "Journal of Scheduling" }
3447 @string{j-jsac = "IEEE Journal on Selected Areas in Communications" }
3448 @string{j-jsbs = "Journal of Social and Biological Structures" }
3449 @string{j-jsc = "Journal of Symbolic Computation" }
3450 @string{j-jsp = "Journal of Statistical Physics" }
3451 @string{j-jtb = "Journal of Theoretical Biology" }
3452 @string{j-jtp = "Journal of Theoretical Politics" }
3453 @string{j-jtrb = "Journal of the Transportation Research Board" }
3455 @string{j-kcdu = "Knowledge: Creation, Diffusion, Utilization" }
3456 @string{j-kdb = "Knowledge Discovery in Bioinformatics" }
3457 @string{j-kis = "Knowledge and Information Systems" }
3459 @string{j-l = "Language: Journal of the Linguistic Society of America" }
3460 @string{j-laa = "Linear Algebra and its Applications" }
3462 @string{j-m = "Methodology" }
3463 @string{j-ma = "Machine Learning" }
3464 @string{j-maa = "Journal of Mathematical Analysis and Applications" }
3465 @string{j-matchcmcc = "MATCH - Communications in Mathematical and in Computer Chemistry" }
3466 @string{j-math-prog-a = "Mathematical Programming, Series~A" }
3467 @string{j-mathann = "Mathematische Annalen" }
3468 @string{j-mathematika = "Mathematika" }
3469 @string{j-mb = "Mathematica Bohemica" }
3470 @string{j-mc = "Mathematics of Computation" }
3471 @string{j-mcs = "Mathematics in Computer Science" }
3472 @string{j-mfl = "Matematikai {\'e}s Fizikai Lapok" }
3473 @string{j-ml = "Journal of Machine Learning" }
3474 @string{j-mmj = "Michigan Mathematical Journal" }
3475 @string{j-mmor = "Mathematical Methods of Operations Research" }
3476 @string{j-mms = "Multiscale Modeling and Simulation" }
3477 @string{j-mna = "Mobile Networks and Applications" }
3478 @string{j-moor = "Mathematics of Operations Research" }
3479 @string{j-mor = "Methods of Operations Research" }
3480 @string{j-mos = "Mathematische Operationsforschung Statistik" }
3481 @string{j-mp = "Mathematical Programming" }
3482 @string{j-mpcps = "Mathematical Proceedings of the Cambridge Philosophical Society" }
3483 @string{j-ms = "Mathematica Slovaca" }
3484 @string{j-msc = "Mathematica Scandinavica" }
3485 @string{j-msci = "Management Science" }
3486 @string{j-msr = "Sociological Methods and Research" }
3487 @string{j-mss = "Mathematical Social Sciences" }
3488 @string{j-mst = "Mathematical Systems Theory" }
3489 @string{j-mussrs = "Mathematics of the USSR - Sbornik" }
3491 @string{j-nar = "Nucleic Acids Research" }
3492 @string{j-nationalb = "Journal of National Bureau of Standards" }
3493 @string{j-nature = "Nature" }
3494 @string{j-nb = "Nature Biotechnology" }
3495 @string{j-ncasp = "Novi commentarii academiae scientiarum Petropolitaenae" }
3496 @string{j-netnomics = "Netnomics" }
3497 @string{j-networks = "Networks" }
3498 @string{j-nips = "Advances in Neural Information Processing Systems" }
3499 @string{j-njc = "Nordic Journal of Computing" }
3500 @string{j-njp = "New Journal of Physics" }
3501 @string{j-nn = "Neural Networks" }
3502 @string{j-nns = "coNNectionS" }
3503 @string{j-nrdd = "Nature Reviews Drug Discovery" }
3504 @string{j-nrlq = "Naval Research Logistics Quarterly" }
3505 @string{j-nsr = "Nature Scientific Reports" }
3506 @string{j-nummat = "Numerische Mathematik" }
3508 @string{j-or = "Operations Research" }
3509 @string{j-order = "ORDER" }
3510 @string{j-orl = "Operations Research Letter" }
3511 @string{j-ors = "OR Spectrum" }
3513 @string{j-p = "Proteomics" }
3514 @string{j-pams = "Proceedings of the American Mathematical Society" }
3515 @string{j-patrl = "Pattern Recognition Letters" }
3516 @string{j-pc = "Parallel Computing" }
3517 @string{j-pdc = "Journal of Parallel and Distributed Computing" }
3518 @string{j-pdnp = "Physica D: Nonlinear Phenomena" }
3519 @string{j-phre = "Physical Review~E" }
3520 @string{j-phrl = "Physical Review Letters" }
3521 @string{j-physa = "Physica~A" }
3522 @string{j-pjm = "Pacific Journal of Mathematics" }
3523 @string{j-plms = "Proceedings of the London Mathematical Society" }
3524 @string{j-plsone = "PLoS ONE" }
3525 @string{j-pmd = "Publicationes Mathematicae Debrecen" }
3526 @string{j-pnas = "Proceedings of the National Academy of Science of the United States of America" }
3527 @string{j-ppl = "Parallel Processing Letters" }
3528 @string{j-pr = "Physics Reports" }
3529 @string{j-pr-e = "Physical Review E" }
3530 @string{j-psy = "Psychometrika" }
3531 @string{j-psyt = "Psychology Today" }
3532 @string{j-pt = "Public Transport" }
3534 @string{j-qa = "Journal of Quantitative Anthropology" }
3535 @string{j-qam = "Quarterly of Applied Mathematics" }
3536 @string{j-qq = "Quality and Quantity" }
3538 @string{j-r = "Release 1.0" }
3539 @string{j-ram = "Journal der reinen und angewandten Mathematik" }
3540 @string{j-rmp = "Reviews of Modern Physics" }
3541 @string{j-rp = "Research Policy" }
3542 @string{j-rsa = "Randoms Structures and Algorithms" }
3544 @string{j-sc = "Journal of Symbolic Computation" }
3545 @string{j-science = "Science" }
3546 @string{j-sf = "Social Forces" }
3547 @string{j-siam = "Journal of the Society for Industrial and Applied Mathematics" }
3548 @string{j-siamjadm = "SIAM Journal on Algebraic and Discrete Methods" }
3549 @string{j-sicomp = "SIAM Journal on Computing" }
3550 @string{j-sidma = "SIAM Journal on Discrete Mathematics" }
3551 @string{j-sigact-news = "ACM SIGACT News" }
3552 @string{j-sijam = "SIAM Journal on Applied Mathematics" }
3553 @string{j-sisccomp = "SIAM Journal on Scientific Computing" }
3554 @string{j-sjmaa = "SIAM Journal on Matrix Analysis and Applications" }
3555 @string{j-sm = "Sociological Methodology" }
3556 @string{j-smr = "Sociological Methods and Research" }
3557 @string{j-smte = "Journal of Statistical Mechanics: Theory and Experiment" }
3558 @string{j-sn = "Social Networks" }
3559 @string{j-socm = "Sociometry" }
3560 @string{j-sov-math-dokl = "Soviet Mathematics-Doklady" }
3561 @string{j-spe = "Software - Practice and Experience" }
3562 @string{j-sr = "SIAM Review" }
3563 @string{j-ss = "Journal of Social Structure" }
3564 @string{j-ssc = "Statistics and Computing" }
3565 @string{j-ssr = "Sociology and Social Research" }
3566 @string{j-ssre = "Social Science Research" }
3568 @string{j-t = "Telektronikk" }
3569 @string{j-tams = "Transactions of the American Mathematical Society" }
3570 @string{j-tasm = "Technology Analysis and Strategic Management" }
3571 @string{j-tc = "IEEE Transactions on Computers" }
3572 @string{j-tcj = "The Computer Journal" }
3573 @string{j-tcs = "Theoretical Computer Science" }
3574 @string{j-tct = "IEEE Transactions on Circuit Theory" }
3575 @string{j-tej = "The Economic Journal" }
3576 @string{j-tinfth = "IEEE Transactions on Information Theory" }
3577 @string{j-tis = "IEICE Transactions on Information and Systems" }
3578 @string{j-tit = "ACM Transactions on Internet Technology" }
3579 @string{j-tkde = "IEEE Transactions on Knowledge and Data Engineering" }
3580 @string{j-tob = "Trends in Organizational Behavior" }
3581 @string{j-toc = "IEEE Transactions on Communications" }
3582 @string{j-tocs = "Theory of Computing Systems " }
3583 @string{j-ton = "IEEE/ACM Transactions on Networking" }
3584 @string{j-tpa = "Theory of Probability and its Applications" }
3585 @string{j-tpami = "IEEE Transactions on Pattern Analysis and Machine Intelligence" }
3586 @string{j-tr = "IEEE Transactions on Reliability" }
3587 @string{j-tr-ec = "IEEE Transactions on Electronic Computers" }
3588 @string{j-trpbm = "Transportation Research Part B: Methodological" }
3589 @string{j-ts = "Transportation Science" }
3590 @string{j-tsq = "The Sociological Quarterly" }
3591 @string{j-tsy = "Telecommunication Systems" }
3592 @string{j-tvcg = "IEEE Transactions on Visualization and Computer Graphics" }
3594 @string{j-vlsid = "VLSI Design" }
3596 @string{j-wzthi = "Wissenschaftliche Zeitschrift, Technische Hochschule Ilmenau" }
3598 @string{j-zpmfu = "Zeitschrift zur Pflege der Mathematik und zur F{\"o}rderung des mathematisch-physikalischen Unterric" }
3600 @string{NHM = "Networks and Heterogeneous Media" }
3602 %% --------------------------------------------------------------
3603 %% conference proceedings
3604 %% --------------------------------------------------------------
3605 @string{proc-aaai-11 = "Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence" }
3606 @string{proc-aaai-12 = "Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence" }
3607 @string{proc-aaai-13 = "Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence" }
3608 @string{proc-aaim-07 = "Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07)" }
3609 @string{proc-aaim-08 = "Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08)" }
3610 @string{proc-aaim-09 = "Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09)" }
3611 @string{proc-aaim-10 = "Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'10)" }
3612 @string{proc-aaim-11 = "Proceedings of the 7th International Conference on Algorithmic Aspects in Information and Management (AAIM'11)" }
3613 @string{proc-acmgis-10 = "Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems" }
3614 @string{proc-acmgis-11 = "Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems" }
3615 @string{proc-acsc-05 = "Proceedings of the Twenty-eighth Australasian conference on Computer Science" }
3616 @string{proc-afips-67 = "AFIPS'67 (Spring): Proceedings of the April 18-20, 1967, spring joint computer conference" }
3617 @string{proc-aiide-10 = "Proceedings of the 6th Artificial Intelligence for Interactive Digital Entertainment Conference (AIIDE'10)" }
3618 @string{proc-aiide-11 = "Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'11)" }
3619 @string{proc-alenex-01 = "Proceedings of the 3rd International Workshop on Algorithm Engineering and Experiments (ALENEX'01)" }
3620 @string{proc-alenex-02 = "Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)" }
3621 @string{proc-alenex-04 = "Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)" }
3622 @string{proc-alenex-05 = "Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05)" }
3623 @string{proc-alenex-06 = "Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)" }
3624 @string{proc-alenex-07 = "Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)" }
3625 @string{proc-alenex-08 = "Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08)" }
3626 @string{proc-alenex-09 = "Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09)" }
3627 @string{proc-alenex-10 = "Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10)" }
3628 @string{proc-alenex-11 = "Proceedings of the 13th Workshop on Algorithm Engineering and Experiments (ALENEX'11)" }
3629 @string{proc-alenex-12 = "Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)" }
3630 @string{proc-alenex-13 = "Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX'13)" }
3631 @string{proc-alenex-99 = "Selected Papers from the 1st International Workshop on Algorithm Engineering and Experimentation (ALENEX'99)" }
3632 @string{proc-alex-98 = "Proceedings of Algorithms and Experiments (ALEX'98)" }
3633 @string{proc-algosensors-08 = "Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08)" }
3634 @string{proc-algosensors-09 = "Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)" }
3635 @string{proc-algosensors-10 = "Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)" }
3636 @string{proc-algosensors-11 = "Proceedings of the 7th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'11)" }
3637 @string{proc-algosensors-13 = "Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS'13)" }
3638 @string{proc-analco-10 = "Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO '10)" }
3639 @string{proc-analco-11 = "Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO '11)" }
3640 @string{proc-approx-00 = "Proceedings of the 3rd International Workshop on Approximatin Algorithms for Combinatorial Optimizat" }
3641 @string{proc-approx-98 = "Proceedings of the 1st International Workshop on Approximatin Algorithms for Combinatorial Optimizat" }
3642 @string{proc-apscc-07 = "Proceedings of the 2nd IEEE Asia-Pacific Service Computing Conference (APSCC)" }
3643 @string{proc-apvis-07 = "Asia-Pacific Symposium on Visualisation 2007 (APVIS'07)" }
3644 @string{proc-apweb-08 = "Proceedings of the 10th Asia-Pacific Web Conference" }
3645 @string{proc-asonam-12 = "Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining" }
3646 @string{proc-atmos-01 = "Proceedings of the 1st Workshop on Algorithmic MeThods and Models for Optimization of RailwayS (ATMOS'01)" }
3647 @string{proc-atmos-02 = "Proceedings of the 2nd Workshop on Algorithmic MeThods and Models for Optimization of RailwayS (ATMOS'02)" }
3648 @string{proc-atmos-03 = "Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)" }
3649 @string{proc-atmos-05 = "Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)" }
3650 @string{proc-atmos-07 = "Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)" }
3651 @string{proc-atmos-08 = "Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)" }
3652 @string{proc-atmos-09 = "Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)" }
3653 @string{proc-atmos-10 = "Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10)" }
3654 @string{proc-atmos-11 = "Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)" }
3655 @string{proc-atmos-12 = "Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12)" }
3656 @string{proc-aussois-01 = "Proceedings of the 5th International Workshop on Combinatorial Optimization (Aussois'2001)" }
3657 @string{proc-avi-02 = "Proceedings of the 6th Working Conference on Advanced Visual Interfaces (AVI'02)" }
3659 @string{proc-bcc-79 = "Proceedings of the 7th British Combinatorial Conference" }
3660 @string{proc-bsmsp-67 = "Fifth Berkeley Symposium on Mathematical Statistics and Probability" }
3662 @string{proc-ccc-84 = "Cambridge Combinatorial Conference in honor of Paul Erdos" }
3663 @string{proc-cccg-07 = "Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG '07)" }
3664 @string{proc-cccg-10 = "Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG '10)" }
3665 @string{proc-cccg-11 = "Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11)" }
3666 @string{proc-ccn-02 = "Proceedings of the IASTED International Conference on Communications and Computer Networks" }
3667 @string{proc-ccss-72 = "Courant Computer Science Symposium~9: Combinatorial Algorithms (1972)" }
3668 @string{proc-cecnet-12 = "2nd International Conference on Consumer Electronics, Communications and Networks" }
3669 @string{proc-cg-91 = "Proceedings of Compugraphics '91" }
3670 @string{proc-chi-06 = "Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI'06)" }
3671 @string{proc-ciac-03 = "Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC'03)" }
3672 @string{proc-ciac-06 = "Proceedings of the 6th Conference on Algorithms and Complexity (CIAC'06)" }
3673 @string{proc-ciac-10 = "Proceedings of the 7th Conference on Algorithms and Complexity (CIAC'10)" }
3674 @string{proc-ciac-13 = "Proceedings of the 8th Conference on Algorithms and Complexity" }
3675 @string{proc-cikm-96 = "Proceedings of the 5th International Conference on Information and Knowledge Management" }
3676 @string{proc-cikm-98 = "Proceedings of the 7th International Conference on Information and Knowledge Management" }
3677 @string{proc-cocc-72 = "Complexity of Computer Computations" }
3678 @string{proc-cocoa-07 = "Proceedings of the 1st International Conference on Combinatorial Optimization and Applications" }
3679 @string{proc-cocoon-01 = "Proceedings of the 7th Annual International Conference on Computing Combinatorics (COCOON'01)" }
3680 @string{proc-cocoon-02 = "Proceedings of the 8th Annual International Conference on Computing Combinatorics (COCOON'02)" }
3681 @string{proc-cocoon-03 = "Proceedings of the 9th Annual International Conference on Computing Combinatorics (COCOON'03)" }
3682 @string{proc-cocoon-05 = "Proceedings of the 11th Annual International Conference on Computing Combinatorics (COCOON'05)" }
3683 @string{proc-cocoon-11 = "Proceedings of the 17th Annual International Conference on Computing Combinatorics (COCOON'11)" }
3684 @string{proc-cocoon-99 = "Proceedings of the 5th Annual International Conference on Computing Combinatorics (COCOON'99)" }
3685 @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" }
3686 @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" }
3687 @string{proc-cosit-93 = "Proceedings of the European Conference on Spatial Information Theory (COSIT'93)" }
3688 @string{proc-cpm-04 = "Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM'04)" }
3689 @string{proc-cs-87 = "Proceedings of the 20th IEEE International Symposium on Circuits and Systems 1987" }
3690 @string{proc-cwmu-68 = "The Many Facets of Graph Theory" }
3692 @string{proc-dac-65 = "Proceedings of the SHARE design automation project (DAC'65)" }
3693 @string{proc-dac-82 = "Proceedings of the 19th ACM/IEEE Conference on Design Automation" }
3694 @string{proc-dac-93 = "Proceedings of the 30th ACM/IEEE Conference on Design Automation" }
3695 @string{proc-dac-95 = "Proceedings of the 32nd ACM/IEEE Conference on Design Automation" }
3696 @string{proc-dcoss-11 = "Proceedings of the 2011 International Conference on Distributed Computing in Sensor Systems" }
3697 @string{proc-dcoss-12 = "Proceedings of the 2012 International Conference on Distributed Computing in Sensor Systems" }
3698 @string{proc-delis-final07 = "Proceedings of the Final Workshop of DELIS" }
3699 @string{proc-dialm-pomc-05 = "DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computing" }
3700 @string{proc-dialm-pomc-08 = "Proceedings of the 2008 joint workshop on Foundations of Mobile Computing" }
3701 @string{proc-dimacs-06 = "The Shortest Path Problem: Ninth DIMACS Implementation Challenge -" }
3702 @string{proc-dimacs-12 = "Graph Partitioning and Graph Clustering: Tenth DIMACS Implementation Challenge" }
3703 @string{proc-dimacs-98 = "Data Structures, Near Neighbor Searches, and Methodology: Proceedings of the Fifth and Sixth DIMACS Implementation Challenges" }
3704 @string{proc-disc-12 = "Proceedings of the 26th International Symposium on Distributed Computing" }
3705 @string{proc-dm-05 = "Proceedings of the Fifth SIAM International Conference on Data Mining" }
3706 @string{proc-dm-07 = "Proceedings of the 2007 SIAM International Conference on Data Mining" }
3707 @string{proc-dm-08 = "Proceedings of the 2008 SIAM International Conference on Data Mining" }
3708 @string{proc-dmsn-06 = "Proceedings of the 3rd Workshop on Data Management for Sensor Networks (DMSN'06)" }
3710 @string{proc-eccs-06 = "Proceedings of the European Conference of Complex Systems (ECCS'06)" }
3711 @string{proc-eccs-07 = "Proceedings of the European Conference of Complex Systems (ECCS'07)" }
3712 @string{proc-ecml-05 = "Proceedings of the 16th European Conference on Machine Learning" }
3713 @string{proc-edbt-09 = "Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT '09)" }
3714 @string{proc-esa-01 = "Proceedings of the 9th Annual European Symposium on Algorithms (ESA'01)" }
3715 @string{proc-esa-02 = "Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)" }
3716 @string{proc-esa-03 = "Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)" }
3717 @string{proc-esa-04 = "Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04)" }
3718 @string{proc-esa-05 = "Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05)" }
3719 @string{proc-esa-06 = "Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06)" }
3720 @string{proc-esa-07 = "Proceedings of the 14th Annual European Symposium on Algorithms (ESA'07)" }
3721 @string{proc-esa-08 = "Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)" }
3722 @string{proc-esa-09 = "Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09)" }
3723 @string{proc-esa-10 = "Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10)" }
3724 @string{proc-esa-12 = "Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)" }
3725 @string{proc-esa-13 = "Proceedings of the 21st Annual European Symposium on Algorithms (ESA'13)" }
3726 @string{proc-esa-93 = "Proceedings of the 1st European Symposium on Algorithms (ESA'93)" }
3727 @string{proc-esa-94 = "Proceedings of the 2nd Annual European Symposium on Algorithms (ESA'94)" }
3728 @string{proc-esa-96 = "Proceedings of the 4th Annual European Symposium on Algorithms (ESA'96)" }
3729 @string{proc-esa-97 = "Proceedings of the 5th Annual European Symposium on Algorithms (ESA'97)" }
3730 @string{proc-esa-98 = "Proceedings of the 6th Annual European Symposium on Algorithms (ESA'98)" }
3731 @string{proc-esa-99 = "Proceedings of the 7th Annual European Symposium on Algorithms (ESA'99)" }
3732 @string{proc-esann-05 = "Proceedings of the 13th European Symposium on Artifical Neural Networks" }
3733 @string{proc-eurocg-07 = "Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07)" }
3734 @string{proc-eurocg-08 = "Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)" }
3735 @string{proc-eurocg-10 = "Proceedings of the 26th European Workshop on Computational Geometry (EuroCG'10)" }
3736 @string{proc-eurocg-11 = "Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11)" }
3737 @string{proc-eurocg-12 = "Proceedings of the 28th European Workshop on Computational Geometry (EuroCG'12)" }
3738 @string{proc-eurocg-13 = "Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)" }
3739 @string{proc-eurolio-12 = "Geography of Innovation 2012" }
3740 @string{proc-ewcg-05 = "Proceedings of the 21st European Workshop on Computational Geometry (EWCG'05)" }
3742 @string{proc-focs-00 = "Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00)" }
3743 @string{proc-focs-01 = "Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'01)" }
3744 @string{proc-focs-02 = "Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02)" }
3745 @string{proc-focs-03 = "Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03)" }
3746 @string{proc-focs-04 = "Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)" }
3747 @string{proc-focs-86 = "Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS'86)" }
3748 @string{proc-focs-87 = "Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS'87)" }
3749 @string{proc-focs-88 = "Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS'88)" }
3750 @string{proc-focs-89 = "Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89)" }
3751 @string{proc-focs-90 = "Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90)" }
3752 @string{proc-focs-91 = "Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)" }
3753 @string{proc-focs-92 = "Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'92)" }
3754 @string{proc-focs-93 = "Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS'93)" }
3755 @string{proc-focs-94 = "Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS'94)" }
3756 @string{proc-focs-96 = "Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS'96)" }
3757 @string{proc-focs-98 = "Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98)" }
3758 @string{proc-fomc-12 = "The Eighth ACM International Workshop on Foundations of Mobile Computing" }
3759 @string{proc-fsci-04 = "Proceedings of the 14th Workshop Fuzzy-Systeme und Computational Intelligence" }
3760 @string{proc-fsttcs-01 = "Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science" }
3762 @string{proc-gcsg-80 = "Proceedings of the First General Conference on Social Graphics" }
3763 @string{proc-gd-00 = "Proceedings of the 8th International Symposium on Graph Drawing (GD'00)" }
3764 @string{proc-gd-01 = "Proceedings of the 9th International Symposium on Graph Drawing (GD'01)" }
3765 @string{proc-gd-02 = "Proceedings of the 10th International Symposium on Graph Drawing (GD'00)" }
3766 @string{proc-gd-03 = "Proceedings of the 11th International Symposium on Graph Drawing (GD'03)" }
3767 @string{proc-gd-04 = "Proceedings of the 12th International Symposium on Graph Drawing (GD'04)" }
3768 @string{proc-gd-05 = "Proceedings of the 13th International Symposium on Graph Drawing (GD'05)" }
3769 @string{proc-gd-06 = "Proceedings of the 14th International Symposium on Graph Drawing (GD'06)" }
3770 @string{proc-gd-07 = "Proceedings of the 15th International Symposium on Graph Drawing (GD'07)" }
3771 @string{proc-gd-08 = "Proceedings of the 16th International Symposium on Graph Drawing (GD'08)" }
3772 @string{proc-gd-09 = "Proceedings of the 17th International Symposium on Graph Drawing (GD'09)" }
3773 @string{proc-gd-10 = "Proceedings of the 18th International Symposium on Graph Drawing (GD'10)" }
3774 @string{proc-gd-11 = "Proceedings of the 19th International Symposium on Graph Drawing (GD'11)" }
3775 @string{proc-gd-12 = "Proceedings of the 20th International Symposium on Graph Drawing (GD'12)" }
3776 @string{proc-gd-13 = "Proceedings of the 21st International Symposium on Graph Drawing (GD'13)" }
3777 @string{proc-gd-94 = "DIAMCS International Workshop" }
3778 @string{proc-gd-95 = "Proceedings of the 3rd International Symposium on Graph Drawing (GD'95)" }
3779 @string{proc-gd-96 = "Proceedings of the 4th International Symposium on Graph Drawing (GD'96)" }
3780 @string{proc-gd-97 = "Proceedings of the 5th International Symposium on Graph Drawing (GD'97)" }
3781 @string{proc-gd-98 = "Proceedings of the 6th International Symposium on Graph Drawing (GD'98)" }
3782 @string{proc-gd-99 = "Proceedings of the 7th International Symposium on Graph Drawing (GD'99)" }
3783 @string{proc-gi-00 = "Ausgezeichnete Informatikdissertationen 2000" }
3784 @string{proc-gi-01 = "Ausgezeichnete Informatikdissertationen 2001" }
3785 @string{proc-gi-02 = "Ausgezeichnete Informatikdissertationen 2002" }
3786 @string{proc-gi-03 = "Ausgezeichnete Informatikdissertationen 2003" }
3787 @string{proc-gi-04 = "Ausgezeichnete Informatikdissertationen 2004" }
3788 @string{proc-gi-05 = "Ausgezeichnete Informatikdissertationen 2005" }
3789 @string{proc-gi-06 = "Ausgezeichnete Informatikdissertationen 2006" }
3790 @string{proc-gi-07 = "Ausgezeichnete Informatikdissertationen 2007" }
3791 @string{proc-gi-08 = "Ausgezeichnete Informatikdissertationen 2008" }
3792 @string{proc-gi-09 = "Ausgezeichnete Informatikdissertationen 2009" }
3793 @string{proc-gi-10 = "Informatiktage 2010" }
3794 @string{proc-gi-10a = "Ausgezeichnete Informatikdissertationen 2010" }
3795 @string{proc-gi-11 = "Ausgezeichnete Informatikdissertationen 2011" }
3796 @string{proc-gi-99 = "Ausgezeichnete Informatikdissertationen 1999" }
3797 @string{proc-giit-05 = "Informatiktage 2005. Fachwissenschaftlicher Informatik-Kongress, 8. und 9. April 2005, Schloss Birlinghoven, Sankt Augustin" }
3798 @string{proc-gis-05 = "Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems (GIS'05)" }
3799 @string{proc-gis-10 = "Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS'10)" }
3800 @string{proc-gisruk-07 = "Proceedings of the 15th Annual Geographic Information Sciences Research Conference UK" }
3801 @string{proc-globecom-01 = "IEEE GLOBECOM'01" }
3802 @string{proc-globecom-96 = "IEEE GLOBECOM'96" }
3803 @string{proc-gs-97 = "Graph Symmetry: Algebraic Methods and Applications" }
3804 @string{proc-gsn2006 = "GeoSensor Networks" }
3805 @string{proc-gtca-91 = "Graph Theory, Combinatorics and Applications" }
3807 @string{proc-hics-00 = "Proceedings of the 33rd Hawaii International Conference on System Sciences" }
3808 @string{proc-hpcn-96 = "High-Performance Computing and Networking" }
3809 @string{proc-hypertext-03 = "Proceedings of the 14th ACM Conference on Hypertext and Hypermedia" }
3810 @string{proc-hypertext-98 = "Proceedings of the 9th ACM Conference on Hypertext and Hypermedia" }
3812 @string{proc-iadis-wig-06 = "Proceedings of the 5th IADIS International Conference WWW/Internet Geometry" }
3813 @string{proc-icalp-02 = "Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'02)" }
3814 @string{proc-icalp-03 = "Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'03)" }
3815 @string{proc-icalp-05 = "Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP'05)" }
3816 @string{proc-icalp-11 = "Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP'11)" }
3817 @string{proc-icalp-13 = "Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)" }
3818 @string{proc-icalp-94 = "Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (ICALP'94)" }
3819 @string{proc-icalp-95 = "Proceedings of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP'95)" }
3820 @string{proc-icalp-96 = "Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96)" }
3821 @string{proc-icalp-98 = "Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98)" }
3822 @string{proc-icaps-12 = "Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling" }
3823 @string{proc-icaps-13 = "Proceedings of the 23rd International Conference on Automated Planning and Scheduling" }
3824 @string{proc-icc-01 = "Proceedings of the IEEE International Conference on Communications 2001" }
3825 @string{proc-icc-97 = "Proceedings of the IEEE International Conference on Communications 1997" }
3826 @string{proc-iccad-93 = "Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design" }
3827 @string{proc-icdcn-10 = "Proceedings of the 11th International Conference on Distributed Computing and Networking " }
3828 @string{proc-icdcs-10 = "Proceedings of the 30th International Conference on Distributed Computing Systems" }
3829 @string{proc-icdm-01 = "Proceedings of the 2001 IEEE International Conference on Data Mining" }
3830 @string{proc-icdm-11 = "Proceedings of the 2011 IEEE International Conference on Data Mining" }
3831 @string{proc-icdmw-06 = "Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops" }
3832 @string{proc-icdmw-10 = "Data Mining Workshops (ICDMW), 2010 IEEE International Conference on" }
3833 @string{proc-icems-05 = "Proceedings of the 8th International Conference on Electrical Machines and Systems (ICEMS'05)" }
3834 @string{proc-icl-gnss-12 = "Proceedings of the International Conference on Localization and GNSS (ICL-GNSS '12)" }
3835 @string{proc-icml-04 = "Proceedings of the twenty-first international conference on Machine learning" }
3836 @string{proc-icml-05 = "Proceedings of the 22nd International Conference on Machine Learning" }
3837 @string{proc-ieeei-04 = "Proceedings of the 23rd IEEE Convention of Electrical and Electronics Engineers in Israel" }
3838 @string{proc-ifip-92 = "Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92" }
3839 @string{proc-iics-02 = "Proceedings of the 2nd International Workshop on Innovative Internet Computing Systems" }
3840 @string{proc-ijcai-01 = "Proceedings of the 17th international joint conference on artificial intelligence" }
3841 @string{proc-infocom-00 = "Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" }
3842 @string{proc-infocom-01 = "Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" }
3843 @string{proc-infocom-02 = "Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" }
3844 @string{proc-infocom-03 = "Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" }
3845 @string{proc-infocom-05 = "Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" }
3846 @string{proc-infocom-06 = "Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" }
3847 @string{proc-infocom-97 = "Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)" }
3848 @string{proc-infovis-02 = "Proceedings of the 2002 IEEE Symposium on Information Visualization" }
3849 @string{proc-ipco-07 = "Proceedings of the 12th Integer Programming and Combinatorial Optimization Conference" }
3850 @string{proc-ipdps-04 = "18th International Parallel and Distributed Processing Symopsium (IPDPS'04)" }
3851 @string{proc-ipdps-06 = "20th International Parallel and Distributed Processing Symopsium (IPDPS'06)" }
3852 @string{proc-ipdps-08 = "22nd International Parallel and Distributed Processing Symposium (IPDPS'08)" }
3853 @string{proc-ipdps-09 = "23rd International Parallel and Distributed Processing Symposium (IPDPS'09)" }
3854 @string{proc-ipdps-10 = "24th International Parallel and Distributed Processing Symposium (IPDPS'10)" }
3855 @string{proc-ipdps-11 = "25th International Parallel and Distributed Processing Symposium (IPDPS'11)" }
3856 @string{proc-ipin-10 = "Proceedings of the 2010 International Conference on Indoor Positioning and Indoor Navigation (IPIN'10)" }
3857 @string{proc-ipps-98-ws = "Parallel and Distributed Processing---10th International IPPS/SPDP'98 Workshops" }
3858 @string{proc-ips-04 = "IPS 2004 -- Inter-Domain Performance and Simulation" }
3859 @string{proc-ipsn-04 = "Third International Symposium on Information Processing in Sensor Networks (IPSN 2004)" }
3860 @string{proc-ipsn-05 = "Fourth International Symposium on Information Processing in Sensor Networks (IPSN 2005)" }
3861 @string{proc-ipsn-06 = "Fifth International Conference on Information Processing in Sensor Networks (IPSN 2006)" }
3862 @string{proc-ipsn-07 = "Sixth International Symposium on Information Processing in Sensor Networks (IPSN 2007)" }
3863 @string{proc-ipst-13 = "Proceedings of the International Conference on Power Systems Transients (IPST'13)" }
3864 @string{proc-isa-91 = "Proceedings of the 2nd International Symposium on Algorithms (ISA'91)" }
3865 @string{proc-isaac-00 = "Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'00)" }
3866 @string{proc-isaac-04 = "Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'04)" }
3867 @string{proc-isaac-07 = "Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC'07)" }
3868 @string{proc-isaac-08 = "Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08)" }
3869 @string{proc-isaac-09 = "Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09)" }
3870 @string{proc-isaac-11 = "Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11)" }
3871 @string{proc-isaac-12 = "Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)" }
3872 @string{proc-isaac-92 = "Proceedings of the 3rd International Symposium on Algorithms and Computation (ISAAC'92)" }
3873 @string{proc-isaac-93 = "Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93)" }
3874 @string{proc-isaac-98 = "Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98)" }
3875 @string{proc-istg-66 = "Proceedings of the International Symposium on the Theory of Graphs" }
3876 @string{proc-it-11 = "Algorithm Engineering" }
3877 @string{proc-itcom-01 = "Proceedings of SPIE ITcom'01" }
3878 @string{proc-itm-12 = "Proceedings of the 4th TRB Conference on Innovations in Travel Modeling" }
3879 @string{proc-its-12 = "the 19th World Congress on Intelligent Transport Systems" }
3880 @string{proc-itss-02 = "ITSS 2002: Proceedings of the 5h International Conference on Intelligent Transportation Systems" }
3881 @string{proc-itst-12 = "12th International Conference on ITS Telecommunications" }
3882 @string{proc-iwcts-12 = "Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science" }
3883 @string{proc-iwoca-10 = "Proceedings of the 21st International Workshop on Combinatorial Algorithms" }
3884 @string{proc-iwoca-11 = "Proceedings of the 22nd International Workshop on Combinatorial Algorithms" }
3885 @string{proc-iwpec-06 = "Parameterized and Exact Computation" }
3887 @string{proc-kdd-00 = "Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and Data Mining" }
3888 @string{proc-kdd-01 = "Proceedings of the seventh ACM SIGKDD international conference on Knowledge Discovery and Data Mining" }
3889 @string{proc-kdd-03 = "Proceedings of the nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" }
3890 @string{proc-kdd-04 = "Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" }
3891 @string{proc-kdd-05 = "Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" }
3892 @string{proc-kdd-06 = "Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" }
3893 @string{proc-kdd-07 = "Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining" }
3894 @string{proc-ki-10 = "Proceedings of the 33rd Annual German Conference on Advances in Artificial Intelligence" }
3896 @string{proc-latin-10 = "Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATIN'10)" }
3897 @string{proc-latin-98 = "Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98)" }
3899 @string{proc-mamus-03 = "Multiagent for Mass User Support - First International Workshop" }
3900 @string{proc-mascots-01 = "Proceedings of the 9th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems" }
3901 @string{proc-mascots-02 = "Proceedings of the 10th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems" }
3902 @string{proc-mascots-07 = "Proceedings of the 15th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems" }
3903 @string{proc-mates-09 = "Proceedings of the 7th German Conference on Multiagent System Technologies (MATES 2009)" }
3904 @string{proc-mdm-07 = "8th International Conference on Mobile Data Management (MDM 2007)" }
3905 @string{proc-medalg-12 = "Proceedings of the 1st Mediterranean Conference on Algorithms" }
3906 @string{proc-mfcs-06 = "Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS'06)" }
3907 @string{proc-mfcs-93 = "Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS'93)" }
3908 @string{proc-milcom-99 = "Proceedings of the IEEE Military Communications Conference (MILCOM'99)" }
3909 @string{proc-miw-70 = "Proceedings of the Sixth Annual Machine Intelligence Workshop" }
3910 @string{proc-mmcn-02 = "Proceedings of SPIE/ACM Conference on Multimedia Computing and Networking (MMCN) 2002" }
3911 @string{proc-mobicom-00 = "Proceedings of the 6th annual international conference on Mobile computing and networking" }
3912 @string{proc-mobicom-01 = "Proceedings of the 7th annual international conference on Mobile computing and networking" }
3913 @string{proc-mobicom-02 = "Proceedings of the 8th annual international conference on Mobile computing and networking" }
3914 @string{proc-mobicom-03 = "Proceedings of the 9th annual international conference on Mobile computing and networking" }
3915 @string{proc-mobicom-04 = "Proceedings of the 10th annual international conference on Mobile computing and networking" }
3916 @string{proc-mobicom-05 = "Proceedings of the 11th annual international conference on Mobile computing and networking" }
3917 @string{proc-mobicom-06 = "Proceedings of the 12th annual international conference on Mobile computing and networking" }
3918 @string{proc-mobicom-07 = "Proceedings of the 13th annual international conference on Mobile computing and networking" }
3919 @string{proc-mobihoc-03 = "Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03)" }
3920 @string{proc-mobihoc-06 = "Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'06)" }
3921 @string{proc-mobihoc-08 = "Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'08)" }
3922 @string{proc-mtaap-07 = "Workshop on Multithreaded Architectures and Applications (MTAAP 2007)" }
3924 @string{proc-networking-02 = "Proceedings of the 2nd International IFIP-TC6 Networking Conference" }
3925 @string{proc-nips-01 = "Proceedings of 14th Conference: Neural Information Processing Systems" }
3926 @string{proc-nips-02 = "Proceedings of 15th Conference: Neural Information Processing Systems" }
3927 @string{proc-nips-03 = "Advances in Neural Information Processing Systems 16" }
3928 @string{proc-nips-05 = "Advances in Neural Information Processing Systems 18" }
3929 @string{proc-nips-10 = "Advances in Neural Information Processing Systems 23" }
3930 @string{proc-nrdm-01 = "Workshop on Network-Related Data Management (NRDM'01)" }
3932 @string{proc-paa-04 = "Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures" }
3933 @string{proc-pacificvis-08 = "Proceedings of IEEE Pacific Visualization Symposium" }
3934 @string{proc-pacificvis-13 = "Proceedings of IEEE Pacific Visualization Symposium" }
3935 @string{proc-paris-07 = "Proc. First Int. Workshop on Protocols and Algorithms for Reliable and Data Intensive Sensor Networks (PARIS)" }
3936 @string{proc-percomw-06 = "Proc. 4th Annual IEEE Int. Conf. on Pervasive Computing and Communication Workshops (PerCOMW'06)" }
3937 @string{proc-pesgm-12 = "Power and Energy Society General Meeting" }
3938 @string{proc-podc-09 = "Proceedings of the 28th ACM symposium on Principles of distributed computing" }
3939 @string{proc-podc-12 = "Proceedings of the 31th ACM Symposium on Principles of Distributed Computing" }
3940 @string{proc-pris-06 = "Proceedings of the 6th International Workshop on Pattern Recognition in Information Systems (PRIS 2006)" }
3941 @string{proc-psce-09 = "Power Systems Conference and Exposition (PSCE'09)" }
3943 @string{proc-random-02 = "Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM'02)" }
3945 @string{proc-sab-06 = "Proc. 9th International Conference on Simulation of Adaptive Behavior" }
3946 @string{proc-sawn-06 = "Proceedings of the International Workshop on Self-Assembling Wireless Networks, 2006" }
3947 @string{proc-sbac-pad-04 = "Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'04)" }
3948 @string{proc-sc-95 = "Proceedings of the 1995 ACM/IEEE conference on Supercomputing (SC'05)" }
3949 @string{proc-scg-91 = "Proceedings of the 7th Annual ACM Symposium on Computational Geometry" }
3950 @string{proc-scg-98 = "Proceedings of the 14th Annual Symposium on Computational Geometry" }
3951 @string{proc-sdm-05 = "Proceedings of the fifth SIAM International Conference on Data Mining" }
3952 @string{proc-sdm-07 = "Proceedings of the seventh SIAM International Conference on Data Mining" }
3953 @string{proc-sea-09 = "Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)" }
3954 @string{proc-sea-10 = "Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)" }
3955 @string{proc-sea-11 = "Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)" }
3956 @string{proc-sea-12 = "Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)" }
3957 @string{proc-sea-13 = "Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)" }
3958 @string{proc-seagtc-83 = "Proceedings of the 1st Southeast Asian Graph Theory Colloquium" }
3959 @string{proc-secon-06 = "Proceedings of Sensor and Ad Hoc Communications and Networks, 2006. " }
3960 @string{proc-sensys-04 = "2nd international conference on Embedded networked sensor systems (SenSys'04)" }
3961 @string{proc-si-alenex-08 = "Special issue of the ACM Journal on Experimental Algorithms devoted to selected papers from ALENEX 2008" }
3962 @string{proc-si-dae-00 = "Discrete Algorithms Engineering, special issue of the journal Software--Practice and Experience" }
3963 @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)" }
3964 @string{proc-si-waa-96 = "Special issue of the journal Algorithmica devoted to the Dagstuhl Workshop on Graph Algorithms and Applications (1996)" }
3965 @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)" }
3966 @string{proc-si-wae-00 = "Special issue of the ACM Journal on Experimental Algorithms devoted to the 4th Workshop on Algorithm Engineering (WAE'00)" }
3967 @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)" }
3968 @string{proc-sigcomm-03 = "SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications" }
3969 @string{proc-sigcomm-99 = "SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication" }
3970 @string{proc-sigir-86 = "Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval" }
3971 @string{proc-sigmetrics-03 = "SIGMETRICS'03" }
3972 @string{proc-sigmod-08 = "Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD'08)" }
3973 @string{proc-sigmod-09 = "Proceedings of the 2009 ACM SIGMOD international conference on Management of data (SIGMOD'09)" }
3974 @string{proc-sigmod-10 = "Proceedings of the 2010 ACM SIGMOD international conference on Management of data (SIGMOD'10)" }
3975 @string{proc-sigmod-11 = "Proceedings of the 2011 ACM SIGMOD international conference on Management of data (SIGMOD'11)" }
3976 @string{proc-sigmod-84 = "Proceedings of the 1984 ACM SIGMOD international conference on Management of data" }
3977 @string{proc-sigspatial08 = "Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems (GIS '08)" }
3978 @string{proc-sigspatial12 = "Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)" }
3979 @string{proc-socg-08 = "Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)" }
3980 @string{proc-socg-11 = "Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11)" }
3981 @string{proc-socg-95 = "Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG'95)" }
3982 @string{proc-socg-99 = "Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG'99)" }
3983 @string{proc-socs-10 = "Proceedings of the 3rd International Symposium on Combinatorial Search (SoCS'10)" }
3984 @string{proc-socs-12 = "Proceedings of the 5th International Symposium on Combinatorial Search (SoCS'12)" }
3985 @string{proc-soda-00 = "Proceedings of the 11th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'00)" }
3986 @string{proc-soda-01 = "Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)" }
3987 @string{proc-soda-02 = "Proceedings of the 13th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'02)" }
3988 @string{proc-soda-03 = "Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)" }
3989 @string{proc-soda-04 = "Proceedings of the 15th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'04)" }
3990 @string{proc-soda-05 = "Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)" }
3991 @string{proc-soda-06 = "Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)" }
3992 @string{proc-soda-07 = "Proceedings of the 18th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'07)" }
3993 @string{proc-soda-08 = "Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)" }
3994 @string{proc-soda-09 = "Proceedings of the 20st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'09)" }
3995 @string{proc-soda-10 = "Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)" }
3996 @string{proc-soda-11 = "Proceedings of the 22nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'11)" }
3997 @string{proc-soda-12 = "Proceedings of the 23rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'12)" }
3998 @string{proc-soda-13 = "Proceedings of the 24th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'13)" }
3999 @string{proc-soda-90 = "Proceedings of the 1st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'90)" }
4000 @string{proc-soda-91 = "Proceedings of the 2nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'91)" }
4001 @string{proc-soda-92 = "Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)" }
4002 @string{proc-soda-93 = "Proceedings of the 4th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'93)" }
4003 @string{proc-soda-96 = "Proceedings of the 7th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'96)" }
4004 @string{proc-soda-97 = "Proceedings of the 8th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'97)" }
4005 @string{proc-soda-98 = "Proceedings of the 9th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'98)" }
4006 @string{proc-soda-99 = "Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)" }
4007 @string{proc-sofsem-07 = "Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)" }
4008 @string{proc-sofsem-09 = "Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09)" }
4009 @string{proc-sofsem-11 = "Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11)" }
4010 @string{proc-softvis-03 = "Proceedings ACM 2003 Symposium on Software Visualization (SOFTVIS'03)" }
4011 @string{proc-spaa-01 = "Proceedings of the 13th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'01)" }
4012 @string{proc-spaa-03 = "Proceedings of the 15th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'03)" }
4013 @string{proc-spaa-92 = "Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'92)" }
4014 @string{proc-spie-7704 = "Proceedings of SPIE 7704: Evolutionary and Bio-Inspired Computation: Theory and Applications IV (2010)" }
4015 @string{proc-spire-10 = "Proceedings of the 17th Symposium on String Processing and Information Retrieval (Spire 2010)" }
4016 @string{proc-ssg-99 = "Section on Statistical Graphics '99" }
4017 @string{proc-stacs-05 = "Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS'05)" }
4018 @string{proc-stacs-07 = "Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)" }
4019 @string{proc-stacs-10 = "Proceedings of the 27nd International Symposium on Theoretical Aspects of Computer Science (STACS'10)" }
4020 @string{proc-stacs-94 = "Proceedings of the 11th International Symposium on Theoretical Aspects of Computer Science (STACS'94)" }
4021 @string{proc-stoc-00 = "Proceedings of the 32nd Annual {ACM} Symposium on the Theory of Computing (STOC'00)" }
4022 @string{proc-stoc-01 = "Proceedings of the 33rd Annual {ACM} Symposium on the Theory of Computing (STOC'01)" }
4023 @string{proc-stoc-03 = "Proceedings of the 35th Annual {ACM} Symposium on the Theory of Computing (STOC'03)" }
4024 @string{proc-stoc-04 = "Proceedings of the 36th Annual {ACM} Symposium on the Theory of Computing (STOC'04)" }
4025 @string{proc-stoc-07 = "Proceedings of the 39th Annual {ACM} Symposium on the Theory of Computing (STOC'07)" }
4026 @string{proc-stoc-08 = "Proceedings of the 40th Annual {ACM} Symposium on the Theory of Computing (STOC'08)" }
4027 @string{proc-stoc-09 = "Proceedings of the 41st Annual {ACM} Symposium on the Theory of Computing (STOC'09)" }
4028 @string{proc-stoc-11 = "Proceedings of the 43rd Annual {ACM} Symposium on the Theory of Computing (STOC'11)" }
4029 @string{proc-stoc-71 = "Proceedings of the 3rd Annual {ACM} Symposium on the Theory of Computing (STOC'71)" }
4030 @string{proc-stoc-81 = "Proceedings of the 13th Annual {ACM} Symposium on the Theory of Computing (STOC'81)" }
4031 @string{proc-stoc-88 = "Proceedings of the 20th Annual {ACM} Symposium on the Theory of Computing (STOC'88)" }
4032 @string{proc-stoc-89 = "Proceedings of the 21th Annual {ACM} Symposium on the Theory of Computing (STOC'89)" }
4033 @string{proc-stoc-91 = "Proceedings of the 23rd Annual {ACM} Symposium on the Theory of Computing (STOC'91)" }
4034 @string{proc-stoc-92 = "Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'92)" }
4035 @string{proc-stoc-93 = "Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)" }
4036 @string{proc-stoc-95 = "Proceedings of the 27th Annual {ACM} Symposium on the Theory of Computing (STOC'95)" }
4037 @string{proc-stoc-96 = "Proceedings of the 28th Annual {ACM} Symposium on the Theory of Computing (STOC'96)" }
4038 @string{proc-stoc-97 = "Proceedings of the 29th Annual {ACM} Symposium on the Theory of Computing (STOC'97)" }
4039 @string{proc-stoc-98 = "Proceedings of the 30th Annual {ACM} Symposium on the Theory of Computing (STOC'98)" }
4040 @string{proc-stoc-99 = "Proceedings of the 31st Annual {ACM} Symposium on the Theory of Computing (STOC'99)" }
4041 @string{proc-supercomp-95 = "Proceedings of the 1995 ACM/IEEE conference on Supercomputing" }
4042 @string{proc-swat-00 = "Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT'00)" }
4043 @string{proc-swat-02 = "Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT'04)" }
4044 @string{proc-swat-04 = "Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04)" }
4045 @string{proc-swat-06 = "Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT'06)" }
4046 @string{proc-swat-08 = "Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08)" }
4047 @string{proc-swat-10 = "Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10)" }
4048 @string{proc-swat-12 = "Proceedings of the 13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'12)" }
4049 @string{proc-swat-92 = "Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory (SWAT'92)" }
4051 @string{proc-tag-76 = "Proceedings of Theory and Applications of Graphs" }
4052 @string{proc-tamc-11 = "Proceedings of the 8th annual conference on Theory and applications of models of computation" }
4053 @string{proc-tapas-11 = "Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11)" }
4054 @string{proc-tc-94 = "Proceedings of the 26th Annual ACM Symposium on Theory of Computing" }
4055 @string{proc-tc-97 = "Proceedings of the 29th Annual ACM Symposium on Theory of Computing" }
4056 @string{proc-tggt-08 = "Topological & Geometric Graph Theory (TGGT'08)" }
4057 @string{proc-tmfogt-68 = "The Many Facets of Graph Theory, Proc." }
4059 @string{proc-uai-04 = "UAI'04 Proceedings of the 20th conference on Uncertainty in artificial intelligence" }
4061 @string{proc-vast-07 = "IEEE Symposium on Visual Analytics and Technology (VAST 2007)" }
4062 @string{proc-vd-05 = "Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering (VD'05)" }
4063 @string{proc-view-06 = "Pixelization Paradigm, Revised Selected Papers of the First Visual Information Expert Workshop" }
4064 @string{proc-vis-96 = "Proceedings of the 7th IEEE Conference on Visualization '96 (VIS'96)" }
4065 @string{proc-vissym-00 = "Proceedings of the 2nd Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym'00)" }
4066 @string{proc-vissym-02 = "Proceedings of the 4th Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym '02)" }
4067 @string{proc-vl-89 = "IEEE Workshop on Visual Languages" }
4068 @string{proc-vldb-03 = "Proceedings of the 29th International Conference on Very Large Databases (VLDB 2003)" }
4069 @string{proc-vldb-05 = "Proceedings of the 31st International Conference on Very Large Databases (VLDB 2005)" }
4070 @string{proc-vldb-09 = "Proceedings of the 35th International Conference on Very Large Databases (VLDB 2009)" }
4071 @string{proc-vldb-11 = "Proceedings of the 37th International Conference on Very Large Databases (VLDB 2011)" }
4072 @string{proc-vldb-12 = "Proceedings of the 38th International Conference on Very Large Databases (VLDB 2012)" }
4073 @string{proc-vlsi-94 = "Proceedings of the 7th International Conference on VLSI Design" }
4074 @string{proc-vnis-91 = "Proceedings of the Vehicle Navigation and Information Systems Conference (VNIS'91)" }
4075 @string{proc-vnis-94 = "Proceedings of the Vehicle Navigation and Information Systems Conference (VNSI'94)" }
4077 @string{proc-wads-03 = "Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'03)" }
4078 @string{proc-wads-05 = "Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS'05)" }
4079 @string{proc-wads-07 = "Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS'07)" }
4080 @string{proc-wads-09 = "Algorithms and Data Structures, 11th International Symposium (WADS'09)" }
4081 @string{proc-wads-11 = "Algorithms and Data Structures, 12th International Symposium (WADS'11)" }
4082 @string{proc-wads-13 = "Algorithms and Data Structures, 13th International Symposium (WADS'13)" }
4083 @string{proc-wads-91 = "Proceedings of the 2nd International Workshop on Algorithms and Data Structures (WADS'91)" }
4084 @string{proc-wads-93 = "Proceedings of the 3rd International Workshop on Algorithms and Data Structures (WADS'93)" }
4085 @string{proc-wae-00 = "Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00)" }
4086 @string{proc-wae-01 = "Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01)" }
4087 @string{proc-wae-99 = "Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE'99)" }
4088 @string{proc-walcom-09 = "Proceedings of the 3rd Workshop on Algorithms and Computation (WALCOM'09)" }
4089 @string{proc-waw-06 = "Algorithms and Models for the Web-Graph, Proceedings of the 4th International Workshop, WAW 2006" }
4090 @string{proc-waw-07 = "Algorithms and Models for the Web-Graph, Proceedings of the 5th International Workshop, WAW 2007" }
4091 @string{proc-wcnc-04 = "Proceedings of the Wireless Communications and Networking Conference 2004" }
4092 @string{proc-wea-03 = "Proceedings of the 2nd Workshop on Experimental Algorithms (WEA'03)" }
4093 @string{proc-wea-04 = "Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04)" }
4094 @string{proc-wea-05 = "Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)" }
4095 @string{proc-wea-06 = "Proceedings of the 5th Workshop on Experimental Algorithms (WEA'06)" }
4096 @string{proc-wea-07 = "Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)" }
4097 @string{proc-wea-08 = "Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)" }
4098 @string{proc-wg-00 = "Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'00)" }
4099 @string{proc-wg-01 = "Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01)" }
4100 @string{proc-wg-02 = "Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02)" }
4101 @string{proc-wg-03 = "Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)" }
4102 @string{proc-wg-04 = "Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)" }
4103 @string{proc-wg-05 = "Proceedings of the 31th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05)" }
4104 @string{proc-wg-07 = "Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07)" }
4105 @string{proc-wg-08 = "Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'08)" }
4106 @string{proc-wg-09 = "Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'09)" }
4107 @string{proc-wg-10 = "Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10)" }
4108 @string{proc-wg-80 = "Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG'80)" }
4109 @string{proc-wg-92 = "Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92)" }
4110 @string{proc-wg-93 = "Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)" }
4111 @string{proc-wg-94 = "Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)" }
4112 @string{proc-wg-98 = "Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'98)" }
4113 @string{proc-wg-99 = "Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99)" }
4114 @string{proc-wiopt-09 = "7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)" }
4115 @string{proc-wiopt-10 = "Proceedings of the 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'10)" }
4116 @string{proc-wjcc59 = "Proceedings of the Western Joint Computing Conference 1959" }
4117 @string{proc-wld-05 = "Proceedings of the 3rd international workshop on Link discovery" }
4118 @string{proc-wodes-98 = "Proceedings of the 4th International Workshop on Discrete Event Systems (WODES '98)" }
4119 @string{proc-wscg-08 = "Proceedings of the 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG'2008)" }
4120 @string{proc-wscg-99 = "Proceedings of the 7th International Conference in Central Europe on Computer Graphics, Visualizati" }
4121 @string{proc-wtasa-07 = "Proceedings of the International Workshop on Theoretical and Algorithmic Aspects of Sensor Networks (WTASA'07)" }
4122 @string{proc-www-01 = "Proceedings of the 10th International World Wide Web Conference (WWW10)" }
4123 @string{proc-www-03 = "Proceedings of the 12th International World Wide Web Conference (WWW12)" }
4124 @string{proc-www-08 = "Proceedings of the 17th International World Wide Web Conference (WWW2008)" }
4125 @string{proc-www-98 = "Proceedings of the 7th International World Wide Web Conference (WWW7)" }
4126 @string{proc-www-99 = "Proceedings of the 8th International World Wide Web Conference (WWW8)" }
4128 %% --------------------------------------------------------------
4130 %% --------------------------------------------------------------
4131 %% --------------------------------------------------------------
4134 , title = {{Ausgezeichnete Informatikdissertationen 2011}}
4135 , booktitle = {{Ausgezeichnete Informatikdissertationen 2011}}
4142 , title = {{Coxeter-Festschrift}}
4143 , booktitle = {{Coxeter-Festschrift}}
4144 , publisher = pub-smi
4151 , title = {{Computers in Railways VI}}
4152 , booktitle = {{Computers in Railways VI}}
4153 , publisher = pub-witp
4158 , title = {{CiteSeer, Scientific Literature Digital Library}}
4159 , note = {\url{citeseer.ist.psu.edu}}
4160 , url = "citeseer.ist.psu.edu"
4165 , title = {{Dynamic network of email communication at the Department of Informatics at Karlsruhe Institute of Technology (KIT)}}
4166 , 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}
4171 , title = {{10th DIMACS Implementation Challenge -- Graph Partitioning and Graph Clustering}}
4172 , note = {http://www.cc.gatech.edu/dimacs10/}
4177 , title = {{LEMON Graph Library}}
4178 , note = {http://lemon.cs.elte.hu/trac/lemon/}
4183 , title = {{Laboratory for Web Algorithmics}}
4184 , institution = "Universit{\`a} degli studi di Milano"
4185 , note = {\url{law.dsi.unimi.it}}
4186 , school = "Dipartimento di Scienze dell'Informazione (DSI)"
4187 , url = "aw.dsi.unimi.it"
4192 , title = {{Plankton: Visualizing NLANR's Web Cache Hierarchy}}
4193 , url = "http://www.caida.org/tools/visualization/plankton/"
4198 , title = {{arXiv.org e-Print archive}}
4199 , institution = "Cornell University Library"
4200 , url = "http://arxiv.org/"
4204 %% --------------------------------------------------------------
4206 @InProceedings{258641
4207 , author = RazR #and# SafraS
4208 , title = {{A sub-constant error-probability low-degree test, and a sub-constant
\r
4209 error-probability PCP characterization of NP}}
4210 , booktitle = {{Proceedings of the 29th Annual {ACM} Symposium on the Theory of Computing (STOC'97)}}
4211 , publisher = pub-ap
4215 %% --------------------------------------------------------------
4217 @techreport{ARRIVAL-TR-0097
4218 , author = BergerAndre #and# HoffmannRalf #and# LorenzU #and# StillerS
4219 , title = {{Online Delay Management: PSPACE Hardness and Simulation}}
4220 , institution = "ARRIVAL Project"
4225 %% --------------------------------------------------------------
4229 , title = {{\url{http://www.caida.org/}}}
4233 %% --------------------------------------------------------------
4236 , title = {{DBLP - Digital Bibliography and Library Project}}
4237 , note = {\url{http://dblp.uni-trier.de/}}
4241 @InProceedings{DHSS09
4242 , author = DollevoetT #and# HuismanD #and# SchmidtM #and# SchoebelA
4243 , title = {{Delay Management with Re-Routing of Passengers}}
4244 , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}}
4246 , series = ser-oasioasi
4251 , title = {{DIMES -- Distributed Internet MEasurements \& Simulations}}
4253 , url = "http://www.netdimes.org/"
4256 %% --------------------------------------------------------------
4259 , title = {{GTK-Gnutella}}
4260 , key = "GTK-Gnutella"
4261 , url = "http://gtk-gnutella.sourceforge.net/"
4265 , author = GinkelA #and# SchoebelA
4266 , title = {{To wait or not to wait? The bicriteria delay management problem in public transportation}}
4269 , pages = {527--538}
4274 @InCollection{Gov98b
4276 , title = {{The Max-Plus Algebra Approach to Railway Timetable Design }}
4277 , booktitle = {{Computers in Railways VI}}
4278 , pages = {339--350}
4279 , publisher = pub-witp
4283 @InProceedings{Gov98bOLD
4285 , title = {{The max-plus algebra approach to railway timetable design}}
4286 , pages = {339--350}
4289 %% --------------------------------------------------------------
4292 , author = CsardiG #and# NepuszT
4293 , title = {{The igraph Library for Complex Network Research}}
4294 , note = {\url{http://igraph.sourceforge.net/index.html}}
4295 , url = "http://igraph.sourceforge.net/index.html"
4299 %% --------------------------------------------------------------
4303 , title = {{\url{http://www.routeviews.org/}}}
4307 %% --------------------------------------------------------------
4309 @InCollection{SMBG01
4310 , author = SuhlL #and# MellouliT #and# BiederbickC
4311 , title = {{Managing and preventing delays in railway traffic}}
4312 , booktitle = {{Mathematical methods on Optimization in Transportation Systems}}
4318 , author = SchoebelA
4319 , title = {{Capacity constraints in delay management}}
4322 , pages = {135--154}
4330 , url = "http://www.slyck.com/"
4333 %% --------------------------------------------------------------
4335 @techreport{TR-mw-aesgp-11
4336 , author = MeinertS #and# WagnerD
4337 , title = {{An Experimental Study on Generating Planar Graphs }}
4338 , institution = kit_wagner
4339 , note = {Karlsruhe Reports in Informatics 2011-13}
4340 , pdf = "http://i11www.ira.uka.de/extra/publications/TR-mw-aesgp-11.pdf"
4341 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022486"
4345 %% --------------------------------------------------------------
4347 @InProceedings{VSM98
4348 , author = VriesRD #and# SchutterBD #and# MoorBD
4349 , title = {{On max-algebraic models for transportation networks}}
4350 , booktitle = {{Proceedings of the 4th International Workshop on Discrete Event Systems (WODES '98)}}
4351 , pages = {457--462}
4355 %% --------------------------------------------------------------
4359 , title = {{On the Asymptotic Distribution of the Eigenvalues of Random Matrices}}
4361 , pages = {262--268}
4367 , author = AnderbergMR
4368 , title = {{Cluster Analysis for Applications}}
4369 , isbn = "0-12-057650-3"
4370 , publisher = pub-ap
4371 , series = "Probability and Math"
4378 , title = {{Categorical Data Analysis}}
4380 , publisher = pub-wiley
4384 @mastersthesis{a-chbtn-12
4386 , title = {{Contraction-Hierarchy-Based Transit-Node Routing}}
4387 , school = "Karlsruhe Institute of Technology"
4388 , type = {Studienarbeit}
4394 , title = {{Combinatorial Theory}}
4395 , publisher = pub-springer
4401 , title = {{Eigenvalues and Expanders}}
4409 @article{a-gprpmfa-90
4411 , title = {{Generating pseudo-random permutations and maximum flow algorithms}}
4415 , pages = {201--204}
4422 , title = {{A graph theoretic definition of a sociometric clique}}
4424 , pages = {113--126}
4430 , author = AndreevEM
4431 , title = {{On Convex Polyhedra in Loba{\v{c}}hevski{\v{i}} Spaces}}
4432 , journal = j-mussrs
4434 , pages = {413--440}
4439 @techreport{a-rdg-71
4440 , author = AnthonisseJ
4441 , title = {{The rush in a directed graph}}
4442 , address = "2e Boerhaavestraat 49 Amsterdam"
4443 , institution = "Stichting Mathematisch Centrum"
4445 , number = {BN 9/71}
4449 @mastersthesis{a-rpr-12
4450 , author = AndreevSD
4451 , title = {{Realistic Pedestrian Routing}}
4453 , school = "Karlsruhe Institute of Technology"
4454 , type = {Bachelor Thesis}
4458 @InProceedings{a-stga-98
4460 , title = {{Spectral Techniques in Graph Algorithms}}
4461 , booktitle = {{Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98)}}
4462 , pages = {206--215}
4463 , series = ser-springer_lncs
4464 , url = "http://portal.acm.org/citation.cfm?id=690180&coll=Portal&dl=GUIDE&CFID=40850466&CFTOKEN=3545646#"
4469 @InProceedings{a-vspaa-67
4471 , title = {{Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities}}
4472 , booktitle = {{AFIPS'67 (Spring): Proceedings of the April 18-20, 1967, spring joint computer conference}}
4473 , pages = {483--485}
4474 , publisher = pub-acm
4479 , editor = AlbersS #and# AltH #and# NaeherS
4480 , title = {{Efficient Algorithms}}
4481 , booktitle = {{Efficient Algorithms}}
4482 , publisher = pub-springer
4483 , series = ser-springer_lncs
4489 , author = AkonMM #and# AsaduzzamanS #and# RahmanS
4490 , title = {{Proposal for $st$-Routing Protocol}}
4493 , pages = {287--298}
4499 , author = AldenderferMS #and# BlashfieldRK
4500 , title = {{Cluster Analysis}}
4501 , publisher = pub-sage
4506 , author = AnnexsteinFD #and# BermanKA
4507 , title = {{Directional Routing via Generalized $st$-Numbering}}
4511 , pages = {268--279}
4517 , author = AlbertR #and# BarabasiAL
4518 , title = {{Statistical Mechanics of Complex Networks}}
4526 @article{abeht-tcpg-81
4527 , author = AkiyamaJ #and# BoeschFT #and# EraH #and# HararyF #and# TindellR
4528 , title = {{The Cohesiveness of a Point of a Graph}}
4529 , journal = j-networks
4536 @Article{abfflr-oci-99
4537 , author = AzarY #and# BartalY #and# FeuersteinE #and# FiatA #and# LeonardiS #and# RosenA
4538 , title = {{On Capital Investment}}
4546 @InProceedings{abfkk-pcrpg-12
4547 , author = AlamJ #and# BiedlT #and# FelsnerS #and# KaufmannM #and# KobourovSG
4548 , title = {{Proportional Contact Representations of Planar Graphs}}
4549 , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}}
4551 , publisher = pub-springer
4552 , series = ser-springer_lncs
4556 @inproceedings{abfw-mendg-04
4557 , author = AggarwalV #and# BenderS #and# FeldmannA #and# WichmannA
4558 , title = {{Methodology for Estimating Network Distances of Gnutella Neighbors}}
4559 , booktitle = {{GI Jahrestagung}}
4560 , pages = {219--223}
4564 @InProceedings{ablp-ocrc-89
4565 , author = AlonN #and# Bar-NoyA #and# LinialN #and# PelegD
4566 , title = {{On the Complexity of Radio Communication}}
4567 , booktitle = {{Proceedings of the 21th Annual {ACM} Symposium on the Theory of Computing (STOC'89)}}
4568 , pages = {274--285}
4569 , publisher = pub-acm
4574 , author = AlberJ #and# BetzlerN #and# NiedermeierR
4575 , title = {{Experiments on data reduction for optimal domination in networks}}
4578 , pages = {105--117}
4583 @InProceedings{abs-tslra-11
4584 , author = ArgyriouE #and# BekosM #and# SymvonisA
4585 , title = {{The Straight-Line RAC Drawing Problem Is {$\mathcal{NP}$}-Hard}}
4586 , booktitle = {{Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11)}}
4589 , publisher = pub-springer
4590 , series = ser-springer_lncs
4595 @InProceedings{accgghmmnprvvw-ccg-08
4596 , 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
4597 , title = {{Cover Contact Graphs}}
4598 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
4600 , pages = {171--182}
4601 , pdf = "http://i11www.ira.uka.de/extra/publications/accgghmmnprvvw-ccg-08.pdf"
4602 , publisher = pub-springer
4603 , series = ser-springer_lncs
4604 , url = "http://dx.doi.org/10.1007/978-3-540-77537-9_18"
4609 @InProceedings{acflss-kavcp-04
4610 , author = Abu-KhzamFN #and# CollinsRL #and# FellowsMR #and# LangstonMA #and# SutersWH #and# SymonsCT
4611 , title = {{Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments}}
4612 , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}}
4614 , publisher = pub-siam
4618 @article{acg-rpgm-94
4619 , author = AlonN #and# ChungFRK #and# GrahamRL
4620 , title = {{Routing Permutations on Graphs via Matchings}}
4622 , pages = {513--530}
4627 @book{acgkm-cacop-02
4628 , author = AusielloG #and# CrescenziP #and# GambosiG #and# KannV #and# MarchettiSpaccamelaA
4629 , title = {{Complexity and Approximation - Combinatorial Optimization Problems and Their Approximability Properties}}
4631 , publisher = pub-springer
4635 @inproceedings{acim-fedsp-99
4636 , author = AingworthD #and# ChekuriC #and# MotwaniR
4637 , title = {{Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)}}
4638 , booktitle = {{Proceedings of the 7th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'96)}}
4639 , publisher = pub-ieeecs
4640 , url = "citeseer.ist.psu.edu/aingworth96fast.html"
4644 @inproceedings{acl-rgmmg-00
4645 , author = AielloW #and# ChungFRK #and# LuL
4646 , title = {{A random graph model for massive graphs}}
4647 , booktitle = {{Proceedings of the 32nd Annual {ACM} Symposium on the Theory of Computing (STOC'00)}}
4649 , pages = {171--180}
4654 , editor = AlaviY #and# ChartrandG #and# OellermannOR #and# SchwenkAJ
4655 , title = {{Graph Theory, Combinatorics, and Applications}}
4656 , booktitle = {{Graph Theory, Combinatorics, and Applications}}
4657 , publisher = pub-wiley
4662 @Article{acp-cfet-87
4663 , author = ArnborgS #and# CorneilDG #and# ProskurowskiA
4664 , title = {{Complexity of Finding Embeddings in a $k$-Tree}}
4667 , pages = {277--284}
4668 , url = "http://dx.doi.org/10.1137/0608024"
4673 @unpublished{adbv-cdata-05
4674 , author = AlvarezHamelinJI #and# DallAstaL #and# BarratA #and# VespignaniA
4675 , title = {{$k$-Core Decomposition: A Tool for the Analysis of Large Scale Internet Graphs}}
4677 , note = {electronically published at \url{http://arxiv.org/abs/cs.NI/0511007}}
4679 , url = "http://arxiv.org/abs/cs.NI/0511007"
4683 @InProceedings{adbv-lsnfv-06
4684 , author = AlvarezHamelinJI #and# DallAstaL #and# BarratA #and# VespignaniA
4685 , title = {{Large Scale Networks Fingerprinting and Visualization Using the k-Core Decomposition}}
4686 , booktitle = {{Advances in Neural Information Processing Systems 18}}
4688 , pdf = "http://books.nips.cc/papers/files/nips18/NIPS2005_0999.pdf"
4689 , publisher = pub-mitpr
4693 @Article{adcgghmmnprvvw-ccg-12
4694 , 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
4695 , title = {{Cover Contact Graphs}}
4698 , pages = {102--131}
4699 , pdf = "http://i11www.ira.uka.de/extra/publications/adcgghmmnprvvw-ccg-12.pdf"
4700 , url = "http://jocg.org/index.php/jocg/article/ view/66/31"
4705 @InProceedings{adf-cotca-12
4706 , author = AleardiLC #and# DevillersO #and# FusyE
4707 , title = {{Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings}}
4708 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
4709 , publisher = pub-springer
4710 , series = ser-springer_lncs
4716 , author = ArenasA #and# DuchJ #and# FernandezA #and# GomezS
4717 , title = {{Size reduction of complex networks preserving modularity}}
4720 , pdf = "http://www.iop.org/EJ/article/1367-2630/9/6/176/njp7_6_176.pdf"
4721 , url = "http://dx.doi.org/10.1088/1367-2630/9/6/176"
4727 , author = AbrahamI #and# DellingD #and# FiatA #and# GoldbergAV #and# WerneckR
4728 , title = {{Highway dimension and provably efficient shortest path algorithms}}
4729 , type = {submitted}
4733 @InProceedings{adfgw-hldbl-12
4734 , author = AbrahamI #and# DellingD #and# FiatA #and# GoldbergAV #and# WerneckR
4735 , title = {{HLDB: Location-Based Services in Databases}}
4736 , booktitle = {{Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)}}
4737 , pages = {339--348}
4738 , pdf = "http://i11www.ira.uka.de/extra/publications/adfgw-hldbl-12.pdf"
4739 , publisher = pub-acm
4743 @InProceedings{adfgw-vcdsp-11
4744 , author = AbrahamI #and# DellingD #and# FiatA #and# GoldbergAV #and# WerneckR
4745 , title = {{VC-Dimension and Shortest Path Algorithms}}
4746 , booktitle = {{Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP'11)}}
4747 , pages = {690--699}
4748 , publisher = pub-springer
4749 , series = ser-springer_lncs
4754 @InProceedings{adfjkpr-tppeg-10
4755 , author = AngeliniP #and# DiBattistaG #and# FratiF #and# JelinekV #and# KratochvilJ #and# PatrignaniM #and# RutterI
4756 , title = {{Testing Planarity of Partially Embedded Graphs}}
4757 , booktitle = {{Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)}}
4758 , pages = {202--221}
4759 , publisher = pub-siam
4760 , url = "http://www.siam.org/proceedings/soda/2010/SODA10_019_angelinip.pdf"
4764 @Article{adfpr-tsegi-12
4765 , author = AngeliniP #and# DiBattistaG #and# FratiF #and# PatrignaniM #and# RutterI
4766 , title = {{Testing the Simultaneous Embeddability of two Graphs whose Intersection is a Biconnected or a Connected Graph}}
4768 , note = {Special issue of IWOCA'10}
4769 , pages = {150--172}
4770 , url = "http://dx.doi.org/10.1016/j.jda.2011.12.015"
4775 @InProceedings{adfpr-tsetg-10
4776 , author = AngeliniP #and# DiBattistaG #and# FratiF #and# PatrignaniM #and# RutterI
4777 , title = {{Testing the Simultaneous Embeddability of Two Graphs whose Intersection is a Biconnected Graph or a Tree}}
4778 , booktitle = {{Proceedings of the 21st International Workshop on Combinatorial Algorithms}}
4779 , pages = {212--225}
4780 , publisher = pub-springer
4781 , series = ser-springer_lncs
4786 @techreport{adgw-ahbla-10
4787 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR
4788 , title = {{A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks}}
4789 , institution = "Microsoft Research"
4790 , number = {MSR-TR-2010-165}
4794 @InProceedings{adgw-ahbla-11
4795 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR
4796 , title = {{A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks}}
4797 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
4798 , pages = {230--241}
4799 , publisher = pub-springer
4800 , series = ser-springer_lncs
4805 @InProceedings{adgw-arrn-10
4806 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR
4807 , title = {{Alternative Routes in Road Networks}}
4808 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
4811 , publisher = pub-springer
4812 , series = ser-springer_lncs
4813 , url = "http://research.microsoft.com/apps/pubs/default.aspx?id=121750"
4818 @Article{adgw-arrn-13
4819 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR
4820 , title = {{Alternative Routes in Road Networks}}
4821 , journal = j-acm-ea
4828 @InProceedings{adgw-hhlsp-12
4829 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR
4830 , title = {{Hierarchical Hub Labelings for Shortest Paths}}
4831 , booktitle = {{Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)}}
4833 , pdf = "http://i11www.ira.uka.de/extra/publications/adgw-hhlsp-12.pdf"
4834 , publisher = pub-springer
4835 , series = ser-springer_lncs
4840 @techreport{adgw-hhlsp-12TR
4841 , author = AbrahamI #and# DellingD #and# GoldbergAV #and# WerneckR
4842 , title = {{Hierarchical Hub Labelings for Shortest Paths}}
4843 , institution = "Microsoft Research"
4844 , number = {MSR-TR-2012-46}
4845 , pdf = "http://research.microsoft.com/pubs/163231/MSR-TR-2012-46.pdf"
4850 , author = AlberJ #and# DornF #and# NiedermeierR
4851 , title = {{Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs}}
4854 , pages = {219--231}
4859 @Article{afffnrs-ads-05
4860 , author = AlberJ #and# FanH #and# FellowsMR #and# FernauH #and# NiedermeierR #and# RosamondF #and# StegeU
4861 , title = {{A refined search tree technique for Dominating Set on planar graphs}}
4864 , pages = {385--405}
4869 @techreport{afggw-aotcv-05
4870 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD
4871 , title = {{Analysis of Overlay-Underlay Topology Correlation using Visualization}}
4872 , institution = iti_wagner
4873 , number = {2005-31}
4874 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3039"
4875 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000004239"
4879 @InProceedings{afggw-aotcv-06
4880 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD
4881 , title = {{Analysis of Overlay-Underlay Topology Correlation using Visualization}}
4882 , booktitle = {{Proceedings of the 5th IADIS International Conference WWW/Internet Geometry}}
4883 , location = "Murcia, Spain"
4884 , note = {awarded as outstanding paper}
4885 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/IADIS_Conference_8_camready.pdf"
4889 @InProceedings{afggw-avdao-07
4890 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD
4891 , title = {{A Visualization-Driven Approach to Overlay-Underlay Engineering}}
4892 , booktitle = {{Proceedings of the Final Workshop of DELIS}}
4895 , pdf = "http://i11www.ira.uka.de/extra/publications/afggw-avdao-07.pdf"
4896 , publisher = pub-hniup
4901 @Article{afggw-moucu-08
4902 , author = AggarwalV #and# FeldmannA #and# GaertlerM #and# GoerkeR #and# WagnerD
4903 , title = {{Modelling Overlay-Underlay Correlations Using Visualization}}
4906 , pages = {114--125}
4907 , pdf = "http://www.telenor.com/en/resources/images/114-125_OverlayUnderlayCorrelations_tcm28-36845.pdf"
4908 , url = "http://www.telenor.com/en/innovation/research/publications/telektronikk/volume/telektronikk-1-2008"
4913 @InProceedings{afgw-hdspp-10
4914 , author = AbrahamI #and# FiatA #and# GoldbergAV #and# WerneckR
4915 , title = {{Highway Dimension, Shortest Paths, and Provably Efficient Algorithms}}
4916 , booktitle = {{Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)}}
4917 , pages = {782--793}
4918 , pdf = "http://www.siam.org/proceedings/soda/2010/SODA10_064_abrahami.pdf"
4919 , publisher = pub-siam
4923 @InProceedings{afkmt-garac-10
4924 , author = ArikushiK #and# FulekR #and# KeszeghB #and# MoricF #and# TothC
4925 , title = {{Graphs that Admit Right Angle Crossing Drawings}}
4926 , booktitle = {{Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'10)}}
4927 , pages = {135--146}
4928 , publisher = pub-springer
4929 , series = ser-springer_lncs
4934 @InProceedings{afl-swhgt-08
4935 , author = AleardiLC #and# FusyE #and# LewinerT
4936 , title = {{Schnyder Woods for Higher Genus Triangulated Surfaces}}
4937 , booktitle = {{Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)}}
4938 , pages = {311--319}
4939 , publisher = pub-acm
4943 @Article{afl-swhgt-09
4944 , author = AleardiLC #and# FusyE #and# LewinerT
4945 , title = {{Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding}}
4948 , pages = {489--516}
4953 @InProceedings{afn-eds-02
4954 , author = AlberJ #and# FellowsMR #and# NiedermeierR
4955 , title = {{Efficient data reduction for Dominating Set: a linear problem kernel for the planar case}}
4956 , booktitle = {{Proceedings of the 8th Scandinavian Workshop on Algorithm Theory (SWAT'04)}}
4958 , pages = {150--159}
4959 , publisher = pub-springer
4960 , series = ser-springer_lncs
4966 , author = AlberJ #and# FernauH #and# NiedermeierR
4967 , title = {{Parameterized complexity: exponential speed-up for planar graph problems}}
4976 @Article{afs-cipsc-07
4977 , author = AggarwalV #and# FeldmannA #and# ScheidelerC
4978 , title = {{Can ISPs and P2P Systems Cooperate for Improved Performance?}}
4979 , journal = j-acm-ccr
4982 , url = "http://doi.acm.org/10.1145/1273445.1273449"
4989 , title = {{Numerical Methods that Work}}
4990 , publisher = pub-maa
4994 @InProceedings{ag-tus-05
4995 , author = AdamicLA #and# GlanceN
4996 , title = {{The political blogosphere and the 2004 U.S. election: divided they blog}}
4997 , booktitle = {{Proceedings of the 3rd international workshop on Link discovery}}
4999 , publisher = pub-acm
5003 @Article{agdivlj-p-03
5004 , author = ArchakovAI #and# GovorunVM #and# DubanovAV #and# IvanovYD #and# VeselovskyAV #and# LewiP #and# JanssenP
5005 , title = {{Protein-protein interactions as a target for drugs in proteomics}}
5009 , pages = {380--391}
5010 , url = "http://www.ncbi.nlm.nih.gov/pubmed/12687606?dopt=Abstract"
5015 @techreport{aggw-hnpcn-05
5016 , author = AlvarezHamelinJI #and# GaertlerM #and# GoerkeR #and# WagnerD
5017 , title = {{Halfmoon - A new Paradigm for Complex Network Visualization}}
5018 , institution = iti_wagner
5019 , number = {2005-29}
5020 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3038"
5021 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000004127"
5025 @InProceedings{agkn-vlhcg-12
5026 , author = AthenstadtJC #and# GoerkeR #and# KrugM #and# NollenburgM
5027 , title = {{Visualizing Large Hierarchically Clustered Graphs with a Landscape Metaphor}}
5028 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
5029 , note = {Poster abstract.}
5030 , pages = {553--554}
5031 , pdf = "http://i11www.ira.uka.de/extra/publications/agkn-vlhcg-12.pdf"
5032 , publisher = pub-springer
5033 , series = ser-springer_lncs
5034 , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_49"
5039 @article{ah-ggcin-73
5040 , author = AminAT #and# HakimiSL
5041 , title = {{Graphs with Given Connectivity and Independence Number or Networks with Given Measures of Vulnerability and Survivability}}
5050 @article{ahi-cfds-02
5051 , author = AsahiroY #and# HassinR #and# IwamaK
5052 , title = {{Complexity of finding dense subgraphs}}
5060 @Article{ahk-alsgv-06
5061 , author = AbelloJ #and# HamF #and# KrishnanN
5062 , title = {{ASK-GraphView: A Large Scale Graph Visualization System}}
5066 , pages = {669--676}
5067 , pdf = "http://researchweb.watson.ibm.com/visual/papers/ASK-Graphview3.pdf"
5072 @InProceedings{ahls-tsppr-10
5073 , author = ArtmeierA #and# HaselmayrJ #and# LeuckerM #and# SachenbacherM
5074 , title = {{The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles}}
5075 , booktitle = {{Proceedings of the 33rd Annual German Conference on Advances in Artificial Intelligence}}
5077 , pages = {309--316}
5078 , publisher = pub-springer
5079 , series = ser-springer_lncs
5080 , url = "http://dx.doi.org/10.1007/978-3-642-16111-7_35"
5086 , author = AhoAV #and# HopcroftJE #and# UllmanJD
5087 , title = {{The Design and Analysis of Computer Algorithms}}
5088 , publisher = pub-aw
5093 , author = AhoAV #and# HopcroftJE #and# UllmanJD
5094 , title = {{Data Structures and Algorithms}}
5095 , publisher = pub-aw
5099 @article{aitt-gfds-00
5100 , author = AsahiroY #and# IwamaK #and# TamakiH #and# TokuyamaT
5101 , title = {{Greedily finding a dense subgraph}}
5104 , pages = {203--221}
5110 , author = AndersonJG #and# JaySJ
5111 , title = {{The Diffusion of Medical Technology: {Social} network analysis and policy research}}
5118 @article{ajb-dwww-99
5119 , author = AlbertR #and# JeongH #and# BarabasiAL
5120 , title = {{Diameter of the World Wide Web}}
5121 , journal = j-nature
5123 , pages = {130--131}
5128 @article{ajb-eatcn-00
5129 , author = AlbertR #and# JeongH #and# BarabasiAL
5130 , title = {{Error and attack tolerance of complex networks}}
5131 , journal = j-nature
5133 , pages = {378--382}
5138 @Article{ajm-cmcgc-04
5139 , author = AnY #and# JanssenJ #and# MiliosEE
5140 , title = {{Characterizing and Mining the Citation Graph of the Computer Science Literature}}
5143 , pages = {664--678}
5148 @InProceedings{ak-gefbm-93
5149 , author = AlpertCJ #and# KahngAB
5150 , title = {{Geometric Embeddings for Faster and Better Multi-Way Netlist Partitioning}}
5151 , booktitle = {{Proceedings of the 30th ACM/IEEE Conference on Design Automation}}
5152 , pages = {743--748}
5153 , publisher = pub-acm
5157 @Article{ak-mmgcm-08
5158 , author = AgarwalG #and# KempeD
5159 , title = {{Modularity-Maximizing Graph Communities via Mathematical Programming }}
5163 , pages = {409--418}
5164 , pdf = "http://www.springerlink.com/content/w3221r727wr20x74/fulltext.pdf"
5165 , url = "http://www.springerlink.com/content/w3221r727wr20x74"
5170 @Article{ak-rdnps-95
5171 , author = AlpertCJ #and# KahngAB
5172 , title = {{Recent Directions in Netlist Partitioning: A Survey}}
5176 , url = "http://vlsicad.cs.ucla.edu/~cheese/survey.html"
5181 @article{akk-ptasdinphp-99
5182 , author = AroraS #and# KargerDR #and# KarpinskiM
5183 , title = {{Polynomial time approximation schemes for dense instances of {$\mathcal{NP}$}-hard problems}}
5186 , pages = {193--210}
5192 , author = AurenhammerF #and# KleinR #and# LeeD
5193 , title = {{Voronoi Diagrams and Delaunay Triangulations}}
5194 , booktitle = {{Voronoi Diagrams and Delaunay Triangulations}}
5196 , publisher = pub-wsp
5201 , author = AxenovichM #and# KrugM #and# OsangG #and# RutterI
5202 , title = {{Fork-forests in bi-colored complete bipartite graphs}}
5205 , pages = {1363--1366}
5206 , url = "http://dx.doi.org/10.1016/j.dam.2013.01.023"
5211 @article{aks-flhcrg-98
5212 , author = AlonN #and# KrivelevichM #and# SudakovB
5213 , title = {{Finding a large hidden clique in a random graph}}
5216 , pages = {457--466}
5221 @InProceedings{al-aaigp-08
5222 , author = AndersenR #and# LangKJ
5223 , title = {{An Algorithm for Improving Graph Partitions}}
5224 , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}}
5225 , pages = {651--660}
5229 @techreport{al-dgpro-04
5230 , author = AvrachenkovK #and# LitvakN
5231 , title = {{Decomposition of the Google PageRank and optimal linking strategy}}
5232 , address = "Sophia Antipolis, France"
5233 , institution = "INRIA"
5239 @Article{alph-spln-01
5240 , author = AdamicLA #and# LukoseRM #and# PuniyaniAR #and# HubermanBA
5241 , title = {{Search in Power-Law Networks}}
5246 , pdf = "http://prola.aps.org/pdf/PRE/v64/i4/e046135"
5247 , url = "http://dx.doi.org/10.1103/PhysRevE.64.046135"
5252 @InProceedings{alpp-anupc-09
5253 , author = AvinC #and# LotkerZ #and# PasqualeF #and# PignoletY
5254 , title = {{A Note on Uniform Power Connectivity in the SINR Model}}
5255 , booktitle = {{Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)}}
5256 , pages = {116--127}
5257 , publisher = pub-springer
5258 , series = ser-springer_lncs
5262 @techreport{als-tnrr-12
5263 , author = ArzJ #and# LuxenD #and# SandersP
5264 , title = {{Transit Node Routing Reconsidered}}
5265 , institution = "Karlsruhe Institute of Technology"
5266 , pdf = "http://arxiv.org/pdf/1302.5611v1.pdf"
5267 , url = "http://arxiv.org/pdf/1302.5611v1.pdf"
5271 @InProceedings{als-tnrr-13
5272 , author = ArzJ #and# LuxenD #and# SandersP
5273 , title = {{Transit Node Routing Reconsidered}}
5274 , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}}
5276 , publisher = pub-springer
5277 , series = ser-springer_lncs
5283 , author = AldecoaR #and# MarinI
5284 , title = {{Closed benchmarks for network community structure characterization}}
5288 , url = "http://link.aps.org/doi/10.1103/PhysRevE.85.026109"
5293 @Article{am-dncss-11
5294 , author = AldecoaR #and# MarinI
5295 , title = {{Deciphering Network Community Structure by Surprise}}
5296 , journal = j-plsone
5304 , author = AlonN #and# MilmanVD
5305 , title = {{$\lambda_1$, Isoperimetric Inequalities for Graphs, and Superconcentrators}}
5306 , journal = j-jcombthb
5312 @Article{am-jeacn-10
5313 , author = AldecoaR #and# MarinI
5314 , title = {{Jerarca: Efficient Analysis of Complex Networks Using Hierarchical Clustering}}
5315 , journal = j-plsone
5318 , url = "http://dx.doi.org/10.1371%2Fjournal.pone.0011585"
5324 , author = AldecoaR #and# MarinI
5325 , title = {{Surprise maximization reveals the community structure of complex networks}}
5329 , url = "http://dx.doi.org/10.1038/srep01060"
5334 @Article{ama-tmlgl-07
5335 , author = ArchambaultD #and# MunznerT #and# AuberD
5336 , title = {{TopoLayout: Multi-Level Graph Layout by Topological Features}}
5339 , pages = {305--317}
5340 , url = "http://www.cs.ubc.ca/nest/imager/tr/2006/Archambault_TopoLayout_TVCG/"
5345 @Article{amm-icapi-05
5346 , author = ArnauV #and# MarsS #and# MarinI
5347 , title = {{Iterative Cluster Analysis of Protein Interaction Data}}
5350 , pages = {364--378}
5351 , url = "http://bioinformatics.oxfordjournals.org/content/21/3/364.abstract"
5357 , author = AhujaRK #and# MagnantiTL #and# OrlinJB
5358 , title = {{Network Flows: Theory, Algorithms, and Applications}}
5359 , publisher = pub-ph
5363 @Article{amot-faspp-90
5364 , author = AhujaRK #and# MehlhornK #and# OrlinJB #and# TarjanR
5365 , title = {{Faster Algorithms for the Shortest Path Problem}}
5368 , pages = {213--223}
5374 , author = AlonN #and# MoshkovitzD #and# SafraS
5375 , title = {{Algorithmic construction of sets for k-restrictions}}
5378 , pages = {153--177}
5384 , editor = AhujaRK #and# MoehringR #and# ZaroliagisC
5385 , title = {{Robust and Online Large-Scale Optimization}}
5386 , booktitle = {{Robust and Online Large-Scale Optimization}}
5387 , publisher = pub-springer
5388 , series = ser-springer_lncs
5393 @unpublished{antt-prcsw-01
5394 , author = ArasuA #and# NovakJ #and# TomkinsAS #and# TomlinJ
5395 , title = {{PageRank computation and the structure of the web: experiments and algorithms}}
5397 , note = {short version appeared in Proceedings of the 11th International World Wide Web Conference, Poster Tr}
5398 , url = "http://www-staff.it.uts.efu.au/~tomlin/prankwww-long.pdf"
5402 @article{ao-dapmf-91
5403 , author = AhujaRK #and# OrlinJB
5404 , title = {{Distance-based augmenting path algorithms for the maximum flow and parametric maximum flow problems}}
5406 , pages = {413--430}
5411 @article{ao-fsamfp-89
5412 , author = AhujaRK #and# OrlinJB
5413 , title = {{A Fast and Simple Algorithm for the Maximum Flow Problem}}
5417 , pages = {748--759}
5422 @Article{aops-dspmt-03
5423 , author = AhujaRK #and# OrlinJB #and# PallottinoS #and# ScutellaMG
5424 , title = {{Dynamic Shortest Paths Minimizing Travel Times and Costs}}
5425 , journal = j-networks
5427 , pages = {197--205}
5432 @Article{ap-ltanp-89
5433 , author = ArnborgS #and# ProskurowskiA
5434 , title = {{Linear Time Algorithms for NP-hard Problems Restricted to Partial k-Trees}}
5443 @inproceedings{apc-aolpic-03
5444 , author = AbiteboulS #and# PredaM #and# CobenaG
5445 , title = {{Adaptive On-Line Page Importance Computation}}
5446 , address = "Budapest, Hungary"
5447 , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}}
5448 , pages = {280--290}
5452 @InProceedings{ar-b-04
5453 , author = AndreevK #and# RackeH
5454 , title = {{Balanced graph partitioning}}
5455 , booktitle = {{Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures}}
5456 , pages = {120--124}
5457 , publisher = pub-acm
5458 , url = "http://doi.acm.org/10.1145/1007912.1007931"
5462 @InProceedings{arv-efgeg-04
5463 , author = AroraS #and# RaoS #and# VaziraniU
5464 , title = {{Expander Flows, Geometric Embeddings and Graph Partitioning}}
5465 , booktitle = {{Proceedings of the 36th Annual {ACM} Symposium on the Theory of Computing (STOC'04)}}
5466 , pages = {222--231}
5467 , publisher = pub-acm
5468 , url = "http://doi.acm.org/10.1145/1007352.1007355"
5473 , author = AlonN #and# SpencerJ
5474 , title = {{The Probabilistic Method}}
5475 , publisher = pub-wiley
5480 , author = AlonN #and# SpencerJ #and# ErdoesP
5481 , title = {{The Probabilistic Method}}
5482 , publisher = pub-wiley
5487 , author = AignerM #and# TrieschE
5488 , title = {{Realizability and Uniqueness in graphs}}
5495 @inproceedings{aw-fmopm-12
5496 , author = AntsfeldL #and# WalshT
5497 , title = {{Finding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm}}
5498 , booktitle = {{Proceedings of the 19th ITS World Congress}}
5502 @article{awc-pplms-99
5503 , author = AndersonCJ #and# WassermanS #and# CrouchB
5504 , title = {{A $p^*$ Primer: {Logit} Models for Social Networks}}
5514 , author = AndersonCJ #and# WassermanS #and# FaustK
5515 , title = {{Building stochastic blockmodels}}
5517 , pages = {137--161}
5522 @InProceedings{ay-oaced-05
5523 , author = AggarwalCC #and# YuPS
5524 , title = {{Online Analysis of Community Evolution in Data Streams}}
5525 , booktitle = {{Proceedings of the fifth SIAM International Conference on Data Mining}}
5526 , pdf = "http://www.charuaggarwal.net/aggar142.pdf"
5527 , publisher = pub-siam
5531 @InProceedings{ay-spmeb-95
5532 , author = AlpertCJ #and# YaoS
5533 , title = {{Spectral Partitioning: The More Eigenvectors, the Better}}
5534 , booktitle = {{Proceedings of the 32nd ACM/IEEE Conference on Design Automation}}
5535 , pages = {195--200}
5536 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=217529&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36000283&CFTOKEN=73"
5537 , publisher = pub-acm
5538 , url = "http://doi.acm.org/10.1145/217474.217529"
5542 @article{ayz-fcglc-97
5543 , author = AlonN #and# YusterR #and# ZwickU
5544 , title = {{Finding and Counting Given Length Cycles}}
5547 , pages = {209--223}
5553 , author = AndroutsopoulosKN #and# ZografosKG
5554 , title = {{Solving the multi-criteria time-dependent routing and scheduling problem in a multi-modal fixed schedule network}}
5561 @Article{azc-mopap-07
5562 , author = AifadopoulouG #and# ZiliaskopoulosA #and# ChrisohoouE
5563 , title = {{Multiobjective Optimum Path Algorithm for Passenger Pretrip Planning in Multimodal Transportation Networks}}
5566 , note = {10.3141/2032-04}
5573 %% --------------------------------------------------------------
5575 @inproceedings{b-aaem-03
5577 , title = {{Approximation Algorithm for Embedding Metrics into a Two-dimensional Space}}
5578 , booktitle = {{Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)}}
5579 , pages = {434--443}
5584 , author = BarnetteDW
5585 , title = {{A Construction of 3-Connected Graphs}}
5587 , pages = {397--407}
5592 @InProceedings{b-afsia-04
5593 , author = Baeza-YatesR
5594 , title = {{A Fast Set Intersection Algorithm for Sorted Sequences}}
5595 , booktitle = {{Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching (CPM'04)}}
5596 , pages = {400--408}
5597 , publisher = pub-springer
5598 , series = ser-springer_lncs
5604 , author = BrilloutR
5605 , title = {{A Multi-Level Framework for Bisection Heuristics}}
5606 , note = {Studienarbeit Informatik}
5612 , author = BachmaierC
5613 , title = {{A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information}}
5616 , pages = {585--594}
5617 , url = "http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4135662"
5622 @InCollection{b-ascdm-06
5624 , title = {{A Survey of Clustering Data Mining Techniques}}
5625 , booktitle = {{Grouping Multidimensional Data: Recent Advances in Clustering}}
5627 , publisher = pub-springer
5628 , url = "http://www.springerlink.com/content/x321256p66512121/"
5633 , author = BorgattiSP
5634 , title = {{Centrality and {AIDS}}}
5637 , pages = {112--115}
5644 , title = {{Communication patterns in task oriented groups}}
5646 , pages = {271--282}
5651 @InCollection{b-cpttw-09
5653 , title = {{Car or Public Transport {--} Two Worlds}}
5654 , booktitle = {{Efficient Algorithms}}
5655 , pages = {355--367}
5656 , publisher = pub-springer
5657 , series = ser-springer_lncs
5662 @InProceedings{b-cugdr-99
5664 , title = {{Color Use Guidelines for Data Representation}}
5665 , booktitle = {{Section on Statistical Graphics '99}}
5667 , publisher = pub-asa
5668 , url = "http://www.personal.psu.edu/cab38/ColorSch/ASApaper.html"
5672 @InCollection{b-dgd-01
5674 , title = {{Dynamic Graph Drawing}}
5675 , booktitle = {{Drawing Graphs: Methods and Models}}
5676 , isbn = "3-540-42062-2"
5677 , pages = {228--246}
5678 , pdf = "http://www.springerlink.com/content/0ggdwjkyrr5q8u0k/fulltext.pdf"
5679 , publisher = pub-springer
5680 , series = ser-springer_lncs
5681 , url = "http://www.springerlink.com/content/0ggdwjkyrr5q8u0k/"
5686 @InCollection{b-dpa-01
5688 , title = {{Drawing on Physical Analogies}}
5689 , booktitle = {{Drawing Graphs: Methods and Models}}
5690 , isbn = "3-540-42062-2"
5692 , pdf = "http://www.springerlink.com/content/8w9xeajyn1ql4kxq/fulltext.pdf"
5693 , publisher = pub-springer
5694 , series = ser-springer_lncs
5695 , url = "http://www.springerlink.com/content/8w9xeajyn1ql4kxq/"
5700 @InProceedings{b-dpp-98
5702 , title = {{Drawing Planar Partitions {I}: {LL}-Drawings and {LH}-Drawings}}
5703 , booktitle = {{Proceedings of the 14th Annual Symposium on Computational Geometry}}
5704 , pages = {287--296}
5705 , publisher = pub-acm
5706 , url = "http://doi.acm.org/10.1145/276884.276917"
5710 @mastersthesis{b-dsutd-06
5712 , title = {{Dynamic Speed-Up Techniques for Dijkstra's Algorithm}}
5713 , pdf = "http://i11www.ira.uka.de/extra/publications/b-dsutd-06.pdf"
5720 , title = {{Evaluating local community methods in networks}}
5722 , note = {doi:10.1088/1742-5468/2008/05/P05001}
5724 , pdf = "http://www.iop.org/EJ/article/1742-5468/2008/05/P05001/jstat8_05_p05001.pdf"
5725 , url = "http://www.iop.org/EJ/abstract/1742-5468/2008/05/P05001/"
5731 , title = {{Empirical Analysis of k-Betweenness}}
5733 , note = {Studienarbeit Informatik}
5734 , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-blome-07.pdf"
5739 @InCollection{b-ebp-01
5741 , title = {{Energy-Based Placement}}
5742 , booktitle = {{Drawing Graphs: Methods and Models}}
5743 , isbn = "3-540-42062-2"
5745 , publisher = pub-springer
5746 , series = ser-springer_lncs
5747 , url = "http://www.springerlink.com/content/xkru1gvnyh5p/"
5752 @inproceedings{b-egb-87
5753 , author = BoppanaRB
5754 , title = {{Eigenvalues and Graph Bisection: an Average Case Analysis}}
5755 , booktitle = {{Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS'87)}}
5757 , pages = {280--285}
5762 , author = BollobasB
5763 , title = {{Extremal graph theory}}
5764 , publisher = pub-ap
5768 @InProceedings{b-eo-02
5770 , title = {{Eager $st$-Ordering}}
5771 , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}}
5772 , pages = {183--197}
5773 , pdf = "http://www.springerlink.com/content/excppeygfwjah2rt/fulltext.pdf"
5774 , publisher = pub-springer
5775 , series = ser-springer_lncs
5776 , url = "http://www.springerlink.com/content/excppeygfwjah2rt/"
5783 , title = {{A Faster Algorithm for Betweenness Centrality}}
5786 , pages = {163--177}
5791 @article{b-fawassci-72
5792 , author = BonacichP
5793 , title = {{Factoring and Weighting Approaches to Status Scores and Clique Identification}}
5795 , pages = {113--120}
5800 @inproceedings{b-fmissgg-99
5802 , title = {{Finding Maximum Independent Sets in Sparse and General Graphs}}
5803 , booktitle = {{Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)}}
5804 , pages = {856--857}
5805 , publisher = pub-siam
5811 , title = {{Graphs}}
5813 , publisher = pub-nh
5819 , title = {{Graphs and Hypergraphs}}
5820 , booktitle = {{Graphs and Hypergraphs}}
5821 , publisher = pub-nh
5826 , author = BeauchampM
5827 , title = {{An improved index of centrality}}
5828 , journal = "Behavioral Scie"
5829 , pages = {161--163}
5836 , title = {{IKT 2020. Forschung f{\"u}r Innovationen}}
5837 , institution = "Bundesministerium f{\"u}r Bildung und Forschung (BMBF)"
5838 , publisher = pub-dlgh
5843 , author = BehrendsE
5844 , title = {{Introduction to Markov Chains With Special Emphasis on Rapid Mixing}}
5845 , booktitle = {{Introduction to Markov Chains With Special Emphasis on Rapid Mixing}}
5847 , publisher = pub-fvs
5851 @mastersthesis{b-kk-03
5853 , title = {{{Kantenkreuzungen in Kreislayouts}}}
5854 , pdf = "http://www.ub.uni-konstanz.de/kops/volltexte/2003/1099/pdf/kreislayouts.pdf"
5855 , school = "Universit{\"a}t Konstanz"
5856 , url = "http://www.ub.uni-konstanz.de/kops/volltexte/2003/1099/"
5861 , author = BollobasB
5862 , title = {{Modern Graph Theory}}
5863 , publisher = pub-springer
5864 , series = ser-springer_gtm
5871 , title = {{A Mathematical Model for Group Structure}}
5880 , title = {{The minimum number of edges and vertices in a graph with edge connectivity $n$ and $m$ $n$-bonds}}
5881 , journal = j-bull-ams
5883 , pages = {700--704}
5888 @mastersthesis{b-mpq-12
5890 , title = {{Multimodal Profile Queries
\r
5893 , school = "Karlsruhe Institute of Technology"
5894 , type = {Bachelor Thesis}
5899 , author = BatageljV
5900 , title = {{Notes on Blockmodeling}}
5904 , pages = {143--155}
5911 , title = {{Next-Generation Route Planning: Multi-Modal, Real-Time, Personalized}}
5912 , note = {Talk given at ISMP}
5913 , url = "http://ismp2012.mathopt.org/show-abs?abs=200"
5917 @mastersthesis{b-opafa-11
5919 , title = {{On Preprocessing the Arc-Flags Algorithm}}
5920 , pdf = "http://i11www.ira.uka.de/extra/publications/b-opafa-11.pdf"
5921 , school = "Fakult{\"a}t f{\"u}r Informatik,
\r
5922 Karlsruher Institut f{\"u}r Technologie (KIT)"
5928 , title = {{On a Routing Problem}}
5935 @mastersthesis{b-ostd-00
5937 , title = {{3-Orientations and Schnyder 3-Tree-Decompositions}}
5938 , school = "FU Berlin"
5939 , url = "http://www.math.tu-berlin.de/~felsner/Diplomarbeiten/brehm.ps.gz"
5945 , title = {{On the Topology of the Genetic Fine Structure}}
5948 , pages = {1607--1620}
5953 @article{b-pacafom-87
5954 , author = BonacichP
5955 , title = {{Power and Centrality: A Family of Measures}}
5958 , pages = {1170--1182}
5965 , title = {{Positions in Networks}}
5972 @techreport{b-ppegi-79
5974 , title = {{Problems polynomially equivalent to graph isomorphism}}
5975 , institution = "University of Ljublana"
5976 , type = {Technical Report C}
5981 , author = BollobasB
5982 , title = {{Random Graphs}}
5983 , booktitle = {{Random Graphs}}
5984 , publisher = pub-cup
5990 , title = {{Recoverable Robust Shortest Path Problems}}
5991 , journal = j-networks
5994 , pages = {181--189}
5995 , pdf = "http://onlinelibrary.wiley.com/doi/10.1002/net.20487/pdf"
5996 , url = "http://dx.doi.org/10.1002/net.20487"
6001 @phdthesis{b-savsn-08
6003 , title = {{visone - Software for the Analysis and Visualization of Social Networks}}
6005 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/744891"
6007 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000010897"
6013 , title = {{Spatial Interaction and the Statistical Analysis of Lattice Systems (with Discussion)}}
6014 , journal = j-jrsssb
6015 , pages = {196--236}
6020 @mastersthesis{b-spqoa-11
6021 , author = BlaesiusT
6022 , title = {{Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems}}
6023 , institution = "Fakult{\"a}t f{\"u}r Informatik"
6025 , pdf = "http://i11www.ira.uka.de/extra/publications/b-spqoa-11.pdf"
6026 , school = "Karlsruher Institut f{\"u}r Technologie (KIT)"
6032 , title = {{Shortcut Removal on SHARC}}
6034 , note = {Student Research Project}
6041 , title = {{Social Semigroups}}
6042 , publisher = pub-gmup
6048 , title = {{Space/Time Trade-offs in Hash Coding with Allowable Errors}}
6049 , journal = j-comm-acm
6051 , pages = {422--426}
6057 , author = Bar-GeraH
6058 , title = {{Traffic assignment by paired alternative segments}}
6061 , pages = {1022--1046}
6066 @InProceedings{b-tesg-05
6067 , author = BollobasB
6068 , title = {{The Evolution of Sparse Graphs}}
6069 , booktitle = {{Cambridge Combinatorial Conference in honor of Paul Erdos}}
6071 , publisher = pub-ap
6076 @phdthesis{b-tespd-10
6078 , title = {{Theory and Engineering for Shortest Paths and Delay Management}}
6079 , institution = "KIT"
6081 , pdf = "http://i11www.ira.uka.de/extra/publications/b-tespd-10.pdf"
6082 , school = "Fakult{\"a}t f{\"u}r Informatik"
6083 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000021858"
6087 @InCollection{b-tesrr-09
6089 , title = {{The Exact Subgraph Recoverable Robust Shortest Path Problem}}
6090 , booktitle = {{Robust and Online Large-Scale Optimization}}
6091 , pages = {231--248}
6092 , publisher = pub-springer
6093 , series = ser-springer_lncs
6094 , url = "http://dx.doi.org/10.1007/978-3-642-05465-5_9"
6099 @article{b-tmnoeav-75
6101 , title = {{The minimum number of edges and vertices in a graph with edge connectivity $n$ and $m$ $n$-bonds}}
6102 , journal = j-networks
6103 , pages = {253--298}
6109 , author = BreigerRL
6110 , title = {{Toward an Operational Theory of Community Elite Structures}}
6117 @InProceedings{b-uoprs-11
6119 , title = {{Ultra-fast Optimal Pathfinding without Runtime Search}}
6120 , booktitle = {{Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE'11)}}
6121 , pages = {122--127}
6122 , publisher = pub-aaaip
6127 , author = BingmannT
6128 , title = {{Visualisierung sehr gro{\ss}er Graphen}}
6129 , note = {Student Research Project}
6136 , title = {{On Variants of Shortest-Path Betweenness Centrality and their Generic Computation}}
6139 , pages = {136--145}
6140 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/b-vspbc-08.pdf"
6141 , url = "http://dx.doi.org/10.1016/j.socnet.2007.11.001"
6146 @incollection{b-wh-89
6147 , author = BonacichP
6148 , editor = FreemanLC #and# WhiteDR #and# RomneyAK
6149 , title = {{What is a Homomorphism?}}
6150 , booktitle = {{Research Methods in Social Network Analysis}}
6152 , pages = {255--293}
6153 , publisher = pub-gmup
6158 , author = BarabasiAL #and# AlbertR
6159 , title = {{Emergence of scaling in random networks}}
6160 , journal = j-science
6161 , pages = {509--512}
6166 @InProceedings{bahm-srlg-07
6167 , author = BarbayJ #and# AleardiLC #and# HeM #and# MunroI
6168 , title = {{Succinct Representation of Labeled Graphs}}
6169 , booktitle = {{Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC'07)}}
6170 , pages = {316--328}
6171 , publisher = pub-springer
6172 , series = ser-springer_lncs
6177 @InProceedings{bb-crcl-04
6178 , author = BaurM #and# BrandesU
6179 , title = {{Crossing Reduction in Circular Layouts}}
6180 , booktitle = {{Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)}}
6181 , pages = {332--343}
6182 , pdf = "http://i11www.ira.uka.de/extra/publications/bb-crcl-04.pdf"
6183 , publisher = pub-springer
6184 , series = ser-springer_lncs
6188 @techreport{bb-crcl2-04
6189 , author = BaurM #and# BrandesU
6190 , title = {{Crossing Reduction in Circular Layouts}}
6191 , institution = iti_wagner
6192 , number = {2004-14}
6193 , pdf = "http://i11www.ira.uka.de/extra/publications/bb-crcl-04_TR.pdf"
6194 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000001244"
6198 @Article{bb-eglrn-04
6199 , author = BatageljV #and# BrandesU
6200 , title = {{Efficient Generation of Large Random Networks}}
6204 , url = "http://link.aps.org/abstract/PRE/v71/e036113"
6208 @InProceedings{bb-gdcr-02
6209 , author = BiedlT #and# BrandenburgFJ
6210 , title = {{Graph-Drawing Contest Report}}
6211 , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}}
6214 , pdf = "http://www.springerlink.com/content/ree6g32b3h02f693/fulltext.pdf"
6215 , publisher = pub-springer
6216 , series = ser-springer_lncs
6217 , url = "http://www.springerlink.com/content/ree6g32b3h02f693/"
6222 @InProceedings{bb-mclmm-08
6223 , author = BaurM #and# BrandesU
6224 , title = {{Multi-Circular Layout of Micro/Macro Graphs}}
6225 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
6227 , pages = {255--267}
6228 , pdf = "http://i11www.ira.uka.de/extra/publications/bb-mclmm-08.pdf"
6229 , publisher = pub-springer
6230 , series = ser-springer_lncs
6231 , url = "http://www.springerlink.com/content/073r9m742m175683/"
6236 @InCollection{bb-nc-05
6237 , author = BaurM #and# BenkertM
6238 , title = {{Network Comparison}}
6239 , booktitle = {{Network Analysis: Methodological Foundations}}
6241 , pages = {318--340}
6242 , pdf = "http://springerlink.metapress.com/content/nx8c7053gpu9pjcx/fulltext.pdf"
6243 , publisher = pub-springer
6244 , series = ser-springer_lncs
6245 , url = "http://springerlink.metapress.com/content/nx8c7053gpu9pjcx/"
6250 @InProceedings{bb-pgt-07
6251 , author = BiedlT #and# BrandenburgFJ
6252 , title = {{Partitions of Graphs into Trees}}
6253 , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}}
6255 , pages = {430--439}
6256 , publisher = pub-springer
6257 , series = ser-springer_lncs
6262 @article{bba-acrda-75
6263 , author = BreigerRL #and# BoormanSA #and# ArabieP
6264 , title = {{An Algorithm for Clustering Relational Data with Applications to Social Network Analysis and Comparison with Multidimensional Scaling}}
6266 , pages = {328--383}
6271 @InProceedings{bbbc-lco-10
6272 , author = BadentM #and# BaurM #and# BrandesU #and# CornelsenS
6273 , title = {{Leftist Canonical Ordering}}
6274 , booktitle = {{Proceedings of the 17th International Symposium on Graph Drawing (GD'09)}}
6275 , pages = {159--170}
6276 , publisher = pub-springer
6277 , series = ser-springer_lncs
6282 @InProceedings{bbbcgklw-vsvsn-02
6283 , author = BaurM #and# BenkertM #and# BrandesU #and# CornelsenS #and# GaertlerM #and# KoepfB #and# LernerJ #and# WagnerD
6284 , title = {{visone - Software for Visual Social Network Analysis}}
6285 , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}}
6287 , pages = {463--464}
6288 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bbbcgklw-vsvsn-01.ps.gz"
6289 , publisher = pub-springer
6290 , series = ser-springer_lncs
6291 , url = "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2265&spage=463"
6296 @inproceedings{bbbcr-ddnm-03
6297 , author = BergerN #and# BollobasB #and# BorgsC #and# ChayesJ #and# RiordanOM
6298 , title = {{Degree Distribution of the {FKP} Network Model}}
6299 , booktitle = {{Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'03)}}
6300 , pages = {725--738}
6301 , publisher = pub-springer
6302 , series = ser-springer_lncs
6306 @InProceedings{bbbnosw-dcbth-09
6307 , author = BuchinK #and# BuchinM #and# ByrkaJ #and# NollenburgM #and# OkamotoY #and# SilveiraRI #and# WolffA
6308 , title = {{Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability}}
6309 , booktitle = {{Proceedings of the 16th International Symposium on Graph Drawing (GD'08)}}
6310 , pages = {324--335}
6311 , pdf = "http://i11www.ira.uka.de/extra/publications/bbbnosw-dcbth-09.pdf"
6312 , publisher = pub-springer
6313 , series = ser-springer_lncs
6314 , url = "http://dx.doi.org/10.1007/978-3-642-00219-9_32"
6319 @Article{bbbnosw-dcbth-10
6320 , author = BuchinK #and# BuchinM #and# ByrkaJ #and# NollenburgM #and# OkamotoY #and# SilveiraRI #and# WolffA
6321 , title = {{Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability}}
6324 , pages = {309--332}
6325 , url = "http://dx.doi.org/10.1007/s00453-010-9456-3"
6330 @InProceedings{bbc-cc-02
6331 , author = BansalN #and# BlumA #and# ChawlaS
6332 , title = {{Correlation Clustering}}
6333 , booktitle = {{Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02)}}
6334 , pages = {238--247}
6335 , pdf = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1181947&isnumber=26517"
6336 , publisher = pub-ieeecs
6337 , url = "http://dx.doi.org/10.1109/SFCS.2002.1181947"
6342 , author = BansalN #and# BlumA #and# ChawlaS
6343 , title = {{Correlation Clustering}}
6344 , isbn = "0885-6125"
6349 , pdf = "http://www.springerlink.com/content/r101lm8201733662/fulltext.pdf"
6350 , url = "http://dx.doi.org/10.1023/B:MACH.0000033116.57574.95"
6356 , author = BadentM #and# BrandesU #and# CornelsenS
6357 , title = {{More Canonical Ordering}}
6366 @techreport{bbd-ogh-05
6367 , author = BarthD #and# BerthomeP #and# DialloM
6368 , title = {{On the analysis of Gomory-Hu cut-trees relationship}}
6369 , institution = "LIMOS"
6373 @InProceedings{bbddfgkppt-htcrp-07
6374 , author = BadentM #and# BinucciC #and# DiGiacomoE #and# DidimoW #and# FelsnerS #and# GiordanoF #and# KratochvilJ #and# PalladinoP #and# PatrignaniM #and# TrottaF
6375 , title = {{Homothetic Triangle Contact Representations of Planar Graphs}}
6376 , booktitle = {{Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG '07)}}
6377 , pages = {233--238}
6378 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bbddfgkppt-htcr-07.pdf"
6379 , publisher = pub-cu
6384 , author = BarthD #and# BerthomeP #and# DialloM #and# FerreiraA
6385 , title = {{Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations}}
6388 , pages = {195--205}
6393 @InProceedings{bbgw-dag-05
6394 , author = BaurM #and# BrandesU #and# GaertlerM #and# WagnerD
6395 , title = {{Drawing the {AS} Graph in 2.5 Dimensions}}
6396 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
6399 , pdf = "http://i11www.ira.uka.de/extra/publications/bbgw-dag-05.pdf"
6400 , publisher = pub-springer
6401 , series = ser-springer_lncs
6402 , url = "http://springerlink.metapress.com/link.asp?id=xfqay6gkcychr4hf"
6407 @techreport{bbgw-dagth-04
6408 , author = BaurM #and# BrandesU #and# GaertlerM #and# WagnerD
6409 , title = {{Drawing the AS Graph in Two and a Half Dimensions}}
6410 , institution = iti_wagner
6411 , number = {2004-12}
6412 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3037"
6413 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000001242"
6417 @InProceedings{bbhkmw-elcsp-08
6418 , author = BarrettC #and# BissetK #and# HolzerM #and# KonjevodG #and# MaratheMV #and# WagnerD
6419 , title = {{Engineering Label-Constrained Shortest-Path Algorithms}}
6420 , booktitle = {{Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08)}}
6423 , publisher = pub-springer
6424 , series = ser-springer_lncs
6429 @InCollection{bbhkmw-elcsp-09
6430 , author = BarrettC #and# BissetK #and# HolzerM #and# KonjevodG #and# MaratheMV #and# WagnerD
6431 , title = {{Engineering Label-Constrained Shortest-Path Algorithms}}
6432 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
6433 , pages = {309--319}
6434 , publisher = pub-ams
6435 , series = ser-dimacsb
6440 @InProceedings{bbjkm-ccspp-02
6441 , author = BarrettC #and# BissetK #and# JacobR #and# KonjevodG #and# MaratheMV
6442 , title = {{Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router}}
6443 , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}}
6444 , pages = {126--138}
6445 , pdf = "http://thrackle.eas.asu.edu/users/goran/papers/transims.pdf"
6446 , publisher = pub-springer
6447 , series = ser-springer_lncs
6452 @InProceedings{bbk-aeacg-04
6453 , author = BlandfordDK #and# BlellochGE #and# KashIA
6454 , title = {{An Experimental Analysis of a Compact Graph Representation}}
6455 , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}}
6457 , publisher = pub-siam
6461 @InProceedings{bbk-crsg-03
6462 , author = BlandfordDK #and# BlellochGE #and# KashIA
6463 , title = {{Compact Representation of Separable Graphs}}
6464 , booktitle = {{Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)}}
6465 , pages = {679--688}
6469 @InProceedings{bbk-eacee-08
6470 , author = BoeckerS #and# BriesemeisterS #and# KlauGW
6471 , title = {{Exact Algorithms for Cluster Editing: Evaluation and Experiments}}
6472 , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}}
6474 , pages = {289--302}
6475 , publisher = pub-springer
6476 , series = ser-springer_lncs
6477 , url = "http://www.springerlink.com/content/f832516v14428712/"
6483 , author = BaurM #and# BrandesU #and# LernerJ #and# WagnerD
6484 , title = {{Analysis and Visualization of Social Networks (Poster)}}
6485 , pdf = "http://i11www.ira.uka.de/extra/publications/poster-bblw-avsn-08.pdf"
6489 @InCollection{bblw-glavs-09
6490 , author = BaurM #and# BrandesU #and# LernerJ #and# WagnerD
6491 , title = {{Group-Level Analysis and Visualization of Social Networks}}
6492 , booktitle = {{Algorithmics of Large and Complex Networks}}
6493 , pages = {330--358}
6494 , pdf = "http://www.springerlink.com/index/f48n37273l5n18l0.pdf"
6495 , publisher = pub-springer
6496 , series = ser-springer_lncs
6502 , author = BielliM #and# BoulmakoulA #and# MouncifH
6503 , title = {{Object modeling and path computation for multimodal travel systems}}
6506 , pages = {1705--1730}
6511 @InProceedings{bbnnpr-uilps-13
6512 , author = BiedlT #and# BlaesiusT #and# NiedermannB #and# NollenburgM #and# PrutkinR #and# RutterI
6513 , title = {{Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings}}
6514 , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}}
6515 , note = {To appear.}
6516 , publisher = pub-springer
6517 , series = ser-springer_lncs
6521 @InProceedings{bbp-vieas-08
6522 , author = BoitmanisK #and# BrandesU #and# PichC
6523 , title = {{Visualizing Internet Evolution on the Autonomous Systems Level}}
6524 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
6526 , pages = {365--376}
6527 , publisher = pub-springer
6528 , series = ser-springer_lncs
6529 , url = "http://www.springerlink.com/content/j084776h63258307/"
6534 @incollection{bbpp-mcp-99
6535 , author = BomzeIM #and# BudinichM #and# PardalosPM #and# PelilloM
6536 , editor = DuDZ #and# PardalosPM
6537 , title = {{The Maximum Clique Problem}}
6538 , booktitle = {{Handbook of Combinatorial Optimization (Supplement Volume A)}}
6540 , publisher = pub-kapg
6545 @techreport{bbps-iscc-98
6546 , author = BaraldiA #and# BlondaP #and# ParmiggianiF #and# SatalinoG
6547 , title = {{Image Segmentation through Contextual Clustering}}
6548 , address = "Berkeley, CA"
6549 , institution = "ICSI: International Computer Science Institute"
6550 , number = {TR-98-009}
6551 , pdf = "ftp://ftp.icsi.berkeley.edu/pub/techreports/1998/tr-98-009.pdf"
6552 , url = "http://www.icsi.berkeley.edu/cgi-bin/pubs/publication.pl?ID=001130"
6556 @InProceedings{bbrw-ocpga-12
6557 , author = BauerR #and# BaumM #and# RutterI #and# WagnerD
6558 , title = {{On the Complexity of Partitioning Graphs for Arc-Flags}}
6559 , booktitle = {{Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12)}}
6561 , pdf = "http://i11www.ira.uka.de/extra/publications/bbrw-ocpga-12.pdf"
6562 , series = ser-oasioasi
6566 @Article{bbrw-ocpga-13
6567 , author = BauerR #and# BaumM #and# RutterI #and# WagnerD
6568 , title = {{On the Complexity of Partitioning Graphs for Arc-Flags}}
6571 , pages = {265--299}
6572 , url = "http://jgaa.info/getPaper?id=294"
6577 @Article{bbvc-acpba-2012
6578 , author = BrandtF #and# BauerR #and# VolkerM #and# CardeneoA
6579 , title = {{A Constraint Programming Based Approach to a Large-Scale Energy Management Problem}}
6582 , url = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s10951-012-0281-1"
6587 , author = BaurM #and# BrandesU #and# WagnerD
6588 , title = {{Attribute-Based Visualisation in visone (Poster Abstract)}}
6589 , pdf = "http://i11www.ira.uka.de/extra/publications/bbw-abvv-07.pdf"
6594 , author = BaurM #and# BrandesU #and# WagnerD
6595 , title = {{Attribute-Based Visualisation in visone (Poster)}}
6596 , pdf = "http://i11www.ira.uka.de/extra/publications/poster-bbw-abvv-07.pdf"
6600 @InCollection{bc-dch-01
6601 , author = BrockenauerR #and# CornelsenS
6602 , title = {{Drawing Clusters and Hierarchies}}
6603 , booktitle = {{Drawing Graphs: Methods and Models}}
6604 , isbn = "3-540-42062-2"
6605 , pages = {192--227}
6606 , pdf = "http://springerlink.metapress.com/content/hna86wa6ruahmxng/fulltext.pdf"
6607 , publisher = pub-springer
6608 , series = ser-springer_lncs
6609 , url = "http://springerlink.metapress.com/content/hna86wa6ruahmxng/"
6615 , author = BrandesU #and# CornelsenS
6616 , title = {{Visual Ranking of Link Structures}}
6619 , pages = {181--201}
6624 @Article{bc-vunea-03
6625 , author = BrandesU #and# CormanSR
6626 , title = {{Visual Unrolling of Network Evolution and the Analysis of Dynamic Discourse}}
6627 , journal = j-infovis
6633 @Article{bcddf-dmogs-08
6634 , author = BrueraF #and# CiceroneS #and# DangeloG #and# DiStefanoG #and# FrigioniD
6635 , title = {{Dynamic Multi-level Overlay Graphs for Shortest Paths}}
6639 , pages = {709--736}
6644 @InProceedings{bcdtt-hdspd-92
6645 , author = BertolazziP #and# CohenR #and# DiBattistaG #and# TamassiaR #and# TollisIG
6646 , title = {{How to draw a series-parallel digraph}}
6647 , booktitle = {{Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory (SWAT'92)}}
6648 , pages = {272--283}
6649 , publisher = pub-springer
6650 , series = ser-springer_lncs
6651 , url = "http://dx.doi.org/10.1007/3-540-55706-7_23"
6656 @InProceedings{bceghrv-frvlp-10
6657 , author = BastH2 #and# CarlssonE #and# EigenwilligA #and# GeisbergerR #and# HarrelsonC #and# RaychevV #and# VigerF
6658 , title = {{Fast Routing in Very Large Public Transportation Networks using Transfer Patterns}}
6659 , booktitle = {{Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10)}}
6660 , pages = {290--301}
6661 , publisher = pub-springer
6662 , series = ser-springer_lncs
6667 @InProceedings{bcf-p-09
6668 , author = BaumannH #and# CrescenziP #and# FraigniaudP
6669 , title = {{Parsimonious flooding in dynamic graphs}}
6670 , booktitle = {{Proceedings of the 28th ACM symposium on Principles of distributed computing}}
6671 , pages = {260--269}
6672 , publisher = pub-acm
6673 , url = "http://doi.acm.org/10.1145/1582716.1582757"
6677 @InProceedings{bcfhknrs-moblb-13
6678 , author = BekosM #and# CornelsenS #and# FinkM #and# HongS #and# KaufmannM #and# NollenburgM #and# RutterI #and# SymvonisA
6679 , title = {{Many-to-One Boundary Labeling with Backbones}}
6680 , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}}
6681 , note = {To appear.}
6682 , publisher = pub-springer
6683 , series = ser-springer_lncs
6687 @InProceedings{bcfms-cgsnq-08
6688 , author = BoseP #and# CarmiP #and# FarshiM #and# MaheshwariA #and# SmidM
6689 , title = {{Computing the Greedy Spanner in Near-Quadratic Time}}
6690 , booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08)}}
6691 , pages = {390--401}
6692 , publisher = pub-springer
6693 , series = ser-springer_lncs
6698 @Article{bcfw-hdmcp-04
6699 , author = BrandesU #and# CornelsenS #and# FiessC #and# WagnerD
6700 , title = {{How to Draw the Minimum Cuts of a Planar Graph}}
6702 , pages = {117--133}
6707 @InProceedings{bcgkmnw-pped-12
6708 , author = BruckdorferT #and# CornelsenS #and# GutwengerC #and# KaufmannM #and# MontecchianiF #and# NollenburgM #and# WolffA
6709 , title = {{Progress on Partial Edge Drawings}}
6710 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
6711 , note = {Full version available at \url{http://arxiv.org/abs/2109.0830}.}
6713 , pdf = "http://i11www.ira.uka.de/extra/publications/bcgkmnw-pped-12.pdf"
6714 , publisher = pub-springer
6715 , series = ser-springer_lncs
6716 , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_7"
6721 @InProceedings{bckkw-psuth-10
6722 , author = BauerR #and# ColumbusT #and# KatzB #and# KrugM #and# WagnerD
6723 , title = {{Preprocessing Speed-Up Techniques is Hard}}
6724 , booktitle = {{Proceedings of the 7th Conference on Algorithms and Complexity (CIAC'10)}}
6725 , pages = {359--370}
6726 , publisher = pub-springer
6727 , series = ser-springer_lncs
6732 @techreport{bckkw-psuth-10-tr
6733 , author = BauerR #and# ColumbusT #and# KatzB #and# KrugM #and# WagnerD
6734 , title = {{Preprocessing Speed-Up Techniques is Hard}}
6735 , institution = "ITI Wagner, Faculty of Informatics, Karlsruhe Institute of Technology"
6736 , number = {2010-04}
6737 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000016080"
6741 @InProceedings{bcrw-sssch-13
6742 , author = BauerR #and# ColumbusT #and# RutterI #and# WagnerD
6743 , title = {{Search-Space Size in Contraction Hierarchies}}
6744 , booktitle = {{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)}}
6746 , publisher = pub-springer
6747 , series = ser-springer_lncs
6752 @Article{bcsv-ucasf-04
6753 , author = BoldiP #and# CodenottiB #and# SantiniM #and# VignaS
6754 , title = {{UbiCrawler: A Scalable Fully Distributed Web Crawler}}
6757 , pages = {711--726}
6758 , pdf = "http://vigna.dsi.unimi.it/ftp/papers/UbiCrawler.pdf"
6763 @InCollection{bcsz-e-05
6764 , author = BermanP #and# CalinescuG #and# ShahC #and# ZelikovskyA
6765 , title = {{Efficient energy management in sensor networks}}
6766 , booktitle = {{Ad Hoc and Sensor Networks}}
6768 , publisher = pub-nsp
6774 @InProceedings{bcsz-p-04
6775 , author = BermanP #and# CalinescuG #and# ShahC #and# ZelikovskyA
6776 , title = {{Power efficient monitoring management in sensor networks}}
6777 , booktitle = {{Proceedings of the Wireless Communications and Networking Conference 2004}}
6779 , pages = {2329--2334}
6780 , publisher = pub-ieeecs
6785 @InProceedings{bcw-cfcra-04
6786 , author = BrandesU #and# CornelsenS #and# WagnerD
6787 , title = {{Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles}}
6788 , booktitle = {{Proceedings of the 11th International Symposium on Graph Drawing (GD'03)}}
6790 , pages = {357--368}
6791 , publisher = pub-springer
6792 , series = ser-springer_lncs
6797 @Article{bcw-cfcra-05
6798 , author = BrandesU #and# CornelsenS #and# WagnerD
6799 , title = {{Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles}}
6803 , pdf = "http://www.cs.brown.edu/publications/jgaa/accepted/2005/BrandesCornelsenWagner2005.9.1.pdf"
6808 @InProceedings{bcw-hdmcp-01
6809 , author = BrandesU #and# CornelsenS #and# WagnerD
6810 , title = {{How to Draw the Minimum Cuts of a Planar Graph}}
6811 , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}}
6813 , pages = {103--114}
6814 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bcw-hdmcp-01.ps.gz"
6815 , publisher = pub-springer
6816 , series = ser-springer_lncs
6817 , url = "http://www.springerlink.com/content/bx98c234v16601ca/"
6823 , author = BabaiL #and# DuffusD
6824 , title = {{Dimension and Automorphism Groups of Lattices}}
6826 , pages = {279--289}
6831 @InProceedings{bd-ldvcg-07
6832 , author = BalzerM #and# DeussenO
6833 , title = {{Level-of-Detail Visualization of Clustered Graph Layouts}}
6834 , booktitle = {{Asia-Pacific Symposium on Visualisation 2007 (APVIS'07)}}
6838 @InProceedings{bd-oudtt-91
6839 , author = BertolazziP #and# DiBattistaG
6840 , title = {{On Upward Drawing Testing of Triconnected Digraphs (extended abstract)}}
6841 , booktitle = {{Proceedings of the 7th Annual ACM Symposium on Computational Geometry}}
6842 , pages = {272--280}
6843 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=109679&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36841009&CFTOKEN=98"
6844 , publisher = pub-acm
6845 , url = "http://doi.acm.org/10.1145/109648.109679"
6849 @InProceedings{bd-sharc-08
6850 , author = BauerR #and# DellingD
6851 , title = {{SHARC: Fast and Robust Unidirectional Routing}}
6852 , booktitle = {{Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08)}}
6855 , pdf = "http://i11www.ira.uka.de/extra/publications/bd-sharc-08.pdf"
6856 , publisher = pub-siam
6860 @Article{bd-sharc-09
6861 , author = BauerR #and# DellingD
6862 , title = {{SHARC: Fast and Robust Unidirectional Routing}}
6863 , journal = j-acm-ea
6865 , note = {Special Section on Selected Papers from ALENEX 2008.}
6868 , pdf = "http://i11www.ira.uka.de/extra/publications/bd-sharc-09.pdf"
6869 , url = "http://doi.acm.org/10.1145/1498698.1537599"
6874 @InProceedings{bdd-afdg-09
6875 , author = BerretiniE #and# DangeloG #and# DellingD
6876 , title = {{Arc-Flags in Dynamic Graphs}}
6877 , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}}
6878 , pdf = "http://i11www.ira.uka.de/extra/publications/bdd-afdg-09.pdf"
6879 , series = ser-oasioasi
6883 @article{bddhkkmnrw-pavcg-82
6884 , author = BeckerM #and# DegenhardtW #and# DoenhardtJ #and# HertelS #and# KaninkeG #and# KeberW #and# MehlhornK #and# NaeherS #and# RohnertH #and# WinterT
6885 , title = {{A Probabilistic Algorithm for Vertex Connectivity of Graphs}}
6889 , pages = {135--136}
6894 @techreport{bddsw-tspca-10
6895 , author = BauerR #and# DangeloG #and# DellingD #and# SchummA #and# WagnerD
6896 , title = {{The Shortcut Problem -- Complexity and Algorithms
\r
6898 , institution = iti_wagner
6899 , number = {2010-17}
6900 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000019794"
6904 @Article{bddsw-tspca-12
6905 , author = BauerR #and# DangeloG #and# DellingD #and# SchummA #and# WagnerD
6906 , title = {{The Shortcut Problem -- Complexity and Algorithms}}
6909 , pages = {447--481}
6910 , url = "http://jgaa.info/16/270.html"
6915 @techreport{bddw-tcsp-07
6916 , author = BauerR #and# DangeloG #and# DellingD #and# WagnerD
6917 , title = {{The Complexity of the Shortcut Problem}}
6918 , institution = "Arrival Technical Report"
6920 , pdf = "http://arrival.cti.gr/uploads/Documents.0117/ARRIVAL-TR-0117.pdf"
6924 @InProceedings{bddw-tspca-09
6925 , author = BauerR #and# DangeloG #and# DellingD #and# WagnerD
6926 , title = {{The Shortcut Problem -- Complexity and Approximation}}
6927 , booktitle = {{Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09)}}
6929 , pages = {105--116}
6930 , pdf = "http://i11www.ira.uka.de/extra/publications/bddw-tspca-09.pdf"
6931 , publisher = pub-springer
6932 , series = ser-springer_lncs
6937 @InProceedings{bdf-gtgpm-03
6938 , author = BerthomeP #and# DialloM #and# FerreiraA
6939 , title = {{Graph-Theoretic
\r
6940 Generalized Parametric Multi-terminal Flows
\r
6942 , booktitle = {{Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)}}
6944 , publisher = pub-springer
6945 , series = ser-springer_lncs
6950 @misc{bdgghnw-mmh-06
6951 , author = BrandesU #and# DellingD #and# GaertlerM #and# GoerkeR #and# HoeferM #and# NikoloskiZ #and# WagnerD
6952 , title = {{Maximizing Modularity is Hard}}
6953 , note = {arXiv physics/0608255}
6954 , pdf = "http://arxiv.org/pdf/physics/0608255"
6955 , url = "http://arxiv.org/abs/physics/0608255"
6959 @Article{bdgghnw-omc-08
6960 , author = BrandesU #and# DellingD #and# GaertlerM #and# GoerkeR #and# HoeferM #and# NikoloskiZ #and# WagnerD
6961 , title = {{On Modularity Clustering}}
6965 , pages = {172--188}
6966 , url = "http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190689"
6971 @techreport{bdgghnw-omnpcb-06
6972 , author = BrandesU #and# DellingD #and# GaertlerM #and# GoerkeR #and# HoeferM #and# NikoloskiZ #and# WagnerD
6973 , title = {{On Modularity - NP-Completeness and Beyond}}
6974 , institution = iti_wagner
6975 , number = {2006-19}
6976 , pdf = "http://i11www.ira.uka.de/extra/publications/bdgghnw-omnpcb-06.pdf"
6977 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005777"
6981 @InProceedings{bdgm-atdmc-09
6982 , author = BergerA #and# DellingD #and# GebhardtA #and# MuellerHannemannM
6983 , title = {{Accelerating Time-Dependent Multi-Criteria Timetable Information is Harder Than Expected}}
6984 , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}}
6985 , pdf = "http://i11www.ira.uka.de/extra/publications/bdgm-atdmc-09.pdf"
6986 , series = ser-oasioasi
6990 @InProceedings{bdgrw-cgl-12
6991 , author = BetzG #and# DollC #and# GemsaA #and# RutterI #and# WagnerD
6992 , title = {{Column-based Graph Layouts}}
6993 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
6994 , note = {to appear}
6995 , publisher = pub-springer
6996 , series = ser-springer_lncs
7001 @InProceedings{bdgs-argrn-11
7002 , author = BaderR #and# DeesJ #and# GeisbergerR #and# SandersP
7003 , title = {{Alternative Route Graphs in Road Networks}}
7004 , booktitle = {{Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS'11)}}
7006 , publisher = pub-springer
7007 , series = ser-springer_lncs
7012 @techreport{bdgw-sesr-09TR
7013 , author = BrunelE #and# DellingD #and# GemsaA #and# WagnerD
7014 , title = {{Space-Efficient SHARC-Routing}}
7015 , institution = iti_wagner
7017 , pdf = "http://i11www.ira.uka.de/extra/publications/bdgw-sesr-09TR.pdf"
7021 @InProceedings{bdgw-sesr-10
7022 , author = BrunelE #and# DellingD #and# GemsaA #and# WagnerD
7023 , title = {{Space-Efficient SHARC-Routing}}
7024 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
7027 , pdf = "http://i11www.ira.uka.de/extra/publications/bdgw-sesr-10.pdf"
7028 , publisher = pub-springer
7029 , series = ser-springer_lncs
7034 @InProceedings{bdhggnw-fgcmm-07
7035 , author = BrandesU #and# DellingD #and# HoeferM #and# GaertlerM #and# GoerkeR #and# NikoloskiZ #and# WagnerD
7036 , title = {{On Finding Graph Clusterings with Maximum Modularity}}
7037 , booktitle = {{Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG'07)}}
7039 , pages = {121--132}
7040 , pdf = "http://www.springerlink.com/content/w7p1057m25757210/fulltext.pdf"
7041 , publisher = pub-springer
7042 , series = ser-springer_lncs
7043 , url = "http://dx.doi.org/10.1007/978-3-540-74839-7_12"
7048 @InProceedings{bdl-dcgcp-07
7049 , author = BadentM #and# DiGiacomoE #and# LiottaG
7050 , title = {{Drawing Colored Graphs on Colored Points}}
7051 , booktitle = {{Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS'07)}}
7052 , pages = {102--113}
7053 , pdf = "http://www.springerlink.com/index/y541221735258m35.pdf"
7054 , publisher = pub-springer
7055 , series = ser-springer_lncs
7059 @Article{bdlm-udtd-94
7060 , author = BertolazziP #and# DiBattistaG #and# LiottaG #and# ManninoC
7061 , title = {{Upward Drawings of Triconnected Digraphs}}
7065 , pages = {476--497}
7066 , pdf = "http://www.springerlink.com/content/qq1024262v624086/fulltext.pdf"
7067 , url = "http://www.springerlink.com/content/QQ1024262V624086/"
7072 @techreport{bdpw-eorev-13
7073 , author = BaumM #and# DibbeltJ #and# PajorT #and# WagnerD
7074 , title = {{Energy-Optimal Routes for Electric Vehicles}}
7075 , institution = "Faculty of Informatics, Karlsruhe Institute of Technology"
7076 , number = {2013-06}
7077 , pdf = "http://i11www.ira.uka.de/extra/publications/bdpw-eorev-13.pdf"
7078 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000035824"
7082 @article{bds-vumpa-04
7083 , author = BrandesU #and# DwyerT #and# SchreiberF
7084 , title = {{Visual Understanding of Metabolic Pathways Across Organisms Using Layout in Two and a Half Dimensions}}
7085 , journal = j-ibioinfo
7090 @InProceedings{bdsssw-chgds-08
7091 , author = BauerR #and# DellingD #and# SandersP #and# SchieferdeckerD #and# SchultesD #and# WagnerD
7092 , title = {{Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm}}
7093 , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}}
7095 , pages = {303--318}
7096 , pdf = "http://i11www.ira.uka.de/extra/publications/bdsssw-chgds-08.pdf"
7097 , publisher = pub-springer
7098 , series = ser-springer_lncs
7103 @Article{bdsssw-chgds-10
7104 , author = BauerR #and# DellingD #and# SandersP #and# SchieferdeckerD #and# SchultesD #and# WagnerD
7105 , title = {{Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm}}
7106 , journal = j-acm-ea
7108 , note = {Special Section devoted to WEA'08.}
7111 , pdf = "http://i11www.ira.uka.de/extra/publications/bdsssw-chgds-10.pdf"
7116 @InProceedings{bdsv-tdch-09
7117 , author = BatzV #and# DellingD #and# SandersP #and# VetterC
7118 , title = {{Time-Dependent Contraction Hierarchies}}
7119 , booktitle = {{Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09)}}
7122 , pdf = "http://i11www.ira.uka.de/extra/publications/bdsv-tdch-09.pdf"
7123 , publisher = pub-siam
7127 @InProceedings{bdw-dobbd-11
7128 , author = BudiuM #and# DellingD #and# WerneckR
7129 , title = {{DryadOpt: Branch-and-Bound on Distributed Data-Parallel Execution Engines}}
7130 , booktitle = {{25th International Parallel and Distributed Processing Symposium (IPDPS'11)}}
7131 , pages = {1278--1289}
7132 , publisher = pub-ics
7136 @InProceedings{bdw-essut-07
7137 , author = BauerR #and# DellingD #and# WagnerD
7138 , title = {{Experimental Study on Speed-Up Techniques for Timetable Information Systems}}
7139 , booktitle = {{Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)}}
7140 , pages = {209--225}
7141 , pdf = "http://i11www.ira.uka.de/extra/publications/bdw-essut-07.pdf"
7142 , series = ser-oasioasi
7143 , url = "http://drops.dagstuhl.de/opus/volltexte/2007/1169/"
7147 @Article{bdw-essut-11
7148 , author = BauerR #and# DellingD #and# WagnerD
7149 , title = {{Experimental Study on Speed-Up Techniques for Timetable Information Systems}}
7150 , journal = j-networks
7154 , pdf = "http://i11www.ira.uka.de/extra/publications/bdw-essut-11.pdf"
7159 @techreport{bdw-isst-08
7160 , author = BauerR #and# DellingD #and# WagnerD
7161 , title = {{Impact of Shortcuts on Speedup Techniques}}
7162 , institution = iti_wagner
7163 , number = {2008-10}
7164 , pdf = "http://i11www.ira.uka.de/extra/publications/bdw-isst-08.pdf"
7168 @techreport{bdw-spiem-07
7169 , author = BauerR #and# DellingD #and# WagnerD
7170 , title = {{Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems}}
7171 , institution = iti_wagner
7172 , number = {2007-14}
7173 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3112"
7174 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000006961"
7178 @article{be-careasc-89
7179 , author = BorgattiSP #and# EverettMG
7180 , title = {{The Class of All Regular Equivalences: Algebraic Structure and Computation}}
7188 @InCollection{be-f-05
7189 , author = BrandesU #and# ErlebachT
7190 , title = {{Fundamentals}}
7191 , booktitle = {{Network Analysis: Methodological Foundations}}
7194 , publisher = pub-springer
7195 , series = ser-springer_lncs
7196 , url = "http://springerlink.metapress.com/content/nv20c2jfpf28/"
7201 @unpublished{be-gpc-04
7202 , author = BorgattiSP #and# EverettMG
7203 , title = {{A Graph-Theoretic Perspective on Centrality}}
7204 , note = {Unpublished manuscript}
7209 , author = BorgattiSP #and# EverettMG
7210 , title = {{Models of core/periphery structures}}
7213 , pages = {375--395}
7219 , editor = BrandesU #and# ErlebachT
7220 , title = {{Network Analysis: Methodological Foundations}}
7221 , booktitle = {{Network Analysis: Methodological Foundations}}
7223 , publisher = pub-springer
7224 , series = ser-springer_lncs
7225 , url = "http://springerlink.metapress.com/content/nv20c2jfpf28/"
7231 , author = BreigerRL #and# EnnisJG
7232 , title = {{Personae and Social Roles: {The} Network Structure of Personality Types in Small Groups}}
7234 , pages = {262--270}
7239 @article{be-rrrirre-99
7240 , author = BoydJP #and# EverettMG
7241 , title = {{Relations, Residuals, Regular Interiors, and Relative Regular Equivalence}}
7245 , pages = {147--165}
7250 @article{be-tacre-93
7251 , author = BorgattiSP #and# EverettMG
7252 , title = {{Two Algorithms for Computing Regular Equivalence}}
7255 , pages = {361--376}
7260 @Article{beehhmr-ndv-06
7261 , author = BeerliovaZ #and# EberhardF #and# ErlebachT #and# HallA #and# HoffmannM #and# MihalakM #and# RamLS
7262 , title = {{Network Discovery and Verification}}
7266 , pages = {2168--2181}
7267 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4016133"
7273 , author = BorgattiSP #and# EverettMG #and# FreemanLC
7274 , title = {{Users Guide of {UCINET} 5 for Windows
\r
7276 , url = "http://www.analytictech.com/ucinet/Ucinet_Guide.doc"
7280 @InProceedings{behhm-gmlpr-01
7281 , author = BrandesU #and# EiglspergerM #and# HermanI #and# HimsoltM #and# MarshallMS
7282 , title = {{{GraphML} Progress Report: Structural Layer Proposal}}
7283 , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}}
7285 , publisher = pub-springer
7286 , series = ser-springer_lncs
7291 @InProceedings{bekw-sdogd-03
7292 , author = BrandesU #and# EiglspergerM #and# KaufmannM #and# WagnerD
7293 , title = {{Sketch-Driven Orthogonal Graph Drawing}}
7294 , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}}
7297 , publisher = pub-springer
7298 , series = ser-springer_lncs
7303 @InProceedings{belns-apst-11
7304 , author = BuchinK #and# EppsteinD #and# LofflerM #and# NollenburgM #and# SilveiraRI
7305 , title = {{Adjacency-Preserving Spatial Treemaps}}
7306 , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}}
7308 , note = {Full version available at \url{http://arxiv.org/abs/1105.0398}.}
7309 , pages = {159--170}
7310 , pdf = "http://i11www.ira.uka.de/extra/publications/belns-apst-11.pdf"
7311 , publisher = pub-springer
7312 , series = ser-springer_lncs
7313 , url = "http://dx.doi.og/10.1007/978-3-642-22300-6 14"
7318 @article{bempt-sbbwg-04
7319 , author = BezrukovS #and# ElsaesserR #and# MonienB #and# PreisR #and# TillichJP
7320 , title = {{New Spectral Lower Bounds on the Bisection Width of Graphs}}
7322 , pages = {155--174}
7327 @article{bes-lsslsocs-90
7328 , author = BorgattiSP #and# EverettMG #and# ShireyPR
7329 , title = {{{LS} sets, lambda sets and other cohesive subsets}}
7332 , pages = {337--357}
7338 , author = DiBattistaG #and# EadesP #and# TamassiaR #and# TollisIG
7339 , title = {{Graph Drawing - Algorithms for the Visualization of Graphs}}
7340 , booktitle = {{Graph Drawing - Algorithms for the Visualization of Graphs}}
7342 , publisher = pub-ph
7346 @inproceedings{bf-cmbcf-05
7347 , author = BrandesU #and# FleischerD
7348 , title = {{Centrality Measures Based on Current Flow}}
7349 , booktitle = {{Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS'05)}}
7350 , publisher = pub-springer
7351 , series = ser-springer_lncs
7356 @inproceedings{bf-crd-00
7357 , author = BatageljV #and# FerligojA
7358 , editor = GaulW #and# OpitzO #and# SchaderM
7359 , title = {{Clustering Relational Data}}
7360 , booktitle = {{Data Analysis}}
7362 , publisher = pub-springer
7366 @techreport{bf-crhgi-06
7367 , author = BachmaierC #and# ForsterM
7368 , title = {{Crossing Reduction for Hierarchical Graphs with Intra-Level Edges}}
7369 , institution = "University of Passau"
7370 , number = {MIP-0608}
7371 , pdf = "http://www.infosun.fim.uni-passau.de/~chris/down/MIP-0608.pdf"
7376 , author = BowenR #and# FiskS
7377 , title = {{Generation of triangulations of the sphere}}
7379 , pages = {250--252}
7384 @article{bf-lsnto-77
7385 , author = BoorstynRR #and# FrankH
7386 , title = {{Large Scale Network Topological Optimization}}
7394 , author = FortunatoS #and# BarthelemyM
7395 , title = {{Resolution limit in community detection}}
7399 , pdf = "http://www.pnas.org/content/104/1/36.full.pdf"
7400 , url = "http://www.pnas.org/content/104/1/36.full.pdf"
7406 , author = BatageljV #and# FerligojA #and# DoreianP
7407 , title = {{Generalized Blockmodeling}}
7409 , pages = {501--506}
7410 , url = "http://vlado.fmf.uni-lj.si/pub/networks/doc/ModelInf.ps"
7416 , editor = BrualdiRA #and# FriedlandS #and# KleeV
7417 , title = {{Combinatorial and Graph-Theoretical Problems in Linear Algebra}}
7418 , booktitle = {{Combinatorial and Graph-Theoretical Problems in Linear Algebra}}
7419 , publisher = pub-springer
7423 @InProceedings{bfm-cdcpg-05
7424 , author = BonichonN #and# FelsnerS #and# MosbahM
7425 , title = {{Convex Drawings of $3$-Connected Plane Graphs}}
7426 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
7429 , publisher = pub-springer
7430 , series = ser-springer_lncs
7435 @Article{bfm-cdcpg-07
7436 , author = BonichonN #and# FelsnerS #and# MosbahM
7437 , title = {{Convex Drawings of 3-Connected Plane Graphs}}
7439 , pages = {399--420}
7444 @InProceedings{bfm-trans-06
7445 , author = BastH #and# FunkeS #and# MatijevicD
7446 , title = {{TRANSIT - Ultrafast Shortest-Path Queries with Linear-Time Preprocessing}}
7447 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}}
7452 @InCollection{bfm-uspqt-09
7453 , author = BastH #and# FunkeS #and# MatijevicD
7454 , title = {{Ultrafast Shortest-Path Queries via Transit Nodes}}
7455 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
7456 , pages = {175--192}
7457 , publisher = pub-ams
7458 , series = ser-dimacsb
7463 @InProceedings{bfmmuy-pads-81
7464 , author = BeeriC #and# FaginR #and# MaierD #and# MendelzonAO #and# UllmanJD #and# YannakakisM
7465 , title = {{Properties of Acyclic Database Schemes}}
7466 , booktitle = {{Proceedings of the 13th Annual {ACM} Symposium on the Theory of Computing (STOC'81)}}
7467 , pages = {355--362}
7468 , publisher = pub-acm
7472 @Article{bfms-eprn-09
7473 , author = BeierR #and# FunkeS #and# MatijevicD #and# SandersP
7474 , title = {{Energy-efficient Paths in Radio Networks}}
7479 @InProceedings{bfmss-itcsp-07
7480 , author = BastH #and# FunkeS #and# MatijevicD #and# SandersP #and# SchultesD
7481 , title = {{In Transit to Constant Shortest-Path Queries in Road Networks}}
7482 , booktitle = {{Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)}}
7484 , publisher = pub-siam
7488 @Article{bfmy-odads-83
7489 , author = BeeriC #and# FaginR #and# MaierD #and# YannakakisM
7490 , title = {{On the Desirability of Acyclic Database Schemes}}
7494 , pages = {479--513}
7499 @Article{bfp-dslas-07
7500 , author = BrandesU #and# FleischerD #and# PuppeT
7501 , title = {{Dynamic Spectral Layout with an Application to Small Worlds}}
7504 , pages = {325--343}
7505 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bfp-dslas-07.pdf"
7510 @Article{bfpp-ricpf-07
7511 , author = BohmC #and# FaloutsosC #and# PanJ #and# PlantC
7512 , title = {{RIC: Parameter-Free Noise-Robust Clustering}}
7513 , journal = j-acmtkdd
7516 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1297334&type=pdf&coll=portal&dl=ACM&CFID=49478026&CFTOKEN=97"
7517 , 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"
7522 @Article{bfss-frrnt-07
7523 , author = BastH #and# FunkeS #and# SandersP #and# SchultesD
7524 , title = {{Fast Routing in Road Networks with Transit Nodes}}
7525 , journal = j-science
7532 @InCollection{bfw-sn-13
7533 , author = BrandesU #and# FreemanLC #and# WagnerD
7534 , title = {{Social Networks}}
7535 , booktitle = {{Handbook of Graph Drawing and Visualization }}
7536 , note = {to appear}
7537 , publisher = pub-crcp
7541 @incollection{bg-aaspi-94
7542 , author = BrinkRvd #and# GillesRP
7543 , title = {{An axiomatic social power index for hierarchically structured populations of economic agents}}
7544 , booktitle = {{Imperfections and Behaviour in Economic Organizations}}
7545 , pages = {279--318}
7546 , publisher = pub-kapg
7550 @Article{bg-aoscf-95
7551 , author = BronnimannH #and# GoodrichMT
7552 , title = {{Almost Optimal Set Covers in Finite VC-Dimension}}
7555 , pages = {463--479}
7561 , author = BrinkRvd #and# GillesRP
7562 , title = {{Measuring domination in directed networks}}
7566 , pages = {141--157}
7571 @InProceedings{bg-ostcc-69
7572 , author = BarnetteDW #and# GruenbaumB
7573 , title = {{On Steinitz's Theorem Concerning Convex 3-Polytopes and on Some Properties of Planar Graphs}}
7574 , booktitle = {{The Many Facets of Graph Theory}}
7576 , publisher = pub-springer
7577 , series = ser-springer_lnm
7583 , author = BauerM #and# GolinelliO
7584 , title = {{Random incidence matrices: moments of the spectral density}}
7586 , note = {arXiv cond-mat/0007127}
7587 , pages = {301--307}
7588 , url = "http://www-spht.cea.fr/articles_k2/t00/088/publi.ps.gz"
7593 @Article{bg-vrptw1-05
7594 , author = BraeysyO #and# GendreauM
7595 , title = {{Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms}}
7599 , pages = {104--118}
7604 @Article{bg-vrptw2-05
7605 , author = BraeysyO #and# GendreauM
7606 , title = {{Vehicle Routing Problem with Time Windows, Part II: Metaheuristics}}
7610 , pages = {119--139}
7616 , author = BaurM #and# GaertlerM #and# GoerkeR
7617 , title = {{Analyzing the Career of Actors - How to Become Famous Fast}}
7618 , note = {Graph Drawing Contest at GD'05, Honorable Mention}
7619 , pdf = "http://i11www.ira.uka.de/extra/publications/genreSubmission.pdf"
7620 , url = "http://i11www.iti.uni-karlsruhe.de/~rgoerke/gd/genreflyer_full.jar"
7624 @Article{bggkw-acgpa-08
7625 , author = BaurM #and# GaertlerM #and# GoerkeR #and# KrugM #and# WagnerD
7626 , title = {{Augmenting $k$-Core Generation with Preferential Attachment}}
7630 , pages = {277--294}
7631 , pdf = "http://i11www.ira.uka.de/extra/publications/bggkw-acgpa-08.pdf"
7632 , url = "http://aimsciences.org/journals/pdfs.jsp?paperID=3279&mode=full"
7637 @InProceedings{bggkw-ggpcs-07
7638 , author = BaurM #and# GaertlerM #and# GoerkeR #and# KrugM #and# WagnerD
7639 , title = {{Generating Graphs with Predefined k-Core Structure}}
7640 , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'07)}}
7642 , pdf = "http://i11www.ira.uka.de/extra/publications/bggkw-ggpcs-07.pdf"
7646 @InProceedings{bggn-ahlo-13
7647 , author = BabenkoM #and# GoldbergAV #and# GuptaA #and# NagarajanV
7648 , title = {{Algorithms for Hub Label Optimization}}
7649 , booktitle = {{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)}}
7650 , note = {to appear}
7651 , pdf = "http://research.microsoft.com/pubs/192125/ICALP-BGGN-proc.pdf"
7652 , publisher = pub-springer
7653 , series = ser-springer_lncs
7658 @InCollection{bgh-aitub-11
7659 , author = BonichonN #and# GavoilleC #and# HanusseN
7660 , title = {{An Information-Theoretic Upper Bound on Planar Graphs UsingWell-Orderly Maps}}
7661 , booktitle = {{Towards an Information Theory of Complex Networks: Statistical Methods and Applications}}
7663 , publisher = {Birkh{"a}user Verlag}
7668 , author = BodirskyM #and# GroeplC #and# KangM
7669 , title = {{Generating labeled planar graphs uniformly at random}}
7672 , pages = {377--386}
7677 @Article{bgkmp-hagsr-06
7678 , author = BermondJC #and# GaltierJ #and# KlasingR #and# MoralesN #and# PerennesS
7679 , title = {{Hardness and Approximation of Gathering in Static Radio Networks}}
7682 , pages = {165--183}
7687 @techreport{bgkrw-ggg-11-tr
7688 , author = BrunelE #and# GemsaA #and# KrugM #and# RutterI #and# WagnerD
7689 , title = {{Generalizing Geometric Graphs}}
7690 , institution = kit_wagner
7691 , number = {2011-27}
7692 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024246 "
7696 @InProceedings{bgkrw-ggg-12
7697 , author = BrunelE #and# GemsaA #and# KrugM #and# RutterI #and# WagnerD
7698 , title = {{Generalizing Geometric Graphs}}
7699 , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}}
7700 , pages = {179--190}
7701 , publisher = pub-springer
7702 , series = ser-springer_lncs
7703 , url = "http://www.springerlink.com/content/p1t8356v54735312/"
7708 , author = BlondelV #and# GuillaumeJ #and# LambiotteR #and# LefebvreE
7709 , title = {{Fast unfolding of communities in large networks}}
7712 , pdf = "http://www.iop.org/EJ/article/1742-5468/2008/10/P10008/jstat8_10_p10008.pdf"
7713 , url = "http://dx.doi.org/10.1088/1742-5468/2008/10/P10008"
7719 , author = BlondelV #and# GuillaumeJ #and# LambiotteR #and# LefebvreE
7720 , title = {{Finding Communities in Large Networks}}
7721 , note = {\url{http://findcommunities.googlepages.com/}}
7722 , url = "http://findcommunities.googlepages.com/"
7726 @unpublished{bgll-fuch-08
7727 , author = BlondelV #and# GuillaumeJ #and# LambiotteR #and# LefebvreE
7728 , title = {{Fast unfolding of community hierarchies in large networks}}
7730 , note = {ARXIV: 2008arXiv0803.0476B}
7731 , pdf = "http://arxiv.org/pdf/0803.0476"
7732 , url = "http://arxiv.org/abs/0803.0476"
7736 @techreport{bgls-ctrd-10
7737 , author = BatzV #and# GeisbergerR #and# LuxenD #and# SandersP
7738 , title = {{Compressed Transmission of Route Descriptions}}
7739 , institution = "Karlsruhe Institute of Technology (KIT)"
7740 , note = {{a}rXiv:1011.4465v1}
7744 @InProceedings{bglsz-erchr-12
7745 , author = BatzV #and# GeisbergerR #and# LuxenD #and# SandersP #and# ZubkovR
7746 , title = {{Efficient Route Compression for Hybrid Route Planning}}
7747 , booktitle = {{Proceedings of the 1st Mediterranean Conference on Algorithms}}
7748 , publisher = pub-springer
7752 @InProceedings{bgm-fdsut-10
7753 , author = BergerA #and# GrimmerM #and# MuellerHannemannM
7754 , title = {{Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks}}
7755 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
7758 , publisher = pub-springer
7759 , series = ser-springer_lncs
7764 @InProceedings{bgmo-sdplt-11
7765 , author = BergerA #and# GebhardtA #and# MuellerHannemannM #and# OstrowskiM
7766 , title = {{Stochastic Delay Prediction in Large Train Networks}}
7767 , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}}
7768 , pages = {100--111}
7769 , series = ser-oasioasi
7774 @InProceedings{bgns-tdcha-10
7775 , author = BatzV #and# GeisbergerR #and# NeubauerS #and# SandersP
7776 , title = {{Time-Dependent Contraction Hierarchies and Approximation}}
7777 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
7779 , pages = {166--177}
7780 , publisher = pub-springer
7781 , series = ser-springer_lncs
7782 , url = "http://www.springerlink.com/content/u787292691813526/"
7787 @Article{bgr-dpglv-04
7788 , author = BarequetG #and# GoodrichMT #and# RileyC
7789 , title = {{Drawing Planar Graphs with Large Vertices and Thick Edges}}
7797 @Article{bgs-cpsbd-05
7798 , author = BoseP #and# GudmundssonJ #and# SmidM
7799 , title = {{Constructing Plane Spanners of Bounded Degree and Low Weight}}
7802 , pages = {249--264}
7808 , author = BianchiniM #and# GoriM #and# ScarselliF
7809 , title = {{Inside PageRank}}
7815 @techreport{bgs-tdchb-08
7816 , author = BatzV #and# GeisbergerR #and# SandersP
7817 , title = {{Time Dependent Contraction Hierarchies - Basic Algorithmic Ideas}}
7818 , institution = "ITI Sanders, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)"
7822 @Article{bgsv-mtdtt-13
7823 , author = BatzV #and# GeisbergerR #and# SandersP #and# VetterC
7824 , title = {{Minimum Time-Dependent Travel Times with Contraction Hierarchies}}
7825 , journal = j-acm-ea
7833 @InProceedings{bgw-egca-03
7834 , author = BrandesU #and# GaertlerM #and# WagnerD
7835 , title = {{Experiments on Graph Clustering Algorithms}}
7836 , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}}
7837 , isbn = "0302-9743"
7838 , pages = {568--579}
7839 , publisher = pub-springer
7840 , series = ser-springer_lncs
7841 , url = "http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=2832&spage=568"
7846 @Article{bgw-egcme-07
7847 , author = BrandesU #and# GaertlerM #and# WagnerD
7848 , title = {{Engineering Graph Clustering: Models and Experimental Evaluation}}
7849 , address = "New York, NY, USA"
7850 , doi = "http://doi.acm.org/10.1145/1227161.1227162"
7851 , isbn = "1084-6654"
7852 , journal = j-acm-ea
7855 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1227162&type=pdf&coll=GUIDE&dl=GUIDE&CFID=24108080&CFTOKEN=3"
7856 , url = "http://portal.acm.org/citation.cfm?id=1227161.1227162"
7861 @article{bh-amises-92
7862 , author = BoppanaRB #and# HalldorssonMM
7863 , title = {{Approximating Maximum Independent Sets by Excluding Subgraphs}}
7866 , pages = {180--196}
7872 , author = BeinekeLW #and# HararyF
7873 , title = {{The connectivity function of a graph}}
7874 , journal = j-mathematika
7875 , pages = {197--202}
7881 , author = BarnesJ #and# HutP
7882 , title = {{A Hierarchical $O(N \log N)$ Force-Calculation Algorithm}}
7883 , journal = j-nature
7885 , pages = {446--449}
7886 , pdf = "http://www.nature.com/nature/journal/v324/n6096/pdf/324446a0.pdf"
7887 , url = "http://dx.doi.org/10.1038/324446a0"
7892 @InProceedings{bh-ppcap-13
7893 , author = BoteaA #and# HaraborD
7894 , title = {{Path Planning with Compressed All-Pairs Shortest Paths Data}}
7895 , booktitle = {{Proceedings of the 23rd International Conference on Automated Planning and Scheduling}}
7896 , publisher = pub-aaaip
7900 @article{bhk-gmcnv-81
7901 , author = BoeschFT #and# HararyF #and# KabellJA
7902 , title = {{Graphs as Models of Communication Network Vulnerability: {Connectivity} and Persistence}}
7903 , journal = j-networks
7909 @Article{bhkn-amcbl-09
7910 , author = BenkertM #and# HaverkortH #and# KrollM #and# NollenburgM
7911 , title = {{Algorithms for Multi-Criteria Boundary Labeling}}
7913 , note = {Special issue of GD 2007}
7915 , pages = {289--317}
7916 , pdf = "http://i11www.ira.uka.de/extra/publications/bhkn-amcbl-09.pdf"
7917 , url = "http://jgaa.info/accepted/2009/BenkertHaverkortKrollNollenburg2009.13.3.pdf"
7922 @InProceedings{bhkn-amcos-08
7923 , author = BenkertM #and# HaverkortH #and# KrollM #and# NollenburgM
7924 , title = {{Algorithms for Multi-Criteria One-Sided Boundary Labeling}}
7925 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
7927 , pages = {243--254}
7928 , pdf = "http://i11www.ira.uka.de/extra/publications/bhkn-amcos-08.pdf"
7929 , publisher = pub-springer
7930 , series = ser-springer_lncs
7931 , url = "http://dx.doi.org/10.1007/978-3-540-77537-9_25"
7936 @InProceedings{bhkp-aoght-07
7937 , author = BhalgatA #and# HariharanR #and# KavithaT #and# PanigrahiD
7938 , title = {{An {${\tilde{O}}(mn)$} Gomory-Hu Tree Construction Algorithm for Unweighted Graphs}}
7939 , booktitle = {{Proceedings of the 39th Annual {ACM} Symposium on the Theory of Computing (STOC'07)}}
7940 , pages = {605--614}
7941 , publisher = pub-acm
7945 @Article{bhs-rtgn-90
7946 , author = BauerD #and# HakimiSL #and# SchmeichelEF
7947 , title = {{Recognizing Tough Graphs is NP-hard}}
7949 , pages = {191--195}
7955 , author = BoerP #and# HuismanM #and# SnijdersTAB #and# ZeggelinkE
7956 , title = {{{StOCNET}: an open software system for the advanced statistical analysis of social networks}}
7957 , institution = "Groningen: {ProGAMMA} / {ICS}"
7961 @techreport{bht-p-06
7962 , author = BorosE #and# HammerPL #and# TavaresG
7963 , title = {{Preprocessing of unconstrained quadratic binary optimization}}
7964 , institution = "Rutgers Center for Operations Research (RUTCOR)"
7966 , url = "http://rutcor.rutgers.edu/pub/rrr/reports2006/10_2006.pdf"
7970 @article{bhz-csip-87
7971 , author = BoppanaRB #and# HastadJ #and# ZachosS
7972 , title = {{Does co-{$\mathcal{NP}$} have short interactive proofs?}}
7973 , journal = "Information Pro"
7974 , pages = {127--132}
7979 @InProceedings{bj-dpch-02
7980 , author = BrodalG #and# JacobR
7981 , title = {{Dynamic Planar Convex Hull}}
7982 , booktitle = {{Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02)}}
7983 , pages = {617--626}
7984 , publisher = pub-ieeecs
7985 , url = "http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181985"
7989 @techreport{bj-lsc-03
7990 , author = BachFR #and# JordanMI
7991 , title = {{Learning Spectral Clustering}}
7992 , institution = "Computer Science Division (EECS), University of California "
7993 , number = {UCB/CSD-03-1249}
7994 , pdf = "http://vision.jhu.edu/reading_group/LearningSpectralClustering.pdf"
7998 @InProceedings{bj-lsc-04
7999 , author = BachFR #and# JordanC
8000 , title = {{Learning Spectral Clustering}}
8001 , booktitle = {{Advances in Neural Information Processing Systems 16}}
8002 , pdf = "http://books.nips.cc/papers/files/nips16/NIPS2003_AA39.pdf"
8003 , publisher = pub-mitpr
8004 , url = "http://books.nips.cc/nips16.html"
8008 @InProceedings{bj-tnmaf-04
8009 , author = BrodalG #and# JacobR
8010 , title = {{Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries}}
8011 , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}}
8013 , series = ser-entcs
8018 @Article{bjm-flcpp-00
8019 , author = BarrettC #and# JacobR #and# MaratheMV
8020 , title = {{Formal-Language-Constrained Path Problems}}
8021 , journal = j-sicomp
8023 , pages = {809--837}
8028 @InProceedings{bk-abhog-94
8029 , author = BiedlT #and# KantG
8030 , title = {{A Better Heuristic for Orthogonal Graph Drawings}}
8031 , booktitle = {{Proceedings of the 2nd Annual European Symposium on Algorithms (ESA'94)}}
8034 , pdf = "http://www.springerlink.com/content/h775q2054151x16m/fulltext.pdf"
8035 , series = ser-springer_lncs
8036 , url = "http://www.springerlink.com/content/h775q2054151x16m/"
8041 @InProceedings{bk-aesig-97
8042 , author = BiedlTC #and# KaufmannM
8043 , title = {{Area-Efficient Static and Incremental Graph Drawings}}
8044 , booktitle = {{Proceedings of the 5th Annual European Symposium on Algorithms (ESA'97)}}
8047 , publisher = pub-springer
8048 , series = ser-springer_lncs
8053 @InProceedings{bk-ao-96
8054 , author = BenzurA #and# KargerDR
8055 , title = {{Approximating s-t minimum cuts in $\tilde{O}(n^2)$ time}}
8056 , booktitle = {{Proceedings of the 28th Annual {ACM} Symposium on the Theory of Computing (STOC'96)}}
8058 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=237827&type=pdf&coll=GUIDE&dl=GUIDE&CFID=61366998&CFTOKEN=43"
8059 , publisher = pub-acm
8060 , url = "http://portal.acm.org/citation.cfm?id=237827"
8064 @article{bk-facug-73
8065 , author = BronC #and# KerboschJAGM
8066 , title = {{Algorithm 457: Finding all cliques of an undirected graph}}
8067 , journal = j-comm-acm
8069 , pages = {575--577}
8074 @InProceedings{bk-fshca-02
8075 , author = BrandesU #and# KoepfB
8076 , title = {{Fast and Simple Horizontal Coordinate Assignmen}}
8077 , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}}
8080 , publisher = pub-springer
8081 , series = ser-springer_lncs
8082 , url = "http://www.springerlink.com/content/j8b63vh3yatf17mk/"
8087 @InCollection{bk-sa-05
8088 , author = BaltzA #and# KliemannL
8089 , title = {{Spectral Analysis}}
8090 , booktitle = {{Network Analysis: Methodological Foundations}}
8092 , pages = {373--416}
8093 , pdf = "http://springerlink.metapress.com/content/yrpdymqmb0uckvnp/fulltext.pdf"
8094 , publisher = pub-springer
8095 , series = ser-springer_lncs
8096 , url = "http://springerlink.metapress.com/content/yrpdymqmb0uckvnp/"
8102 , author = BodlaenderHL #and# KosterAM
8103 , title = {{Treewidth computations I. Upper bounds}}
8106 , pages = {259--275}
8111 @Article{bk-udgrn-98
8112 , author = BreuH #and# KirkpatrickS
8113 , title = {{Unit Disk Graph Recognition is NP-hard}}
8117 , url = "http://dx.doi.org/10.1016/S0925-7721(97)00014-X"
8122 @Article{bkk-otpgf-97
8123 , author = BiedlT #and# KantG #and# KaufmannM
8124 , title = {{On Triangulating Planar Graphs under the Four-Connectivity Constraint}}
8126 , pages = {427--446}
8131 @InProceedings{bklww-dws3d-98
8132 , author = BrandesU #and# KaeaebV #and# LoehA #and# WagnerD #and# WillhalmT
8133 , title = {{Dynamic web structures in 3d}}
8134 , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}}
8135 , location = "Montreal, Canada"
8137 , note = {``Honorable Mention'' beim {\em Graph Drawing Contest 1998}, s. Graph-Drawing Contest Report by P.~E}
8138 , pages = {423--435}
8139 , publisher = pub-springer
8140 , series = ser-springer_lncs
8141 , url = "http://www.springerlink.com/content/8cm2ulm1qtc9/"
8146 @Article{bklww-dwsd-00
8147 , author = BrandesU #and# KaeaebV #and# LoehA #and# WagnerD #and# WillhalmT
8148 , title = {{Dynamic Web Structures in 3D}}
8151 , pages = {183--191}
8152 , url = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bklww-dws3d-00.ps.gz"
8157 @InProceedings{bkm-icci-00
8158 , author = BroderA #and# KrauthgamerR #and# MitzenmacherM
8159 , title = {{Improved Classification via Connectivity Information}}
8160 , booktitle = {{Proceedings of the 11th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'00)}}
8161 , pages = {576--585}
8162 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=338610&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36008740&CFTOKEN=37"
8163 , publisher = pub-siam
8164 , url = "http://portal.acm.org/citation.cfm?id=338610"
8168 @InProceedings{bkmm-abc-07
8169 , author = BaderDA #and# KintaliS #and# MadduriK #and# MihailM
8170 , title = {{Approximating Betweenness Centrality }}
8171 , booktitle = {{Algorithms and Models for the Web-Graph, Proceedings of the 5th International Workshop, WAW 2007}}
8172 , pages = {124--137}
8173 , pdf = "http://www.springerlink.com/content/w327302k835n02h8/fulltext.pdf"
8174 , publisher = pub-springer
8175 , series = ser-springer_lncs
8176 , url = "http://dx.doi.org/10.1007/978-3-540-77004-6_10"
8181 @article{bkmrrstw-gsw-00
8182 , author = BroderA #and# KumarR #and# MaghoulF #and# RaghavanP #and# RajagopalanS #and# StataR #and# TomkinsAS #and# WienerJ
8183 , title = {{Graph structure in the Web}}
8186 , pages = {309--320}
8191 @InProceedings{bkms-aaawg-06
8192 , author = BonifaciV #and# KortewegP #and# MarchettiSpaccamelaA #and# StougieL
8193 , title = {{An Approximation Algorithm for the Wireless Gathering Problem}}
8194 , booktitle = {{Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT'06)}}
8195 , publisher = pub-springer
8196 , series = ser-springer_lnm
8200 @InProceedings{bkmw-srn-10
8201 , author = BauerR #and# KrugM #and# MeinertS #and# WagnerD
8202 , title = {{Synthetic Road Networks}}
8203 , booktitle = {{Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM'10)}}
8205 , publisher = pub-springer
8206 , series = ser-springer_lncs
8207 , url = "http://dx.doi.org/10.1007/978-3-642-14355-7_6"
8212 @InProceedings{bkns-blol-08
8213 , author = BekosM #and# KaufmannM #and# NollenburgM #and# SymvonisA
8214 , title = {{Boundary Labeling with Octilinear Leaders}}
8215 , booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08)}}
8216 , pages = {234--245}
8217 , pdf = "http://i11www.ira.uka.de/extra/publications/bkns-blol-08.pdf"
8218 , publisher = pub-springer
8219 , series = ser-springer_lncs
8220 , url = "http://dx.doi.org/10.1007/978-3-540-69903-3_22"
8225 @Article{bkns-blol-09
8226 , author = BekosM #and# KaufmannM #and# NollenburgM #and# SymvonisA
8227 , title = {{Boundary Labeling with Octilinear Leaders}}
8229 , note = {Special issue of SWAT 2008}
8231 , pages = {436--461}
8232 , pdf = "http://i11www.ira.uka.de/extra/publications/bkns-blol-09.pdf"
8233 , url = "http://dx.doi.org/10.1007/s00453-009-9283-6"
8238 @Article{bkr-etnv-06
8239 , author = BrandesU #and# KenisP #and# RaabJ
8240 , title = {{Explanation Through Network Visualization}}
8244 , url = "http://content.apa.org/journals/med/2/1/16.html"
8249 @InProceedings{bkr-seeor-13
8250 , author = BlaesiusT #and# KarrerA #and# RutterI
8251 , title = {{Simultaneous Embedding: Edge Orderings, Relative Positions, Cutvertices}}
8252 , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}}
8253 , note = {To appear.}
8254 , publisher = pub-springer
8255 , series = ser-springer_lncs
8259 @Article{bkrsw-evpn-99
8260 , author = BrandesU #and# KenisP #and# RaabJ #and# SchneiderV #and# WagnerD
8261 , title = {{Explorations into the Visualization of Policy Networks}}
8265 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bkrsw-evpn-99.pdf"
8270 @InProceedings{bkrw-ogdfc-10
8271 , author = BlaesiusT #and# KrugM #and# RutterI #and# WagnerD
8272 , title = {{Orthogonal Graph Drawing with Flexibility Constraints}}
8273 , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}}
8275 , publisher = pub-springer
8276 , series = ser-springer_lncs
8277 , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_9"
8282 @Article{bkrw-ogdfc-12
8283 , author = BlaesiusT #and# KrugM #and# RutterI #and# WagnerD
8284 , title = {{Orthogonal Graph Drawing with Flexibility Constraints}}
8289 @techreport{bkrw-ogdfc-tr10
8290 , author = BlaesiusT #and# KrugM #and# RutterI #and# WagnerD
8291 , title = {{Orthogonal Graph Drawing with Flexibility Constraints}}
8292 , institution = iti_wagner
8293 , number = {2010-18}
8294 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000019793"
8298 @InProceedings{bks-rsaac-02
8299 , author = BarYosseffZ #and# KumarR #and# SivakumarD
8300 , title = {{Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs}}
8301 , booktitle = {{Proceedings of the 13th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'02)}}
8302 , pages = {623--632}
8303 , url = "http://portal.acm.org/citation.cfm?id=545464"
8307 @InProceedings{bkt-affci-07
8308 , author = Berger-WolfT #and# KempeD #and# TantipathananandthC
8309 , title = {{A Framework For Community Identification in Dynamic Social Networks}}
8310 , booktitle = {{Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}}
8311 , pdf = "http://compbio.cs.uic.edu/~tanya/research/pubs/TantipathananandhEtal_NetworkCommunities07.pdf"
8312 , publisher = pub-acm
8313 , url = "http://compbio.cs.uic.edu/~tanya/research/pubs/TantipathananandhEtal_NetworkCommunities07.pdf"
8317 @Article{bkw-ccpnd-03
8318 , author = BrandesU #and# KenisP #and# WagnerD
8319 , title = {{Communicating Centrality in Policy Network Drawings}}
8322 , pages = {241--253}
8323 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bkw-ccpnd-03.pdf"
8328 @InProceedings{bkw-cpnd-00
8329 , author = BrandesU #and# KenisP #and# WagnerD
8330 , title = {{Centrality in Policy Network Drawings}}
8331 , booktitle = {{Proceedings of the 7th International Symposium on Graph Drawing (GD'99)}}
8332 , location = "Stirin Castle, Czech Republic"
8334 , pages = {250--258}
8335 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bkw-cpnd-99.ps.gz"
8336 , publisher = pub-springer
8337 , series = ser-springer_lncs
8338 , url = "http://www.springerlink.com/content/02ctp54ec2kxkyhl/"
8343 @techreport{bkw-dtpg-01
8344 , author = BrandesU #and# KaeaebV #and# WagnerD
8345 , title = {{Dual Traversals of Planar Graphs}}
8346 , institution = "Universit{\"a}t Konstanz"
8350 @InProceedings{bkw-egldg-10
8351 , author = BauerR #and# KrugM #and# WagnerD
8352 , title = {{Enumerating and Generating Labeled k-Degenerate Graphs}}
8353 , booktitle = {{Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO '10)}}
8355 , publisher = pub-siam
8359 @inproceedings{bl-afsvl-84
8360 , author = BhattSN #and# LeightonFT
8361 , title = {{A Framework for Solving VLSI Graph Layout Problems}}
8363 , pages = {300--343}
8369 , author = BoothKS #and# LuekerGS
8370 , title = {{Linear algorithms to recognize interval graphs and test for consecutive ones property}}
8371 , journal = "proc-stoc-75"
8372 , pages = {255--265}
8376 @inproceedings{bl-ssg-04
8377 , author = BrandesU #and# LernerJ
8378 , title = {{Structural Similarity in Graphs}}
8379 , booktitle = {{Proceedings of the 15th International Symposium on Algorithms and Computation (ISAAC'04)}}
8380 , pages = {184--195}
8381 , series = ser-springer_lncs
8386 @Article{blcs-gbaga-87
8387 , author = BuiTN #and# LeightonFT #and# ChaudhuriS #and# SipserM
8388 , title = {{Graph Bisection Algorithms with Good Average Case Behavior}}
8391 , pages = {171--191}
8392 , pdf = "http://www.springerlink.com/content/u00w011807910743/fulltext.pdf"
8393 , url = "http://www.springerlink.com/content/u00w011807910743/"
8398 @InProceedings{bllmm-vsccg-08
8399 , author = BrandesU #and# LernerJ #and# LubbersMJ #and# McCartyC #and# MolinaJL
8400 , title = {{Visual Statistics for Collections of Clustered Graphs}}
8401 , booktitle = {{Proceedings of IEEE Pacific Visualization Symposium}}
8402 , note = {to appear}
8403 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bllmm-vsccg-08.pdf"
8407 @InProceedings{bm-aqcsm-12
8408 , author = BrandesU #and# MaderM
8409 , title = {{A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing}}
8410 , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}}
8412 , publisher = pub-springer
8413 , series = ser-springer_lncs
8414 , url = "http://dx.doi.org/10.1007/978-3-642-25878-7_11"
8419 , author = BrinkmannG #and# McKayBD
8420 , title = {{Fast generation of planar graphs}}
8421 , journal = j-matchcmcc
8423 , pages = {323--357}
8424 , url = "http://cs.anu.edu.au/~bdm/plantri/"
8430 , author = BondyJA #and# MurtyUS
8431 , title = {{Graph Theory}}
8432 , booktitle = {{Graph Theory}}
8433 , publisher = pub-springer
8434 , series = ser-springer_gtm
8439 , author = BondyJA #and# MurtyUS
8440 , title = {{Graph Theory with Applications}}
8441 , booktitle = {{Graph Theory with Applications}}
8442 , publisher = pub-macmillan
8446 @InCollection{bm-ldd-01
8447 , author = BastertO #and# MatuszewskiC
8448 , title = {{Layered Drawings of Digraphs}}
8449 , booktitle = {{Drawing Graphs: Methods and Models}}
8451 , isbn = "3-540-42062-2"
8453 , pdf = "http://www.springerlink.com/content/xl91uu3fwk0fhejj/fulltext.pdf"
8454 , publisher = pub-springer
8455 , series = ser-springer_lncs
8456 , url = "http://www.springerlink.com/content/xl91uu3fwk0fhejj/"
8461 @article{bm-pajek-98
8462 , author = BatageljV #and# MrvarA
8463 , title = {{$\mathsf{Pajek}$ -- A Program for Large Network Analysis}}
8471 @InCollection{bm-pavln-03
8472 , author = BatageljV #and# MrvarA
8473 , title = {{Pajek - Analysis and Visualization of Large Networks}}
8474 , booktitle = {{Graph Drawing Software}}
8475 , isbn = "3-540-00881-0"
8477 , publisher = pub-springer
8478 , url = "http://www.springer.com/math/cse/book/978-3-540-00881-1"
8483 , editor = BondyJA #and# MurtyUS
8484 , title = {{Progress in Graph Theory}}
8485 , booktitle = {{Progress in Graph Theory}}
8486 , publisher = pub-ap
8491 , author = BruggesserH #and# ManicG
8492 , title = {{Shellable Decompositions of Cells and Spheres.}}
8494 , pages = {197--205}
8499 @InProceedings{bm-snaps-08
8500 , author = BaderDA #and# MadduriK
8501 , title = {{SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks}}
8502 , booktitle = {{22nd International Parallel and Distributed Processing Symposium (IPDPS'08)}}
8504 , publisher = pub-ics
8508 @techreport{bm-somcs-09
8509 , author = BergerA #and# MuellerHannemannM
8510 , title = {{Subpath-Optimality of Multi-Criteria Shortest Paths in Time- and Event-Dependent Networks}}
8511 , institution = "University Halle-Wittenberg, Institute of Computer Science"
8517 , editor = BallMO #and# MagnantiTL #and# MonmaCL #and# NemhauserGL
8518 , title = {{Handbooks in Operations Research/Management Science, Volume on Networks}}
8519 , booktitle = {{Handbooks in Operations Research/Management Science, Volume on Networks}}
8520 , publisher = pub-nh
8524 @inproceedings{bmpp-bgpsv-03
8525 , author = DiBattistaG #and# MarianiF #and# PatrignaniM #and# PizzoniaM
8526 , title = {{BGPlay: A System for Visualizing the Interdomain Routing Evolution}}
8527 , booktitle = {{Proceedings of the 11th International Symposium on Graph Drawing (GD'03)}}
8529 , pages = {295--306}
8530 , publisher = pub-springer
8531 , series = ser-springer_lncs
8536 @InCollection{bmsssw-a-
8537 , author = BaderDA #and# MeyerhenkeH #and# SandersP #and# SchulzC #and# SchummA #and# WagnerD
8538 , title = {{Benchmarking for Graph Clustering and Partitioning}}
8539 , booktitle = {{Encyclopedia of Social Network Analysis and Mining}}
8540 , note = {to appear}
8541 , publisher = pub-springer
8545 @Article{bmw-qiiit-07
8546 , author = BungartzH #and# MeinelC #and# WilhelmR
8547 , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 1 einer Nachlese zum Perspektiven-Workshop in Dagstuhl}}
8551 , pages = {207--211}
8552 , url = "http://springerlink.com"
8557 @Article{bmw-qiiit2-07
8558 , author = BungartzH #and# MeinelC #and# WilhelmR
8559 , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 2 einer Nachlese zum Perspektiven Workshop in Dagstuhl im November 2006}}
8563 , pages = {291--296}
8564 , url = "http://springerlink.com"
8569 @Article{bmw-qiiit3-07
8570 , author = BungartzH #and# MeinelC #and# WilhelmR
8571 , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 3 einer Nachlese zum Perspektiven-Workshop in Dagstuhl im November 2006}}
8575 , pages = {374--377}
8576 , url = "http://springerlink.com"
8581 @Article{bmw-qiiit4-07
8582 , author = BungartzH #and# MeinelC #and# WilhelmR
8583 , title = {{Quo vadis, Informatik? Innovation dank Informatik. Teil 4 einer Nachlese zum Perspektiven-Workshop in Dagstuhl im November 2006}}
8587 , pages = {458--459}
8588 , url = "http://springerlink.com"
8593 @InProceedings{bn-ialmo-07
8594 , author = BenkertM #and# NollenburgM
8595 , title = {{Improved Algorithms for Length-Minimal One-Sided Boundary Labeling}}
8596 , booktitle = {{Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07)}}
8597 , pages = {190--193}
8598 , pdf = "http://i11www.ira.uka.de/extra/publications/bn-ialmo-07.pdf"
8602 @InProceedings{bnpw-oarcd-08
8603 , author = BeenK #and# NollenburgM #and# PoonSH #and# WolffA
8604 , title = {{Optimizing Active Ranges for Consistent Dynamic Map Labeling}}
8605 , booktitle = {{Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)}}
8607 , pdf = "http://i11www.ira.uka.de/extra/publications/bnpw-oarcd-08.pdf"
8608 , publisher = pub-acm
8609 , url = "http://dl.acm.org/authorize?087167"
8613 @InProceedings{bnpw-oarcd-08ecg
8614 , author = BeenK #and# NollenburgM #and# PoonSH #and# WolffA
8615 , title = {{Optimizing Active Ranges for Consistent Dynamic Map Labeling}}
8616 , booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)}}
8618 , pdf = "http://i11www.ira.uka.de/extra/publications/bnpw-oarcd-08ecg.pdf"
8622 @Article{bnpw-oarcd-10
8623 , author = BeenK #and# NollenburgM #and# PoonSH #and# WolffA
8624 , title = {{Optimizing Active Ranges for Consistent Dynamic Map Labeling}}
8626 , note = {Special issue of SoCG 2008}
8628 , pages = {312--328}
8629 , pdf = "http://i11www.ira.uka.de/extra/publications/bnpw-oarcd-10.pdf"
8630 , url = "http://dx.doi.org/10.1016/j.comgeo.2009.03.006"
8635 @Article{bnsww-pnasp-99
8636 , author = BrandesU #and# NeyerG #and# SchlickenriederW #and# WagnerD #and# WeiheK
8637 , title = {{\textsc{PlaNet}---A Software Package for Algorithms and Heuristics on Planar Networks}}
8640 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bnsww-pspah-99.pdf"
8645 @InProceedings{bnuw-miecw-07
8646 , author = BenkertM #and# NollenburgM #and# UnoT #and# WolffA
8647 , title = {{Minimizing Intra-Edge Crossings in Wiring Diagrams and Public Transportation Maps}}
8648 , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}}
8650 , pages = {270--281}
8651 , pdf = "http://i11www.ira.uka.de/extra/publications/bnuw-miecw-07.pdf"
8652 , publisher = pub-springer
8653 , series = ser-springer_lncs
8654 , url = "http://dx.doi.org/10.1007/978-3-540-70904-6_27"
8659 @techreport{bnw-edppg-96
8660 , author = BrandesU #and# NeyerG #and# WagnerD
8661 , title = {{Edge-Disjoint Paths in Planar Graphs with Minimum Total Length}}
8662 , institution = "Universit{\"a}t Konstanz"
8663 , note = {Konstanzer Schriften in Mathematik und Informatik}
8669 , title = {{Boost C++ Libraries}}
8670 , url = "http://www.boost.org/"
8674 , author = BeinekeLW #and# OellermannOR #and# PippertRE
8675 , title = {{The average connectivity of a graph}}
8684 @article{bp-alhws-98
8685 , author = BrinS #and# PageL
8686 , title = {{The Anatomy of a Large-Scale Hypertextual Web Search Engine}}
8687 , journal = j-cn_isdn
8689 , pages = {107--117}
8695 , author = BrandesU #and# PichC
8696 , title = {{Centrality Estimation in Large Networks}}
8699 , pages = {2303--2318}
8700 , pdf = "http://www.inf.uni-konstanz.de/algo/publications/bp-celn-06.pdf"
8705 @incollection{bp-dvn-85
8706 , author = BondJ #and# PeyratC
8707 , editor = AlaviY #and# ChartrandG #and# LesniakL #and# LickDR #and# WallCE
8708 , title = {{Diameter Vulnerability in Networks}}
8709 , booktitle = {{Graph Theory with Applications to Algorithms and Computer Science}}
8710 , pages = {123--149}
8711 , publisher = pub-wiley
8715 @InProceedings{bp-empms-07
8716 , author = BrandesU #and# PichC
8717 , title = {{Eigensolver Methods for Progressive Multidimensional Scaling of Large Data}}
8718 , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}}
8721 , pdf = "http://www.inf.uni-konstanz.de/cgip/bib/files/BrPi06.pdf"
8722 , publisher = pub-springer
8723 , series = ser-springer_lncs
8724 , url = "http://www.springerlink.com/content/8651606146q45707/"
8730 , author = BogunaM #and# PastorSatorrasR #and# DiazGuileraA #and# ArenasA
8731 , title = {{Models of social networks based on social distance attachment}}
8738 @InProceedings{br-drpse-12
8739 , author = BlaesiusT #and# RutterI
8740 , title = {{Disconnectivity and Relative Positions in Simultaneous Embeddings}}
8741 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
8742 , publisher = pub-springer
8743 , series = ser-springer_lncs
8748 @incollection{br-mrsfr-02
8749 , author = BollobasB #and# RiordanOM
8750 , title = {{Mathematical results on scale-free random graphs}}
8751 , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}}
8753 , publisher = pub-wiley-vch
8754 , url = "http://dx.doi.org/10.1002/3527602755.fmatter"
8758 @InProceedings{br-spqoa-13
8759 , author = BlaesiusT #and# RutterI
8760 , title = {{Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems}}
8761 , booktitle = {{Proceedings of the 24th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'13)}}
8762 , publisher = pub-siam
8766 @inproceedings{brrt-fahfl-01
8767 , author = BorodinA #and# RobertsGO #and# RosenthalJS #and# TsaparasP
8768 , title = {{Finding authorities and hubs from link structures on the World Wide Web}}
8769 , address = "Hong Kong"
8770 , booktitle = {{Proceedings of the 10th International World Wide Web Conference (WWW10)}}
8771 , pages = {415--429}
8776 , author = BotafogoRA #and# RivlinE #and# ShneidermanB
8777 , title = {{Structural Analysis of Hypertexts: Identifying Hierarchies and Useful Metrics}}
8778 , journal = j-acm-tois
8780 , pages = {142--180}
8785 @article{brst-dssfr-01
8786 , author = BollobasB #and# RiordanOM #and# SpencerJ #and# TusnadyG
8787 , title = {{The Degree Sequence of a Scale-Free Random Graph Process}}
8789 , pages = {279--290}
8794 @Article{brt-sudsp-08
8795 , author = BuriolL #and# ResendeM #and# ThorupM
8796 , title = {{Speeding Up Dynamic Shortest-Path Algorithms}}
8799 , pages = {191--204}
8804 @InProceedings{brw-dulpd-07
8805 , author = BurriN #and# RickenbachPv #and# WattenhoferM
8806 , title = {{Dozer: Ultra-Low Power Data Gathering in Sensor Networks}}
8807 , booktitle = {{Sixth International Symposium on Information Processing in Sensor Networks (IPSN 2007)}}
8808 , pages = {450--459}
8809 , publisher = pub-acm
8810 , url = "http://portal.acm.org/citation.cfm?id=1236360.1236417"
8814 @Article{brw-envsd-01
8815 , author = BrandesU #and# RaabJ #and# WagnerD
8816 , title = {{Exploratory Network Visualization: Simultaneous Display of Actor Status and Connections}}
8820 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/brw-envsd-01.pdf"
8825 @InProceedings{brw-oogdc-13
8826 , author = BlaesiusT #and# RutterI #and# WagnerD
8827 , title = {{Optimal Orthogonal Graph Drawing with Convex Bend Costs}}
8828 , booktitle = {{Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP'13)}}
8829 , note = {To appear.}
8830 , publisher = pub-springer
8831 , series = ser-springer_lncs
8836 @InProceedings{bs-aamas-90
8837 , author = BergerB #and# ShorPW
8838 , title = {{Approximation Algorithms for the Maximum Acyclic Subgraph Problem}}
8839 , booktitle = {{Proceedings of the 1st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'90)}}
8841 , pages = {236--243}
8845 @techreport{bs-dgdv-08
8846 , author = BaurM #and# SchankT
8847 , title = {{Dynamic Graph Drawing in visone}}
8848 , institution = iti_wagner
8850 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/244200"
8851 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007990"
8855 @Article{bs-fmirs-94
8856 , author = BarnardST #and# SimonH
8857 , title = {{Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems}}
8860 , pages = {101--117}
8865 @article{bs-gdmbm-98
8866 , author = BunkeH #and# ShearerK
8867 , title = {{A graph distance metric based on the maximal common subgraph}}
8869 , pages = {255--259}
8870 , url = "http://citeseer.ist.psu.edu/bunke98graph.html"
8876 , editor = BornholdtS #and# SchusterHG
8877 , title = {{Handbook of Graphs and Networks: From the Genome to the Internet}}
8878 , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}}
8879 , publisher = pub-wiley-vch
8880 , url = "http://dx.doi.org/10.1002/3527602755.fmatter"
8884 @InCollection{bs-nm-05
8885 , author = BaumannN #and# StillerS
8886 , title = {{Network Models}}
8887 , booktitle = {{Network Analysis: Methodological Foundations}}
8889 , pages = {341--372}
8890 , pdf = "http://springerlink.metapress.com/content/2h2khh83uwtuvxjp/fulltext.pdf"
8891 , publisher = pub-springer
8892 , series = ser-springer_lncs
8893 , url = "http://springerlink.metapress.com/content/2h2khh83uwtuvxjp/"
8898 @InCollection{bs-ns-05
8899 , author = BrinkmeierM #and# SchankT
8900 , title = {{Network Statistics}}
8901 , booktitle = {{Network Analysis: Methodological Foundations}}
8903 , pages = {293--317}
8904 , pdf = "http://springerlink.metapress.com/content/u4fwpdqqp4rn3jtw/fulltext.pdf"
8905 , publisher = pub-springer
8906 , series = ser-springer_lncs
8907 , url = "http://springerlink.metapress.com/content/u4fwpdqqp4rn3jtw/"
8913 , author = BarnesTM #and# SavageCD
8914 , title = {{A Recurrence for Counting Graphical Partitions}}
8918 , pdf = "http://www.emis.ams.org/journals/EJC/Volume_2/PDFFiles/v2i1r11.pdf"
8919 , url = "http://www.emis.ams.org/journals/EJC/Volume_2/volume2.html#R11"
8925 , author = BrightwellGR #and# ScheinermanER
8926 , title = {{Representations of Planar Graphs}}
8930 , pages = {214--229}
8935 @InProceedings{bs-tdrpg-12
8936 , author = BatzV #and# SandersP
8937 , title = {{Time-Dependent Route Planning with Generalized Objective Functions}}
8938 , booktitle = {{Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)}}
8939 , publisher = pub-springer
8940 , series = ser-springer_lncs
8945 @Article{bsst-drs-40
8946 , author = BrooksRL #and# SmithCAB #and# StoneAH #and# TutteWT
8947 , title = {{The Dissection of Rectangles into Squares}}
8948 , journal = j-duke-mj
8949 , pages = {312--340}
8950 , url = "http://projecteuclid.org/euclid.dmj/1077492259"
8955 @InProceedings{bstw-flmtg-01
8956 , author = BrandesU #and# ShubinaG #and# TamassiaR #and# WagnerD
8957 , title = {{Fast Layout Methods for Timetable Graphs}}
8958 , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}}
8960 , pages = {127--138}
8961 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bstw-flmtg-01.ps.gz"
8962 , publisher = pub-springer
8963 , series = ser-springer_lncs
8964 , url = "http://www.springerlink.com/content/6v3wl11ec42nh9lr/"
8969 @Article{bsww-gncsp-04
8970 , author = BrandesU #and# SchulzF #and# WagnerD #and# WillhalmT
8971 , title = {{Generating Node Coordinates for Shortest-Path Computations in Transportation Networks}}
8972 , journal = j-acm-ea
8974 , url = "http://jea.acm.org/volume9.html"
8979 @InProceedings{bsww-tpsmm-01
8980 , author = BrandesU #and# SchulzF #and# WagnerD #and# WillhalmT
8981 , title = {{Travel Planning with Self-Made Maps}}
8982 , booktitle = {{Proceedings of the 3rd International Workshop on Algorithm Engineering and Experiments (ALENEX'01)}}
8983 , pages = {132--144}
8984 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bsww-tpsmm-01.ps.gz"
8985 , publisher = pub-springer
8986 , series = ser-springer_lncs
8987 , url = "http://www.springerlink.com/content/30tdmcanl0dfu5v3/"
8992 @inproceedings{bt-diplt-02
8993 , author = BuT #and# TowsleyD
8994 , title = {{On Distinguishing between {Internet} Power Law Topology Generators}}
8995 , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
8996 , publisher = pub-ieeecs
9001 @inproceedings{bt-ipt-89
9002 , author = DiBattistaG #and# TamassiaR
9003 , title = {{Incremental Planarity Testing}}
9004 , booktitle = {{Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89)}}
9006 , pages = {436--441}
9010 @article{bt-ogicn-70
9011 , author = BoeschFT #and# ThomasRE
9012 , title = {{On Graphs of Invulnerable Communication Nets}}
9018 @article{bt-olmtc-96
9019 , author = DiBattistaG #and# TamassiaR
9020 , title = {{On-Line Maintenance of Triconnected Components with {SPQR}-Trees}}
9022 , pages = {302--318}
9027 @techreport{bt-rgar-03
9028 , author = BodlaenderHL #and# TelG
9029 , title = {{Rectilinear Graphs and Angular Resolution}}
9030 , institution = "Department of Information and Computing Sciences, Utrecht University"
9031 , number = {UU-CS-2003}
9032 , pdf = "http://www.cs.uu.nl/research/techreps/repo/CS-2003/2003-033.pdf"
9033 , url = "http://www.cs.uu.nl/research/techreps/UU-CS-2003-033.html"
9037 @Article{bt-tmacl-04
9038 , author = BaranyI #and# TokushigeN
9039 , title = {{The Minimum Area of Convex Lattice $n$-Gons}}
9043 , pages = {171--185}
9044 , pdf = "http://www.springerlink.com/content/t20rrl7pf3hwk7n4/fulltext.pdf"
9045 , url = "http://www.springerlink.com/content/t20rrl7pf3hwk7n4/"
9050 @Article{bu-tsdtc-89
9051 , author = BairdD #and# UlanowiczRE
9052 , title = {{The Seasonal Dynamics of The Chesapeake Bay Ecosystem}}
9056 , pages = {329--364}
9057 , url = "http://www.esajournals.org/doi/abs/10.2307/1943071"
9063 , author = BoydS #and# VandenbergheL
9064 , title = {{Convex Optimization}}
9065 , publisher = pub-cup
9069 @Article{bvdj-oaccc-08
9070 , author = BonizzoniP #and# VedovaGD #and# DondiR #and# JiangT
9071 , title = {{On the Approximation of Correlation Clustering and Consensus Clustering}}
9074 , pages = {671--696}
9075 , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6WJ0-4P06CRB-2-1&_cdi=6864&_user=2149863&_o"
9076 , url = "http://dx.doi.org/10.1016/j.jcss.2007.06.024"
9081 @Article{bvw-taar-06
9082 , author = BerberichK #and# VazirgiannisM #and# WeikumG
9083 , title = {{Time-Aware Authority Ranking}}
9086 , pages = {301--332}
9087 , pdf = "http://www.internetmathematics.org/volumes/2/3/Berberich.pdf"
9088 , url = "http://www.internetmathematics.org/volumes/2.htm"
9093 @InProceedings{bvwz-sdchg-07
9094 , author = BeregS #and# VolkerM #and# WolffA #and# ZhangY
9095 , title = {{Straightening Drawings of Clustered Hierarchical Graphs}}
9096 , booktitle = {{Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}}
9097 , isbn = "978-3-540-69506-6"
9098 , location = "Harrachov, Czech Republic"
9100 , pages = {176--187}
9101 , pdf = "http://i11www.ira.uka.de/extra/publications/bvwz-sdchg-07.pdf"
9102 , publisher = pub-springer
9103 , series = ser-springer_lncs
9104 , url = "http://www.springerlink.com/content/8164050221104v54/"
9109 @Article{bvz-faemg-01
9110 , author = BoykovY #and# VekslerO #and# ZabihR
9111 , title = {{Fast Approximate Energy Minimization via Graph Cuts}}
9113 , pages = {1222--1239}
9118 @Article{bw-altaa-00
9119 , author = BrandesU #and# WagnerD
9120 , title = {{A Linear Time Algorithm for the Arc Disjoint {Menger} Problem in Directed Planar Graphs}}
9124 , pdf = "http://www.springerlink.de/content/8u5qnvlfytmpt3gy/fulltext.pdf"
9125 , url = "http://www.springerlink.de/content/8u5qnvlfytmpt3gy/"
9130 @techreport{bw-bdss-tr
9131 , author = BauerR #and# WagnerD
9132 , title = {{Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study}}
9133 , institution = iti_wagner
9135 , pdf = "http://i11www.ira.uka.de/extra/publications/bw-bdss-tr.pdf"
9136 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000010926"
9140 @InProceedings{bw-bdsss-09
9141 , author = BauerR #and# WagnerD
9142 , title = {{Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental
\r
9144 , booktitle = {{Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)}}
9147 , pdf = "http://i11www.ira.uka.de/extra/publications/bw-bdsss-09.pdf"
9148 , publisher = pub-springer
9149 , series = ser-springer_lncs
9154 @InProceedings{bw-bpdgl-98
9155 , author = BrandesU #and# WagnerD
9156 , title = {{A {Bayesian} paradigm for dynamic graph layout}}
9157 , booktitle = {{Proceedings of the 5th International Symposium on Graph Drawing (GD'97)}}
9158 , location = "Rome, Italy"
9160 , pages = {236--247}
9161 , publisher = pub-springer
9162 , series = ser-springer_lncs
9163 , url = "http://www.springerlink.com/content/x7r71r316847/"
9168 @InProceedings{bw-cvass-00
9169 , author = BrandesU #and# WagnerD
9170 , title = {{Contextual Visualization of Actor Status in Social Networks}}
9171 , booktitle = {{Proceedings of the 2nd Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym'00)}}
9173 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bw-cvass-00.ps.gz"
9174 , publisher = pub-springer
9178 @InProceedings{bw-dgefb-98
9179 , author = BrandesU #and# WagnerD
9180 , title = {{Dynamic Grid Embedding with Few Bends and Changes}}
9181 , booktitle = {{Proceedings of the 9th International Symposium on Algorithms and Computation (ISAAC'98)}}
9183 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bw-dgefb-98.ps.gz"
9184 , publisher = pub-springer
9185 , series = ser-springer_lncs
9186 , url = "http://www.springerlink.com/index/29mcxvep69mawk58.pdf"
9191 @InProceedings{bw-ltaad-97
9192 , author = BrandesU #and# WagnerD
9193 , title = {{A linear time algorithm for the arc disjoint {Menger} problem in planar directed graphs}}
9194 , booktitle = {{Proceedings of the 5th Annual European Symposium on Algorithms (ESA'97)}}
9197 , publisher = pub-springer
9198 , series = ser-springer_lncs
9204 , author = BrandesU #and# WagnerD
9205 , title = {{Netzwerkvisualisierung}}
9208 , pages = {129--134}
9213 @article{bw-pswnm-00
9214 , author = BarratA #and# WeigtM
9215 , title = {{On the properties of small-world network models}}
9217 , pages = {547--560}
9222 @techreport{bw-rfmgl-97
9223 , author = BrandesU #and# WagnerD
9224 , title = {{Random Field Models for Graph Layout}}
9225 , institution = "Universit{\"a}t Konstanz"
9226 , note = {Konstanzer Schriften in Mathematik und Informatik}
9228 , type = {techreport}
9232 @Article{bw-uglvt-00
9233 , author = BrandesU #and# WagnerD
9234 , title = {{Using Graph Layout to Visualize Train Connection Data}}
9237 , pages = {135--155}
9238 , url = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/bw-uglvt-00.ps.gz"
9243 @InProceedings{bw-uglvt-99
9244 , author = BrandesU #and# WagnerD
9245 , title = {{Using Graph Layout to Visualize Train Interconnection Data}}
9246 , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}}
9247 , location = "Montreal, Canada"
9250 , pdf = "http://www.springerlink.com/content/bm2e1r9cyrwy2p2a/fulltext.pdf"
9251 , publisher = pub-springer
9252 , series = ser-springer_lncs
9253 , url = "http://www.springerlink.com/content/bm2e1r9cyrwy2p2a/"
9258 @InCollection{bw-uzg-99
9259 , author = BrandesU #and# WagnerD
9260 , title = {{{\"U}ber das Zeichnen von Graphen}}
9261 , booktitle = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}}
9267 @InCollection{bw-vavsn-03
9268 , author = BrandesU #and# WagnerD
9269 , title = {{visone -- Analysis and Visualization of Social Networks.}}
9270 , booktitle = {{Graph Drawing Software}}
9271 , isbn = "3-540-00881-0"
9272 , pages = {321--340}
9273 , publisher = pub-springer
9274 , url = "http://www.springer.com/math/cse/book/978-3-540-00881-1"
9278 @InProceedings{bw-vbnrlm-02
9279 , author = WillhalmT #and# BrandesU
9280 , title = {{Visualization of Bibliographic Networks with a Reshaped Landscape Metaphor}}
9281 , booktitle = {{Proceedings of the 4th Joint Eurographics - IEEE TVCG Symposium on Visualization (VisSym '02)}}
9282 , location = "Barcelona, Spain"
9283 , pages = {159--164}
9284 , pdf = "http://i11www.ira.uka.de/members/willhalm/publications/bw-vbnrlm-02.pdf"
9285 , publisher = pub-acm
9290 , author = BrandesU #and# WagnerD
9291 , title = {{Visualisierung von Verkehrsdaten}}
9294 , volume = {1--2000}
9298 @Article{bwk-ctlb-06
9299 , author = BodlaenderHL #and# WolleT #and# KosterAM
9300 , title = {{Contraction and Treewidth Lower Bounds}}
9308 @unpublished{bz-acdn-03
9309 , author = BatageljV #and# ZaversnikM
9310 , title = {{An $O(m)$ Algorithm for Cores Decomposition of Networks}}
9312 , note = {electronically published at \url{http://arxiv.org/abs/cs.DS/0310049}}
9314 , pdf = "http://arxiv.org/pdf/cs/0310049v1"
9315 , url = "http://arxiv.org/abs/cs.DS/0310049"
9319 @techreport{bz-gc-02
9320 , author = BatageljV #and# ZaversnikM
9321 , title = {{Generalized Cores}}
9322 , institution = "IMFM Ljublana, Ljubljana"
9324 , pdf = "http://vlado.fmf.uni-lj.si/pub/preprint/imfm0799.pdf"
9326 , url = "http://vlado.fmf.uni-lj.si/pub/networks/doc/"
9330 @techreport{bz-oacdn-02
9331 , author = BatageljV #and# ZaversnikM
9332 , title = {{An {$\mathcal{O}(m)$} Algorithm for Cores Decomposition of Networks}}
9333 , institution = "IMFM Ljublana, Ljubljana"
9338 %% --------------------------------------------------------------
9340 @article{c-acmftn-77
9341 , author = CherkasskyBV
9342 , title = {{An algorithm for constructing a maximal flow through a network requiring {$\mathcal{O}(n^2\sqrt{p})$} operations}}
9343 , journal = "Mathematical Me"
9344 , note = {(In Russian)}
9345 , pages = {117--126}
9352 , title = {{A Greedy Heuristic for the Set-Covering Problem}}
9355 , pages = {233--235}
9360 @InProceedings{c-alval-88
9361 , author = ClarksonKL
9362 , title = {{A Las Vegas Algorithm for Linear Programming When the Dimension Is Small}}
9363 , booktitle = {{Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS'88)}}
9364 , pages = {452--456}
9365 , publisher = pub-ics
9370 , author = ChlebikovaJ
9371 , title = {{Approximating the Maximally Balanced Connected Partition Problem in Graphs}}
9374 , pages = {223--230}
9379 @InProceedings{c-apca-93
9380 , author = ClarksonKL
9381 , title = {{Algorithms for Polytope Covering and Approximation}}
9382 , booktitle = {{Proceedings of the 3rd International Workshop on Algorithms and Data Structures (WADS'93)}}
9383 , pages = {246--252}
9384 , publisher = pub-springer
9385 , series = ser-springer_lncs
9392 , title = {{Drawing Graphs to Convey Proximity: An Incremental Arrangement Method}}
9393 , journal = j-acm-tchi
9396 , pages = {197--229}
9397 , url = "http://portal.acm.org/citation.cfm?doid=264645.264657"
9402 @incollection{c-facmftn-94
9403 , author = CherkasskyBV
9404 , title = {{A Fast Algorithm for Constructing a Maximum Flow Through a Network}}
9405 , booktitle = {{Selected Topics in Discrete Mathematics: Proceedings of the Moscow Discrete Mathematics Seminar, 197}}
9408 , series = "American Mathematica"
9413 @inproceedings{c-gaafdcg-00
9414 , author = CharikarM
9415 , title = {{Greedy approximation algorithms for finding dense components in a graph}}
9416 , booktitle = {{Proceedings of the 3rd International Workshop on Approximatin Algorithms for Combinatorial Optimizat}}
9418 , publisher = pub-springer
9419 , series = ser-springer_lncs
9425 , author = ChartrandG
9426 , title = {{A graph-theoretic approach to a communications problem}}
9430 , pages = {778--781}
9437 , title = {{An Iterative Algorithm to Determine the Dynamic User Equilibrium in a Traffic Simulation Model}}
9440 , pages = {393--408}
9447 , title = {{A Multilevel Algorithm for Force-Directed Graph-Drawing}}
9451 , pages = {253--285}
9452 , pdf = "http://www.cs.brown.edu/sites/jgaa/accepted/2003/Walshaw2003.7.3.pdf"
9453 , url = "http://www.cs.brown.edu/sites/jgaa/volume07.html"
9459 , author = CzygrinowA
9460 , title = {{Maximum dispersion problem in dense graphs}}
9469 , author = ColumbusT
9470 , title = {{On the Complexity of Contraction Hierarchies}}
9471 , note = {Student's thesis - Karlsruhe Institute of Technology - ITI Wagner}
9472 , school = "Karlsruhe Institute of Technology - ITI Wagner"
9477 , author = CaldwellT
9478 , title = {{On Finding Minimum Routes in a Network With Turn Penalties}}
9479 , journal = j-comm-acm
9486 , author = ConnellyR
9487 , title = {{Rigidity and Energy}}
9496 , title = {{Spectral Graph Theory}}
9497 , publisher = pub-ams
9498 , series = ser-ams_cbms
9502 @mastersthesis{c-sssch-12
9503 , author = ColumbusT
9504 , title = {{Search Space Size in Contraction Hierarchies}}
9506 , school = "Karlsruhe Institute of Technology"
9507 , type = {Master's Thesis}
9508 , url = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/da-columbus-12.pdf"
9512 @InProceedings{c-t-71
9514 , title = {{The complexity of theorem-proving procedures}}
9515 , booktitle = {{Proceedings of the 3rd Annual {ACM} Symposium on the Theory of Computing (STOC'71)}}
9517 , pages = {151--158}
9518 , publisher = pub-acm
9524 , title = {{Tough Graphs and Hamiltionian Circuits}}
9530 @InProceedings{c-ulmrc-93
9531 , author = ChalmersM
9532 , title = {{Using a Landscape Metaphor to Represent a Corpus of Documents}}
9533 , booktitle = {{Proceedings of the European Conference on Spatial Information Theory (COSIT'93)}}
9534 , pages = {377--390}
9535 , publisher = pub-springer
9542 , title = {{Visualizing {I}nternet Topology at a Macroscopic Scale}}
9543 , url = "http://www.caida.org/research/topology/as_core_network/"
9547 @techreport{c-wahts-76
9548 , author = ChristofidesN
9549 , title = {{Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem}}
9550 , institution = "Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh"
9551 , number = {Technical Report 388}
9557 , title = {{Walrus -- Graph Visualization Tool}}
9558 , url = "http://www.caida.org/tools/visualization/walrus/"
9562 @Article{cbb-rpmpd-07
9563 , author = ChenYa #and# BellMG #and# BogenbergerK
9564 , title = {{Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System}}
9565 , journal = j-ieeetits
9573 @Article{cbm-aprob-07
9574 , author = ChardaireP #and# BarakeM #and# McKeownGP
9575 , title = {{A PROBE-Based Heuristic for Graph Partitioning}}
9578 , pages = {1707--1720}
9579 , url = "http://doi.ieeecomputersociety.org/10.1109/TC.2007.70760"
9584 @InProceedings{cbmb-aspam-07
9585 , author = CrobakJR #and# BerryJW #and# MadduriK #and# BaderDA
9586 , title = {{Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture}}
9587 , booktitle = {{Workshop on Multithreaded Architectures and Applications (MTAAP 2007)}}
9592 @Article{cbs-dstgo-97
9593 , author = ChristofidesN #and# BadraHO #and# SharaihaYM
9594 , title = {{Data structures for topological and geometric operations on networks}}
9596 , pages = {259--289}
9597 , url = "http://www.springerlink.com/content/l6828vu5x1t30470/"
9602 @InProceedings{cc-aesac-05
9603 , author = ChoH #and# ChungC
9604 , title = {{An Efficient and Scalable Approach to CNN Queries in a Road Network}}
9605 , booktitle = {{Proceedings of the 31st International Conference on Very Large Databases (VLDB 2005)}}
9606 , pages = {865--876}
9611 , author = CoxTF #and# CoxMAA
9612 , title = {{Multidimensional Scaling}}
9614 , publisher = pub-ch
9620 , author = CardonA #and# CrochemoreM
9621 , title = {{Partitioning a Graph in $\mathcal{O}(|A|\log_2|V|)$}}
9628 @InProceedings{ccfm-icdir-97
9629 , author = CharikarM #and# ChekuriC #and# FederT #and# MotwaniR
9630 , title = {{Incremental Clustering and Dynamic Information Retrieval}}
9631 , booktitle = {{Proceedings of the 29th Annual {ACM} Symposium on the Theory of Computing (STOC'97)}}
9632 , pages = {626--635}
9633 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=258657&type=pdf&coll=GUIDE&dl=GUIDE&CFID=26594007&CFTOKEN=60"
9634 , publisher = pub-ap
9635 , url = "http://doi.acm.org/10.1145/258533.258657"
9639 @InProceedings{ccgj-oplit-02
9640 , author = ChenQ #and# ChangH #and# GovindanR #and# JaminS
9641 , title = {{The Origin of Power Laws in Internet Topologies Revisited}}
9642 , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
9643 , pages = {608--617}
9644 , pdf = "http://ieeexplore.ieee.org/iel5/7943/21922/01019306.pdf"
9645 , publisher = pub-ieeecs
9650 @Article{cdfk-tgmog-03
9651 , author = CorneDW #and# DebK #and# FlemingPJ #and# KnowlesJD
9652 , title = {{The Good of the Many Outweighs the Good of the One: Evolutionary Multi-
\r
9653 Objective Optimization}}
9661 @Article{cdgk-dpgca-01
9662 , author = ChengCC #and# DuncanCA #and# GoodrichMT #and# KobourovSG
9663 , title = {{Drawing Planar Graphs with Circular Arcs}}
9666 , pages = {405--418}
9671 @inproceedings{cdks-tele-02
9672 , author = ChienS #and# DworkC #and# KumarR #and# SivakumarD
9673 , title = {{Towards Exploiting Link Evolution}}
9674 , booktitle = {{proc-amwg-02}}
9680 , author = CvetkovicDM #and# DoobM #and# SachsH
9681 , title = {{Spectra of Graphs}}
9682 , publisher = pub-jab
9686 @InProceedings{cdw-ptlcr-01
9687 , author = CornelsenS #and# DinitzY #and# WagnerD
9688 , title = {{Planarity of the Two-Level Cactus Representation}}
9689 , booktitle = {{Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01)}}
9691 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/cdw-p2lcr-01.pdf"
9692 , publisher = pub-springer
9693 , series = ser-springer_lncs
9694 , url = "http://springerlink.metapress.com/link.asp?id=5uge4xgtv6hdal7m"
9700 , author = CalvertKL #and# DoarMB #and# ZeguraEW
9701 , title = {{Modeling {Internet} Topology}}
9704 , pages = {160--163}
9709 @InProceedings{ce-tcfoa-07
9710 , author = CarlsonJ #and# EppsteinD
9711 , title = {{Trees with Convex Faces and Optimal Angles}}
9712 , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}}
9715 , publisher = pub-springer
9716 , series = ser-springer_lncs
9717 , url = "http://dx.doi.org/10.1007/978-3-540-70904-6_9"
9722 @article{cebh-rirb-00
9723 , author = CohenR #and# ErezK #and# BenAvrahamD #and# HavlinS
9724 , title = {{Resilience of the {Internet} to random breakdown}}
9728 , pages = {4626--4628}
9733 @Article{ceh-fcomf-01
9734 , author = ChanTM #and# EfratA #and# Har-PeledS
9735 , title = {{Fly Cheaply: On the Minimum Fuel Consumption Problem}}
9738 , pages = {330--337}
9743 @unpublished{cf-csg-08
9744 , author = CastellanoC #and# FortunatoS
9745 , title = {{Community Structure in Graphs}}
9746 , note = {to appear as chapter of Springer's Encyclopedia of Complexity and Systems Science; arXiv:0712.2716v1}
9747 , url = "http://arxiv.org/abs/0712.2716"
9751 @Article{cf-gmlga-06
9752 , author = ChakrabartiD #and# FaloutsosC
9753 , title = {{Graph Mining: Laws, Generators, and Algorithms}}
9754 , doi = "http://doi.acm.org/10.1145/1132952.1132954"
9755 , journal = j-acm-csur
9758 , publisher = pub-acm
9759 , url = "http://doi.acm.org/10.1145/1132952.1132954"
9765 , author = CooperC #and# FriezeAM
9766 , title = {{A General Model of Web Graphs}}
9768 , pages = {311--335}
9773 @InProceedings{cfh-ahacp-12
9774 , author = CvijicS #and# FeldmannP #and# HieM
9775 , title = {{Applications of Homotopy for solving AC Power Flow and AC Optimal Power Flow}}
9776 , booktitle = {{Power and Energy Society General Meeting}}
9777 , note = {IEEE Conference Publications, 2012}
9779 , publisher = pub-ieee
9783 @InProceedings{cfj-lklth-04
9784 , author = ChorB #and# FellowsMR #and# JuedesD
9785 , title = {{Linear Kernels in Linear Time, or How to Save $k$ Colors in O($n^2$) Steps}}
9786 , booktitle = {{Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)}}
9787 , pages = {257--269}
9788 , publisher = pub-springer
9789 , series = ser-springer_lncs
9793 @InProceedings{cfk-a-96
9794 , author = CowenL #and# FeigenbaumJ #and# KannanS
9795 , title = {{A formal framework for evaluating heuristic programs}}
9796 , booktitle = {{Proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP'96)}}
9798 , pdf = "http://www.springerlink.com/content/y4l32017vp448844/fulltext.pdf"
9799 , publisher = pub-springer
9800 , series = ser-springer_lncs
9801 , volume = {1099/1996}
9805 @article{cfm-ubdg-94
9806 , author = ChungFRK #and# FaberV #and# ManteuffelTA
9807 , title = {{An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian}}
9810 , pages = {443--457}
9815 @InProceedings{cg-cepod-03
9816 , author = ChandaA #and# GargA
9817 , title = {{Compact Encodings of Planar Orthogonal Drawings}}
9818 , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}}
9820 , pages = {174--185}
9821 , publisher = pub-springer
9822 , series = ser-springer_lncs
9827 @InProceedings{cg-epgig-09
9828 , author = ChalopinJ #and# GoncalvesD
9829 , title = {{Every Planar Graph is the Intersection Graph of Segments in the Plane}}
9830 , booktitle = {{Proceedings of the 41st Annual {ACM} Symposium on the Theory of Computing (STOC'09)}}
9831 , pages = {631--638}
9832 , publisher = pub-acm
9837 , author = CantnerU #and# GrafH
9838 , title = {{The network of innovators in Jena: An application of social network analysis}}
9842 , pages = {463--480}
9843 , 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"
9849 , title = {{\textsc{Cgal}, {C}omputational {G}eometry {A}lgorithms {L}ibrary}}
9850 , url = "http://www.cgal.org"
9853 @InProceedings{cghkl-cepgc-98
9854 , author = ChuangRC #and# GargA #and# HeXi #and# KaoM #and# LuH
9855 , title = {{Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses}}
9856 , booktitle = {{Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98)}}
9857 , note = {Extended version with proofs: arXiv:cs/0102005v2 [cs.DS]}
9858 , pages = {118--129}
9859 , publisher = pub-springer
9860 , series = ser-springer_lncs
9865 @Article{cgjsw-tcras-04
9866 , author = ChangH #and# GovindanR #and# JaminS #and# ShenkerSJ #and# WillingerW
9867 , title = {{Towards Capturing Representative AS-level Internet Topologies}}
9871 , pages = {737--755}
9872 , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6VRG-4B22S07-1-1T&_cdi=6234&_user=2149863&_"
9873 , url = "http://dx.doi.org/10.1016/j.comnet.2003.03.001"
9878 @InProceedings{cgmw-ivpg-09
9879 , author = ChimaniM #and# GutwengerC #and# MutzelP #and# WolfC
9880 , title = {{Inserting a Vertex into a Planar Graph}}
9881 , booktitle = {{Proceedings of the 20st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'09)}}
9882 , pages = {375--383}
9887 , author = CherkasskyBV #and# GoldbergAV #and# RadzikT
9888 , title = {{Shortest paths algorithms}}
9889 , journal = j-math-prog-a
9890 , pages = {129--174}
9895 @InProceedings{cgs-bhlmp-97
9896 , author = CherkasskyBV #and# GoldbergAV #and# SilversteinC
9897 , title = {{Buckets, Heaps, Lists, and Monotone Priority Queues}}
9898 , booktitle = {{Proceedings of the 8th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'97)}}
9900 , pdf = "http://xenon.stanford.edu/~csilvers/papers/hotq-soda.ps"
9901 , publisher = pub-ieeecs
9905 @InProceedings{cgw-cqi-03
9906 , author = CharikarM #and# GuruswamiV #and# WirthA
9907 , title = {{Clustering with Qualitative Information}}
9908 , booktitle = {{Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03)}}
9909 , isbn = "0272-5428"
9910 , pdf = "http://ieeexplore.ieee.org/iel5/8767/27770/01238225.pdf?isnumber=&arnumber=1238225"
9911 , publisher = pub-ieeecs
9912 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1238225"
9917 , author = CharikarM #and# GuruswamiV #and# WirthA
9918 , title = {{Clustering with Qualitative Information}}
9922 , pages = {360--383}
9923 , url = "http://dx.doi.org/10.1016/j.jcss.2004.10.012"
9928 @Article{ch-acspp-09
9929 , author = ChandranBG #and# HochbaumDS
9930 , title = {{A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem}}
9934 , pages = {358--376}
9940 , author = ChengC #and# HuTC
9941 , title = {{Maximum Concurrent Flows and Minimum Cuts}}
9943 , pages = {233--249}
9949 , editor = CookDJ #and# HolderLB
9950 , title = {{Mining Graph Data}}
9951 , booktitle = {{Mining Graph Data}}
9952 , publisher = pub-wiley
9953 , url = "http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0471731900.html"
9958 , author = CheriyanJ #and# HagerupT
9959 , title = {{A Randomized Maximum-Flow Algorithm}}
9960 , journal = j-sicomp
9962 , pages = {203--226}
9967 @Article{ch-tsrtn-66
9968 , author = CookeK #and# HalseyE
9969 , title = {{The Shortest Route Through a Network with Time-Dependent Intermodal Transit Times}}
9972 , pages = {493--498}
9977 @article{chb-gfib-80
9978 , author = CarringtonPJ #and# HeilGH #and# BerkowitzSD
9979 , title = {{A Goodness-of-Fit Index for Blockmodels}}
9981 , pages = {219--234}
9986 @InCollection{chb-spsfn-97
9987 , author = CohenR #and# HavlinS #and# ben-AvrahamD
9988 , title = {{Structural Properties of Scale-Free Networks}}
9989 , booktitle = {{Handbook of Discrete and Computational Geometry}}
9990 , isbn = "0-8493-8524-5"
9992 , publisher = {CRC Press LLC, Boca}
9996 @InProceedings{chk-ddguo-03
9997 , author = CarmelL #and# HarelD #and# KorenY
9998 , title = {{Drawing Directed Graphs Using One-Dimensional Optimization}}
9999 , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}}
10001 , pages = {311--330}
10002 , pdf = "http://www.springerlink.com/content/cr3574jvb3xld9p0/fulltext.pdf"
10003 , publisher = pub-springer
10004 , series = ser-springer_lncs
10005 , url = "http://www.springerlink.com/content/cr3574jvb3xld9p0/"
10010 @Article{chkss-mitus-07
10011 , author = CarmiS #and# HavlinS #and# KirkpatrickS #and# ShavittY #and# ShirE
10012 , title = {{A Model of Internet Topology Using $k$-Shell Decomposition}}
10014 , pages = {11150--11154}
10015 , pdf = "http://www.pnas.org/cgi/reprint/104/27/11150"
10016 , url = "http://www.pnas.org/cgi/content/abstract/104/27/11150"
10021 @Article{chkz-rdqhl-03
10022 , author = CohenE #and# HalperinE #and# KaplanH #and# ZwickU
10023 , title = {{Reachability and Distance Queries via 2-Hop Labels}}
10024 , journal = j-sicomp
10026 , pages = {1338--1355}
10032 , author = CafieriS #and# HansenP #and# LibertiL
10033 , title = {{Loops and multiple edges in modularity maximization of networks}}
10037 , url = "http://link.aps.org/doi/10.1103/PhysRevE.81.046102"
10042 @Article{chl-vrfpg-09
10043 , author = ChenCY #and# HungY #and# LuH
10044 , title = {{Visibility Representations of Four-connected Plane Graphs with Near Optimal Heights}}
10046 , pages = {865--872}
10051 @article{chm-tmfa-96
10052 , author = CheriyanJ #and# HagerupT #and# MehlhornK
10053 , title = {{An $o(n^3)$-Time Maximum-Flow Algorithm}}
10054 , journal = j-sicomp
10057 , pages = {144--1170}
10062 @article{cjtw-dddcm-93
10063 , author = ChartrandG #and# JohnsGL #and# TianS #and# WintersSJ
10064 , title = {{Directed Distance on Digraphs: Centers and Medians.}}
10067 , pages = {509--521}
10072 @Article{ck-agppp-01
10073 , author = CondonA #and# KarpRM
10074 , title = {{Algorithms for Graph Partitioning on the Planted Partition Model}}
10077 , pages = {116--140}
10078 , url = "http://dx.doi.org/10.1002/1098-2418(200103)18:2<116::AID-RSA1001>3.0.CO;2-2"
10083 @Article{ck-cgdcp-97
10084 , author = ChrobakM #and# KantG
10085 , title = {{Convex Grid Drawings of $3$-Connected Planar Graphs}}
10086 , journal = j-ijcga
10088 , pages = {211--223}
10093 @InProceedings{ckkk-msdra-10
10094 , author = CooganK #and# KhareV #and# KobourovSG #and# KatzB
10095 , title = {{Multi-Scale Dead-Reckoning Algorithm for Distributed Force-Directed Sensor Network Localization}}
10096 , booktitle = {{Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'10)}}
10097 , series = ser-springer_lncs
10101 @Article{ckkknt-acmwr-12
10102 , author = ChunJ #and# KaothanthongN #and# KasaiR #and# KormanM #and# NollenburgM #and# TokuyamaT
10103 , title = {{Algorithms for computing the maximum weight region decomposable into elementary shapes}}
10106 , pages = {803--814}
10107 , url = "http://dx.doi.org/10.1016/j.cviu.2012.03.003"
10112 @techreport{cklrw-opmsh-13
10113 , author = ChenJ #and# KaoMJ #and# LeeD #and# RutterI #and# WagnerD
10114 , title = {{Online Power-Managing Strategy with Hard Real-Time Guarantees }}
10115 , institution = kit_wagner
10116 , url = "http://arxiv.org/abs/1304.1590 "
10120 @InProceedings{ckmst-e-11
10121 , author = ChristianoP #and# KelnerJA #and# MadryA #and# SpielmanDA #and# TengS
10122 , title = {{Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs}}
10123 , booktitle = {{Proceedings of the 43rd Annual {ACM} Symposium on the Theory of Computing (STOC'11)}}
10124 , pages = {273--282}
10125 , publisher = pub-acm
10126 , url = "http://doi.acm.org/10.1145/1993636.1993674"
10130 @InProceedings{cknt-cdr-08
10131 , author = ChunJ #and# KormanM #and# NollenburgM #and# TokuyamaT
10132 , title = {{Consistent Digital Rays}}
10133 , booktitle = {{Proceedings of the 24th Annual ACM Symposium on Computational Geometry (SoCG'08)}}
10134 , pages = {355--364}
10135 , pdf = "http://i11www.ira.uka.de/extra/publications/cknt-cdr-08.pdf"
10136 , publisher = pub-acm
10137 , url = "http://dl.acm.org/authorize?087105"
10141 @InProceedings{cknt-cdr-08ecg
10142 , author = ChunJ #and# KormanM #and# NollenburgM #and# TokuyamaT
10143 , title = {{Consistent Digital Rays}}
10144 , booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)}}
10145 , pages = {169--172}
10146 , pdf = "http://i11www.ira.uka.de/extra/publications/cknt-cdr-08ecg.pdf"
10150 @Article{cknt-cdr-09
10151 , author = ChunJ #and# KormanM #and# NollenburgM #and# TokuyamaT
10152 , title = {{Consistent Digital Rays}}
10154 , note = {Special issue of SoCG 2008}
10156 , pages = {359--378}
10157 , pdf = "http://i11www.ira.uka.de/extra/publications/cknt-cdr-09.pdf"
10158 , url = "http://dx.doi.org/10.1007/s00454-009-9166-2"
10163 @article{cks-gsdg-98
10164 , author = ChartrandG #and# KubickiG #and# SchultzM
10165 , title = {{Graph similarity and distance in graphs}}
10168 , pages = {129--145}
10173 @unpublished{cks-piaatn-02
10174 , author = CarpenterT #and# KarakostasG #and# ShallcrossD
10175 , title = {{Pracical Issues and Algorithms for Analyzing Terrorist Networks}}
10176 , note = {invited talk at WMC 2002}
10177 , url = "http://www.cas.mcmaster.ca/~gk/papers/wmc2002.pdf"
10181 @InProceedings{ckt-ec-06
10182 , author = ChakrabartiD #and# KumarR #and# TomkinsAS
10183 , title = {{Evolutionary Clustering}}
10184 , booktitle = {{Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}}
10185 , pages = {554--560}
10186 , pdf = "http://www.cs.cmu.edu/~deepay/mywww/papers/kdd06-evolutionary.pdf"
10187 , publisher = pub-acm
10188 , url = "http://doi.acm.org/10.1145/1150402.1150467"
10192 @Article{ckvw-admmc-06
10193 , author = ChengD #and# KannanR #and# VempalaS #and# WangG
10194 , title = {{A Divide-and-Merge Methodology for Clustering}}
10195 , journal = j-acmtds
10197 , pages = {1499--1525}
10198 , url = "http://doi.acm.org/10.1145/1189769.1189779"
10203 @InProceedings{ckx-ipubv-06
10204 , author = ChenJianer #and# KanjIA #and# XiaG
10205 , title = {{Improved Parameterized Upper Bounds for Vertex Cover }}
10206 , booktitle = {{Proceedings of the 31th International Symposium on Mathematical Foundations of Computer Science (MFCS'06)}}
10207 , pages = {238--249}
10208 , publisher = pub-springer
10209 , series = ser-springer_lncs
10213 @Article{cl-ccrgg-02
10214 , author = ChungFRK #and# LuL
10215 , title = {{Connected Components in Random Graphs Graphs with Given Expected Degree Sequences }}
10218 , pages = {125--145}
10219 , url = "http://www.combinatorics.net/aoc/toc/v6n2/Chung/6_2_125.htm"
10224 @Article{cll-osta-05
10225 , author = ChiangY #and# LinC #and# LuH
10226 , title = {{Orderly Spanning Trees with Applications}}
10227 , journal = j-sicomp
10229 , pages = {924--945}
10234 @InProceedings{cll-ostag-01
10235 , author = ChiangY #and# LinC #and# LuH
10236 , title = {{Orderly Spanning Trees with Applications to Graph Encoding and Graph Drawing}}
10237 , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}}
10238 , pages = {506--515}
10242 @InProceedings{clly-saost-03
10243 , author = ChenHo #and# LiaoC #and# LuH #and# YenH
10244 , title = {{Some Applications of Orderly Spanning Trees in Graph Drawing}}
10245 , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}}
10247 , pages = {332--343}
10248 , publisher = pub-springer
10249 , series = ser-springer_lncs
10255 , author = CormenTH #and# LeisersonCE #and# RivestRL #and# SteinC
10256 , title = {{Introduction to Algorithms}}
10258 , publisher = pub-mitpr
10263 , editor = CookW #and# LovaszL #and# SeymourPD
10264 , title = {{DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, Volume 20 on the ``Year of Combinatorial Optimization''}}
10265 , booktitle = {{DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, Volume 20 on the ``Year of Combinatorial Optimization''}}
10266 , publisher = pub-ams
10270 @Article{clv-erpg-03
10271 , author = ChungFRK #and# LuL #and# VuV
10272 , title = {{Eigenvalues of Random Power Law Graphs}}
10275 , pdf = "http://www.math.ucsd.edu/~fan/wp/eigen.pdf"
10280 @article{clv-srged-03
10281 , author = ChungFRK #and# LuL #and# VuV
10282 , title = {{The spectra of random graphs with given expected degree}}
10286 , pages = {6313--6318}
10287 , url = "http://www.math.ucsd.edu/~fan/wp/specp.pdf"
10292 @Article{cm-fnici-88
10293 , author = CheriyanJ #and# MaheshwariSN
10294 , title = {{Finding Nonseparating Induced Cycles and Independent Spanning Trees in
\r
10295 3-Connected Graphs}}
10297 , pages = {507--537}
10302 @Article{cm-gptea-84
10303 , author = ClevelandWS #and# McGillR
10304 , title = {{Graphical Perception: Theory, Experimentation, and Application to the Development of Graphical Methods}}
10308 , pages = {531--554}
10309 , url = "http://links.jstor.org/sici?sici=0162-1459(198409)79\%3A387\%3C531\%3AGPTEAA\%3E2.0.CO\%3B2-Y"
10314 @article{cm-sgaos-79
10315 , author = CapobiancoMF #and# MolluzzoJC
10316 , title = {{The Strength of a Graph and its Application to Organizational Structure}}
10318 , pages = {275--283}
10324 , author = ChataignerF #and# ManicG #and# WakabayashiY #and# YusterR
10325 , title = {{Approximation algorithms and hardness results for the clique packing problem}}
10326 , journal = j-endima
10327 , pages = {397--401}
10328 , url = "http://www.sciencedirect.com/science/article/B75GV-4PCHPN5-2B/2/9b2344d3c2954b524ba9f6c609e7422d"
10333 @Article{cn-mwgdp-98
10334 , author = ChrobakM #and# NakanoS
10335 , title = {{Minimum-Width Grid Drawings of Plane Graphs}}
10343 @Article{cnm-fcsln-04
10344 , author = ClausetA #and# NewmanMEJ #and# MooreC
10345 , title = {{Finding community structure in very large networks}}
10346 , doi = "doi://10.1103/PhysRevE.70.066111"
10349 , url = "http://link.aps.org/abstract/PRE/v70/e066111"
10354 @article{cnsw-nrfpr-00
10355 , author = CallawayDS #and# NewmanMEJ #and# StrogatzSH #and# WattsDJ
10356 , title = {{Network Robustness and Fragility: {Percolation} on Random Graphs}}
10360 , pages = {5468-5471}
10361 , url = "http://arXiv.org/abs/cond-mat/0007300"
10366 @article{co-wglii-00
10367 , author = ChungFRK #and# OdenK
10368 , title = {{Weighted Graph Laplacians and Isoperimetric Inequalities}}
10370 , pages = {257--274}
10371 , url = "http://citeseer.nj.nec.com/381180.html"
10376 @Article{cp-altad-95
10377 , author = ChrobakM #and# PayneTH
10378 , title = {{A Linear-Time Algorithm for Drawing a Planar Graph on a Grid}}
10381 , pages = {241--246}
10386 @Article{cp-irgi-08
10387 , author = CzajkaT #and# PanduranganG
10388 , title = {{Improved Random Graph Isomorphism}}
10393 , pdf = "http://www.cs.purdue.edu/homes/gopal/gi.pdf"
10398 @Article{cp-ptsco-08
10399 , author = ChevalierC #and# PellegriniF
10400 , title = {{PT-SCOTCH: A Tool for Efficient Parallel Graph Ordering}}
10402 , pages = {318--331}
10408 , title = {{CPLEX}}
10409 , institution = "ILOG"
10410 , note = {Mathematical programming optimizer, ILOG, {http://www.ilog.com/products/cplex}}
10411 , url = "http://www.ilog.com/products/cplex"
10414 @inproceedings{cr-dstn-92
10415 , author = CheriyanJ #and# ReifJH
10416 , title = {{Directed $s$-$t$ Numberings, Rubber Bands, and Testing Digraph $k$-Vertex Connectivity}}
10417 , booktitle = {{Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)}}
10419 , pages = {335--344}
10424 , author = CvetkovicDM #and# RowlinsonP #and# SimicS
10425 , title = {{Eigenspaces of Graphs}}
10426 , publisher = pub-cup
10431 , author = CulbersonJC #and# SchaefferJ
10432 , title = {{Pattern Databases}}
10435 , pages = {318--334}
10440 @Article{csw-airbc-07
10441 , author = ChataignerF #and# SalgadoLB #and# WakabayashiY
10442 , title = {{Approximation and Inapproximability Results on Balanced Connected Partitions of Graphs}}
10443 , journal = j-dmtcs
10445 , pages = {177--192}
10446 , url = "http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/85"
10451 @InProceedings{csw-dgttl-03
10452 , author = CornelsenS #and# SchankT #and# WagnerD
10453 , title = {{Drawing Graphs on Two and Three Lines}}
10454 , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}}
10457 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/csw-dg23l-03.pdf"
10458 , publisher = pub-springer
10459 , series = ser-springer_lncs
10464 @Article{csw-dgttl-04
10465 , author = CornelsenS #and# SchankT #and# WagnerD
10466 , title = {{Drawing Graphs on Two and Three Lines}}
10469 , pages = {161--177}
10470 , pdf = "http://jgaa.info/accepted/2004/CornelsenSchankWagner2004.8.2.pdf"
10475 @InProceedings{csx-gadbd-02
10476 , author = ChenDZ #and# SmidM #and# XuB
10477 , title = {{Geometric Algorithms for Density-Based Data Clustering}}
10478 , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}}
10479 , pages = {284--296}
10480 , pdf = "http://www.springerlink.com/content/gvr26cunkyhmh5rf/fulltext.pdf"
10481 , publisher = pub-springer
10482 , series = ser-springer_lncs
10483 , url = "http://www.springerlink.com/content/gvr26cunkyhmh5rf/"
10488 @InProceedings{cszy-mpnnr-09
10489 , author = ChenZ #and# ShenHT #and# ZhouX #and# YuJeff
10490 , title = {{Monitoring Path Nearest Neighbor in Road Networks}}
10491 , booktitle = {{Proceedings of the 2009 ACM SIGMOD international conference on Management of data (SIGMOD'09)}}
10492 , pages = {591--602}
10493 , publisher = pub-acm
10498 , author = CoverTM #and# ThomasJA
10499 , title = {{Elements of Information Theory}}
10500 , booktitle = {{Elements of Information Theory}}
10501 , publisher = pub-wileys
10502 , url = "http://www.elementsofinformationtheory.com/"
10506 @article{ct-fasnc-99
10507 , author = CheriyanJ #and# ThurimellaR
10508 , title = {{Fast Algorithms for $k$-Shredders and $k$-Node Connectivity Augmentation}}
10516 , author = ChangJ #and# TassiulasL
10517 , title = {{Maximum lifetime routing in wireless sensor networks}}
10523 @InProceedings{ctlw-eetcw-05
10524 , author = CardeiM #and# ThaiMT #and# LiY #and# WuW
10525 , title = {{Energy-Efficient Target Coverage in Wireless Sensor Networks}}
10526 , booktitle = {{Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
10528 , pages = {1976--1984}
10529 , publisher = pub-ieeecs
10535 , editor = CaldarelliG #and# VespignaniA
10536 , title = {{Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science}}
10537 , booktitle = {{Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science}}
10538 , publisher = pub-wsp
10539 , series = ser-csic
10544 @InProceedings{cw-cccg-03
10545 , author = CornelsenS #and# WagnerD
10546 , title = {{Completely Connected Clustered Graphs}}
10547 , booktitle = {{Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)}}
10548 , pages = {168--179}
10549 , publisher = pub-springer
10550 , series = ser-springer_lncs
10551 , url = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/cw-cccg-03.ps.gz"
10556 @Article{cw-cccg-06
10557 , author = CornelsenS #and# WagnerD
10558 , title = {{Completely Connected Clustered Graphs}}
10561 , pages = {313--323}
10562 , url = "http://dx.doi.org/10.1016/j.jda.2005.06.002"
10568 , author = CardeiM #and# WuW
10569 , title = {{Energy-efficient coverage problems in wireless ad-hoc sensor networks}}
10570 , journal = j-comcom
10572 , pages = {413--420}
10577 @article{cw-mmap-90
10578 , author = CoppersmithD #and# WinogradS
10579 , title = {{Matrix multiplication via arithmetic progressions}}
10582 , pages = {251--280}
10588 , author = CarterL #and# WegmanMN
10589 , title = {{Universal classes of hash functions}}
10592 , pages = {143--154}
10597 @InProceedings{cww-rfccf-10
10598 , author = ChenDZ #and# WangChao #and# WangH
10599 , title = {{Representing a Functional Curve by Curves with Fewer Peaks}}
10600 , booktitle = {{Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10)}}
10602 , pages = {200--211}
10603 , publisher = pub-springer
10604 , series = ser-springer_lncs
10605 , url = "http://dx.doi.org/10.1007/978-3-642-13731-0_20"
10610 @InProceedings{cy-efsg-97
10611 , author = ChungFRK #and# YauS
10612 , title = {{Eigenvalues, Flows and Separators of Graphs}}
10613 , booktitle = {{Proceedings of the 29th Annual ACM Symposium on Theory of Computing}}
10615 , publisher = pub-acm
10619 @InProceedings{cy-noaes-94
10620 , author = ChungFRK #and# YauS
10621 , title = {{A Near Optimal Algorithm for Edge Separators}}
10622 , booktitle = {{Proceedings of the 26th Annual ACM Symposium on Theory of Computing}}
10624 , publisher = pub-acm
10628 @InProceedings{cy-oesdq-09
10629 , author = ChengJ #and# YuJX
10630 , title = {{On-line Exact Shortest Distance Query Processing}}
10631 , booktitle = {{Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (EDBT '09)}}
10632 , pages = {481--492}
10633 , publisher = pub-acm
10637 %% --------------------------------------------------------------
10641 , title = {{A faster divide-and-conquer algorithm for constructing delaunay triangulations}}
10644 , pages = {137--151}
10645 , url = "http://dx.doi.org/10.1007/BF01840356"
10650 @Article{d-aassp-69
10651 , author = DreyfusSE
10652 , title = {{An Appraisal of Some Shortest-Path Algorithms}}
10655 , pages = {395--412}
10660 @mastersthesis{d-aevg-06
10661 , author = DellingD
10662 , title = {{Analyse und Evaluierung von Vergleichsma{\ss}en f{\"u}r Graphclusterungen}}
10664 , pdf = "http://i11www.ira.uka.de/extra/publications/d-aevg-06.pdf"
10666 , type = {Diplomarbeit}
10671 , author = DurstenfeldR
10672 , title = {{Algorithm 235: Random Permutation}}
10673 , journal = j-comm-acm
10676 , pages = {420--421}
10677 , url = "http://portal.acm.org/citation.cfm?doid=364520.364540"
10682 @Article{d-ascnp-09
10683 , author = DunlaingCO
10684 , title = {{A Simple Criterion for Nodal 3-connectivity in Planar Graphs}}
10685 , journal = j-entcs
10686 , pages = {245--253}
10691 @InProceedings{d-asmag-08
10692 , author = DjidjevHN
10693 , title = {{A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection}}
10694 , booktitle = {{Algorithms and Models for the Web-Graph, Proceedings of the 4th International Workshop, WAW 2006}}
10695 , pages = {117--128}
10696 , publisher = pub-springer
10697 , series = ser-springer_lncs
10698 , url = "http://www.springerlink.com/content/6870084453701423/"
10702 @inproceedings{d-asmtp-51
10703 , author = DantzigGB
10704 , editor = KoopmansTC
10705 , title = {{Application of the Simplex Method to a Transportation Problem}}
10706 , booktitle = {{Activity Analysis of Production and Allocation}}
10707 , pages = {359--373}
10708 , publisher = pub-wiley
10709 , series = "Cowles Commission fo"
10714 @Article{d-aspft-69
10716 , title = {{Algorithm 360: Shortest-Path Forest with Topological Ordering [H]}}
10717 , journal = j-comm-acm
10719 , pages = {632--633}
10724 @Article{d-aspmf-70
10726 , title = {{Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation}}
10727 , journal = j-sov-math-dokl
10730 , pages = {1277--1280}
10731 , pdf = "http://www.cs.bgu.ac.il/~dinitz/D70.pdf"
10736 @inproceedings{d-bmgn-96
10738 , title = {{A Better Model for Generating Test Networks}}
10739 , booktitle = {{IEEE GLOBECOM'96}}
10743 @incollection{d-brdmttp-73
10745 , editor = FridmanAA
10746 , title = {{Bitwise residual decreasing method and transportation type problems}}
10747 , booktitle = {{Studies in Discrete Mathematics}}
10748 , note = {(In Russian)}
10750 , publisher = pub-nauka
10754 @mastersthesis{d-carrn-10
10756 , title = {{Computing Alternative Routes in Road Networks}}
10758 , school = "Karlsruhe Institut f{\"u}r Technologie, Fakult{\"a}t f{\"u}r Informatik"
10762 @mastersthesis{d-ctdsp-99
10764 , title = {{Continuous-Time Dynamic Shortest Path Algorithms}}
10765 , pdf = "http://www.cs.clemson.edu/~bcdean/bdean_masters_thesis.pdf"
10766 , school = "Massachusetts Institute of Technology"
10770 @phdthesis{d-earpa-09
10771 , author = DellingD
10772 , title = {{Engineering and Augmenting Route Planning Algorithms}}
10773 , pdf = "http://i11www.ira.uka.de/extra/publications/d-earpa-09.pdf"
10775 , url = "url{http://i11www.ira.uka.de/extra/publications/d-earpa-09.pdf}"
10781 , title = {{Extensions of Tur{\'a}n's theorem on graphs}}
10782 , journal = j-amash
10783 , pages = {417--422}
10788 @phdthesis{d-fdapp-01
10789 , author = DemetrescuC
10790 , title = {{Fully Dynamic Algorithms for Path Problems on Directed Graphs}}
10792 , school = "University of Rome La Sapienza, Department of Computer and Systems Science"
10796 @inproceedings{d-fspn-78
10798 , editor = PopkovY #and# ShmulyianB
10799 , title = {{Finding shortest paths in a network}}
10800 , booktitle = {{Transportation Modeling Systems}}
10802 , publisher = {Institute for System}
10806 @InProceedings{d-gdt-08
10807 , author = DhandapaniR
10808 , title = {{Greedy Drawings of Triangulations}}
10809 , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}}
10810 , pages = {102--111}
10815 , author = DiestelR
10816 , title = {{Graph Theory}}
10817 , booktitle = {{Graph Theory}}
10819 , publisher = pub-springer
10820 , series = ser-springer_gtm
10825 , author = DiestelR
10826 , title = {{Graph Theory}}
10827 , booktitle = {{Graph Theory}}
10828 , publisher = pub-springer
10829 , series = ser-springer_gtm
10835 , title = {{Hierarchical Cut Clustering in Dynamic Scenarios}}
10836 , institution = "Karlsruhe Institute of Technology (KIT)"
10838 , note = {Student Project, Studienarbeit}
10839 , school = "Department of Informatics"
10844 , author = DantzigGB
10845 , title = {{Linear Programming and Extensions}}
10846 , booktitle = {{Linear Programming and Extensions}}
10847 , publisher = pub-pup
10852 , author = DantzigGB
10853 , title = {{Linear Programming and Extensions}}
10854 , booktitle = {{Linear Programming and Extensions}}
10855 , publisher = pub-pup
10859 @mastersthesis{d-mhrs-12
10861 , title = {{Multi-Hop Ride Sharing}}
10862 , institution = "Karlsruhe Institute of Technology"
10864 , type = {bachelor thesis}
10868 @inproceedings{d-mlfvsli-51
10869 , author = DantzigGB
10870 , editor = KoopmansTC
10871 , title = {{Maximization of a Linear Function of Variables Subject to Linear Inequalities}}
10872 , booktitle = {{Activity Analysis of Production and Allocation}}
10873 , pages = {339--347}
10874 , publisher = pub-wiley
10875 , series = "Cowles Commission fo"
10880 @Article{d-ntpcg-59
10881 , author = DijkstraEW
10882 , title = {{A Note on Two Problems in Connexion with Graphs}}
10883 , journal = j-nummat
10884 , pages = {269--271}
10890 , author = DillencourtMB
10891 , title = {{Realizability of Delaunay triangulations}}
10894 , pages = {283--287}
10899 @techreport{d-spfif-04
10901 , title = {{Shortest Paths in FIFO Time-Dependent Networks: Theory and Algorithms}}
10902 , institution = "Massachusetts Institute Of Technology"
10908 , title = {{Software Visualization}}
10909 , booktitle = {{Software Visualization}}
10910 , publisher = pub-springer
10911 , series = ser-springer_lncs
10916 @InProceedings{d-tdsr-08
10917 , author = DellingD
10918 , title = {{Time-Dependent SHARC-Routing}}
10919 , booktitle = {{Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)}}
10921 , note = {Best Student Paper Award - ESA Track B}
10922 , pages = {332--343}
10923 , pdf = "http://i11www.ira.uka.de/extra/publications/d-tdsr-08.pdf"
10924 , publisher = pub-springer
10925 , series = ser-springer_lncs
10931 , author = DellingD
10932 , title = {{Time-Dependent SHARC-Routing}}
10937 , pdf = "http://i11www.ira.uka.de/extra/publications/d-tdsr-09.pdf"
10938 , url = "http://dx.doi.org/10.1007/s00453-009-9341-0"
10943 @article{d-umnat-88
10944 , author = DoreianP
10945 , title = {{Using Multiple Network Analytic Tools for a Single Social Network}}
10947 , pages = {287--312}
10952 @Article{da-cdcne-05
10953 , author = DuchJ #and# ArenasA
10954 , title = {{Community Detection in Complex Networks using Extremal Optimization}}
10958 , url = "http://link.aps.org/abstract/PRE/v72/e027104"
10963 @article{da-ppan-89
10964 , author = DoreianP #and# AlbertLH
10965 , title = {{Partitioning Political Actor Networks: Some Quantitative Tools for Analyzing Qualitative Networks}}
10967 , pages = {279--291}
10972 @InProceedings{db-rahnu-97
10973 , author = DasB #and# BharghavanV
10974 , title = {{Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets}}
10975 , booktitle = {{Proceedings of the IEEE International Conference on Communications 1997}}
10976 , pages = {376--380}
10981 , author = DoreianP #and# BatageljV #and# FerligojA
10982 , title = {{Generalized Blockmodeling}}
10983 , booktitle = {{Generalized Blockmodeling}}
10984 , publisher = pub-cup
10985 , series = ser-sass
10986 , url = "http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=9780521840859"
10991 @article{dbf-gbtmn-04
10992 , author = DoreianP #and# BatageljV #and# FerligojA
10993 , title = {{Generalized Blockmodeling of Two-Mode Network Data}}
11001 @Article{dbf-sadn-00
11002 , author = DoreianP #and# BatageljV #and# FerligojA
11003 , title = {{Symmetric-Acyclic Decompositions of Networks}}
11011 @Article{dbhhv-zdmsp-02
11012 , author = DevineK #and# BomanE #and# HeaphyR #and# HendricksonB #and# VaughanC
11013 , title = {{Zoltan Data Management Services for Parallel Dynamic Applications}}
11017 , pdf = "http://www.sandia.gov/~egboman/papers/Zoltan_CSE.pdf"
11018 , url = "http://dx.doi.org/10.1109/5992.988653"
11023 @InProceedings{dbs-a-10
11024 , author = DemiryurekU #and# Banaei-KashaniF #and# ShahabiC
11025 , title = {{A case for time-dependent shortest path computation in spatial networks}}
11026 , booktitle = {{Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS'10)}}
11027 , pages = {474--477 }
11031 @InProceedings{dbsl-csdge-12
11032 , author = DuschlM #and# BrennerT #and# SchimkeA #and# LuxenD
11033 , title = {{Contribution and Spatial Dimension of Geolocated External Factors to the Growth of Firms -- Empirical Evidence for Germany }}
11034 , booktitle = {{Geography of Innovation 2012}}
11035 , pdf = "ftp://137.248.191.199/RePEc/pum/wpaper/WP14.pdf"
11040 , author = deBergM #and# CheongO #and# KreveldMv #and# OvermarsMH
11041 , title = {{Computational Geometry: Algorithms and Applications}}
11042 , booktitle = {{Computational Geometry: Algorithms and Applications}}
11043 , publisher = pub-springer
11044 , url = "http://www.springer.com/computer/theoretical+computer+science/book/978-3-540-77973-5"
11049 , author = DellingG #and# DellingD
11050 , title = {{Computergest{\"u}tzte Spracherkennung}}
11052 , pages = {115--119}
11058 , author = DomschkeW #and# DrexlA
11059 , title = {{Location and Layout Planning: An International Bibliography}}
11060 , address = "Berlin"
11061 , publisher = pub-springer
11066 , author = DasGuptaB #and# DevineK
11067 , title = {{On the Complexity of Newman's Community Finding Approach for Biological and Social Networks}}
11068 , note = {On the arxiv eprint repository}
11069 , pdf = "http://arxiv.org/pdf/1102.0969v1"
11070 , url = "http://arxiv.org/abs/1102.0969"
11075 , author = DanonL #and# DiazGuileraA #and# ArenasA
11076 , title = {{The effect of size heterogeneity on community identification in complex networks}}
11078 , number = {P11010}
11079 , url = "10.1088/1742-5468/2006/11/P11010"
11083 @Article{ddda-ccsi-05
11084 , author = DanonL #and# DiazGuileraA #and# DuchJ #and# ArenasA
11085 , title = {{Comparing Community Structure Identification}}
11087 , number = {P09008}
11089 , pdf = "http://www.iop.org/EJ/article/1742-5468/2005/09/P09008/jstat5_09_p09008.pdf"
11090 , url = "http://www.iop.org/EJ/abstract/1742-5468/2005/09/P09008"
11095 @InProceedings{ddfv-fdmaf-12
11096 , author = DangeloG #and# DEmidioM #and# FrigioniD #and# VitaleC
11097 , title = {{Fully Dynamic Maintenance of Arc-Flags in Road Networks}}
11098 , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}}
11099 , pages = {135--147}
11100 , publisher = pub-springer
11101 , series = ser-springer_lncs
11106 @Article{ddl-rdggc-08
11107 , author = DiGiacomoE #and# DidimoW #and# LiottaG
11108 , title = {{Radial Drawings of Graphs: Geometric Constraints and Trade-Offs}}
11112 , pages = {109--124}
11113 , url = "http://www.springerlink.com/content/w23872u835n24w31/"
11118 @Article{ddlw-ccdpg-05
11119 , author = DiGiacomoE #and# DidimoW #and# LiottaG #and# WismathSK
11120 , title = {{Curve-Constrained Drawings of Planar Graphs}}
11128 @InProceedings{ddlw-dpgc-03
11129 , author = DiGiacomoE #and# DidimoW #and# LiottaG #and# WismathSK
11130 , title = {{Drawing Planar Graphs on a Curve}}
11131 , booktitle = {{Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'03)}}
11132 , pages = {192--204}
11133 , publisher = pub-springer
11134 , series = ser-springer_lncs
11139 @techreport{ddpww-cemj-12
11140 , author = DellingD #and# DibbeltJ #and# PajorT #and# WagnerD #and# WerneckR
11141 , title = {{Computing and Evaluating Multimodal Journeys}}
11142 , institution = "Faculty of Informatics, Karlsruhe Institute of Technology"
11143 , number = {2012-20}
11144 , pdf = "http://i11www.ira.uka.de/extra/publications/ddpww-cemj-12.pdf"
11145 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000030757"
11149 @InProceedings{ddpww-cmjp-13
11150 , author = DellingD #and# DibbeltJ #and# PajorT #and# WagnerD #and# WerneckR
11151 , title = {{Computing Multimodal Journeys in Practice}}
11152 , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}}
11153 , pages = {260--271}
11154 , pdf = "http://i11www.ira.uka.de/extra/publications/ddpww-cmjp-13.pdf"
11155 , publisher = pub-springer
11156 , series = ser-springer_lncs
11161 @InProceedings{degkn-dtpar-10
11162 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM
11163 , title = {{Drawing Trees with Perfect Angular Resolution and Polynomial Area}}
11164 , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}}
11165 , note = {Full version available at \url{http://arxiv.org/abs/1009.0581}.}
11166 , pages = {183--194}
11167 , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-dtpar-10.pdf"
11168 , publisher = pub-springer
11169 , series = ser-springer_lncs
11170 , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_17"
11175 @Article{degkn-dtpar-13
11176 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM
11177 , title = {{Drawing Trees with Perfect Angular Resolution and Polynomial Area}}
11180 , pages = {157--182}
11181 , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-dtpar-12.pdf"
11182 , url = "http://dx.doi.org/10.1007/s00454-012-9472-y"
11187 @InProceedings{degkn-ldg-10
11188 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM
11189 , title = {{Lombardi Drawings of Graphs}}
11190 , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}}
11191 , note = {Full version available at \url{http://arxiv.org/abs/1009.0579}.}
11192 , pages = {195--207}
11193 , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-ldg-10.pdf"
11194 , publisher = pub-springer
11195 , series = ser-springer_lncs
11196 , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_18"
11201 @Article{degkn-ldg-12
11202 , author = DuncanCA #and# EppsteinD #and# GoodrichMT #and# KobourovSG #and# NollenburgM
11203 , title = {{Lombardi Drawings of Graphs}}
11205 , note = {Special issue of GD 2010.}
11207 , pages = {85--108}
11208 , pdf = "http://i11www.ira.uka.de/extra/publications/degkn-ldg-12.pdf"
11209 , url = "http://jgaa.info/accepted/2012/Duncan+2012.16.1.pdf"
11214 @InProceedings{dekw-dfe-02
11215 , author = DuncanCA #and# EfratA #and# KobourovSG #and# WenkC
11216 , title = {{Drawing with Fat Edges}}
11217 , booktitle = {{Proceedings of the 9th International Symposium on Graph Drawing (GD'01)}}
11219 , pages = {162--177}
11220 , publisher = pub-springer
11221 , series = ser-springer_lncs
11222 , url = "http://gdea.informatik.uni-koeln.de/archive/00000509/"
11227 @InProceedings{del-dgrac-09
11228 , author = DidimoW #and# EadesP #and# LiottaG
11229 , title = {{Drawing Graphs with Right Angle Crossings}}
11230 , booktitle = {{Algorithms and Data Structures, 11th International Symposium (WADS'09)}}
11232 , pages = {206--217}
11233 , publisher = pub-springer
11234 , series = ser-springer_lncs
11240 , editor = DehmerM #and# Emmert-StreibF #and# MehlerA
11241 , title = {{Towards an Information Theory of Complex Networks: Statistical Methods and Applications}}
11242 , booktitle = {{Towards an Information Theory of Complex Networks: Statistical Methods and Applications}}
11243 , publisher = {Birkh{"a}user Verlag}
11247 @Article{dett-adgab-94
11248 , author = DiBattistaG #and# EadesP #and# TamassiaR #and# TollisIG
11249 , title = {{Algorithms for Drawing Graphs: an Annotated Bibliography}}
11251 , pages = {235--282}
11256 @Article{df-fptci-95
11257 , author = DowneyRG #and# FellowsMR
11258 , title = {{Fixed-Parameter Tractability and Completeness I: Basic Results}}
11259 , journal = j-sicomp
11261 , pages = {873--921}
11262 , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SMJCAT000024000004000873000001"
11263 , url = "http://link.aip.org/link/?SMJCAT/24/873/1"
11268 @Article{df-fptcii-95
11269 , author = DowneyRG #and# FellowsMR
11270 , title = {{Fixed-Parameter Tractability and Completeness {II}. On Completeness for {{\cal W}[1]}}}
11273 , pages = {109--131}
11274 , url = "http://dx.doi.org/10.1016/0304-3975(94)00097-3"
11279 @incollection{df-mfmctn-56
11280 , author = DantzigGB #and# FulkersonDR
11281 , title = {{On the max-flow min-cut theorem of networks}}
11282 , booktitle = {{Linear Inequalities and Related Systems}}
11283 , pages = {215--221}
11284 , publisher = pub-pup
11285 , series = ser-ann_math_stud
11291 , author = DowneyRG #and# FellowsMR
11292 , title = {{Parameterized Complexity}}
11293 , publisher = pub-springer
11294 , series = ser-springer_mcs
11298 @Article{df-srmrp-79
11299 , author = DenardoEV #and# FoxBL
11300 , title = {{Shortest-Route Methods: 1. Reaching, Pruning, and Buckets}}
11303 , pages = {161--186}
11308 @InProceedings{dffgk-opset-12
11309 , author = DiGiacomoE #and# FratiF #and# FulekR #and# GrilliL #and# KrugM
11310 , title = {{Orthogeodesic Point-Set Embedding of Trees}}
11311 , booktitle = {{Proceedings of the 19th International Symposium on Graph Drawing (GD'11)}}
11312 , note = {to appear}
11313 , publisher = pub-springer
11314 , series = ser-springer_lncs
11318 @techreport{dffgk-opset-24
11319 , author = DiGiacomoE #and# FratiF #and# FulekR #and# GrilliL #and# KrugM
11320 , title = {{Orthogeodesic Point-Set Embedding of Trees}}
11321 , institution = kit_wagner
11322 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024215"
11326 @Book{dffgktw-spc-03
11327 , editor = DongarraJ #and# FosterI #and# FoxG #and# GroppW #and# KennedyK #and# TorczonL #and# WhiteA
11328 , title = {{Sourcebook of Parallel Computing}}
11329 , booktitle = {{Sourcebook of Parallel Computing}}
11330 , publisher = pub-mk
11334 @InCollection{dfin-vaett-02
11335 , author = DemetrescuC #and# FinocchiI #and# ItalianoGF #and# NaeherS
11336 , title = {{Visualization in Algorithm Engineering: Tools and Techniques}}
11337 , booktitle = {{Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software}}
11339 , publisher = pub-springer
11340 , series = ser-springer_lncs
11341 , url = "http://www.springerlink.com/content/8tlg4unm4bu3g00c/"
11346 @Article{dfk-fpaos-08
11347 , author = DujmovicV #and# FernauH #and# KaufmannM
11348 , title = {{Fixed Parameter Algorithms for One-Sided Crossing Minimization Revisited}}
11352 , pages = {313--323}
11353 , url = "http://www.springerlink.com/content/jwhew5fck9a3456d/"
11358 @InProceedings{dfkvv-clgm-99
11359 , author = DrineasP #and# FriezeAM #and# KannanR #and# VempalaS #and# VinayV
11360 , title = {{Clustering in Large Graphs and Matrices}}
11361 , booktitle = {{Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)}}
11362 , pages = {291--299}
11363 , publisher = pub-siam
11364 , url = "http://portal.acm.org/citation.cfm?id=314500.314576"
11368 @Article{dfkvv-clgsv-04
11369 , author = DrineasP #and# FriezeAM #and# KannanR #and# VempalaS #and# VinayV
11370 , title = {{Clustering Large Graphs via the Singular Value Decomposition}}
11374 , pdf = "http://springerlink.com/content/u424k6nn6k622788/fulltext.pdf"
11375 , url = "http://springerlink.com/content/u424k6nn6k622788/"
11380 @Article{dflj-adcss-07
11381 , author = DuH #and# FeldmanMW #and# LiS #and# JinX
11382 , title = {{An algorithm for detecting community structure of social networks based on prior knowledge and modularity}}
11383 , journal = j-complexity
11387 , url = "http://www3.interscience.wiley.com/cgi-bin/abstract/114068028/ABSTRACT"
11392 @Article{dfls-bsrgc-04
11393 , author = DuchonP #and# FlajoletP #and# LouchardG #and# SchaefferG
11394 , title = {{Boltzmann Samplers for the Random Generation of Combinatorial Structures}}
11397 , pages = {577--625}
11402 @InProceedings{dfmn-mspda-01
11403 , author = DemetrescuC #and# FrigioniD #and# MarchettiSpaccamelaA #and# NanniU
11404 , title = {{Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study}}
11405 , booktitle = {{Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00)}}
11406 , publisher = pub-springer
11407 , series = ser-springer_lncs
11412 @InProceedings{dfv-dafrn-11
11413 , author = DangeloG #and# FrigioniD #and# VitaleC
11414 , title = {{Dynamic Arc-Flags in Road Networks}}
11415 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
11417 , publisher = pub-springer
11418 , series = ser-springer_lncs
11423 @InProceedings{dggnw-ectea-07
11424 , author = DellingD #and# GaertlerM #and# GoerkeR #and# NikoloskiZ #and# WagnerD
11425 , title = {{Evaluating Clustering Techniques - An Engineering Approach Inspired by Unit-Tests}}
11426 , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'07)}}
11429 , pdf = "http://i11www.ira.uka.de/extra/publications/dggnw-ectea-07.pdf"
11430 , url = "http://cssociety.org/ECCS07-Programme"
11434 @techreport{dggnw-hect-06
11435 , author = DellingD #and# GaertlerM #and# GoerkeR #and# NikoloskiZ #and# WagnerD
11436 , title = {{How to Evaluate Clustering Techniques}}
11437 , institution = iti_wagner
11438 , number = {2006-24}
11439 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3149"
11440 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007104"
11444 @techreport{dggw-ecgc-06
11445 , author = DellingD #and# GaertlerM #and# GoerkeR #and# WagnerD
11446 , title = {{Experiments on Comparing Graph Clusterings}}
11447 , institution = iti_wagner
11448 , number = {2006-16}
11449 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3234"
11450 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005167"
11454 @InProceedings{dggw-ecgc-07
11455 , author = DellingD #and# GaertlerM #and# GoerkeR #and# WagnerD
11456 , title = {{Engineering Comparators for Graph Clusterings}}
11457 , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'07)}}
11459 , note = {as poster}
11460 , pdf = "http://www.springerlink.com/content/u172637452372n03/fulltext.pdf"
11461 , url = "http://dx.doi.org/10.1007/978-3-540-68880-8_14"
11465 @InProceedings{dggw-ecgc-08
11466 , author = DellingD #and# GaertlerM #and# GoerkeR #and# WagnerD
11467 , title = {{Engineering Comparators for Graph Clusterings}}
11468 , booktitle = {{Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM'08)}}
11470 , pages = {131--142}
11471 , pdf = "http://i11www.ira.uka.de/extra/publications/dggw-ecgc-08.pdf"
11472 , publisher = pub-springer
11473 , series = ser-springer_lncs
11479 , editor = DemetrescuC #and# GoldbergAV #and# JohnsonDS
11480 , title = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
11481 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
11482 , publisher = pub-ams
11483 , series = ser-dimacsb
11488 @InProceedings{dgklr-hoap-12
11489 , author = DiGiacomoE #and# GrilliL #and# KrugM #and# LiottaG #and# RutterI
11490 , title = {{Hamiltonian Orthogeodesic Alternating Paths}}
11491 , booktitle = {{Proceedings of the 22nd International Workshop on Combinatorial Algorithms}}
11492 , pages = {170--181}
11493 , publisher = pub-springer
11494 , series = ser-springer_lncs
11495 , url = "http://www.springerlink.com/content/f6u552unx28353jw/"
11499 @Article{dgklr-hogap-12
11500 , author = DiGiacomoE #and# GrilliL #and# KrugM #and# LiottaG #and# RutterI
11501 , title = {{Hamiltonian orthogeodesic alternating paths}}
11503 , note = {Special issue of IWOCA'11}
11505 , url = "http://dx.doi.org/10.1016/j.jda.2012.04.012"
11510 @InProceedings{dgkrtw-hagbg-10
11511 , author = deBergM #and# GerritsD #and# KhosraviA #and# RutterI #and# TsirogiannisC #and# WolffA
11512 , title = {{How Alexander the Great Brought the Greeks Together While Inflicting Minimal Damage to the Barbarians}}
11513 , booktitle = {{Proceedings of the 26th European Workshop on Computational Geometry (EuroCG'10)}}
11518 @Article{dglttv-ecfgd-97
11519 , author = DiBattistaG #and# GargA #and# LiottaG #and# TamassiaR #and# TassinariE #and# VargiuF
11520 , title = {{An Experimental Comparison of Four Graph Drawing Algorithms}}
11524 , pages = {303--325}
11525 , url = "http://portal.acm.org/citation.cfm?id=280655"
11530 @Article{dgm-cocn-06
11531 , author = DorogovtsevSN #and# GoldbergAV #and# MendesJFF
11532 , title = {{$k$-Core Organization of Complex Networks}}
11537 , url = "http://link.aps.org/abstract/PRL/v96/e040601"
11542 @InProceedings{dgnp-psrs-10
11543 , author = DellingD #and# GemsaA #and# NollenburgM #and# PajorT
11544 , title = {{Path Schematization for Route Sketches}}
11545 , booktitle = {{Proceedings of the 12th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'10)}}
11547 , pages = {285--296}
11548 , pdf = "http://i11www.ira.uka.de/extra/publications/dgnp-psrs-10.pdf"
11549 , publisher = pub-springer
11550 , series = ser-springer_lncs
11551 , url = "http://dx.doi.org/10.1007/978-3-642-13731-0_27"
11556 @techreport{dgnp-psrs-tr10
11557 , author = DellingD #and# GemsaA #and# NollenburgM #and# PajorT
11558 , title = {{Path Schematization for Route Sketches}}
11559 , institution = "Faculty of Informatics, Karlsruhe Institute of Technology"
11560 , number = {2010-02}
11561 , pdf = "http://i11www.ira.uka.de/extra/publications/dgnp-psrs-tr10.pdf"
11562 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000016078"
11566 @techreport{dgnw-phast-10
11567 , author = DellingD #and# GoldbergAV #and# NowatzykA #and# WerneckR
11568 , title = {{PHAST: Hardware-Accelerated Shortest Path Trees}}
11569 , institution = "Microsoft Research"
11570 , number = {MSR-TR-2010-125}
11574 @InProceedings{dgnw-phast-11
11575 , author = DellingD #and# GoldbergAV #and# NowatzykA #and# WerneckR
11576 , title = {{PHAST: Hardware-Accelerated Shortest Path Trees}}
11577 , booktitle = {{25th International Parallel and Distributed Processing Symposium (IPDPS'11)}}
11578 , note = {Best Paper Award - Algorithms Track}
11579 , pages = {921--931}
11580 , publisher = pub-ics
11584 @Article{dgnw-phast-13
11585 , author = DellingD #and# GoldbergAV #and# NowatzykA #and# WerneckR
11586 , title = {{PHAST: Hardware-accelerated shortest path trees}}
11589 , pages = {940--952}
11590 , pdf = "http://i11www.ira.uka.de/extra/publications/dgnw-phast-12.pdf"
11591 , url = "http://www.sciencedirect.com/science/article/pii/S074373151200041X"
11596 @InProceedings{dgpw-crp-11
11597 , author = DellingD #and# GoldbergAV #and# PajorT #and# WerneckR
11598 , title = {{Customizable Route Planning}}
11599 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
11600 , pages = {376--387}
11601 , pdf = "http://i11www.ira.uka.de/extra/publications/dgpw-crp-11.pdf"
11602 , publisher = pub-springer
11603 , series = ser-springer_lncs
11608 @InProceedings{dgrw-ecbbg-12
11609 , author = DellingD #and# GoldbergAV #and# RazenshteynI #and# WerneckR
11610 , title = {{Exact Combinatorial Branch-and-Bound for Graph Bisection}}
11611 , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}}
11613 , publisher = pub-siam
11617 @techreport{dgrw-gpnc-10
11618 , author = DellingD #and# GoldbergAV #and# RazenshteynI #and# WerneckR
11619 , title = {{Graph Partitioning with Natural Cuts}}
11620 , institution = "Microsoft Research"
11621 , number = {MSR-TR-2010-164}
11625 @InProceedings{dgrw-gpnc-11
11626 , author = DellingD #and# GoldbergAV #and# RazenshteynI #and# WerneckR
11627 , title = {{Graph Partitioning with Natural Cuts}}
11628 , booktitle = {{25th International Parallel and Distributed Processing Symposium (IPDPS'11)}}
11629 , pages = {1135--1146}
11630 , publisher = pub-ics
11634 @techreport{dgsb-dcarr-10
11635 , author = DeesJ #and# GeisbergerR #and# SandersP #and# BaderR
11636 , title = {{Defining and Computing Alternative Routes in Road Networks}}
11637 , institution = "ITI Sanders, Faculty of Informatics, Karlsruhe Institute of Technology"
11641 @InProceedings{dgsw-orca-09
11642 , author = DellingD #and# GoerkeR #and# SchulzC #and# WagnerD
11643 , title = {{ORCA Reduction and ContrAction Graph Clustering}}
11644 , booktitle = {{Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management (AAIM'09)}}
11646 , pages = {152--165}
11647 , pdf = "http://www.springerlink.com/content/vn74777wj087k748/fulltext.pdf"
11648 , publisher = pub-springer
11649 , series = ser-springer_lncs
11650 , url = "http://dx.doi.org/10.1007/978-3-642-02158-9_14"
11655 @InProceedings{dgw-fbspr-11
11656 , author = DellingD #and# GoldbergAV #and# WerneckR
11657 , title = {{Faster Batched Shortest Paths in Road Networks}}
11658 , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}}
11660 , series = ser-oasioasi
11665 @InProceedings{dgw-gsgc-06
11666 , author = DellingD #and# GaertlerM #and# WagnerD
11667 , title = {{Generating Significant Graph Clusterings}}
11668 , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'06)}}
11670 , pdf = "http://i11www.ira.uka.de/extra/publications/dgw-gsgc-06.pdf"
11671 , url = "http://cssociety.org/tiki-index.php?page=ECCS'06+Programme"
11675 @InProceedings{dgw-hlc-13
11676 , author = DellingD #and# GoldbergAV #and# WerneckR
11677 , title = {{Hub Label Compression}}
11678 , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}}
11680 , publisher = pub-springer
11681 , series = ser-springer_lncs
11686 @Article{dgw-sprnf-11
11687 , author = DellingD #and# GoldbergAV #and# WerneckR
11688 , title = {{Shortest Paths in Road Networks: From Practice to Theory and Back}}
11691 , pages = {294--301}
11692 , url = "http://www.oldenbourg-link.com/toc/itit/53/6"
11697 @techreport{dgwz-ctin-08
11698 , author = DellingD #and# GiannakopoulouK #and# WagnerD #and# ZaroliagisC
11699 , title = {{Contracting Timetable Information Networks}}
11700 , institution = "Arrival Technical Report"
11702 , pdf = "http://arrival.cti.gr/uploads/Documents.0144/ARRIVAL-TR-0144.pdf"
11706 @techreport{dgwz-tiucd-08
11707 , author = DellingD #and# GiannakopoulouK #and# WagnerD #and# ZaroliagisC
11708 , title = {{Timetable Information Updating in Case of Delays: Modeling Issues}}
11709 , institution = "Arrival Technical Report"
11711 , pdf = "http://arrival.cti.gr/uploads/Documents.0133/ARRIVAL-TR-0133.pdf"
11715 @Article{dh-dgnsa-96
11716 , author = DavidsonR #and# HarelD
11717 , title = {{Drawing Graphs Nicely using Simulated Annealing}}
11718 , journal = j-acmtg
11720 , pages = {301--331}
11726 , editor = DreznerZ #and# HamacherHW
11727 , title = {{Facility Location: Application and Theory}}
11728 , booktitle = {{Facility Location: Application and Theory}}
11729 , publisher = pub-springer
11733 @InProceedings{dh-kmcpc-04
11734 , author = DingCHQ #and# HeX
11735 , title = {{K-Means Clustering via Principal Component Analysis}}
11736 , booktitle = {{Proceedings of the twenty-first international conference on Machine learning}}
11738 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1015408&type=pdf&coll=GUIDE&dl=GUIDE&CFID=18274057&CFTOKEN=7"
11739 , publisher = pub-acm
11740 , url = "http://doi.acm.org/10.1145/1015330.1015408"
11745 @article{dh-lbpg-73
11746 , author = DonathWE #and# HoffmanAJ
11747 , title = {{Lower bounds for the partitioning of graphs}}
11750 , pages = {420--425}
11755 @techreport{dhhzs-prhuf-01
11756 , author = DingCHQ #and# HeX #and# HusbandsP #and# ZhaH #and# SimonHD
11757 , title = {{PageRank, HITS and a unified framework for link analysis}}
11758 , address = "Berkeley, CA, USA"
11759 , institution = "NERSC Division, Lawrence Berkeley National Laboratory, University of California"
11761 , note = {updated Sept. 2002 (LBNL-50007), presented in the poster session of the Third SIAM International Con}
11763 , type = {LBNL Tech Report}
11768 , author = DalyF #and# HandDJ #and# JonesMC #and# LunnAD #and# McConwayKJ
11769 , title = {{Elements of Statistics}}
11770 , isbn = "0-201-42278-6"
11771 , publisher = {The Open University,}
11775 @InProceedings{dhk-cdhmf-11
11776 , author = DemaineED #and# HajiaghayiM #and# KawarabayashiK
11777 , title = {{Contraction Decomposition in $H$-Minor-Free Graphs
\r
11778 and Algorithmic Applications}}
11779 , booktitle = {{Proceedings of the 43rd Annual {ACM} Symposium on the Theory of Computing (STOC'11)}}
11780 , pages = {441--450}
11781 , publisher = pub-acm
11785 @InCollection{dhmps-gads-06
11786 , author = DellnitzM #and# HesselM #and# MetznerP #and# PreisR #and# SchutteC
11787 , title = {{Graph Algorithms for Dynamical Systems}}
11788 , booktitle = {{Analysis, Modeling and Simulation of Multiscale Problems}}
11789 , pages = {619--645}
11790 , publisher = pub-springer
11794 @InProceedings{dhmsw-hpmlg-06
11795 , author = DellingD #and# HolzerM #and# MuellerK #and# SchulzF #and# WagnerD
11796 , title = {{High-Performance Multi-Level Graphs}}
11797 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}}
11799 , pdf = "http://i11www.ira.uka.de/extra/publications/dhmsw-hpmlg-06.pdf"
11800 , url = "http://www.dis.uniroma1.it/~challenge9/papers.shtml"
11804 @InCollection{dhmsw-hpmlr-09
11805 , author = DellingD #and# HolzerM #and# MuellerK #and# SchulzF #and# WagnerD
11806 , title = {{High-Performance Multi-Level Routing}}
11807 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
11809 , pdf = "http://i11www.ira.uka.de/extra/publications/dhmsw-hpmlr-09.pdf"
11810 , publisher = pub-ams
11811 , series = ser-dimacsb
11817 , author = DijkTv #and# HeuvelJ #and# SlobW
11818 , title = {{Computing treewidth with LibTW}}
11819 , institution = "Applied Computer Science - Utrecht University"
11820 , url = "http://www.treewidth.com/"
11824 @InProceedings{dhs-nlrkm-05
11825 , author = DingCHQ #and# HeX #and# SimonHD
11826 , title = {{Nonnegative Lagrangian Relaxation of K-Means and Spectral Clustering }}
11827 , booktitle = {{Proceedings of the 16th European Conference on Machine Learning}}
11828 , pages = {530--538}
11829 , pdf = "http://www.springerlink.com/content/f4722m7103u59qpr/fulltext.pdf"
11830 , publisher = pub-springer
11831 , series = ser-springer_lncs
11832 , url = "http://dx.doi.org/10.1007/11564096"
11837 @InProceedings{dhs-oenmf-05
11838 , author = DingCHQ #and# HeX #and# SimonHD
11839 , title = {{On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering}}
11840 , booktitle = {{Proceedings of the fifth SIAM International Conference on Data Mining}}
11841 , pages = {606--610}
11842 , pdf = "http://www.siam.org/proceedings/datamining/2005/dm05_70dingc.pdf"
11843 , publisher = pub-siam
11844 , url = "http://www.siam.org/proceedings/datamining/2005/dm05.php"
11848 @techreport{dhw-dhgcum-11
11849 , author = DollC #and# HartmannT #and# WagnerD
11850 , title = {{Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees}}
11851 , institution = kit_wagner
11852 , note = {Karlsruhe Reports in Informatics 2011-10}
11853 , pdf = "http://i11www.ira.uka.de/extra/publications/dhw-dhgcum-11.pdf"
11854 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022450"
11858 @InProceedings{dhw-dhmctc-11
11859 , author = DollC #and# HartmannT #and# WagnerD
11860 , title = {{Fully-Dynamic Hierarchical Graph Clustering Using Cut Trees}}
11861 , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}}
11863 , pages = {338--349}
11864 , publisher = pub-springer
11865 , series = ser-springer_lncs
11870 @InProceedings{dhzgs-amcag-01
11871 , author = DingCHQ #and# HeX #and# ZhaH #and# GuM #and# SimonHD
11872 , title = {{A Min-max Cut Algorithm for Graph Partitioning and Data Clustering}}
11873 , booktitle = {{Proceedings of the 2001 IEEE International Conference on Data Mining}}
11874 , pages = {107--114}
11875 , pdf = "http://ieeexplore.ieee.org/iel5/7762/21329/00989507.pdf?tp=&arnumber=989507&isnumber=21329"
11876 , publisher = pub-ics
11877 , url = "http://dx.doi.org/10.1109/ICDM.2001.989507"
11882 , author = DemetrescuC #and# ItalianoGF
11883 , title = {{Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures}}
11887 , pages = {353--383}
11892 @inproceedings{di-dapsp-03
11893 , author = DemetrescuC #and# ItalianoGF
11894 , title = {{A New Approach to Dynamic All Pairs Shortest Paths}}
11895 , booktitle = {{Proceedings of the 35th Annual {ACM} Symposium on the Theory of Computing (STOC'03)}}
11897 , pages = {159--166}
11901 @InProceedings{di-espa-04
11902 , author = DemetrescuC #and# ItalianoGF
11903 , title = {{Engineering Shortest Path Algorithms}}
11904 , booktitle = {{Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04)}}
11905 , pages = {191--198}
11906 , publisher = pub-springer
11907 , series = ser-springer_lncs
11912 @InProceedings{djpsy-cmc-92
11913 , author = DahlhausE #and# JohnsonDS #and# PapadimitriouCH #and# SeymourPD #and# YannakakisM
11914 , title = {{The Complexity of Multiway Cuts (Extended Abstract)}}
11915 , booktitle = {{Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'92)}}
11916 , pages = {241--251}
11917 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=129736&type=pdf&coll=GUIDE&dl=&CFID=26591050&CFTOKEN=8351605"
11918 , publisher = pub-acm
11919 , url = "http://doi.acm.org/10.1145/129712.129736"
11923 @Article{djpsy-tcmc-94
11924 , author = DahlhausE #and# JohnsonDS #and# PapadimitriouCH #and# SeymourPD #and# YannakakisM
11925 , title = {{The Complexity of Multiterminal Cuts}}
11926 , journal = j-sicomp
11928 , pages = {864--894}
11929 , pdf = "https://eprints.kfupm.edu.sa/69233/1/69233.pdf"
11934 @InCollection{dkhs-cs-10
11935 , author = DellingD #and# KandybaM #and# HoffmannR #and# SchulzeA
11936 , title = {{Case Studies}}
11937 , booktitle = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}}
11938 , pages = {389--445}
11939 , publisher = pub-springer
11940 , series = ser-springer_lncs
11945 @incollection{dkl-otsotsomec-76
11946 , author = DinitzY #and# KarzanovAV #and# LomonosovMV
11947 , editor = FridmanAA
11948 , title = {{On the structure of the system of minimum edge cuts in a graph}}
11949 , booktitle = {{In Studies in Discrete Optimization}}
11950 , pages = {290-306}
11951 , publisher = pub-nauka
11955 @InProceedings{dklw-rmrpl-12
11956 , author = DellingD #and# KobitzschM #and# LuxenD #and# WerneckR
11957 , title = {{Robust Mobile Route Planning with Limited Connectivity}}
11958 , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}}
11959 , pages = {150--159}
11960 , pdf = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/026.pdf"
11961 , publisher = pub-siam
11965 @InProceedings{dkm-smooc-06
11966 , author = DwyerT #and# KorenY #and# MarriottK
11967 , title = {{Stress Majorization with Orthogonal Ordering Constraints}}
11968 , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}}
11970 , pages = {141--152}
11971 , publisher = pub-springer
11972 , series = ser-springer_lncs
11973 , url = "http://www.springerlink.com/content/f136086184711p48/"
11978 @article{dkmrst-ssw-02
11979 , author = DillS #and# KumarR #and# McCurleyKS #and# RajagopalanS #and# SivakumarD #and# TomkinsAS
11980 , title = {{Self-Similarity in the Web}}
11984 , pages = {205--223}
11989 @InProceedings{dkp-pcbcp-10
11990 , author = DellingD #and# KatzB #and# PajorT
11991 , title = {{Parallel Computation of Best Connections in Public Transportation Networks}}
11992 , booktitle = {{24th International Parallel and Distributed Processing Symposium (IPDPS'10)}}
11994 , pdf = "http://i11www.ira.uka.de/extra/publications/dkp-pcbcp-10.pdf"
11995 , publisher = pub-ics
11999 @Article{dkp-pcbcp-12
12000 , author = DellingD #and# KatzB #and# PajorT
12001 , title = {{Parallel Computation of Best Connections in Public Transportation Networks}}
12002 , journal = j-acm-ea
12005 , pages = {4.4:4.1--4.4:4.26}
12006 , url = "http://dl.acm.org/citation.cfm?id=2345678"
12011 @techreport{dkp-pcbcp-tr-09
12012 , author = DellingD #and# KatzB #and# PajorT
12013 , title = {{Parallel Computation of Best Connections in Public Transportation
\r
12015 , institution = "Faculty of Informatics, Karlsruhe Institute of Technology"
12017 , pdf = "http://i11www.ira.uka.de/extra/publications/dkp-pcbcp-tr-09.pdf"
12022 , author = DingG #and# KannoJ #and# SuJ
12023 , title = {{Generating 5-regular planar graphs}}
12027 , pages = {219--240}
12032 @InProceedings{dkw-gdcr-06
12033 , author = DuncanCA #and# KobourovSG #and# WagnerD
12034 , title = {{Graph Drawing Contest Report}}
12035 , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}}
12037 , pages = {528--531}
12038 , publisher = pub-springer
12039 , series = ser-springer_lncs
12040 , url = "http://dx.doi.org/10.1007/11618058"
12045 @InProceedings{dllpsz-tcepi-06
12046 , author = DehneF #and# LangstonMA #and# LuoX #and# PitreS #and# ShawP #and# ZhangYy
12047 , title = {{The Cluster Editing Problem: Implementations and Experiments}}
12048 , booktitle = {{Parameterized and Exact Computation}}
12051 , pdf = "http://www.springerlink.com/content/dt56l0mn081034j7/fulltext.pdf"
12052 , publisher = pub-springer
12053 , series = ser-springer_lncs
12054 , url = "http://www.springerlink.com/content/dt56l0mn081034j7"
12055 , volume = {4169/2006}
12060 , author = deFraysseixH #and# MendezPO
12061 , title = {{Barycentric Systems and Stretchability}}
12063 , pages = {1079--1095}
12068 @InProceedings{dm-csmud-08
12069 , author = DwyerT #and# MarriottK
12070 , title = {{Constrained Stress Majorization Using Diagonally Scaled Gradient Projection}}
12071 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
12073 , pages = {219--230}
12074 , publisher = pub-springer
12075 , series = ser-springer_lncs
12076 , url = "http://www.springerlink.com/content/f38344l830h83265/"
12082 , author = DorogovtsevSN #and# MendesJFF
12083 , title = {{Evolution of Networks}}
12087 , pages = {1079--1187}
12093 , author = DorogovtsevSN #and# MendesJFF
12094 , title = {{Evolution of Networks}}
12095 , publisher = pub-oup
12099 @InProceedings{dmada-mlmee-12
12100 , author = DemestichasK #and# MasikosM #and# AdamopoulouE #and# DreherS #and# ArkayaAD
12101 , title = {{Machine-Learning Methodology for Energy Efficient Routing}}
12102 , booktitle = {{the 19th World Congress on Intelligent Transport Systems}}
12107 @Article{dmcrg-tdvrpacs-08
12108 , author = DonatiAV #and# MontemanniR #and# CasagrandeN #and# RizzoliAE #and# GambardellaLM
12109 , title = {{Time dependent vehicle routing problem with a multi ant colony system}}
12111 , pages = {1174--1191}
12116 @Article{dml-daaas-09
12117 , author = DangC #and# MaW #and# LiangJ
12118 , title = {{A Deterministic Annealing Algorithm for Approximating a Solution of the Min-Bisection Problem }}
12122 , url = "http://dx.doi.org/10.1016/j.neunet.2008.09.008"
12128 , editor = DellamicoM #and# MaffioliF #and# MartelloS
12129 , title = {{Annotated Bibliographies in Combinatorial Optimization}}
12130 , booktitle = {{Annotated Bibliographies in Combinatorial Optimization}}
12131 , publisher = pub-wiley
12135 @InProceedings{dmm-clglt-97
12136 , author = DogrusozU #and# MaddenB #and# MaddenP
12137 , title = {{Circular Layout in the {G}raph {L}ayout {T}oolkit}}
12138 , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}}
12139 , location = "Berkeley, California, USA"
12141 , pages = {92--100}
12142 , publisher = pub-springer
12143 , series = ser-springer_lncs
12144 , url = "http://www.springerlink.com/content/27295q2174557g1u/"
12149 @Article{dmr-bor-95
12150 , author = deFraysseixH #and# MendezPO #and# RosenstiehlP
12151 , title = {{Bipolar Orientations Revisited}}
12155 , pages = {157--179}
12160 @Article{dmr-otcg-94
12161 , author = deFraysseixH #and# MendezPO #and# RosenstiehlP
12162 , title = {{On Triangle Contact Graphs}}
12164 , pages = {233--246}
12169 @article{dmrtw-aacms-00
12170 , author = DoddiS #and# MaratheMV #and# RaviSS #and# TaylorDS #and# WidmayerP
12171 , title = {{Approximation Algorithms for Clustering to Minimize the Sum of Diameters}}
12174 , pages = {185--203}
12179 @InProceedings{dms-mcspt-08
12180 , author = DisserY #and# MuellerHannemannM #and# SchneeM
12181 , title = {{Multi-Criteria Shortest Paths in Time-Dependent Train Networks}}
12182 , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}}
12184 , pages = {347--361}
12185 , publisher = pub-springer
12186 , series = ser-springer_lncs
12191 @unpublished{dms-sgnesbam-00
12192 , author = DorogovtsevSN #and# MendesJFF #and# SamukhinAN
12193 , title = {{Structure of Growing Networks: Exact Solution of the Barab{\' a}si-Albert's Model}}
12195 , note = {http://xxx.sissa.it/ps/cond-mat/0004434}
12199 @InProceedings{dn-alcms-95
12200 , author = DinitzY #and# NutovZ
12201 , title = {{A 2-Level Cactus Model for the System of Minimum and Minimum+1 Edge-Cuts in a Graph and its Incremental Maintenance}}
12202 , booktitle = {{Proceedings of the 27th Annual {ACM} Symposium on the Theory of Computing (STOC'95)}}
12204 , pages = {509--518}
12205 , url = "http://portal.acm.org/citation.cfm?id=225268"
12209 @InProceedings{dn-bcbrd-08
12210 , author = DellingD #and# NanniciniG
12211 , title = {{Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks}}
12212 , booktitle = {{Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC'08)}}
12214 , pages = {813--824}
12215 , pdf = "http://i11www.ira.uka.de/extra/publications/dn-bcbrd-08.pdf"
12216 , publisher = pub-springer
12217 , series = ser-springer_lncs
12222 @Article{dn-crdtd-12
12223 , author = DellingD #and# NanniciniG
12224 , title = {{Core Routing on Dynamic Time-Dependent Road Networks}}
12227 , pages = {187--201}
12232 @inproceedings{dn-imeccg-00
12233 , author = DinitzY #and# NossensonR
12234 , title = {{Incremental Maintenance of the $5$-Edge-Connectivity Classes of a Graph}}
12235 , booktitle = {{Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT'00)}}
12237 , pages = {272--285}
12238 , publisher = pub-springer
12239 , series = ser-springer_lnm
12244 @article{do-bacg-03
12245 , author = DankelmannP #and# OellermannOR
12246 , title = {{Bounds on the average connectivity of a graph}}
12249 , pages = {305--318}
12254 @Article{dos-sptdf-12
12255 , author = DehneF #and# OmranMT #and# SackJ
12256 , title = {{Shortest Paths in Time-Dependent FIFO Networks}}
12258 , pages = {416--435}
12264 , author = DeoN #and# PangC
12265 , title = {{Shortest-path algorithms: Taxonomy and annotation}}
12266 , journal = j-networks
12268 , pages = {275--323}
12269 , url = "dx.doi.org/10.1002/net.3230140208"
12274 @Article{dps-asglp-02
12275 , author = DiazGuileraA #and# PetitJ #and# SernaM
12276 , title = {{A Survey of Graph Layout Problems}}
12277 , journal = j-acm-csur
12279 , pages = {313--356}
12280 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=568523&type=pdf&coll=GUIDE&dl=GUIDE&CFID=36303563&CFTOKEN=98"
12281 , url = "http://doi.acm.org/10.1145/568522.568523"
12286 @InProceedings{dpsw-isftr-13
12287 , author = DibbeltJ #and# PajorT #and# StrasserB #and# WagnerD
12288 , title = {{Intriguingly Simple and Fast Transit Routing}}
12289 , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}}
12291 , pdf = "http://i11www.ira.uka.de/extra/publications/dpsw-isftr-13.pdf"
12292 , publisher = pub-springer
12293 , series = ser-springer_lncs
12298 @Article{dpv-cprn-05
12299 , author = DerenyiI #and# PallaG #and# VicsekT
12300 , title = {{Clique Percolation in Random Networks}}
12302 , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=PRLTAO000094000016160202000001"
12303 , url = "http://link.aps.org/abstract/PRL/v94/e160202"
12308 @InProceedings{dpw-ammrp-09
12309 , author = DellingD #and# PajorT #and# WagnerD
12310 , title = {{Accelerating Multi-Modal Route Planning by Access-Nodes}}
12311 , booktitle = {{Proceedings of the 17th Annual European Symposium on Algorithms (ESA'09)}}
12313 , pages = {587--598}
12314 , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-ammrp-09.pdf"
12315 , publisher = pub-springer
12316 , series = ser-springer_lncs
12321 @InProceedings{dpw-etegf-08
12322 , author = DellingD #and# PajorT #and# WagnerD
12323 , title = {{Engineering Time-Expanded Graphs for Faster Timetable Information}}
12324 , booktitle = {{Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}}
12326 , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-etegf-08.pdf"
12327 , series = ser-oasioasi
12331 @InCollection{dpw-etegf-09
12332 , author = DellingD #and# PajorT #and# WagnerD
12333 , title = {{Engineering Time-Expanded Graphs for Faster Timetable Information}}
12334 , booktitle = {{Robust and Online Large-Scale Optimization}}
12335 , pages = {182--206}
12336 , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-etegf-09.pdf"
12337 , publisher = pub-springer
12338 , series = ser-springer_lncs
12343 @InProceedings{dpw-rbptr-12
12344 , author = DellingD #and# PajorT #and# WerneckR
12345 , title = {{Round-Based Public Transit Routing}}
12346 , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}}
12347 , pages = {130--140}
12348 , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-rbptr-12.pdf"
12349 , publisher = pub-siam
12350 , url = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/024.pdf"
12354 @InProceedings{dpw-ucmmr-12
12355 , author = DibbeltJ #and# PajorT #and# WagnerD
12356 , title = {{User-Constrained Multi-Modal Route Planning}}
12357 , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}}
12358 , pages = {118--129}
12359 , pdf = "http://i11www.ira.uka.de/extra/publications/dpw-ucmmr-12.pdf"
12360 , publisher = pub-siam
12364 @InProceedings{dpwz-erpfn-09
12365 , author = DellingD #and# PajorT #and# WagnerD #and# ZaroliagisC
12366 , title = {{Efficient Route Planning in Flight Networks}}
12367 , booktitle = {{Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09)}}
12368 , pdf = "http://i11www.ira.uka.de/extra/publications/dpwz-erpfn-09.pdf"
12369 , series = ser-oasioasi
12373 @InProceedings{drr-eloud-06
12374 , author = DelprattO #and# RahmanN #and# RamanR
12375 , title = {{Engineering the LOUDS Succinct Tree Representation}}
12376 , booktitle = {{Proceedings of the 5th Workshop on Experimental Algorithms (WEA'06)}}
12377 , pages = {134--145}
12378 , publisher = pub-springer
12379 , series = ser-springer_lncs
12384 @InProceedings{drvw-mapcv-06
12385 , author = DeshpandeA #and# RademacherL #and# VempalaS #and# WangC
12386 , title = {{Matrix Approximation and Projective Clustering via Volume Sampling}}
12387 , booktitle = {{Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)}}
12388 , isbn = "0-89871-605-5"
12389 , pages = {1117--1126}
12390 , url = "http://doi.acm.org/10.1145/1109557.1109681"
12395 , author = DiracGA #and# SchusterS
12396 , title = {{A Theorem of Kuratowski}}
12397 , journal = j-indmath
12398 , pages = {343--348}
12404 , editor = DoreianP #and# StokmanFN
12405 , title = {{Evolution of Social Networks}}
12406 , booktitle = {{Evolution of Social Networks}}
12407 , publisher = pub-gb
12412 , author = DesrosiersJ #and# SoumisF #and# DesrochersM
12413 , title = {{Routing with time windows by column generation}}
12414 , journal = j-networks
12417 , pages = {545--565}
12422 @InCollection{dssw-erpa-09
12423 , author = DellingD #and# SandersP #and# SchultesD #and# WagnerD
12424 , title = {{Engineering Route Planning Algorithms}}
12425 , booktitle = {{Algorithmics of Large and Complex Networks}}
12426 , pages = {117--139}
12427 , pdf = "http://i11www.ira.uka.de/extra/publications/dssw-erpa-09.pdf"
12428 , publisher = pub-springer
12429 , series = ser-springer_lncs
12434 @InProceedings{dssw-hhs-06
12435 , author = DellingD #and# SandersP #and# SchultesD #and# WagnerD
12436 , title = {{Highway Hierarchies Star}}
12437 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}}
12439 , pdf = "http://i11www.ira.uka.de/extra/publications/dssw-hhs-06.pdf"
12440 , url = "http://www.dis.uniroma1.it/~challenge9/papers.shtml"
12444 @InCollection{dssw-hhs-09
12445 , author = DellingD #and# SandersP #and# SchultesD #and# WagnerD
12446 , title = {{Highway Hierarchies Star}}
12447 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
12448 , pages = {141--174}
12449 , pdf = "http://i11www.ira.uka.de/extra/publications/dssw-hhs-09.pdf"
12450 , publisher = pub-ams
12451 , series = ser-dimacsb
12456 @InProceedings{dsw-rsgd-05
12457 , author = DujmovicV #and# SudermanM #and# WoodDR
12458 , title = {{Really Straight Graph Drawings}}
12459 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
12461 , pages = {122--132}
12462 , publisher = pub-springer
12463 , series = ser-springer_lncs
12468 @Article{dt-aprad-88
12469 , author = DiBattistaG #and# TamassiaR
12470 , title = {{Algorithms for Plane Representations of Acyclic Digraphs}}
12473 , pages = {175--198}
12474 , url = "http://dx.doi.org/10.1016/0304-3975(88)90123-5"
12479 @InProceedings{dt-dncsi-10
12480 , author = DerbelB #and# TalbiEG
12481 , title = {{Distributed Node Coloring in the SINR Model}}
12482 , booktitle = {{Proceedings of the 30th International Conference on Distributed Computing Systems}}
12483 , pages = {708--717}
12484 , publisher = pub-ics
12488 @InProceedings{dt-rndau-10
12489 , author = DerbelB #and# TalbiEG
12490 , title = {{Radio Network Distributed Algorithms in the Unknown Neighborhood Model}}
12491 , booktitle = {{Proceedings of the 11th International Conference on Distributed Computing and Networking }}
12492 , pages = {155--166}
12493 , publisher = pub-springer
12494 , series = ser-springer_lncs
12499 , author = DinhTN #and# ThaiMT
12500 , title = {{Towards Optimal Community Detection: From Trees to General Weighted Networks}}
12502 , note = {accepted pending revision.}
12505 @Article{dtv-osrdp-99
12506 , author = DiBattistaG #and# TamassiaR #and# VismaraL
12507 , title = {{Output-Sensitive Reporting of Disjoint Paths}}
12510 , pages = {302--340}
12515 @InProceedings{dv-aptg-93
12516 , author = DiBattistaG #and# VismaraL
12517 , title = {{Angles of Planar Triangular Graphs}}
12518 , booktitle = {{Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)}}
12520 , pages = {431--437}
12521 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=167207&type=pdf&coll=GUIDE&dl=ACM&CFID=25109407&CFTOKEN=9006"
12522 , url = "http://doi.acm.org/10.1145/167088.167207"
12526 @Article{dv-aptg-96
12527 , author = DiBattistaG #and# VismaraL
12528 , title = {{Angles of Planar Triangular Graphs}}
12529 , journal = j-sidma
12531 , pages = {349--359}
12532 , url = "http://dx.doi.org/10.1137/S0895480194264010"
12538 , author = DeniseA #and# VasconcellosM #and# WelshDJ
12539 , title = {{The random planar graph}}
12540 , journal = j-congr-num
12546 @InProceedings{dvzlp-mlsna-06
12547 , author = DhawanA #and# VuCT #and# ZelikovskyA #and# LiY #and# PrasadSK
12548 , title = {{Maximum Lifetime of Sensor Networks with Adjustable Sensing Range}}
12549 , booktitle = {{Proceedings of the International Workshop on Self-Assembling Wireless Networks, 2006}}
12550 , publisher = pub-ics
12554 @InProceedings{dw-bbgb-12
12555 , author = DellingD #and# WerneckR
12556 , title = {{Better Bounds for Graph Bisection}}
12557 , booktitle = {{Proceedings of the 20th Annual European Symposium on Algorithms (ESA'12)}}
12558 , pages = {407--418}
12559 , pdf = "http://i11www.ira.uka.de/extra/publications/dw-bbgb-12.pdf"
12560 , publisher = pub-springer
12561 , series = ser-springer_lncs
12566 @Article{dw-dplp-60
12567 , author = DantzigGB #and# WolfeP
12568 , title = {{Decomposition Principle for Linear Programs}}
12572 , pages = {101--110}
12577 @InProceedings{dw-fcrn-13
12578 , author = DellingD #and# WerneckR
12579 , title = {{Faster Customization of Road Networks}}
12580 , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}}
12582 , publisher = pub-springer
12583 , series = ser-springer_lncs
12588 @InProceedings{dw-lbrdg-07
12589 , author = DellingD #and# WagnerD
12590 , title = {{Landmark-Based Routing in Dynamic Graphs}}
12591 , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}}
12594 , pdf = "http://i11www.ira.uka.de/extra/publications/dw-lbrdg-07.pdf"
12595 , publisher = pub-springer
12596 , series = ser-springer_lncs
12597 , url = "http://www.springerlink.com/content/r18l738744xmn68v/?p=c3fb56d3275b4389bd305aef88ad40c8&pi=2"
12602 @InProceedings{dw-pps-09
12603 , author = DellingD #and# WagnerD
12604 , title = {{Pareto Paths with SHARC}}
12605 , booktitle = {{Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)}}
12607 , pages = {125--136}
12608 , pdf = "http://i11www.ira.uka.de/extra/publications/dw-pps-09.pdf"
12609 , publisher = pub-springer
12610 , series = ser-springer_lncs
12615 @InCollection{dw-tdrp-09
12616 , author = DellingD #and# WagnerD
12617 , title = {{Time-Dependent Route Planning}}
12618 , booktitle = {{Robust and Online Large-Scale Optimization}}
12619 , pages = {207--230}
12620 , pdf = "http://i11www.ira.uka.de/extra/publications/dw-tdrp-09.pdf"
12621 , publisher = pub-springer
12622 , series = ser-springer_lncs
12627 @InProceedings{dwn-tita-02
12628 , author = DillenburgJ #and# WolfsonO #and# NelsonPC
12629 , title = {{The Intelligent Travel Assistant}}
12630 , booktitle = {{ITSS 2002: Proceedings of the 5h International Conference on Intelligent Transportation Systems}}
12632 , pages = {691--696}
12633 , pdf = "http://www.cs.uic.edu/~wolfson/mobile_ps/ita02.pdf"
12634 , publisher = pub-ics
12638 @InProceedings{dynm-atesd-06
12639 , author = DucheneautN #and# YeeN #and# NickellE #and# MooreRJ
12640 , title = {{{A}lone {T}ogether?: Exploring the Social Dynamics of Massively Multiplayer Online Games}}
12641 , booktitle = {{Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (CHI'06)}}
12642 , pages = {407--416}
12643 , pdf = "http://doi.acm.org/10.1145/1124772.1124834"
12644 , publisher = pub-acm
12648 @article{dzhhs-la-04
12649 , author = DingCHQ #and# ZhaH #and# HeX #and# HusbandsP #and# SimonHD
12650 , title = {{Link Analysis: Hubs and authorities on the World Wide Web}}
12652 , note = {to appear, published electronically May, 3, 2004}
12658 %% --------------------------------------------------------------
12662 , title = {{Algorithmic Combinatorics}}
12663 , publisher = pub-macmillan
12667 @article{e-adwcg-75
12669 , title = {{An algorithm for determining whether the connectivity of a graph is at least $k$}}
12670 , journal = j-sicomp
12673 , pages = {393--396}
12679 , author = EgervaryE
12680 , title = {{On combinatorial properties of matrices}}
12681 , journal = "Mat. Lapok"
12687 @inproceedings{e-edb-73
12688 , author = EdmondsJ
12689 , title = {{Edge-Disjoint Branchings}}
12690 , booktitle = {{Courant Computer Science Symposium~9: Combinatorial Algorithms (1972)}}
12692 , publisher = {Algorithmics Press}
12698 , title = {{Elementa doctrinae solidorum}}
12699 , journal = j-ncasp
12700 , note = {repreinted in Opera Omnia Series I vol 26 p. 71-93}
12701 , pages = {109--140}
12706 @InProceedings{e-f-94
12707 , author = EppsteinD
12708 , title = {{Finding the $k$ shortest paths}}
12709 , booktitle = {{Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS'94)}}
12710 , pages = {154--165}
12714 @article{e-fhcoa-00
12715 , author = EppsteinD
12716 , title = {{Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs}}
12717 , doi = "http://doi.acm.org/10.1145/351827.351829"
12718 , journal = j-acm-ea
12726 , title = {{Graph Algorithms}}
12727 , address = "Rockville, Maryland"
12728 , publisher = pub-csp
12729 , series = "Computer Software En"
12733 @article{e-gtbpc-82
12734 , author = EverettMG
12735 , title = {{Graph theoretic blockings $k$-plexes and $k$-cutpoints}}
12744 , title = {{A Heuristic for Graph Drawing}}
12745 , journal = j-congr-num
12746 , pages = {149--160}
12752 , author = EsfahanianAH
12753 , title = {{Lower-Bounds on the Connectivities of a Graph}}
12756 , pages = {503--511}
12762 , author = EppsteinD
12763 , title = {{Nineteen Proofs of Euler's Formula: $V-E+F=2$ }}
12764 , booktitle = {{The Geometry Junkyard}}
12765 , url = "http://www.ics.uci.edu/~eppstein/junkyard/euler/"
12771 , title = {{$st$-Ordering the Vertices of Biconnected Graphs}}
12772 , journal = j-comput
12778 @InProceedings{e-rrntq-11
12779 , author = EisenstatD
12780 , title = {{Random Road Networks: The Quadtree Model}}
12781 , booktitle = {{Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO '11)}}
12784 , publisher = pub-siam
12790 , title = {{Shortest path calculation in large road networks}}
12794 , url = "http://dx.doi.org/10.1007/BF01545524"
12799 @Article{e-samfn-64
12800 , author = ElmaghrabySE
12801 , title = {{Sensivity Analysis of Multiterminal Flow Networks}}
12804 , pages = {680--688}
12809 @Article{e-tgvda-00
12811 , title = {{The Graph Voronoi Diagram with Applications}}
12812 , journal = j-networks
12813 , pages = {156--163}
12820 , title = {{Zukunft digitale Wirtschaft}}
12821 , pdf = "http://www.bitkom.org/files/documents/Zukunft_digitale_Wirtschaft_BITKOM-Roland_Berger_Studie.pdf"
12822 , publisher = pub-r
12826 @misc{eagg-zzika-08
12827 , editor = eVMK #and# AGDT #and# GmbHTI #and# GmbHEC
12828 , title = {{Zukunft \& Zukunftsf{\"a}higkeit der deutschen Informations- und Kommunikationstechnologie. Abschlussbericht der ersten Projektphase}}
12830 , pdf = "http://www.bmwi.de/BMWi/Redaktion/PDF/Publikationen/Technologie-und-Innovation/studie-zukunftsfaehig"
12835 , author = EverettMG #and# BorgattiSP
12836 , title = {{Analyzing clique overlap}}
12844 @incollection{eb-ec-04
12845 , author = EverettMG #and# BorgattiSP
12846 , editor = CarringtonPJ #and# ScottJ #and# WassermanS
12847 , title = {{Extending Centrality}}
12848 , booktitle = {{Models and Methods in Social Network Analysis}}
12849 , note = {To appear}
12850 , publisher = pub-cup
12855 , author = EverettMG #and# BorgattiSP
12856 , title = {{Peripheries of cohesive subsets}}
12859 , pages = {397--407}
12865 , author = EverettMG #and# BorgattiSP
12866 , title = {{Role Colouring a Graph}}
12868 , pages = {183--188}
12873 @article{eb-regt-94
12874 , author = EverettMG #and# BorgattiSP
12875 , title = {{Regular Equivalence: General Theory}}
12883 @InProceedings{ef-ccmda-03
12884 , author = EmanuelD #and# FiatA
12885 , title = {{Correlation Clustering -- Minimizing Disagreements on Arbitrary Weighted Graphs}}
12886 , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}}
12887 , doi = "http://doi.acm.org/10.1007/b13632"
12888 , pages = {208--220}
12889 , pdf = "http://www.springerlink.com/content/7a59247c5j6x06lf/fulltext.pdf"
12890 , publisher = pub-springer
12891 , series = ser-springer_lncs
12892 , url = "http://www.springerlink.com/content/7a59247c5j6x06lf/"
12897 @inproceedings{ef-mvcg-96
12898 , author = EadesP #and# FengQ
12899 , title = {{Multilevel Visualization of Clustered Graphs}}
12900 , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}}
12901 , location = "Berkeley, California, USA"
12903 , pages = {101--112}
12904 , publisher = pub-springer
12905 , series = ser-springer_lncs
12910 @InProceedings{ef-srqgt-12
12911 , author = EisnerJ #and# FunkeS
12912 , title = {{Sequenced Route Queries: Getting Things done on the way back Home}}
12913 , booktitle = {{Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)}}
12914 , pages = {502--505}
12915 , publisher = pub-acm
12919 @InProceedings{ef-tnlbr-12
12920 , author = EisnerJ #and# FunkeS
12921 , title = {{Transit Nodes -- Lower Bounds and Refined Construction}}
12922 , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}}
12923 , pages = {141--149}
12924 , pdf = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/025.pdf"
12925 , publisher = pub-siam
12929 @InProceedings{efhss-ampt-11
12930 , author = EisnerJ #and# FunkeS #and# HerbstA #and# SpillnerA #and# StorandtS
12931 , title = {{Algorithms for Matching and Predicting Trajectories}}
12932 , booktitle = {{Proceedings of the 13th Workshop on Algorithm Engineering and Experiments (ALENEX'11)}}
12934 , publisher = pub-siam
12938 @InCollection{efk-ogd-01
12939 , author = EiglspergerM #and# FeketeSP #and# KlauGW
12940 , title = {{Orthogonal Graph Drawing}}
12941 , booktitle = {{Drawing Graphs: Methods and Models}}
12942 , isbn = "3-540-42062-2"
12943 , pages = {121--171}
12944 , pdf = "http://springerlink.metapress.com/content/kbnwla90v8vk7rnk/fulltext.pdf"
12945 , publisher = pub-springer
12946 , series = ser-springer_lncs
12947 , url = "http://springerlink.metapress.com/content/kbnwla90v8vk7rnk/"
12952 @article{efs-nmftn-56
12953 , author = EliasP #and# FeinsteinA #and# ShannonCE
12954 , title = {{A Note on the Maximum Flow Through a Network}}
12955 , journal = j-ire-trans-it
12958 , pages = {117--119}
12963 @InProceedings{efs-orpev-11
12964 , author = EisnerJ #and# FunkeS #and# StorandtS
12965 , title = {{Optimal Route Planning for Electric Vehicles in Large Network}}
12966 , booktitle = {{Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence}}
12968 , pdf = "http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/download/3637/4005"
12969 , publisher = pub-aaaip
12970 , url = "http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3637"
12974 @article{eg-gpdv-60
12975 , author = ErdoesP #and# GallaiT
12976 , title = {{Graphs with Prescribed Degrees of Vertices (in hungarian)}}
12977 , journal = "Matematikai Lap"
12978 , pages = {264--274}
12984 , editor = EhrgottM #and# GandibleuxX
12985 , title = {{Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys}}
12986 , booktitle = {{Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys}}
12987 , publisher = pub-kapg
12992 , author = EichelbergerH #and# GudenbergJW
12993 , title = {{On the Visualization of Java Programs}}
12994 , booktitle = {{Software Visualization}}
12995 , pages = {295--306}
12996 , publisher = pub-springer
12997 , series = ser-springer_lncs
13002 @InProceedings{eg-s-08
13003 , author = EppsteinD #and# GoodrichMT
13004 , title = {{Studying (non-planar) road networks through an algorithmic lens}}
13005 , booktitle = {{Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems (GIS '08)}}
13007 , publisher = pub-acm
13011 @Article{egp-trgsi-66
13012 , author = ErdoesP #and# GoodmanA #and# PosaL
13013 , title = {{The Representation of a Graph by Set Intersections}}
13016 , pages = {106--112}
13021 @article{eh-ccgd-84
13022 , author = EsfahanianAH #and# HakimiSL
13023 , title = {{On Computing the Connectivities of Graphs and Digraphs}}
13024 , journal = j-networks
13026 , pages = {355--366}
13031 @article{eh-tolbccn-03
13032 , author = EngebretsenL #and# HolmerinJ
13033 , title = {{Towards optimal lower bounds for clique and chromatic number}}
13036 , pages = {537--584}
13041 @article{eh-wgads-03
13042 , author = DamERv #and# HaemersW
13043 , title = {{Which graphs are determined by their spectrum?}}
13045 , pages = {241--272}
13050 @InProceedings{ehhm-ndvdq-06
13051 , author = ErlebachT #and# HallA #and# HoffmannM #and# MihalakM
13052 , title = {{Network Discovery and Verification with Distance Queries}}
13053 , booktitle = {{Proceedings of the 6th Conference on Algorithms and Complexity (CIAC'06)}}
13056 , pdf = "http://www.springerlink.com/content/87g03q2325w04g32/fulltext.pdf"
13057 , publisher = pub-springer
13058 , series = ser-springer_lncs
13059 , url = "http://www.springerlink.com/content/87g03q2325w04g32/"
13064 @InProceedings{ehlnsv-scd-13
13065 , author = EppsteinD #and# HoltenD #and# LofflerM #and# NollenburgM #and# SpeckmannB #and# VerbeekK
13066 , title = {{Strict Confluent Drawing}}
13067 , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}}
13068 , note = {To appear.}
13069 , publisher = pub-springer
13070 , series = ser-springer_lncs
13074 @Article{ek-hrcln-86
13075 , author = EadesP #and# KellyD
13076 , title = {{Heuristics for Reducing Crossings in 2-Layered Networks}}
13084 @InProceedings{ek-sepgf-05
13085 , author = ErtenC #and# KobourovSG
13086 , title = {{Simultaneous Embedding of Planar Graphs with Few Bends}}
13087 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
13089 , pages = {195--205}
13090 , publisher = pub-springer
13091 , series = ser-springer_lncs
13096 @Article{ek-sepgi-05
13097 , author = ErtenC #and# KobourovSG
13098 , title = {{Simultaneous Embedding of a Planar Graph and Its Dual on the Grid}}
13102 , pages = {313--327}
13107 @article{ek-tiaenf-72
13108 , author = EdmondsJ #and# KarpRM
13109 , title = {{Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems}}
13113 , pages = {248--264}
13118 @techreport{ekms-gaaog-11
13119 , author = EffingerP #and# KaufmannM #and# MeinertS #and# StegmaierM
13120 , title = {{GraphArchive - An Online Graph Data Store }}
13121 , institution = "Wilhelm-Schickard-Institut, Eberhard-Karls-Universit{\"a}t T{\"u}bingen"
13123 , pdf = "http://i11www.ira.uka.de/extra/publications/ekms-gaaog-11.pdf"
13124 , url = "http://nbn-resolving.de/urn:nbn:de:bsz:21-opus-57549"
13128 @inproceedings{ekmsw-saamsn-04
13129 , author = EubankS #and# KumarVSA #and# MaratheMV #and# SrinivasanA #and# WangN
13130 , title = {{Structural and Algorithmic Aspects of Massive Social Networks}}
13131 , booktitle = {{Proceedings of the 15th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'04)}}
13132 , pages = {718-727}
13136 @techreport{el-p-11
13137 , author = EnsorA #and# LilloF
13138 , title = {{Partial order approach to compute shortest paths in multimodal networks}}
13139 , institution = "http://arxiv.org/abs/1112.3366v1"
13143 @InProceedings{elmn-odarl-10
13144 , author = EppsteinD #and# LofflerM #and# MumfordE #and# NollenburgM
13145 , title = {{Optimal 3D Angular Resolution for Low-Degree Graphs}}
13146 , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}}
13147 , note = {Full version available at \url{http://arxiv.org/abs/1009.0045}.}
13148 , pages = {208--219}
13149 , pdf = "http://i11www.ira.uka.de/extra/publications/elmn-odarl-10.pdf"
13150 , publisher = pub-springer
13151 , series = ser-springer_lncs
13152 , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_19"
13157 @Article{elmn-odarl-13
13158 , author = EppsteinD #and# LofflerM #and# MumfordE #and# NollenburgM
13159 , title = {{Optimal 3D Angular Resolution for Low-Degree Graphs}}
13162 , pages = {173--200}
13163 , pdf = "http://i11www.ira.uka.de/extra/publications/elmn-odarl-13.pdf"
13164 , url = "http://dx.doi.org/10.7155/jgaa.00290"
13169 @InProceedings{elms-pmmd-91
13170 , author = LaiW #and# EadesP #and# MisueK #and# SugiyamaK
13171 , title = {{Preserving the Mental Map of a Diagram}}
13172 , booktitle = {{Proceedings of Compugraphics '91}}
13177 @Article{els-fehfa-93
13178 , author = EadesP #and# LinX #and# SmythWF
13179 , title = {{A Fast and Effective Heuristic for the Feedback Arc Set Problem}}
13182 , pages = {319--323}
13183 , pdf = "http://www.cas.mcmaster.ca/~bill/fas.ps"
13184 , url = "http://dx.doi.org/10.1016/0020-0190(93)90079-O"
13189 @inproceedings{em-lbust-03
13190 , author = ElsaesserR #and# MonienB
13191 , title = {{Load Balancing of Unit Size Tokens and Expansion Properties of Graphs}}
13192 , booktitle = {{Proceedings of the 15th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'03)}}
13193 , pages = {266--273}
13197 @Article{emmps-fm-10
13198 , author = EFClementiA #and# MacciC #and# MontiA #and# PasqualeF #and# SilvestriR
13199 , title = {{Flooding time in edge-Markovian dynamic graphs}}
13200 , journal = j-sidma
13202 , pages = {1694--1712}
13203 , url = "http://epubs.siam.org/doi/abs/10.1137/090756053"
13208 @Article{ems-aocta-12
13209 , author = ElmasryA #and# MehlhornK #and# SchmidtJM
13210 , title = {{An {$\mathcal{O}(n+ m)$} Certifying Triconnnectivity Algorithm for Hamiltonian Graphs}}
13212 , pages = {754--766}
13217 @InProceedings{enrs-fagpa-97
13218 , author = EvenG #and# NaorJ #and# RaoF #and# SchieberB
13219 , title = {{Fast Approximate Graph Partitioning Algorithms}}
13220 , booktitle = {{Proceedings of the 8th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'97)}}
13221 , pages = {639--648}
13222 , publisher = pub-ieeecs
13223 , url = "http://portal.acm.org/citation.cfm?id=314161.314405"
13228 , author = EngelsmanEC #and# RaanAF
13229 , title = {{A patent-based cartography of technology }}
13234 , url = "http://dx.doi.org/10.1016/0048-7333(94)90024-8"
13240 , author = ErdoesP #and# RichmondLB
13241 , title = {{On Graphical Partitions}}
13246 , pdf = "http://www.springerlink.com/content/q640413118505j22/fulltext.pdf"
13247 , url = "http://www.springerlink.com/content/q640413118505j22/"
13253 , author = EngelsmanEC #and# RaanAF
13254 , title = {{International comparison of technological activities and specializations: a patent-based monitoring system}}
13257 , pages = {113--136 }
13258 , url = "http://www.informaworld.com/smpp/content~db=all~content=a779923576"
13264 , author = ErdoesP #and# RenyiA
13265 , title = {{On Random Graphs~I}}
13267 , pages = {290--297}
13272 @Article{ers-hvc-05
13273 , author = EvenG #and# RawitzD #and# ShaharS
13274 , title = {{Hitting sets when the VC-dimension is small}}
13277 , pages = {358--362}
13282 @Article{es-hddg-90
13283 , author = EadesP #and# SugiyamaK
13284 , title = {{How to Draw a Directed Graph}}
13287 , pages = {424--437}
13292 @unpublished{esd-scrnao-04
13293 , author = EverettMG #and# SinclairP #and# DankelmannP
13294 , title = {{Some Centrality Results New and Old}}
13295 , note = {Submitted}
13299 @InProceedings{esk-atsma-03
13300 , author = EiglspergerM #and# SiebenhallerM #and# KaufmannM
13301 , title = {{A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagram}}
13302 , booktitle = {{Proceedings ACM 2003 Symposium on Software Visualization (SOFTVIS'03)}}
13304 , pages = {189--198}
13305 , publisher = pub-acm
13310 , author = EswaranKP #and# TarjanRE
13311 , title = {{Augmentation Problems}}
13312 , journal = j-sicomp
13320 , author = EvenS #and# TarjanRE
13321 , title = {{Corrigendum: Computing an $st$-Numbering}}
13330 , author = EvenS #and# TarjanRE
13331 , title = {{Computing an $st$-Numbering}}
13335 , pages = {339--344}
13340 @article{et-nftgc-75
13341 , author = EvenS #and# TarjanRE
13342 , title = {{Network Flow and Testing Graph Connectivity}}
13343 , journal = j-sicomp
13346 , pages = {507--518}
13351 @InProceedings{etp-ccrsp-12
13352 , author = EfentakisA #and# TheodorakisD #and# PfoserD
13353 , title = {{Crowdsourcing Computing Resources for Shortest-Path Computation}}
13354 , booktitle = {{Proceedings of the 20th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (GIS'12)}}
13355 , pages = {434--437}
13356 , publisher = pub-acm
13360 @techreport{evh-sait-01
13361 , author = ErlebachT #and# VukadinovicD #and# HuangP
13362 , title = {{A Spectral Analysis of the Internet Topology}}
13363 , institution = "Eidgen{\"o}ssische Technische Hochschule Z{\"u}rich (ETH)"
13364 , pdf = "http://e-collection.ethbib.ethz.ch/eserv/eth:24444/eth-24444-01.pdf"
13365 , url = "http://e-collection.ethbib.ethz.ch/view/eth:24444"
13368 @Article{ew-ecdbg-94
13369 , author = EadesP #and# WormaldN
13370 , title = {{Edge Crossings in Drawings of Bipartite Graphs}}
13378 @inproceedings{ew-fac-01
13379 , author = EppsteinD #and# WangJ
13380 , title = {{Fast Approximation of Centrality}}
13381 , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}}
13385 @Article{ew-felgd-90
13386 , author = EadesP #and# WormaldN
13387 , title = {{Fixed Edge-Length Graph Drawing is NP-hard}}
13390 , pages = {111--134}
13391 , url = "http://dx.doi.org/10.1016/0166-218X(90)90110-X"
13396 @InProceedings{ew-hdcwc-86
13397 , author = El-HamdouchiA #and# WillettP
13398 , title = {{Hierarchic Document Classification using Ward's Clustering Method}}
13399 , booktitle = {{Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval}}
13400 , pages = {149--156}
13401 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=253200&type=pdf&coll=GUIDE&dl=GUIDE&CFID=18706479&CFTOKEN=10"
13402 , publisher = pub-acm
13403 , url = "http://doi.acm.org/10.1145/253168.253200"
13407 @InProceedings{ex-hddg-98
13408 , author = EadesP #and# XueminL
13409 , title = {{How to Draw a Directed Graph}}
13410 , booktitle = {{IEEE Workshop on Visual Languages}}
13412 , pdf = "http://ieeexplore.ieee.org/iel2/266/2565/00077035.pdf?tp=&isnumber=&arnumber=77035"
13413 , publisher = pub-ieeecs
13414 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=77035"
13418 %% --------------------------------------------------------------
13420 @Article{f-aavpc-67
13421 , author = FrischIT
13422 , title = {{An Algorithm for Vertex-Pair Connectivity}}
13425 , pages = {579--593}
13431 , author = FiedlerM
13432 , title = {{Algebraic connectivity of graphs}}
13435 , pages = {289--305}
13440 @inproceedings{f-adsdec-91
13441 , author = FredericksonGN
13442 , title = {{Ambivalent Data Structures for Dynamic $2$-Edge-connectivity and $k$ Smallest Spanning Trees}}
13443 , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}}
13445 , pages = {632--641}
13449 @Article{f-agpas-98
13450 , author = FjallstromP
13451 , title = {{Algorithms for Graph Partitioning: A Survey}}
13452 , journal = j-eacis
13456 , url = "http://www.ep.liu.se/ea/cis/1998/010/"
13461 @InProceedings{f-albar-08
13463 , title = {{A Lower Bound on the Area Requirements of Series-Parallel Graphs}}
13464 , booktitle = {{Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'08)}}
13465 , pages = {159--170}
13466 , publisher = pub-springer
13467 , series = ser-springer_lncs
13472 @techreport{f-arwca-99
13474 , title = {{An Analysis of Recent Work on Clustering Algorithm}}
13475 , address = "Box 352350, University of Washington, Seattle WA 98195"
13476 , institution = "Department of Computer Science \& Engineering"
13478 , number = {01-03-02}
13484 , title = {{Algorithm 97: Shortest path}}
13485 , journal = j-comm-acm
13492 @mastersthesis{f-astca-12
13494 , title = {{Analysis of Scheduling and Topology-Control Algorithms for Wireless Ad Hoc Networks}}
13495 , pdf = "http://i11www.ira.uka.de/extra/publications/f-astca-12.pdf"
13496 , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie"
13500 @article{f-bcacroamc-99
13501 , author = FleischerL
13502 , title = {{Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time}}
13512 , author = FortunatoS
13513 , title = {{Community detection in graphs}}
13516 , pages = {75--174}
13517 , url = "http://www.sciencedirect.com/science/journal/03701573"
13522 @Article{f-cdpgo-01
13523 , author = FelsnerS
13524 , title = {{Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes}}
13525 , journal = j-order
13534 , title = {{Comparison of Methods for Positional Analysis: {Structural} and General Equivalences}}
13536 , pages = {313--341}
13542 , author = FreemanLC
13543 , title = {{Centrality in Social Networks: Conceptual Clarification~I}}
13545 , pages = {215--239}
13551 , author = FreemanLC
13552 , title = {{The Development of Social Network Analysis: A Study in the Sociology of Science}}
13553 , publisher = pub-bsp
13558 , author = FerrarWL
13559 , title = {{Finite Matrices}}
13560 , address = "London"
13561 , publisher = pub-oup
13566 , author = FelsnerS
13567 , title = {{Geodesic Embeddings and Planar Graphs}}
13568 , journal = j-order
13570 , pages = {135--150}
13576 , author = FelsnerS
13577 , title = {{Geometric Graphs and Arrangements}}
13578 , booktitle = {{Geometric Graphs and Arrangements}}
13579 , publisher = pub-v
13583 @techreport{f-gip-96
13585 , title = {{The Graph Isomorphism Problem}}
13586 , institution = "University of Alberta, Edmonton, Canada"
13588 , url = "ftp://ftp.cs.ualberta.ca/pub/TechReports/1996/TR96-20/TR96-20.ps.gz"
13594 , title = {{Implementation of a Boltzman Sampler for planar graphs}}
13595 , url = "http://www.lix.polytechnique.fr/~fusy/Programs/BoltzmannPlanarGraphs.tar.gz"
13599 @article{f-ieabe-89
13600 , author = FernandezJC
13601 , title = {{An Implementation of an Efficient Algorithm for Bisimulation Equivalence}}
13602 , journal = "Science of Comp"
13604 , pages = {219--236}
13610 , author = FelsnerS
13611 , title = {{Lattice Structure from Planar Graphs}}
13612 , journal = j-ecomb
13618 @Article{f-ltafc-84
13619 , author = FredericksonGN
13620 , title = {{On linear-time algorithms for five-coloring planar graphs}}
13623 , pages = {219--224}
13629 , author = FreidingerM
13630 , title = {{Minimale Schnitte und Schnittb{\"a}ume}}
13631 , institution = uni_ka
13633 , note = {Student Project, Studienarbeit}
13634 , pdf = "http://i11www.ira.uka.de/extra/publications/f-mss-07.pdf"
13635 , school = "Department of Informatics"
13636 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished"
13640 @article{f-nbcspp-76
13641 , author = FredmanML
13642 , title = {{New bounds on the complexity of the shortest path problem.}}
13643 , journal = j-sicomp
13649 @techreport{f-nft-56
13651 , title = {{Network Flow Theory}}
13652 , institution = "Rand Corporation, Santa Monica, California"
13657 @Article{f-ooplm-03
13658 , author = FloaterMS
13659 , title = {{One-to-One Piecewise Linear Mappings Over Triangulations}}
13662 , pages = {685--696}
13669 , title = {{On Preprocessing the ALT-Algorithm}}
13670 , note = {Student's thesis - Karlsruhe Institute of Technology - ITI Wagner}
13671 , school = "Karlsruhe Institute of Technology - ITI Wagner"
13675 @Article{f-osrpg-48
13677 , title = {{On Straight line Representation of Planar Graphs}}
13680 , pages = {229--233}
13685 @article{f-pensm-73
13686 , author = FiedlerM
13687 , title = {{A Property of Eigenvectors of Nonnegative Symmetric matrices and its Applications to Graph Theory}}
13690 , pages = {619-633}
13695 @article{f-pensm-75
13696 , author = FiedlerM
13697 , title = {{A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory}}
13699 , pages = {619--633}
13704 @phdthesis{f-rpacn-04
13705 , author = FlinsenbergIC
13706 , title = {{Route Planning Algorithms for Car Navigation}}
13707 , school = "Technische Universiteit Eindhoven"
13711 @article{f-scees-84
13712 , author = FriedkinNE
13713 , title = {{Structural Cohesion and Equivalence Explanations of Social Homogeneity}}
13715 , pages = {235--261}
13720 @Article{f-smcbb-77
13721 , author = FreemanLC
13722 , title = {{A Set of Measures of Centrality Based Upon Betweeness}}
13725 , pdf = "http://moreno.ss.uci.edu/23.pdf"
13730 @phdthesis{f-taal-07
13731 , author = FleischerD
13732 , title = {{Theory and Applications of the Laplacian}}
13734 , school = "Department of Computer \& Information Science, University of Konstanz"
13738 @phdthesis{f-tal-07
13739 , author = FleischerD
13740 , title = {{Theory and Applications of the Laplacian}}
13741 , url = "http://www.ub.uni-konstanz.de/kops/volltexte/2008/4625"
13745 @phdthesis{f-tsema-08
13746 , author = FlotterodG
13747 , title = {{Traffic State Estimation with Multi-Agent Simulations}}
13748 , school = "Technische Universi{\"a}t Berlin"
13749 , url = "http://opus.kobv.de/tuberlin/volltexte/2008/1980/"
13755 , title = {{Uniform random sampling of planar graphs in linear time}}
13759 , pages = {464--522}
13765 , author = FreemanLC
13766 , title = {{Visualizing Social Networks}}
13769 , pdf = "http://www.cmu.edu/joss/content/articles/volume1/Freeman.pdf"
13770 , url = "http://www.cmu.edu/joss/content/articles/volume1/Freeman.html"
13775 @Article{fa-afdom-04
13776 , author = FarinaM #and# AmatoP
13777 , title = {{A Fuzzy Definition of ``Optimality'' for Many-Criteria Optimization Problems}}
13778 , journal = j-ieeetsmcpa
13780 , pages = {315--326}
13785 @InProceedings{fak-srdcg-09
13786 , author = FratiF #and# AngeliniP #and# KaufmannM
13787 , title = {{Straight-line Rectangular Drawings of Clustered Graphs}}
13788 , booktitle = {{Algorithms and Data Structures, 11th International Symposium (WADS'09)}}
13791 , pdf = "http://www.springerlink.com/content/b6p3597671888883/fulltext.pdf"
13792 , publisher = pub-springer
13793 , series = ser-springer_lncs
13794 , url = "http://www.springerlink.com/content/b6p3597671888883/"
13799 @article{fbw-cvg-91
13800 , author = FreemanLC #and# BorgattiSP #and# WhiteDR
13801 , title = {{Centrality in valued graphs: A measure of betweenness based on network flow}}
13804 , pages = {141--154}
13809 @InCollection{fc-csg-09
13810 , author = FortunatoS #and# CastellanoC
13811 , title = {{Community Structure in Graphs}}
13812 , booktitle = {{Encyclopedia of Complexity and Systems Science}}
13814 , publisher = pub-springer
13815 , url = "http://www.springer.com/physics/book/978-0-387-75888-6"
13819 @article{fd-cmfn-55
13820 , author = FulkersonDR #and# DantzigGB
13821 , title = {{Computation of Maximal Flows in Networks}}
13823 , pages = {277-283}
13828 @article{fdb-oab-96
13829 , author = FerligojA #and# DoreianP #and# BatageljV
13830 , title = {{Optimizational Approach to Blockmodeling}}
13837 @article{fdbv-srwg-01
13838 , author = FarkasI #and# DerenyiI #and# BarabasiAL #and# VicsekT
13839 , title = {{Spectra of ``real-world'' graphs: {Beyond} the semicircle law}}
13842 , url = "http://arXiv.org/abs/cond-mat/0102335"
13847 @InProceedings{ff-crpgc-11
13848 , author = FelsnerS #and# FrancisMC
13849 , title = {{Contact Representations of Planar Graphs with Cubes}}
13850 , booktitle = {{Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11)}}
13851 , pages = {315--320}
13852 , publisher = pub-acm
13857 , author = FordLR #and# FulkersonDR
13858 , title = {{Flows in Networks}}
13859 , publisher = pub-pup
13863 @article{ff-mftn-56
13864 , author = FordLR #and# FulkersonDR
13865 , title = {{Maximal flow through a network}}
13867 , pages = {399--404}
13872 @article{ff-safmnf-57
13873 , author = FordLR #and# FulkersonDR
13874 , title = {{A simple algorithm for finding maximal network flows and an application to the Hitchcock problem}}
13876 , pages = {210--218}
13881 @inproceedings{fff-plrit-99
13882 , author = FaloutsosM #and# FaloutsosP #and# FaloutsosC
13883 , title = {{On power-law relationships of the {Internet} topology}}
13884 , booktitle = {{SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication}}
13885 , doi = "http://doi.acm.org/10.1145/316188.316229"
13886 , isbn = "1-58113-135-6"
13887 , pages = {251--262}
13888 , publisher = pub-acm
13892 @article{fg-cfpcds-04
13893 , author = EisenbrandF #and# GrandoniF
13894 , title = {{On the complexity of fixed parameter clique and dominating set}}
13902 @Article{fg-imig-65
13903 , author = FulkersonDR #and# GrossOA
13904 , title = {{Incidence Matrices and Interval Graphs}}
13907 , pages = {835--855}
13913 , editor = FandelG #and# GalT
13914 , title = {{Multiple Criteria Decision Making -- Theory and Application --}}
13915 , booktitle = {{Multiple Criteria Decision Making -- Theory and Application --}}
13916 , publisher = pub-springer
13921 , author = FulkersonDR #and# HardingGC
13922 , title = {{On Edge-Disjoint Branchings}}
13923 , journal = j-networks
13925 , pages = {97--104}
13930 @InCollection{fh-gdia-01
13931 , author = FleischerR #and# HirschC
13932 , title = {{Graph Drawing and Its Applications}}
13933 , booktitle = {{Drawing Graphs: Methods and Models}}
13934 , isbn = "3-540-42062-2"
13936 , pdf = "http://springerlink.metapress.com/content/fqbuv7dec70dhcx9/fulltext.pdf"
13937 , publisher = pub-springer
13938 , series = ser-springer_lncs
13939 , url = "http://springerlink.metapress.com/content/fqbuv7dec70dhcx9/"
13944 @InProceedings{fhhklsww-dgphr-90
13945 , author = FormannM #and# HagerupT #and# HaralambidesJ #and# KaufmannM #and# LeightonFT #and# SymvonisA #and# WelzlE #and# WoegingerGJ
13946 , title = {{Drawing Graphs in the Plane with High Resolution}}
13947 , booktitle = {{Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS'90)}}
13950 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=89527"
13954 @InProceedings{fhkm-cgpp-99
13955 , author = FederT #and# HellP #and# KleinS #and# MotwaniR
13956 , title = {{Complexity of Graph Partition Problems}}
13957 , booktitle = {{Proceedings of the 31st Annual {ACM} Symposium on the Theory of Computing (STOC'99)}}
13958 , pages = {464--472}
13959 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=301373&type=pdf&coll=GUIDE&dl=GUIDE&CFID=77555843&CFTOKEN=95"
13960 , publisher = pub-acm
13961 , url = "http://doi.acm.org/10.1145/301250.301373"
13965 @InProceedings{fhkr-owpas-92
13966 , author = FurerM #and# HeXi #and# KaoM #and# RaghavachariB
13967 , title = {{$\mathcal{O}(n \log \log n)$-Work Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs}}
13968 , booktitle = {{Proceedings of the 4th Annual {ACM} Symposium on Parallel Algorithms and Architectures (SPAA'92)}}
13969 , pages = {410--419}
13970 , publisher = pub-acm
13974 @InProceedings{fhnrsw-dmmbc-12
13975 , author = FinkM #and# HaverkortH #and# NollenburgM #and# RobertsM #and# SchuhmannJ #and# WolffA
13976 , title = {{Drawing Metro Maps using B{\'e}zier Curves}}
13977 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
13978 , pages = {463--474}
13979 , pdf = "http://i11www.ira.uka.de/extra/publications/fhnrsw-dmmbc-12.pdf"
13980 , publisher = pub-springer
13981 , series = ser-springer_lncs
13982 , url = "http://dx.do.org/10.1007/978-3-642-36763-2_41"
13987 @article{fhns-rirg-02
13988 , author = FlajoletP #and# HatzisKP #and# NikoletseasS #and# SpirakisP
13989 , title = {{On the Robustness of Interconnections in Random Graphs: A Symbolic Approach}}
13993 , pages = {515--534}
13998 @InProceedings{fhs-octds-11
13999 , author = FoschiniL #and# HershbergerJ #and# SuriSu
14000 , title = {{On the Complexity of Time-Dependent Shortest Paths}}
14001 , booktitle = {{Proceedings of the 22nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'11)}}
14002 , pages = {327--341}
14003 , publisher = pub-siam
14007 @InProceedings{fi-accel-65
14008 , author = FiskCJ #and# IsettDD
14009 , title = {{{``ACCEL''} Automated Circuit Card Etching Layout}}
14010 , booktitle = {{Proceedings of the SHARE design automation project (DAC'65)}}
14011 , pages = {9.1--9.31}
14012 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=810762&type=pdf&coll=GUIDE&dl=GUIDE&CFID=37659938&CFTOKEN=52"
14013 , publisher = pub-acm
14014 , url = "http://portal.acm.org/citation.cfm?id=810762"
14018 @Article{finp-eadas-98
14019 , author = FrigioniD #and# IoffredaM #and# NanniU #and# PasqualoneG
14020 , title = {{Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem}}
14021 , journal = j-acm-ea
14028 @article{fk-ersm-81
14029 , author = FuerediZ #and# KomlosJ
14030 , title = {{The eigenvalues of random symmetric matrices}}
14033 , pages = {233--241}
14038 @article{fk-fclhcsg-00
14039 , author = FeigeU #and# KrauthgamerR
14040 , title = {{Finding and Certifying a large hidden clique in a semirandom graph}}
14043 , pages = {195--208}
14048 @Article{fk-pamb-02
14049 , author = FeigeU #and# KrauthgamerR
14050 , title = {{A Polylogarithmic Approximation of the Minimum Bisection}}
14051 , journal = j-sicomp
14053 , pages = {1090--1118}
14058 @InProceedings{fkk-vdpg-97
14059 , author = FossmeierU #and# KantG #and# KaufmannM
14060 , title = {{$2$-Visibility Drawings of Planar Graphs}}
14061 , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}}
14062 , location = "Berkeley, California, USA"
14064 , pages = {155--168}
14065 , publisher = pub-springer
14066 , series = ser-springer_lncs
14071 @article{fkp-dksp-01
14072 , author = FeigeU #and# KortsarzG #and# PelegD
14073 , title = {{The dense $k$-subgraph problem}}
14076 , pages = {410--421}
14081 @inproceedings{fkp-hot-02
14082 , author = FabrikantA #and# KoutsoupiasE #and# PapadimitriouCH
14083 , title = {{Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the {Internet}}}
14084 , booktitle = {{Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'02)}}
14085 , publisher = pub-springer
14086 , series = ser-springer_lncs
14092 , author = FahrmeirL #and# KuenstlerR #and# PigeotI #and# TutzG
14093 , title = {{Statistik, Der Weg zur Datenanalyse}}
14094 , isbn = "3-540-67826-3"
14095 , publisher = pub-springer
14099 @Article{fkrw-tcpop-00
14100 , author = FelsnerS #and# KantR #and# RanganCP #and# WagnerD
14101 , title = {{The Complexity of Partial Order Properties}}
14102 , journal = j-order
14104 , pages = {179--193}
14109 @InProceedings{flg-eiwc-00
14110 , author = FlakeGW #and# LawrenceS #and# GilesCL
14111 , title = {{Efficient Identification of Web Communities}}
14112 , booktitle = {{Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and Data Mining}}
14113 , pages = {150--160}
14114 , publisher = pub-acm
14115 , url = "http://portal.acm.org/citation.cfm?id=347121"
14119 @Article{flgc-soiwc-02
14120 , author = FlakeGW #and# LawrenceS #and# GilesCL #and# CoetzeeFM
14121 , title = {{Self-Organization and Identification of Web Communities}}
14122 , journal = j-ieeec
14125 , pdf = "http://privacy.cs.cmu.edu/dataprivacy/papers/socialnetworks/27.pdf"
14126 , url = "http://doi.ieeecomputersociety.org/10.1109/2.989932"
14131 @unpublished{fll-semeplbec-04
14132 , author = FennerT #and# LeveneM #and# LoizouG
14133 , title = {{A Stochastic Evolutionary Model Exhibiting Power-Law Behaviour with an Exponential Cutoff}}
14135 , note = {http://xxx.sissa.it/ps/cond-mat/0209463}
14139 @InProceedings{flm-falau-95
14140 , author = FrickAK #and# LudwigA #and# MehldauH
14141 , title = {{A Fast Adaptive Layout Algorithm for Undirected Graphs}}
14142 , booktitle = {{DIAMCS International Workshop}}
14143 , location = "Princeton, New Jersey, USE"
14145 , pages = {388--403}
14146 , publisher = pub-springer
14147 , series = ser-springer_lncs
14148 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/268794"
14153 @unpublished{flr-nbcd-08
14154 , author = FortunatoS #and# LancichinettiA #and# RadicchiF
14155 , title = {{New Benchmark in Community Detection}}
14156 , note = {arxiv.org/abs/0805.4770}
14157 , pdf = "http://arxiv.org/pdf/0805.4770v3"
14158 , url = "http://arxiv.org/abs/0805.4770"
14162 @Article{flzwd-a-07
14163 , author = FanY #and# LiM #and# ZhangP #and# WuJ #and# DiZ
14164 , title = {{Accuracy and precision of methods for community identification in weighted networks}}
14165 , journal = j-physa
14167 , pages = {363--372}
14168 , url = "http://www.sciencedirect.com/science/article/pii/S0378437106012386"
14173 @InProceedings{fm-a-82
14174 , author = FiducciaCM #and# MattheysesRM
14175 , title = {{A linear-time heuristic for improving network partitions}}
14176 , booktitle = {{Proceedings of the 19th ACM/IEEE Conference on Design Automation}}
14177 , pages = {175--181}
14178 , url = "http://portal.acm.org/citation.cfm?id=800263.809204"
14182 @InProceedings{fm-anaap-98
14183 , author = FialkoS #and# MutzelP
14184 , title = {{A New Approximation Algorithm for the Planar Augmentation Problem}}
14185 , booktitle = {{Proceedings of the 9th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'98)}}
14186 , pages = {260--269}
14187 , publisher = pub-siam
14191 @Article{fm-otao-01
14192 , author = deFraysseixH #and# MendezPO
14193 , title = {{On Topological Aspects of Orientations}}
14202 @article{fm-pcadba-85
14203 , author = FlajoletP #and# MartinGN
14204 , title = {{Probabilistic Counting Algorithms for Data Base Applications}}
14207 , pages = {182--209}
14208 , url = "citeseer.ist.psu.edu/flajolet85probabilistic.html"
14213 @InProceedings{fm-roaa-95
14214 , author = deFraysseixH #and# MendezPO
14215 , title = {{Regular Orientations, Arboricity, and Augmentation}}
14216 , booktitle = {{DIAMCS International Workshop}}
14217 , location = "Princeton, New Jersey, USE"
14219 , pages = {111--118}
14220 , publisher = pub-springer
14221 , series = ser-springer_lncs
14222 , url = "http://www.springerlink.com/content/pt8051p2070j/"
14228 , author = FrigioniD #and# MarchettiSpaccamelaA #and# NanniU
14229 , title = {{Fully Dynamic Algorithms for Maintaining Shortest Paths trees}}
14233 , pages = {251--281}
14239 , author = FrigioniD #and# MarchettiSpaccamelaA #and# NanniU
14240 , title = {{Fully dynamic shortest paths in digraphs with arbitrary arc weights}}
14244 , pages = {86--113}
14249 @InProceedings{fmps-sscsp-13
14250 , author = Fox-EpsteinE #and# MozesS #and# PhothilimthanaPM #and# SommerC
14251 , title = {{Short and Simple Cycle Separators in Planar Graphs}}
14252 , booktitle = {{Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX'13)}}
14254 , publisher = pub-siam
14258 @Article{fmr-dspus-62
14259 , author = FunCT #and# MullerME #and# RezuchaI
14260 , title = {{Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital-Computers}}
14263 , pages = {387--402}
14264 , url = "http://www.jstor.org/stable/2281647"
14270 , editor = FleischerR #and# MoretB #and# SchmidtEM
14271 , title = {{Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software}}
14272 , booktitle = {{Experimental Algorithmics -- From Algorithm Design to Robust and Efficient Software}}
14273 , publisher = pub-springer
14274 , series = ser-springer_lncs
14275 , url = "http://www.springerlink.com/content/0lfn7tr4lbbc/"
14281 , editor = FrancisRL #and# McGinnisLF #and# WhiteJA
14282 , title = {{Facility Layout and Location: An Analytical Approach}}
14283 , booktitle = {{Facility Layout and Location: An Analytical Approach}}
14284 , publisher = pub-ph
14288 @inproceedings{fp-ccrap-03
14289 , author = FialaJ #and# PaulusmaD
14290 , title = {{The Computational Complexity of the Role Assignment Problem}}
14291 , booktitle = {{Proceedings of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'03)}}
14292 , pages = {817--828}
14293 , publisher = pub-springer
14294 , series = ser-springer_lncs
14298 @Article{fpp-hdpgg-90
14299 , author = deFraysseixH #and# PachJ #and# PollackR
14300 , title = {{How to Draw a Planar Graph on a Grid}}
14308 @InProceedings{fpp-sssfe-88
14309 , author = deFraysseixH #and# PachJ #and# PollackR
14310 , title = {{Small Sets Supporting {F}{\'a}ry Embeddings of Planar Graphs}}
14311 , booktitle = {{Proceedings of the 20th Annual {ACM} Symposium on the Theory of Computing (STOC'88)}}
14312 , pages = {426--433}
14313 , publisher = pub-acm
14317 @Article{fr-gdfdp-91
14318 , author = FruchtermanTMJ #and# ReingoldEM
14319 , title = {{Graph Drawing by Force-Directed Placement}}
14320 , address = "New York, NY, USA"
14321 , isbn = "0038-0644"
14325 , pages = {1129--1164}
14326 , pdf = "http://cs.ubc.ca/local/reading/proceedings/spe91-95/spe/vol21/issue11/spe060tf.pdf"
14327 , publisher = pub-wileys
14332 @Article{fr-pgnwe-06
14333 , author = FakcharoenpholJ #and# RaoS
14334 , title = {{Planar Graphs, Negative Weight Edges, Shortest Paths, and near Linear Time}}
14337 , pages = {868--889}
14338 , url = "http://dx.doi.org/10.1016/j.jcss.2005.05.007"
14343 @InProceedings{frw-clmpg-09
14344 , author = FrankeR #and# RutterI #and# WagnerD
14345 , title = {{Computing Large Matchings in Planar Graphs with Fixed Minimum Degree}}
14346 , booktitle = {{Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC'09)}}
14347 , pages = {872--881}
14348 , publisher = pub-springer
14349 , series = ser-springer_lncs
14354 @Article{frw-clmpg-10
14355 , author = FrankeR #and# RutterI #and# WagnerD
14356 , title = {{Computing Large Matchings in Planar Graphs with Fixed Minimum Degree}}
14359 , pages = {4092--4099}
14360 , url = "http://dx.doi.org/10.1016/j.tcs.2010.06.012"
14365 @techreport{frw-clmpg-tr09
14366 , author = FrankeR #and# RutterI #and# WagnerD
14367 , title = {{Computing Large Matchings in Planar Graphs with Fixed Minimum Degree}}
14368 , institution = iti_wagner
14369 , number = {2009-18}
14370 , pdf = "http://i11www.ira.uka.de/extra/publications/frw-clmpg-tr09.pdf"
14371 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000012970"
14375 @techreport{fs-dksp-97
14376 , author = FeigeU #and# SeltserMA
14377 , title = {{On the densest $k$-subgraph problem}}
14378 , institution = "Department of Applied Mathematics and Computer Science, The Weizmann Institute of Scien"
14379 , number = {CS97-16}
14383 @article{fs-lman-99
14384 , author = FaustK #and# SkvoretzJ
14385 , title = {{Logit Models for Affiliation Networks}}
14388 , pages = {253--280}
14394 , author = FrankO #and# StraussD
14395 , title = {{Markov Graphs}}
14397 , pages = {832--842}
14402 @InProceedings{fs-pcchm-13
14403 , author = FunkeS #and# StorandtS
14404 , title = {{Polynomial-time Construction of Contraction Hierarchies for Multi-criteria Objectives}}
14405 , booktitle = {{Proceedings of the 15th Meeting on Algorithm Engineering and Experiments (ALENEX'13)}}
14407 , publisher = pub-siam
14411 @InProceedings{fs-psaam-11
14412 , author = FunkeS #and# StorandtS
14413 , title = {{Path Shapes: An Alternative Method for Map Matching and Fully Autonomous Self-Localization}}
14414 , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}}
14415 , pages = {319--328}
14416 , publisher = pub-acm
14420 @techreport{fs-wsm-10
14421 , title = {{Walk Score Methodology}}
14422 , institution = "Front Seat Software"
14423 , pdf = "http://blog.walkscore.com/wp-content/uploads/2010/12/WalkScoreMethodology.pdf"
14424 , url = "http://blog.walkscore.com/wp-content/uploads/2010/12/WalkScoreMethodology.pdf"
14428 @Article{fsp-dotao-08
14429 , author = FusyE #and# SchaefferG #and# PoulalhonD
14430 , title = {{Dissections, Orientations, and Trees with Applications to Optimal Mesh Encoding and Random Sampling.}}
14431 , journal = j-acmta
14438 @Article{fsr-hspatasa-06
14439 , author = FuL #and# SunD #and# RilettLR
14440 , title = {{Heuristic shortest path algorithms for transportation applications: State of the art }}
14443 , pages = {3324--3343}
14449 , author = FrankS #and# SteponaviceI #and# RebennackS
14450 , title = {{Optimal power flow: a bibliographic survey I}}
14454 , pages = {221--258}
14455 , url = "http://link.springer.com/journal/12667/3/3/page/1"
14460 @Article{fsr-oii-12
14461 , author = FrankS #and# SteponaviceI #and# RebennackS
14462 , title = {{Optimal power flow: a bibliographic survey II}}
14466 , pages = {259--289}
14467 , url = "http://link.springer.com/journal/12667/3/3/page/1"
14472 @Article{ft-fhtui-87
14473 , author = FredmanML #and# TarjanRE
14474 , title = {{Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms}}
14478 , pages = {596--615}
14484 , author = FelsnerS #and# TrotterWT
14485 , title = {{Posets and Planar Graphs}}
14489 , pages = {273--284}
14494 @Article{ftt-gcmct-04
14495 , author = FlakeGW #and# TarjanRE #and# TsioutsiouliklisK
14496 , title = {{Graph Clustering and Minimum Cut Trees}}
14499 , pages = {385--408}
14500 , pdf = "http://www.internetmathematics.org/volumes/1/4/Flake.pdf"
14501 , url = "http://www.internetmathematics.org/volumes/1.htm"
14506 @InProceedings{fvw-satca-12
14507 , author = FuchsF #and# VolkerM #and# WagnerD
14508 , title = {{Simulation-based Analysis of Topology Control Algorithms for Wireless Ad Hoc Networks}}
14509 , booktitle = {{Proceedings of the 1st Mediterranean Conference on Algorithms}}
14510 , pages = {188--202}
14511 , pdf = "http://i11www.ira.uka.de/extra/publications/fvw-satca-12.pdf"
14512 , publisher = pub-springer
14513 , url = "http://link.springer.com/chapter/10.1007/978-3-642-34862-4_14"
14517 @inproceedings{fw-cda-81
14518 , author = FienbergSE #and# WassermanS
14519 , editor = LeinhardtS
14520 , title = {{Categorical Data Analysis of a Single Sociometric Relation}}
14521 , booktitle = {{Sociological Methodology}}
14522 , pages = {156--192}
14523 , publisher = pub-jb
14528 , author = FienbergSE #and# WassermanS
14529 , title = {{Comment on an Exponential Family of Probability Distributions}}
14538 @InProceedings{fw-cpop-92
14539 , author = FelsnerS #and# WagnerD
14540 , title = {{On the complexity of partial order properties}}
14541 , booktitle = {{Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92)}}
14543 , pages = {225--235}
14544 , publisher = pub-springer
14545 , series = ser-springer_lncs
14550 @InProceedings{fw-olbsc-13
14551 , author = FuchsF #and# WagnerD
14552 , title = {{On Local Broadcasting Schedules and CONGEST Algorithms in the SINR Model}}
14553 , booktitle = {{Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS'13)}}
14554 , note = {to appear}
14558 @article{fw-tdamssp-94
14559 , author = FredmanML #and# WillardDE
14560 , title = {{Trans-dichotomous algorithms for minimum spanning trees and shortest paths}}
14563 , pages = {533--551}
14568 @InProceedings{fwl-agcfa-12
14569 , author = FotiF #and# WaddellP #and# LuxenD
14570 , title = {{A Generalized Computational Framework for
\r
14571 Accessibility: From the Pedestrian to the
\r
14572 Metropolitan Scale}}
14573 , booktitle = {{Proceedings of the 4th TRB Conference on Innovations in Travel Modeling}}
14574 , publisher = pub-trb
14575 , url = "http://onlinepubs.trb.org/onlinepubs/conferences/2012/4thITM/Papers-A/0117-000062.pdf"
14579 @InProceedings{fww-rdcmt-91
14580 , author = FormannM #and# WagnerD #and# WagnerF
14581 , title = {{Routing through a Dense Channel with Minimum Total Wire Length}}
14582 , booktitle = {{Proceedings of the 2nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'91)}}
14583 , pages = {475--482}
14584 , publisher = pub-acm
14588 @Article{fww-rdcmt-93
14589 , author = FormannM #and# WagnerD #and# WagnerF
14590 , title = {{Routing through a Dense Channel with Minimum Total Wire Length}}
14593 , pages = {267--283}
14594 , url = "http://dx.doi.org/10.1006/jagm.1993.1041"
14600 , author = FisherRA #and# YatesF
14601 , title = {{Statistical Tables for Biological, Agricultural and Medical Research}}
14602 , booktitle = {{Statistical Tables for Biological, Agricultural and Medical Research}}
14603 , publisher = pub-obl
14604 , url = "http://www.worldcat.org/oclc/14222135"
14608 @Article{fz-swos-08
14609 , author = FelsnerS #and# ZickfeldF
14610 , title = {{Schnyder Woods and Orthogonal Surfaces}}
14614 , pages = {103--126}
14619 @InCollection{fzy-spims-11
14620 , author = FengQ #and# ZhengX #and# YanC
14621 , title = {{Study and Practice of an Improving Multi-path Search Algorithm in a City Public Transportation Network}}
14622 , booktitle = {{Advanced Electrical and Electronics Engineering}}
14624 , publisher = pub-springer
14625 , series = ser-lnee
14626 , url = "http://dx.doi.org/10.1007/978-3-642-19712-3_11"
14631 %% --------------------------------------------------------------
14633 @phdthesis{g-aacte-07
14634 , author = GaertlerM
14635 , title = {{Algorithmic Aspects of Clustering -- Theory, Experimental Evaluation, and Applications in Network Analysis and Visualization}}
14636 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3097"
14638 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000006953"
14642 @phdthesis{g-aawsd-10
14644 , title = {{An Algorithmic Walk from Static to Dynamic Graph Clustering}}
14645 , institution = "KIT"
14647 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1344831"
14648 , school = "Fakult{\"a}t f{\"u}r Informatik"
14649 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000018288"
14655 , title = {{Arc-Flag Compression}}
14656 , note = {Student Reseach Project}
14657 , pdf = "http://i11www.ira.uka.de/extra/publications/g-afc-08.pdf"
14664 , title = {{An {$\mathcal{O}(V^{5/3}E^{2/3})$} Algorithm for the Maximal Flow Problem}}
14665 , journal = j-acta-inf
14666 , pages = {221--242}
14671 @Article{g-apspa-08
14672 , author = GoldbergAV
14673 , title = {{A Practical Shortest Path Algorithm with Linear Expected Time}}
14674 , journal = j-sicomp
14675 , pages = {1637--1655}
14680 @phdthesis{g-arptn-11
14681 , author = GeisbergerR
14682 , title = {{Advanced Route Planning in Transportation Networks}}
14684 , pdf = "http://algo2.iti.kit.edu/download/diss_geisberger.pdf"
14685 , school = "Karlsruhe Institute of Technology"
14690 , author = GeisbergerR
14691 , title = {{Better Approximation of Betweenness Centrality}}
14692 , note = {Student research project.}
14698 , author = GrahamRL
14699 , title = {{Bounds for Certain Multiprocessor Anomalics}}
14701 , pages = {1563--1581}
14707 , author = GrahamRL
14708 , title = {{Bounds on Multiprocessing Timing Anomalies}}
14709 , journal = j-sijam
14711 , pages = {416--429}
14716 @InCollection{g-c-05
14717 , author = GaertlerM
14718 , title = {{Clustering}}
14719 , booktitle = {{Network Analysis: Methodological Foundations}}
14721 , pages = {178--215}
14722 , pdf = "http://springerlink.metapress.com/content/19b5r48lqx3nx7gc/fulltext.pdf"
14723 , publisher = pub-springer
14724 , series = ser-springer_lncs
14725 , url = "http://springerlink.metapress.com/content/19b5r48lqx3nx7gc"
14730 @article{g-cedst-83
14731 , author = GusfieldD
14732 , title = {{Connectivity and Edge-Disjoint Spanning Trees}}
14740 @mastersthesis{g-ch-08
14741 , author = GeisbergerR
14742 , title = {{Contraction Hierarchies}}
14743 , note = {\url{http://algo2.iti.uni-karlsruhe.de/documents/routeplanning/geisberger_dipl.pdf}}
14748 @Article{g-cmmid-85
14749 , author = GonzalezTF
14750 , title = {{Clustering to Minimize the Maximum Intercluster Distance}}
14752 , pages = {293--306}
14757 @mastersthesis{g-csm-02
14758 , author = GaertlerM
14759 , title = {{Clustering with Spectral Methods}}
14761 , school = "Fachbereich Informatik und Informationswissenschaft, Universit{\"a}t Konstanz"
14762 , type = {Diplomarbeit}
14766 @techreport{g-ctnrt-09
14767 , author = GeisbergerR
14768 , title = {{Contraction of Timetable Networks with Realistic Transfers}}
14769 , institution = "ITI Sanders, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)"
14773 @InProceedings{g-ctnrt-10
14774 , author = GeisbergerR
14775 , title = {{Contraction of Timetable Networks with Realistic Transfers}}
14776 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
14779 , publisher = pub-springer
14780 , series = ser-springer_lncs
14785 @mastersthesis{g-eskqp-04
14787 , title = {{Ein Schneller Konstruktionsalgorithmus f{\"u}r eine Quickest-Path-Map bez{\"u}glich der City-Metrik}}
14788 , institution = "Deptartment of Mathematics"
14790 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/g-skqpmbcm-04.pdf"
14795 @techreport{g-etota-10
14796 , author = GeisbergerR
14797 , title = {{Engineering Time-dependent One-To-All Computation}}
14798 , institution = "ITI Sanders, Department of Informatics, Karlsruhe Institute of Technology"
14802 @techreport{g-fmds-84
14803 , author = GoldbergAV
14804 , title = {{Finding a maximum density subgraph}}
14805 , institution = "Department of Electrical Engineering and Computer Science, University of California, Ber"
14806 , number = {UCB/CSB/ 8}
14811 , author = GraetzerG
14812 , title = {{General Lattice Theory}}
14813 , publisher = pub-birk
14817 @techreport{g-hchag-10
14818 , author = GeisbergerR
14819 , title = {{Heuristic Contraction Hierarchies with Approximation Guarantee}}
14820 , institution = "ITI Sanders, Faculty of Informatics, Karlsruhe Institute of Technology"
14826 , title = {{Measurement of Inequality of Incomes}}
14830 , pages = {124--126}
14831 , url = "http://www.jstor.org/stable/10.2307/2223319"
14836 @techreport{g-nmfa-85
14837 , author = GoldbergAV
14838 , title = {{A New Max-Flow Algorithm}}
14839 , institution = "MIT Laboratory for Computer Science"
14841 , number = {MIT/LCS/TM}
14842 , type = {Technical Memo}
14846 @article{g-noecg-81
14847 , author = GoldsmithDL
14848 , title = {{On the $N$-th Order Edge-Connectivity of a Graph}}
14849 , journal = j-congr-num
14851 , pages = {375--381}
14858 , title = {{On the impact of uncertainty on some optimization problems }}
14859 , school = "ETH Z{\"u}rich"
14863 @article{g-pbdfssbc-00
14865 , title = {{Path-based depth-first search for strong and biconnected components}}
14868 , pages = {107--114}
14873 @InProceedings{g-rbran-04
14874 , author = GutmanRJ
14875 , title = {{Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks}}
14876 , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}}
14877 , pages = {100--111}
14878 , pdf = "http://i11www.ira.uka.de/extra/publications/g-rbran-04.pdf"
14879 , publisher = pub-siam
14884 , author = GilbertEN
14885 , title = {{Random Graphs}}
14888 , pages = {1141--1144}
14893 @InProceedings{g-rtadi-84
14894 , author = GuttmanA
14895 , title = {{R-Trees: A Dynamic Index Structure for Spatial Searching}}
14896 , booktitle = {{Proceedings of the 1984 ACM SIGMOD international conference on Management of data}}
14898 , publisher = pub-acm
14904 , title = {{Scaling Algorithms for Network Problems}}
14908 , pages = {148--168}
14913 @Article{g-saspp-95
14914 , author = GoldbergAV
14915 , title = {{Scaling Algorithms for the Shortest Paths Problem}}
14916 , journal = j-sicomp
14918 , pages = {494--504}
14923 @article{g-soecg-80
14924 , author = GoldsmithDL
14925 , title = {{On the Second Order Edge Connectivity of a Graph}}
14926 , journal = j-congr-num
14928 , pages = {479--484}
14933 @mastersthesis{g-svspr-09
14935 , title = {{Schematized Visualization of Shortest Paths in Road Networks}}
14937 , pdf = "http://i11www.ira.uka.de/extra/publications/g-svspr-09.pdf"
14942 @InProceedings{g-svspr-10
14944 , title = {{Schematized Visualizations of Shortest Paths in Road Networks}}
14945 , booktitle = {{Informatiktage 2010}}
14948 , series = ser-gielnilni
14953 @techreport{g-tla-89
14955 , title = {{Tools from Linear Algebra}}
14956 , institution = "University of Waterloo"
14957 , type = {Research Report}
14958 , url = "http://quoll.uwaterloo.ca/pstuff/tools.ps"
14962 @Article{g-vsmap-90
14963 , author = GusfieldD
14964 , title = {{Very simple methods for all pairs network flow analysis}}
14965 , journal = j-sicomp
14967 , pages = {143--155}
14972 @mastersthesis{g-zgme-08
14974 , title = {{Zeitexpandiertes Graphenclustern - Modellierung und Experimente}}
14975 , institution = uni_ka
14977 , note = {Diplomarbeit}
14978 , pdf = "http://i11www.ira.uka.de/extra/publications/g-zgme-08.pdf"
14979 , school = "Department of Informatics"
14980 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished"
14984 @Article{ga-fccmn-05
14985 , author = GuimeraR #and# AmaralLAN
14986 , title = {{Functional Cartography of Complex Metabolic Networks}}
14987 , journal = j-nature
14989 , pages = {895--900}
14990 , pdf = "http://www.nature.com/nature/journal/v433/n7028/pdf/nature03288.pdf"
14991 , url = "http://www.nature.com/nature/journal/v433/n7028/full/nature03288.html"
14997 , author = GelmanA #and# CarlinJB #and# SternHS #and# RubinDB
14998 , title = {{Bayesian Data Analysis}}
15001 , publisher = pub-ch
15002 , series = ser-ch_tiss
15006 @InProceedings{gd-a-04
15007 , author = GogateV #and# DechterR
15008 , title = {{A complete anytime algorithm for treewidth}}
15009 , booktitle = {{UAI'04 Proceedings of the 20th conference on Uncertainty in artificial intelligence}}
15010 , pages = {201--208}
15011 , publisher = pub-auaip
15016 , author = GleiserP #and# DanonL
15017 , title = {{Community Structure in Jazz}}
15020 , pages = {565--573}
15025 @Article{gddga-s-03
15026 , author = GuimeraR #and# DanonL #and# DiazGuileraA #and# GiraltF #and# ArenasA
15027 , title = {{Self-similar community structure in a network of human interactions}}
15035 @InProceedings{ge-s-03
15036 , author = GoelA #and# EstrinD
15037 , title = {{Simultaneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk}}
15038 , booktitle = {{Proceedings of the 14th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'03)}}
15039 , pages = {499--505}
15040 , url = "http://portal.acm.org/citation.cfm?id=644191"
15044 @Article{gg-alpac-61
15045 , author = GilmorePC #and# GomoryRE
15046 , title = {{A Linear Programming Approach to the Cutting Stock Problem}}
15050 , pages = {849--859}
15055 @Article{gg-alpac-63
15056 , author = GilmorePC #and# GomoryRE
15057 , title = {{A Linear Programming Approach to the Cutting Stock Problem-Part II}}
15061 , pages = {863--888}
15066 @InProceedings{gg-ccfnc-06
15067 , author = GiotisI #and# GuruswamiV
15068 , title = {{Correlation Clustering with a Fixed Number of Clusters}}
15069 , address = "New York, NY, USA"
15070 , booktitle = {{Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)}}
15071 , doi = "http://doi.acm.org/10.1145/1109557.1109686"
15072 , isbn = "0-89871-605-5"
15073 , pages = {1167--1176}
15074 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1109686&type=pdf&coll=GUIDE&dl=GUIDE&CFID=8627208&CFTOKEN=18"
15075 , url = "http://portal.acm.org/citation.cfm?id=1109557.1109686"
15079 @Article{gghw-caldg-10
15080 , author = GoerkeR #and# GaertlerM #and# HubnerF #and# WagnerD
15081 , title = {{Computational Aspects of Lucidity-Driven Graph Clustering}}
15084 , pages = {165--197}
15085 , pdf = "http://www.cs.brown.edu/sites/jgaa/accepted/2010/GoerkeGaertlerHuebnerWagner2010.14.2.pdf"
15086 , url = "http://www.cs.brown.edu/sites/jgaa/volume14.html"
15091 @InProceedings{ggk-mafdl-01
15092 , author = GajerP #and# GoodrichMT #and# KobourovSG
15093 , title = {{A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs}}
15094 , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}}
15096 , pages = {211--221}
15097 , pdf = "http://www.springerlink.com/content/6bnvbh219mcxe821/fulltext.pdf"
15098 , publisher = pub-springer
15099 , series = ser-springer_lncs
15100 , url = "http://www.springerlink.com/content/6bnvbh219mcxe821/"
15106 , editor = GrahamRL #and# GrotschelM #and# LovaszL
15107 , title = {{Handbook of Combinatorics (Vol. 2)}}
15108 , booktitle = {{Handbook of Combinatorics (Vol. 2)}}
15109 , publisher = pub-mitpr
15113 @InProceedings{ggpjw-rdmei-04
15114 , author = GattoM #and# GlausB #and# PeetersL #and# JacobR #and# WidmayerP
15115 , title = {{Railway Delay Management: Exploring Its Algorithmic Complexity }}
15116 , booktitle = {{Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT'04)}}
15117 , pages = {199--211}
15118 , publisher = pub-springer
15119 , series = ser-springer_lncs
15125 , author = GortlerSJ #and# GotsmanC #and# ThurstonD
15126 , title = {{Discrete one-forms on meshes and applications to 3D mesh parameterization}}
15129 , pages = {83--112}
15134 @Article{ggt-fpmfaa-89
15135 , author = GalloG #and# GrigoriadisMD #and# TarjanRE
15136 , title = {{A fast parametric maximum flow algorithm and applications}}
15137 , journal = j-sicomp
15144 @InProceedings{ggw-fmfva-08
15145 , author = GaertlerM #and# GoerkeR #and# WagnerD
15146 , title = {{Fingerprints - Means For Visual Analytics}}
15147 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
15149 , note = {as poster, see \url{http://i11www.iti.uni-karlsruhe.de/algobib/files/ggw-fmfva-08.pdf}}
15150 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gd07-poster.pdf"
15151 , publisher = pub-springer
15152 , series = ser-springer_lncs
15153 , url = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gd07-posterAbstract.pdf"
15158 @InProceedings{ggw-lvavl-08
15159 , author = GoerkeR #and# GaertlerM #and# WagnerD
15160 , title = {{LunarVis - Analytic Visualizations of Large Graphs}}
15161 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
15163 , pages = {352--364}
15164 , pdf = "http://www.springerlink.com/content/aq444257835541w5/fulltext.pdf"
15165 , publisher = pub-springer
15166 , series = ser-springer_lncs
15167 , url = "http://www.springerlink.com/content/aq444257835541w5/"
15172 @InProceedings{ggw-sdgc-07
15173 , author = GaertlerM #and# GoerkeR #and# WagnerD
15174 , title = {{Significance-Driven Graph Clustering}}
15175 , booktitle = {{Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07)}}
15176 , location = "Portland, USA"
15179 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/ggw-sdgc-07.pdf"
15180 , publisher = pub-springer
15181 , series = ser-springer_lncs
15182 , url = "http://www.springerlink.com/content/nrq6tlm286808887/?p=65f77ccbb2674a16b9a67da6bb370dc7&pi=5"
15186 @InProceedings{ggww-hceg-06
15187 , author = GaertlerM #and# GoerkeR #and# WagnerD #and# WagnerS
15188 , title = {{How to Cluster Evolving Graphs}}
15189 , booktitle = {{Proceedings of the European Conference of Complex Systems (ECCS'06)}}
15191 , note = {online available at \url{http://complexsystems.lri.fr/FinalReview/FILES/PDF/p103.pdf}}
15192 , pdf = "http://complexsystems.lri.fr/FinalReview/FILES/PDF/p103.pdf"
15193 , url = "http://cssociety.org/tiki-index.php?page=ECCS'06+Programme"
15197 @techreport{gh-cspas-04
15198 , author = GoldbergAV #and# HarrelsonC
15199 , title = {{Computing the Shortest Path: A* Search Meets Graph Theory}}
15200 , institution = "Microsoft Research"
15201 , number = {MSR-TR-200}
15205 @InProceedings{gh-cspas-05
15206 , author = GoldbergAV #and# HarrelsonC
15207 , title = {{Computing the Shortest Path: A* Search Meets Graph Theory}}
15208 , booktitle = {{Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)}}
15209 , pages = {156--165}
15210 , pdf = "http://i11www.ira.uka.de/extra/publications/gh-cspas-05.pdf"
15211 , publisher = pub-siam
15215 @Article{gh-mtnf-61
15216 , author = GomoryRE #and# HuTC
15217 , title = {{Multi-terminal network flows}}
15221 , pages = {551--570}
15227 , author = GomoryRE #and# HuTC
15228 , title = {{Synthesis of a communication network}}
15231 , pages = {348--369}
15237 , author = GyugyiL #and# HingoraniNG
15238 , title = {{Understanding FACTS. Concepts and Technology of Flexible AC Transmission
\r
15240 , booktitle = {{Understanding FACTS. Concepts and Technology of Flexible AC Transmission
\r
15242 , publisher = pub-wieeep
15246 @InProceedings{ghk-ottg-11
15247 , author = GansnerER #and# HuY #and# KobourovSG
15248 , title = {{On Touching Triangle Graphs}}
15249 , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}}
15250 , pages = {250--261}
15251 , publisher = pub-springer
15252 , series = ser-springer_lncs
15257 @InProceedings{ghkk-oprpg-10
15258 , author = GansnerER #and# HuY #and# KaufmannM #and# KobourovSG
15259 , title = {{Optimal Polygonal Representation of Planar Graphs}}
15260 , booktitle = {{Proceedings of the 9th Latin American Symposium on Theoretical Informatics (LATIN'10)}}
15261 , pages = {417--432}
15262 , series = ser-springer_lncs
15266 @InCollection{ghm-m-09
15267 , author = GeyerM #and# HillerB #and# MeinertS
15268 , title = {{Modeling}}
15269 , booktitle = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}}
15271 , publisher = pub-springer
15272 , series = ser-springer_lncs
15273 , url = "http://dx.doi.org/10.1007/978-3-642-14866-8_2"
15278 @InProceedings{ghn-blapi-11
15279 , author = GemsaA #and# HaunertJ #and# NollenburgM
15280 , title = {{Boundary-Labeling Algorithms for Panorama Images}}
15281 , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}}
15282 , pages = {289--298}
15283 , pdf = "http://i11www.ira.uka.de/extra/publications/ghn-blapi-11.pdf"
15284 , publisher = pub-acm
15285 , url = "http://dl.acm.org/authorize?6536306"
15289 @Article{ghw-dcc-11
15290 , author = GoerkeR #and# HartmannT #and# WagnerD
15291 , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}}
15294 , pages = {411--446}
15299 @techreport{ghw-dgcum-09
15300 , author = GoerkeR #and# HartmannT #and# WagnerD
15301 , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}}
15302 , institution = iti_wagner
15303 , note = {Informatik, Uni Karlsruhe, TR 2009-10}
15304 , pdf = "http://i11www.ira.uka.de/extra/publications/ghw-dgcum-09.pdf"
15305 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011476"
15309 @techreport{ghw-dgcum-11
15310 , author = GoerkeR #and# HartmannT #and# WagnerD
15311 , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}}
15312 , institution = kit_wagner
15313 , note = {Karlsruhe Reports in Informatics 2011-12}
15314 , pdf = "http://i11www.ira.uka.de/extra/publications/ghw-dgcum-11.pdf"
15315 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022477 "
15319 @InProceedings{ghw-dmctc-09
15320 , author = GoerkeR #and# HartmannT #and# WagnerD
15321 , title = {{Dynamic Graph Clustering Using Minimum-Cut Trees}}
15322 , booktitle = {{Algorithms and Data Structures, 11th International Symposium (WADS'09)}}
15324 , pages = {339--350}
15325 , pdf = "http://www.springerlink.com/content/71l74772v0723j04/fulltext.pdf"
15326 , publisher = pub-springer
15327 , series = ser-springer_lncs
15328 , url = "http://dx.doi.org/10.1007/978-3-642-03367-4_30"
15333 @inproceedings{gi-dcp-04
15334 , author = GrandoniF #and# ItalianoGF
15335 , title = {{Decremental Clique Problem}}
15336 , booktitle = {{Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'04)}}
15337 , publisher = pub-springer
15338 , series = ser-springer_lncs
15342 @inproceedings{gi-fdaec-91
15343 , author = GalilZ #and# ItalianoGF
15344 , title = {{Fully Dynamic Algorithms for Edge Connectivity Problems}}
15345 , booktitle = {{Proceedings of the 23rd Annual {ACM} Symposium on the Theory of Computing (STOC'91)}}
15347 , pages = {317--327}
15352 , author = GareyMR #and# JohnsonDS
15353 , title = {{Computers and Intractability. A Guide to the Theory of {$\mathcal{NP}$}-Completeness}}
15354 , publisher = pub-freeman
15358 @Article{gj-cnnpc-83
15359 , author = GareyMR #and# JohnsonDS
15360 , title = {{Crossing Number is NP-Complete}}
15361 , journal = j-siamjadm
15362 , pages = {312--316}
15363 , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SJMAEL000004000003000312000001"
15368 @InProceedings{gjkklm-anavu-03
15369 , author = GutwengerC #and# JuengerM #and# KleinK #and# KupkeJ #and# LeipertS #and# MutzelP
15370 , title = {{A New Approach for Visualizing UML Class Diagrams}}
15371 , booktitle = {{Proceedings ACM 2003 Symposium on Software Visualization (SOFTVIS'03)}}
15373 , pages = {179--188}
15374 , publisher = pub-acm
15378 @InProceedings{gjps-t-05
15379 , author = GattoM #and# JacobR #and# PeetersL #and# SchoebelA
15380 , title = {{The computational complexity of delay management}}
15381 , booktitle = {{Proceedings of the 31th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05)}}
15382 , pages = {227--238}
15383 , publisher = pub-springer
15384 , series = ser-springer_lncs
15389 @InCollection{gjpw-o-07
15390 , author = GattoM #and# JacobR #and# PeetersL #and# WidmayerP
15391 , title = {{On-line delay management on a single train line}}
15392 , booktitle = {{Algorithmic Methods for Railway Optimization}}
15393 , publisher = pub-springer
15394 , series = ser-springer_lncs
15399 @article{gjs-sscgp-76
15400 , author = GareyMR #and# JohnsonDS #and# StockmeyerLJ
15401 , title = {{Some Simplified {$\mathcal{NP}$}-Complete Graph Problems}}
15403 , pages = {237--267}
15408 @InProceedings{gjzyjw-raspd-12
15409 , author = GaoJun #and# JinR #and# ZhouJ #and# YuJX #and# JiangX #and# WangT
15410 , title = {{Relational Approach for Shortest Path Discovery over Large Graphs}}
15411 , booktitle = {{Proceedings of the 38th International Conference on Very Large Databases (VLDB 2012)}}
15412 , pages = {358--369}
15413 , pdf = "http://vldb.org/pvldb/vol5/p358_jungao_vldb2012.pdf"
15417 @InProceedings{gk-dglsn-05
15418 , author = GotsmanC #and# KorenI
15419 , title = {{Distributed Graph Layout for Sensor Networks}}
15420 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
15422 , pages = {273--284}
15423 , pdf = "http://www.springerlink.com/content/ynnhqatf9jnj551v/fulltext.pdf"
15424 , publisher = pub-springer
15425 , series = ser-springer_lncs
15426 , url = "http://www.springerlink.com/content/ynnhqatf9jnj551v"
15431 @InProceedings{gk-fsamf-98
15432 , author = GargN #and# KoenemannJ
15433 , title = {{Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems}}
15434 , booktitle = {{Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98)}}
15435 , pages = {300--309}
15436 , publisher = pub-ics
15440 @Article{gk-ggdip-02
15441 , author = GajerP #and# KobourovSG
15442 , title = {{GRIP: Graph Drawing with Intelligent Placement}}
15446 , pages = {203--224}
15447 , pdf = "http://www.cs.brown.edu/sites/jgaa/accepted/2002/GajerKobourov2002.6.3.pdf"
15448 , url = "http://www.cs.brown.edu/sites/jgaa/volume06.html"
15453 @InProceedings{gk-icl-07
15454 , author = GansnerER #and# KorenY
15455 , title = {{Improved Circular Layouts}}
15456 , booktitle = {{Proceedings of the 14th International Symposium on Graph Drawing (GD'06)}}
15458 , pages = {386--398}
15459 , publisher = pub-springer
15460 , series = ser-springer_lncs
15461 , url = "http://gdea.informatik.uni-koeln.de/archive/00000794/"
15466 @InProceedings{gk-m-05
15467 , author = GiridharA #and# KumarPR
15468 , title = {{Maximizing the functional lifetime of sensor networks}}
15469 , booktitle = {{Fourth International Symposium on Information Processing in Sensor Networks (IPSN 2005)}}
15471 , pdf = "http://ieeexplore.ieee.org/iel5/9840/31018/01440885.pdf?tp=&isnumber=&arnumber=1440885"
15472 , publisher = pub-ics
15473 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1440885"
15477 @Article{gkk-sesfn-01
15478 , author = GohK #and# KahngB #and# KimD
15479 , title = {{Spectra and Eigenvectors of Scale-Free Networks}}
15484 , url = "http://dx.doi.org/10.1103/PhysRevE.64.051903"
15489 @InProceedings{gkmss-tprti-11
15490 , author = GoerigkM #and# KnothM #and# MuellerHannemannM #and# SchmidtM #and# SchoebelA
15491 , title = {{The Price of Robustness in Timetable Information}}
15492 , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}}
15494 , series = ser-oasioasi
15499 @InProceedings{gkn-gdsm-05
15500 , author = GansnerER #and# KorenY #and# NorthSC
15501 , title = {{Graph Drawing by Stress Majorization}}
15502 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
15504 , pages = {239--250}
15505 , pdf = "http://www.springerlink.com/content/jrn52j7cx8grcy6v/fulltext.pdf"
15506 , publisher = pub-springer
15507 , series = ser-springer_lncs
15508 , url = "http://www.springerlink.com/content/jrn52j7cx8grcy6v/"
15513 @InProceedings{gks-rpfof-10
15514 , author = GeisbergerR #and# KobitzschM #and# SandersP
15515 , title = {{Route Planning with Flexible Objective Functions}}
15516 , booktitle = {{Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX'10)}}
15517 , pages = {124--137}
15518 , pdf = "http://www.siam.org/proceedings/alenex/2010/alx10_012_geisbergerr.pdf"
15519 , publisher = pub-siam
15523 @techreport{gkssw-aegcd-12
15524 , author = GoerkeR #and# KlugeR #and# SchummA #and# StaudtC #and# WagnerD
15525 , title = {{An Efficient Generator for Clustered Dynamic Random Networks}}
15526 , institution = kit_wagner
15527 , note = {Karlsruhe Reports in Informatics 2012,17}
15528 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/2286280"
15529 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000029825 "
15533 @InProceedings{gkssw-aegcd-12-2
15534 , author = GoerkeR #and# KlugeR #and# SchummA #and# StaudtC #and# WagnerD
15535 , title = {{An Efficient Generator for Clustered Dynamic Random Networks}}
15536 , booktitle = {{Proceedings of the 1st Mediterranean Conference on Algorithms}}
15537 , pages = {219--233}
15538 , publisher = pub-springer
15542 @Book{gkswz-amro-07
15543 , author = GeraetsF #and# KroonLG #and# SchoebelA #and# WagnerD #and# ZaroliagisC
15544 , title = {{Algorithmic Methods for Railway Optimization}}
15545 , booktitle = {{Algorithmic Methods for Railway Optimization}}
15546 , publisher = pub-springer
15547 , series = ser-springer_lncs
15552 @InProceedings{gkw-blwr-07
15553 , author = GoldbergAV #and# KaplanH #and# WerneckR
15554 , title = {{Better Landmarks Within Reach}}
15555 , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}}
15558 , publisher = pub-springer
15559 , series = ser-springer_lncs
15564 @techreport{gkw-mrcmd-06
15565 , author = GaertlerM #and# KatzB #and# WagnerD
15566 , title = {{Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks}}
15567 , institution = iti_wagner
15568 , isbn = "1432-7864"
15569 , number = {2006-17}
15570 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/3252"
15571 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000005767"
15575 @InProceedings{gkw-mrcmd-07
15576 , author = GaertlerM #and# KatzB #and# WagnerD
15577 , title = {{Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks}}
15578 , booktitle = {{Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}}
15579 , isbn = "978-3-540-69506-6"
15580 , location = "Harrachov, Czech Republic"
15582 , pages = {330--341}
15583 , pdf = "http://www.springerlink.com/content/313001434674448r/fulltext.pdf"
15584 , publisher = pub-springer
15585 , series = ser-springer_lncs
15586 , url = "http://www.springerlink.com/content/313001434674448r/"
15591 @techreport{gkw-raepp-05
15592 , author = GoldbergAV #and# KaplanH #and# WerneckR
15593 , title = {{Reach for A*: Efficient Point-to-Point Shortest Path Algorithms}}
15594 , institution = "Microsoft Research"
15595 , number = {MSR-TR-200}
15596 , pdf = "http://www.avglab.com/andrew/pub/msr-tr-2005-132.pdf"
15600 @InProceedings{gkw-raepp-06
15601 , author = GoldbergAV #and# KaplanH #and# WerneckR
15602 , title = {{Reach for A*: Efficient Point-to-Point Shortest Path Algorithms}}
15603 , booktitle = {{Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)}}
15604 , pages = {129--143}
15605 , publisher = pub-siam
15609 @InProceedings{gkw-raspa-06
15610 , author = GoldbergAV #and# KaplanH #and# WerneckR
15611 , title = {{Reach for A*: Shortest Path Algorithms with Preprocessing}}
15612 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}}
15614 , pdf = "http://i11www.ira.uka.de/extra/publications/gkw-raspa-06.pdf"
15618 @InCollection{gkw-raspa-09
15619 , author = GoldbergAV #and# KaplanH #and# WerneckR
15620 , title = {{Reach for A*: Shortest Path Algorithms with Preprocessing}}
15621 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
15622 , pages = {93--139}
15623 , publisher = pub-ams
15624 , series = ser-dimacsb
15630 , author = GolubGH #and# LoanCF
15631 , title = {{Matrix Computations}}
15633 , isbn = "0-8018-5414-8"
15634 , publisher = pub-tjhup
15638 @Article{gl-spgpt-98
15639 , author = GrossiR #and# LodiE
15640 , title = {{Simple Planar Graph Partition into Three Forests}}
15642 , pages = {121--132}
15647 @InCollection{gl-tla-95
15648 , author = GodsilC #and# LovaszL
15649 , title = {{Tools from Linear Algebra}}
15650 , booktitle = {{Handbook of Combinatorics (Vol. 2)}}
15651 , pages = {1705--1748}
15652 , pdf = "http://quoll.uwaterloo.ca/pstuff/tools.pdf"
15653 , publisher = pub-mitpr
15657 @InProceedings{gllw-hocvd-12
15658 , author = GemsaA #and# LeeD #and# LiuC #and# WagnerD
15659 , title = {{Higher Order City Voronoi Diagrams}}
15660 , booktitle = {{Proceedings of the 28th European Workshop on Computational Geometry (EuroCG'12)}}
15661 , pages = {245--248}
15665 @InProceedings{gllw-hocvd-swat-12
15666 , author = GemsaA #and# LeeD #and# LiuC #and# WagnerD
15667 , title = {{Higher Order City Voronoi Diagrams }}
15668 , booktitle = {{Proceedings of the 13th Scandinavian Symposium and Workshop on Algorithm Theory (SWAT'12)}}
15671 , publisher = pub-springer
15672 , series = ser-springer_lncs
15677 @techreport{glnsv-fdcrs-09
15678 , author = GeisbergerR #and# LuxenD #and# NeubauerS #and# SandersP #and# VolkerL
15679 , title = {{Fast Detour Computation for Ride Sharing}}
15680 , institution = "ITI Sanders, Faculty of Informatics, Universit{\"a}t Karlsruhe (TH)"
15684 @InProceedings{glp-tcrd-11
15685 , author = GoncalvesD #and# LevequeB #and# PinlouA
15686 , title = {{Triangle Contact Representations and Duality}}
15687 , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}}
15688 , publisher = pub-springer
15689 , series = ser-springer_lncs
15695 , author = GrotschelM #and# LovaszL #and# SchrijverA
15696 , title = {{The ellipsoid method and its consequences in combinatorial optimization}}
15700 , pages = {169--197}
15705 @InProceedings{glsnv-fdcrs-10
15706 , author = GeisbergerR #and# LuxenD #and# SandersP #and# NeubauerS #and# VolkerL
15707 , title = {{Fast Detour Computation for Ride Sharing}}
15708 , booktitle = {{Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10)}}
15710 , pdf = "http://drops.dagstuhl.de/opus/volltexte/2010/2752/pdf/8.pdf"
15711 , series = ser-oasioasi
15716 @InProceedings{glz-jsrle-07
15717 , author = GuY #and# LiuH #and# ZhaoB
15718 , title = {{Joint Scheduling and Routing for Lifetime Elongation in Surveillance Sensor Networks}}
15719 , booktitle = {{Proceedings of the 2nd IEEE Asia-Pacific Service Computing Conference (APSCC)}}
15720 , pages = {304--311}
15725 , author = GrimmettG #and# McDiarmidCJH
15726 , title = {{On colouring random graphs}}
15727 , journal = j-mpcps
15728 , pages = {313--324}
15733 @Article{gm-laspp-08
15734 , author = GutirrezE #and# MedagliaAL
15735 , title = {{Labeling Algorithm for the Shortest Path Problem with Turn Prohibitions with Application to Large-Scale Road Networks}}
15739 , pages = {169--182}
15744 @inproceedings{gm-ltist-01
15745 , author = GutwengerC #and# MutzelP
15746 , title = {{A Linear Time Implementation of {SPQR}-Trees}}
15747 , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}}
15750 , publisher = pub-springer
15751 , series = ser-springer_lncs
15756 @InProceedings{gm-ppdga-99
15757 , author = GutwengerC #and# MutzelP
15758 , title = {{Planar Polyline Drawings with Good Angular Resolution}}
15759 , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}}
15760 , location = "Montreal, Canada"
15762 , pages = {167--182}
15763 , publisher = pub-springer
15764 , series = ser-springer_lncs
15765 , url = "http://www.springerlink.com/content/8cm2ulm1qtc9/"
15771 , author = GoerkeR #and# MeckeS #and# BohlF
15772 , title = {{Flow Commander, a Visualisation Tool for the Push Relabel Algorithm}}
15773 , note = {Graph Drawing Competition at GD'06, Honorable Mention}
15774 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/bgm-flowCommanderDescription-06.pdf"
15775 , url = "http://i11www.iti.uni-karlsruhe.de/adw/jawsGD/GTVisualizer3D.jnlp"
15779 @InProceedings{gms-isntc-07
15780 , author = GunkelT #and# MuellerHannemannM #and# SchneeM
15781 , title = {{Improved Search for Night Train Connections}}
15782 , booktitle = {{Proceedings of the 7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'07)}}
15783 , pages = {243--258}
15784 , pdf = "http://drops.dagstuhl.de/opus/volltexte/2007/1178/pdf/07001.GunkelThorsten.Paper.1178.pdf"
15785 , series = ser-oasioasi
15786 , url = "http://drops.dagstuhl.de/opus/volltexte/2007/1178"
15790 @techreport{gmssw-dgccm-11
15791 , author = GoerkeR #and# MaillardP #and# SchummA #and# StaudtC #and# WagnerD
15792 , title = {{Dynamic Graph Clustering Combining Modularity and Smoothness}}
15793 , institution = kit_wagner
15794 , note = {Karlsruhe Reports in Informatics 2011-11 (and invitational submission to a Special Issue of the ACM Journal on Experimental Algorithmics)}
15795 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1644954"
15796 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022451"
15800 @Article{gmssw-dgccm-11a
15801 , author = GoerkeR #and# MaillardP #and# SchummA #and# StaudtC #and# WagnerD
15802 , title = {{Dynamic Graph Clustering Combining Modularity and Smoothness}}
15803 , journal = j-acm-ea
15806 , pages = {1.5:1.1--1.5:1.29}
15807 , url = "http://doi.acm.org/http://dx.doi.org/10.1145/2444016.2444021"
15812 @techreport{gmsw-mdcdg-10
15813 , author = GoerkeR #and# MaillardP #and# StaudtC #and# WagnerD
15814 , title = {{Modularity-Driven Clustering of Dynamic Graphs}}
15815 , institution = kit_wagner
15816 , note = {Informatik, Uni Karlsruhe, TR 2010-5}
15817 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1393801"
15818 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000016558"
15822 @InProceedings{gmsw-mdcdg-10a
15823 , author = GoerkeR #and# MaillardP #and# StaudtC #and# WagnerD
15824 , title = {{Modularity-Driven Clustering of Dynamic Graphs}}
15825 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
15827 , pages = {436--448}
15828 , pdf = "http://www.springerlink.com/content/5gn1w87h48035tu1/fulltext.pdf"
15829 , publisher = pub-springer
15830 , series = ser-springer_lncs
15831 , url = "http://dx.doi.org/10.1007/978-3-642-13193-6_37"
15837 , author = GionisA #and# MannilaH #and# TsaparasP
15838 , title = {{Clustering Aggregation}}
15839 , journal = j-acmtkdd
15842 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1217303&type=pdf&coll=GUIDE&dl=GUIDE&CFID=37429259&CFTOKEN=6"
15843 , url = "http://portal.acm.org/citation.cfm?id=1217299.1217303"
15848 @InProceedings{gmw-iepg-01
15849 , author = GutwengerC #and# MutzelP #and# WeiskircherR
15850 , title = {{Inserting an Edge into a Planar Graph.}}
15851 , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}}
15852 , pages = {246--255}
15856 @InProceedings{gmw-lbpim-08
15857 , author = GoussevskaiaO #and# MoscibrodaT #and# WattenhoferR
15858 , title = {{Local Broadcasting in the Physical Interference Model}}
15859 , booktitle = {{Proceedings of the 2008 joint workshop on Foundations of Mobile Computing}}
15861 , publisher = pub-acm
15865 @InCollection{gmw-mftsd-11
15866 , author = GoerkeR #and# MeckeS #and# WagnerD
15867 , title = {{Maximum Flows - Towards the Stadium During Rush Hour}}
15868 , booktitle = {{Algorithms Unplugged}}
15869 , note = {http://www-i1.informatik.rwth-aachen.de/~algorithmus/}
15870 , pages = {333--344}
15871 , publisher = pub-springer
15872 , url = "http://www.springer.com/mathematics/book/978-3-642-15327-3"
15876 @Article{gmwhec-d-10
15877 , author = GoerkeR #and# Meyer-BaseA #and# WagnerD #and# HeHuan #and# EmmettMR #and# ConradCA
15878 , title = {{Determining and interpreting correlations in lipidomic networks found in glioblastoma cells}}
15879 , journal = j-bmcsb
15882 , url = "http://www.biomedcentral.com/1752-0509/4/126"
15887 @InProceedings{gmz-sait-03
15888 , author = GkantsidisC #and# MihailM #and# ZeguraEW
15889 , title = {{Spectral Analysis of Internet Topologies}}
15890 , booktitle = {{Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
15892 , pages = {364--374}
15893 , publisher = pub-ieeecs
15894 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1208688"
15900 , author = GimenezO #and# NoyM
15901 , title = {{Asymptotic enumeration and limit laws of planar graphs }}
15905 , pages = {309--329}
15910 @article{gn-amfp-80
15911 , author = GalilZ #and# NaamadA
15912 , title = {{An {$\mathcal{O}(EV \log^2 V)$} algorithm for the maximal flow problem}}
15915 , pages = {203--217}
15921 , author = GirvanM #and# NewmanMEJ
15922 , title = {{Community structure in social and biological networks}}
15925 , pages = {7821--7826}
15930 @Article{gn-emias-93
15931 , author = GusfieldD #and# NaorD
15932 , title = {{Extracting Maximal Information About Sets of Minimum Cuts}}
15938 @InProceedings{gn-ifdl-99
15939 , author = GansnerER #and# NorthSC
15940 , title = {{Improved Force-Directed Layouts}}
15941 , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}}
15942 , location = "Montreal, Canada"
15944 , pages = {364--373}
15945 , publisher = pub-springer
15946 , series = ser-springer_lncs
15947 , url = "http://www.springerlink.com/content/8cm2ulm1qtc9/"
15952 @InProceedings{gnn-tbdml-13
15953 , author = GemsaA #and# NiedermannB #and# NollenburgM
15954 , title = {{Trajectory-Based Dynamic Map Labeling}}
15955 , booktitle = {{Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)}}
15959 @InProceedings{gnpr-agrs-10
15960 , author = GemsaA #and# NollenburgM #and# PajorT #and# RutterI
15961 , title = {{Automatic Generation of Route Sketches}}
15962 , booktitle = {{Proceedings of the 18th International Symposium on Graph Drawing (GD'10)}}
15963 , note = {Poster abstract.}
15964 , pages = {391--392}
15965 , pdf = "http://i11www.ira.uka.de/extra/publications/gnpr-agrs-10.pdf"
15966 , publisher = pub-springer
15967 , series = ser-springer_lncs
15968 , url = "http://dx.doi.org/10.1007/978-3-642-18469-7_37"
15973 @techreport{gnpr-osep-10
15974 , author = GemsaA #and# NollenburgM #and# PajorT #and# RutterI
15975 , title = {{On d-regular Schematization of Embedded Paths}}
15976 , institution = "Faculty of Informatics, Karlsruhe"
15977 , number = {2010-21}
15978 , pdf = "http://i11www.ira.uka.de/extra/publications/gnpr-osep-10.pdf"
15979 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000020426"
15983 @InProceedings{gnpr-osep-11
15984 , author = GemsaA #and# NollenburgM #and# PajorT #and# RutterI
15985 , title = {{On d-regular Schematization of Embedded Paths}}
15986 , booktitle = {{Proceedings of the 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'11)}}
15988 , pages = {260--271}
15989 , pdf = "http://i11www.ira.uka.de/extra/publications/gnpr-osep-11.pdf"
15990 , publisher = pub-springer
15991 , series = ser-springer_lncs
15992 , url = "http://dx.doi.org/10.1007/978-3-642-18381-2_22"
15997 @InProceedings{gnr-clrm-11
15998 , author = GemsaA #and# NollenburgM #and# RutterI
15999 , title = {{Consistent Labeling of Rotating Maps}}
16000 , booktitle = {{Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11)}}
16001 , pages = {171--174}
16002 , pdf = "http://i11www.ira.uka.de/extra/publications/gnr-clrm-11.pdf"
16006 @InProceedings{gnr-clrm-w-11
16007 , author = GemsaA #and# NollenburgM #and# RutterI
16008 , title = {{Consistent Labeling of Rotating Maps}}
16009 , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}}
16011 , note = {Full version available at \url{http://arxiv.org/abs/1104.5634}.}
16012 , pages = {451--462}
16013 , pdf = "http://i11www.ira.uka.de/extra/publications/gnr-clrm-w-11.pdf"
16014 , publisher = pub-springer
16015 , series = ser-springer_lncs
16016 , url = "http://dx.doi.org/10.1007/978-3-642-22300-6_38"
16021 @InProceedings{gnr-sldpl-11
16022 , author = GemsaA #and# NollenburgM #and# RutterI
16023 , title = {{Sliding Labels for Dynamic Point Labeling}}
16024 , booktitle = {{Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11)}}
16025 , pdf = "http://i11www.ira.uka.de/extra/publications/gnr-sldpl-11.pdf"
16026 , publisher = pub-utp
16031 , author = GlazJ #and# NausJ #and# WallensteinS
16032 , title = {{Scan Statistics}}
16033 , booktitle = {{Scan Statistics}}
16034 , publisher = pub-springer
16035 , series = ser-springer_stis
16036 , url = "http://www.springer.com/statistics/statistical+theory+and+methods/book/978-0-387-98819-1"
16040 @Article{gojkk-csfn-02
16041 , author = GohK #and# OhE #and# JeongH #and# KahngB #and# KimD
16042 , title = {{Classification of Scale-Free Networks}}
16046 , pages = {12583--12588}
16047 , url = "http://www.pnas.org/content/99/20/12583.full"
16052 @Article{gp-cldds-03
16053 , author = GavoilleC #and# PelegD
16054 , title = {{Compact and Localized Distributed Data Structures}}
16058 , pages = {111--120}
16063 @InProceedings{gp-daasg-04
16064 , author = GaertlerM #and# PatrignaniM
16065 , title = {{Dynamic Analysis of the Autonomous System Graph}}
16066 , booktitle = {{IPS 2004 -- Inter-Domain Performance and Simulation}}
16067 , location = "Budapest, Hunary"
16070 , url = "http://w3.tmit.bme.hu/ips2004/index.html"
16074 @Article{gppr-dlg-04
16075 , author = GavoilleC #and# PelegD #and# PerennesS #and# RazR
16076 , title = {{Distance Labeling in Graphs}}
16078 , pages = {85--112}
16083 @InProceedings{gpwz-ecjr-13
16084 , author = GemsaA #and# PajorT #and# WagnerD #and# ZuendorfT
16085 , title = {{Efficient Computation of Jogging Routes}}
16086 , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}}
16087 , pages = {272--283}
16088 , pdf = "http://i11www.ira.uka.de/extra/publications/gpwz-ecjr-13.pdf"
16089 , publisher = pub-springer
16090 , series = ser-springer_lncs
16096 , author = GodsilC #and# RoyleG
16097 , title = {{Algebraic Graph Theory}}
16098 , publisher = pub-springer
16099 , series = ser-springer_gtm
16103 @inproceedings{gr-aiidt-97
16104 , author = GovindanR #and# ReddyA
16105 , title = {{An Analysis of {Internet} Inter-Domain Topology and Route Stability}}
16106 , booktitle = {{Proceedings of the 16th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
16107 , publisher = pub-ieeecs
16111 @InProceedings{gr-aodsd-08
16112 , author = GottliebL #and# RodittyL
16113 , title = {{An Optimal Dynamic Spanner for Doubling Metric Spaces}}
16114 , booktitle = {{Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)}}
16116 , pages = {478--489}
16117 , publisher = pub-springer
16118 , series = ser-springer_lncs
16123 @Article{gr-bfdb-98
16124 , author = GoldbergAV #and# RaoS
16125 , title = {{Beyond the Flow Decomposition Barrier}}
16128 , note = {http://portal.acm.org/citation.cfm?id=290181}
16130 , pages = {783--797}
16135 @article{gr-fuucn-99
16136 , author = GoldbergAV #and# RaoS
16137 , title = {{Flows in Undirected Unit Capacity Networks}}
16138 , journal = j-sidma
16146 , editor = GillesRP #and# RuysP
16147 , title = {{Imperfections and Behaviour in Economic Organizations}}
16148 , booktitle = {{Imperfections and Behaviour in Economic Organizations}}
16149 , publisher = pub-kapg
16154 , author = GilksWR #and# RichardsonS #and# SpiegelhalterDJ
16155 , title = {{Markov Chain Monte Carlo in Practice}}
16156 , publisher = pub-ch
16157 , series = "Interdisciplinary St"
16161 @Article{grst-rpfer-12
16162 , author = GeisbergerR #and# RiceM #and# SandersP #and# TsotrasV
16163 , title = {{Route Planning with Flexible Edge Restrictions}}
16164 , journal = j-acm-ea
16171 @techreport{gs-agdcr-09
16172 , author = GoerkeR #and# StaudtC
16173 , title = {{A Generator for Dynamic Clustered Random Graphs}}
16174 , institution = iti_wagner
16175 , note = {Informatik, Uni Karlsruhe, TR 2009-7}
16176 , pdf = "http://i11www.ira.uka.de/extra/publications/gs-agdcr-09.pdf"
16177 , url = "http://i11www.iti.uni-karlsruhe.de/projects/spp1307/dyngen"
16181 @InProceedings{gs-etdmm-10
16182 , author = GeisbergerR #and# SandersP
16183 , title = {{Engineering Time-Dependent Many-to-Many Shortest Paths Computation}}
16184 , booktitle = {{Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'10)}}
16185 , series = ser-oasioasi
16190 @InProceedings{gs-hchag-10
16191 , author = GeisbergerR #and# SchieferdeckerD
16192 , title = {{Heuristic Contraction Hierarchies with Approximation Guarantee}}
16193 , booktitle = {{Proceedings of the 3rd International Symposium on Combinatorial Search (SoCS'10)}}
16194 , pdf = "http://i11www.ira.uka.de/extra/publications/gs-hchag-10.pdf"
16195 , publisher = pub-aaaip
16199 @techreport{gs-idaml-95
16200 , author = GoldbergAV #and# SilversteinC
16201 , title = {{Implementations do Dijkstra's Algorithm based on Multi-Level Buckets}}
16202 , institution = "NEC Research Institute"
16208 , author = GrinsteadCM #and# SnellJL
16209 , title = {{Introduction to Probability}}
16210 , booktitle = {{Introduction to Probability}}
16211 , publisher = pub-ams
16216 , author = GruppH #and# SchmochU
16217 , title = {{Patent statistics in the age of globalisation: new legal procedures, new analytical methods, new economic interpretation}}
16221 , pages = {377--396}
16222 , url = "doi:10.1016/S0048-7333(98)00125-5 "
16228 , author = GuimeraR #and# Sales-PardoM #and# AmaralLAN
16229 , title = {{Module identification in bipartite and directed networks}}
16233 , url = "http://link.aps.org/doi/10.1103/PhysRevE.76.036102"
16238 @Article{gsa-mfrgc-04
16239 , author = GuimeraR #and# Sales-PardoM #and# AmaralLAN
16240 , title = {{Modularity from Fluctuations in Random Graphs and Complex Networks}}
16243 , url = "http://arxiv.org/abs/cond-mat/0403660v2"
16248 @InProceedings{gss-babc-08
16249 , author = GeisbergerR #and# SandersP #and# SchultesD
16250 , title = {{Better Approximation of Betweenness Centrality}}
16251 , booktitle = {{Proceedings of the 10th Workshop on Algorithm Engineering and Experiments (ALENEX'08)}}
16253 , pages = {90--100}
16254 , publisher = pub-siam
16258 @InProceedings{gssd-chfsh-08
16259 , author = GeisbergerR #and# SandersP #and# SchultesD #and# DellingD
16260 , title = {{Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks}}
16261 , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}}
16263 , pages = {319--333}
16264 , pdf = "http://i11www.ira.uka.de/extra/publications/gssd-chfsh-08.pdf"
16265 , publisher = pub-springer
16266 , series = ser-springer_lncs
16271 @Article{gssv-erlrn-12
16272 , author = GeisbergerR #and# SandersP #and# SchultesD #and# VetterC
16273 , title = {{Exact Routing in Large Road Networks Using Contraction Hierarchies}}
16277 , pages = {388--404}
16282 @article{gst-egbdss-98
16283 , author = GriggsJR #and# SimonovitsM #and# ThomasGR
16284 , title = {{Extremal graphs with bounded densities of small subgraphs}}
16287 , pages = {185--207}
16292 @techreport{gsw-dcgc-11
16293 , author = GoerkeR #and# SchummA #and# WagnerD
16294 , title = {{Density-Constrained Graph Clustering}}
16295 , institution = kit_wagner
16296 , note = {Karlsruhe Reports in Informatics 2011-17}
16297 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1715676"
16298 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023084"
16302 @InProceedings{gsw-dcgc-11b
16303 , author = GoerkeR #and# SchummA #and# WagnerD
16304 , title = {{Density-Constrained Graph Clustering}}
16305 , booktitle = {{Algorithms and Data Structures, 12th International Symposium (WADS'11)}}
16307 , pages = {679--690}
16308 , publisher = pub-springer
16309 , series = ser-springer_lncs
16310 , url = "http://link.springer.com/chapter/10.1007/978-3-642-22300-6_58?null"
16315 @unpublished{gsw-edcgc-11
16316 , author = GoerkeR #and# SchummA #and# WagnerD
16317 , title = {{Experiments on Density-Constrained Graph Clustering}}
16319 , note = {arXiv report}
16320 , publisher = pub-apraha
16322 , url = "http://arxiv.org/abs/1112.2143v1"
16326 @InProceedings{gsw-edcgc-12
16327 , author = GoerkeR #and# SchummA #and# WagnerD
16328 , title = {{Experiments on Density-Constrained Graph Clustering}}
16329 , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}}
16331 , pdf = "http://i11www.ira.uka.de/extra/publications/gsw-edcgc-12.pdf"
16332 , publisher = pub-siam
16333 , url = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/013.pdf"
16337 @InProceedings{gt-ccurp-95
16338 , author = GargA #and# TamassiaR
16339 , title = {{On the Computational Complexity of Upward and Rectilinear Planarity Testing}}
16340 , booktitle = {{DIAMCS International Workshop}}
16341 , location = "Princeton, New Jersey, USE"
16343 , pages = {286--297}
16344 , pdf = "http://www.springerlink.com/content/p04802154821p278/fulltext.pdf"
16345 , publisher = pub-springer
16346 , series = ser-springer_lncs
16347 , url = "http://www.springerlink.com/content/p04802154821p278/"
16352 @InProceedings{gt-cta-99
16353 , author = GoldbergAV #and# TsioutsiouliklisK
16354 , title = {{Cut Tree Algorithms}}
16355 , booktitle = {{Proceedings of the 10th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'99)}}
16356 , pages = {376--385}
16357 , publisher = pub-siam
16358 , url = "http://portal.acm.org/citation.cfm?id=314590"
16362 @article{gt-ctaes-01
16363 , author = GoldbergAV #and# TsioutsiouliklisK
16364 , title = {{Cut Tree Algorithms: An Experimental Study}}
16374 , author = GilbargD #and# TrudingerNS
16375 , title = {{Elliptic Partial Differential Equations of Second Order}}
16376 , booktitle = {{Elliptic Partial Differential Equations of Second Order}}
16377 , publisher = pub-springer
16381 @Article{gt-fsanp-89
16382 , author = GabowHN #and# TarjanR
16383 , title = {{Faster Scaling Algorithms for Network Problems}}
16384 , journal = j-sicomp
16386 , pages = {1013--1036}
16391 @Article{gt-namfp-88
16392 , author = GoldbergAV #and# TarjanRE
16393 , title = {{A new approach to the maximum-flow problem}}
16396 , pages = {921--940}
16397 , pdf = "http://akira.ruc.dk/~keld/teaching/algoritmedesign_f03/artikler/08/goldberg88.pdf"
16402 @InProceedings{gt-nmcfa-97
16403 , author = GargA #and# TamassiaR
16404 , title = {{A New Minimum Cost Flow Algorithm with Applications to Graph Drawing}}
16405 , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}}
16406 , location = "Berkeley, California, USA"
16408 , pages = {201--226}
16409 , pdf = "http://www.springerlink.com/content/l7461p241v868166/fulltext.pdf"
16410 , publisher = pub-springer
16411 , series = ser-springer_lncs
16412 , url = "http://www.springerlink.com/content/l7461p241v868166/"
16417 @InProceedings{gt-pdara-94
16418 , author = GargA #and# TamassiaR
16419 , title = {{Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)}}
16420 , booktitle = {{Proceedings of the 2nd Annual European Symposium on Algorithms (ESA'94)}}
16423 , pdf = "http://www.springerlink.com/content/x5n04323wx67t41n/fulltext.pdf"
16424 , series = ser-springer_lncs
16425 , url = "http://www.springerlink.com/content/x5n04323wx67t41n/"
16431 , author = GrossJL #and# TuckerTW
16432 , title = {{Topological Graph Theory}}
16433 , booktitle = {{Topological Graph Theory}}
16434 , publisher = pub-wiley
16435 , series = ser-wisdmo
16440 , author = GargA #and# TamassiaR
16441 , title = {{Upward Planarity Testing}}
16442 , journal = j-order
16445 , pages = {109--133}
16446 , pdf = "http://www.springerlink.com/content/g732801901558738/fulltext.pdf"
16447 , url = "http://www.springerlink.com/content/g732801901558738/"
16454 , title = {{\url{https://developers.google.com/transit/gtfs/}}}
16458 @InProceedings{gv-errnt-11
16459 , author = GeisbergerR #and# VetterC
16460 , title = {{Efficient Routing in Road Networks with Turn Costs}}
16461 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
16462 , pages = {100--111}
16463 , pdf = "http://algo2.iti.kit.edu/download/turn_ch.pdf"
16464 , publisher = pub-springer
16465 , series = ser-springer_lncs
16470 @Article{gw-afdpg-00
16471 , author = GoodrichMT #and# WagnerCG
16472 , title = {{A Framework for Drawing Planar Graphs with Curves and Polylines}}
16475 , pages = {399--421}
16480 @InProceedings{gw-ccv-05
16481 , author = GoerkeR #and# WolffA
16482 , title = {{Constructing the City Voronoi diagram faster}}
16483 , booktitle = {{Proceedings of the 21st European Workshop on Computational Geometry (EWCG'05)}}
16485 , pages = {155--158}
16486 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gw-ccvdf-05a.pdf"
16490 @InProceedings{gw-ccv-05a
16491 , author = GoerkeR #and# WolffA
16492 , title = {{Constructing the City Voronoi diagram faster}}
16493 , booktitle = {{Proceedings of the 2nd International Symposium on Voronoi Diagrams in Science and Engineering (VD'05)}}
16495 , note = {Best Presentation Award}
16496 , pages = {162--172}
16497 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/gw-ccvdf-05.pdf"
16501 @InProceedings{gw-cppsp-05
16502 , author = GoldbergAV #and# WerneckR
16503 , title = {{Computing Point-to-Point Shortest Paths from External Memory}}
16504 , booktitle = {{Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05)}}
16506 , pdf = "http://i11www.ira.uka.de/extra/publications/gw-cppsp-05.pdf"
16507 , publisher = pub-siam
16511 @InProceedings{gw-hmdde-05
16512 , author = GaertlerM #and# WagnerD
16513 , title = {{A Hybrid Model for Drawing Dynamic and Evolving Graphs}}
16514 , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}}
16515 , doi = "http://dx.doi.org/10.1007/11618058_18"
16517 , pages = {189--200}
16518 , pdf = "http://www.springerlink.com/content/711061543691865v/fulltext.pdf"
16519 , publisher = pub-springer
16520 , series = ser-springer_lncs
16521 , url = "http://www.springerlink.com/content/711061543691865v/"
16526 @InCollection{gw-vlcn-07
16527 , author = GaertlerM #and# WagnerD
16528 , title = {{Visualizing Large and Complex Networks}}
16529 , booktitle = {{Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science}}
16530 , pages = {115--132}
16531 , publisher = pub-wsp
16532 , series = ser-csic
16537 @Article{gws-ccv-08
16538 , author = GoerkeR #and# WolffA #and# ShinC
16539 , title = {{Constructing the City Voronoi diagram faster}}
16540 , journal = j-ijcga
16543 , pages = {275--294}
16544 , pdf = "http://i11www.ira.uka.de/extra/publications/gws-ccv-08.pdf"
16545 , url = "http://dx.doi.org/10.1142/S0218195908002623"
16550 %% --------------------------------------------------------------
16553 , editor = HochbaumDS
16554 , title = {{Approximation Algorithms for NP-hard Problems}}
16555 , booktitle = {{Approximation Algorithms for NP-hard Problems}}
16556 , publisher = pub-cti
16561 , author = HromkovicJ
16562 , title = {{Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics}}
16563 , booktitle = {{Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics}}
16564 , publisher = pub-springer
16565 , series = ser-ttcs
16570 , editor = HolldoblerS
16571 , title = {{Ausgezeichnete Informatikdissertationen 2009}}
16572 , booktitle = {{Ausgezeichnete Informatikdissertationen 2009}}
16579 , editor = HorsterP
16580 , title = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}}
16581 , booktitle = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}}
16582 , publisher = pub-v
16586 @mastersthesis{h-anpcp-07
16588 , title = {{A Nodes Perspective of Changing Properties in Dynamic Graphs}}
16590 , note = {Diplomarbeit Informatik}
16591 , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/da-huang-07.pdf"
16593 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished"
16597 @InProceedings{h-apdmf-59
16599 , title = {{A Program to Draw Multilevel Flow Charts}}
16600 , booktitle = {{Proceedings of the Western Joint Computing Conference 1959}}
16601 , pages = {131--137}
16605 @mastersthesis{h-appsp-07
16607 , title = {{Accelerating Point-to-Point Shortest Path Computations in Large Scale Networks}}
16608 , school = "Technische Universit{\"a}t Berlin"
16612 @article{h-aripc-95
16614 , title = {{$\cal{O}$({MN}) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs}}
16615 , journal = "SIAM Journal on"
16616 , pages = {411--439}
16621 @unpublished{h-assbc-05
16623 , title = {{A Survey \& Strengthening of Barnette's Conjecture}}
16624 , note = {http://www.cs.utoronto.ca/~ahertel/}
16628 @InCollection{h-bpp-79
16630 , title = {{Bricriteria Path Problems}}
16631 , booktitle = {{Multiple Criteria Decision Making -- Theory and Application --}}
16632 , pages = {109--127}
16633 , publisher = pub-springer
16638 , author = HartvigsenD
16639 , title = {{Characterizing the flow equivalent trees of a network}}
16643 , pages = {387 --394}
16649 , author = HartiganJA
16650 , title = {{Clustering Algorithms}}
16651 , isbn = "0-471-35645-X"
16652 , publisher = pub-wileys
16653 , series = ser-wiley_ps
16659 , title = {{A Characterization of Block-Graphs}}
16660 , journal = j-can-math-bull
16670 , title = {{Conditional Connectivity}}
16671 , journal = j-networks
16672 , pages = {347--357}
16677 @mastersthesis{h-cccaa-11
16679 , title = {{Complete hierarchical Cut-Clustering: An Analysis of Guarantee and Quality}}
16680 , note = {http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished}
16681 , school = "Department of Informatics, Karlsruhe Institute of Technology (KIT)"
16682 , type = {Bachelor's thesis}
16686 @article{h-cctfcn-03
16688 , title = {{Congestion and centrality in traffic flow on complex networks}}
16691 , pages = {163-176}
16696 @mastersthesis{h-cdggq-08
16697 , author = HartmannT
16698 , title = {{Clustering Dynamic Graphs with Guaranteed Quality}}
16699 , institution = uni_ka
16701 , note = {Diplomarbeit}
16702 , pdf = "http://i11www.ira.uka.de/extra/publications/h-cdggq-08.pdf"
16703 , school = "Department of Informatics"
16704 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished#diplomarbeiten"
16708 @InProceedings{h-cecdv-96
16709 , author = HealeyCG
16710 , title = {{Choosing Effective Colours for Data Visualization}}
16711 , booktitle = {{Proceedings of the 7th IEEE Conference on Visualization '96 (VIS'96)}}
16712 , pages = {263--270}
16713 , publisher = pub-ics
16714 , url = "http://portal.acm.org/citation.cfm?id=244979.245597"
16720 , title = {{Clique is hard to approximate within $n^{1-\varepsilon}$}}
16721 , journal = j-actam
16722 , pages = {105--142}
16729 , title = {{Distributed Competition in Networks}}
16730 , booktitle = {{Distributed Competition in Networks}}
16731 , publisher = pub-vdmvdmk
16737 , title = {{An r-Dimensional Quadratic Placement Algorithm}}
16741 , pages = {219--229}
16747 , author = HutschenreutherH
16748 , title = {{Einfacher Beweis des Matrix-Ger{\"u}st-Satzes der Netzwerktheorie}}
16749 , journal = j-wzthi
16750 , pages = {403--404}
16755 @Article{h-egpdc-74
16756 , author = HakimiSL
16757 , title = {{On the Existence of Graphs with Prescribed Degrees and Connectivity}}
16758 , journal = j-sijam
16761 , pages = {154--164}
16762 , url = "http://www.jstor.org/view/00361399/di974678/97p0378s/0"
16767 @phdthesis{h-epssp-08
16769 , title = {{Engineering Planar-Separator and Shortest-Path Algorithms}}
16770 , institution = uni_ka
16771 , school = "Karlsruhe Institute of Technology (KIT) - Department of Informatics"
16772 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000009237"
16776 @incollection{h-ev-79
16777 , author = HaemersW
16778 , title = {{Eigenvalue Methods}}
16779 , booktitle = {{Packing and Covering in Combinatorics}}
16781 , publisher = pub-mc
16786 , author = HingoraniNG
16787 , title = {{Flexible AC transmission}}
16788 , journal = j-ieees
16792 , url = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=153872"
16797 @inproceedings{h-gc-83
16799 , title = {{General Connectivity}}
16800 , booktitle = {{Proceedings of the 1st Southeast Asian Graph Theory Colloquium}}
16802 , publisher = pub-springer
16803 , series = ser-springer_lnm
16808 @Article{h-gecpg-97
16810 , title = {{Grid Embedding of 4-Connected Plane Graphs}}
16813 , pages = {339--358}
16819 , editor = HeckbertPS
16820 , title = {{Graphics Gems IV}}
16821 , booktitle = {{Graphics Gems IV}}
16827 , title = {{{G}ermany INC 1996 - 2002: The Dissolution of the {G}erman Company Network}}
16828 , pdf = "http://www.socio.ethz.ch/modsim/tagungen/koeln06/Krempel_koeln06.pdf"
16834 , title = {{On graphs with a prescribed median. I}}
16836 , pages = {477-487}
16843 , title = {{Graph Theory}}
16844 , booktitle = {{Graph Theory}}
16845 , publisher = pub-aw
16851 , title = {{Hamiltonicity of maximal planar graphs and planar triangulations}}
16852 , school = "RWTH Aachen"
16853 , url = "http://darwin.bth.rwth-aachen.de/opus3/volltexte/2007/1949/"
16857 @Article{h-hebva-06
16859 , title = {{Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data}}
16862 , pages = {741--748}
16867 @mastersthesis{h-hstsp-03
16869 , title = {{Hierarchical Speed-up Techniques for Shortest-Path Algorithms}}
16871 , pdf = "http://i11www.ira.uka.de/algo/people/mholzer/publications/pdf/h-hstsp-03.pdf"
16872 , school = "University of Konstanz"
16876 @article{h-ioaci-65
16877 , author = HubbellCH
16878 , title = {{In Input-Output Approach to Clique Identification}}
16880 , pages = {377--399}
16885 @InProceedings{h-iram-00
16886 , author = HagerupT
16887 , title = {{Improved shortest paths on the word RAM}}
16888 , booktitle = {{Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'00)}}
16890 , series = ser-springer_lncs
16896 , title = {{The maximum connectivity of a graph}}
16900 , pages = {1142--1146}
16906 , author = HackbuschW
16907 , title = {{Multi-Grid Methods and Applications}}
16908 , booktitle = {{Multi-Grid Methods and Applications}}
16909 , publisher = pub-springer
16910 , series = ser-sscm
16914 @inproceedings{h-ngdcm-89
16915 , author = HolbertK
16917 , title = {{A note on graphs with distant center and median}}
16918 , address = "Gulbarza, India"
16919 , booktitle = {{Recent Studies in Graph Theory}}
16920 , pages = {155-158}
16921 , publisher = {Vishwa International}
16927 , title = {{Optimum communication spanning trees}}
16928 , journal = j-sicomp
16929 , pages = {188--195}
16934 @Article{h-ofppg-99
16936 , title = {{On Floor-Plan of Plane Graphs}}
16937 , journal = j-sicomp
16939 , pages = {2150--2167}
16944 @Article{h-ofrdp-93
16946 , title = {{On Finding the Rectangular Duals of Planar Triangular Graphs}}
16947 , journal = j-sicomp
16948 , pages = {1218--1226}
16953 @article{h-olsca-64
16954 , author = HakimiSL
16955 , title = {{Optimum location of switching centers and the absolute centers and medians of a graph}}
16957 , pages = {450--459}
16962 @article{h-pisbrv-63
16963 , author = HoeffdingW
16964 , title = {{Probability inequalities for sums of bounded random variables}}
16967 , pages = {713-721}
16974 , title = {{A Remark on the Existence of Finite Graphs (in Czech)}}
16976 , pages = {477--480}
16981 @Article{h-rsidv-62
16982 , author = HakimiSL
16983 , title = {{On Realizability of a Set of Integers as Degrees of the Vertices of a Graph. I}}
16987 , pages = {496--506}
16988 , url = "http://www.jstor.org/view/03684245/di974608/97p0075x/0"
16993 @Article{h-rsidvlg-62
16994 , author = HakimiSL
16995 , title = {{On the Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph}}
16996 , journal = j-sijam
16999 , pages = {496--506}
17006 , title = {{Some optimal inapproximability results}}
17010 , pages = {798--859}
17017 , title = {{Status and contrastatus}}
17026 , title = {{Survey on Generators for Internet Topologies at the AS Level}}
17028 , note = {Studienarbeit Informatik}
17029 , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-huang-07.pdf"
17034 @habilitation{h-srwve-03
17035 , author = HausbergerS
17036 , title = {{Simulation of Real World Vehicle Exhaust Emissions}}
17037 , publisher = {Verlag der Technisch}
17038 , school = "Technische Universit{\"a}t Graz"
17039 , series = ser-mivt
17044 @mastersthesis{h-tdgcp-08
17046 , title = {{The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map}}
17047 , institution = uni_ka
17049 , note = {Diplomarbeit}
17050 , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/da-huebner-08.pdf"
17051 , school = "Department of Informatics"
17052 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished"
17056 @InCollection{h-tppdp-94
17057 , author = HillFSJr
17058 , title = {{The Pleasures of ``Perp Dot'' Products}}
17059 , booktitle = {{Graphics Gems IV}}
17060 , pages = {138--148}
17065 , author = HaveliwalaTH
17066 , title = {{Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search}}
17069 , pages = {784--796}
17076 , title = {{\url{http://www.hacon.de}}}
17080 @InProceedings{hb-aipmn-01
17081 , author = HeinM #and# BuhlerT
17082 , title = {{An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA}}
17083 , booktitle = {{Advances in Neural Information Processing Systems 23}}
17084 , pages = {847--855}
17088 @techreport{hb-est-07
17089 , author = HartwigS #and# BuchmannM
17090 , title = {{Empty Seats Travelling}}
17091 , institution = "Nokia Research Center"
17092 , pdf = "http://research.nokia.com/files/NRC-TR-2007-003.pdf"
17097 , author = HolmstromE #and# BockN #and# BrannlundJ
17098 , title = {{Modularity density of network community divisions}}
17101 , pages = {1161--1167}
17102 , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TVK-4W0SJW8-1-R&_cdi=5537&_user=2149863&_p"
17103 , url = "http://www.sciencedirect.com/science/article/B6TVK-4W0SJW8-1/2/7d38fa63fc0a63a5adea7711ad44d741"
17110 , title = {{Handbook of Emission Factors for Road Transport 2.1}}
17112 , url = "http://www.hbefa.net/"
17118 , title = {{Handbook of Emission Factors for Road Transport 3.1}}
17120 , url = "http://www.hbefa.net/"
17124 @Article{hbv-ocvt-01
17125 , author = HalkidiM #and# BatistakisY #and# VazirgiannisM
17126 , title = {{On Clustering Validation Techniques}}
17128 , pages = {107--145}
17129 , pdf = "http://www3.itu.edu.tr/~sgunduz/courses/verimaden/paper/validity_survey.pdf"
17134 @InProceedings{hcb-eecpw-05
17135 , author = HeinzelmanWR #and# ChandrakasanA #and# BalakrishnanH
17136 , title = {{Energy-Efficient Communication Protocol for Wireless Microsensor Networks}}
17137 , booktitle = {{Proceedings of the 33rd Hawaii International Conference on System Sciences}}
17140 , url = "http://doi.ieeecomputersociety.org/10.1109/HICSS.2000.926982"
17145 @InProceedings{hdb-f-04
17146 , author = HohltB #and# DohertyL #and# BrewerEA
17147 , title = {{Flexible power scheduling for sensor networks}}
17148 , booktitle = {{Third International Symposium on Information Processing in Sensor Networks (IPSN 2004)}}
17149 , pages = {205--214}
17150 , publisher = pub-ics
17151 , url = "http://doi.acm.org/10.1145/984622.984653"
17155 @InProceedings{hdkms-ivaq-07
17156 , author = HaoMC #and# DayalU #and# KeimDA #and# MorentD #and# SchneidewindJ
17157 , title = {{Intelligent Visual Analytics Queries}}
17158 , booktitle = {{IEEE Symposium on Visual Analytics and Technology (VAST 2007)}}
17161 , publisher = pub-ieeecs
17162 , url = "http://www.ieeexplore.ieee.org/xpls/abs_all.jsp?tp=&arnumber=4389001&isnumber=4388977"
17166 @InProceedings{hel-affcd-05
17167 , author = HuangXi #and# EadesP #and# LaiW
17168 , title = {{A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization}}
17169 , booktitle = {{Proceedings of the Twenty-eighth Australasian conference on Computer Science}}
17171 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1082171&type=pdf&coll=GUIDE&dl=GUIDE&CFID=20025274&CFTOKEN=3"
17172 , publisher = pub-acsi
17173 , url = "rtal.acm.org/citation.cfm?id=1082161.1082171"
17177 @InProceedings{heql-daspd-99
17178 , author = HongS #and# EadesP #and# QuigleyA #and# LeeS
17179 , title = {{Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions}}
17180 , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}}
17181 , location = "Montreal, Canada"
17183 , pages = {198--209}
17184 , pdf = "http://www.springerlink.com/content/fmb2gl991y4gdp3a/fulltext.pdf"
17185 , publisher = pub-springer
17186 , series = ser-springer_lncs
17187 , url = "http://www.springerlink.com/content/fmb2gl991y4gdp3a/"
17192 @article{hf-lbfdc-98
17193 , author = HenzingerM #and# FredmanML
17194 , title = {{Lower Bounds for Fully Dynamic Connectivity Problems in Graphs}}
17198 , pages = {351--362}
17203 @InProceedings{hg-p-88
17204 , author = HochbaumDS #and# GoldsmithDL
17205 , title = {{Polynomial algorithm for the k-cut problem}}
17206 , booktitle = {{Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS'88)}}
17207 , pages = {444--451}
17208 , publisher = pub-ics
17209 , url = "http://dx.doi.org/10.1109/SFCS.1988.21960"
17214 , author = HeilpornG #and# GiovanniLD #and# LabbeM
17215 , title = {{Optimization models for the single delay management problem in public transportation}}
17217 , pages = {762--774}
17223 , author = HararyF #and# HageP
17224 , title = {{Eccentricity and centrality in networks}}
17227 , url = "http://dx.doi.org/10.1016/0378-8733(94)00248-9"
17233 , author = HageP #and# HararyF
17234 , title = {{Structural models in anthropology}}
17236 , publisher = pub-cup
17240 @InCollection{hhw-chcca-13
17241 , author = HamannM #and# HartmannT #and# WagnerD
17242 , title = {{Complete Hierarchical Cut-Clustering: A Case Study on Expansion and Modularity}}
17243 , note = {tp appear}
17246 @InProceedings{hhw-hpcc-13
17247 , author = HamannM #and# HartmannT #and# WagnerD
17248 , title = {{Hierarchies of Predominantly Connected Communities}}
17249 , booktitle = {{Algorithms and Data Structures, 13th International Symposium (WADS'13)}}
17250 , note = {to appear}
17251 , publisher = pub-springer
17252 , series = ser-springer_lncs
17256 @Article{hjnwc-vnlan-98
17257 , author = HuffakerB #and# JungJ #and# NemethE #and# WesselsD #and# ClaffyK
17258 , title = {{Visualization of the growth and topology of the NLANR caching hierarchy}}
17259 , journal = j-cn_isdn
17262 , pages = {2131--2139}
17263 , url = "http://dx.doi.org/10.1016/S0169-7552(98)00239-6"
17268 @InProceedings{hjr-egcpq-96
17269 , author = HuangYW #and# JingN #and# RundensteinerEA
17270 , title = {{Effective Graph Clustering for Path Queries in Digital Maps}}
17271 , booktitle = {{Proceedings of the 5th International Conference on Information and Knowledge Management}}
17272 , pages = {215--222}
17273 , publisher = pub-acm
17277 @article{hk-avcn-02
17278 , author = HolmeP #and# KimBJ #and# YoonCN #and# HanSK
17279 , title = {{Attack vulnerability of complex networks}}
17286 @inproceedings{hk-csdrw-01
17287 , author = HarelD #and# KorenY
17288 , title = {{Clustering spatial data using random walks}}
17289 , booktitle = {{Proceedings of the seventh ACM SIGKDD international conference on Knowledge Discovery and Data Mining}}
17290 , doi = "http://doi.acm.org/10.1145/502512.502552"
17291 , isbn = "1-58113-391-X"
17292 , location = "San Francisco, California"
17293 , pages = {281--286}
17294 , publisher = pub-acm
17298 @InProceedings{hk-curw-01
17299 , author = HarelD #and# KorenY
17300 , title = {{On Clustering Using Random Walks}}
17301 , booktitle = {{Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science}}
17303 , publisher = pub-springer
17304 , series = ser-springer_lncs
17309 @InProceedings{hk-dgnuv-02
17310 , author = HarelD #and# KorenY
17311 , title = {{Drawing Graphs with Non-Uniform Vertices}}
17312 , booktitle = {{Proceedings of the 6th Working Conference on Advanced Visual Interfaces (AVI'02)}}
17313 , pages = {157--166}
17314 , publisher = pub-acm
17315 , url = "http://citeseer.ist.psu.edu/harel02drawing.html"
17319 @techreport{hk-fdeca-97
17320 , author = HenzingerM #and# KingV
17321 , title = {{Fully Dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation}}
17322 , address = "Palo Alto, California"
17323 , institution = "Digital Equipment Corporation, Systems Research Center"
17325 , number = {1997-004a}
17326 , type = {SRC Technical Note}
17331 , author = HararyF #and# KodamaY
17332 , title = {{On the genus of an $n$-connected graph}}
17339 @InProceedings{hk-gdhde-03
17340 , author = HarelD #and# KorenY
17341 , title = {{Graph Drawing by High-Dimensional Embedding}}
17342 , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}}
17344 , pages = {299--345}
17345 , pdf = "http://www.springerlink.com/content/u38pbq16hb7qt87u/fulltext.pdf"
17346 , publisher = pub-springer
17347 , series = ser-springer_lncs
17348 , url = "http://www.springerlink.com/content/u38pbq16hb7qt87u/"
17353 @Article{hk-gdhde-04
17354 , author = HarelD #and# KorenY
17355 , title = {{Graph Drawing by High-Dimensional Embedding}}
17358 , pages = {195--214}
17359 , pdf = "http://www.emis.ams.org/journals/JGAA/accepted/2004/HarelKoren2004.8.2.pdf"
17360 , url = "http://www.emis.ams.org/journals/JGAA/volume08.html"
17365 @article{hk-mmtb-79
17366 , author = HararyF #and# KommelH
17367 , title = {{Matrix measures for transitivity and balance}}
17369 , pages = {199--210}
17374 @InProceedings{hk-pccoc-93
17375 , author = HeXi #and# KaoM
17376 , title = {{Parallel Construction of Canonical Ordering and Convex Drawing of Triconnected Planar Graphs}}
17377 , booktitle = {{Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93)}}
17378 , pages = {303--312}
17379 , publisher = pub-springer
17380 , series = ser-springer_lncs
17385 @techreport{hk-pgcn-03
17386 , author = HopnerM #and# KrempelL
17387 , title = {{The Politics of the {G}erman Company Network}}
17388 , institution = "MPI f{\"ur} Gesellschaftsforschung"
17390 , url = "http://www.mpi-fg-koeln.mpg.de/pu/workpap/wp03-9/wp03-9.html"
17394 @Article{hk-pgcn-04
17395 , author = HopnerM #and# KrempelL
17396 , title = {{The Politics of the {G}erman Company Network}}
17400 , pages = {339--356}
17401 , url = "http://dx.doi.org/10.1080/1024259042000304392"
17406 @InProceedings{hk-reldp-95
17407 , author = HeXi #and# KaoM
17408 , title = {{Regular Edge Labelings and Drawings of Planar Graphs}}
17409 , booktitle = {{DIAMCS International Workshop}}
17410 , location = "Princeton, New Jersey, USE"
17412 , pages = {96--103}
17413 , publisher = pub-springer
17414 , series = ser-springer_lncs
17415 , url = "http://www.springerlink.com/content/pt8051p2070j/"
17420 @techreport{hk-tsegm-03
17421 , author = HaveliwalaTH #and# KamvarSD
17422 , title = {{The second eigenvalue of the Google Matrix}}
17423 , institution = "Stanford University"
17428 @techreport{hkj-aacap-03
17429 , author = HaveliwalaTH #and# KamvarSD #and# JehG
17430 , title = {{An analytical comparison of approaches to personalized PageRank}}
17431 , institution = "Stanford University"
17436 @techreport{hkkmg-cprpe-03
17437 , author = HaveliwalaTH #and# KamvarSD #and# KleinD #and# ManningCD #and# GolubGH
17438 , title = {{Computing PageRank using Power extrapolation}}
17439 , institution = "Stanford University"
17444 @Article{hkks-tecl-04
17445 , author = HopcroftJE #and# KhanO #and# KulisB #and# SelmanB
17446 , title = {{Tracking Evolving Communities in Large Linked Networks}}
17449 , pdf = "http://www.pnas.org/content/101/suppl.1/5249.abstract"
17450 , url = "http://www.pnas.org/content/101/suppl.1/5249.abstract"
17455 @Article{hkl-ltsep-99
17456 , author = HeXi #and# KaoM #and# LuH
17457 , title = {{Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings}}
17458 , journal = j-sidma
17461 , pages = {317--325}
17466 @InProceedings{hkms-fppsp-06
17467 , author = HilgerM #and# KoehlerE #and# MoehringR #and# SchillingH
17468 , title = {{Fast Point-to-Point Shortest Path Computations with Arc-Flags}}
17469 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}}
17474 @InCollection{hkms-fppsp-09
17475 , author = HilgerM #and# KoehlerE #and# MoehringR #and# SchillingH
17476 , title = {{Fast Point-to-Point Shortest Path Computations with Arc-Flags}}
17477 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
17479 , pdf = "http://i11www.ira.uka.de/extra/publications/hkms-fppsp-08.pdf"
17480 , publisher = pub-ams
17481 , series = ser-dimacsb
17486 @unpublished{hkmst-zoldho-04
17487 , author = HolzapfelK #and# KosubS #and# MaassMG #and# SouzaA #and# TaeubigH
17488 , title = {{A zero-one law for densities of higher order}}
17489 , note = {Manuscript}
17493 @inproceedings{hkmt-cdfdc-03
17494 , author = HolzapfelK #and# KosubS #and# MaassMG #and# TaeubigH
17495 , title = {{The complexity of Detecting Fixed-Density Clusters}}
17496 , booktitle = {{Proceedings of the 5th Italian Conference on Algorithms and Complexity (CIAC'03)}}
17497 , pages = {201--212}
17498 , publisher = pub-springer
17499 , series = ser-springer_lncs
17504 @InBook{hkn-dctrs-03
17505 , author = HoTB #and# KawasakiS #and# NguyenNB
17506 , title = {{Documents Clustering Using Tolerance Rough Set Model and Its Application to Information Retrieval}}
17507 , address = "Heidelberg, Germany, Germany"
17508 , isbn = "3-7908-1529-2"
17509 , pages = {181--196}
17510 , publisher = pub-physica
17511 , url = "http://portal.acm.org/citation.cfm?id=941727&dl=&coll=GUIDE&CFID=15151515&CFTOKEN=6184618#"
17515 @Article{hkrs-fspap-97
17516 , author = HenzingerM #and# KleinPN #and# RaoS #and# SubramanianA
17517 , title = {{Faster Shortest-Path Algorithms for Planar Graphs}}
17526 @Article{hkw-icg-13
17527 , author = HartmannT #and# KappesA #and# WagnerD
17528 , title = {{Identifikation von Clustern in Graphen}}
17531 , pages = {144--152}
17532 , url = "http://www.springerlink.com/openurl.asp?genre=article&id=doi:10.1007/s00287-013-0685-0"
17537 @InProceedings{hl-amapg-95
17538 , author = HendricksonB #and# LelandR
17539 , title = {{A Multilevel Algorithm for Partitioning Graphs}}
17540 , booktitle = {{Proceedings of the 1995 ACM/IEEE conference on Supercomputing (SC'05)}}
17542 , publisher = pub-acm
17546 @techreport{hl-cfabf-97
17547 , author = HenzingerM #and# LaPoutreJA
17548 , title = {{Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs}}
17549 , address = "Palo Alto, California"
17550 , institution = "Digital Equipment Corporation, Systems Research Center"
17552 , number = {1997-021}
17553 , type = {SRC Technical Note}
17558 , author = HollandPW #and# LeinhardtS
17559 , title = {{An Exponential Family of Probability Distributions for Directed Graphs}}
17569 , author = HendricksonB #and# LelandR
17570 , title = {{The Chaco User's Guide Version 2.0}}
17571 , institution = "Sandia National Laboratories Albuquerque, NM"
17572 , pdf = "http://www.sandia.gov/~bahendr/papers/guide.ps"
17573 , url = "http://www.sandia.gov/~bahendr/chaco.html"
17578 , author = HollandPW #and# LaskeyKB #and# LeinhardtS
17579 , title = {{Stochastic Blockmodels: First Steps}}
17581 , pages = {109--137}
17586 @InProceedings{hlsww-lnsrn-04
17587 , author = HamacherHW #and# LiebersA #and# SchoebelA #and# WagnerF #and# WagnerD
17588 , title = {{Locating New Stops in a Railway Network}}
17589 , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}}
17591 , pdf = "http://kluedo.ub.uni-kl.de/volltexte/2001/1263/pdf/gelb_76.pdf"
17592 , series = ser-entcs
17593 , url = "http://kluedo.ub.uni-kl.de/volltexte/2001/1263/index.html"
17598 @article{hlt-pldfda-01
17599 , author = HolmJ #and# LichtenbergK #and# ThorupM
17600 , title = {{Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, $2$-Edge, and Biconnectivity}}
17604 , pages = {723--760}
17610 , author = HooryS #and# LinialN #and# WigdersonA
17611 , title = {{Expander graphs and their applications}}
17612 , journal = j-bull-ams
17613 , pages = {439--561}
17618 @Article{hm-avlsi-85
17619 , author = HochbaumDS #and# MaassW
17620 , title = {{Approximation schemes for covering and packing problems in image processing and VLSI}}
17624 , pages = {130--136}
17630 , author = HeW #and# MarriottK
17631 , title = {{Constrained Graph Layout}}
17632 , journal = j-const
17635 , pages = {289--314}
17636 , pdf = "http://www.csse.monash.edu.au/~marriott/HeMar98.pdf"
17637 , url = "http://www.springerlink.com/content/w75t01q7j0375182/"
17642 @InProceedings{hm-gsmrs-09
17643 , author = HongS #and# MaderM
17644 , title = {{Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints}}
17645 , booktitle = {{Proceedings of the 16th International Symposium on Graph Drawing (GD'08)}}
17646 , pages = {278--283}
17647 , publisher = pub-springer
17648 , series = ser-springer_lncs
17653 @InProceedings{hm-ttblb-12
17654 , author = HalldorssonMM #and# MitraPra
17655 , title = {{Towards Tight Bounds for Local Broadcasting}}
17656 , booktitle = {{The Eighth ACM International Workshop on Foundations of Mobile Computing}}
17658 , publisher = pub-acm
17663 , author = HGB #and# MontjoyeYd #and# ClausetA
17664 , title = {{Performance of modularity maximization in practical contexts}}
17667 , pdf = "http://pre.aps.org/pdf/PRE/v81/i4/e046106"
17668 , url = "http://pre.aps.org/abstract/PRE/v81/i4/e046106"
17674 , author = HGB #and# MontjoyeYd #and# ClausetA
17675 , title = {{The performance of modularity maximization in practical contexts}}
17677 , url = "http://arxiv.org/abs/0910.0165"
17681 @Article{hmm-gvniv-00
17682 , author = HermanI #and# MelanconG #and# MarshallMS
17683 , title = {{Graph Visualization and Navigation in Information Visualization: a Survey
\r
17689 , url = "http://doi.ieeecomputersociety.org/10.1109/2945.841119"
17694 @Article{hmpv-lbfs-00
17695 , author = HabibM #and# McConnellR #and# PaulC #and# ViennotL
17696 , title = {{Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing}}
17706 , author = HopcroftJE #and# MotwaniR #and# UllmanJD
17707 , title = {{Introduction to Automata Theory, Languages, and Computation}}
17708 , booktitle = {{Introduction to Automata Theory, Languages, and Computation}}
17709 , publisher = pub-pie
17713 @article{hn-dcht-53
17714 , author = HararyF #and# NormanR
17715 , title = {{The dissimilarity characteristic of Husimi trees}}
17716 , journal = j-amath
17718 , pages = {134--141}
17723 @Article{hnr-afbhd-68
17724 , author = HartPE #and# NilssonN #and# RaphaelB
17725 , title = {{A Formal Basis for the Heuristic Determination of Minimum Cost Paths}}
17726 , journal = j-ieeetssc
17727 , pages = {100--107}
17733 , author = HenningMA #and# OellermannOR
17734 , title = {{The average connectivity of a digraph}}
17738 , pages = {143--153}
17743 @inproceedings{ho-fafmc-92
17744 , author = HaoJ #and# OrlinJB
17745 , title = {{A Faster Algorithm for Finding the Minimum Cut in a Graph}}
17746 , booktitle = {{Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)}}
17748 , pages = {165--174}
17752 @article{hp-bctg-66
17753 , author = HararyF #and# PrinsG
17754 , title = {{The block-cutpoint-tree of a graph}}
17756 , pages = {103--107}
17761 @article{hp-frmma-98
17762 , author = HuangX #and# PanVY
17763 , title = {{Fast rectangular matrix multiplication and applications}}
17766 , pages = {257--299}
17772 , editor = HuX #and# PanY
17773 , title = {{Knowledge Discovery in Bioinformatics}}
17774 , booktitle = {{Knowledge Discovery in Bioinformatics}}
17776 , publisher = pub-wileys
17777 , url = "http://www3.interscience.wiley.com/cgi-bin/bookhome/114268837/"
17781 @techreport{hp-leeaf-00
17782 , author = HeuvelJ #and# PejicS
17783 , title = {{Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems}}
17784 , address = "Department of Mathematics, London School of Economics, Houghton Street, London WC2AE, UK"
17785 , institution = "Centre for Discrete and Applicable Mathematics"
17787 , number = {LSE-CDAM-2}
17788 , url = "http://www.cdam.lse.ac.uk/Reports/Files/cdam-2000-20.pdf"
17792 @article{hp-tggpd-57
17793 , author = HararyF #and# PaperH
17794 , title = {{Toward a General Calculus of Phonemic Distribution}}
17796 , pages = {143--169}
17801 @InProceedings{hpswz-epsa-05
17802 , author = HolzerM #and# PrasinosG #and# SchulzF #and# WagnerD #and# ZaroliagisC
17803 , title = {{Engineering Planar Separator Algorithms}}
17804 , booktitle = {{Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05)}}
17805 , pages = {628--639}
17806 , publisher = pub-springer
17807 , series = ser-springer_lncs
17812 @InProceedings{hr-altat-91
17813 , author = HsuT #and# RamachandranV
17814 , title = {{A Linear Time Algorithm for Triconnectivity Augmentation}}
17815 , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}}
17817 , pages = {548--559}
17822 , author = HannemanR #and# RiddleM
17823 , title = {{Introduction to social network methods}}
17824 , booktitle = {{Introduction to social network methods}}
17825 , publisher = pub-ucr
17826 , url = "http://faculty.ucr.edu/~hanneman/"
17830 @InProceedings{hr-ofsab-91
17831 , author = HsuT #and# RamachandranV
17832 , title = {{On Finding a Smallest Augmentation to Biconnect a Graph}}
17833 , booktitle = {{Proceedings of the 2nd International Symposium on Algorithms (ISA'91)}}
17834 , pages = {326--335}
17835 , publisher = pub-springer
17836 , series = ser-springer_lncs
17841 @article{hr-pcdugm-57
17842 , author = HararyF #and# RossIC
17843 , title = {{A procedure for clique detection using the group matrix}}
17845 , pages = {205--215}
17850 @inproceedings{hrg-cvc-96
17851 , author = HenzingerM #and# RaoS #and# GabowHN
17852 , title = {{Computing Vertex Connectivity: New Bounds from Old Techniques}}
17853 , booktitle = {{Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS'96)}}
17855 , pages = {462--471}
17859 @InProceedings{hrr-capg-12
17860 , author = HartmannT #and# RollinJ #and# RutterI
17861 , title = {{Cubic Augmentation of Planar Graphs}}
17862 , booktitle = {{Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)}}
17863 , note = {http://arxiv.org/abs/1209.3865}
17864 , publisher = pub-springer
17865 , series = ser-springer_lncs
17870 @Book{hrrs-bhhci-08
17871 , editor = HarperR #and# RoddenT #and# RogersY #and# SellenA
17872 , title = {{Being Human - Human-Computer Interaction in the Year 2020}}
17873 , booktitle = {{Being Human - Human-Computer Interaction in the Year 2020}}
17874 , pdf = "http://research.microsoft.com/en-us/um/cambridge/projects/hci2020/downloads/BeingHuman_A3.pdf"
17875 , publisher = pub-mrl
17880 , author = HinzeS #and# ReissT #and# SchmochU
17881 , title = {{Statistical Analysis on the Distance Between Fields of Technology}}
17882 , institution = "Fraunhofer ISI"
17883 , note = {Report for Research Project Innovation Systems and European Integration (ISI), funded by the European Commission}
17884 , pdf = "http://publica.fraunhofer.de/eprints/urn:nbn:de:0011-px-570209.pdf"
17885 , url = "http://publica.fraunhofer.de/documents/PX-57020.html"
17890 , author = HamacherHW #and# RuzikaS #and# TjandraSA
17891 , title = {{Algorithms for time-dependent bicriteria shortest path problems}}
17895 , pages = {238--254}
17896 , url = "http://www.sciencedirect.com/science/article/B7GWV-4KF789Y-1/2/89819292a39b448f474c5dbbd4ebc432"
17901 @techreport{hrzl-efmph-09
17902 , author = HausbergerS #and# RexeisM #and# ZallingerM #and# LuzR
17903 , title = {{Emission Factors from the Model PHEM for the HBEFA Version 3}}
17904 , institution = "University of Technology, Graz"
17905 , number = {I-20/2009}
17909 @Article{hs-aasld-98
17910 , author = HarelD #and# SardasM
17911 , title = {{An Algorithm for Straight-Line Drawing of Planar Graphs}}
17913 , pages = {119--135}
17918 @Article{hs-cabgc-00
17919 , author = HartuvE #and# ShamirR
17920 , title = {{A Clustering Algorithm based on Graph Connectivity}}
17923 , pages = {175--181}
17928 @Article{hs-dbsd-99
17929 , author = HjaltasonG #and# SametH
17930 , title = {{Distance Browsing in Spatial Databases}}
17931 , journal = j-acmtds
17932 , pages = {265--318}
17938 , editor = HahnG #and# SabidussiG
17939 , title = {{Graph Symmetry: Algebraic Methods and Applications}}
17940 , booktitle = {{Graph Symmetry: Algebraic Methods and Applications}}
17941 , publisher = pub-kapg
17942 , series = ser-nato_ac
17948 , author = HeH #and# SykoraO
17949 , title = {{New Circular Drawing Algorithms}}
17950 , note = {unpublished manuscript}
17951 , pdf = "http://dspace.lboro.ac.uk/dspace/bitstream/2134/2386/3/HeSyk04.pdf"
17955 @article{hs-sctfg-89
17956 , author = HoraudR #and# SkordasT
17957 , title = {{Stereo Correspondence Through Feature Grouping and Maximal Cliques}}
17958 , journal = j-tpami
17960 , pages = {1168--1180}
17961 , publisher = pub-ics
17967 , author = HochbaumDS #and# ShmoysDB
17968 , title = {{Using dual approximation algorithms for scheduling problems theoretical and practical results}}
17972 , pages = {144--162}
17977 @InProceedings{hss-eshqg-10
17978 , author = HoltgreweM #and# SandersP #and# SchulzC
17979 , title = {{Engineering a Scalable High Quality Graph Partitioner}}
17980 , booktitle = {{24th International Parallel and Distributed Processing Symposium (IPDPS'10)}}
17982 , publisher = pub-ics
17986 @InProceedings{hsw-cstsp-04
17987 , author = HolzerM #and# SchulzF #and# WillhalmT
17988 , title = {{Combining Speed-up Techniques for Shortest-Path Computations}}
17989 , booktitle = {{Proceedings of the 3rd Workshop on Experimental Algorithms (WEA'04)}}
17990 , pages = {269--284}
17991 , publisher = pub-springer
17992 , series = ser-springer_lncs
17997 @InProceedings{hsw-emlog-06
17998 , author = HolzerM #and# SchulzF #and# WagnerD
17999 , title = {{Engineering Multi-Level Overlay Graphs for Shortest-Path Queries}}
18000 , booktitle = {{Proceedings of the 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06)}}
18001 , pages = {156--170}
18002 , publisher = pub-siam
18006 @Article{hsw-emlog-08
18007 , author = HolzerM #and# SchulzF #and# WagnerD
18008 , title = {{Engineering Multilevel Overlay Graphs for Shortest-Path Queries}}
18009 , journal = j-acm-ea
18013 , pdf = "http://i11www.ira.uka.de/algo/people/mholzer/publications/pdf/hsw-emlog-07.pdf"
18018 @Article{hswpz-epsa-09
18019 , author = HolzerM #and# SchulzF #and# WagnerD #and# PrasinosG #and# ZaroliagisC
18020 , title = {{Engineering planar separator algorithms}}
18021 , journal = j-acm-ea
18024 , url = "http://doi.acm.org/10.1145/1498698.1571635"
18029 @Article{hsww-cstsp-06
18030 , author = HolzerM #and# SchulzF #and# WagnerD #and# WillhalmT
18031 , title = {{Combining Speed-up Techniques for Shortest-Path Computations}}
18032 , journal = j-acm-ea
18039 @article{ht-dgtc-73
18040 , author = HopcroftJE #and# TarjanRE
18041 , title = {{Dividing a graph into triconnected components}}
18042 , journal = j-sicomp
18045 , pages = {135--158}
18050 @techreport{ht-dgtc-74
18051 , author = HopcroftJE #and# TarjanRE
18052 , title = {{Dividing a Graph into Triconnected Components}}
18053 , address = "Ithaca, N.Y."
18054 , institution = "CS Dept., Cornell University"
18056 , number = {TR 74-197}
18060 @article{ht-eagm-73
18061 , author = HopcroftJE #and# TarjanRE
18062 , title = {{Efficient Algorithms for Graph Manipulation}}
18063 , journal = j-comm-acm
18066 , pages = {372--378}
18072 , author = HopcroftJE #and# TarjanRE
18073 , title = {{Efficient Planarity Testing}}
18077 , pages = {549--568}
18082 @techreport{ht-ftcg-72
18083 , author = HopcroftJE #and# TarjanRE
18084 , title = {{Finding the Triconnected Components of a Graph}}
18085 , address = "Ithaca, N.Y."
18086 , institution = "CS Dept., Cornell University"
18088 , number = {TR 72-140}
18092 @Article{ht-tcpws-05
18093 , author = HuangC #and# TsengY
18094 , title = {{The Coverage Problem in a Wireless Sensor Network}}
18098 , pages = {519--528}
18103 @InProceedings{hw-fsfdc-12
18104 , author = HartmannT #and# WagnerD
18105 , title = {{Fast and Simple Fully-Dynamic Cut Tree Construction}}
18106 , booktitle = {{Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)}}
18107 , pages = {95--104}
18108 , publisher = pub-springer
18109 , series = ser-springer_lncs
18114 @inproceedings{hw-ltaip-74
18115 , author = HopcroftJE #and# WongJK
18116 , title = {{A linear time algorithm for isomorphism of planar graphs}}
18117 , booktitle = {{proc-stoc-74}}
18118 , pages = {172--184}
18122 @InProceedings{hw-odaps-12
18123 , author = HolzerS #and# WattenhoferR
18124 , title = {{Optimal Distributed All Pairs Shortest Paths and Applications}}
18125 , booktitle = {{Proceedings of the 31th ACM Symposium on Principles of Distributed Computing}}
18126 , pages = {355--364}
18127 , publisher = pub-acm
18132 , author = HuaC #and# YumTP
18133 , title = {{Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks}}
18139 @Article{hyi-ailsa-08
18140 , author = HashimotoH #and# YagiuraM #and# IbarakiT
18141 , title = {{An Iterated Local Search Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows}}
18143 , pages = {434--456}
18148 %% --------------------------------------------------------------
18151 , author = IversonK
18152 , title = {{A Programming Language}}
18153 , publisher = pub-wiley
18157 @InProceedings{ige-ddsrc-00
18158 , author = IntanagonwiwatC #and# GovindanR #and# EstrinD
18159 , title = {{Directed Diffusion: a Scalable and Robust Communication Paradigm for Sensor Networks}}
18160 , booktitle = {{Proceedings of the 6th annual international conference on Mobile computing and networking}}
18162 , url = "http://doi.acm.org/10.1145/345910.345920"
18166 @Article{igehs-d-03
18167 , author = IntanagonwiwatC #and# GovindanR #and# EstrinD #and# HeidemannJ #and# SilvaF
18168 , title = {{Directed diffusion for wireless sensor networking}}
18173 , url = "http://portal.acm.org/citation.cfm?id=638335"
18178 @Article{igp-vdtdt-03
18179 , author = IchouaS #and# GendreauM #and# PotvinJY
18180 , title = {{Vehicle Dispatching with Time-Dependent Travel Times}}
18182 , pages = {379--396}
18187 @InProceedings{ihinshtm-aai-94
18188 , author = IkedaT #and# HsuM #and# ImaiH #and# NishimuraS #and# ShimouraH #and# HashimotoT #and# TenmokuK #and# MitohK
18189 , title = {{A fast algorithm for finding better routes by AI search techniques}}
18190 , booktitle = {{Proceedings of the Vehicle Navigation and Information Systems Conference (VNSI'94)}}
18191 , pages = {291--296}
18192 , publisher = pub-acm
18197 , author = ImaiH #and# IriM
18198 , title = {{An optimal algorithm for approximating a piecewise linear function}}
18201 , pages = {159--162}
18206 @InProceedings{ik-a-08
18207 , author = ILY #and# KikuoY
18208 , title = {{A framework for fast community extraction of large-scale networks}}
18209 , booktitle = {{Proceedings of the 17th International World Wide Web Conference (WWW2008)}}
18210 , pages = {1215--1216}
18211 , url = "http://doi.acm.org/10.1145/1367497.1367733"
18215 @Article{ik-faaks-75
18216 , author = IbarraOH #and# KimCE
18217 , title = {{Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems}}
18221 , pages = {463--468}
18226 @inproceedings{im-lde-04
18227 , author = IndykP #and# MatousekJ
18228 , editor = GoodmanJE #and# OrourkeJ
18229 , title = {{Low-Distortion Embeddings of Finite Metric Spaces}}
18230 , booktitle = {{Handbook of Discrete and Computational Geometry}}
18233 , publisher = pub-ch
18237 @InProceedings{ini-oamge-98
18238 , author = IshiiT #and# NagamochiH #and# IbarakiT
18239 , title = {{Optimal Augmentaion to Make a Graph $k$-Edge-Connected and Triconnected}}
18240 , booktitle = {{Proceedings of the 9th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'98)}}
18241 , pages = {280--289}
18242 , publisher = pub-siam
18246 @InProceedings{ioai-mnsem-91
18247 , author = IshikawaK #and# OgawaM #and# AzumaM #and# ItoT
18248 , title = {{Map Navigation Software of the Electro-Multivision of the 91 Toyoto Soarer}}
18249 , booktitle = {{Proceedings of the Vehicle Navigation and Information Systems Conference (VNIS'91)}}
18250 , pages = {463--473}
18251 , publisher = pub-ics
18255 @article{ir-fmcg-78
18256 , author = ItaiA #and# RodehM
18257 , title = {{Finding a minimum circuit in a graph}}
18258 , journal = j-sicomp
18260 , pages = {413-423}
18265 @Article{ir-tmtar-88
18266 , author = ItaiA #and# RodehM
18267 , title = {{The Multi-Tree Approach to Reliability in Distributed Networks}}
18275 %% --------------------------------------------------------------
18278 , author = JohnsonDS
18279 , title = {{Approximation Algorithms for Combinatorial Problems}}
18282 , pages = {256--278}
18287 @Article{j-andsp-73
18288 , author = JohnsonDB
18289 , title = {{A Note on Dijkstra's Shortest Path Algorithm}}
18293 , pages = {385--388}
18294 , url = "http://doi.acm.org/10.1145/321765.321768"
18299 @article{j-asmisp-86
18301 , title = {{An ${O}(2^{0.304n})$ Algorithm for Solving Maximum Independent Set Problem}}
18304 , pages = {847--851}
18309 @phdthesis{j-dpch-02
18311 , title = {{Dynamic Planar Convex Hull}}
18312 , institution = "University of Aarhus"
18313 , pdf = "http://www.brics.dk/DS/02/3/BRICS-DS-02-3.pdf"
18314 , school = "BRICS Research Centre"
18315 , series = ser-bricsds
18316 , url = "http://www.brics.dk/DS/02/3/"
18320 @Article{j-easps-77
18321 , author = JohnsonDB
18322 , title = {{Efficient Algorithms for Shortest Paths in Sparse Networks}}
18332 , author = JungnickelD
18333 , title = {{Graphs, Networks and Algorithms}}
18334 , booktitle = {{Graphs, Networks and Algorithms}}
18335 , publisher = pub-springer
18337 , url = "http://www.springerlink.com/content/u78m0u/"
18344 , title = {{Introduction to Parallel Algorithms}}
18345 , booktitle = {{Introduction to Parallel Algorithms}}
18346 , publisher = pub-aw
18350 @article{j-lcemp-92
18352 , title = {{Large cliques elude the Metropolis process}}
18355 , pages = {347--359}
18360 @Article{j-nccog-82
18361 , author = JohnsonDS
18362 , title = {{The NP-Completeness Column: An Ongoing Guide}}
18367 , url = "http://dx.doi.org/10.1016/0196-6774(82)90011-6"
18372 @article{j-orscc-93
18374 , title = {{I/O- and {CPU}-optimal recognition of strongly connected components}}
18378 , pages = {111--115}
18383 @article{j-otsrg-78
18385 , title = {{On the spectrum of a random graph}}
18386 , journal = j-cmsjb
18387 , pages = {313--316}
18393 , author = JolliffeIT
18394 , title = {{Principal Component Analysis}}
18395 , publisher = pub-springer
18401 , title = {{Sur les assemblages de lignes}}
18402 , journal = "Journal f{\"u}r"
18403 , pages = {185--190}
18409 , author = JokschHC
18410 , title = {{The shortest route problem with constraints}}
18413 , pages = {191--197}
18414 , url = "http://dx.doi.org/10.1016/0022-247X(66)90020-5"
18419 @InProceedings{j-tgeaa-02
18420 , author = JohnsonDS
18421 , title = {{A Theoretician's Guide to the Experimental Analysis of Algorithms}}
18422 , booktitle = {{Data Structures, Near Neighbor Searches, and Methodology: Proceedings of the Fifth and Sixth DIMACS Implementation Challenges}}
18423 , pages = {215--250}
18424 , pdf = "http://public.research.att.com/~dsj/papers/experguide.pdf"
18425 , publisher = pub-ams
18426 , url = "http://public.research.att.com/~dsj/pub.html"
18431 @techreport{jcj-itg-00
18432 , author = JinC #and# ChenQ #and# JaminS
18433 , title = {{{Inet} Topology Generator}}
18434 , institution = "EECS Department, University of Michigan"
18435 , number = {CSE-TR-433}
18436 , type = {Technical Report}
18441 , author = JainAK #and# DubesRC
18442 , title = {{Algorithms for Clustering Data}}
18443 , isbn = "0-13-022278-X"
18444 , publisher = pub-ph
18448 @Article{jh-gatdv-01
18449 , author = JungS #and# HaghaniA
18450 , title = {{Genetic Algorithm for the Time-Dependent Vehicle Routing Problem }}
18452 , pages = {164--171}
18457 @Article{jhr-hepvp-98
18458 , author = JingN #and# HuangYW #and# RundensteinerEA
18459 , title = {{Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation}}
18463 , pages = {409--432}
18468 @InProceedings{jk-dbsas-12
18469 , author = JurdzinskiT #and# KowalskiDR
18470 , title = {{Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks}}
18471 , booktitle = {{Proceedings of the 26th International Symposium on Distributed Computing}}
18473 , pages = {106--120}
18474 , publisher = pub-springer
18475 , series = ser-springer_lncs
18479 @InProceedings{jkkls-eeecg-11
18480 , author = JungC #and# KarchD #and# KnoppS #and# LuxenD #and# SandersP
18481 , title = {{Engineering Efficient Error-Correcting Geocoding}}
18482 , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}}
18483 , pdf = "http://i11www.ira.uka.de/extra/publications/jkkls-eeecg-11.pdf"
18484 , publisher = pub-acm
18488 @InCollection{jklpt-aci-05
18489 , author = JacobR #and# KoschutzkiD #and# LehmannK #and# PeetersL #and# TenfeldePodehlD
18490 , title = {{Algorithms for Centrality Indices}}
18491 , booktitle = {{Network Analysis: Methodological Foundations}}
18494 , pdf = "http://springerlink.metapress.com/content/lhknhyx1l42gru41/fulltext.pdf"
18495 , publisher = pub-springer
18496 , series = ser-springer_lncs
18497 , url = "http://springerlink.metapress.com/content/lhknhyx1l42gru41/"
18502 @Article{jkls-ptasm-05
18503 , author = JansenK #and# KarpinskiM #and# LingasA #and# SeidelE
18504 , title = {{Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs}}
18505 , journal = j-sicomp
18506 , pages = {110--119}
18511 @InProceedings{jkr-aktpp-11
18512 , author = JelinekV #and# KratochvilJ #and# RutterI
18513 , title = {{A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs
\r
18515 , booktitle = {{Proceedings of the 27th Annual ACM Symposium on Computational Geometry (SoCG'11)}}
18516 , pages = {107--116}
18517 , publisher = pub-acm
18521 @Article{jkr-akttp-12
18522 , author = JelinekV #and# KratochvilJ #and# RutterI
18523 , title = {{A Kuratowski-Type Theorem for Planarity of Partially Embedded Graphs}}
18525 , note = {Special issue of SoCG'11}
18529 @article{jlk-cndp-78
18530 , author = JohnsonDS #and# LenstraJK #and# RinnooyKanAHG
18531 , title = {{The complexity of the network design problem}}
18532 , journal = j-networks
18533 , pages = {279--285}
18539 , editor = JuengerM #and# MutzelP
18540 , title = {{Graph Drawing Software}}
18541 , booktitle = {{Graph Drawing Software}}
18542 , isbn = "3-540-00881-0"
18543 , publisher = pub-springer
18544 , url = "http://www.springer.com/math/cse/book/978-3-540-00881-1"
18548 @Article{jm-lscmp-97
18549 , author = JuengerM #and# MutzelP
18550 , title = {{2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms}}
18558 , editor = JohnsonDS #and# McGeochCC
18559 , title = {{Network Flows and Matching: First DIMACS Implementation Challenge}}
18560 , booktitle = {{Network Flows and Matching: First DIMACS Implementation Challenge}}
18561 , publisher = pub-ams
18562 , series = ser-dimacsb
18563 , url = "http://www.ams.org/bookstore?fn=20&arg1=dimacsseries&ikey=DIMACS-12"
18568 @Article{jmbo-lcpn-01
18569 , author = JeongH #and# MasonSP #and# BarabasiAL #and# OltvaiZN
18570 , title = {{Lethality and Centrality in Protein Networks}}
18571 , journal = j-nature
18577 @Article{jmf-dcr-99
18578 , author = JainAK #and# MurtyMN #and# FlynnPJ
18579 , title = {{Data Clustering: A Review}}
18580 , doi = "http://doi.acm.org/10.1145/331499.331504"
18581 , isbn = "0360-0300"
18582 , journal = j-acm-csur
18585 , pages = {264--323}
18586 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=331504&type=pdf&coll=GUIDE&dl=GUIDE&CFID=19217105&CFTOKEN=85"
18587 , url = "http://doi.acm.org/10.1145/331499.331504"
18592 @InProceedings{jn-vcage-04
18593 , author = JakelJ #and# NollenburgM
18594 , title = {{Validation in the Cluster Analysis of Gene Expression Data}}
18595 , booktitle = {{Proceedings of the 14th Workshop Fuzzy-Systeme und Computational Intelligence}}
18597 , pdf = "http://i11www.ira.uka.de/extra/publications/jn-vcage-04.pdf"
18598 , publisher = pub-uk
18603 , author = WalshawC
18604 , title = {{JOSTLE --graph partitioning software}}
18605 , institution = "The University of Greenwich, London, UK"
18606 , note = {\url{http://staffweb.cms.gre.ac.uk/~wc06/jostle/}}
18607 , url = "http://staffweb.cms.gre.ac.uk/~wc06/jostle/"
18611 @Article{jp-aepcm-02
18612 , author = JungSU #and# PramanikS
18613 , title = {{An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps}}
18617 , pages = {1029--1046}
18622 @article{jpy-gamis-88
18623 , author = JohnsonDS #and# PapadimitriouCH #and# YannakakisM
18624 , title = {{On generating all maximal independent sets}}
18627 , pages = {119--123}
18632 @article{js-fugrg-90
18633 , author = JerrumM #and# SinclairA
18634 , title = {{Fast Uniform generation of regular graphs}}
18636 , pages = {91--100}
18641 @InProceedings{js-p-09
18642 , author = JainA #and# ShivakumarN
18643 , title = {{Power system tracking and dynamic state estimation}}
18644 , booktitle = {{Power Systems Conference and Exposition (PSCE'09)}}
18645 , note = {15 - 18 March, 2009}
18647 , publisher = pub-ieee
18651 @article{jt-rngr-92
18652 , author = JaromczykJW #and# ToussaintGT
18653 , title = {{Relative Neighborhood Graphs and Their Relatives}}
18654 , journal = "Proceedings of"
18656 , pages = {1502--1517}
18657 , url = "http://cgm.cs.mcgill.ca/~godfried/publications.html"
18662 @Article{jtaob-t-00
18663 , author = JeongH #and# TomborB #and# AlbertR #and# OltvaiZN #and# BarabasiAL
18664 , title = {{The large-scale organization of metabolic networks.}}
18665 , journal = j-nature
18668 , pages = {651--654}
18673 @article{jw-smsen-96
18674 , author = JacksonMO #and# WolinskyA
18675 , title = {{A Strategic Model of Social and Economic Networks}}
18677 , pages = {474-486}
18682 @inproceedings{jw-spws-03
18683 , author = JehG #and# WidomJ
18684 , title = {{Scaling personalized web search}}
18685 , address = "Budapest, Hungary"
18686 , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}}
18687 , pages = {271--279}
18691 %% --------------------------------------------------------------
18693 @mastersthesis{k-a-10
18695 , title = {{An efficient algorithm for fault-tolerant geocoding}}
18696 , institution = "Algorithmics II"
18697 , school = "Karlsruhe Institute of Technology"
18698 , type = {Diplomarbeit}
18702 @phdthesis{k-adpg-03
18704 , title = {{Algorithms for Drawing Planar Graphs}}
18705 , school = "Utrecht University"
18709 @mastersthesis{k-aepfv-10
18710 , author = KerstingH
18711 , title = {{Algorithm Engineering in der Praxis am Fallbeispiel eines VRP}}
18712 , school = "Karlsruhe Institute of Technology"
18716 @Article{k-agulv-47
18717 , author = KirchhoffG
18718 , 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}}
18719 , journal = j-aphch
18720 , pages = {497--508}
18725 @Article{k-amcvr-97
18727 , title = {{A More Compact Visibility Representation}}
18728 , journal = j-ijcga
18730 , pages = {197--210}
18735 @Article{k-anagt-60
18737 , title = {{A Note on the Application of Graph Theory to digital Computer Programming}}
18739 , pages = {179--190}
18744 @Article{k-anpta-84
18745 , author = KarmarkarN
18746 , title = {{A New Polynomial-Time Algorithm for Linear Programming}}
18749 , pages = {373--395}
18755 , author = KleinbergJM
18756 , title = {{Authoritative Sources in a Hyperlinked Environment}}
18759 , pages = {604--632}
18760 , url = "http://citeseer.nj.nec.com/article/kleinberg97authoritative.html"
18765 @Article{k-bsaab-89
18767 , title = {{BS*: An Admissible Bidirectional Staged Heuristic Search Algorithm}}
18770 , pages = {95--109}
18777 , title = {{Computer-Drawn Flowcharts}}
18778 , journal = j-comm-acm
18781 , pages = {555--563}
18786 @inproceedings{k-cfg-80
18788 , editor = SaitoN #and# NishizekiT
18789 , title = {{On centrality functions of a graph}}
18790 , address = "Sendai, Japan"
18791 , booktitle = {{Proceedings of the 17th Symposium of Research Institute of Electrical Communication on Graph Theory}}
18794 , publisher = {Springer}
18795 , series = ser-springer_lncs
18800 @Article{k-cvmcg-80
18801 , author = KelmansAK
18802 , title = {{Concept of a Vertex in a Matroid and 3-Connected Graphs}}
18810 @Article{k-dgetp-05
18812 , title = {{Drawing Graphs by Eigenvectors: Theory and Practice}}
18814 , pages = {1867--1888}
18815 , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYJ-4HDPX76-P-1&_cdi=5620&_user=2149863&_o"
18816 , url = "http://dx.doi.org/10.1016/j.camwa.2004.08.015"
18821 @article{k-dmfnmp-74
18822 , author = KarzanovAV
18823 , title = {{Determining the Maximal Flow in a Network by the Method of Preflows}}
18824 , journal = j-sov-math-dokl
18826 , pages = {434--437}
18832 , author = KleinbergJM
18833 , title = {{Detecting a Network Failure}}
18841 @InProceedings{k-dpgo-92
18843 , title = {{Drawing Planar Graphs Using the lmc-Ordering}}
18844 , booktitle = {{Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'92)}}
18845 , pages = {101--110}
18846 , publisher = pub-ics
18847 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=267814"
18851 @techreport{k-dpgo-92_tr
18853 , title = {{Drawing Planar Graphs Using the lmc-Ordering}}
18854 , institution = "Department of Information and Computing Sciences, Utrecht University"
18855 , number = {RUU-CS-92-33}
18856 , pdf = "http://www.cs.uu.nl/research/techreps/repo/CS-1992/1992-33.pdf"
18857 , url = "http://www.cs.uu.nl/research/techreps/RUU-CS-92-33.html"
18861 @techreport{k-dpguc-92
18863 , title = {{Drawing Planar Graphs Using the Canonical Ordering}}
18864 , institution = "Utrecht University"
18868 @Article{k-dpguc-96
18870 , title = {{Drawing Planar Graphs Using the Canonical Ordering}}
18874 , pdf = "http://www.springerlink.com/content/h177nm7j6tn17ul0/fulltext.pdf"
18875 , url = "http://www.springerlink.com/content/h177nm7j6tn17ul0/"
18880 @mastersthesis{k-dptdc-09
18881 , author = KieritzT
18882 , title = {{Distributed Parallel Time Dependent Contraction Hierarchies}}
18883 , school = "Karlsruhe Institute of Technology"
18887 @Article{k-dspnt-72
18888 , author = KlafszkyE
18889 , title = {{Determination of shortest path in a network with time-dependent edge-lengths}}
18892 , pages = {255--257}
18897 @article{k-ecgpp-95
18899 , title = {{Expected complexity of graph partitioning problems}}
18902 , pages = {193--212}
18907 @mastersthesis{k-ecmms-06
18909 , title = {{Efficient Computation of Many-to-Many Shortest Paths}}
18917 , title = {{Fundamental Algorithms}}
18918 , booktitle = {{Fundamental Algorithms}}
18919 , publisher = pub-aw
18920 , series = ser-tacp
18925 @incollection{k-fmfnss-73
18926 , author = KarzanovAV
18927 , title = {{On finding maximum flows in networks with special structure and some applications}}
18928 , booktitle = {{Matematicheskie Voprosy Upravleniya Proizvodstvom}}
18929 , note = {(In Russian)}
18931 , publisher = {Moscow State Univers}
18938 , title = {{Fundamentals of Planar Ordered Sets}}
18941 , pages = {197--216}
18942 , url = "http://dx.doi.org/10.1016/0012-365X(87)90008-2"
18949 , title = {{Graphen und {Matrizen}}}
18950 , journal = "Mat. Fiz. Lapok"
18951 , pages = {116-119}
18956 @InProceedings{k-hgd-93
18958 , title = {{Hexagonal Grid Drawings}}
18959 , booktitle = {{Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'92)}}
18961 , pages = {263--276}
18962 , publisher = pub-springer
18963 , series = ser-springer_lncs
18968 @inproceedings{k-iaamccnagc-01
18970 , title = {{Improved Approximation Algorithms for Max Clique, Chromatic Number and Approximate Graph Coloring}}
18971 , booktitle = {{Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'01)}}
18972 , pages = {600--609}
18973 , publisher = pub-ieeecs
18977 @InProceedings{k-itc-02
18978 , author = KleinbergJM
18979 , title = {{An Impossibility Theorem for Clustering}}
18980 , booktitle = {{Proceedings of 15th Conference: Neural Information Processing Systems}}
18981 , pdf = "http://www.cs.cornell.edu/home/kleinber/nips15.pdf"
18982 , url = "http://www.cs.cornell.edu/home/kleinber/kleinber.html"
18988 , title = {{Kontaktprobleme der konformen Abbildung}}
18989 , journal = j-bvsawl
18990 , pages = {141--164}
18995 @InCollection{k-ld-05
18997 , title = {{Local Density}}
18998 , booktitle = {{Network Analysis: Methodological Foundations}}
19000 , pages = {112--142}
19001 , pdf = "http://springerlink.metapress.com/content/l7rua6uqvm57v3ag/fulltext.pdf"
19002 , publisher = pub-springer
19003 , series = ser-springer_lncs
19004 , url = "http://springerlink.metapress.com/content/l7rua6uqvm57v3ag/"
19011 , title = {{LP-basierte Heuristiken f{\"u}r Graphenclusterung mit Modularity als Qualit{\"a}tsma{\ss}}}
19012 , institution = uni_ka
19014 , note = {Student Project, Studienarbeit}
19015 , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-krings-07.pdf"
19016 , school = "Department of Informatics"
19017 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished"
19021 @mastersthesis{k-mapsl-07
19023 , title = {{Minimizing the Area for Planar Straight-Line Grid Drawings}}
19024 , pdf = "http://i11www.iti.uni-karlsruhe.de/members/krug/publications/files/k-mapsl-2007.pdf"
19025 , school = "Universit{\"a}t Karlsruhe"
19029 @article{k-miclg-69
19030 , author = KleitmanDJ
19031 , title = {{Methods for Investigating Connectivity of Large Graphs}}
19035 , pages = {232--233}
19041 , author = KruskalJB
19042 , title = {{Multidimensional Scaling by Optimizing Goodness of Fit to a Nonparametric Hypothesis}}
19050 @Article{k-msogf-64
19051 , author = KruskalJB
19052 , title = {{Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis}}
19057 , url = "http://www.springerlink.com/content/010q1x323915712x/"
19062 @InProceedings{k-msspp-05
19064 , title = {{Multiple-Source Shortest Paths in Planar Graphs}}
19065 , booktitle = {{Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)}}
19066 , pages = {146--155}
19067 , publisher = pub-siam
19072 , author = KruskalJB
19073 , title = {{Nonmetric Multidimensional Scaling: A Numerical Method}}
19076 , pages = {115--129}
19081 @techreport{k-noa-63
19083 , title = {{Notes on ``Open'' Addressing}}
19084 , institution = "Unknown institution"
19085 , url = "http://algo.inria.fr/AofA/Research/11-97.html"
19089 @article{k-nsids-53
19091 , title = {{A new status index derived from sociometric analysis}}
19099 @article{k-occcp-75
19101 , title = {{On the computational complexity of combinatorial problems}}
19102 , journal = j-networks
19108 @InProceedings{k-olavo-92
19110 , title = {{On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future?}}
19111 , booktitle = {{Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92}}
19112 , pages = {416--429}
19113 , publisher = pub-acm
19119 , title = {{Orienting Planar Graphs.}}
19122 , pages = {337--341}
19127 @incollection{k-pascsp-76
19130 , title = {{Probabilistic analysis of some combinatorial search problems}}
19131 , booktitle = {{Algorithms and Complexity: New Directions and Recent Results}}
19133 , publisher = pub-ap
19138 , author = KratochvilJ
19139 , title = {{Perfect Codes in General Graphs}}
19140 , publisher = pub-apraha
19146 , title = {{Power System Stability and Control}}
19147 , booktitle = {{Power System Stability and Control}}
19148 , note = {ISBN 0-07-035958-X}
19149 , publisher = pub-mghi
19153 @phdthesis{k-pswsn-09
19155 , title = {{Positioning and Scheduling of Wireless Sensor Networks --- Models, Complexity, and Scalable Algorithms }}
19157 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/760243"
19159 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011014"
19163 @InProceedings{k-racp-72
19165 , title = {{Reducibility among Combinatorial Problems}}
19166 , booktitle = {{Complexity of Computer Computations}}
19167 , pages = {85--103}
19168 , publisher = pub-plenum
19172 @InCollection{k-rennf-56
19173 , author = KleeneSC
19174 , title = {{Representation of Events in Nerve Nets and Finite Automata}}
19175 , booktitle = {{Automata Studies}}
19177 , publisher = pub-pup
19178 , series = ser-ann_math_stud
19182 @inproceedings{k-roptasgmbdsbc-04
19184 , title = {{Ruling out {PTAS} for Graph Min-Bisection, Densest Subgraph and Bipartite Clique}}
19185 , booktitle = {{Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)}}
19186 , pages = {136--145}
19187 , publisher = pub-ieeecs
19191 @mastersthesis{k-rpfof-09
19192 , author = KobitzschM
19193 , title = {{Route Planning with Flexible Objective Functions}}
19194 , school = "Karlsruhe Institute of Technology"
19199 , author = KuratowskiC
19200 , title = {{Sur le probl{\`e}me des courbes gauches en Topologie}}
19202 , pages = {271--283}
19207 @InProceedings{k-sgd-03
19209 , title = {{On Spectral Graph Drawing}}
19210 , booktitle = {{Proceedings of the 9th Annual International Conference on Computing Combinatorics (COCOON'03)}}
19211 , pages = {496--508}
19212 , pdf = "http://www.springerlink.com/content/fpl2w4j6ug1aavyf/fulltext.pdf"
19213 , publisher = pub-springer
19214 , series = ser-springer_lncs
19215 , url = "http://www.springerlink.com/content/fpl2w4j6ug1aavyf/"
19220 @Article{k-snlnm-96
19221 , author = KrackhardtD
19222 , title = {{Social Networks and the Liability of Newness for Managers}}
19224 , pages = {159--173}
19225 , pdf = "http://www.andrew.cmu.edu/user/krack/documents/pubs/1996/1996%20Social%20Networks%20and%20the%20Liab"
19226 , url = "http://www.andrew.cmu.edu/user/krack/publications.shtml"
19233 , title = {{Simultane Schnitte in Graphen}}
19235 , pdf = "http://i11www.ira.uka.de/extra/publications/k-ssg-09.pdf"
19236 , school = "Karlsruhe Institute of Technology (KIT)"
19240 @InProceedings{k-swp-00
19241 , author = KleinbergJM
19242 , title = {{The small-world phenomenon: {An} algorithmic perspective}}
19243 , booktitle = {{Proceedings of the 32nd Annual {ACM} Symposium on the Theory of Computing (STOC'00)}}
19245 , pages = {163--170}
19251 , title = {{The Art Of Computer Programming}}
19252 , booktitle = {{The Art Of Computer Programming}}
19253 , publisher = pub-aw
19260 , title = {{Two notes on notation}}
19262 , pages = {403--422}
19268 , author = KernerBS
19269 , title = {{The Physics of Traffic}}
19270 , booktitle = {{The Physics of Traffic}}
19271 , publisher = pub-springer
19277 , title = {{The Stanford GraphBase : a platform for combinatorial computing}}
19278 , booktitle = {{The Stanford GraphBase : a platform for combinatorial computing}}
19279 , publisher = pub-aw
19285 , title = {{Visualizing Human Networks}}
19289 , url = "http://radar.oreilly.com/r2/release1_0.html"
19294 , author = KrempelL
19295 , title = {{Visualisierung komplexer Strukturen. Grundlagen der Darstellung mehrdimensionaler Netzwerke}}
19296 , publisher = pub-c
19300 @InProceedings{kb-pgap-91
19301 , author = KantG #and# BodlaenderHL
19302 , title = {{Planar Graph Augmentation Problems}}
19303 , booktitle = {{Proceedings of the 2nd International Workshop on Algorithms and Data Structures (WADS'91)}}
19304 , pages = {286--298}
19305 , publisher = pub-springer
19306 , series = ser-springer_lncs
19311 @Article{kbb-lbawa-12
19312 , author = KhabbazianM #and# BlakeIF #and# BhargavaVK
19313 , title = {{Local Broadcast Algorithms in Wireless Ad Hoc Networks: Reducing the Number of Transmissions}}
19314 , journal = j-ieeetmc
19317 , pages = {402--413}
19322 @Article{kbm-kpind-94
19323 , author = KrackhardtD #and# BlytheJ #and# McGrathC
19324 , title = {{{KrackPlot} 3.0: An Improved Network Drawing Program}}
19328 , pdf = "http://www.isi.edu/~blythe/papers/pdf/kp3.pdf"
19329 , url = "http://www.isi.edu/~blythe/papers/kp3.html"
19334 @unpublished{kbm-kpndp-06
19335 , author = KrackhardtD #and# BlytheJ #and# McGrathC
19336 , title = {{{KrackPlot} 4.3 Network Drawing Program}}
19337 , url = "http://www.isi.edu/~blythe/KP/"
19341 @InProceedings{kc-ebgca-11
19342 , author = KenleyEC #and# ChoY
19343 , title = {{Entropy-Based Graph Clustering: Application to Biological and Social Networks}}
19344 , booktitle = {{Proceedings of the 2011 IEEE International Conference on Data Mining}}
19345 , pages = {1116--1121}
19346 , publisher = pub-ics
19350 @Article{kc-rldr-04
19351 , author = KorenY #and# CarmelL
19352 , title = {{Robust Linear Dimensionality Reduction}}
19356 , pages = {459--470}
19357 , url = "http://doi.ieeecomputersociety.org/10.1109/TVCG.2004.17"
19362 @InProceedings{kch-aceaf-02
19363 , author = KorenY #and# CarmelL #and# HarelD
19364 , title = {{ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs}}
19365 , booktitle = {{Proceedings of the 2002 IEEE Symposium on Information Visualization}}
19366 , pages = {137--144}
19367 , publisher = pub-ieeecs
19368 , url = "http://doi.ieeecomputersociety.org/10.1109/INFVIS.2002.1173159"
19372 @Article{kch-dhgam-03
19373 , author = KorenY #and# CarmelL #and# HarelD
19374 , title = {{Drawing Huge Graphs by Algebraic Multigrid Optimization}}
19377 , pages = {645--673}
19378 , pdf = "http://www.research.att.com/~yehuda/pubs/ace_journal.pdf"
19379 , url = "http://www.ncbi.nlm.nih.gov/CBBresearch/Fellows/Carmel/publications/Koren_Carmel_Harel_2003.html"
19384 @InProceedings{kclrw-cdamm-12
19385 , author = KaoMJ #and# ChenJ #and# LeeD #and# RutterI #and# WagnerD
19386 , title = {{Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem}}
19387 , booktitle = {{Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC'12)}}
19388 , note = {Accepted for publication}
19390 , publisher = pub-springer
19391 , series = ser-springer_lncs
19397 , author = KalpakisK #and# DasguptaK #and# NamjoshiP
19398 , title = {{Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks}}
19401 , pages = {697--716}
19402 , 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"
19407 @Article{ke-hcsn-02
19408 , author = KlemmK #and# EguiluzVM
19409 , title = {{Highly Clustered Scale-free Networks}}
19414 , pdf = "http://prola.aps.org/pdf/PRE/v65/i3/e036123"
19415 , url = "http://dx.doi.org/10.1103/PhysRevE.65.036123"
19421 , author = KerrenA #and# EbertA #and# MeyerJ
19422 , title = {{Human-Centered Visualization Environments}}
19423 , booktitle = {{Human-Centered Visualization Environments}}
19424 , publisher = pub-springer
19425 , series = ser-springer_lncs
19430 @Article{kfhr-opasl-94
19431 , author = KaoM #and# FurerM #and# HeXi #and# RaghavachariB
19432 , title = {{Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs}}
19433 , journal = j-sidma
19435 , pages = {632--646}
19440 @Article{kfmut-crfws-03
19441 , author = KrauseAE #and# FrankA #and# MasonDM #and# UlanowiczRE #and# TaylorWW
19442 , title = {{Compartments Revealed in Food-Web Structure}}
19443 , journal = j-nature
19445 , pages = {282--285}
19446 , pdf = "http://www.nature.com/nature/journal/v426/n6964/pdf/nature02115.pdf"
19447 , url = "http://www.nature.com/nature/journal/v426/n6964/index.html"
19452 @Article{kg-vectv-06
19453 , author = KumarG #and# GarlandM
19454 , title = {{Visual Exploration of Complex Time-Varying Graphs}}
19458 , pages = {805--812}
19459 , pdf = "http://graphics.cs.uiuc.edu/~garland/papers/graphstrat.pdf"
19464 @Article{kgv-osa-83
19465 , author = KirkpatrickS #and# GelattCD #and# VecchiMP
19466 , title = {{Optimization by Simulated Annealing}}
19467 , journal = j-science
19470 , pages = {671--680}
19471 , pdf = "http://www.jstor.org/stable/pdfplus/1690046.pdf"
19472 , url = "http://links.jstor.org/sici?sici=0036-8075%2819830513%293%3A220%3A4598%3C671%3AOBSA%3E2.0.CO%3B2-8"
19477 @Article{kh-aaanl-79
19478 , author = KarivO #and# HakimiSL
19479 , title = {{An Algorithmic Approach to Network Location Problems. I: The $p$-Centers}}
19480 , journal = j-sijam
19482 , pages = {513--538}
19487 @InProceedings{kh-aasm-05
19488 , author = KorenY #and# HarelD
19489 , title = {{Axis-by-Axis Stress Minimization}}
19490 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
19492 , pages = {450--459}
19493 , pdf = "http://www.springerlink.com/content/pm9fb9w400nxx1u8/fulltext.pdf"
19494 , publisher = pub-springer
19495 , series = ser-springer_lncs
19496 , url = "http://www.springerlink.com/content/pm9fb9w400nxx1u8/"
19501 @InProceedings{kh-atwvm-03
19502 , author = KorenY #and# HarelD
19503 , title = {{A Two-Way Visualization Method for Clustered Data}}
19504 , booktitle = {{Proceedings of the nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}}
19505 , pages = {589--594}
19506 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=956824&type=pdf&coll=GUIDE&dl=GUIDE&CFID=77553250&CFTOKEN=60"
19507 , url = "http://doi.acm.org/10.1145/956750.956824"
19511 @proceedings{kh-gccrc-08
19512 , editor = KavanaghJ #and# HallW
19513 , title = {{Grand Challenges in Computing Research Conference 2008}}
19514 , pdf = "http://www.ukcrc.org.uk/grand_challenges/news/gccr08final.pdf"
19515 , publisher = pub-ukcrc
19519 @Article{kh-relcp-97
19520 , author = KantG #and# HeXi
19521 , title = {{Regular Edge Labeling of $4$-Connected Plane Graphs and its Applications in Graph Drawing Problems}}
19524 , pages = {175--193}
19529 @InProceedings{kh-tafrd-94
19530 , author = KantG #and# HeXi
19531 , title = {{Two Algorithms for Finding Rectangular Duals of Planar Graphs}}
19532 , booktitle = {{Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)}}
19533 , pages = {396--410}
19534 , publisher = pub-springer
19535 , series = ser-springer_lncs
19540 @techreport{khg-amcpr-03
19541 , author = KamvarSD #and# HaveliwalaTH #and# GolubGH
19542 , title = {{Adaptive methods for the computation of PageRank}}
19543 , institution = "Stanford University"
19548 @techreport{khmg-ebswc-03
19549 , author = KamvarSD #and# HaveliwalaTH #and# ManningCD #and# GolubGH
19550 , title = {{Exploiting the block structure of the Web for computing PageRank}}
19551 , institution = "Stanford University"
19556 @inproceedings{khmg-emapr-03
19557 , author = KamvarSD #and# HaveliwalaTH #and# ManningCD #and# GolubGH
19558 , title = {{Extrapolation Methods for Accelerating PageRank Computations}}
19559 , address = "Budapest, Hungary"
19560 , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}}
19561 , pages = {261--270}
19565 @Article{kk-adgug-89
19566 , author = KamadaT #and# KawaiS
19567 , title = {{An Algorithm for Drawing General Undirected Graphs}}
19572 , url = "http://dx.doi.org/10.1016/0020-0190(89)90102-6"
19577 @Article{kk-afhqm-99
19578 , author = KarypisG #and# KumarG
19579 , title = {{A Fast and Highly Quality Multilevel Scheme for Partitioning Irregular Graphs}}
19580 , journal = j-sisccomp
19582 , pages = {359--392}
19587 @inproceedings{kk-amgp-95
19588 , author = KarypisG #and# KumarV
19589 , title = {{Analysis of Multilevel Graph Partitioning}}
19590 , booktitle = {{Proceedings of the 1995 ACM/IEEE conference on Supercomputing}}
19591 , doi = "http://doi.acm.org/10.1145/224170.224229"
19592 , isbn = "0-89791-816-9"
19593 , location = "San Diego, California, United States"
19594 , publisher = pub-acm
19598 @Article{kk-bhsr-97
19599 , author = KaindlH #and# KainzG
19600 , title = {{Bidirectional Heuristic Search Reconsidered}}
19603 , pages = {283--317}
19608 @Article{kk-mspig-98
19609 , author = KarypisG #and# KumarV
19610 , title = {{A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs}}
19611 , journal = j-sisccomp
19613 , pages = {359--392}
19614 , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SJOCE3000020000001000359000001"
19615 , url = "http://dx.doi.org/10.1137/S1064827595287997"
19620 @InProceedings{kkklnrw-cttor-11
19621 , author = KaoMJ #and# KatzB #and# KrugM #and# LeeD #and# NollenburgM #and# RutterI #and# WagnerD
19622 , title = {{Connecting Two Trees with Optimal Routing Cost}}
19623 , booktitle = {{Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG '11)}}
19625 , pdf = "http://i11www.ira.uka.de/extra/publications/kkklnrw-cttor-11.pdf"
19626 , publisher = pub-utp
19627 , url = "http://www.cccg.ca/proceedings/2011/papers/paper35.pdf"
19631 @InProceedings{kkklrw-tdmpg-11
19632 , author = KaoMJ #and# KatzB #and# KrugM #and# LeeD #and# RutterI #and# WagnerD
19633 , title = {{The Density Maximization Problem in Graphs}}
19634 , booktitle = {{Proceedings of the 17th Annual International Conference on Computing Combinatorics (COCOON'11)}}
19636 , publisher = pub-springer
19637 , series = ser-springer_lncs
19642 @Article{kkklrw-tdmpg-12
19643 , author = KaoMJ #and# KatzB #and# KrugM #and# LeeD #and# RutterI #and# WagnerD
19644 , title = {{The Density Maximization Problem in Graphs}}
19646 , note = {Special issue of COCOON'11}
19650 @techreport{kkklrw-trtdmpg-11
19651 , author = KaoM #and# KatzB #and# KrugM #and# LeeD #and# RutterI #and# WagnerD
19652 , title = {{The Density Maximization Problem in Graphs}}
19653 , institution = kit_wagner
19654 , number = {2011-18}
19655 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000023123"
19659 @InProceedings{kkllw-cosdw-11
19660 , author = KleinR #and# KrugM #and# LangetepeE #and# LeeD #and# WagnerD
19661 , title = {{Constructing Optimal Shortcuts in Directed Weighted Paths and Trees}}
19662 , booktitle = {{Proceedings of the 27th European Workshop on Computational Geometry (EuroCG'11)}}
19666 @InProceedings{kklrsw-gdcrp-10
19667 , author = KatzB #and# KrugM #and# LochbihlerA #and# RutterI #and# SneltingG #and# WagnerD
19668 , title = {{Gateway Decompositions for Constrained Reachability Problems}}
19669 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
19671 , pages = {449--461}
19672 , publisher = pub-springer
19673 , series = ser-springer_lncs
19678 @InProceedings{kkls-mtgig-06
19679 , author = KaufmannM #and# KratochvilJ #and# LehmannK #and# SubramanianA
19680 , title = {{Max-Tolerance Graphs as Intersection Graphs}}
19681 , booktitle = {{Proceedings of the 17th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'06)}}
19682 , isbn = "0-89871-605-5"
19683 , pages = {832--841}
19687 @article{kkm-fcsis-00
19688 , author = KloksT #and# KratschD #and# MuellerH
19689 , title = {{Finding and counting small induced subgraphs efficiently}}
19692 , pages = {115--121}
19697 @techreport{kkn-cac-11
19698 , author = KamperJH #and# KobourovSG #and# NollenburgM
19699 , title = {{Circular-Arc Cartograms}}
19700 , institution = "CoRR"
19701 , number = {1112.4626}
19702 , url = "http://arxiv.org/abs/1112.4626"
19706 @InProceedings{kkn-cac-13
19707 , author = KamperJH #and# KobourovSG #and# NollenburgM
19708 , title = {{Circular-Arc Cartograms}}
19709 , booktitle = {{Proceedings of IEEE Pacific Visualization Symposium}}
19710 , note = {To appear.}
19711 , publisher = pub-ics
19712 , url = "http://arxiv.org/abs/1112.4626"
19716 @InProceedings{kkorssv-e-13
19717 , author = KlavikP #and# KratochvilJ #and# OtachiY #and# RutterI #and# SaitohT #and# SaumellM #and# VyskocilT
19718 , title = {{Extending partial representations of proper and unit interval graphs}}
19719 , booktitle = {{Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)}}
19720 , note = {To appear.}
19724 @Article{kkp-fhptb-93
19725 , author = KargerDR #and# KollerD #and# PhillipsS
19726 , title = {{Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths}}
19727 , journal = j-sicomp
19729 , pages = {1117--1349}
19734 @InProceedings{kkrw-gepg-10
19735 , author = KatzB #and# KrugM #and# RutterI #and# WolffA
19736 , title = {{Manhattan-Geodesic Embedding of Planar Graphs}}
19737 , booktitle = {{Proceedings of the 17th International Symposium on Graph Drawing (GD'09)}}
19738 , pages = {207--218}
19739 , publisher = pub-springer
19740 , series = ser-springer_lncs
19741 , url = "http://www.springerlink.com/content/e1j7683r32134456/"
19746 @techreport{kkrw-mgpse-09
19747 , author = KatzB #and# KrugM #and# RutterI #and# WolffA
19748 , title = {{Manhattan-Geodesic Point-Set Embeddability and Polygonization }}
19749 , institution = iti_wagner
19750 , number = {2009-17}
19751 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1106174"
19752 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000012949"
19756 @InProceedings{kl-dmpce-13
19757 , author = KahlM #and# LeibfriedT
19758 , title = {{Decentralized Model Predictive Control of Electrical Power Systems}}
19759 , booktitle = {{Proceedings of the International Conference on Power Systems Transients (IPST'13)}}
19760 , note = {Vancouver, Canada, July 18-20, 2013}
19761 , publisher = pub-aaaip
19765 @Article{kl-efppg-70
19766 , author = KernighanBW #and# LinS
19767 , title = {{An Efficient Heuristic Procedure for Partitioning Graphs}}
19771 , pages = {291--307}
19772 , pdf = "http://users.ece.gatech.edu/limsk/course/ece6133/papers/kl.pdf"
19777 @inproceedings{kl-fmfug-98
19778 , author = KargerDR #and# LevineMS
19779 , title = {{Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching}}
19780 , booktitle = {{Proceedings of the 30th Annual {ACM} Symposium on the Theory of Computing (STOC'98)}}
19786 @InProceedings{klc-alcas-12
19787 , author = KirchlerD #and# LibertiL #and# CalvoRW
19788 , title = {{A Label Correcting Algorithm for the Shortest Path Problem on a Multi-Modal Route Network}}
19789 , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}}
19790 , publisher = pub-springer
19791 , series = ser-springer_lncs
19796 @Article{klmpw-ats-03
19797 , author = KratschD #and# LeH #and# MuellerH #and# PrisnerE #and# WagnerD
19798 , title = {{Additive Tree Spanners}}
19799 , journal = j-sidma
19801 , pages = {332--340}
19802 , url = "http://dx.doi.org/10.1137/S0895480195295471"
19807 @Article{kln-tamac-11
19808 , author = KuhnF #and# LynchN #and# NewportC
19809 , title = {{The Abstract MAC Layer}}
19813 , pages = {187--206}
19818 @Article{klp-ofmsv-75
19819 , author = KungHT #and# LuccioF #and# PreparataFP
19820 , title = {{On Finding the Maxima of a Set of Vectors}}
19823 , pages = {469--476}
19824 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=321910&type=pdf&coll=GUIDE&dl=GUIDE&CFID=100750199&CFTOKEN=3"
19825 , url = "http://doi.acm.org/10.1145/321906.321910"
19830 @InProceedings{klpc-ualt-11
19831 , author = KirchlerD #and# LibertiL #and# PajorT #and# CalvoRW
19832 , title = {{UniALT for Regular Language Constraint Shortest Paths on a Multi-Modal Transportation Network}}
19833 , booktitle = {{Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'11)}}
19835 , pdf = "http://i11www.ira.uka.de/extra/publications/klpc-ualt-11.pdf"
19836 , series = ser-oasioasi
19837 , url = "http://drops.dagstuhl.de/opus/volltexte/2011/3267/"
19842 @InCollection{klprtz-ci-05
19843 , author = KoschutzkiD #and# LehmannK #and# PeetersL #and# RichterS #and# TenfeldePodehlD #and# ZlotowskiO
19844 , title = {{Centrality Indices}}
19845 , booktitle = {{Network Analysis: Methodological Foundations}}
19848 , pdf = "http://springerlink.metapress.com/content/9ylyvje90wdev5ql/fulltext.pdf"
19849 , publisher = pub-springer
19850 , series = ser-springer_lncs
19851 , url = "http://springerlink.metapress.com/content/9ylyvje90wdev5ql/"
19856 @InProceedings{klr-tpfdm-04
19857 , author = KeoghE #and# LonardiS #and# RatanamahatanaCA
19858 , title = {{Towards Parameter-Free Data Mining}}
19859 , booktitle = {{Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}}
19860 , pages = {206--215}
19861 , publisher = pub-acm
19862 , url = "http://portal.acm.org/citation.cfm?id=1014052.1014077"
19866 @InProceedings{kls-ifssd-10
19867 , author = KarchD #and# LuxenD #and# SandersP
19868 , title = {{Improved Fast Similarity Search in Dictionaries }}
19869 , booktitle = {{Proceedings of the 17th Symposium on String Processing and Information Retrieval (Spire 2010)}}
19871 , pdf = "http://www.springerlink.com/content/pk726w16u7747106/fulltext.pdf"
19872 , publisher = pub-springer
19873 , series = ser-springer_lncs
19877 @techreport{kls-ifssd-full-10
19878 , author = KarchD #and# LuxenD #and# SandersP
19879 , title = {{Improved Fast Similarity Search in Dictionaries}}
19880 , institution = "Karlsruhe Institute of Technology"
19884 @InProceedings{klsv-dtdch-10
19885 , author = KieritzT #and# LuxenD #and# SandersP #and# VetterC
19886 , title = {{Distributed Time-Dependent Contraction Hierarchies}}
19887 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
19890 , pdf = "http://i11www.ira.uka.de/extra/publications/klsv-dtdch-10.pdf"
19891 , publisher = pub-springer
19892 , series = ser-springer_lncs
19897 @InCollection{kltz-acc-05
19898 , author = KoschutzkiD #and# LehmannK #and# TenfeldePodehlD #and# ZlotowskiO
19899 , title = {{Advanced Centrality Concepts}}
19900 , booktitle = {{Network Analysis: Methodological Foundations}}
19902 , pages = {83--111}
19903 , pdf = "http://springerlink.metapress.com/content/0rg1e5vrkue1hqh7/fulltext.pdf"
19904 , publisher = pub-springer
19905 , series = ser-springer_lncs
19906 , url = "http://springerlink.metapress.com/content/0rg1e5vrkue1hqh7/"
19911 @unpublished{kmr-ene-11
19912 , author = KrugM #and# MeinertS #and# RutterI
19913 , title = {{Efficient Node Expansion}}
19917 @InProceedings{kms-aspcs-05
19918 , author = KoehlerE #and# MoehringR #and# SchillingH
19919 , title = {{Acceleration of Shortest Path and Constrained Shortest Path Computation}}
19920 , booktitle = {{Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)}}
19921 , pages = {126--138}
19922 , publisher = pub-springer
19923 , series = ser-springer_lncs
19928 @InProceedings{kmw-esdht-08
19929 , author = KatzB #and# MeckeS #and# WagnerD
19930 , title = {{Efficient Scheduling of Data Harvesting Trees}}
19931 , booktitle = {{Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08)}}
19933 , pdf = "http://www.springerlink.com/content/a1l1157619867503/fulltext.pdf"
19934 , series = ser-springer_lncs
19935 , url = "http://www.springerlink.com/content/a1l1157619867503"
19940 @InProceedings{knrss-tsbla-13
19941 , author = KindermannP #and# NiedermannB #and# RutterI #and# SchaeferM #and# SchulzA #and# WolffA
19942 , title = {{Two-Sided Boundary Labeling with Adjacent Sides}}
19943 , booktitle = {{Algorithms and Data Structures, 13th International Symposium (WADS'13)}}
19944 , note = {To appear.}
19945 , publisher = pub-springer
19946 , series = ser-springer_lncs
19950 @InProceedings{knrssw-tsbla-13
19951 , author = KindermannP #and# NiedermannB #and# RutterI #and# SchaeferM #and# SchulzA #and# WolffA
19952 , title = {{Two-Sided Boundary Labeling with Adjacent Sides}}
19953 , booktitle = {{Proceedings of the 29th European Workshop on Computational Geometry (EuroCG'13)}}
19957 @InProceedings{knrt-obeb-03
19958 , author = KumarR #and# NovakJ #and# RaghavanP #and# TomkinsAS
19959 , title = {{On the Bursty Evolution of Blogspace}}
19960 , address = "Budapest, Hungary"
19961 , booktitle = {{Proceedings of the 12th International World Wide Web Conference (WWW12)}}
19962 , pages = {568--576}
19963 , url = "http://portal.acm.org/citation.cfm?id=775233"
19968 , editor = KoganJ #and# NicholasC #and# TeboulleM
19969 , title = {{Grouping Multidimensional Data: Recent Advances in Clustering}}
19970 , booktitle = {{Grouping Multidimensional Data: Recent Advances in Clustering}}
19971 , publisher = pub-springer
19972 , url = "http://www.springerlink.com/content/n78615/"
19976 @Article{knv-mepgn-07
19977 , author = KorenY #and# NorthSC #and# VolinskyC
19978 , title = {{Measuring and Extracting Proximity Graphs in Networks}}
19979 , journal = j-acmtkdd
19982 , pdf = "http://portal.acm.org/ft_gateway.cfm?id=1297336&type=pdf&coll=GUIDE&dl=&CFID=78697063&CFTOKEN=790973"
19983 , url = "http://portal.acm.org/citation.cfm?id=1297336&jmp=cit&coll=GUIDE&dl="
19988 @InProceedings{ko-lfanm-07
19989 , author = KeimDA #and# OelkeD
19990 , title = {{Literature Fingerprinting: A New Method for Visual Literary Analysis}}
19991 , booktitle = {{IEEE Symposium on Visual Analytics and Technology (VAST 2007)}}
19993 , pages = {115--122}
19994 , publisher = pub-ieeecs
19995 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4389004"
19999 @Article{ko-pspaa-80
20000 , author = KarpRM #and# OrlinJB
20001 , title = {{Parameter Shortest Path Algorithms with an Application to Cyclic Staffing}}
20008 @InProceedings{kp-anlta-09
20009 , author = KargerDR #and# PanigrahiD
20010 , title = {{A Near-Linear Time Algorithm for Constructing a Cactus Representation of Minimum Cuts}}
20011 , booktitle = {{Proceedings of the 20st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'09)}}
20012 , pages = {246--255}
20016 @Article{kp-idpcf-04
20017 , author = KellererH #and# PferschyU
20018 , title = {{Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem }}
20026 @Article{kp-tsppl-06
20027 , author = KlunderGA #and# PostHN
20028 , title = {{The Shortest Path Problem on Large-Scale Real-Road Networks}}
20029 , journal = j-networks
20031 , pages = {182--194}
20036 @InProceedings{kpp-of-07
20037 , author = KaibelV #and# PeinhardtM #and# PfetschM
20038 , title = {{Orbitopal Fixing}}
20039 , booktitle = {{Proceedings of the 12th Integer Programming and Combinatorial Optimization Conference}}
20041 , pdf = "http://www.springerlink.com/content/85xh141734m03561/fulltext.pdf"
20042 , publisher = pub-springer
20043 , series = ser-springer_lncs
20044 , url = "http://www.springerlink.com/content/85xh141734m03561/"
20048 @article{kr-bain-79
20049 , author = KnokeD #and# RogersDL
20050 , title = {{A Blockmodel Analysis of Interorganizational Networks}}
20057 @article{kr-grhbms-84
20058 , author = KimKH #and# RoushFW
20059 , title = {{Group Relationships and Homomorphisms of Boolean Matrix Semigroups}}
20061 , pages = {448--452}
20066 @InProceedings{krg-iwclt-98
20067 , author = KleinbergJM #and# RaghavanP #and# GibsonD
20068 , title = {{Inferring Web Communities from Link Topology}}
20069 , booktitle = {{Proceedings of the 9th ACM Conference on Hypertext and Hypermedia}}
20070 , pages = {225--234}
20071 , publisher = pub-acm
20072 , url = "http://doi.acm.org/10.1145/276627.276652"
20076 @unpublished{krl-cgrn-00
20077 , author = KrapivskyPL #and# RednerS #and# LeyvrazF
20078 , title = {{Connectivity of Growing Random Networks}}
20080 , note = {http://xxx.sissa.it/ps/cond-mat/0005139}
20085 , author = KhullerS #and# RaghavachariB #and# RosenfeldA
20086 , title = {{Landmarks in Graphs}}
20089 , pages = {217--229}
20090 , pdf = "http://www.sciencedirect.com/science?_ob=MiamiImageURL&_imagekey=B6WJ0-4RFM9XW-3-1&_cdi=6864&_user=2"
20091 , url = "http://dx.doi.org/10.1016/0166-218X(95)00106-2"
20096 @inproceedings{krrstu-smwg-00
20097 , author = KumarR #and# RaghavanP #and# RajagopalanS #and# SivakumarD #and# TomkinsAS #and# UpfalE
20098 , title = {{Stochastic models for the web graph}}
20099 , booktitle = {{Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00)}}
20103 @article{krrt-twecc-99
20104 , author = KumarR #and# RaghavanP #and# RajagopalanS #and# TomkinsAS
20105 , title = {{Trawling the web for emerging cyber-communities}}
20107 , number = {11--16}
20108 , pages = {1481--1493}
20113 @InProceedings{krsw-sdaac-11
20114 , author = KatzB #and# RutterI #and# StrasserB #and# WagnerD
20115 , title = {{Speed Dating: An Algorithmic Case Study Involving Matching and Scheduling}}
20116 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
20117 , pages = {292--303}
20118 , publisher = pub-springer
20119 , series = ser-springer_lncs
20124 @inproceedings{krt-fdmfa-92
20125 , author = KingV #and# RaoS #and# TarjanRE
20126 , title = {{A Faster Deterministic Maximum Flow Algorithm}}
20127 , booktitle = {{Proceedings of the 3rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'92)}}
20129 , pages = {157--164}
20134 , author = KatzB #and# RutterI #and# WoegingerGJ
20135 , title = {{An algorithmic study of switch graphs}}
20136 , journal = j-acta-inf
20138 , pages = {295--312}
20139 , pdf = "http://i11www.ira.uka.de/extra/publications/krw-a-12.pdf"
20144 @InProceedings{krw-assg-09
20145 , author = KatzB #and# RutterI #and# WoegingerGJ
20146 , title = {{An Algorithmic Study of Switch Graphs}}
20147 , booktitle = {{Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'09)}}
20149 , pages = {226--237}
20150 , publisher = pub-springer
20151 , series = ser-springer_lncs
20152 , url = "http://www.springerlink.com/content/e6004264v60u2512/"
20157 @inproceedings{ks-amc-93
20158 , author = KargerDR #and# SteinC
20159 , title = {{An {${\tilde{O}}(n^2)$} Algorithm for Minimum Cuts}}
20160 , booktitle = {{Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)}}
20162 , pages = {757--765}
20166 @Article{ks-anonr-09
20167 , author = KliewerN #and# SuhlL
20168 , title = {{A Note on the Online Nature of the Railway Delay Management Problem}}
20169 , journal = j-networks
20173 @InProceedings{ks-dnd-80
20174 , author = KruskalJB #and# SeeryJB
20175 , title = {{Designing Network Diagrams}}
20176 , booktitle = {{Proceedings of the First General Conference on Social Graphics}}
20178 , publisher = pub-usdc
20182 @Article{ks-fptdn-93
20183 , author = KaufmanDE #and# SmithRL
20184 , title = {{Fastest Paths in Time-Dependent Networks for Intelligent Vehicle-Highway Systems Application}}
20192 @Article{ksetb-gtivs-03
20193 , author = KwatraV #and# SchodlA #and# EssaI #and# TurkG #and# BobickA
20194 , title = {{Graphcut Textures: Image and Video Synthesis using Graph Cuts}}
20195 , journal = j-acmtg
20197 , pages = {277--286}
20202 @InProceedings{kss-spbvd-06
20203 , author = KeimDA #and# SchneidewindJ #and# SipsM
20204 , title = {{Scalable Pixel Based Visual Data Exploration}}
20205 , booktitle = {{Pixelization Paradigm, Revised Selected Papers of the First Visual Information Expert Workshop}}
20208 , pdf = "http://www.springerlink.com/content/9x14431g468gl122/fulltext.pdf"
20209 , publisher = pub-springer
20210 , series = ser-springer_lncs
20211 , url = "http://www.springerlink.com/content/9x14431g468gl122/?p=4842f1faf28d4753a1e43cefb7c97300&pi=1"
20216 @InProceedings{ksssw-cmmsp-07
20217 , author = KnoppS #and# SandersP #and# SchultesD #and# SchulzF #and# WagnerD
20218 , title = {{Computing Many-to-Many Shortest Paths Using Highway Hierarchies}}
20219 , booktitle = {{Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)}}
20221 , publisher = pub-siam
20225 @techreport{ksssw-fcdth-06
20226 , author = KnoppS #and# SandersP #and# SchultesD #and# SchulzF #and# WagnerD
20227 , title = {{Fast Computation of Distance Tables using Highway Hierarchies}}
20228 , institution = inf_ka
20233 , author = KoevariT #and# SosVT #and# TuranP
20234 , title = {{On a problem of Zarankiewicz}}
20235 , journal = j-cmpan
20241 @InProceedings{ksv-amcmr-10
20242 , author = KarloffH #and# SuriS #and# VassilevskaV
20243 , title = {{A Model of Computation for MapReduce}}
20244 , booktitle = {{Proceedings of the 21st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'10)}}
20245 , pages = {938--948}
20246 , publisher = pub-siam
20250 @InProceedings{ksw-teuss-04
20251 , author = KleinbergJM #and# SlivkinsA #and# WexlerT
20252 , title = {{Triangulation and Embedding Using Small Sets of Beacons}}
20253 , booktitle = {{Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)}}
20254 , pages = {444--453}
20255 , publisher = pub-ieeecs
20259 @InProceedings{kt-a-01
20260 , author = KingV #and# ThorupM
20261 , title = {{A space saving trick for directed dynamic transitive closure and shortest path algorithms.}}
20262 , booktitle = {{Proceedings of the 7th Annual International Conference on Computing Combinatorics (COCOON'01)}}
20263 , pages = {268--277}
20264 , publisher = pub-springer
20265 , series = ser-springer_lncs
20270 @InCollection{kt-c-05
20271 , author = KammerF #and# TaeubigH
20272 , title = {{Connectivity}}
20273 , booktitle = {{Network Analysis: Methodological Foundations}}
20275 , pages = {142--177}
20276 , pdf = "http://springerlink.metapress.com/content/xn9teuuwvq8j9xl4/fulltext.pdf"
20277 , publisher = pub-springer
20278 , series = ser-springer_lncs
20279 , url = "http://springerlink.metapress.com/content/xn9teuuwvq8j9xl4/"
20284 @inproceedings{kt-cfdg-78
20285 , author = KishiG #and# TakeuchiM
20286 , title = {{On centrality functions of a non-directed graph}}
20287 , address = "Budapest"
20288 , booktitle = {{Proceedings of the 6th Colloquium on Microwave Communication}}
20292 @Article{kt-dgcei-07
20293 , author = KohliP #and# TorrPH
20294 , title = {{Dynamic Graph Cuts for Efficient Inference in Markov Random Fields}}
20295 , journal = j-tpami
20298 , pages = {2079--2088}
20299 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4359296"
20304 @article{kt-eaffamec-86
20305 , author = KarzanovAV #and# TimofeevEA
20306 , title = {{Efficient algorithm for finding all minimal edge cuts of a nonoriented graph}}
20309 , pages = {156--162}
20314 @inproceedings{ktbc-olmfc-91
20315 , author = KanevskyA #and# TamassiaR #and# DiBattistaG #and# ChenJianer
20316 , title = {{On-Line Maintenance of the Four-Connected Components of a Graph}}
20317 , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}}
20319 , pages = {793--801}
20323 @article{kts-iddsg-90
20324 , author = KrishnamoorthyV #and# ThulasiramanK #and# SwamyMNS
20325 , title = {{Incremental Distance and Diameter Sequences of a Graph: {New} Measures of Network Performance}}
20329 , pages = {230--237}
20334 @unpublished{kv-aslg-99
20335 , author = KannanR #and# VinayV
20336 , title = {{Analyzing the Structure of Large Graphs}}
20337 , note = {Manuscript}
20342 , author = KorteB #and# VygenJ
20343 , title = {{Combinatorial Optimization: Theory and Algorithms}}
20344 , booktitle = {{Combinatorial Optimization: Theory and Algorithms}}
20345 , publisher = pub-springer
20351 @InProceedings{kvv-cgds-00
20352 , author = KannanR #and# VempalaS #and# VettaA
20353 , title = {{On Clusterings - Good, Bad and Spectral}}
20354 , booktitle = {{Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS'00)}}
20355 , pages = {367--378}
20359 @Article{kvv-ocgbs-04
20360 , author = KannanR #and# VempalaS #and# VettaA
20361 , title = {{On Clusterings: Good, Bad, Spectral}}
20365 , pages = {497--515}
20366 , pdf = "http://www.cc.gatech.edu/~vempala/papers/jacm-spectral.pdf"
20371 @InProceedings{kvw-eespc-10
20372 , author = KatzB #and# VolkerM #and# WagnerD
20373 , title = {{Energy Efficient Scheduling with Power Control for Wireless Networks}}
20374 , booktitle = {{Proceedings of the 8th Intl. Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt'10)}}
20375 , pages = {144--153}
20376 , pdf = "http://i11www.ira.uka.de/extra/publications/kvw-eespc-10.pdf"
20377 , publisher = pub-ics
20378 , url = "http://www.ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=5518815"
20382 @InProceedings{kvw-lslim-08
20383 , author = KatzB #and# VolkerM #and# WagnerD
20384 , title = {{Link Scheduling in Local Interference Models}}
20385 , booktitle = {{Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'08)}}
20387 , pdf = "http://www.springerlink.com/content/t1u1n0043x013217/fulltext.pdf"
20388 , series = ser-springer_lncs
20389 , url = "http://www.springerlink.com/content/t1u1n0043x013217/"
20395 , editor = KaufmannM #and# WagnerD
20396 , title = {{Drawing Graphs: Methods and Models}}
20397 , booktitle = {{Drawing Graphs: Methods and Models}}
20398 , isbn = "3-540-42062-2"
20399 , publisher = pub-springer
20400 , series = ser-springer_lncs
20401 , url = "http://www.springerlink.com/content/xkru1gvnyh5p/"
20406 @InProceedings{kw-madps-07
20407 , author = KatzB #and# WagnerD
20408 , title = {{Multi-scale Anchor-free Distributed Positioning in Sensor Networks}}
20409 , booktitle = {{Proceedings of the International Workshop on Theoretical and Algorithmic Aspects of Sensor Networks (WTASA'07)}}
20411 , pdf = "http://i11www.ira.uka.de/extra/publications/kw-madps-07.pdf"
20415 @InCollection{kw-madps-08
20416 , author = KatzB #and# WagnerD
20417 , title = {{Multi-scale Anchor-free Distributed Positioning in Sensor Networks}}
20418 , booktitle = {{Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects}}
20420 , pages = {203--220}
20421 , publisher = pub-springer
20422 , series = ser-lnee
20423 , url = "http://www.springer.com/engineering/signals/book/978-0-387-77319-3"
20428 @InProceedings{kw-mapsl-08
20429 , author = KrugM #and# WagnerD
20430 , title = {{Minimizing the Area for Planar Straight-Line Grid Drawings}}
20431 , booktitle = {{Proceedings of the 15th International Symposium on Graph Drawing (GD'07)}}
20433 , pages = {207--212}
20434 , pdf = "http://i11www.iti.uni-karlsruhe.de/members/krug/publications/files/kw-mapsl-2007.pdf"
20435 , publisher = pub-springer
20436 , series = ser-springer_lncs
20441 @InProceedings{kw-mmmcd-03
20442 , author = KaufmannM #and# WieseR
20443 , title = {{Maintaining the Mental Map for Circular Drawings}}
20444 , booktitle = {{Proceedings of the 10th International Symposium on Graph Drawing (GD'00)}}
20447 , publisher = pub-springer
20448 , series = ser-springer_lncs
20453 @InCollection{kw-rr-05
20454 , author = KlauGW #and# WeiskircherR
20455 , title = {{Robustness and Resilience}}
20456 , booktitle = {{Network Analysis: Methodological Foundations}}
20458 , pages = {417--437}
20459 , pdf = "http://springerlink.metapress.com/content/vrxjxbkvgel9e72d/fulltext.pdf"
20460 , publisher = pub-springer
20461 , series = ser-springer_lncs
20462 , url = "http://springerlink.metapress.com/content/vrxjxbkvgel9e72d/"
20467 @InProceedings{kw-wedl-96
20468 , author = KuchemR #and# WagnerD
20469 , title = {{Wiring edge-disjoint layouts}}
20470 , booktitle = {{Proceedings of the 4th International Symposium on Graph Drawing (GD'96)}}
20471 , location = "Berkeley, California, USA"
20473 , pages = {271--285}
20474 , publisher = pub-springer
20475 , series = ser-springer_lncs
20481 , author = KuchemR #and# WagnerD
20482 , title = {{Wiring Planar Layouts}}
20484 , pages = {255--273}
20489 @InProceedings{kww-aotlc-89
20490 , author = KuchemR #and# WagnerD #and# WagnerF
20491 , title = {{Area-Optimal Three-Layer Channel Routing}}
20492 , booktitle = {{Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS'89)}}
20494 , pages = {506--511}
20498 @Article{kww-oatlk-96
20499 , author = KuchemR #and# WagnerD #and# WagnerF
20500 , title = {{Optimizing Area for Three-Layer Knock-Knee Channel Routing}}
20504 , pages = {496--519}
20505 , pdf = "http://www.springerlink.com/content/j1413w4435158464/fulltext.pdf"
20506 , url = "http://www.springerlink.com/content/j1413w4435158464/"
20511 @InProceedings{kwy-rdc-05
20512 , author = KeyanL #and# WanxingS #and# Yun-huaL
20513 , title = {{Research on parallel algorithm of DC optimal power flow in large interconnection power grids}}
20514 , booktitle = {{Proceedings of the 8th International Conference on Electrical Machines and Systems (ICEMS'05)}}
20516 , pages = {1031--1036}
20517 , publisher = pub-aaaip
20522 @InProceedings{kwz-wcoac-03
20523 , author = KuhnF #and# WattenhoferR #and# ZollingerA
20524 , title = {{Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing}}
20525 , booktitle = {{Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'03)}}
20529 %% --------------------------------------------------------------
20533 , title = {{Algebra}}
20534 , booktitle = {{Algebra}}
20535 , publisher = pub-springer
20541 , title = {{Advanced Electrical and Electronics Engineering}}
20542 , booktitle = {{Advanced Electrical and Electronics Engineering}}
20543 , publisher = pub-springer
20544 , series = ser-lnee
20549 @InProceedings{l-aeept-06
20550 , author = LautherU
20551 , title = {{An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags}}
20552 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}}
20557 @InCollection{l-aeept-09
20558 , author = LautherU
20559 , title = {{An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags}}
20560 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
20562 , publisher = pub-ams
20563 , series = ser-dimacsb
20568 @InCollection{l-aefea-04
20569 , author = LautherU
20570 , title = {{An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background}}
20571 , booktitle = {{Geoinformation und Mobilit{\"a}t - von der Forschung zur praktischen Anwendung}}
20572 , pages = {219--230}
20573 , publisher = pub-igi
20578 @mastersthesis{l-amioch-12
20579 , author = LaschingerM
20580 , title = {{A MapReduce Implementation of Contraction Hierarchies}}
20582 , school = "Karlsruhe Institute of Technology"
20583 , type = {bachelor thesis}
20587 @techreport{l-amric-12
20588 , author = LaschingerM
20589 , title = {{A MapReduce Implementation of Contraction Hierarchies}}
20590 , institution = "ITI Sanders"
20595 , author = LuxburgUv
20596 , title = {{A Tutorial on Spectral Clustering}}
20600 , pages = {395--416}
20601 , pdf = "http://www.springerlink.com/content/jq1g17785n783661/fulltext.pdf"
20602 , url = "http://www.springerlink.com/content/jq1g17785n783661/"
20608 , author = LengauerT
20609 , title = {{Combinatorial Algorithms for Integrated Circuit Layout}}
20610 , publisher = pub-wiley
20616 , title = {{Connectivity in Digraphs}}
20617 , journal = j-jcombthb
20620 , pages = {174--177}
20625 @article{l-cgcsgs-50
20627 , title = {{Connectivity and generalized cliques in sociometric group structure}}
20629 , pages = {169--190}
20635 , author = LawlerEL
20636 , title = {{Cutsets and Partitions of hypergraphs}}
20637 , journal = j-networks
20638 , pages = {275--285}
20643 @InCollection{l-dgd-01
20644 , author = LandgrafB
20645 , title = {{3D Graph Drawing}}
20646 , booktitle = {{Drawing Graphs: Methods and Models}}
20647 , isbn = "3-540-42062-2"
20648 , pages = {172--192}
20649 , pdf = "http://springerlink.metapress.com/content/l3vv18dd6mn63ap8/fulltext.pdf"
20650 , publisher = pub-springer
20651 , series = ser-springer_lncs
20652 , url = "http://springerlink.metapress.com/content/l3vv18dd6mn63ap8/"
20657 @mastersthesis{l-dhpet-09
20659 , title = {{Developing high performance extensible transportation planning algorithm based on OSGI}}
20660 , school = "Karlsruhe Institute of Technology"
20664 @article{l-eapogb-66
20665 , author = LeifmanLYa
20666 , title = {{An Efficient Algorithm for Partitioning an Oriented Graph into Bicomponents}}
20676 , title = {{Engineering von Modularity-basiertem Graphenclustern,}}
20677 , institution = "Karlsruhe Institute of Technology (KIT)"
20679 , note = {Student Project, Studienarbeit}
20680 , school = "Department of Informatics"
20684 @InProceedings{l-gapcg-81
20685 , author = LauchliP
20686 , title = {{Generating All Planar 0-, 1-, 2-, 3-Connected Graphs}}
20687 , booktitle = {{Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG'80)}}
20688 , pages = {379--382}
20689 , publisher = pub-springer
20690 , series = ser-springer_lncs
20696 , title = {{Geometric Representations of Graphs}}
20697 , url = "www.cs.elte.hu/~lovasz/geomrep.pdf"
20701 @article{l-igbvc-82
20703 , title = {{Isomorphism of graphs of bounded valence can be tested in polynomial time}}
20706 , url = "http://www.cs.uoregon.edu/~luks/iso.pdf"
20711 @Article{l-ipfnv-83
20712 , author = LenstraHW
20713 , title = {{Integer Programming with a Fixed Number of Variables}}
20717 , pages = {538--548}
20724 , title = {{Least squares quantization in PCM}}
20725 , journal = j-tinfth
20727 , pages = {129--137}
20732 @mastersthesis{l-mcgof-11
20733 , author = LisowskiD
20734 , title = {{Modularity-basiertes Clustern von dynamischen Graphen im Offline-Fall}}
20735 , note = {http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished}
20736 , school = "Department of Informatics, Karlsruhe Institute of Technology (KIT)"
20742 , title = {{METIS - Family of Multilevel Partitioning Algorithms}}
20743 , url = "http://glaros.dtc.umn.edu/gkhome/views/metis"
20747 @article{l-npcgi-81
20749 , title = {{Some {$\mathcal{NP}$}-complete problems similar to graph isomorphism}}
20750 , journal = j-sicomp
20756 @Article{l-opgsm-83
20758 , title = {{Optimal Paths in Graphs with Stochastic or Multidimensional Weights}}
20759 , journal = j-comm-acm
20761 , pages = {670--676}
20766 @article{l-otscg-79
20768 , title = {{On the {Shannon} capacity of a graph}}
20769 , journal = j-tinfth
20777 , title = {{Protein domain decomposition using spectral graph partitioning}}
20778 , institution = uni_ka
20780 , note = {Student Project, Studienarbeit}
20781 , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/files/studienarbeit-lang-07.pdf"
20782 , school = "Department of Informatics"
20783 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished"
20787 @article{l-parsn-92
20788 , author = LevinsonR
20789 , title = {{Pattern associativity and the retrieval of semantic networks}}
20792 , pages = {573--600}
20793 , url = "citeseer.lcs.mit.edu/levinson92pattern.html"
20798 @InCollection{l-ra-05
20800 , title = {{Role Assignments}}
20801 , booktitle = {{Network Analysis: Methodological Foundations}}
20803 , pages = {216--252}
20804 , pdf = "http://springerlink.metapress.com/content/atcl0b2dxeyy2n63/fulltext.pdf"
20805 , publisher = pub-springer
20806 , series = ser-springer_lncs
20807 , url = "http://springerlink.metapress.com/content/atcl0b2dxeyy2n63/"
20813 , author = LesniakL
20814 , title = {{Results on the edge-connectivity of graphs}}
20816 , pages = {351--354}
20822 , author = LautherU
20823 , title = {{Slow Preprocessing of Graphs for Extremely Fast Shortest Path Calculations}}
20824 , note = {Lecture at the Workshop on Computational Integer Programming at ZIB}
20828 @phdthesis{l-ssvn-07
20830 , title = {{Structural Similarity of Vertices in Networks}}
20831 , url = "http://www.ub.uni-konstanz.de/kops/volltexte/2008/5330/"
20836 , author = LehmannEL
20837 , title = {{Testing Statistical Hypotheses}}
20839 , publisher = pub-springer
20840 , series = ser-springer_stis
20845 , title = {{LAPACK -- Linear Algebra PACKage}}
20846 , note = {\url{http://www.netlib.org/lapack}}
20849 @Article{lbohm-sebcl-11
20850 , author = LiuJ #and# BenigniA #and# ObradovicD #and# HircheS #and# MontiA
20851 , title = {{State Estimation and Branch Current Learning Using Independent Local Kalman Filter with Virtual Disturbance Model}}
20852 , journal = j-ieeetim
20855 , pages = {3026--3034}
20861 , author = LehmannEL #and# CasellaG
20862 , title = {{Theory of Point Estimation}}
20864 , publisher = pub-springer
20865 , series = ser-springer_stis
20869 @InCollection{lchpz-cmppi-07
20870 , author = LinCh #and# ChoY #and# HwangW #and# PeiP #and# ZhangA
20871 , title = {{Clustering Methods in a Protein-Protein Interaction Network}}
20872 , booktitle = {{Knowledge Discovery in Bioinformatics}}
20874 , pages = {319--355}
20875 , publisher = pub-wileys
20876 , url = "http://www3.interscience.wiley.com/cgi-bin/summary/114268853/SUMMARY"
20880 @Article{ld-stcg-05
20881 , author = LubbeckeME #and# DesrosiersJ
20882 , title = {{Selected Topics in Column Generation}}
20886 , pages = {1017--1023}
20891 @InProceedings{lec-aaptg-67
20892 , author = LempelA #and# EvenS #and# CederbaumI
20893 , title = {{An Algorithm for Planarity Testing of Graphs}}
20894 , booktitle = {{Proceedings of the International Symposium on the Theory of Graphs}}
20895 , pages = {215--232}
20896 , publisher = pub-gb
20901 , author = LancichinettiA #and# FortunatoS
20902 , title = {{Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities}}
20911 , author = LancichinettiA #and# FortunatoS
20912 , title = {{Community detection algorithms: A comparative analysis}}
20916 , url = "http://link.aps.org/doi/10.1103/PhysRevE.80.056117"
20922 , author = LancichinettiA #and# FortunatoS #and# KertezJ
20923 , title = {{Detecting the overlapping and hierarchical community structure of complex networks}}
20926 , pdf = "http://santo.fortunato.googlepages.com/njp9_3_033015.pdf"
20927 , url = "http://www.iop.org/EJ/njp"
20932 @unpublished{lfk-dohcs-08
20933 , author = LancichinettiA #and# FortunatoS #and# KertezJ
20934 , title = {{Detecting the Overlapping and Hierarchical Community Structure of Complex Networks}}
20935 , note = {http://arxiv.org/abs/0802.1218}
20936 , url = "http://arxiv.org/abs/0802.1218"
20940 @Article{lgh-slssu-06
20941 , author = LammerS #and# GehlsenB #and# HelbingD
20942 , title = {{Scaling Laws in the Spatial Structure of Urban Road Networks}}
20943 , journal = j-physa
20946 , pdf = "http://arxiv.org/pdf/physics/0603257"
20947 , url = "http://dx.doi.org/10.1016/j.physa.2006.01.051"
20952 @InProceedings{lgr-eascr-09
20953 , author = LuoJ #and# GirardA #and# RosenbergC
20954 , title = {{Efficient Algorithms to Solve a Class of Resource Allocation Problems in Large Wireless Networks}}
20955 , booktitle = {{7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)}}
20960 @techreport{lgz-ftsac-03
20961 , author = LeeCPC #and# GolubGH #and# ZeniosSA
20962 , title = {{A fast two-stage algorithm for computing PageRank}}
20963 , institution = "Stanford University"
20964 , number = {SCCM-03-15}
20968 @InProceedings{lh-psvli-08
20969 , author = LeskovecJ #and# HorvitzE
20970 , title = {{Planetary-Scale Views on a Large Instant-Messaging Network}}
20971 , booktitle = {{Proceedings of the 17th International World Wide Web Conference (WWW2008)}}
20972 , pages = {915--924}
20973 , pdf = "http://research.microsoft.com/~horvitz/leskovec_horvitz_www2008.pdf"
20974 , url = "http://research.microsoft.com/~horvitz/Messenger_graph_www.htm"
20978 @InProceedings{lkf-gotdl-05
20979 , author = LeskovecJ #and# KleinbergJM #and# FaloutsosC
20980 , title = {{Graphs Over Time: Densification Laws, Shrinking Diameters and Possible Explanations}}
20981 , booktitle = {{Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}}
20982 , pages = {177--187}
20983 , pdf = "http://www.cs.cornell.edu/home/kleinber/kdd05-time.pdf"
20984 , publisher = pub-acm
20985 , url = "http://portal.acm.org/citation.cfm?id=1081893"
20989 @InProceedings{lkr-aaeel-04
20990 , author = LuG #and# KrishnamachariB #and# RaghavendraCS
20991 , title = {{An Adaptive Energy-Efficient and Low-Latency MAC for Data Gathering in Wireless Sensor Networks}}
20992 , booktitle = {{18th International Parallel and Distributed Processing Symopsium (IPDPS'04)}}
20994 , publisher = pub-ics
20995 , url = "http://doi.ieeecomputersociety.org/10.1109/IPDPS.2004.1303264"
21000 , author = LehmannK #and# KaufmannM #and# SteigeleS #and# NieseltK
21001 , title = {{On the maximal cliques in $c$-max-tolerance graphs and their
\r
21002 application in clustering molecular sequences}}
21009 @InProceedings{llld-e-07
21010 , author = LuoH #and# LuoJ #and# LiuYh #and# DasSK
21011 , title = {{Energy efficient routing with adaptive data fusion in sensor networks}}
21012 , booktitle = {{DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computing}}
21014 , publisher = pub-acm
21018 @inproceedings{llmm-aew-03
21019 , author = LauraL #and# LeonardiS #and# MillozziS #and# MeyerU
21020 , title = {{Algorithms and Experiments for the Webgraph}}
21021 , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}}
21022 , publisher = pub-springer
21023 , series = ser-springer_lncs
21028 @article{llr-gamis-80
21029 , author = LawlerEL #and# LenstraJK #and# RinnooyKanAHG
21030 , title = {{Generating all maximal independent sets: {$\mathcal{NP}$}-hardness and polynomial-time algorithms}}
21031 , journal = j-sicomp
21033 , pages = {558--565}
21038 @Article{lls-icvrp-04
21039 , author = LinC #and# LuH #and# SunI
21040 , title = {{Improved Compact Visibility Representation of Planar Graph via {S}chnyder's Realizer}}
21041 , journal = j-sidma
21048 @inproceedings{llw-pigcaa-86
21049 , author = LinialN #and# LovaszL #and# WigdersonA
21050 , title = {{A Physical Interpretation of Graph Connectivity and Its Algorithmic Applications}}
21051 , booktitle = {{Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS'86)}}
21057 @article{llw-rbcegc-88
21058 , author = LinialN #and# LovaszL #and# WigdersonA
21059 , title = {{Rubber Bands, Convex Embeddings and Graph Connectivity}}
21062 , pages = {91--102}
21067 @Article{lly-cfpos-03
21068 , author = LiaoC #and# LuH #and# YenH
21069 , title = {{Compact Floor-Planning via Orderly Spanning Trees}}
21071 , pages = {441--451}
21076 @techreport{lm-dipr-04
21077 , author = LangvilleAN #and# MeyerCD
21078 , title = {{Deeper Inside PageRank}}
21079 , address = "Raleigh, NC, USA"
21080 , institution = "Department of Mathematics, North Carolina State University"
21082 , note = {accepted by {\em Internet Mathematics}}
21086 @article{lm-rsrsl-04
21087 , author = LempelR #and# MoranS
21088 , title = {{Rank-Stability and rank-similarity of link-based web ranking algorithms in authority-connected graphs}}
21090 , note = {in press}
21094 @techreport{lm-semwir-04
21095 , author = LangvilleAN #and# MeyerCD
21096 , title = {{A survey of eigenvector methods of web information retrieval}}
21097 , address = "Raleigh, NC, USA"
21098 , institution = "Department of Mathematics, North Carolina State University"
21100 , note = {accepted by {\em The SIAM Review}}
21104 @article{lm-tsals-00
21105 , author = LempelR #and# MoranS
21106 , title = {{The stochastic approach for link-structure analysis ({SALSA}) and the {TKC} effect}}
21108 , pages = {387--401}
21113 @Article{ln-csdn-08
21114 , author = LeichtEA #and# NewmanMEJ
21115 , title = {{Community Structure in Directed Networks}}
21119 , pages = {118703+}
21120 , url = "http://dx.doi.org/10.1103/PhysRevLett.100.118703"
21125 @InProceedings{ln-pldo-12
21126 , author = LofflerM #and# NollenburgM
21127 , title = {{Planar {L}ombardi Drawings of Outerpaths}}
21128 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
21129 , note = {Poster abstract.}
21130 , pages = {561--562}
21131 , pdf = "http://i11www.ira.uka.de/extra/publications/ln-pldo-12.pdf"
21132 , publisher = pub-springer
21133 , series = ser-springer_lncs
21134 , url = "http://dx.doi.og/10.1007/978-3-642-36763-2_53"
21139 @InProceedings{ln-sbolb-10
21140 , author = LofflerM #and# NollenburgM
21141 , title = {{Shooting Bricks with Orthogonal Laser Beams: A First Step towards Internal/External Map Labeling }}
21142 , booktitle = {{Proceedings of the 22nd Canadian Conference on Computational Geometry (CCCG '10)}}
21143 , pages = {203--206}
21144 , pdf = "http://i11www.ira.uka.de/extra/publications/ln-sbolb-10.pdf"
21145 , publisher = pub-um
21146 , url = "http://cccg.ca/proceedings/2010/paper54.pdf"
21150 @article{lp-mmags-49
21151 , author = LuceRD #and# PerryA
21152 , title = {{A method of matrix analysis of group structure}}
21154 , pages = {95--116}
21160 , title = {{lp-solve}}
21161 , note = {A Mixed Integer Linear Programming (MILP) solver, free under the LGPL, {http://lpsolve.sourceforge.net/}}
21162 , url = "http://lpsolve.sourceforge.net/"
21166 , author = LeightonFT #and# RaoS
21167 , title = {{Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}}
21170 , pages = {787--832}
21171 , url = "http://portal.acm.org/citation.cfm?doid=331524.331526"
21176 @InProceedings{ls-csarr-12
21177 , author = LuxenD #and# SchieferdeckerD
21178 , title = {{Candidate Sets for Alternative Routes in Road Networks}}
21179 , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}}
21180 , pages = {260--270}
21181 , pdf = "http://i11www.ira.uka.de/extra/publications/ls-csarr-12.pdf"
21182 , publisher = pub-springer
21183 , series = ser-springer_lncs
21188 @Article{ls-csarr-13
21189 , author = LuxenD #and# SchieferdeckerD
21190 , title = {{Candidate Sets for Alternative Routes in Road Networks}}
21191 , journal = j-acm-ea
21192 , note = {Submitted to}
21196 @Article{ls-dajmi-08
21197 , author = LeydesdorffL #and# SchankT
21198 , title = {{Dynamic Animations of Journal Maps: Indicators of Structural Change and Interdisciplinary Developments}}
21199 , journal = j-jasist
21201 , pages = {1810--1818}
21206 @techreport{ls-dmlca-12
21207 , author = LuxenD #and# SchieferdeckerD
21208 , title = {{Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing}}
21209 , institution = "Karlsruhe Institute of Technology"
21210 , url = "http://arxiv.org/abs/1208.2543"
21214 @article{ls-dnmis-69
21215 , author = LuccioF #and# SamiM
21216 , title = {{On the decomposition of networks in minimally interconnected subnetworks}}
21218 , pages = {184--188}
21223 @InProceedings{ls-hdfue-11
21224 , author = LuxenD #and# SandersP
21225 , title = {{Hierarchy Decomposition for Faster User Equilibria on Road Networks}}
21226 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
21227 , pages = {242--253}
21228 , pdf = "http://www.springerlink.com/content/w72328613527485u/fulltext.pdf"
21229 , publisher = pub-springer
21230 , series = ser-springer_lncs
21235 @Article{lsbhsd-tbdcd-04
21236 , author = LusseauD #and# SchneiderK #and# BoisseauO #and# HaaseP #and# SlootenE #and# DawsonS
21237 , title = {{The Bottlenose Dolphin Community of Doubtful Sound Features a Large Proportion of Long-Lasting Associations}}
21241 , pages = {396--405}
21242 , pdf = "http://www.springerlink.com/content/pepxvj4lu42ur2gw/fulltext.pdf"
21243 , url = "http://www.springerlink.com/content/pepxvj4lu42ur2gw/"
21248 @Article{lssn-asn-08
21249 , author = LeydesdorffL #and# SchankT #and# ScharnhorstA #and# NooyW
21250 , title = {{Animating the development of Social Networks over time using a dynamic extension of multidimensional scaling.}}
21252 , pages = {611--626}
21258 , author = LenstraJK #and# ShmoysDB #and# TardosE
21259 , title = {{Approximation algorithms for scheduling unrelated parallel machines}}
21261 , pages = {259--271}
21266 @Article{lt-apst-80
21267 , author = LiptonRJ #and# TarjanR
21268 , title = {{Applications of a Planar Separator Theorem}}
21269 , journal = j-sicomp
21270 , pages = {615--627}
21275 @Article{lt-astpg-79
21276 , author = LiptonRJ #and# TarjanRE
21277 , title = {{A Separator Theorem for Planar Graphs}}
21278 , journal = j-sijam
21281 , pages = {177--189}
21282 , pdf = "http://www.cs.princeton.edu/courses/archive/fall06/cos528/handouts/sepplanar.pdf"
21287 @article{lt-dfsagfmisgl-81
21288 , author = LoukakisE #and# TsourosK
21289 , title = {{A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically}}
21290 , journal = j-comput
21291 , pages = {249--266}
21296 @InProceedings{lt-tcamc-11
21297 , author = LiA #and# TangL
21298 , title = {{The Complexity and Approximability of Minimum Contamination Problems}}
21299 , booktitle = {{Proceedings of the 8th annual conference on Theory and applications of models of computation}}
21300 , pages = {298--307}
21301 , publisher = pub-springer
21302 , series = ser-springer_lncs
21303 , url = "http://dx.doi.org/10.1007/978-3-642-20877-5_30"
21307 @InProceedings{lv-rtros-11
21308 , author = LuxenD #and# VetterC
21309 , title = {{Real-Time Routing with OpenStreetMap data}}
21310 , booktitle = {{Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}}
21311 , publisher = pub-acm
21315 @InProceedings{lw-rbttg-01
21316 , author = LiebersA #and# WeiheK
21317 , title = {{Recognizing Bundles in Time Table Graphs - A Structural Approach}}
21318 , booktitle = {{Proceedings of the 4th International Workshop on Algorithm Engineering (WAE'00)}}
21320 , publisher = pub-springer
21321 , series = ser-springer_lncs
21326 @article{lw-seisn-71
21327 , author = LorrainF #and# WhiteHC
21328 , title = {{Structural Equivalence of Individuals in Social Networks}}
21335 @Article{lww-cdcas-11
21336 , author = LiX #and# WangYa #and# WangYu
21337 , title = {{Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks}}
21341 , pages = {386--399}
21346 @Article{lww-cnke-96
21347 , author = LiebersA #and# WagnerD #and# WeiheK
21348 , title = {{C++ im Nebenfachstudium: Konzepte und Erfahrungen}}
21352 , pages = {262--265}
21353 , pdf = "http://www.springerlink.com/content/y4n5fclpxajnc5bu/fulltext.pdf"
21354 , url = "http://www.springerlink.com/content/y4n5fclpxajnc5bu/"
21359 @Article{lww-ohrbt-00
21360 , author = LiebersA #and# WagnerD #and# WeiheK
21361 , title = {{On the Hardness of Recognizing Bundles in Time Table Graphs}}
21362 , journal = j-ijfcs
21364 , pages = {467--484}
21369 @InProceedings{lww-ohrbt-99
21370 , author = LiebersA #and# WagnerD #and# WeiheK
21371 , title = {{On the Hardness of Recognizing Bundles in Time Table Graphs}}
21372 , booktitle = {{Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'99)}}
21373 , pages = {325--337}
21374 , publisher = pub-springer
21375 , series = ser-springer_lncs
21376 , url = "http://www.springerlink.com/content/v42kx15y960rn58a/"
21381 @techreport{lww-rbttg-99
21382 , author = LiebersA #and# WeiheK #and# WagnerD
21383 , title = {{Recognizing Bundles in Time Table Graphs---a Structural Approach}}
21384 , institution = "Universit{\"a}t Konstanz"
21385 , note = {Konstanzer Schriften in Mathematik und Informatik}
21391 , editor = LernerJ #and# WagnerD #and# ZweigKA
21392 , title = {{Algorithmics of Large and Complex Networks}}
21393 , booktitle = {{Algorithmics of Large and Complex Networks}}
21394 , publisher = pub-springer
21395 , series = ser-springer_lncs
21401 , author = LundC #and# YannakakisM
21402 , title = {{On the hardness of approximating minimization problems}}
21406 , pages = {960--981}
21412 , editor = LernerJ #and# ZweigKA
21413 , title = {{Algorithmics of Large and
\r
21415 , booktitle = {{Algorithmics of Large and
\r
21417 , publisher = pub-springer
21418 , series = ser-springer_lncs
21423 @InProceedings{lzgt-iorte-05
21424 , author = LiuY #and# ZhangH #and# GongiW #and# TowslefD
21425 , title = {{On the Interaction between Overlay Routing and Traffic Engineering}}
21426 , booktitle = {{Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
21428 , pages = {2543--2553}
21429 , pdf = "http://ieeexplore.ieee.org/iel5/9990/32102/01498539.pdf"
21430 , publisher = pub-ieeecs
21431 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1498539"
21436 %% --------------------------------------------------------------
21439 , author = MulmuleyK
21440 , title = {{A fast planar partition algorithm}}
21444 , pages = {253--280}
21445 , url = "http://dx.doi.org/10.1016/S0747-7171(08)80064-8"
21451 , author = McGeochCC
21452 , title = {{All-pairs shortest paths and the essential subgraph}}
21456 , pages = {426--441}
21461 @Article{m-accpg-37
21462 , author = MacLaneS
21463 , title = {{A Combinatorial Condition for Planar Graphs}}
21472 , title = {{Analysis, Modeling and Simulation of Multiscale Problems}}
21473 , booktitle = {{Analysis, Modeling and Simulation of Multiscale Problems}}
21474 , publisher = pub-springer
21478 @incollection{m-ana-89
21479 , author = MitchellJC
21480 , editor = FreemanLC #and# WhiteDR #and# RomneyAK
21481 , title = {{Algorithms and Network Analysis: A Test of Some Analytical Procedures on {Kapferer's} Tailor Shop Material}}
21482 , booktitle = {{Research Methods in Social Network Analysis}}
21483 , pages = {365--391}
21484 , publisher = pub-gmup
21489 , author = MehlhornK
21490 , title = {{A faster approximation algorithm for the Steiner problem in graphs}}
21493 , pages = {125--128}
21498 @Article{m-asrah-83
21499 , author = MurtaghF
21500 , title = {{A Survey of Recent Advances in Hierarchical Clustering Algorithms}}
21503 , pages = {354--259}
21504 , url = "http://comjnl.oxfordjournals.org/cgi/content/abstract/26/4/354"
21510 , author = MuellerK
21511 , title = {{Berechnung k{\"u}rzester Pfade unter Beachtung von Abbiegeverboten}}
21512 , note = {Student Research Project}
21513 , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/studienarbeit-kmueller-05.pdf"
21518 @article{m-bsamc-82
21519 , author = McGregorJJ
21520 , title = {{Backtrack search algorithms and the maximal common subgraph problem}}
21528 @InProceedings{m-ccaav-05
21530 , title = {{Comparing Clusterings - An Axiomatic View}}
21531 , booktitle = {{Proceedings of the 22nd International Conference on Machine Learning}}
21532 , publisher = pub-acm
21537 , author = MokkenRJ
21538 , title = {{Cliques, clubs, and clans}}
21540 , pages = {161--173}
21545 @Article{m-ccibd-07
21547 , title = {{Comparing Clusterings---an Information Based Distance}}
21550 , pages = {873--895}
21551 , pdf = "http://dx.doi.org/10.1016/j.jmva.2006.11.013"
21552 , url = "http://dx.doi.org/10.1016/j.jmva.2006.11.013"
21558 , author = MatulaDW
21559 , title = {{$k$-Components, Clusters, and Slicings in Graphs}}
21560 , journal = j-sijam
21563 , pages = {459--480}
21568 @InProceedings{m-ccvi-03
21570 , title = {{Comparing Clusterings by the Variation of Information}}
21571 , 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}}
21573 , pages = {173--187}
21574 , publisher = pub-springer
21575 , series = ser-springer_lncs
21576 , url = "http://springerlink.metapress.com/content/rdda4r5bm9ajlbw3/?p=253d02f94c964798a92556201df3d32c&pi=2"
21581 , author = MakinenE
21582 , title = {{On Circular Layouts}}
21587 @Article{m-cpmpt-97
21589 , title = {{Circle Packings of Maps in Polynomial Time}}
21593 , pages = {785--805}
21598 @inproceedings{m-csg-69
21599 , author = MatulaDW
21600 , title = {{The cohesive strength of graphs}}
21601 , booktitle = {{The Many Facets of Graph Theory, Proc.}}
21602 , pages = {215--221}
21603 , publisher = pub-springer
21604 , series = ser-springer_lnm
21609 @mastersthesis{m-dcdmv-09
21610 , author = MukhtarS
21611 , title = {{Dynamische Clusteranalyse f{\"u}r DM-Verkaufsdaten}}
21612 , institution = uni_ka
21614 , note = {Diplomarbeit}
21619 @inproceedings{m-dec-87
21620 , author = MatulaDW
21621 , title = {{Determining Edge Connectivity in {$\mathcal{O}(nm)$}}}
21622 , booktitle = {{Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS'87)}}
21624 , pages = {249--251}
21630 , title = {{On the Diameter of a Graph}}
21633 , pages = {349--351}
21638 @mastersthesis{m-diehs-06
21639 , author = MuellerK
21640 , title = {{Design and Implementation of an Efficient Hierarchical Speed-up Technique for Computation of Exact Shortest Paths in Graphs}}
21646 @InCollection{m-dtspd-01
21647 , author = MuellerHannemannM
21648 , title = {{Drawing Trees, Series-Parallel Digraphs, and Lattices}}
21649 , booktitle = {{Drawing Graphs: Methods and Models}}
21650 , isbn = "3-540-42062-2"
21652 , pdf = "http://springerlink.metapress.com/content/eqtf4rgr4vg6jtn4/fulltext.pdf"
21653 , publisher = pub-springer
21654 , series = ser-springer_lncs
21655 , url = "http://springerlink.metapress.com/content/eqtf4rgr4vg6jtn4/"
21661 , editor = MeyersRA
21662 , title = {{Encyclopedia of Complexity and Systems Science}}
21663 , booktitle = {{Encyclopedia of Complexity and Systems Science}}
21665 , publisher = pub-springer
21666 , url = "http://www.springer.com/physics/book/978-0-387-75888-6"
21670 @phdthesis{m-edgre-11
21671 , author = MeinertS
21672 , title = {{Engineering Data Generators for Robust Experimental Evaluations\\-- Planar Graphs, Artificial Road Networks, and Traffic Information --}}
21674 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/1990047"
21675 , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie (KIT)"
21676 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000025685 "
21680 @article{m-edmdg-91
21682 , title = {{Eigenvalues, diameter and mean distance in graphs}}
21689 @article{m-edtcdg-71
21691 , title = {{Efficient Determination of the Transitive Closure of a Directed Graph}}
21699 @InProceedings{m-egasl-96
21701 , title = {{Embedding Graphs in an Arbitrary Surface in Linear Time}}
21702 , booktitle = {{Proceedings of the 28th Annual {ACM} Symposium on the Theory of Computing (STOC'96)}}
21703 , pages = {392--397}
21704 , publisher = pub-acm
21708 @article{m-egmzg-72
21710 , title = {{Ecken vom Grad $n$ in minimalen $n$-fach zusammenh{\"a}ngenden Graphen}}
21711 , journal = j-arch-math
21712 , pages = {219--224}
21717 @mastersthesis{m-escss-05
21718 , author = MeinertS
21719 , title = {{Ein Softwareentwurf f{\"u}r ein Client/Server System zum Archivieren und Austauschen von Graphen im GraphML-Format basierend auf Web-Services}}
21721 , school = "Universit{\"a}t T{\"u}bingen"
21725 @Article{m-fsscs-86
21726 , author = MillerGL
21727 , title = {{Finding Small Simple Cycle Separators for 2–Connected Planar Graphs}}
21730 , pages = {265--279}
21737 , title = {{Geodetic Reference System 1980}}
21741 , pages = {187--192}
21746 @inproceedings{m-gsama-97
21748 , title = {{Some Applications of Laplace Eigenvalues of Graphs}}
21749 , booktitle = {{Graph Symmetry: Algebraic Methods and Applications}}
21750 , pages = {227--275}
21751 , series = ser-nato_ac
21756 @incollection{m-gttcaa-77
21757 , author = MatulaDW
21758 , editor = VanRyzinJ
21759 , title = {{Graph Theoretic Techniques for Cluster Analysis Algorithms}}
21760 , booktitle = {{Classification and clustering}}
21761 , pages = {95--129}
21762 , publisher = pub-ap
21768 , title = {{Isoperimetric numbers of graphs}}
21769 , journal = j-jcombthb
21771 , pages = {274--291}
21776 @Article{m-larom-79
21777 , author = MitchellSL
21778 , title = {{Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs}}
21782 , pages = {229--232}
21783 , url = "http://dx.doi.org/10.1016/0020-0190(79)90075-9"
21788 @InCollection{m-lsg-91
21790 , title = {{The Laplacian Spectrum of Graphs}}
21791 , booktitle = {{Graph Theory, Combinatorics, and Applications}}
21792 , pages = {871--898}
21793 , pdf = "http://www.fmf.uni-lj.si/~mohar/Papers/Spec.pdf"
21794 , publisher = pub-wiley
21799 @InCollection{m-maclc-07
21801 , title = {{MAC Layer and Coloring}}
21802 , booktitle = {{Algorithms for Sensor and Ad Hoc Networks}}
21804 , pdf = "http://www.springerlink.com/content/7377325x4q2352m1/fulltext.pdf"
21805 , publisher = pub-springer
21806 , series = ser-springer_lncs
21807 , url = "http://www.springerlink.com/content/j17361060k67/?p=d8a26cb8041d46709ce129f50ed743bb&pi=3"
21813 , editor = MagoulesF
21814 , title = {{Mesh Partitioning Techniques and Domain Decomposition Techniques}}
21815 , booktitle = {{Mesh Partitioning Techniques and Domain Decomposition Techniques}}
21816 , publisher = pub-ccl
21820 @InProceedings{m-nem-02
21822 , title = {{nem: A Software for Network Topology Analysis and Modeling}}
21823 , booktitle = {{Proceedings of the 10th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems}}
21824 , pdf = "http://doi.ieeecomputersociety.org/10.1109/MASCOT.2002.1167097"
21825 , publisher = pub-ics
21829 @article{m-ngicp-79
21831 , title = {{A Note on the Graph Isomorphism Counting Problem}}
21834 , pages = {131--132}
21840 , author = MendezPO
21841 , title = {{Orientations bipolaires}}
21842 , school = "Ecole des Hautes Etudes en Sciences Sociales, Paris"
21846 @Article{m-omspp-84
21847 , author = MartinsEQ
21848 , title = {{On a Multicriteria Shortest Path Problem}}
21851 , pages = {236--245}
21856 @mastersthesis{m-pgd-08
21858 , title = {{Planar Graph Drawing}}
21859 , school = "University of Konstanz"
21865 , title = {{Practical graph isomorphism}}
21866 , journal = j-congr-num
21872 @Article{m-pgmrt-02
21874 , title = {{Planar Graphs as Minimal Resolutions of Trivariate Monomial Ideals}}
21881 @InCollection{m-saleg-97
21883 , title = {{Some Applications of Laplace Eigenvalues of Graphs}}
21884 , booktitle = {{Graph Symmetry: Algebraic Methods and Applications}}
21885 , pages = {225--275}
21886 , pdf = "http://www.fmf.uni-lj.si/~mohar/Papers/Montreal.pdf"
21887 , publisher = pub-kapg
21888 , series = ser-nato_ac
21893 @mastersthesis{m-sb-03
21895 , title = {{{S}tandortplanung von {B}ahnh{\"o}fen}}
21896 , pdf = "http://i11www.ira.uka.de/members/mecke/publications/files/diplomarbeit.pdf"
21897 , school = "Universit{\"a}t Konstanz"
21901 @article{m-scpcg-37
21902 , author = MacLaneS
21903 , title = {{A Structural Characterization of Planar Combinatorial Graphs}}
21904 , journal = j-duke-mj
21905 , pages = {460--472}
21910 @Article{m-sgpgw-70
21911 , author = MontanariUG
21912 , title = {{Separable Graphs, Planar Graphs and Web Grammars}}
21916 , pages = {243--267}
21921 @InProceedings{m-smcam-67
21922 , author = MacQueenJ
21923 , title = {{Some Methods for Classification and Analysis of Multivariate Observations}}
21924 , booktitle = {{Fifth Berkeley Symposium on Mathematical Statistics and Probability}}
21925 , pages = {281--297}
21929 @InProceedings{m-ssspa-01
21931 , title = {{Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time}}
21932 , booktitle = {{Proceedings of the 12th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'01)}}
21933 , pages = {797--806}
21938 , author = MilgramS
21939 , title = {{The Small World Problem}}
21947 @InCollection{m-tfpef-84
21948 , author = MalkevitchJ
21949 , title = {{The First Proof of Euler's Formula}}
21950 , booktitle = {{Coxeter-Festschrift}}
21952 , publisher = pub-smi
21953 , series = ser-mmsg
21958 @InCollection{m-vvpgm-99
21959 , author = MoehringR
21960 , title = {{Verteilte Verbindungssuche im {\"o}ffentlichen Personenverkehr -- Graphentheoretische Modelle und Algorithmen}}
21961 , booktitle = {{Angewandte Mathematik insbesondere Informatik, Beispiele erfolgreicher Wege zwischen Mathematik und Informatik}}
21962 , pages = {192--220}
21963 , publisher = pub-v
21969 , title = {{Zur allgemeinen Kurventheorie}}
21971 , pages = {96--115}
21976 @mastersthesis{m-zg-02
21977 , author = MoellerB
21978 , title = {{Zentralit{\"a}ten in Graphen}}
21980 , school = "Fachbereich Informatik und Informationswissenschaft, Universit{\"a}t Konstanz"
21981 , type = {Diplomarbeit}
21985 @Article{ma-tmcaa-84
21986 , author = MoreyLC #and# AgrestiA
21987 , title = {{The Measurement of Classification Agreement: An
\r
21988 Adjustment to the RAND Statistic for Chance Agreement}}
21991 , pdf = "http://epm.sagepub.com/cgi/reprint/44/1/33.pdf"
21992 , url = "http://epm.sagepub.com/cgi/content/abstract/44/1/33"
21997 @InProceedings{mabdhlc-pasls-10
21998 , author = MalewiczG #and# AusternMH #and# BikAJ #and# DehnertJC #and# HornI #and# LeiserN #and# CzajkowskiG
21999 , title = {{Pregel: A System for Large-Scale Graph Processing}}
22000 , booktitle = {{Proceedings of the 2010 ACM SIGMOD international conference on Management of data (SIGMOD'10)}}
22001 , pages = {135--145}
22002 , pdf = "http://kowshik.github.com/JPregel/pregel_paper.pdf"
22003 , publisher = pub-acm
22007 @Article{man-cdrsl-05
22008 , author = MiuraK #and# AzumaM #and# NishizekiT
22009 , title = {{Canonical Decomposition, Realizer, {S}chnyder Labeling and Orderly Spanning Trees of Plane Graphs}}
22010 , journal = j-ijfcs
22012 , pages = {117--141}
22017 @InProceedings{mbbc-aesap-07
22018 , author = MadduriK #and# BaderDA #and# BerryJW #and# CrobakJR
22019 , title = {{An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances}}
22020 , booktitle = {{Proceedings of the 9th Workshop on Algorithm Engineering and Experiments (ALENEX'07)}}
22022 , publisher = pub-siam
22026 @InCollection{mbbc-pspas-09
22027 , author = MadduriK #and# BaderDA #and# BerryJW #and# CrobakJR
22028 , title = {{Parallel Shortest Path Algorithms for Solving Large-Scale Instances}}
22029 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
22030 , pages = {249--290}
22031 , publisher = pub-ams
22032 , series = ser-dimacsb
22037 @Article{md-tdvrp-92
22038 , author = MalandrakiC #and# DaskinMS
22039 , title = {{Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms}}
22042 , pages = {185--200}
22048 , author = KarypisG #and# KumarV
22049 , title = {{MeTiS, A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices, Version 4.0}}
22050 , institution = "University of Minnesota, MN"
22051 , pdf = "http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/manual.pdf"
22052 , url = "http://glaros.dtc.umn.edu/gkhome/views/metis"
22057 , author = KarypisG #and# KumarV
22058 , title = {{MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 4.0}}
22059 , institution = "University of Minnesota, Minneapolis, MN"
22060 , note = {\url{http://www.cs.umn.edu/~metis}}
22061 , url = "http://www.cs.umn.edu/~metis"
22066 , editor = MirchandaniPB #and# FrancisRL
22067 , title = {{Discrete Location Theory}}
22068 , booktitle = {{Discrete Location Theory}}
22069 , publisher = pub-wiley
22070 , series = ser-wiley_dmo
22074 @InProceedings{mghemc-c-10
22075 , author = Meyer-BaseA #and# GoerkeR #and# HeHuan #and# EmmettMR #and# MarshallAG #and# ConradCA
22076 , title = {{Computational techniques to the topology and dynamics of lipidomic networks found in glioblastoma cells}}
22077 , booktitle = {{Proceedings of SPIE 7704: Evolutionary and Bio-Inspired Computation: Theory and Applications IV (2010)}}
22079 , publisher = pub-spietisoe
22080 , url = "http://dx.doi.org/10.1117/12.849903"
22084 @techreport{mgsz-sit-02
22085 , author = MihailM #and# GkantsidisC #and# SaberiA #and# ZeguraEW
22086 , title = {{On the semantics of Internet topologies}}
22087 , institution = "Georgia Institute of Technology"
22088 , number = {GIT-CC-02-}
22089 , type = {Technical Report}
22090 , url = "http://www.cc.gatech.edu/fac/Milena.Mihail/www-papers/Inetsemantics.pdf"
22094 @InCollection{mgw-mfdss-08
22095 , author = MeckeS #and# GoerkeR #and# WagnerD
22096 , title = {{Maximale Fl{\"u}sse - Die ganze Stadt will zum Stadion}}
22097 , booktitle = {{Taschenbuch der Algorithmen}}
22098 , pages = {361--372}
22099 , pdf = "http://i11www.ira.uka.de/algo/people/rgoerke/publications/pdf/chapter4D.pdf"
22100 , publisher = pub-springer
22101 , url = "http://www-i1.informatik.rwth-aachen.de/~algorithmus/"
22105 @Article{mh-aecmb-01
22106 , author = MeilaM #and# HeckermanD
22107 , title = {{An Experimental Comparison of Model-Based Clustering Methods}}
22111 , pdf = "http://www.springerlink.com/content/h7500163314n0l20/fulltext.pdf"
22112 , url = "http://www.springerlink.com/content/h7500163314n0l20/"
22117 @article{mhhk-gscc-77
22118 , author = MullinsNC #and# HargensLL #and# HechtPK #and# KickEL
22119 , title = {{The Group Structure of Cocitation Clusters: A Comparative Study}}
22121 , pages = {552--562}
22126 @Article{mih-tcccp-81
22127 , author = MasuyamaS #and# IbarakiT #and# HasegawaT
22128 , title = {{The Computational Complexity of the m-Center Problems on the Plane}}
22129 , journal = j-ieicetj
22136 @article{mkm-afmfn-78
22137 , author = MalhotraVM #and# KumarMP #and# MaheshwariSN
22138 , title = {{An {$\mathcal{O}(|V|^3)$} algorithm for finding maximum flows in networks}}
22142 , pages = {277--278}
22147 @InProceedings{mknf-onp-87
22148 , author = MasudaS #and# KashiwabaraT #and# NakajimaK #and# FujisawaT
22149 , title = {{On the {$\mathcal{NP}$}-completeness of a computer network layout problem}}
22150 , booktitle = {{Proceedings of the 20th IEEE International Symposium on Circuits and Systems 1987}}
22151 , pages = {292--295}
22152 , publisher = pub-ics
22156 @Article{ml-damlr-06
22157 , author = MadanR #and# LallS
22158 , title = {{Distributed Algorithms for Maximum Lifetime Routing in Wireless Sensor Networks}}
22159 , journal = j-ieeetwc
22161 , pages = {2185--2193}
22162 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1687734"
22167 @Article{ml-hmhls-03
22168 , author = MartiR #and# LagunaM
22169 , title = {{Heuristics and Meta-Heuristics for 2-Layer Straight Line Crossing Minimization}}
22173 , pages = {665--678}
22174 , url = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X02003979"
22179 @inproceedings{mlmb-bautg-01
22180 , author = MedinaA #and# LakhinaA #and# MattaI #and# ByersJ
22181 , title = {{{BRITE}: An Approach to Universal Topology Generation}}
22182 , booktitle = {{Proceedings of the 9th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems}}
22186 @Book{mlpmkm-sahnt-08
22187 , editor = MakkiSK #and# LiXY #and# PissinouN #and# MakkiS #and# KarimiM #and# MakkiK
22188 , title = {{Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects}}
22189 , booktitle = {{Sensor and Ad-Hoc Networks: Theoretical and Algorithmic Aspects}}
22191 , publisher = pub-springer
22192 , series = ser-lnee
22193 , url = "http://www.springer.com/engineering/signals/book/978-0-387-77319-3"
22199 , author = MoonJW #and# MoserL
22200 , title = {{On Cliques in Graphs}}
22207 @article{mm-dpcusn-74
22208 , author = MoxleyR #and# MoxleyN
22209 , title = {{Determining Point-Centrality in Uncontrived Social Networks}}
22211 , pages = {122--130}
22216 @Article{mm-mhsrm-12
22217 , author = MachucaE #and# MandowL
22218 , title = {{Multiobjective Heuristic Search in Road Maps}}
22222 , pages = {6435--6445}
22223 , url = "http://dx.doi.org/10.1016/j.eswa.2011.12.022"
22228 @article{mm-redl-03
22229 , author = MarxM #and# MasuchM
22230 , title = {{Regular Equivalence and Dynamic Logic}}
22238 , author = McKeeTA #and# McMorrisFR
22239 , title = {{Topics in Intersection Graph Theory}}
22240 , booktitle = {{Topics in Intersection Graph Theory}}
22241 , publisher = pub-siam
22242 , series = ser-mdma
22246 @article{mmb-oplit-00
22247 , author = MedinaA #and# MattaI #and# ByersJ
22248 , title = {{On the Origin of Power Laws in {Internet} Topologies}}
22256 @InProceedings{mmpz-andgs-13
22257 , author = MaliG #and# MichailP #and# ParaskevopoulosA #and# ZaroliagisC
22258 , title = {{A New Dynamic Graph Structure for Large-Scale Transportation Networks}}
22259 , booktitle = {{Proceedings of the 8th Conference on Algorithms and Complexity}}
22261 , pages = {312--323}
22262 , publisher = pub-springer
22263 , series = ser-springer_lncs
22264 , url = "http://dx.doi.org/10.1007/978-3-642-38233-8_26"
22270 , author = MeyerhenkeH #and# MonienB #and# SauerwaldT
22271 , title = {{A new diffusion-based multilevel algorithm for computing graph partitions}}
22274 , pages = {750--761}
22275 , url = "http://dx.doi.org/10.1016/j.jpdc.2009.04.005"
22280 @InProceedings{mms-asolb-06
22281 , author = MeyerhenkeH #and# MonienB #and# SchambergerS
22282 , title = {{Accelerating Shape Optimizing Load Balancing for Parallel FEM Simulations by Algebraic Multigrid}}
22283 , booktitle = {{20th International Parallel and Distributed Processing Symopsium (IPDPS'06)}}
22285 , pdf = "http://ieeexplore.ieee.org/iel5/10917/34366/01639295.pdf"
22286 , publisher = pub-ics
22287 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1639295"
22291 @InProceedings{mmw-aamee-07
22292 , author = MaierM #and# MeckeS #and# WagnerD
22293 , title = {{Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks}}
22294 , booktitle = {{Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}}
22295 , isbn = "978-3-540-69506-6"
22296 , location = "Harrachov, Czech Republic"
22298 , pages = {410--421}
22299 , pdf = "http://i11www.ira.uka.de/algo/people/mecke/publications/pdf/mmw-aameedpwn-2007.pdf"
22300 , publisher = pub-springer
22301 , series = ser-springer_lncs
22306 @InProceedings{mmw-tslpt-04
22307 , author = MammanaF #and# MeckeS #and# WagnerD
22308 , title = {{The {Station Location} {Problem} on {Two} {Intersecting} {Lines}}}
22309 , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}}
22311 , pdf = "http://i11www.ira.uka.de/members/mecke/publications/files/station_location.pdf"
22312 , series = ser-entcs
22313 , url = "http://www.elsevier.com/wps/find/journaldescription.cws_home/681021/description?navopenmenu=-2"
22319 , editor = MarcotteP #and# NguyenS
22320 , title = {{Equilibrium and Advanced Transportation Modelling}}
22321 , booktitle = {{Equilibrium and Advanced Transportation Modelling}}
22322 , publisher = pub-kapg
22326 @InProceedings{mnn-cgdfc-00
22327 , author = MiuraK #and# NakanoS #and# NishizekiT
22328 , title = {{Convex Grid Drawings of Four-Connected Plane Graphs}}
22329 , booktitle = {{Proceedings of the 11th International Symposium on Algorithms and Computation (ISAAC'00)}}
22330 , pages = {254--265}
22331 , series = ser-springer_lncs
22335 @InProceedings{mnn-gdfcp-00
22336 , author = MiuraK #and# NakanoS #and# NishizekiT
22337 , title = {{Grid Drawings of Four-Connected Plane Graphs}}
22338 , booktitle = {{Proceedings of the 7th International Symposium on Graph Drawing (GD'99)}}
22339 , location = "Stirin Castle, Czech Republic"
22341 , pages = {145--154}
22342 , publisher = pub-springer
22343 , series = ser-springer_lncs
22344 , url = "http://www.springerlink.com/content/21wnxfa5l8dg/"
22349 @InProceedings{mnr-dpgpc-13
22350 , author = MchedlidzeT #and# NollenburgM #and# RutterI
22351 , title = {{Drawing Planar Graphs with a Prescribed Cycle}}
22352 , booktitle = {{Proceedings of the 21st International Symposium on Graph Drawing (GD'13)}}
22353 , note = {To appear.}
22354 , publisher = pub-springer
22355 , series = ser-springer_lncs
22359 @InProceedings{mnwb-mplst-07
22360 , author = MerrickD #and# NollenburgM #and# WolffA #and# BenkertM
22361 , title = {{Morphing Polygonal Lines: A Step Towards Continuous Generalization}}
22362 , booktitle = {{Proceedings of the 15th Annual Geographic Information Sciences Research Conference UK}}
22363 , pages = {390--399}
22364 , pdf = "http://i11www.ira.uka.de/extra/publications/mnwb-mplst-07.pdf"
22368 @InProceedings{mnwb-mplst-07ecg
22369 , author = MerrickD #and# NollenburgM #and# WolffA #and# BenkertM
22370 , title = {{Morphing Polygonal Lines: A Step Towards Continuous Generalization}}
22371 , booktitle = {{Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG'07)}}
22373 , pdf = "http://i11www.ira.uka.de/extra/publications/mnwb-mplst-07ecg.pdf"
22377 @article{mp-aasnt-01
22378 , author = MagoniD #and# PansiotJJ
22379 , title = {{Analysis of the Autonomous System Network Topology}}
22388 @InProceedings{mp-acitg-02
22389 , author = MagoniD #and# PansiotJJ
22390 , title = {{Analysis and Comparison of Internet Topology Generators}}
22391 , booktitle = {{Proceedings of the 2nd International IFIP-TC6 Networking Conference}}
22392 , pages = {364--375}
22393 , publisher = pub-springer
22397 @Article{mp-apspa-98
22398 , author = MohrT #and# PascheC
22399 , title = {{A Parallel Shortest Path Algorithm}}
22400 , journal = j-comput
22403 , pages = {281--292}
22408 @InProceedings{mp-arpg-92
22409 , author = MalitzS #and# PapakostasA
22410 , title = {{On the Angular Resolution of Planar Graphs}}
22411 , booktitle = {{Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (STOC'92)}}
22412 , pages = {527--538}
22413 , publisher = pub-acm
22414 , url = "http://doi.acm.org/10.1145/129712.129764"
22418 @incollection{mp-eco-93
22419 , author = MoharB #and# PoljakS
22420 , title = {{Eigenvalues in Combinatorial Optimization}}
22421 , booktitle = {{Combinatorial and Graph-Theoretical Problems in Linear Algebra}}
22422 , pages = {107--151}
22423 , publisher = pub-springer
22427 @Article{mp-masch-10
22428 , author = MandowL #and# Perez-de-la-CruzJL
22429 , title = {{Multiobjective A* Search with Consistent Heuristics}}
22433 , pages = {27:1--27:24}
22438 @InProceedings{mp-oepl-02
22439 , author = MihailM #and# PapadimitriouCH
22440 , title = {{On the Eigenvalue Power Law}}
22441 , booktitle = {{Proceedings of the 6th International Workshop on Randomization and Approximation Techniques (RANDOM'02)}}
22442 , pages = {254--262}
22443 , series = ser-springer_lncs
22448 @Article{mr-ngtap-92
22449 , author = MillerGL #and# RamachandranV
22450 , title = {{A New Graph Triconnectivity Algorithm and its Parallelization}}
22458 @Article{mrc-lmmnc-05
22459 , author = MuffS #and# RaoF #and# CaflischA
22460 , title = {{Local Modularity Measure for Network Clusterizations}}
22464 , url = "http://link.aps.org/abstract/PRE/v72/e056107"
22469 @InProceedings{mrsn-asghg-97
22470 , author = MarksJ #and# RumlW #and# ShieberSM #and# NgoJT
22471 , title = {{A Seed-Growth Heuristic for Graph Bisection}}
22472 , booktitle = {{Proceedings of Algorithms and Experiments (ALEX'98)}}
22477 @Article{mrwhctdt-dbndf-05
22478 , author = MyersC #and# RobsonD #and# WibleA #and# HibbsM #and# ChiriacC #and# TheesfeldC #and# DolinskiK #and# TroyanskayaO
22479 , title = {{Discovery of Biological Networks from Diverse Functional Genomic Data}}
22483 , pdf = "http://genomebiology.com/content/pdf/gb-2005-6-13-r114.pdf"
22484 , url = "http://genomebiology.com/2005/6/13/R114"
22490 , author = ModestiP #and# SciomachenA
22491 , title = {{A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks}}
22494 , pages = {495--508}
22500 , author = MehlhornK #and# SandersP
22501 , title = {{Algorithms and Data Structures: The Basic Toolbox}}
22502 , booktitle = {{Algorithms and Data Structures: The Basic Toolbox}}
22503 , publisher = pub-springer
22508 , editor = MuellerHannemannM #and# SchirraS
22509 , title = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}}
22510 , booktitle = {{Algorithm Engineering: Bridging the Gap between Algorithm Theory and Practice}}
22511 , publisher = pub-springer
22512 , series = ser-springer_lncs
22517 @Article{ms-dsaps-03
22518 , author = MeyerU #and# SandersP
22519 , title = {{$\Delta$-Stepping: A Parallelizable Shortest Path Algorithm}}
22522 , pages = {114--152}
22527 @InProceedings{ms-dsaps-98
22528 , author = MeyerU #and# SandersP
22529 , title = {{$\Delta$-Stepping : A Parallel Single Source Shortest Path Algorithm}}
22530 , booktitle = {{Proceedings of the 6th Annual European Symposium on Algorithms (ESA'98)}}
22531 , pages = {393--404}
22532 , series = ser-springer_lncs
22537 @InProceedings{ms-edopg-12
22538 , author = MozesS #and# SommerC
22539 , title = {{Exact Distance Oracles for Planar Graphs}}
22540 , booktitle = {{Proceedings of the 23rd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'12)}}
22541 , pages = {209--222}
22542 , publisher = pub-siam
22546 @InCollection{ms-etipd-09
22547 , author = MuellerHannemannM #and# SchneeM
22548 , title = {{Efficient Timetable Information in the Presence of Delays}}
22549 , booktitle = {{Robust and Online Large-Scale Optimization}}
22550 , pages = {249--272}
22551 , publisher = pub-springer
22552 , series = ser-springer_lncs
22557 @InCollection{ms-faatc-07
22558 , author = MuellerHannemannM #and# SchneeM
22559 , title = {{Finding All Attractive Train Connections by Multi-Criteria Pareto Search}}
22560 , booktitle = {{Algorithmic Methods for Railway Optimization}}
22561 , pages = {246--263}
22562 , publisher = pub-springer
22563 , series = ser-springer_lncs
22568 @article{ms-fecdg-89
22569 , author = MansourY #and# SchieberB
22570 , title = {{Finding the Edge Connectivity of Directed Graphs}}
22579 @InProceedings{ms-gpplh-04
22580 , author = MonienB #and# SchambergerS
22581 , title = {{Graph Partitioning with the Party Library: Helpful-Sets in Practice}}
22582 , booktitle = {{Proceedings of the 16th Symposium on Computer Architecture and High Performance Computing (SBAC-PAD'04)}}
22583 , pages = {198--205}
22584 , publisher = pub-ics
22589 , editor = MattfeldDC #and# SuhlL
22590 , title = {{Informationssysteme in Transport und Verkehr}}
22591 , booktitle = {{Informationssysteme in Transport und Verkehr}}
22592 , publisher = pub-bdgh
22593 , url = "http://books.google.com/books?id=Bv_T4VSoNzAC&printsec=frontcover&dq=Informationssysteme+in+Transport+und+Verkehr&hl=de"
22598 , author = MehlhornK #and# NaeherS
22599 , title = {{LEDA, A platform for Combinatorial and Geometric Computing}}
22600 , isbn = "0-521-56329-1"
22601 , publisher = pub-cup
22605 @InProceedings{ms-pltcm-06
22606 , author = MuellerHannemannM #and# SchneeM
22607 , title = {{Paying Less for Train Connections with MOTIS}}
22608 , booktitle = {{Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)}}
22610 , pdf = "http://drops.dagstuhl.de/opus/volltexte/2006/657/pdf/06001.Mueller_HannemannMatthias.Paper.657.pdf"
22611 , series = ser-oasioasi
22612 , url = "http://drops.dagstuhl.de/opus/volltexte/2006/657/"
22616 @InCollection{ms-porod-06
22617 , author = MellouliT #and# SuhlL
22618 , title = {{Passenger-Online Routing On Dynamic Networks}}
22619 , booktitle = {{Informationssysteme in Transport und Verkehr}}
22621 , publisher = pub-bdgh
22622 , url = "http://books.google.com/books?id=Bv_T4VSoNzAC&printsec=frontcover&dq=Informationssysteme+in+Transport+und+Verkehr&hl=de"
22626 @unpublished{ms-tipda-08
22627 , author = MuellerHannemannM #and# SchneeM
22628 , title = {{Timetable Information in the Presence of Delays: A Realistic Prototype}}
22629 , note = {online available at \url{http://www.diei.univaq.it/arrival/abstracts/Mueller-Hannemann.pdf}}
22630 , pdf = "http://www.diei.univaq.it/arrival/abstracts/Mueller-Hannemann.pdf"
22634 @InProceedings{msf-eotti-08
22635 , author = MuellerHannemannM #and# SchneeM #and# FredeL
22636 , title = {{Efficient On-Trip Timetable Information in the Presence of Delays}}
22637 , booktitle = {{Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08)}}
22639 , pdf = "http://drops.dagstuhl.de/opus/volltexte/2008/1584/pdf/08002.Frede.1584.pdf"
22640 , series = ser-oasioasi
22644 @article{msikca-nm-02
22645 , author = MiloR #and# ShenOrrS #and# ItzkovitzS #and# KashtanN #and# ChklovskiiD #and# AlonU
22646 , title = {{Network Motifs: {Simple} Building Blocks of Complex Networks}}
22647 , journal = j-science
22649 , pages = {824--827}
22654 @InProceedings{msm-gdspq-06
22655 , author = MaueJ #and# SandersP #and# MatijevicD
22656 , title = {{Goal Directed Shortest Path Queries Using Precomputed Cluster Distances}}
22657 , booktitle = {{Proceedings of the 5th Workshop on Experimental Algorithms (WEA'06)}}
22658 , pages = {316--328}
22659 , publisher = pub-springer
22660 , series = ser-springer_lncs
22665 @Article{msm-gdspq-09
22666 , author = MaueJ #and# SandersP #and# MatijevicD
22667 , title = {{Goal-Directed Shortest-Path Queries Using Precomputed Cluster Distances}}
22668 , journal = j-acm-ea
22669 , pages = {3.2:1--3.2:27}
22674 @InProceedings{msm-uslsc-00
22675 , author = MatuszewskiC #and# SchoenfeldR #and# MolitorP
22676 , title = {{Using Sifting for k -Layer Straightline Crossing Minimization}}
22677 , booktitle = {{Proceedings of the 7th International Symposium on Graph Drawing (GD'99)}}
22678 , location = "Stirin Castle, Czech Republic"
22680 , pages = {217--224}
22681 , publisher = pub-springer
22682 , series = ser-springer_lncs
22683 , url = "http://www.springerlink.com/content/21wnxfa5l8dg/"
22688 @Article{mssww-pgsda-06
22689 , author = MoehringR #and# SchillingH #and# SchuetzB #and# WagnerD #and# WillhalmT
22690 , title = {{Partitioning Graphs to Speedup Dijkstra's Algorithm}}
22691 , journal = j-acm-ea
22698 @InProceedings{mssww-pgsud-05
22699 , author = MoehringR #and# SchillingH #and# SchuetzB #and# WagnerD #and# WillhalmT
22700 , title = {{Partitioning Graphs to Speed Up Dijkstra's Algorithm}}
22701 , booktitle = {{Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)}}
22702 , pages = {189--202}
22703 , publisher = pub-springer
22704 , series = ser-springer_lncs
22709 @InProceedings{msv-vl-11
22710 , author = MontgolfierFd #and# SotoM #and# ViennotL
22711 , title = {{Asymptotic Modularity of Some Graph Classes}}
22712 , booktitle = {{Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11)}}
22713 , pages = {435--444}
22714 , publisher = pub-springer
22715 , series = ser-springer_lncs
22716 , url = "http://dx.doi.org/10.1007/978-3-642-25591-5\_45"
22721 @InProceedings{msw-slca-06
22722 , author = MeckeS #and# SchoebelA #and# WagnerD
22723 , title = {{Station Location -- Complexity and Approximation}}
22724 , booktitle = {{Proceedings of the 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'05)}}
22725 , pdf = "http://drops.dagstuhl.de/portals/ATMOS/fulltext_link.php?id=661"
22726 , series = ser-oasioasi
22727 , url = "http://drops.dagstuhl.de/opus/volltexte/2006/661"
22731 @InProceedings{msw-tlwpp-94
22732 , author = MolitorP #and# SparmannU #and# WagnerD
22733 , title = {{Two-layer wiring with pin preassignment is easier if the power supply nets are already generated}}
22734 , booktitle = {{Proceedings of the 7th International Conference on VLSI Design}}
22735 , pages = {149--154}
22739 @InCollection{mswz-tima-07
22740 , author = MuellerHannemannM #and# SchulzF #and# WagnerD #and# ZaroliagisC
22741 , title = {{Timetable Information: Models and Algorithms}}
22742 , booktitle = {{Algorithmic Methods for Railway Optimization}}
22744 , publisher = pub-springer
22745 , series = ser-springer_lncs
22752 , title = {{\url{http://www.mta.info/}}}
22757 , author = MaierD #and# UllmanJD
22758 , title = {{Connections in Acyclic Hypergraphs}}
22762 , pages = {185--199}
22767 @InProceedings{mw-aesgp-11
22768 , author = MeinertS #and# WagnerD
22769 , title = {{An Experimental Study on Generating Planar Graphs}}
22770 , booktitle = {{Proceedings of the 7th International Conference on Algorithmic Aspects in Information and Management (AAIM'11)}}
22771 , pages = {375--387}
22772 , publisher = pub-springer
22773 , series = ser-springer_lncs
22774 , url = "http://dx.doi.org/10.1007/978-3-642-21204-8_39"
22779 @InCollection{mw-ctvls-97
22780 , author = MoehringR #and# WagnerD
22781 , title = {{Combinatorial Topics in {VLSI} Design, Annotated Bibliography}}
22782 , booktitle = {{Annotated Bibliographies in Combinatorial Optimization}}
22783 , pages = {429--444}
22784 , publisher = pub-wiley
22788 @Article{mw-curn-08
22789 , author = MoscibrodaT #and# WattenhoferM
22790 , title = {{Coloring Unstructured Radio Networks}}
22793 , pages = {271--284}
22798 @Article{mw-frspg-95
22799 , author = MendelzonAO #and# WoodPT
22800 , title = {{Finding Regular Simple Paths in Graph Databases}}
22801 , journal = j-sicomp
22803 , pages = {1235--1258}
22808 @InProceedings{mw-gtdrn-11
22809 , author = MeinertS #and# WagnerD
22810 , title = {{Generating Time Dependencies in Road Networks}}
22811 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
22812 , pages = {434--446}
22813 , publisher = pub-springer
22814 , series = ser-springer_lncs
22815 , url = "http://dx.doi.org/10.1007/978-3-642-20662-7_37"
22820 @InProceedings{mw-pspof-01
22821 , author = MuellerHannemannM #and# WeiheK
22822 , title = {{Pareto Shortest Paths is Often Feasible in Practice}}
22823 , booktitle = {{Proceedings of the 5th International Workshop on Algorithm Engineering (WAE'01)}}
22824 , pages = {185--197}
22825 , publisher = pub-springer
22826 , series = ser-springer_lncs
22831 @InProceedings{mw-sgcpd-04
22832 , author = MeckeS #and# WagnerD
22833 , title = {{Solving Geometric Covering Problems by Data Reduction}}
22834 , booktitle = {{Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04)}}
22835 , pages = {760--771}
22836 , pdf = "http://i11www.ira.uka.de/extra/publications/mw-sgcpd-04.pdf"
22837 , series = ser-springer_lncs
22838 , url = "http://www.springeronline.com/sgw/cda/frontpage/0,11855,5-164-22-34333238-0,00.html"
22843 @InProceedings{mw-tccwn-06
22844 , author = MoscibrodaT #and# WattenhoferR
22845 , title = {{The Complexity of Connectivity in Wireless Networks}}
22846 , booktitle = {{Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
22849 , publisher = pub-ieeecs
22854 , author = MatternF #and# WagnerD
22855 , title = {{Terra incognita. (Rezension des dtv-Atlas zur Informatik)}}
22860 , pdf = "http://www.vs.inf.ethz.ch/publ/papers/dtv_inf.pdf"
22865 @article{mw-ugrrgmd-90
22866 , author = McKayBD #and# WormaldNC
22867 , title = {{Uniform generation of random regular graphs of moderate degree}}
22874 @InCollection{mww-vlsin-95
22875 , author = MoehringR #and# WagnerD #and# WagnerF
22876 , title = {{{VLSI} Network Design: a Survey}}
22877 , booktitle = {{Handbooks in Operations Research/Management Science, Volume on Networks}}
22878 , pages = {625--712}
22879 , publisher = pub-nh
22883 @InProceedings{mwz-tcmsi-06
22884 , author = MoscibrodaT #and# WattenhoferR #and# ZollingerA
22885 , title = {{Topology Control Meets SINR: The Scheduling Complexity of Arbitrary Topologies}}
22886 , booktitle = {{Proceedings of the 7th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'06)}}
22887 , pages = {310--321}
22888 , publisher = pub-acm
22892 @InProceedings{mz-fcoad-07
22893 , author = MullerLF #and# ZachariasenM
22894 , title = {{Fast and Compact Oracles for Approximate Distances in Planar Graphs}}
22895 , booktitle = {{Proceedings of the 14th Annual European Symposium on Algorithms (ESA'07)}}
22896 , pages = {657--668}
22897 , publisher = pub-springer
22898 , series = ser-springer_lncs
22903 %% --------------------------------------------------------------
22905 @techreport{n-admm-05
22906 , author = NollenburgM
22907 , title = {{Automated Drawing of Metro Maps}}
22908 , institution = iti_wagner
22909 , number = {2005-25}
22910 , pdf = "http://i11www.ira.uka.de/extra/publications/n-admm-05.pdf"
22911 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000004123"
22915 @mastersthesis{n-admm-05da
22916 , author = NollenburgM
22917 , title = {{Automated Drawing of Metro Maps}}
22919 , pdf = "http://i11www.ira.uka.de/extra/publications/n-admm-05da.pdf"
22920 , school = "Universit{\"a}t Karlsruhe"
22924 @Article{n-amdsr-40
22925 , author = NorthwayML
22926 , title = {{A Method for Depicting Social Relationships Obtained by Sociometric Testing}}
22930 , pages = {144--150}
22931 , url = "http://links.jstor.org/sici?sici=0038-0431(194004)3\%3A2\%3C144\%3AAMFDSR\%3E2.0.CO\%3B2-3"
22937 , author = NewmanMEJ
22938 , title = {{Assortative Mixing in Networks}}
22946 , author = NewmanMEJ
22947 , title = {{Analysis of Weighted Networks}}
22951 , pdf = "http://prola.aps.org/pdf/PRE/v70/i5/e056131"
22952 , url = "http://link.aps.org/abstract/PRE/v70/e056131"
22957 @Article{n-ccrpl-92
22958 , author = NummenmaaJ
22959 , title = {{Constructing Compact Rectiliner Planar Layouts Using Canonical Representation of Planar Graphs}}
22962 , pages = {213--230}
22968 , author = NieminenUJ
22969 , title = {{On the Centrality in a Directed Graph}}
22971 , pages = {371--378}
22976 @mastersthesis{n-cldmu-12
22977 , author = NiedermannB
22978 , title = {{Consistent Labeling of Dynamic Maps Using Smooth Trajectories}}
22979 , institution = "Fakult{\"a}t f{\"u}r Informatik"
22981 , pdf = "http://i11www.ira.uka.de/extra/publications/n-cldmu-12.pdf"
22982 , school = "Karlsruher Institut f{\"u}r Technologie
\r
22987 @Article{n-cmcgd-07
22988 , author = NagamochiH
22989 , title = {{Computing a Minimum Cut in a Graph with Dynamic Edges Incident to a Designated Vertex}}
22992 , pages = {428--431}
22993 , url = "http://ietisy.oxfordjournals.org/cgi/content/abstract/E90-D/2/428"
22999 , author = NewmanMEJ
23000 , title = {{Detecting Community Structure in Networks}}
23003 , pages = {321--330}
23004 , pdf = "http://www.springerlink.com/content/5gtdacx17bqv6cdc/fulltext.pdf"
23005 , url = "http://www.springerlink.com/content/5GTDACX17BQV6CDC"
23011 , author = NashWilliamsC
23012 , title = {{Decomposition of Finite Graphs into Forests}}
23019 @Article{n-ebses-84
23021 , title = {{Ein einfacher Beweis des Satzes von Euler-Schl{\"a}fli}}
23029 , author = NewmanMEJ
23030 , title = {{Finding community structure in networks using the eigenvectors of matrices}}
23037 @unpublished{n-fadcs-03
23038 , author = NewmanMEJ
23039 , title = {{Fast algorithm for detecting community structure in networks}}
23041 , note = {Phys. Rev. E 69, 066133 (2004)}
23042 , url = "http://arxiv.org/abs/cond-mat/0309508"
23046 @Article{n-fadcs-04
23047 , author = NewmanMEJ
23048 , title = {{Fast Algorithm for Detecting Community Structure in Networks}}
23051 , pdf = "http://prola.aps.org/pdf/PRE/v69/i6/e066133"
23052 , url = "http://prola.aps.org/abstract/PRE/v69/i6/e066133"
23057 @Article{n-fcsne-06
23058 , author = NewmanMEJ
23059 , title = {{Finding Community Structure in Networks using the Eigenvectors of Matrices}}
23062 , url = "http://link.aps.org/abstract/PRE/v74/e036104"
23067 @Article{n-fcsnu-06
23068 , author = NewmanMEJ
23069 , title = {{Finding Community Structure in Networks Using the Eigenvectors of Matrices}}
23073 , url = "http://link.aps.org/doi/10.1103/PhysRevE.74.036104"
23078 @Article{n-gancp-04
23079 , author = NagamochiH
23080 , title = {{Graph Algorithms for Network Connectivity Problems}}
23081 , journal = j-jorsj
23083 , pages = {199--223}
23088 @InCollection{n-gv-07
23089 , author = NollenburgM
23090 , title = {{Geographic Visualization}}
23091 , booktitle = {{Human-Centered Visualization Environments}}
23092 , pages = {257--294}
23093 , pdf = "http://i11www.ira.uka.de/extra/publications/n-gv-07.pdf"
23094 , publisher = pub-springer
23095 , series = ser-springer_lncs
23096 , url = "http://dx.doi.org/10.1007/978-3-540-71949-6_6"
23101 @InProceedings{n-iamlc-10
23102 , author = NollenburgM
23103 , title = {{An Improved Algorithm for the Metro-Line Crossing Minimization Problem}}
23104 , booktitle = {{Proceedings of the 17th International Symposium on Graph Drawing (GD'09)}}
23105 , pages = {381--392}
23106 , pdf = "http://i11www.ira.uka.de/extra/publications/n-iamlc-10.pdf"
23107 , publisher = pub-springer
23108 , series = ser-springer_lncs
23109 , url = "http://dx.doi.org/10.1007/978-3-642-11805-0_36"
23115 , author = NiedermeierR
23116 , title = {{Invitation to Fixed Parameter Algorithms}}
23117 , booktitle = {{Invitation to Fixed Parameter Algorithms}}
23118 , publisher = pub-oup
23123 , author = NashWilliamsC
23124 , title = {{London Mathematical Society}}
23126 , pages = {445--450}
23131 @unpublished{n-mbcbr-03
23132 , author = NewmanMEJ
23133 , title = {{A Measure of Betweenness Centrality Based on Random Walks}}
23134 , note = {arXiv cond-mat/0309045}
23135 , url = "http://arxiv.org/ps/cond-mat/0309045"
23139 @Article{n-mbcbr-05
23140 , author = NewmanMEJ
23141 , title = {{A Measure of Betweenness Centrality Based on Random Walks}}
23146 , url = "http://linkinghub.elsevier.com/retrieve/pii/S0378873304000681"
23152 , author = NewmanMEJ
23153 , title = {{Modularity and Community Structure in Networks}}
23157 , pages = {8577--8582}
23158 , url = "http://www.pnas.org/cgi/content/abstract/0601602103v1"
23163 @InCollection{n-mlagd-01
23165 , title = {{Map Labeling with Application to Graph Drawing}}
23166 , booktitle = {{Drawing Graphs: Methods and Models}}
23167 , isbn = "3-540-42062-2"
23168 , pages = {247--273}
23169 , pdf = "http://springerlink.metapress.com/content/fm58a78e047fdgd3/fulltext.pdf"
23170 , publisher = pub-springer
23171 , series = ser-springer_lncs
23172 , url = "http://springerlink.metapress.com/content/fm58a78e047fdgd3/"
23177 @phdthesis{n-nvaac-09
23178 , author = NollenburgM
23179 , title = {{Network Visualization: Algorithms, Applications, and Complexity}}
23181 , pdf = "http://i11www.ira.uka.de/extra/publications/n-nvaac-09.pdf"
23182 , school = "Fakult{\"a}t f{\"u}r Informatik, Universit{\"a}t Karlsruhe (TH)"
23183 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011456"
23187 @mastersthesis{n-ocaic-08
23189 , title = {{Optimisation of Clustering Algorithms for the Identification of Customer Profiles from Shopping Cart Data}}
23190 , institution = uni_ka
23192 , note = {Diplomarbeit}
23193 , pdf = "http://i11www.ira.uka.de/extra/publications/n-ocaic-08.pdf"
23194 , school = "Department of Informatics"
23195 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished#diplomarbeiten"
23201 , title = {{Planar Drawings of Plane Graphs}}
23204 , pages = {384--391}
23209 @mastersthesis{n-prs-10
23210 , author = NeubauerS
23211 , title = {{Planung energieeffizienter Routen in Stra\ss{}ennetzwerken}}
23214 , url = "http://algo2.iti.kit.edu/1663.php"
23218 @Article{n-psslp-54
23219 , author = NorthwayML
23220 , title = {{A Plan for Sociometric Studies in a Longitudinal Programme of Research in Child Development}}
23224 , pages = {272--281}
23225 , url = "http://www.jstor.org/pss/2785820"
23230 @Article{n-scnsp-01
23231 , author = NewmanMEJ
23232 , title = {{Scientific Collaboration Networks. II. Shortest Paths, Weighted Networks, and Centrality}}
23235 , pdf = "http://prola.aps.org/pdf/PRE/v64/i1/e016132"
23236 , url = "http://dx.doi.org/10.1103/PhysRevE.64.016132"
23241 @mastersthesis{n-seapl-09
23242 , author = NeubauerS
23243 , title = {{Space Efficient Approximation of Piecewise Linear Functions}}
23244 , note = {\url{http://algo2.iti.kit.edu/download/neubauer_sa.pdf}}
23246 , type = {Studienarbeit}
23251 , author = NewmanMEJ
23252 , title = {{Scientific collaboration networks. I. Network construction and fundamental results.}}
23255 , number = {1 Pt 2}
23256 , url = "http://view.ncbi.nlm.nih.gov/pubmed/11461355"
23262 , author = NewmanMEJ
23263 , title = {{The structure of scientific collaboration networks}}
23267 , pages = {404--409}
23273 , author = NachtigallK
23274 , title = {{Time depending shortest-path problems with applications to railway networks}}
23277 , pages = {154--166}
23282 @incollection{n-tn-03
23284 , title = {{Traffic networks}}
23285 , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}}
23286 , publisher = pub-wiley-vch
23287 , url = "http://dx.doi.org/10.1002/3527602755.fmatter"
23293 , title = {{The Theory of Social Structure}}
23294 , publisher = pub-cw
23298 @InCollection{n-vnaak-10
23299 , author = NollenburgM
23300 , title = {{Visualisierung von Netzen: Algorithmen, Anwendungen und Komplexit{\"a}t}}
23301 , booktitle = {{Ausgezeichnete Informatikdissertationen 2009}}
23302 , pages = {161--170}
23303 , pdf = "http://i11www.ira.uka.de/extra/publications/n-vnaak-10.pdf"
23310 , author = NewmanMEJ #and# BarabasiAL #and# WattsDJ
23311 , title = {{The Structure and Dynamics of Networks}}
23312 , booktitle = {{The Structure and Dynamics of Networks}}
23313 , publisher = pub-pup
23315 , url = "http://press.princeton.edu/titles/8114.html"
23319 @InProceedings{ndls-bastd-08
23320 , author = NanniciniG #and# DellingD #and# LibertiL #and# SchultesD
23321 , title = {{Bidirectional A* Search for Time-Dependent Fast Paths}}
23322 , booktitle = {{Proceedings of the 7th Workshop on Experimental Algorithms (WEA'08)}}
23324 , pages = {334--346}
23325 , pdf = "http://i11www.ira.uka.de/extra/publications/ndls-bastd-08.pdf"
23326 , publisher = pub-springer
23327 , series = ser-springer_lncs
23332 @Article{ndls-bastd-12
23333 , author = NanniciniG #and# DellingD #and# LibertiL #and# SchultesD
23334 , title = {{Bidirectional A* Search on Time-Dependent Road Networks}}
23335 , journal = j-networks
23336 , note = {Journal version of WEA'08.}
23337 , pages = {240--251}
23342 @Article{ng-fecsn-04
23343 , author = NewmanMEJ #and# GirvanM
23344 , title = {{Finding and evaluating community structure in networks}}
23348 , url = " http://link.aps.org/abstract/PRE/v69/e026113"
23353 @InCollection{ng-mpcsn-03
23354 , author = NewmanMEJ #and# GirvanM
23355 , title = {{Mixing Patterns and Community Structure in Networks}}
23356 , booktitle = {{Statistical Mechanics of Complex Networks}}
23358 , pdf = "http://springerlink.metapress.com/content/up95b47kkr8p5mfh/fulltext.pdf"
23359 , publisher = pub-springer
23360 , series = ser-springer_lnp
23361 , url = "http://springerlink.metapress.com/content/up95b47kkr8p5mfh/"
23366 @article{ng-nrmnf-90
23367 , author = NajjarW #and# GaudiotJL
23368 , title = {{Network Resilience: A Measure of Network Fault Tolerance}}
23372 , pages = {174--181}
23378 , author = NagamochiH #and# IbarakiT
23379 , title = {{Algorithmic Aspects of Graph Connectivity}}
23380 , booktitle = {{Algorithmic Aspects of Graph Connectivity}}
23381 , publisher = pub-cup
23387 @InProceedings{njw-oscaa-01
23388 , author = NgAY #and# JordanMI #and# WeissY
23389 , title = {{On Spectral Clustering: Analysis and an Algorithm}}
23390 , booktitle = {{Proceedings of 14th Conference: Neural Information Processing Systems}}
23391 , pages = {849--856}
23392 , pdf = "http://www.robotics.stanford.edu/~ang/papers/nips01-spectral.pdf"
23396 @Article{nk-ccrmc-96
23397 , author = NagamochiH #and# KamedaT
23398 , title = {{Constructing Cactus Representation for all Minimum Cuts in an Undirected Network}}
23399 , journal = j-jorsj
23402 , pages = {135--158}
23408 , author = NooyW #and# MrvarA #and# BatageljV
23409 , title = {{Exploratory Social Network Analysis with Pajek}}
23410 , booktitle = {{Exploratory Social Network Analysis with Pajek}}
23411 , publisher = pub-cup
23412 , series = ser-sass
23413 , url = "http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=0521602629"
23418 @Article{nmcm-edmdg-09
23419 , author = NicosiaV #and# MangioniG #and# CarchioloV #and# MalgeriM
23420 , title = {{Extending the Definition of Modularity to Directed Graphs with Overlapping Communities}}
23423 , pages = {p03024 (23pp)}
23424 , pdf = "http://www.iop.org/EJ/article/1742-5468/2009/03/P03024/jstat9_03_p03024.pdf"
23425 , url = "http://stacks.iop.org/1742-5468/2009/P03024"
23430 @unpublished{nmcm-emddg-08
23431 , author = NicosiaV #and# MangioniG #and# CarchioloV #and# MalgeriM
23432 , title = {{Extending Modularity Definition for Directed Graphs with Overlapping Communities}}
23434 , url = "http://arxiv.org/abs/0801.1647"
23438 @Article{nmwb-mpast-08
23439 , author = NollenburgM #and# MerrickD #and# WolffA #and# BenkertM
23440 , title = {{Morphing Polylines: A Step Towards Continuous Generalization}}
23442 , note = {Special issue of GISRUK 2007}
23444 , pages = {248--260}
23445 , pdf = "http://i11www.ira.uka.de/extra/publications/nmwb-mpast-08.pdf"
23446 , url = "http://dx.doi.org/10.1016/j.compenvurbsys.2008.06.004"
23451 @InProceedings{nn-altaf-00
23452 , author = NagaiS #and# NakanoS
23453 , title = {{A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs}}
23454 , booktitle = {{Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'00)}}
23455 , pages = {290--301}
23456 , publisher = pub-springer
23457 , series = ser-springer_lncs
23463 , author = NesetrilJ #and# PoljakS
23464 , title = {{On the complexity of the subgraph problem}}
23467 , pages = {415--419}
23472 @InProceedings{np-egdt-13
23473 , author = NollenburgM #and# PrutkinR
23474 , title = {{Euclidean Greedy Drawings of Trees}}
23475 , booktitle = {{Proceedings of the 21st Annual European Symposium on Algorithms (ESA'13)}}
23476 , note = {To appear.}
23477 , publisher = pub-springer
23478 , series = ser-springer_lncs
23479 , url = "http://arxiv.org/abs/1306.5224"
23484 , author = NewmanMEJ #and# ParkJ
23485 , title = {{Origin of degree correlations in the Internet and other networks}}
23488 , url = "http://prola.aps.org/abstract/PRE/v68/i2/e026112"
23493 @article{np-wsndtn-03
23494 , author = NewmanMEJ #and# ParkJ
23495 , title = {{Why social networks are different from other types of networks}}
23502 @InProceedings{npb-ruon-03
23503 , author = NakaoA #and# PetersonL #and# BavierA
23504 , title = {{A Routing Underlay for Overlay Networks}}
23505 , booktitle = {{SIGCOMM '03: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications}}
23507 , publisher = pub-acm
23508 , url = "http://doi.acm.org/10.1145/863955.863958"
23512 @InProceedings{npr-e-12
23513 , author = NollenburgM #and# PrutkinR #and# RutterI
23514 , title = {{Edge-weighted Contact Representations of Planar Graphs}}
23515 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
23516 , pages = {224--235}
23517 , pdf = "http://i11www.ira.uka.de/extra/publications/npr-e-12.pdf"
23518 , publisher = pub-springer
23519 , series = ser-springer_lncs
23520 , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_20"
23526 , author = NollenburgM #and# PrutkinR #and# RutterI
23527 , title = {{Edge-weighted contact representations of planar graphs}}
23529 , note = {Special issue of GD 2012.}
23531 , pages = {441--473}
23532 , pdf = "http://i11www.ira.uka.de/extra/publications/npr-e-13.pdf"
23533 , url = "http://dx.doi.org/10.7155/jgaa.00299"
23538 @InProceedings{nps-dosbl-10
23539 , author = NollenburgM #and# PolishchukV #and# SysikaskiM
23540 , title = {{Dynamic One-Sided Boundary Labeling}}
23541 , booktitle = {{Proceedings of the 18th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems}}
23543 , pages = {310--319}
23544 , pdf = "http://i11www.ira.uka.de/extra/publications/nps-dosbl-10.pdf"
23545 , publisher = pub-acm
23546 , url = "http://dl.acm.org/authorize?316206"
23550 @InProceedings{nr-mamc-09
23551 , author = NoackA #and# RottaR
23552 , title = {{Multi-level Algorithms for Modularity Clustering}}
23553 , booktitle = {{Proceedings of the 8th International Symposium on Experimental Algorithms (SEA'09)}}
23555 , pages = {257--268}
23556 , pdf = "http://www.springerlink.com/content/qugv7708h3806230/fulltext.pdf"
23557 , publisher = pub-springer
23558 , series = ser-springer_lncs
23559 , url = "http://www.springerlink.com/content/qugv7708h3806230/"
23565 , author = NishizekiT #and# RahmanS
23566 , title = {{Planar Graph Drawing}}
23567 , booktitle = {{Planar Graph Drawing}}
23568 , publisher = pub-wsp
23569 , series = ser-lnsc
23575 , author = NakanoS #and# RahmanS #and# NishizekiT
23576 , title = {{A linear-time algorithm for four-partitioning four-connected planar graphs}}
23578 , pages = {315--322}
23584 , editor = NisanN #and# RoughgardenT #and# TardosE #and# VaziraniVV
23585 , title = {{Algorithmic Game Theory}}
23586 , booktitle = {{Algorithmic Game Theory}}
23587 , publisher = pub-cup
23591 @InCollection{ns-b-05
23592 , author = NunkesserM #and# SawitzkiD
23593 , title = {{Blockmodels}}
23594 , booktitle = {{Network Analysis: Methodological Foundations}}
23596 , pages = {253--292}
23597 , pdf = "http://springerlink.metapress.com/content/dxf4kw1hramavgev/fulltext.pdf"
23598 , publisher = pub-springer
23599 , series = ser-springer_lncs
23600 , url = "http://springerlink.metapress.com/content/dxf4kw1hramavgev/"
23605 @article{ns-epsb-01
23606 , author = NowickiK #and# SnijdersTAB
23607 , title = {{Estimation and Prediction for Stochastic Blockstructures}}
23609 , pages = {1077--1087}
23614 @article{ns-fsccdg-94
23615 , author = NuutilaE #and# SoisalonSoininenE
23616 , title = {{On finding the strongly connected components in a directed graph}}
23625 @Article{nst-ndasp-00
23626 , author = NarvaezP #and# SiuK #and# TzengH
23627 , title = {{New Dynamic Algorithms for Shortest Path Tree Computation}}
23630 , pages = {734--746}
23635 @article{nsw-rgadd-01
23636 , author = NewmanMEJ #and# WattsDJ #and# StrogatzSH
23637 , title = {{Random graphs with arbitrary degree distributions and their applications}}
23644 @techreport{nsww-pdpap-96-tr
23645 , author = NeyerG #and# SchlickenriederW #and# WagnerD #and# WeiheK
23646 , title = {{PlaNet---A Demonstration Package for Algorithms on Planar Networks}}
23647 , institution = "Universit{\"a}t Konstanz"
23648 , note = {Konstanzer Schriften in Mathematik und Informatik}
23653 @inproceedings{ntjn-sitmg-87
23654 , author = NicholsonV #and# TsaiCC #and# JohnsonMA #and# NaimM
23655 , title = {{A Subgraph Isomorphism Theorem for Molecular Graphs}}
23656 , booktitle = {{proc-gttc}}
23657 , pages = {226--230}
23661 @InProceedings{nvwh-dbtae-09
23662 , author = NollenburgM #and# VolkerM #and# WolffA #and# HoltenD
23663 , title = {{Drawing Binary Tanglegrams: An Experimental Evaluation}}
23664 , booktitle = {{Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX'09)}}
23666 , pages = {106--119}
23667 , pdf = "http://i11www.ira.uka.de/extra/publications/nvwh-dbtae-09.pdf"
23668 , publisher = pub-siam
23669 , url = "http://www.siam.org/proceedings/alenex/2009/alenex09.php"
23673 @InProceedings{nw-amipd-06
23674 , author = NollenburgM #and# WolffA
23675 , title = {{A Mixed-Integer Program for Drawing High-Quality Metro Maps}}
23676 , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}}
23678 , pages = {321--333}
23679 , pdf = "http://i11www.ira.uka.de/extra/publications/nw-amipd-06.pdf"
23680 , publisher = pub-springer
23681 , series = ser-springer_lncs
23682 , url = "http://dx.doi.org/10.1007/11618058_29"
23687 @Article{nw-dlhqm-11
23688 , author = NollenburgM #and# WolffA
23689 , title = {{Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming}}
23693 , pages = {626--641}
23694 , pdf = "http://i11www.ira.uka.de/extra/publications/nw-dlhqm-10.pdf"
23695 , url = "http://dx.doi.org/10.1109/TVCG.2010.81"
23701 , author = NemhauserGL #and# WolseyLA
23702 , title = {{Integer and Combinatorial Optimization}}
23703 , publisher = pub-wiley
23707 @article{nws-rgmsn-02
23708 , author = NewmanMEJ #and# StrogatzSH #and# WattsDJ
23709 , title = {{Random graph models of social networks}}
23711 , pages = {2566--2572}
23712 , url = "http://www.pnas.org/cgi/reprint/99/suppl_1/2566.pdf"
23717 @InProceedings{nz-diedt-02
23718 , author = NaeherS #and# ZlotowskiO
23719 , title = {{Design and Implementation of Efficient Data Types for Static Graphs}}
23720 , booktitle = {{Proceedings of the 10th Annual European Symposium on Algorithms (ESA'02)}}
23721 , pages = {157--164}
23722 , pdf = "http://www.springerlink.com/content/1u1jw0kfa9lgnrwn/fulltext.pdf"
23723 , publisher = pub-springer
23724 , series = ser-springer_lncs
23729 @inproceedings{nzj-laes-01
23730 , author = NgAY #and# ZhengAX #and# JordanMI
23731 , title = {{Link Analysis, Eigenvectors and Stability}}
23732 , address = "Seattle, Washington"
23733 , booktitle = {{Proceedings of the 17th international joint conference on artificial intelligence}}
23734 , pages = {903--910}
23738 %% --------------------------------------------------------------
23740 @Article{o-aspml-73
23742 , title = {{A Short Proof of Mac Lane's Planarity Theorem}}
23744 , pages = {617--618}
23750 , author = OellermannOR
23751 , title = {{On the $l$-Connectivity of a Graph}}
23753 , pages = {285--291}
23758 @InCollection{o-mcg-07
23760 , title = {{Mining from Chemical Graphs}}
23761 , booktitle = {{Mining Graph Data}}
23762 , pages = {347--379}
23763 , publisher = pub-wiley
23764 , url = "http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0471731900.html"
23769 , author = OellermannOR
23770 , title = {{A Note on the $\ell$-Connectivity Function of a Graph}}
23771 , journal = j-congr-num
23773 , pages = {181--188}
23779 , editor = OttmannT
23780 , title = {{Prinzipien des Algorithmenentwurfs. Multimediales Lehrbuch}}
23781 , booktitle = {{Prinzipien des Algorithmenentwurfs. Multimediales Lehrbuch}}
23782 , publisher = pub-sav
23787 , editor = OsawaT #and# DAlexandriFL
23788 , title = {{Lipidomics Volume 2: Methods and Protocols }}
23789 , booktitle = {{Lipidomics Volume 2: Methods and Protocols }}
23790 , publisher = pub-springer
23792 , url = "http://www.springerlink.com/content/x44337/?p=ebd7feef805040b8bd7702f42b879af5&pi=0"
23797 @InProceedings{og-ccmm-10
23798 , author = OvelgonneM #and# Geyer-SchulzA
23799 , title = {{Cluster Cores and Modularity Maximization}}
23800 , booktitle = {{Data Mining Workshops (ICDMW), 2010 IEEE International Conference on}}
23802 , pages = {1204--1213}
23803 , publisher = pub-ics
23807 @article{ohl-xcapscpm-04
23808 , author = OrtizMGR #and# HoyosJRC #and# LopezMGR
23809 , title = {{The social networks of academic performance in a student context of poverty in Mexico}}
23812 , pages = {175--188}
23817 @Article{olghklp-asgpc-07
23818 , author = OwensJD #and# LuebkeD #and# GovindarajuN #and# HarrisM #and# KruegerJ #and# LefohnA #and# PurcellTJ
23819 , title = {{A Survey of General-Purpose Computation on Graphics Hardware}}
23822 , pages = {80--113}
23823 , url = "http://www.blackwell-synergy.com/doi/pdf/10.1111/j.1467-8659.2007.01012.x"
23829 , author = oneworld
23830 , title = {{\url{http://www.oneworld.com}}}
23834 @Article{or-mwptd-91
23835 , author = OrdaA #and# RomR
23836 , title = {{{Minimum Weight Paths in Time-Dependent Networks}}}
23837 , journal = j-networks
23838 , pages = {295--319}
23843 @Article{or-spmda-90
23844 , author = OrdaA #and# RomR
23845 , title = {{Shortest-Path and Minimum Delay Algorithms in Networks with Time-Dependent Edge-Length}}
23848 , pages = {607--625}
23853 @InProceedings{os-nlgp-10
23854 , author = OsipovV #and# SandersP
23855 , title = {{$n$-Level Graph Partitioning}}
23856 , booktitle = {{Proceedings of the 18th Annual European Symposium on Algorithms (ESA'10)}}
23857 , pages = {278--289}
23858 , publisher = pub-springer
23859 , series = ser-springer_lncs
23864 @InProceedings{osknn-drbrl-04
23865 , author = OhtaM #and# ShinodaK #and# KumadaY #and# NakashimaH #and# NodaI
23866 , title = {{Is Dial-a-Ride Bus Reasonable in Large Scale Towns? --- Evaluation of Usability of Dial-a-Ride Systems by Simulation ---}}
23867 , booktitle = {{Multiagent for Mass User Support - First International Workshop}}
23868 , pages = {105--119}
23869 , pdf = "http://www.springerlink.com/content/32gxmm3fuqchcu3q/fulltext.pdf"
23870 , publisher = pub-springer
23871 , series = ser-springer_lncs
23872 , url = "http://www.springerlink.com/content/32gxmm3fuqchcu3q/"
23878 , editor = OrourkeJ #and# ToussaintGT
23879 , title = {{Handbook of Discrete and Computational Geometry}}
23880 , booktitle = {{Handbook of Discrete and Computational Geometry}}
23881 , isbn = "0-8493-8524-5"
23882 , publisher = {CRC Press LLC, Boca}
23886 @inproceedings{ot-pr-97
23887 , author = OrourkeJ #and# ToussaintGT
23888 , title = {{Pattern recognition}}
23889 , booktitle = {{Handbook of Discrete and Computational Geometry}}
23890 , isbn = "0-8493-8524-5"
23891 , pages = {779-796}
23892 , publisher = {CRC Press LLC, Boca}
23896 @Article{oyt-fpspm-91
23897 , author = OrlinJB #and# YoungNE #and# TarjanR
23898 , title = {{Faster Parametric Shortest Path and Minimum Balance Algorithms}}
23899 , journal = j-networks
23901 , pages = {205--221}
23906 %% --------------------------------------------------------------
23910 , title = {{A new approach to all-pairs shortest paths on real-weighted graphs}}
23921 , title = {{An Algorithm for the Blocks and Cutnodes of a Graph}}
23922 , journal = j-comm-acm
23925 , pages = {468--475}
23931 , author = PattisonP
23932 , title = {{Algebraic Models for Social Networks}}
23933 , publisher = pub-cup
23937 @techreport{p-bdhsp-69
23939 , title = {{Bi-Directional and Heuristic Search in Path Problems}}
23940 , institution = "Stanford Linear Accelerator Center, Stanford, California"
23941 , number = {SLAC-104}
23942 , url = "http://www.slac.stanford.edu/cgi-wrap/getdoc/slac-r-104.pdf"
23946 @InProceedings{p-bs-71
23948 , title = {{Bi-directional Search}}
23949 , booktitle = {{Proceedings of the Sixth Annual Machine Intelligence Workshop}}
23950 , pages = {124--140}
23951 , publisher = pub-eup
23957 , author = PatrignaniM
23958 , title = {{On the Complexity of Orthogonal Compaction}}
23967 , title = {{Distributed Computing: A Locality-Sensitive Approach}}
23968 , booktitle = {{Distributed Computing: A Locality-Sensitive Approach}}
23969 , publisher = pub-sim
23975 , title = {{Diameter Vulnerability of Graphs}}
23983 , title = {{Heuristics: Intelligent Search Strategies for Computer Problem Solving}}
23984 , booktitle = {{Heuristics: Intelligent Search Strategies for Computer Problem Solving}}
23985 , publisher = pub-aw
23989 @Article{p-hsvpf-70
23991 , title = {{Heuristic Search Viewed as Path Finding in a Graph }}
23994 , pages = {193--204}
23999 @Article{p-iemas-74
24001 , title = {{Implementation and Efficiency of Moore-Algorithms for the Shortest Route Problem}}
24003 , pages = {212--222}
24008 @mastersthesis{p-mmrp-09
24010 , title = {{Multi-Modal Route Planning}}
24011 , institution = "Fakultät für Informatik"
24013 , school = "Universität Karlsruhe (TH)"
24014 , url = "http://i11www.ira.uka.de/extra/publications/p-mmrp-09.pdf"
24020 , title = {{Proximity-Preserving Labeling Schemes}}
24023 , pages = {167--176}
24029 , author = PellegriniF
24030 , title = {{SCOTCH: Static Mapping, Graph, Mesh and Hypergraph Partitioning, and Parallel and Sequential Sparse Matrix Ordering Package}}
24031 , institution = "Laboratoire Bordelais de Recherche en Informatique, Bordeaux, France"
24032 , note = {\url{http://www.labri.fr/perso/pelegrin/scotch/}}
24033 , url = "http://www.labri.fr/perso/pelegrin/scotch/"
24037 @techreport{p-scotc-08
24038 , author = PellegriniF
24039 , title = {{SCOTCH 5.1 User's guide}}
24040 , institution = "Laboratoire Bordelais de Recherche en Informatique, Bordeaux, France"
24041 , pdf = "http://gforge.inria.fr/docman/view.php/248/5709/scotch_user5.1.pdf"
24042 , url = "http://www.labri.fr/perso/pelegrin/scotch/"
24047 , author = ParlettBN
24048 , title = {{The Symmetric Eigenvalue Problem}}
24049 , publisher = pub-siam
24055 , title = {{Goal Directed Speed-Up Techniques for Shortest Path Queries in Timetable Networks}}
24057 , note = {Student Research Project}
24058 , pdf = "http://i11www.ira.uka.de/extra/publications/p-sutsp-08.pdf"
24063 @techreport{p-tca-68
24064 , author = PurdomPW
24065 , title = {{A Transitive Closure Algorithm}}
24066 , institution = "University of Wisconsin"
24069 , type = {Computer Sciences Te}
24074 , author = PurdomPW
24075 , title = {{A Transitive Closure Algorithm}}
24082 @Article{p-tulgg-61
24083 , author = ParterSV
24084 , title = {{The Use of Linear Graphs in Gauss Elimination}}
24088 , pages = {119--130}
24093 @InProceedings{p-wageh-98
24094 , author = PurchaseHC
24095 , title = {{Which Aesthetic has the Greatest Effect on Human Understanding?
\r
24097 , booktitle = {{Proceedings of the 5th International Symposium on Graph Drawing (GD'97)}}
24098 , location = "Rome, Italy"
24100 , pages = {248--261}
24101 , publisher = pub-springer
24102 , series = ser-springer_lncs
24103 , url = "http://portal.acm.org/citation.cfm?id=647549.728779"
24109 , author = PreisR #and# DiekmannR
24110 , title = {{The PARTY Partitioning Library, User Guide }}
24111 , institution = "University of Paderborn, Germany"
24112 , note = {tr-rsfb-96-02}
24113 , pdf = "http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/RESEARCH/PART/PARTY/manual.ps.gz"
24114 , url = "http://www2.cs.uni-paderborn.de/cs/robsy/party.html"
24120 , title = {{PARTY Partitioning Library }}
24121 , institution = "University of Paderborn, Germany"
24122 , note = {\url{http://www2.cs.uni-paderborn.de/cs/robsy/party.html}}
24123 , url = "http://www2.cs.uni-paderborn.de/cs/robsy/party.html"
24127 @article{pbm-dsdcs-00
24128 , author = PoulinR #and# BoilyMC #and# MasseBR
24129 , title = {{Dynamical systems to define centrality in social networks}}
24131 , pages = {187--220}
24136 @InProceedings{pbm-eufad-10
24137 , author = PatwaryMM #and# BlairJ #and# ManneF
24138 , title = {{Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure}}
24139 , booktitle = {{Proceedings of the 9th International Symposium on Experimental Algorithms (SEA'10)}}
24141 , pages = {411--423}
24142 , publisher = pub-springer
24143 , series = ser-springer_lncs
24148 @unpublished{pbmw-prcr-99
24149 , author = PageL #and# BrinS #and# MotwaniR #and# WinogradT
24150 , title = {{The {PageRank} Citation Ranking: {Bringing} Order to the Web}}
24151 , note = {Manuscript}
24156 , author = PallaG #and# BarabasiAL #and# VicsekT
24157 , title = {{Quantifying social group evolution}}
24158 , journal = j-nature
24160 , pages = {664--667}
24161 , pdf = "http://www.nature.com/nature/journal/v446/n7136/pdf/nature05670.pdf"
24162 , url = "http://www.nature.com/nature/journal/v446/n7136/abs/nature05670.html"
24167 @InProceedings{pfp-scnem-06
24168 , author = PhilippidesA #and# FineP #and# PaoloED
24169 , title = {{Spatially Constrained Networks and the Evolution of Modular Control Systems}}
24170 , booktitle = {{Proc. 9th International Conference on Simulation of Adaptive Behavior}}
24171 , pages = {546--557}
24172 , pdf = "http://www.springerlink.com/content/l2639334n317348w/fulltext.pdf"
24173 , publisher = pub-springer
24174 , series = ser-springer_lncs
24175 , url = "http://www.springerlink.com/content/l2639334n317348w/"
24179 @techreport{pg-fdwcd-04
24180 , author = ParthasarathyS #and# GandhiR
24181 , title = {{Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks}}
24182 , institution = "University of Maryland"
24186 @techreport{pgf-fanfmg-01
24187 , author = PalmerC #and# GibbonsP #and# FaloutsosC
24188 , title = {{Fast Approximation of the ``Neighbourhood'' Function for Massive Graphs}}
24189 , institution = "Carnegie Mellon Uiversity"
24190 , number = {CMUCS-01-1}
24194 @phdthesis{phd-dongen-02
24196 , title = {{Graph Clustering by Flow Simulation}}
24197 , school = "University of Utrecht"
24198 , url = "http://micans.org/mcl/lit/"
24202 @phdthesis{phd-holzapfel-04
24203 , author = HolzapfelK
24204 , title = {{Density-based clustering in large-scale networks}}
24205 , institution = "Fakult{\"a}t f{\"u}r Informatik"
24206 , school = "Technische Universit{\"a}t M{\"u}nchen"
24210 @InProceedings{phnk-otulg-12
24211 , author = PurchaseHC #and# HamerJ #and# NollenburgM #and# KobourovSG
24212 , title = {{On The Usability of Lombardi Graph Drawings}}
24213 , booktitle = {{Proceedings of the 20th International Symposium on Graph Drawing (GD'12)}}
24214 , pages = {451--462}
24215 , pdf = "http://i11www.ira.uka.de/extra/publications/phnk-otulg-12.pdf"
24216 , publisher = pub-springer
24217 , series = ser-springer_lncs
24218 , url = "http://dx.doi.org/10.1007/978-3-642-36763-2_40"
24223 @article{phv-tmii-04
24224 , author = PalaciosHuertaI #and# VolijO
24225 , title = {{The measurement of intellectual influence}}
24227 , note = {accepted for publication}
24232 , author = PfetschM #and# KaibelV
24233 , title = {{Packing and Partitioning Orbitopes}}
24234 , journal = j-math-prog-a
24237 , pdf = "http://www.springerlink.com/content/154658wqp0r700h6/fulltext.pdf"
24238 , url = "http://www.springerlink.com/content/154658wqp0r700h6/"
24243 @incollection{pl-asd-51
24244 , author = ProctorCH #and# LoomisCP
24245 , editor = JahodaM #and# DeutschM #and# CookSW
24246 , title = {{Analysis of sociometric data}}
24247 , booktitle = {{Research Methods in Social Relations}}
24248 , pages = {561--586}
24249 , publisher = {Dryden Press}
24253 @Article{pl-cclnu-06
24254 , author = PonsP #and# LatapyM
24255 , title = {{Computing Communities in Large Networks Using Random Walks}}
24258 , pages = {191--218}
24259 , pdf = "http://www-rp.lip6.fr/~latapy/Publis/communities.pdf"
24260 , url = "http://www.cs.brown.edu/publications/jgaa/"
24265 @techreport{plo-mccg-90
24266 , author = LaPoutreJA #and# LeeuwenJv #and# OvermarsMH
24267 , title = {{Maintenance of $2$- and $3$-Connected Components of Graphs, Part~I: $2$- and $3$-Edge-Connected Components}}
24268 , institution = "Dept. of Computer Science, Utrecht University"
24270 , number = {RUU-CS-90-}
24274 @inproceedings{pm-sbssg-96
24275 , author = PapadopoulosA #and# ManolopoulosY
24276 , title = {{Structure-Based Similarity Search with Graph Histograms}}
24277 , booktitle = {{{DEXA} Workshop}}
24278 , pages = {174--178}
24282 @article{pn-cijas-76
24283 , author = PinskiG #and# NarinF
24284 , title = {{Citation influence for journal aggregates of scientific publications: theory, with application to the literature of physics}}
24286 , pages = {297--312}
24292 , editor = PursulaM #and# NiittymakiJ
24293 , title = {{Mathematical methods on Optimization in Transportation Systems}}
24294 , booktitle = {{Mathematical methods on Optimization in Transportation Systems}}
24299 , author = PijlsW #and# PostHN
24300 , title = {{A new bidirectional search algorithm with shortened postprocessing}}
24304 , pages = {363--369}
24309 @article{pq-nfssn-82
24310 , author = PicardJC #and# QueyranneM
24311 , title = {{A network flow solution to some nonlinear $0$-$1$ programming problems, with an application to graph theory}}
24312 , journal = j-networks
24313 , pages = {141--159}
24318 @Article{pq-osamc-82
24319 , author = PicardJC #and# QueyranneM
24320 , title = {{On the Structure of All Minimum Cuts in a Network and Applications}}
24321 , journal = j-math-prog-a
24325 , url = "http://www.springerlink.com/content/k12w829253122g22/"
24330 @Article{pr-dsdis-03
24331 , author = PradhanSS #and# RamchandranK
24332 , title = {{Distributed source coding using Syndromes (DISCUS): Design and Construction}}
24333 , journal = j-tinfth
24336 , pages = {626--643}
24337 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1184140"
24342 @article{pr-mcrp-75
24343 , author = PicardJC #and# RatliffHD
24344 , title = {{Minimum Cuts and Related Problems}}
24345 , journal = j-networks
24347 , pages = {357--370}
24352 @article{pr-mepeg-00
24353 , author = PapendiekB #and# RechtP
24354 , title = {{On maximal entries in the principal eigenvector of graphs}}
24356 , pages = {129--138}
24361 @article{pr-ramnf-01
24362 , author = PekecA #and# RobertsFS
24363 , title = {{The Role Assignment Model Nearly Fits Most Social Networks}}
24365 , pages = {275--293}
24370 @InProceedings{pr-sa-96
24371 , author = PellegriniF #and# RomanJ
24372 , title = {{SCOTCH: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs}}
24373 , booktitle = {{High-Performance Computing and Networking}}
24374 , pages = {493--498}
24375 , pdf = "http://www.springerlink.com/content/fg24302095611p34/fulltext.pdf"
24376 , publisher = pub-springer
24377 , series = ser-springer_lncs
24378 , url = "http://www.springerlink.com/content/fg24302095611p34/"
24384 , editor = PastorSatorrasR #and# RubiM #and# DiazGuileraA
24385 , title = {{Statistical Mechanics of Complex Networks}}
24386 , booktitle = {{Statistical Mechanics of Complex Networks}}
24387 , publisher = pub-springer
24388 , series = ser-springer_lnp
24389 , url = "http://dx.doi.org/10.1007/b12331"
24394 @InProceedings{prs-eensp-02
24395 , author = PettieS #and# RamachandranV #and# SridharS
24396 , title = {{Experimental Evaluation of a New Shortest Path Algorithm}}
24397 , booktitle = {{Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)}}
24398 , pages = {105--120}
24399 , publisher = pub-springer
24400 , series = ser-springer_lncs
24405 @inproceedings{pru-uprcw-02
24406 , author = PanduranganG #and# RaghavanP #and# UpfalE
24407 , title = {{Using PageRank to characterize Web structure}}
24408 , booktitle = {{Proceedings of the 8th Annual International Conference on Computing Combinatorics (COCOON'02)}}
24409 , pages = {330--339}
24410 , series = ser-springer_lncs
24415 @Article{ps-bsfes-06
24416 , author = PererA #and# ShneidermanB
24417 , title = {{Balancing Systematic and Flexible Exploration of Social Networks}}
24420 , pages = {693--700}
24421 , pdf = "http://hcil.cs.umd.edu/trs/2006-25/2006-25.pdf"
24427 , author = PreparataFP #and# ShamosMI
24428 , title = {{Computational Geometry: An Introduction}}
24429 , booktitle = {{Computational Geometry: An Introduction}}
24430 , publisher = pub-springer
24435 , author = PelegD #and# SchafferAA
24436 , title = {{Graph Spanners}}
24439 , pages = {99--116}
24444 @InCollection{ps-spatm-98
24445 , author = PallottinoS #and# ScutellaMG
24446 , title = {{Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects}}
24447 , booktitle = {{Equilibrium and Advanced Transportation Modelling}}
24448 , pages = {245--281}
24449 , publisher = pub-kapg
24453 @inproceedings{psffg-cftit-01
24454 , author = PalmerC #and# SiganosG #and# FaloutsosM #and# FaloutsosC #and# GibbonsP
24455 , title = {{The connectivity and fault-tolerance of the {Internet} topology}}
24456 , booktitle = {{Workshop on Network-Related Data Management (NRDM 2001)}}
24460 @Article{psw-segcr-96
24461 , author = PittelB #and# SpencerJ #and# WormaldNC
24462 , title = {{Sudden Emergence of a Giant $k$-Core in a Random Graph}}
24463 , journal = j-jcombthb
24466 , pages = {111--151}
24467 , url = "http://dx.doi.org/10.1006/jctb.1996.0036"
24472 @InProceedings{pswz-ecspa-04
24473 , author = PyrgaE #and# SchulzF #and# WagnerD #and# ZaroliagisC
24474 , title = {{Experimental Comparison of Shortest Path Approaches for Timetable
\r
24476 , booktitle = {{Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04)}}
24478 , pdf = "http://i11www.ira.uka.de/algo/people/fschulz/publications/pdf/pswz-ecspa-04.pdf"
24479 , publisher = pub-siam
24483 @Article{pswz-emtip-08
24484 , author = PyrgaE #and# SchulzF #and# WagnerD #and# ZaroliagisC
24485 , title = {{Efficient Models for Timetable Information in Public Transportation Systems}}
24486 , journal = j-acm-ea
24493 @InProceedings{pswz-trmtt-04
24494 , author = PyrgaE #and# SchulzF #and# WagnerD #and# ZaroliagisC
24495 , title = {{Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach}}
24496 , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}}
24497 , pages = {85--103}
24498 , series = ser-entcs
24503 @Article{pt-aaeod-98
24504 , author = PapakostasA #and# TollisIG
24505 , title = {{Algorithms for Area-Efficient Orthogonal Drawings}}
24508 , pages = {83--110}
24514 , author = PapamanthouC #and# TollisIG
24515 , title = {{Applications of Parameterized $st$-Orientations}}
24518 , pages = {337--365}
24523 @InProceedings{pt-apogd-06
24524 , author = PapamanthouC #and# TollisIG
24525 , title = {{Applications of Parameterized $st$-Orientations in Graph Drawing Algorithms}}
24526 , booktitle = {{Proceedings of the 13th International Symposium on Graph Drawing (GD'05)}}
24528 , pages = {355--367}
24529 , publisher = pub-springer
24530 , series = ser-springer_lncs
24535 @Unpublished{pt-cnrgrp-01
24536 , author = PoenitzA #and# TittmannP
24537 , title = {{Computing Network Reliability in Graphs of Restricted Pathwidth}}
24538 , note = {http://www.peter.htwm.de/publications/Reliability.ps}
24542 @article{pt-tpra-87
24543 , author = PaigeR #and# TarjanRE
24544 , title = {{Three Partition Refinement Algorithms}}
24545 , journal = j-sicomp
24547 , pages = {973--983}
24554 , title = {{\url{http://www.ptv.de}}}
24559 , author = PressWH #and# TeukolskySA #and# VetterlingWT #and# FlanneryBP
24560 , title = {{Numerical Recipes in C}}
24561 , publisher = pub-cup
24562 , url = "http://www.library.cornell.edu/nr/bookcpdf.html"
24566 @article{pu-mnsisssf-59
24567 , author = PaullMC #and# UngerSH
24568 , title = {{Minimizing the number of states in incompletely specified sequential switching functions}}
24569 , journal = j-ire-tec
24570 , pages = {356--367}
24576 , title = {{Geoinformation und Mobilit{\"a}t - von der Forschung zur praktischen Anwendung}}
24577 , booktitle = {{Geoinformation und Mobilit{\"a}t - von der Forschung zur praktischen Anwendung}}
24578 , publisher = pub-igi
24583 @incollection{pv-eisfn-02
24584 , author = PastorSatorrasR #and# VespignaniA
24585 , title = {{Epidemics and Immunization in Scale-Free Networks}}
24586 , booktitle = {{Handbook of Graphs and Networks: From the Genome to the Internet}}
24587 , publisher = pub-wiley-vch
24588 , url = "http://dx.doi.org/10.1002/3527602755.fmatter"
24593 , author = PastorSatorrasR #and# VespignaniA
24594 , title = {{Evolution and Structure of the Internet: A Statistical Physics Approach}}
24595 , publisher = pub-cup
24599 @Article{pvv-dcpi-01
24600 , author = PastorSatorrasR #and# VazquezA #and# VespignaniA
24601 , title = {{Dynamical and Correlation Properties of the Internet}}
24604 , pdf = "http://prola.aps.org/pdf/PRL/v87/i25/e258701"
24605 , url = "http://prola.aps.org/abstract/PRL/v87/i25/e258701"
24610 @article{pw-lmlrs-99
24611 , author = PattisonP #and# WassermanS
24612 , title = {{Logit Models and Logistic Regressions for Social Networks: {II.~Multivariate} Relations}}
24613 , journal = j-bjmsp
24614 , pages = {169--193}
24619 @inproceedings{pw-olbnf-93
24620 , author = PhillipsS #and# WestbrookJ
24621 , title = {{Online Load Balancing and Network Flow}}
24622 , booktitle = {{Proceedings of the 25th Annual {ACM} Symposium on the Theory of Computing (STOC'93)}}
24624 , pages = {402--411}
24628 @article{pw-olbnf-98
24629 , author = PhillipsS #and# WestbrookJ
24630 , title = {{On-Line Load Balancing and Network Flow}}
24634 , pages = {245--261}
24640 , editor = PanY #and# XiaoY
24641 , title = {{Ad Hoc and Sensor Networks}}
24642 , booktitle = {{Ad Hoc and Sensor Networks}}
24643 , publisher = pub-nsp
24644 , series = ser-wnmc
24650 , author = PardalosPM #and# XueJ
24651 , title = {{The Maximum Clique Problem}}
24653 , pages = {301--328}
24658 @InProceedings{py-o-88
24659 , author = PapadimitriouCH #and# YannakakisM
24660 , title = {{Optimization, approximation, and complexity classes}}
24661 , booktitle = {{Proceedings of the 20th Annual {ACM} Symposium on the Theory of Computing (STOC'88)}}
24662 , pages = {229--234}
24663 , publisher = pub-acm
24667 @InProceedings{pzmt-qpsnd-03
24668 , author = PapadiasD #and# ZhangA #and# MamoulisN #and# TaoY
24669 , title = {{Query Processing in Spatial Network Databases}}
24670 , booktitle = {{Proceedings of the 29th International Conference on Very Large Databases (VLDB 2003)}}
24671 , pages = {802--813}
24675 %% --------------------------------------------------------------
24677 @InProceedings{qe-fgdcv-01
24678 , author = QuigleyA #and# EadesP
24679 , title = {{FADE: Graph Drawing, Clustering, and Visual Abstraction
\r
24681 , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}}
24683 , pages = {197--210}
24684 , pdf = "http://www.springerlink.com/content/mlbkplfwx7cmk4hf/fulltext.pdf"
24685 , publisher = pub-springer
24686 , series = ser-springer_lncs
24687 , url = "http://www.springerlink.com/content/mlbkplfwx7cmk4hf/"
24692 %% --------------------------------------------------------------
24695 , author = RuspiniEH
24696 , title = {{A new approach to clustering}}
24700 , url = "dx.doi.org/10.1016/S0019-9958(69)90591-9"
24706 , author = RobsonJM
24707 , title = {{Algorithms for Maximum Independent Sets}}
24710 , pages = {425--440}
24715 @Article{r-anmdg-87
24717 , title = {{A New Method for Drawing a Graph Given the Cyclic Order of the Edges at Each Vertex}}
24718 , journal = j-congr-num
24724 @phdthesis{r-crcs-74
24725 , author = RosenthalA
24726 , title = {{Computing Reliability of Complex Systems}}
24727 , school = "University of California"
24731 @InProceedings{r-dvoob-93
24733 , title = {{Dynamic Variable Ordering for Ordered Binary Decision Diagrams}}
24734 , booktitle = {{Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design}}
24736 , publisher = pub-ics
24742 , title = {{Eigenvector-centrality -- a node-centrality?}}
24744 , pages = {357--365}
24751 , title = {{Introduction to Probability Models}}
24753 , publisher = pub-ap
24758 , author = RijsbergenCJ
24759 , title = {{Information Retrieval}}
24760 , booktitle = {{Information Retrieval}}
24761 , publisher = pub-bh
24767 , title = {{Mathematical Statistics and Data Analysis}}
24769 , publisher = pub-dp
24773 @InCollection{r-obcg-69
24774 , author = RobertsFS
24775 , title = {{On the Boxicity and Cubicity of a Graph}}
24776 , booktitle = {{Recent Progresses in Combinatorics}}
24777 , pages = {301--310}
24778 , publisher = pub-ap
24782 @Article{r-ocecm-71
24784 , title = {{Objective Criteria for the Evaluation of Clustering Methods}}
24788 , pages = {846--850}
24789 , pdf = "http://www.jstor.org/stable/pdfplus/2284239.pdf"
24790 , url = "http://www.jstor.org/stable/2284239?origin=crossref"
24795 @InProceedings{r-ohdcm-08
24797 , title = {{Optimal Hierarchical Decompositions for Congestion Minimization in Networks}}
24798 , booktitle = {{Proceedings of the 40th Annual {ACM} Symposium on the Theory of Computing (STOC'08)}}
24799 , pages = {255--263}
24800 , publisher = pub-acm
24804 @article{r-rrssspp-97
24806 , title = {{Recent results on the single-source shortest paths problem}}
24807 , journal = j-sigact-news
24814 @InCollection{r-sa-08
24815 , author = RossmanithP
24816 , title = {{Simulated Annealing}}
24817 , booktitle = {{Taschenbuch der Algorithmen}}
24818 , pages = {423--431}
24819 , publisher = pub-springer
24820 , url = "http://www-i1.informatik.rwth-aachen.de/~algorithmus/"
24824 @mastersthesis{r-sbm-07
24826 , title = {{Schnelle Berechnung von gro\ss{}en Matchings}}
24828 , pdf = "http://i11www.ira.uka.de/extra/publications/r-sbm-07.pdf"
24829 , school = "Fakult{\"a}t f{\"u}r Informatik, Universit{\"a}t Karlsruhe"
24833 @InProceedings{r-scdpg-05
24835 , title = {{Strictly Convex Drawings of Planar Graphs}}
24836 , booktitle = {{Proceedings of the 16th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'05)}}
24837 , pages = {728--734}
24838 , publisher = pub-siam
24842 @article{r-tadgc-87
24844 , title = {{A Topological Approach to Dynamic Graph Connectivity}}
24853 @InCollection{r-tmfpm-12
24855 , title = {{The Many Faces of Planarity -- Matching, Augmentation, and Embedding Algorithms for Planar Graphs --}}
24856 , booktitle = {{Ausgezeichnete Informatikdissertationen 2011}}
24857 , pages = {161--170}
24858 , pdf = "http://i11www.ira.uka.de/extra/publications/r-tmfpm-12.pdf"
24864 @phdthesis{r-tmp-11
24866 , title = {{The Many Faces of Planarity -- Matching, Augmentation, and Embedding Algorithms for Planar Graphs --}}
24868 , pdf = "http://i11www.ira.uka.de/extra/publications/r-tmp-11.pdf"
24869 , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie (KIT)"
24870 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000024304"
24874 @Article{r-ttmpb-93
24876 , title = {{Two Trees in Maximal Planar Bipartite Graphs}}
24878 , pages = {755--758}
24883 @article{r-vdped-87
24884 , author = WhittyRW
24885 , title = {{Vertex-Disjoint Paths and Edge-Disjoint Branchings in Directed Graphs}}
24888 , pages = {349--358}
24894 , editor = RokneJ #and# AlhajjR
24895 , title = {{Encyclopedia of Social Network Analysis and Mining}}
24896 , booktitle = {{Encyclopedia of Social Network Analysis and Mining}}
24897 , publisher = pub-springer
24901 @Article{rb-dfcsc-04
24902 , author = ReichardtJ #and# BornholdtS
24903 , title = {{Detecting Fuzzy Community Structures in Complex Networks with a Potts Model}}
24908 , url = "http://link.aps.org/doi/10.1103/PhysRevLett.93.218701"
24913 @Article{rb-smcd-06
24914 , author = ReichardtJ #and# BornholdtS
24915 , title = {{Statistical Mechanics of Community Detection}}
24919 , pdf = "http://www.itp.uni-bremen.de/complex/pre016110.pdf"
24925 , author = ReadRC #and# CorneilDG
24926 , title = {{The Graph Isomorphism Disease}}
24928 , pages = {339--363}
24933 @Article{rcnsdc-kfbdp-13
24934 , author = Roshany-YamchiS #and# CychowskiM #and# NegenbornR #and# SchutterBD #and# DelaneyK #and# ConnellJ
24935 , title = {{Kalman Filter-Based Distributed Predictive Control of Large-Scale Multi-Rate Systems: Application to Power Networks}}
24936 , journal = j-ieeetcst
24944 @Article{rg-sabg-77
24945 , author = RosenthalAr #and# GoldnerA
24946 , title = {{Smallest Augmentations to Biconnect a Graph}}
24947 , journal = j-sicomp
24955 @article{rgw-rcgsm-02
24956 , author = RaymondJW #and# GardinerEJ #and# WilletP
24957 , title = {{{RASCAL}: {Calculation} of Graph Similarity using Maximum Common Edge Subgraphs}}
24960 , pages = {631--644}
24965 @InProceedings{rhks-taocs-02
24966 , author = RatnasamyS #and# HandleyM #and# KarpRM #and# ShenkerSJ
24967 , title = {{Topologically-Aware Overlay Construction and Server Selection}}
24968 , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
24969 , pages = {1190--1199}
24970 , pdf = "http://ieeexplore.ieee.org/iel5/7943/21923/01019369.pdf"
24971 , publisher = pub-ieeecs
24972 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1019369"
24977 @Article{rls-otnre-97
24978 , author = RingelG #and# LladoA #and# SerraO
24979 , title = {{On the Tree Number of REgular Graphs}}
24981 , pages = {587--595}
24982 , volume = {165--166}
24986 @Article{rm-pmrh-88
24987 , author = ReggianiMG #and# MarchettiFE
24988 , title = {{A Proposed Method for Representing Hierarchies}}
24989 , journal = j-ieeetsmc
24991 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=87050"
24997 , author = RottaR #and# NoackA
24998 , title = {{Multilevel local search algorithms for modularity clustering}}
24999 , journal = j-acm-ea
25001 , pages = {2.3:2.1--2.3:2.27}
25002 , url = "http://doi.acm.org/10.1145/1963190.1970376"
25008 , author = RobinsG #and# PattisonPip #and# KalishY #and# LusherD
25009 , title = {{An introduction to exponential random graph (p*) models for social networks}}
25012 , pages = {173--191}
25013 , url = "http://www.sciencedirect.com/science/article/pii/S0378873306000372"
25018 @article{rpw-lmlrs-99
25019 , author = RobinsG #and# PattisonP #and# WassermanS
25020 , title = {{Logit Models and Logistic Regressions for Social Networks: {III.~Valued} Relations}}
25022 , pages = {371--394}
25027 @Article{rr-aiags-96
25028 , author = RepsT #and# RamalingamG
25029 , title = {{An Incremental Algorithm for a Generalization of the Shortest-Path Problem}}
25033 , pages = {267--305}
25039 , author = RamalingamG #and# RepsT
25040 , title = {{On the computational complexity of dynamic graph problems}}
25044 , pages = {233--277}
25049 @Article{rs-fadp-59
25050 , author = RabinMO #and# ScottD
25051 , title = {{Finite Automata and their Decision Problems}}
25053 , pages = {114--125}
25058 @techreport{rs-npc2ra-97
25059 , author = RobertsFS #and# ShengL
25060 , title = {{{$\mathcal{NP}$}-Completeness for 2-Role Assignability}}
25061 , institution = "Rutgers Center for Operation Research"
25063 , type = {Technical Report}
25067 @InProceedings{rt-basaa-12
25068 , author = RiceM #and# TsotrasV
25069 , title = {{Bidirectional A$^*$ Search with Additive Approximation Bounds}}
25070 , booktitle = {{Proceedings of the 5th International Symposium on Combinatorial Search (SoCS'12)}}
25071 , publisher = pub-aaaip
25075 @InProceedings{rt-egsag-12
25076 , author = RiceJA #and# TsotrasV
25077 , title = {{Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems}}
25078 , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}}
25079 , pages = {344--355}
25080 , publisher = pub-springer
25081 , series = ser-springer_lncs
25086 @InProceedings{rt-girns-11
25087 , author = RiceM #and# TsotrasV
25088 , title = {{Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions}}
25089 , booktitle = {{Proceedings of the 37th International Conference on Very Large Databases (VLDB 2011)}}
25091 , pdf = "dl.acm.org/ft_gateway.cfm?id=1921074&type=pdf"
25095 @InProceedings{rt-gsagt-12
25096 , author = RiceM #and# TsotrasV
25097 , title = {{Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems}}
25098 , booktitle = {{Proceedings of the 11th International Symposium on Experimental Algorithms (SEA'12)}}
25099 , pages = {344--355}
25100 , publisher = pub-springer
25101 , series = ser-springer_lncs
25106 @Article{rt-rplbo-86
25107 , author = RosenstiehlP #and# TarjanRE
25108 , title = {{Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs}}
25111 , pages = {343--353}
25117 , author = ReingoldEM #and# TilfordJS
25118 , title = {{Tidier Drawings of Trees}}
25119 , journal = j-ieeetse
25121 , pages = {223--227}
25126 @techreport{rtygse-cntat-00
25127 , author = RadoslavovP #and# TangmunarunkitH #and# YuH #and# GovindanR #and# ShenkerSJ #and# EstrinD
25128 , title = {{On Characterizing Network Topologies and Analyzing Their Impact on Protocol Design}}
25129 , institution = "Computer Science Department, University of Southern California"
25131 , number = {00-731}
25132 , type = {Technical Report}
25133 , url = "ftp://ftp.usc.edu/pub/csinfo/tech-reports/papers/00-731.ps.Z"
25137 @Article{rup-sepsc-12
25138 , author = RakpenthaiC #and# UatrongjitS #and# PremrudeepreechacharnS
25139 , title = {{State Estimation of Power System Considering Network Parameter Uncertainty Based on Parametric Interval Linear Systems}}
25140 , journal = j-ieeetps
25143 , pages = {305--313}
25148 @InProceedings{rw-acpgg-08
25149 , author = RutterI #and# WolffA
25150 , title = {{Augmenting the connectivity of planar and geometric graphs}}
25151 , booktitle = {{Proceedings of the 24th European Workshop on Computational Geometry (EuroCG'08)}}
25153 , pdf = "http://i11www.ira.uka.de/extra/publications/rw-acpgg-08.pdf"
25157 @Article{rw-acpgg-12
25158 , author = RutterI #and# WolffA
25159 , title = {{Augmenting the Connectivity of Planar and Geometric Graphs}}
25162 , pages = {599--628}
25163 , url = "http://dx.doi.org/10.7155/jgaa.00275"
25168 @Article{rw-acpgg-endm08
25169 , author = RutterI #and# WolffA
25170 , title = {{Augmenting the Connectivity of Planar and Geometric Graphs}}
25171 , journal = j-endima
25173 , url = "http://dx.doi.org/10.1016/j.endm.2008.06.009"
25178 @InProceedings{rw-acpgg-tggt08
25179 , author = RutterI #and# WolffA
25180 , title = {{Augmenting the connectivity of planar and geometric graphs}}
25181 , booktitle = {{Topological & Geometric Graph Theory (TGGT'08)}}
25183 , pdf = "http://i11www.ira.uka.de/extra/publications/rw-acpgg-tggt08.pdf"
25187 @techreport{rw-acpgg-tr08
25188 , author = RutterI #and# WolffA
25189 , title = {{Augmenting the Connectivity of Planar and Geometric Graphs}}
25190 , institution = iti_wagner
25191 , number = {2008-3}
25192 , pdf = "http://i11www.ira.uka.de/extra/publications/rw-acpgg-tr08.pdf"
25196 @Article{rw-afsls-07
25197 , author = ResendeM #and# WerneckR
25198 , title = {{A Fast Swap-based Local Search Procedure for Location Problems}}
25200 , pages = {205--230}
25205 @InProceedings{rw-clmf-08
25206 , author = RutterI #and# WolffA
25207 , title = {{Computing Large Matchings Fast}}
25208 , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}}
25209 , pages = {183--192}
25210 , pdf = "http://i11www.ira.uka.de/extra/publications/rw-clmf-08.pdf"
25214 @Article{rw-clmf-10
25215 , author = RutterI #and# WolffA
25216 , title = {{Computing Large Matchings Fast}}
25217 , journal = j-acmta
25223 @techreport{rw-clmf-tr07
25224 , author = RutterI #and# WolffA
25225 , title = {{Computing large matchings fast}}
25226 , institution = iti_wagner
25227 , number = {2007-19}
25228 , pdf = "http://i11www.ira.uka.de/extra/publications/rw-c-07.pdf"
25229 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007350"
25233 @article{rw-ptpng-95
25234 , author = RendlF #and# WolkowiczH
25235 , title = {{A Projection Technique for Partitioning the Nodes of a Graph}}
25237 , pages = {155--180}
25242 @Article{rww-ladtp-96
25243 , author = RipphausenLipaH #and# WagnerD #and# WeiheK
25244 , title = {{Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs}}
25245 , journal = j-ijfcs
25247 , pages = {95--110}
25252 @InProceedings{rww-ltadt-93
25253 , author = RipphausenLipaH #and# WagnerD #and# WeiheK
25254 , title = {{Linear time algorithms for disjoint two-face paths problem in planar graphs}}
25255 , booktitle = {{Proceedings of the 4th International Symposium on Algorithms and Computation (ISAAC'93)}}
25256 , pages = {343--352}
25257 , publisher = pub-springer
25258 , series = ser-springer_lncs
25263 @InCollection{rww-seadp-95
25264 , author = RipphausenLipaH #and# WagnerD #and# WeiheK
25265 , title = {{Survey on Efficient Algorithms for Disjoint Paths Problems in Planar Graphs}}
25266 , booktitle = {{DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, Volume 20 on the ``Year of Combinatorial Optimization''}}
25267 , pages = {295--354}
25268 , publisher = pub-ams
25272 @techreport{rww-vdmpp-92
25273 , author = RipphausenLipaH #and# WagnerD #and# WeiheK
25274 , title = {{The Vertex-Disjoint Menger Problem in Planar Graphs}}
25275 , institution = "Fachbereich Mathematik, Technische Universit{\"a}t Berlin"
25280 @InProceedings{rww-vdmpp-93
25281 , author = RipphausenLipaH #and# WagnerD #and# WeiheK
25282 , title = {{The vertex-disjoint Menger-problem in planar graphs}}
25283 , booktitle = {{Proceedings of the 4th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'93)}}
25284 , pages = {112--119}
25288 @Article{rww-vmppg-97
25289 , author = RipphausenLipaH #and# WagnerD #and# WeiheK
25290 , title = {{The vertex-disjoint Menger problem in planar graphs}}
25291 , journal = j-sicomp
25293 , pages = {331--349}
25298 @inproceedings{rz-dspp-04
25299 , author = RodittyL #and# ZwickU
25300 , title = {{On Dynamic Shortest Paths Problems}}
25301 , booktitle = {{Proceedings of the 12th Annual European Symposium on Algorithms (ESA'04)}}
25302 , pages = {580--591}
25303 , series = ser-springer_lncs
25308 @InProceedings{rz-rpssp-05
25309 , author = RodittyL #and# ZwickU
25310 , title = {{Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs}}
25311 , booktitle = {{Proceedings of the 32nd International Colloquium on Automata, Languages, and Programming (ICALP'05)}}
25312 , pages = {249--260}
25313 , publisher = pub-springer
25314 , series = ser-springer_lncs
25319 %% --------------------------------------------------------------
25322 , author = SchoebelA
25323 , title = {{A model for the delay management problem based on mixed-integer programming}}
25324 , journal = j-entcs
25332 , author = ScutellaMG
25333 , title = {{A note on the parametric maximum flow problem and some related reoptimization issues}}
25337 , pages = {231--244}
25342 @phdthesis{s-aatbn-07
25344 , title = {{Algorithmic Aspects of Triangle-Based Network Analysis}}
25345 , pdf = "http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/4541"
25347 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007159"
25351 @Article{s-acbsp-00
25352 , author = SkriverAJ
25353 , title = {{A Classification of Bricriterion Shortest Path (BSP) Algorithms}}
25354 , journal = j-apjor
25355 , pages = {199--212}
25360 @article{s-aceum-95
25362 , title = {{An Arnoldi code for computing selected eigenvalues of sparse real unsymmetric matrices}}
25363 , journal = j-acm-tms
25364 , pages = {423--475}
25369 @InCollection{s-aeaad-09
25370 , author = SandersP
25371 , title = {{Algorithm Engineering -- An Attempt at a Definition}}
25372 , booktitle = {{Efficient Algorithms}}
25373 , pages = {321--340}
25374 , pdf = "http://algo2.iti.kit.edu/documents/definition.pdf"
25375 , publisher = pub-springer
25376 , series = ser-springer_lncs
25377 , url = "http://dx.doi.org/10.1007/978-3-642-03456-5_22"
25384 , title = {{A Field Guide to Digital Color}}
25385 , booktitle = {{A Field Guide to Digital Color}}
25386 , publisher = pub-akpl
25387 , series = ser-ams_cbms
25392 , author = ShannonCE
25393 , title = {{A Mathematical Theory of Communication}}
25394 , journal = j-acm-mccr
25402 @Article{s-anisg-82
25403 , author = SchreiberR
25404 , title = {{A New Implementation of Sparse Gaussian Elimination}}
25405 , journal = j-acm-tms
25408 , pages = {256--276}
25414 , author = SinclairA
25415 , title = {{Algorithms for Random Generation and Counting: A Markov Chain Approach}}
25416 , publisher = pub-birk
25420 @InProceedings{s-aspg-09
25422 , title = {{Approximating Shortest Paths in Graphs}}
25423 , booktitle = {{Proceedings of the 3rd Workshop on Algorithms and Computation (WALCOM'09)}}
25426 , publisher = pub-springer
25427 , series = ser-springer_lncs
25432 @phdthesis{s-avn-13
25433 , author = StorandtS
25434 , title = {{Algorithms for vehicle navigation}}
25436 , school = "Universit{\"a}t Stuttgart"
25437 , url = "http://elib.uni-stuttgart.de/opus/volltexte/2013/8112"
25441 @article{s-becun-79
25442 , author = SchnorrCP
25443 , title = {{Bottlenecks and edge connectivity in unsymmetrical networks}}
25444 , journal = j-sicomp
25447 , pages = {265--274}
25452 @techreport{s-bteaj-07
25453 , author = SonntagG
25454 , title = {{Bonner Thesen - Ein Aktionsplan der Jungen Informatik}}
25455 , institution = "Deutsche Forschungsgemeinschaft"
25456 , pdf = "http://www.bonner-thesen.de/Bonner-Thesen.pdf"
25460 @Article{s-cgpcm-94
25462 , title = {{Coin Graphs, Polyhedra, and Conformal Mapping}}
25464 , pages = {133--138}
25470 , author = ScheinermanER
25471 , title = {{Characterizing Intersection Classes of Graphs}}
25475 , pages = {185--193}
25481 , author = SabidussiG
25482 , title = {{The Centrality Index of a Graph}}
25484 , pages = {581--603}
25489 @article{s-clsdn-80
25490 , author = SeidmanSB
25491 , title = {{Clique-like structures in directed networks}}
25500 , title = {{Convex Maps}}
25503 , pages = {464--466}
25509 , author = SchrijverA
25510 , title = {{Combinatorial Optimization: Polyhedra and Efficiency}}
25511 , publisher = pub-springer
25515 @InCollection{s-cpadc-96
25516 , author = ShmoysDB
25517 , title = {{Cut Problems and their Application to Divide-and-Conquer}}
25518 , booktitle = {{Approximation Algorithms for NP-hard Problems}}
25519 , pages = {192--235}
25520 , publisher = pub-cti
25521 , url = "http://www.orie.cornell.edu/~shmoys/multicut.ps"
25525 @techreport{s-cppac-07
25526 , author = SchrammO
25527 , title = {{Combinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps}}
25528 , institution = "Princeton University"
25529 , note = {Modiefied version of Ph. D. thesis, Princeton University, 1990}
25530 , url = "http://arxiv.org/abs/0709.0710v1"
25534 @InProceedings{s-cscc-10
25535 , author = SchmidtJM
25536 , title = {{Construction Sequences and Certifying 3-Connectedness}}
25537 , booktitle = {{Proceedings of the 27nd International Symposium on Theoretical Aspects of Computer Science (STACS'10)}}
25538 , pages = {633--644}
25539 , publisher = pub-springer
25540 , series = ser-springer_lncs
25545 , author = SchmochU
25546 , title = {{Concept of a Technology Classification for Country Comparisons}}
25548 , note = {Final Report to the World Intellectual Property Organisation (WIPO)}
25549 , pdf = "http://www.wipo.int/export/sites/www/ipstats/en/statistics/patents/pdf/wipo_ipc_technology.pdf"
25550 , url = "http://www.wipo.int/ipstats/en/"
25556 , title = {{Design and Experimental Evaluation of a Local Graph Clustering Algorithm}}
25557 , institution = uni_ka
25559 , note = {Student Project, Studienarbeit}
25560 , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/studienarbeit-schulz-08.pdf"
25561 , school = "Department of Informatics"
25562 , url = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/finished"
25566 @phdthesis{s-dmptc-10
25567 , author = SchachtebeckM
25568 , title = {{Delay Management in Public Transportation: Capacities, Robustness, and Integration}}
25569 , pdf = "http://webdoc.sub.gwdg.de/diss/2010/schachtebeck/schachtebeck.pdf"
25570 , school = "Georg-August-Universit{\"a}t G{\"o}ttingen"
25574 @mastersthesis{s-drsrt-12
25575 , author = StrasserB
25576 , title = {{Delay-Robust Stochastic Routing in Timetable Networks}}
25577 , institution = "Karlsruhe Institute of Technology"
25579 , pdf = "http://i11www.ira.uka.de/extra/publications/s-drsrt-12.pdf"
25585 , title = {{Diskrete Strukturen Band 1. Kombinatorik, Graphentheorie, Algebra}}
25586 , booktitle = {{Diskrete Strukturen Band 1. Kombinatorik, Graphentheorie, Algebra}}
25587 , publisher = pub-springer
25593 , title = {{Elektroenergiesysteme}}
25594 , booktitle = {{Elektroenergiesysteme}}
25595 , note = {3. Auflage, ISBN 3-540-29664-6}
25596 , publisher = pub-springer
25600 @incollection{s-ecrmb-77
25601 , author = SchwartzJE
25603 , title = {{An Examination of {CONCOR} and Related Methods for Blocking Sociometric Data}}
25604 , booktitle = {{Sociological Methodology 1977}}
25605 , pages = {255-282}
25606 , publisher = pub-jb
25612 , title = {{Experimental Evaluation of Dynamic Graph Clustering Algorithms}}
25613 , institution = iti_wagner
25615 , note = {Student Project, Studienarbeit}
25616 , pdf = "http://i11www.iti.uni-karlsruhe.de/_media/teaching/theses/studienarbeit-staudt-09.pdf"
25617 , url = "http://i11www.iti.uni-karlsruhe.de/projects/spp1307/dyneval"
25621 @InProceedings{s-epgg-90
25622 , author = SchnyderW
25623 , title = {{Embedding Planar Graphs on the Grid}}
25624 , booktitle = {{Proceedings of the 1st Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'90)}}
25626 , pages = {138--148}
25630 @Article{s-eupsc-91
25631 , author = SchrammO
25632 , title = {{Existence and Uniqueness of Packings with Specified Combinatorics}}
25636 , pages = {321--341}
25641 @article{s-famcdg-04
25643 , title = {{Finding All Maximal Cliques in Dynamic Graphs}}
25646 , pages = {173--186}
25652 , author = SchlafliL
25653 , title = {{Gesammelte mathematische Abhandlungen}}
25654 , booktitle = {{Gesammelte mathematische Abhandlungen}}
25655 , publisher = {Birkh{"a}user Verlag}
25661 , author = SchaefferSE
25662 , title = {{Graph Clustering}}
25667 , pdf = "http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B8JDG-4PBG1S7-1-1&_cdi=43614&_user=2149863&_"
25668 , url = "http://dx.doi.org/10.1016/j.cosrev.2007.05.001"
25674 , author = SchoeningU
25675 , title = {{Graph Isomorphism is in the Low Hierarchy}}
25677 , pages = {312--323}
25682 @mastersthesis{s-hasp-09
25684 , title = {{Heuristic Algorithms for the Shortcut Problem}}
25686 , pdf = "http://i11www.ira.uka.de/extra/publications/s-hasp-09.pdf"
25687 , school = "Karlsruhe Institute of Technology (KIT)"
25691 @InCollection{s-i-07
25692 , author = SchoebelA
25693 , title = {{Integer programming approaches for solving the delay management problem}}
25694 , booktitle = {{Algorithmic Methods for Railway Optimization}}
25695 , pages = {145--170}
25696 , publisher = pub-springer
25697 , series = ser-springer_lncs
25702 @article{s-iclssg-83
25703 , author = SeidmanSB
25704 , title = {{Internal Cohesion of {LS} Sets in Graphs}}
25708 , pages = {97--107}
25713 @phdthesis{s-icmip-84
25714 , author = ScheinermanER
25715 , title = {{Intersection Classes and Multiple Intersection Parameters of Graphs}}
25716 , school = "Princeton University"
25721 , author = StephensonK
25722 , title = {{Introduction to Circle Packing: The Theory of Discrete Analytic Functions}}
25723 , publisher = pub-cup
25727 @Article{s-imiwi-85
25728 , author = ScheinermanER
25729 , title = {{Irrepresentability by Multiple Intersection, or Why the Interval Number is Unbounded}}
25733 , pages = {195--211}
25738 @InProceedings{s-lbeag-01
25740 , title = {{Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows}}
25741 , booktitle = {{Proceedings of the 9th Annual European Symposium on Algorithms (ESA'01)}}
25742 , pages = {391--403}
25743 , series = ser-springer_lncs
25749 , author = SnijdersTAB
25750 , title = {{Markov Chain Monte Carlo Estimation of Exponential Random Graph Models}}
25754 , pdf = "www.cmu.edu/joss/content/articles/volume3/Snijders.pdf"
25760 , author = StadtentwicklungBf
25761 , title = {{{Mobilit{\"a}t in Deutschland 2008}}}
25762 , type = {Case Study}
25766 @techreport{s-mfa-78
25767 , author = ShiloachY
25768 , title = {{An {$\mathcal{O}(n\cdot I\log^2 I)$} Maximum-Flow Algorithm}}
25769 , institution = "Computer Science Department, Stanford University"
25771 , number = {STAN-CS-78}
25777 , title = {{Maximin Facility Location}}
25778 , journal = j-nationalb
25779 , pages = {107--115}
25785 , author = SeeleyJR
25786 , title = {{The Net of Reciprocal Influence}}
25789 , pages = {234--240}
25795 , author = SeidmanSB
25796 , title = {{Network Structure and Minimum Degree}}
25798 , pages = {269--287}
25804 , author = SchoebelA
25805 , title = {{Optimization in Public Transportation}}
25806 , booktitle = {{Optimization in Public Transportation}}
25807 , publisher = pub-springer
25808 , series = ser-soia
25814 , editor = SchrijverA
25815 , title = {{Packing and Covering in Combinatorics}}
25816 , booktitle = {{Packing and Covering in Combinatorics}}
25817 , publisher = pub-mc
25822 , author = SchrijverA
25823 , title = {{Paths and Flows---a Historical Survey}}
25824 , journal = j-cwi-qu
25827 , pages = {169--183}
25833 , author = SchnyderW
25834 , title = {{Planar Graphs and Poset Dimension}}
25835 , journal = j-order
25837 , pages = {323--343}
25843 , author = SteinitzE
25844 , title = {{Polyeder und Raumeinteilungen}}
25845 , booktitle = {{Polyeder und Raumeinteilungen}}
25846 , publisher = pub-t
25847 , series = "Encyklop{"a}die der "
25851 @InProceedings{s-q-12
25852 , author = StorandtS
25853 , title = {{Quick and energy-efficient routes: computing constrained shortest paths for electric vehicles}}
25854 , booktitle = {{Proceedings of the 5th ACM SIGSPATIAL International Workshop on Computational Transportation Science}}
25856 , publisher = pub-acm
25857 , url = "http://dx.doi.org/10.1145/2442942.2442947"
25862 , author = SantosJL
25863 , title = {{Real-world applications of shortest path algorithms}}
25864 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
25865 , publisher = pub-ams
25866 , series = ser-dimacsb
25871 @phdthesis{s-rapln-06
25872 , author = SchillingH
25873 , title = {{Route Assignment Problems in Large Networks}}
25874 , school = "Technische Universit{\"a}t Berlin"
25878 @InProceedings{s-rpbec-12
25879 , author = StorandtS
25880 , title = {{Route Planning for Bicycles -- Exact Constrained Shortest Paths Made Practical Via Contraction Hierarchy
\r
25882 , booktitle = {{Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling}}
25883 , pages = {234--242}
25887 @phdthesis{s-rprn-08
25888 , author = SchultesD
25889 , title = {{Route Planning in Road Networks}}
25891 , note = {\url{http://algo2.iti.uka.de/schultes/hwy/schultes_diss.pdf}}
25892 , pdf = "http://algo2.iti.uni-karlsruhe.de/schultes/hwy/schultes_diss.pdf"
25897 @mastersthesis{s-rprnt-11
25899 , title = {{Route Planning in Road Networks with Turn Costs and Multi Edge Restrictions}}
25901 , school = "Karlsruhe Institute of Technology"
25902 , type = {Diploma Thesis}
25906 @article{s-scaadfa-81
25908 , title = {{A Strong-Connectivity Algorithm and its Applications in Data Flow Analysis}}
25916 @phdthesis{s-sccg-11
25917 , author = SchmidtJM
25918 , title = {{Structure and Constructions of 3-Connected Graphs}}
25920 , school = "Fachbereich Mathematik und Informatik, Freie Universit{\"a}t Berlin"
25924 @mastersthesis{s-scsut-08
25925 , author = SchieferdeckerD
25926 , title = {{Systematic Combination of Speed-Up Techniques for exact Shortest-Path Queries}}
25928 , pdf = "http://i11www.iti.uni-karlsruhe.de/teaching/theses/files/da-schief-08.pdf"
25933 @article{s-semdca-78
25934 , author = SailerLD
25935 , title = {{Structural Equivalence: Meaning and Definition, Computation and Application}}
25943 , author = ShimbelA
25944 , title = {{Structural Parameters of Communication Networks}}
25946 , pages = {501--507}
25953 , title = {{Shortest-Path Queries in Static Networks}}
25954 , note = {submitted. Preprint available at \url{http://www.sommer.jp/spq-survey.htm}}
25955 , pdf = "http://www.sommer.jp/spq-survey.pdf"
25956 , url = "http://www.sommer.jp/spq-survey.htm"
25960 @Article{s-tinpg-83
25961 , author = ScheinermanER
25962 , title = {{The Interval Number of a Planar Graph: Three Intervals Suffice}}
25963 , journal = j-jcombthb
25966 , pages = {224--239}
25971 @phdthesis{s-tisp-05
25973 , title = {{Timetable Information and Shortest Paths}}
25975 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000002042"
25979 @InCollection{s-tk-50
25980 , author = SchlafliL
25981 , title = {{Theorie der vielfachen Kontinuit{\"a}t}}
25982 , booktitle = {{Gesammelte mathematische Abhandlungen}}
25983 , publisher = {Birkh{"a}user Verlag}
25989 , author = SchrijverA
25990 , title = {{Theory of linear and integer programming}}
25991 , publisher = pub-wiley
25996 , author = SloaneNJ
25997 , title = {{The On-Line Encyclopedia of Integer Sequences}}
25998 , note = {\url{www.research.att.com/~njas/sequences/}}
25999 , url = "www.research.att.com/~njas/sequences/"
26003 @Article{s-tsesn-01
26004 , author = SnijdersTAB
26005 , title = {{The Statistical Evaluation of Social Network Dynamics}}
26008 , pages = {361--395}
26009 , url = "http://onlinelibrary.wiley.com/doi/10.1111/0081-1750.00099/abstract"
26015 , author = SchillingH
26016 , title = {{TomTom Navigation - How mathematics help getting through traffic faster}}
26017 , note = {Talk given at ISMP}
26018 , url = "http://ismp2012.mathopt.org/show-abs?abs=1893"
26022 @InProceedings{sa-idrno-06
26023 , author = SeetharamanS #and# AmmarM
26024 , title = {{On the Interaction Between Dynamic Routing in Native and Overlay Layers}}
26025 , booktitle = {{Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
26028 , pdf = "http://ieeexplore.ieee.org/iel5/4146652/4146653/04146974.pdf"
26029 , publisher = pub-ieeecs
26030 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4146974"
26034 @inproceedings{sark-cihmv-02
26035 , author = SubramanianL #and# AgarwalS #and# RexfordJ #and# KatzRH
26036 , title = {{Characterizing the Internet Hierarchy from Multiple Vantage Points}}
26037 , booktitle = {{Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom)}}
26038 , pages = {618--627}
26039 , pdf = "http://www.ieee-infocom.org/2002/papers/594.pdf"
26040 , publisher = pub-ieeecs
26045 @InProceedings{sas-eqpsn-05
26046 , author = SankaranarayananJ #and# AlborziH #and# SametH
26047 , title = {{Efficient Query Processing on Spatial Networks}}
26048 , booktitle = {{Proceedings of the 13th Annual ACM International Workshop on Geographic Information Systems (GIS'05)}}
26049 , pages = {200--209}
26054 , author = SteiglitzK #and# BrunoJ
26055 , title = {{A new derivation of Frisch's algorithm for calculating vertex-pair connectivity}}
26059 , pages = {94--106}
26065 , author = StoerJ #and# BulirschR
26066 , title = {{Introduction to Numerical Analysis}}
26067 , publisher = pub-springer
26071 @InProceedings{sbb-s-12
26072 , author = SamaranayakeS #and# BlandinS #and# BayenA
26073 , title = {{Speedup Techniques for the Stochastic on-time Arrival Problem}}
26074 , booktitle = {{Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'12)}}
26076 , series = ser-oasioasi
26080 @Article{sc-emomg-08
26081 , author = SchuetzP #and# CaflischA
26082 , title = {{Efficient Modularity Optimization by Multistep Greedy Algorithm and Vertex Mover Refinement}}
26085 , url = "http://scitation.aip.org/getabs/servlet/GetabsServlet?prog=normal&id=PLEEE8000077000004046112000001&idtype=cvips&gifs=yes"
26090 @InProceedings{sf-cbpvn-12
26091 , author = StorandtS #and# FunkeS
26092 , title = {{Cruising with a Battery-Powered Vehicle and Not Getting Stranded}}
26093 , booktitle = {{Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence}}
26094 , pdf = "http://www.aaai.org/ocs/index.php/AAAI/AAAI12/paper/view/4794/5311"
26095 , publisher = pub-aaaip
26099 @InProceedings{sf-eemfl-13
26100 , author = StorandtS #and# FunkeS
26101 , title = {{Enabling E-Mobility: Facility Location for Battery Loading Stations}}
26102 , booktitle = {{Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence}}
26103 , publisher = pub-aaaip
26107 @article{sf-gtgcc-78
26108 , author = SeidmanSB #and# FosterBL
26109 , title = {{A graph-theoretic generalization of the clique concept}}
26111 , pages = {139--154}
26116 @article{sf-npgcfbam-78
26117 , author = SeidmanSB #and# FosterBL
26118 , title = {{A note on the potential for genuine cross-fertilization between anthropology and mathematics}}
26125 @InProceedings{sg-achla-10
26126 , author = SturtevantNR #and# GeisbergerR
26127 , title = {{A Comparison of High-Level Approaches for Speeding Up Pathfinding}}
26128 , booktitle = {{Proceedings of the 6th Artificial Intelligence for Interactive Digital Entertainment Conference (AIIDE'10)}}
26129 , publisher = pub-aaaip
26133 @unpublished{sg-cdcn-04
26134 , author = SinghB #and# GupteN
26135 , title = {{Congestion and Decongestion in a communication network}}
26136 , note = {arXiv cond-mat/0404353}
26137 , url = "http://arxiv.org/ps/cond-mat/0404353"
26141 @Article{sg-cekrf-03
26142 , author = StrehlA #and# GhoshJ
26143 , title = {{Cluster Ensembles - a Knowledge Reuse Framework For Combining Multiple Partitions}}
26145 , pages = {583--617}
26146 , url = "http://portal.acm.org/citation.cfm?id=944935"
26151 @Article{sg-pcap-76
26152 , author = SahniSK #and# GonzalezTF
26153 , title = {{P-Complete Approximation Problems
\r
26158 , pages = {555--565}
26163 @InProceedings{sgg-mspfs-02
26164 , author = SaroiuS #and# GummadiPK #and# GribbleSD
26165 , title = {{A Measurement Study of Peer-to-Peer File Sharing Systems}}
26166 , booktitle = {{Proceedings of SPIE/ACM Conference on Multimedia Computing and Networking (MMCN) 2002}}
26168 , pdf = "http://www.cs.toronto.edu/~stefan/publications/mmcn/2002/mmcn.pdf"
26173 , author = SchankT #and# GoerkeR #and# WagnerD
26174 , title = {{Static and Dynamic Visual Analysis of a Co-Author Network}}
26175 , note = {Graph Drawing Contest at GD'07, 2nd Prize}
26176 , pdf = "http://i11www.iti.uni-karlsruhe.de/people/schank/gd07cont/schank-gd07cont.pdf"
26177 , url = "http://i11www.iti.uni-karlsruhe.de/people/schank/gd07cont/"
26181 @Article{sh-scisg-91
26182 , author = SierksmaG #and# HoogeveenH
26183 , title = {{Seven Criteria for Integer Sequences being Graphic}}
26186 , pages = {223--231}
26187 , pdf = "http://www3.interscience.wiley.com/cgi-bin/fulltext/113389079/PDFSTART"
26188 , url = "http://dx.doi.org/10.1002/jgt.3190150209"
26193 @InProceedings{shg-desam-09
26194 , author = SatishN #and# HarrisM #and# GarlandM
26195 , title = {{Designing Efficient Sorting Algorithms for Manycore GPUs}}
26196 , booktitle = {{23rd International Parallel and Distributed Processing Symposium (IPDPS'09)}}
26198 , publisher = pub-ics
26202 @techreport{shlw-cslpp-03
26203 , author = SchoebelA #and# HamacherHW #and# LiebersA #and# WagnerD
26204 , title = {{The Continuous Stop Location Problem in Public Transportation Networks}}
26205 , institution = "Universit{\"a}t Konstanz"
26209 @Article{shlw-tcslp-09
26210 , author = SchoebelA #and# HamacherHW #and# LiebersA #and# WagnerD
26211 , title = {{The Continuous Stop Location Problem in Public Transportation Networks}}
26212 , journal = j-apjor
26221 , author = SweetingWJ #and# HutchinsonAR #and# SavageSD
26222 , title = {{Factors affecting electric vehicle energy consumption}}
26225 , pages = {192--201}
26226 , url = "http://dx.doi.org/10.1080/19397038.2011.592956"
26231 @InCollection{skk-gphps-03
26232 , author = SchloegelK #and# KarypisG #and# KumarV
26233 , title = {{Graph Partitioning for High-Performance Scientific Simulations}}
26234 , booktitle = {{Sourcebook of Parallel Computing}}
26235 , pages = {491--541}
26236 , publisher = pub-mk
26241 , author = SchloegelK #and# KarypisG #and# KumarG
26242 , title = {{Parallel static and dynamic multi-constraint graph partitioning}}
26245 , pages = {219--240}
26246 , pdf = "http://glaros.dtc.umn.edu/gkhome/fetch/papers/pmcCCPE02.pdf"
26251 @InProceedings{slah-eeore-11
26252 , author = SachenbacherM #and# LeuckerM #and# ArtmeierA #and# HaselmayrJ
26253 , title = {{Efficient Energy-Optimal Routing for Electric Vehicles}}
26254 , booktitle = {{Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence}}
26256 , publisher = pub-aaaip
26257 , url = "http://www.aaai.org/ocs/index.php/AAAI/AAAI11/paper/view/3735"
26262 , author = SiekJG #and# LeeL #and# LumsdaineA
26263 , title = {{The Boost Graph Library: User Guide and Reference Manual}}
26264 , booktitle = {{The Boost Graph Library: User Guide and Reference Manual}}
26265 , publisher = pub-aw
26269 @misc{slpf-ltais-03
26270 , author = SchmochU #and# LavilleF #and# PatelP #and# FrietschR
26271 , title = {{Linking Technology Areas to Industrial Sectors}}
26273 , note = {Final Report to the European Comission, DG Research}
26274 , pdf = "ftp://ftp.cordis.europa.eu/pub/indicators/docs/ind_report_isi_ost_spru.pdf"
26275 , url = "http://cordis.europa.eu/indicators/publications.htm"
26279 @Article{slzlc-t-03
26280 , author = SunS #and# LingL #and# ZhangN #and# LiG #and# ChenR
26281 , title = {{Topological structure analysis of the protein-protein interaction network in budding yeast}}
26284 , pages = {2443--2450}
26285 , pdf = "http://www.imb-jena.de/jcb/ppi/PPI_PDF_free/bu2003.pdf"
26286 , url = "http://nar.oxfordjournals.org/cgi/content/abstract/31/9/2443"
26292 , editor = ShannonCE #and# McCarthyJ
26293 , title = {{Automata Studies}}
26294 , booktitle = {{Automata Studies}}
26295 , publisher = pub-pup
26296 , series = ser-ann_math_stud
26300 @InProceedings{sm-dagcu-06
26301 , author = SahaB #and# MitraP
26302 , title = {{Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree}}
26303 , booktitle = {{Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops}}
26305 , pages = {667--671}
26306 , publisher = pub-ics
26307 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4063709"
26311 @InProceedings{sm-dagcu-07
26312 , author = SahaB #and# MitraP
26313 , title = {{Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree}}
26314 , booktitle = {{Proceedings of the 2007 SIAM International Conference on Data Mining}}
26315 , pages = {581--586}
26316 , pdf = "http://www.siam.org/proceedings/datamining/2007/dm07_065Saha.pdf"
26317 , publisher = pub-siam
26318 , url = "http://www.siam.org/proceedings/datamining/2007/dm07.php"
26322 @Article{sm-ncis-00
26323 , author = ShiJ #and# MalikJ
26324 , title = {{Normalized Cuts and Image Segmentation}}
26325 , journal = j-tpami
26327 , pages = {888--905}
26328 , pdf = "http://www.cs.virginia.edu/~gfx/Courses/2006/DataDriven/bib/matting/shi00.pdf"
26329 , url = "http://doi.ieeecs.org/10.1109/34.868688"
26334 @Article{smobwrasi-casei-3
26335 , author = ShannonP #and# MarkielA #and# OzierO #and# BaligaNS #and# WangJT #and# RamageD #and# AminN #and# SchwikowskiB #and# IdekerT
26336 , title = {{Cytoscape: A Software Environment for Integrated Models of Biomolecular Interaction Networks}}
26338 , pages = {2498--2504}
26339 , pdf = "http://genome.cshlp.org/cgi/reprint/13/11/2498.pdf"
26340 , url = "http://genome.cshlp.org/cgi/content/full/13/11/2498"
26345 @InProceedings{smsn-dlcha-06
26346 , author = SchaefferSE #and# MarinoniS #and# SarelaM #and# NikanderP
26347 , title = {{Dynamic Local Clustering for Hierarchical Ad Hoc Networks}}
26348 , booktitle = {{Proceedings of Sensor and Ad Hoc Communications and Networks, 2006. }}
26350 , pages = {667--672}
26351 , publisher = pub-ics
26352 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4068329"
26357 @article{sn-epsb-97
26358 , author = SnijdersTAB #and# NowickiK
26359 , title = {{Estimation and Prediction of Stochastic Blockmodels for Graphs with Latent Block Structure}}
26361 , pages = {75--100}
26368 , title = {{{SONIVIS} Tool Version 0.8}}
26369 , url = "http://www.sonivis.org/"
26373 @InProceedings{sp-p-01
26374 , author = SlijepcevicS #and# PotkonjakM
26375 , title = {{Power efficient organization of wireless sensor networks}}
26376 , booktitle = {{Proceedings of the IEEE International Conference on Communications 2001}}
26378 , pages = {472--476}
26382 @techreport{spb-fabp-97
26383 , author = ScottK #and# PabonJimenezG #and# BernsteinD
26384 , title = {{Finding Alternatives to the Best Path}}
26385 , note = {Presented at the 76th Annual Meeting of the Transportation Research Board}
26390 @Article{sr-cdtn-83
26391 , author = SupowitKJ #and# ReingoldEM
26392 , title = {{The Complexity of Drawing Trees Nicely}}
26393 , journal = j-acta-inf
26395 , pages = {377--392}
26401 , author = SearyAJ #and# RichardsWD
26402 , title = {{The Physics of Networks}}
26403 , url = "http://www.sfu.ca/~richards/Pdf-ZipFiles/physics.pdf"
26408 , author = SteinitzE #and# RademacherH
26409 , title = {{Vorlesungen {\"u}ber die Theorie der Polyeder}}
26410 , booktitle = {{Vorlesungen {\"u}ber die Theorie der Polyeder}}
26411 , publisher = pub-springer
26415 @InProceedings{srs-aodsp-08
26416 , author = ScheidelerC #and# RichaAW #and# SantiP
26417 , title = {{An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model}}
26418 , booktitle = {{Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC'08)}}
26419 , pages = {91--100}
26423 @article{ss-cmcs-99
26424 , author = SmartC #and# SlaterP
26425 , title = {{Center, Median and Centroid Subgraphs}}
26426 , journal = j-networks
26427 , pages = {303--311}
26432 @unpublished{ss-dcfp-79
26433 , author = SimFM #and# SchwartzMR
26434 , title = {{Does {CONCOR} Find Positions?}}
26435 , note = {Unpublished manuscript}
26439 @InProceedings{ss-degp-12
26440 , author = SandersP #and# SchulzC
26441 , title = {{Distributed Evolutionary Graph Partitioning}}
26442 , booktitle = {{Proceedings of the 14th Meeting on Algorithm Engineering and Experiments (ALENEX'12)}}
26444 , pdf = "http://siam.omnibooksonline.com/2012ALENEX/data/papers/014.pdf"
26445 , publisher = pub-siam
26449 @InProceedings{ss-dhnr-07
26450 , author = SchultesD #and# SandersP
26451 , title = {{Dynamic Highway-Node Routing}}
26452 , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}}
26455 , publisher = pub-springer
26456 , series = ser-springer_lncs
26461 @InProceedings{ss-efrpa-07
26462 , author = SandersP #and# SchultesD
26463 , title = {{Engineering Fast Route Planning Algorithms}}
26464 , booktitle = {{Proceedings of the 6th Workshop on Experimental Algorithms (WEA'07)}}
26467 , publisher = pub-springer
26468 , series = ser-springer_lncs
26473 @InProceedings{ss-ehh-06
26474 , author = SandersP #and# SchultesD
26475 , title = {{Engineering Highway Hierarchies}}
26476 , booktitle = {{Proceedings of the 14th Annual European Symposium on Algorithms (ESA'06)}}
26477 , pages = {804--816}
26478 , publisher = pub-springer
26479 , series = ser-springer_lncs
26484 @unpublished{ss-ehh-07
26485 , author = SandersP #and# SchultesD
26486 , title = {{Engineering Highway Hierarchies}}
26487 , note = {submitted for publication, preliminary version at \url{http://algo2.iti.uka.de/schultes/hwy/}}
26488 , url = "http://algo2.iti.uka.de/schultes/hwy/"
26493 , author = SandersP #and# SchultesD
26494 , title = {{Engineering Highway Hierarchies}}
26495 , journal = j-acm-ea
26502 @unpublished{ss-feosm-09
26503 , author = SandersP #and# SchieferdeckerD
26504 , title = {{Finding Energy-Optimal Schedules for Monitoring Sensor Networks}}
26508 @InProceedings{ss-hhhes-05
26509 , author = SandersP #and# SchultesD
26510 , title = {{Highway Hierarchies Hasten Exact Shortest Path Queries}}
26511 , booktitle = {{Proceedings of the 13th Annual European Symposium on Algorithms (ESA'05)}}
26512 , pages = {568--579}
26513 , publisher = pub-springer
26514 , series = ser-springer_lncs
26519 @techreport{ss-ltate-09
26520 , author = SchachtebeckM #and# SchoebelA
26521 , title = {{LinTim - A Toolbox for the Experimental Evaluation of the Interaction of Different Planning Stages in Public Transportation}}
26522 , institution = "ARRIVAL Project"
26528 , author = SneathPHA #and# SokalRR
26529 , title = {{Numerical Taxonomy: {The} Principles and Practice of Numerical Classification}}
26530 , publisher = pub-freeman
26534 @InProceedings{ss-racts-06
26535 , author = SandersP #and# SchultesD
26536 , title = {{Robust, Almost Constant Time Shortest-Path Queries in Road Networks}}
26537 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge -}}
26542 @InCollection{ss-racts-09
26543 , author = SandersP #and# SchultesD
26544 , title = {{Robust, Almost Constant Time Shortest-Path Queries in Road Networks}}
26545 , booktitle = {{The Shortest Path Problem: Ninth DIMACS Implementation Challenge}}
26546 , pages = {193--218}
26547 , publisher = pub-ams
26548 , series = ser-dimacsb
26554 , author = SankaranarayananJ #and# SametH
26555 , title = {{Roads Belong in Databases}}
26556 , journal = j-ieeedeb
26563 @Article{ss-tdmpd-10
26564 , author = SchachtebeckM #and# SchoebelA
26565 , title = {{To wait or not to wait and who goes first? Delay Management with Priority Decisions}}
26568 , pages = {307--321}
26573 @InProceedings{ss-tlagh-13
26574 , author = SandersP #and# SchulzC
26575 , title = {{Think Locally, Act Globally: Highly Balanced Graph Partitioning}}
26576 , booktitle = {{Proceedings of the 12th International Symposium on Experimental Algorithms (SEA'13)}}
26577 , pages = {164--175}
26578 , publisher = pub-springer
26579 , series = ser-springer_lncs
26585 , author = SawardeckerEN #and# Sales-PardoM #and# AmaralLAN
26586 , title = {{Detection of node group membership in networks with group overlap}}
26588 , pages = {277--284}
26589 , url = "http://dx.doi.org/10.1140/epjb/e2008-00418-0"
26594 @InProceedings{ssa-posn-09
26595 , author = SankaranarayananJ #and# SametH #and# AlborziH
26596 , title = {{Path Oracles for Spatial Networks}}
26597 , booktitle = {{Proceedings of the 35th International Conference on Very Large Databases (VLDB 2009)}}
26598 , pages = {1210--1221}
26602 @InProceedings{ssa-sndbs-08
26603 , author = SametH #and# SankaranarayananJ #and# AlborziH
26604 , title = {{Scalable Network Distance Browsing in Spatial Databases}}
26605 , booktitle = {{Proceedings of the 2008 ACM SIGMOD international conference on Management of data (SIGMOD'08)}}
26607 , publisher = pub-acm
26611 @InProceedings{ssk-aibav-08
26612 , author = SchreckT #and# SchneidewindJ #and# KeimDA
26613 , title = {{An Image-Based Approach to Visual Feature Space Analysis}}
26614 , booktitle = {{Proceedings of the 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision (WSCG'2008)}}
26615 , note = {to appear}
26616 , pdf = "http://infovis.uni-konstanz.de/papers/2008/wscg08som.pdf"
26621 , editor = SzczepaniakPS #and# SegoviaJ #and# KacprzykJ #and# ZadehLA
26622 , title = {{Intelligent exploration of the web}}
26623 , address = "Heidelberg, Germany, Germany"
26624 , isbn = "3-7908-1529-2"
26625 , publisher = pub-physica
26626 , url = "http://portal.acm.org/citation.cfm?id=941713&coll=GUIDE&dl=&CFID=15151515&CFTOKEN=6184618#"
26630 @techreport{ssmgw-sdasc-12
26631 , author = StaudtC #and# SchummA #and# MeyerhenkeH #and# GoerkeR #and# WagnerD
26632 , title = {{Static and Dynamic Aspects of Scientific Collaboration Networks}}
26633 , institution = kit_wagner
26634 , number = {2012-11 }
26635 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000028493"
26639 @InProceedings{ssmgw-sdasc-asonam-12
26640 , author = StaudtC #and# SchummA #and# MeyerhenkeH #and# GoerkeR #and# WagnerD
26641 , title = {{Static and Dynamic Aspects of Scientific Collaboration Networks}}
26642 , booktitle = {{Proceedings of the 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining}}
26643 , pages = {522--526}
26644 , publisher = pub-ics
26648 @techreport{sssh-msien-07
26649 , author = SnijdersTAB #and# SteglichCE #and# SchweinbergerM #and# HuismanM
26650 , title = {{Manual for {SIENA} Version 3.1}}
26651 , institution = "University of Groningen: ICS / Department of Sociology"
26652 , pdf = "http://stat.gamma.rug.nl/sie_man31.pdf"
26656 @InProceedings{sssv-becn-94
26657 , author = ShahrokhiF #and# SykoraO #and# SzekelyLA #and# VrtoI
26658 , title = {{Book Embeddings and Crossing Numbers}}
26659 , booktitle = {{Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'93)}}
26660 , pages = {256--268}
26661 , publisher = pub-springer
26662 , series = ser-springer_lncs
26663 , url = "http://www.springerlink.com/content/y06w57u47h515345/"
26668 @InProceedings{sst-cgmp-02
26669 , author = ShamirR #and# SharanR #and# TsurD
26670 , title = {{Cluster Graph Modification Problems}}
26671 , booktitle = {{Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'02)}}
26672 , pages = {379--390}
26673 , pdf = "http://www.springerlink.com/content/43fhrcdqkp6c36bf/fulltext.pdf"
26674 , publisher = pub-springer
26675 , series = ser-springer_lncs
26676 , url = "http://www.springerlink.com/content/43fhrcdqkp6c36bf/"
26681 @InProceedings{sst-mfaue-03
26682 , author = SellmannM #and# SensenN #and# TimajevL
26683 , title = {{Multicommodity Flow Approximation Used for Exact Graph Partitioning}}
26684 , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}}
26685 , pages = {752--764}
26686 , publisher = pub-springer
26687 , series = ser-springer_lncs
26692 @InProceedings{ssv-mrp-08
26693 , author = SandersP #and# SchultesD #and# VetterC
26694 , title = {{Mobile Route Planning}}
26695 , booktitle = {{Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08)}}
26697 , pages = {732--743}
26698 , publisher = pub-springer
26699 , series = ser-springer_lncs
26705 , author = SatyanarayanaA #and# TungL
26706 , title = {{A characterization of partial 3-trees}}
26707 , journal = j-networks
26709 , pages = {299--322}
26714 @InProceedings{st-afugc-04
26715 , author = SixJM #and# TollisIG
26716 , title = {{A Framework for User-Grouped Circular Drawings}}
26717 , booktitle = {{Proceedings of the 11th International Symposium on Graph Drawing (GD'03)}}
26719 , pages = {135--146}
26720 , publisher = pub-springer
26721 , series = ser-springer_lncs
26726 @InProceedings{st-cdbg-99
26727 , author = SixJM #and# TollisIG
26728 , title = {{Circular Drawings of Biconnected Graphs}}
26729 , booktitle = {{Selected Papers from the 1st International Workshop on Algorithm Engineering and Experimentation (ALENEX'99)}}
26731 , publisher = pub-springer
26732 , series = ser-springer_lncs
26733 , url = "http://www.springerlink.com/content/4cnm5ck4m6eprygv/"
26738 @article{st-dsdt-83
26739 , author = SleaterDD #and# TarjanRE
26740 , title = {{A data structure for dynamic trees}}
26744 , pages = {362--391}
26749 @Article{st-gvlmn-02
26750 , author = SilvaVd #and# TenenbaumJB
26751 , title = {{Global Versus Local Methods in Nonlinear Dimensionality Reduction}}
26753 , pages = {705--712}
26754 , pdf = "http://web.mit.edu/cocosci/Papers/nips02-localglobal-in-press.pdf"
26759 @article{st-oggvecmd-03
26760 , author = SinghM #and# TripathiA
26761 , title = {{Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree}}
26762 , journal = j-endima
26768 @InProceedings{st-spwpg-96
26769 , author = SpielmanDA #and# TengS
26770 , title = {{Spectral Partitioning Works: Planar Graphs and Finite Element Meshes}}
26771 , booktitle = {{Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS'96)}}
26773 , pages = {96--106}
26778 , author = staralliance
26779 , title = {{\url{http://www.staralliance.com}}}
26783 @Article{stt-mvuhs-81
26784 , author = SugiyamaK #and# TagawaS #and# TodaM
26785 , title = {{Methods for Visual Understanding of Hierarchical System Structures}}
26786 , journal = j-ieeetsmc
26788 , pages = {109--125}
26789 , url = "http://dx.doi.org/10.1109/TSMC.1981.4308636"
26790 , volume = {SMC-11}
26795 , author = SchwikowskiB #and# UetzP #and# FieldsS
26796 , title = {{A network of protein-protein interactions in yeast}}
26798 , pages = {1257--1261}
26799 , pdf = "http://www.nature.com/nbt/journal/v18/n12/pdf/nbt1200_1257.pdf"
26800 , url = "http://www.nature.com/nbt/journal/v18/n12/abs/nbt1200_1257.html"
26805 @Article{sv-speg-86
26806 , author = SedgewickR #and# VitterJS
26807 , title = {{Shortest Paths in Euclidean Graphs}}
26815 @techreport{sv-swpt-03
26816 , author = SlutzkiG #and# VolijO
26817 , title = {{Scoring of Web pages and tournaments -- axiomatizations}}
26818 , address = "Ames, USA"
26819 , institution = "Iowa State University"
26824 @InProceedings{svgwsm-aaiip-10
26825 , author = SchmidJ #and# VolkerM #and# GaedekeT #and# WeberP #and# StorkW #and# MullerGlaserKD
26826 , title = {{An Approach to Infrastructure-Independent Person Localization with an IEEE 802.15.4 WSN}}
26827 , booktitle = {{Proceedings of the 2010 International Conference on Indoor Positioning and Indoor Navigation (IPIN'10)}}
26828 , pages = {906--914}
26829 , pdf = "http://i11www.ira.uka.de/extra/publications/svgwsm-aaiip-10.pdf"
26830 , publisher = pub-ics
26831 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?tp=&arnumber=5646831&tag=1"
26835 @InProceedings{svw-eaddh-11
26836 , author = SchieferdeckerD #and# VolkerM #and# WagnerD
26837 , title = {{Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks}}
26838 , booktitle = {{Proceedings of the 10th International Symposium on Experimental Algorithms (SEA'11)}}
26839 , pages = {388--399}
26840 , pdf = "http://i11www.ira.uka.de/extra/publications/svw-eaddh-11.pdf"
26841 , publisher = pub-springer
26842 , series = ser-springer_lncs
26843 , url = "http://www.springerlink.com/content/1828g7262223654n"
26848 @techreport{svw-eaddh2-11
26849 , author = SchieferdeckerD #and# VolkerM #and# WagnerD
26850 , title = {{Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks}}
26851 , institution = "Karlsruhe Institute of Technology"
26852 , number = {2011-8}
26853 , pdf = "http://i11www.ira.uka.de/extra/publications/svw-eaddh2-11.pdf"
26854 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000022438"
26858 @techreport{sw-acct-04
26859 , author = SchankT #and# WagnerD
26860 , title = {{Approximating Clustering-Coefficient and Transitivity}}
26861 , institution = iti_wagner
26862 , number = {2004-9}
26863 , url = "http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=ira/2004/9"
26867 @Article{sw-acct-05
26868 , author = SchankT #and# WagnerD
26869 , title = {{Approximating Clustering Coefficient and Transitivity}}
26872 , pages = {265--275}
26873 , pdf = "http://www.emis.ams.org/journals/JGAA/accepted/2005/SchankWagner2005.9.2.pdf"
26874 , url = "http://www.emis.ams.org/journals/JGAA/volume09.html"
26879 @proceedings{sw-ae-13
26880 , editor = SandersP #and# WagnerD
26881 , title = {{Algorithm Engineering}}
26882 , note = {in print}
26884 , publisher = pub-springer
26890 @InProceedings{sw-caeis-04
26891 , author = SagieG #and# WoolA
26892 , title = {{A Clustering Approach for Exploring the {I}nternet Structure}}
26893 , booktitle = {{Proceedings of the 23rd IEEE Convention of Electrical and Electronics Engineers in Israel}}
26894 , pages = {149--152}
26895 , pdf = "http://www.eng.tau.ac.il/~yash/ieeei04-clustering.pdf"
26896 , publisher = pub-ics
26897 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1361111"
26901 @Article{sw-epmii-96
26902 , author = SchikarskiA #and# WagnerD
26903 , title = {{Efficient Parallel Matrix Inversion on Interconnection Networks}}
26906 , pages = {196--201}
26911 @InProceedings{sw-fcltl-05
26912 , author = SchankT #and# WagnerD
26913 , title = {{Finding, Counting and Listing all Triangles in Large Graphs, an Experimental Study}}
26914 , booktitle = {{Proceedings of the 4th Workshop on Experimental Algorithms (WEA'05)}}
26915 , pages = {606--609}
26916 , pdf = "http://www.springerlink.com/content/rgfr3df7k1rr3cvb/fulltext.pdf"
26917 , publisher = pub-springer
26918 , series = ser-springer_lncs
26919 , url = "http://www.springerlink.com/content/rgfr3df7k1rr3cvb/"
26924 @inproceedings{sw-fdssp-98
26925 , author = SrivastavA #and# WolfK
26926 , title = {{Finding dense subgraphs with semidefinite programming}}
26927 , booktitle = {{Proceedings of the 1st International Workshop on Approximatin Algorithms for Combinatorial Optimizat}}
26928 , pages = {181--191}
26929 , publisher = pub-springer
26930 , series = ser-springer_lncs
26935 @article{sw-grrgq-99
26936 , author = StegerA #and# WormaldNC
26937 , title = {{Generating random regular graphs quickly}}
26939 , pages = {377--396}
26945 , editor = SteinmetzR #and# WehrleK
26946 , title = {{Peer-to-Peer Systems and Applications}}
26947 , booktitle = {{Peer-to-Peer Systems and Applications}}
26948 , publisher = pub-springer
26949 , series = ser-springer_lncs
26950 , url = "http://www.springerlink.com/content/g6h805426g7t/"
26955 @article{sw-smca-97
26956 , author = StoerM #and# WagnerF
26957 , title = {{A Simple Min-Cut Algorithm}}
26961 , pages = {585--591}
26966 @Article{swc-acesm-04
26967 , author = SoperAJ #and# WalshawC #and# CrossM
26968 , title = {{A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph Partitioning}}
26971 , pages = {225--241}
26972 , pdf = "http://staffweb.cms.gre.ac.uk/~c.walshaw/papers/fulltext/SoperJoGO04.pdf"
26973 , url = "http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/#SoperJoGO04"
26979 , author = SoperAJ #and# WalshawC #and# CrossM
26980 , title = {{The Graph Partitioning Archive}}
26981 , institution = "University of Greenwich, London, UK"
26982 , note = {\url{http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/}}
26983 , url = "http://staffweb.cms.gre.ac.uk/~c.walshaw/partition/"
26987 @Article{sww-daola-00
26988 , author = SchulzF #and# WagnerD #and# WeiheK
26989 , title = {{Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport}}
26990 , journal = j-acm-ea
26997 @InProceedings{sww-daola-99
26998 , author = SchulzF #and# WagnerD #and# WeiheK
26999 , title = {{Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport}}
27000 , booktitle = {{Proceedings of the 3rd International Workshop on Algorithm Engineering (WAE'99)}}
27001 , pages = {110--123}
27002 , publisher = pub-springer
27003 , series = ser-springer_lncs
27004 , url = "http://portal.acm.org/citation.cfm?id=720630"
27009 @Article{swww-wkkla-94
27010 , author = SarrafzadehM #and# WagnerD #and# WagnerF #and# WeiheK
27011 , title = {{Wiring Knock-Knee Layouts: A Global Approach}}
27015 , pages = {581--489}
27016 , pdf = "http://ieeexplore.ieee.org/iel1/12/6965/00280805.pdf"
27017 , url = "http://ieeexplore.ieee.org/iel1/12/6965/6965.html"
27022 @InProceedings{swww-wkklg-92
27023 , author = SarrafzadehM #and# WagnerD #and# WagnerF #and# WeiheK
27024 , title = {{Wiring knock-knee layouts: a global approach}}
27025 , booktitle = {{Proceedings of the 3rd International Symposium on Algorithms and Computation (ISAAC'92)}}
27026 , pages = {388--399}
27027 , publisher = pub-springer
27028 , series = ser-springer_lncs
27033 @InProceedings{swz-umlgt-02
27034 , author = SchulzF #and# WagnerD #and# ZaroliagisC
27035 , title = {{Using Multi-Level Graphs for Timetable Information in Railway Systems}}
27036 , booktitle = {{Proceedings of the 4th Workshop on Algorithm Engineering and Experiments (ALENEX'02)}}
27038 , pdf = "http://i11www.iti.uni-karlsruhe.de/extra/publications/swz-umlgt-02.pdf"
27039 , publisher = pub-springer
27040 , series = ser-springer_lncs
27045 @InProceedings{sxzf-lmcmd-07
27046 , author = SunJ #and# XieY #and# ZhangHui #and# FaloutsosC
27047 , title = {{Less is More: Compact Matrix Decomposition for Large Sparse Graphs}}
27048 , booktitle = {{Proceedings of the seventh SIAM International Conference on Data Mining}}
27049 , pages = {366--377}
27050 , pdf = "http://www.siam.org/proceedings/datamining/2007/dm07_033Sun.pdf"
27051 , publisher = pub-siam
27052 , url = "http://www.siam.org/proceedings/datamining/2007/dm07.php"
27056 @InProceedings{sypf-gspfm-07
27057 , author = SunJ #and# YuPS #and# PapadimitriouS #and# FaloutsosC
27058 , title = {{GraphScope: Parameter-Free Mining of Large Time-Evolving Graphs}}
27059 , booktitle = {{Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}}
27060 , pages = {687--696}
27061 , pdf = "http://www.cs.cmu.edu/~spapadim/pdf/gscope_kdd07.pdf"
27062 , publisher = pub-acm
27063 , url = "http://portal.acm.org/citation.cfm?id=1281192.1281266&coll=Portal&dl=GUIDE&CFID=54298929&CFTOKEN=41087406"
27067 @Article{sz-npcop-10
27068 , author = SadasivamS #and# ZhangHu
27069 , title = {{NP-Completeness of $st$-Orientations for Plane Graphs}}
27072 , pages = {995--1003}
27078 , author = StephensonKA #and# ZelenM
27079 , title = {{Rethinking Centrality: Methods and Examples}}
27086 %% --------------------------------------------------------------
27089 , author = ThomassenC
27090 , title = {{A Refinement of Kuratowski's Theorem}}
27091 , journal = j-jcombthb
27093 , pages = {245--253}
27098 , author = TruszczynskiM
27099 , title = {{Centers and Centroids of unicyclic graphs}}
27101 , pages = {223--228}
27108 , title = {{Connectivity in graphs}}
27110 , publisher = pub-utp
27111 , series = ser-utp_me
27115 @InProceedings{t-corad-01
27117 , title = {{Compact Oracles for Reachability and Approximate Distances in Planar Digraphs}}
27118 , booktitle = {{Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'01)}}
27119 , pages = {242--251}
27120 , publisher = pub-ieeecs
27124 @Article{t-corad-04
27126 , title = {{Compact Oracles for Reachability and Approximate Distances in Planar Digraphs
\r
27131 , pages = {993--1024}
27138 , title = {{Convex Representations of Graphs}}
27140 , pages = {304--320}
27145 @Article{t-dfslg-72
27146 , author = TarjanRE
27147 , title = {{Depth-first search and linear graph algorithms}}
27148 , journal = j-sicomp
27151 , pages = {146--160}
27152 , url = "http://siamdl.aip.org/dbt/dbt.jsp?KEY=SMJCAT&Volume=1&Issue=2"
27159 , title = {{Data Structures and Network Algorithms}}
27160 , booktitle = {{Data Structures and Network Algorithms}}
27161 , publisher = pub-siam
27165 @Article{t-eggmn-87
27166 , author = TamassiaR
27167 , title = {{On Embedding a Graph in the Grid with the Minimum Number of Bends}}
27168 , journal = j-sicomp
27170 , pages = {421--444}
27171 , pdf = "http://scitation.aip.org/getpdf/servlet/GetPDFServlet?filetype=pdf&id=SMJCAT000016000003000421000001"
27172 , url = "http://dx.doi.org/10.1137/0216030"
27179 , title = {{Envisioning Information}}
27180 , booktitle = {{Envisioning Information}}
27181 , publisher = pub-gp
27187 , title = {{On an extremal problem in graph theory}}
27189 , pages = {436--452}
27194 @inproceedings{t-fdapsp-04
27196 , title = {{Fully Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles}}
27197 , booktitle = proc-swat-04
27198 , pages = {384--396}
27199 , publisher = pub-springer
27200 , series = ser-springer_lncs
27205 @InProceedings{t-fdmc-01
27207 , title = {{Fully-Dynamic Min-Cut}}
27208 , booktitle = {{Proceedings of the 33rd Annual {ACM} Symposium on the Theory of Computing (STOC'01)}}
27210 , pages = {224--230}
27211 , url = "http://portal.acm.org/citation.cfm?id=380804"
27215 @techreport{t-fmc-72
27216 , author = TarjanRE
27217 , title = {{Finding a maximum clique}}
27218 , institution = "Department of Computer Science, Cornell University, Ithaca, NY"
27219 , number = {72-123}
27225 , title = {{How to Draw a Graph}}
27228 , pages = {743--767}
27229 , pdf = "http://plms.oxfordjournals.org/cgi/reprint/s3-13/1/743.pdf"
27230 , url = "http://plms.oxfordjournals.org/cgi/reprint/s3-13/1/743"
27236 , editor = TamassiaR
27237 , title = {{Handbook of Graph Drawing and Visualization }}
27238 , booktitle = {{Handbook of Graph Drawing and Visualization }}
27239 , note = {to appear}
27240 , publisher = pub-crcp
27244 @InProceedings{t-ipqdk-03
27246 , title = {{Integer Priority Queues with Decrease Key in Constant Time and the Single Source Shortest Paths Problem}}
27247 , booktitle = {{Proceedings of the 35th Annual {ACM} Symposium on the Theory of Computing (STOC'03)}}
27249 , pages = {149--158}
27253 @Article{t-ipqdk-04
27255 , title = {{Integer Priority Queues with Decrease Key in Constant Time and the Single Source Shortest Paths Problem}}
27258 , pages = {330--353}
27264 , author = ThomassenC
27265 , title = {{Interval Representation of Planar Graphs}}
27266 , journal = j-jcombthb
27274 @InProceedings{t-jigle-98
27275 , author = TunkelangD
27276 , title = {{JIGGLE: Java Interactive Graph Layout Environment}}
27277 , booktitle = {{Proceedings of the 6th International Symposium on Graph Drawing (GD'98)}}
27278 , location = "Montreal, Canada"
27280 , pages = {413--422}
27281 , pdf = "http://www.springerlink.com/content/edqjm95w63e7lart/fulltext.pdf"
27282 , publisher = pub-springer
27283 , series = ser-springer_lncs
27284 , url = "http://www.springerlink.com/content/edqjm95w63e7lart/"
27290 , author = ThomassenC
27291 , title = {{Kuratowski's Theorem}}
27294 , pages = {225--241}
27299 @Article{t-mdstm-52
27300 , author = TorgersonWS
27301 , title = {{Multidimensional Scaling: I. Theory and Method}}
27305 , pages = {401--419}
27306 , url = "http://www.springerlink.com/content/86u3178hvh181k57/"
27311 @article{t-ndnrm-76
27312 , author = TainiterM
27313 , title = {{A New Deterministic Network Reliability Measure}}
27314 , journal = j-networks
27316 , pages = {191--204}
27322 , author = TarjanRE
27323 , title = {{A Note on Finding the Bridges of a Graph}}
27327 , pages = {160--161}
27332 @phdthesis{t-noagd-99
27333 , author = TunkelangD
27334 , title = {{A Numerical Optimization Approach to General Graph Drawing}}
27335 , institution = "Carnegie-Mellon University Pittsburgh"
27337 , pdf = "http://reports-archive.adm.cs.cmu.edu/anon/1998/CMU-CS-98-189.pdf"
27338 , url = "http://reports-archive.adm.cs.cmu.edu/anon/1998/abstracts/98-189.html"
27342 @article{t-ogrggpkd-79
27343 , author = TinhoferG
27344 , title = {{On the generation of random graphs with given properties and known distribution}}
27345 , journal = "Appl. Comput. S"
27346 , pages = {265--296}
27351 @Article{t-pdfig-80
27352 , author = ThomassenC
27353 , title = {{Planarity and Duality of Finite and Infinite Graphs.}}
27354 , journal = j-jcombthb
27357 , pages = {244--271}
27362 @InCollection{t-prg-84
27363 , author = ThomassenC
27364 , title = {{Plane Representations of Graphs}}
27365 , booktitle = {{Progress in Graph Theory}}
27367 , publisher = pub-ap
27373 , title = {{R: A Language and Environment for Statistical Computing}}
27374 , url = "http://www.r-project.org"
27378 @article{t-rampq-00
27380 , title = {{On RAM Priority Queues}}
27381 , journal = j-sicomp
27383 , pages = {86--109}
27388 @inproceedings{t-rampq-96
27390 , title = {{On RAM Priority Queues}}
27391 , booktitle = proc-soda-96
27396 @phdthesis{t-rmlw-95
27398 , title = {{Robuste und effiziente Methoden zur L{\"o}sung von Wegproblemen}}
27399 , school = "Universit{\"a}t Paderborn"
27405 , title = {{Recent Progresses in Combinatorics}}
27406 , booktitle = {{Recent Progresses in Combinatorics}}
27407 , publisher = pub-ap
27412 , author = TainiterM
27413 , title = {{Statistical Theory of Connectivity~I: Basic Definitions and Properties}}
27416 , pages = {391--398}
27423 , title = {{A Theory of 3-Connected Graphs}}
27424 , journal = j-indmath
27425 , pages = {441--455}
27431 , author = ThurstonWP
27432 , title = {{The Geometry and Topology of Three-Manifolds}}
27434 , school = "Princeton University"
27435 , url = "http://www.msri.org/publications/books/gt3m/"
27439 @Article{t-tjstc-92
27440 , author = ThomassenC
27441 , title = {{The Jordan-Sch{\"o}nfliess Theorem and the Classification of Sufaces}}
27444 , pages = {116--130}
27450 , author = TolkienJR
27451 , title = {{The Lord of the Rings}}
27452 , booktitle = {{The Lord of the Rings}}
27453 , note = {In three volumes}
27454 , publisher = pub-gau
27458 @Article{t-tsdfs-86
27459 , author = TarjanRE
27460 , title = {{Two Streamlined Depth-First Search Algorithms}}
27468 , author = ThomassenC
27469 , title = {{Tutte's Spring Theorem}}
27472 , pages = {275--280}
27479 , title = {{The Visual Display of Quantitative Information.}}
27480 , booktitle = {{The Visual Display of Quantitative Information.}}
27481 , publisher = pub-gp
27482 , volume = {2nd ed.}
27486 @article{t-usssppiwlt-99
27488 , title = {{Undirected Single Source Shortest Paths with Positive Integer Weights in Linear Time}}
27491 , pages = {362--394}
27496 @InProceedings{tcl-csvda-98
27497 , author = ThomasianA #and# CastelliV #and# LiC
27498 , title = {{Clustering and Singular Value Decomposition for Approximate Indexing in High Dimensional Spaces}}
27499 , booktitle = {{Proceedings of the 7th International Conference on Information and Knowledge Management}}
27500 , pages = {201--207}
27501 , publisher = pub-acm
27502 , url = "http://doi.acm.org/10.1145/288627.288658"
27506 @techreport{tgjsw-ntplh-01
27507 , author = TangmunarunkitH #and# GovindanR #and# JaminS #and# ShenkerSJ #and# WillingerW
27508 , title = {{Network Topologies, Power Laws, and Hierarchy}}
27509 , institution = "Computer Science Department, University of Southern California"
27510 , number = {01-746}
27511 , type = {Technical Report}
27512 , url = "http://citeseer.nj.nec.com/tangmunarunkit01network.html"
27516 @article{tgjsw-ntplh-02
27517 , author = TangmunarunkitH #and# GovindanR #and# JaminS #and# ShenkerSJ #and# WillingerW
27518 , title = {{Network Topologies, Power Laws, and Hierarchy}}
27519 , journal = j-acm-ccr
27526 @article{tias-nagamis-77
27527 , author = TsukiyamaS #and# IdeM #and# AriyoshiH #and# ShirakawaI
27528 , title = {{A new algorithm for generating all the maximal independent sets}}
27529 , journal = j-sicomp
27531 , pages = {505--517}
27537 , title = {{\url{http://www.census.gov/geo/www/tiger/}}}
27538 , publisher = pub-usdc
27542 @InProceedings{tk-eewcs-03
27543 , author = ToyodaM #and# KitsuregawaM
27544 , title = {{Extracting Evolution of Web Communities from a Series of Web Archives}}
27545 , booktitle = {{Proceedings of the 14th ACM Conference on Hypertext and Hypermedia}}
27547 , publisher = pub-acm
27548 , url = "http://portal.acm.org/citation.cfm?id=900059"
27552 @Article{tl-ampop-92
27553 , author = TungTungC #and# LinChewK
27554 , title = {{A Multicriteria Pareto-Optimal Path Algorithm}}
27557 , pages = {203--209}
27562 @article{tl-fafedb-83
27563 , author = TongP #and# LawlerEL
27564 , title = {{A Faster Algorithm for Finding Edge-Disjoint Branchings}}
27573 @InProceedings{trhlh-cvx-12
27574 , author = TielertT #and# RiegerD #and# HartensteinH #and# LuzR #and# HausbergerS
27575 , title = {{Can V2X communication help electric vehicles save energy?}}
27576 , booktitle = {{12th International Conference on ITS Telecommunications}}
27578 , pages = {232--237}
27579 , publisher = pub-ieee
27580 , url = "http://dx.doi.org/10.1109/ITST.2012.6425172"
27585 , author = ThulasiramanK #and# SwamyMNS
27586 , title = {{Graphs: Theory and Algorithms}}
27587 , booktitle = {{Graphs: Theory and Algorithms}}
27588 , publisher = pub-wiley
27593 , author = TanP #and# SteinbachM #and# KumarV
27594 , title = {{Introduction to Data Mining}}
27595 , booktitle = {{Introduction to Data Mining}}
27596 , publisher = pub-aw
27597 , url = "http://www.pearsonhighered.com/educator/academic/product/0,1144,0321321367,00.html"
27601 @Article{tt-auavr-86
27602 , author = TamassiaR #and# TollisIG
27603 , title = {{A Unified Approach to Visibility Representations of Planar Graphs}}
27605 , pages = {321--341}
27610 @article{tt-fmis-77
27611 , author = TarjanRE #and# TrojanowskiAE
27612 , title = {{Finding a maximum independent set}}
27613 , journal = j-sicomp
27615 , pages = {537-546}
27620 @Article{ttiw-pcads-07
27621 , author = TaokaS #and# TakafujiD #and# IguchiT #and# WatanabeT
27622 , title = {{Performance Comparison of Algorithms for the Dynamic Shortest Path Problem}}
27623 , journal = j-ieicetfeccs
27631 , editor = TothP #and# VigoD
27632 , title = {{The Vehicle Routing Problem}}
27633 , booktitle = {{The Vehicle Routing Problem}}
27634 , publisher = pub-siam
27638 @InProceedings{tw-stbds-07
27639 , author = TurauV #and# WeyerC
27640 , title = {{Scheduling Transmission of Bulk Data in Sensor Networks Using a Dynamic TDMA Protocol}}
27641 , booktitle = {{8th International Conference on Mobile Data Management (MDM 2007)}}
27642 , pages = {321--325}
27643 , publisher = pub-ieeecs
27644 , url = "http://dx.doi.org/10.1109/MDM.2007.68"
27648 @InProceedings{tw-tdmas-07
27649 , author = TurauV #and# WeyerC
27650 , title = {{TDMA-Schemes for Tree-Routing in Data Intensive Wireless Sensor Networks}}
27651 , booktitle = {{Proc. First Int. Workshop on Protocols and Algorithms for Reliable and Data Intensive Sensor Networks (PARIS)}}
27653 , publisher = pub-ieeecs
27654 , url = "10.1109/MOBHOC.2007.4428749"
27659 , author = TarjanR #and# YannakakisM
27660 , title = {{Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs}}
27661 , journal = j-sicomp
27664 , pages = {566--579}
27670 , author = ThorupM #and# ZwickU
27671 , title = {{Approximate Distance Oracles}}
27679 %% --------------------------------------------------------------
27681 @techreport{u-gcti-08
27682 , author = UngererT
27683 , title = {{Grand Challenges der Technischen Informatik}}
27684 , institution = "Informationstechnische Gesellschaft im VDE (ITG) und Gesellschaft f{\"u}r Informatik (GI)"
27685 , url = "http://www.gi-ev.de/gliederungen/fachbereiche/technische-informatik-ti/fa-arcs/"
27690 , author = AnalyticTech
27691 , title = {{{UCINET} 6 - Social Network Analysis Software}}
27692 , url = "http://www.analytictech.com/ucinet/"
27696 %% --------------------------------------------------------------
27699 , author = VaziraniVV
27700 , title = {{Approximation Algorithms}}
27701 , booktitle = {{Approximation Algorithms}}
27702 , publisher = pub-springer
27706 @phdthesis{v-aaclw-12
27708 , title = {{Algorithmic Aspects of Communication and Localization in Wireless Sensor Networks}}
27710 , pdf = "http://i11www.ira.uka.de/extra/publications/v-aaclw-12.pdf"
27711 , school = "Fakult{\"a}t f{\"u}r Informatik, Karlsruher Institut f{\"u}r Technologie (KIT)"
27712 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000028910"
27716 @Article{v-agagc-91
27717 , author = VaidyaPM
27718 , title = {{A sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions}}
27721 , pages = {369--381}
27727 , author = ValiantLG
27728 , title = {{The complexity of computing the permanent}}
27730 , pages = {189--201}
27735 @article{v-ccsrpg-01
27736 , author = VadhanSP
27737 , title = {{The complexity of counting in sparse, regular, and planar graphs}}
27738 , journal = j-sicomp
27740 , pages = {398--427}
27746 , author = ValiantLG
27747 , title = {{The complexity of enumeration and reliability problems}}
27748 , journal = j-sicomp
27750 , pages = {410--421}
27755 @mastersthesis{v-femno-10
27757 , title = {{Fast and Exact Mobile Navigation with OpenStreetMap Data}}
27758 , school = "Karlsruhe Institute of Technology"
27763 , author = VazquezA
27764 , title = {{Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations}}
27768 , url = "http://link.aps.org/doi/10.1103/PhysRevE.67.056104"
27773 @InProceedings{v-npwgh-08
27774 , author = VassilevskaV
27775 , title = {{Nondecreasing Paths in a Weighted Graph or: How to Optimally Read a Train Schedule}}
27776 , booktitle = {{Proceedings of the 19th Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'08)}}
27777 , pages = {465--472}
27778 , pdf = "http://www.cs.cmu.edu/~virgi/nondecpaths.pdf"
27782 @techreport{v-ptdch-09
27784 , title = {{Parallel Time-Dependent Contraction Hierarchies}}
27785 , institution = "Karlsruhe Institute of Technology"
27786 , note = {\url{http://algo2.iti.kit.edu/download/vetter_sa.pdf}}
27792 , title = {{Route Planning in Road Networks with Turn Costs}}
27793 , note = {Student Research Project. \url{http://algo2.iti.uni-karlsruhe.de/documents/routeplanning/volker_sa.pdf}}
27798 @mastersthesis{v-stcws-08
27800 , title = {{Scheduling and Topology Control in Wireless Sensor Networks}}
27802 , pdf = "http://i11www.ira.uka.de/extra/publications/v-stcws-08.pdf"
27803 , school = "Universit{\"a}t Karlsruhe"
27808 , editor = VockingB #and# AltH #and# DietzfelbingerM #and# ReischukR #and# ScheidelerC #and# VollmerH #and# WagnerD
27809 , title = {{Taschenbuch der Algorithmen}}
27810 , booktitle = {{Taschenbuch der Algorithmen}}
27811 , publisher = pub-springer
27812 , url = "http://www-i1.informatik.rwth-aachen.de/~algorithmus/"
27816 @InProceedings{v-zbg-05
27818 , title = {{Zeichnen von Begrenzungen ungenau definierter Gebiete}}
27819 , booktitle = {{Informatiktage 2005. Fachwissenschaftlicher Informatik-Kongress, 8. und 9. April 2005, Schloss Birlinghoven, Sankt Augustin}}
27820 , pages = {105--108}
27821 , series = ser-gielnilni
27822 , url = "http://subs.emis.de/LNI/Seminar/Seminar2.html"
27827 @Book{vadrsvw-au-11
27828 , editor = VockingB #and# AltH #and# DietzfelbingerM #and# ReischukR #and# ScheidelerC #and# VollmerH #and# WagnerD
27829 , title = {{Algorithms Unplugged}}
27830 , booktitle = {{Algorithms Unplugged}}
27831 , note = {http://www-i1.informatik.rwth-aachen.de/~algorithmus/}
27832 , publisher = pub-springer
27833 , url = "http://www.springer.com/mathematics/book/978-3-642-15327-3"
27837 @Article{vc-oucrf-71
27838 , author = VapnikVN #and# ChervonenkisAY
27839 , title = {{On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities}}
27842 , pages = {264--280}
27843 , pdf = "http://att.zju88.org/files/186216.1fd279f6.pdf"
27849 , author = ValenteTW #and# ForemanRK
27850 , title = {{Integration and radiality: measuring the extent of an individual's connectedness and reachability in a network}}
27852 , pages = {89--105}
27857 @InProceedings{vhe-ssitg-02
27858 , author = VukadinovicD #and# HuangP #and# ErlebachT
27859 , title = {{On the Spectrum and Structure of Internet Topology Graphs}}
27860 , booktitle = {{Proceedings of the 2nd International Workshop on Innovative Internet Computing Systems}}
27863 , pdf = "http://www.springerlink.com/content/ty8n1r9k6xf81vwl/fulltext.pdf"
27864 , publisher = pub-springer
27865 , series = ser-springer_lncs
27866 , url = "http://www.springerlink.com/content/ty8n1r9k6xf81vwl/"
27871 @techreport{vkw-ocspc-09
27872 , author = VolkerM #and# KatzB #and# WagnerD
27873 , title = {{On the Complexity of Scheduling with Power Control in Geometric SINR}}
27874 , institution = iti_wagner
27875 , number = {2009-15}
27876 , pdf = "http://i11www.iti.uni-karlsruhe.de/extra/publications/vkw-ocspc-09.pdf"
27877 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000012389"
27881 @Article{vkz-diepq-77
27882 , author = VanEmdeBoasP #and# KaasR #and# ZijlstraE
27883 , title = {{Design and Implementation of an Efficient Priority Queue}}
27885 , pages = {99--127}
27890 @InProceedings{vl-esgrs-05
27891 , author = VigerF #and# LatapyM
27892 , title = {{Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence}}
27893 , booktitle = {{Proceedings of the 11th Annual International Conference on Computing Combinatorics (COCOON'05)}}
27894 , pages = {440--449}
27895 , publisher = pub-springer
27896 , series = ser-springer_lncs
27897 , url = "http://www.springerlink.com/content/0g56uq72lx8tn687/"
27901 @techreport{vm-csca-03
27902 , author = VermaD #and# MeilaM
27903 , title = {{A Comparison of Spectral Clustering Algorithms}}
27904 , institution = "University of Washington CSE Technical report"
27905 , number = {03-05-01}
27906 , url = "http://www.stat.washington.edu/mmp/"
27910 @InProceedings{vnd-ppcso-06
27911 , author = VazirgiannisM #and# NorvaagK #and# DoulkeridisC
27912 , title = {{Peer-to-Peer Clustering for Semantic Overlay Network Generation}}
27913 , booktitle = {{Proceedings of the 6th International Workshop on Pattern Recognition in Information Systems (PRIS 2006)}}
27917 @InProceedings{vs-f-91
27918 , author = VaziraniVV #and# SaranH
27919 , title = {{Finding k-cuts within twice the optimal}}
27920 , booktitle = {{Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS'91)}}
27922 , pages = {743--751}
27923 , url = "http://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185443"
27927 @InProceedings{vsgmw-fdtwn-12
27928 , author = VolkerM #and# SchmidJ #and# GaedekeT #and# MullerGlaserKD #and# WagnerD
27929 , title = {{Force-Directed Tracking in Wireless Networks using Signal Strength and Step Recognition}}
27930 , booktitle = {{Proceedings of the International Conference on Localization and GNSS (ICL-GNSS '12)}}
27932 , pdf = "http://i11www.ira.uka.de/extra/publications/vsgmw-fdtwn-12.pdf"
27933 , publisher = pub-ics
27934 , url = "http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6253126"
27938 @Article{vtl-trspd-82
27939 , author = ValdesJ #and# TarjanRE #and# LawlerEL
27940 , title = {{The Recognition of Series Parallel Digraphs}}
27941 , journal = j-sicomp
27943 , pages = {298--313}
27948 %% --------------------------------------------------------------
27952 , title = {{Approximationsalgorithmen: Eine Einf{\"u}hrung}}
27953 , booktitle = {{Approximationsalgorithmen: Eine Einf{\"u}hrung}}
27954 , publisher = pub-t
27959 @InProceedings{w-aerpa-11
27961 , title = {{Algorithm Engineering for Route Planning -- An Update --}}
27962 , booktitle = {{Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11)}}
27964 , publisher = pub-springer
27965 , series = ser-springer_lncs
27971 , author = WilliamsJ
27972 , title = {{Algorithm 232: Heapsort}}
27976 , pages = {347--348}
27981 @InProceedings{w-amro-07
27983 , title = {{Algorithms and Models for Railway Optimization}}
27984 , booktitle = {{Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'03)}}
27985 , note = {Invited Talk}
27986 , pages = {198--206}
27987 , publisher = pub-springer
27988 , series = ser-springer_lncs
27989 , url = "http://www.springerlink.de/openurl.asp?genre=article&issn=0302-9743&volume=2748&spage=198"
27994 @Article{w-apomo-87
27995 , author = WarburtonA
27996 , title = {{Approximation of Pareto Optima in Multiple-Objective Shortest-Path Problems}}
28004 @Article{w-astig-33
28005 , author = WhitneyH
28006 , title = {{A Set of Topological Invariants for Graphs}}
28008 , pages = {231--235}
28013 @InProceedings{w-avsn-04
28015 , title = {{Analysis and Visualization of Social Networks}}
28016 , booktitle = {{Proceedings of the 2nd Workshop on Experimental Algorithms (WEA'03)}}
28017 , note = {Invited Talk}
28018 , pages = {261--266}
28019 , publisher = pub-springer
28020 , series = ser-springer_lncs
28027 , 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.))}}
28031 , pages = {102--103}
28032 , pdf = "http://www.springerlink.com/content/v8571u8mn274m357/fulltext.pdf"
28033 , url = "http://www.springerlink.com/content/v8571u8mn274m357/"
28038 @Article{w-brcgt-92
28040 , title = {{Book Review of \textit{Computational Graph Theory} by Gottfried Tinhofer, Ernst Mayr, Hartmut Noltemeier and Maciej Syslo (eds.), Springer-Verlag, 1990, 282 p.}}
28042 , note = {Book Review}
28044 , pages = {106--109}
28051 , title = {{Bemerkungen zum Vierfarbenproblem}}
28052 , journal = j-jdmvdmv
28059 , author = WhitneyH
28060 , title = {{Congruent graphs and the connectivity of graphs}}
28062 , pages = {150--168}
28067 @article{w-cvbmi-55
28068 , author = WignerEP
28069 , title = {{Characteristic vectors of bordered matrices with infinite dimensions}}
28070 , journal = j-amath
28071 , pages = {548--564}
28076 @habilitation{w-darcl-92
28078 , title = {{Discrete Algorithms for Routing in Chip Layout}}
28079 , school = "Technische Universit{\"a}t Berlin"
28083 @Article{w-dfgsa-03
28085 , title = {{{DFG-Schwerpunktprogramm \emph{Algorithmik gro{\ss}er und komplexer Netzwerke}}}}
28087 , pages = {162--169}
28094 , title = {{A Dynamic Model of Network Formation}}
28096 , pages = {331--341}
28101 @InCollection{w-dpg-01
28102 , author = WeiskircherR
28103 , title = {{Drawing Planar Graphs}}
28104 , booktitle = {{Drawing Graphs: Methods and Models}}
28105 , isbn = "3-540-42062-2"
28107 , pdf = "http://springerlink.metapress.com/content/bh97fl80jqp4njvc/fulltext.pdf"
28108 , publisher = pub-springer
28109 , series = ser-springer_lncs
28110 , url = "http://springerlink.metapress.com/content/bh97fl80jqp4njvc/"
28117 , title = {{Decomposition of Partial Orders}}
28118 , journal = j-order
28119 , pages = {335--350}
28126 , title = {{Decomposition of $k$-ary Relations}}
28128 , pages = {303--322}
28133 @article{w-drcsm-58
28134 , author = WignerEP
28135 , title = {{On the distribution of the roots of certain symmetric matrices}}
28136 , journal = j-amath
28137 , pages = {325--327}
28142 @phdthesis{w-dsmzs-86
28144 , title = {{{Die Splitdekomposition als Methode zur Zerlegung diskreter Strukturen}}}
28145 , school = "Rheinisch Westf{\"a}lische Technische Hochschule Aachen"
28149 @inproceedings{w-eahp-03
28150 , author = WoegingerGJ
28151 , title = {{Exact Algorithms for {$\mathcal{NP}$}-Hard Problems: A Survey}}
28152 , booktitle = {{Proceedings of the 5th International Workshop on Combinatorial Optimization (Aussois'2001)}}
28153 , pages = {185--207}
28154 , publisher = pub-springer
28155 , series = ser-springer_lncs
28160 @phdthesis{w-espla-05
28161 , author = WillhalmT
28162 , title = {{Engineering Shortest Paths and Layout Algorithms for Large Graphs}}
28163 , pdf = "http://www.ubka.uni-karlsruhe.de/vvv/2005/informatik/3/3.pdf"
28165 , url = "http://www.ubka.uni-karlsruhe.de/cgi-bin/psview?document=2005/informatik/3"
28169 @InProceedings{w-frp-11
28170 , author = WilliamsVV
28171 , title = {{Faster Replacement Paths}}
28172 , booktitle = {{Proceedings of the 22nd Annual {ACM--SIAM} Symposium on Discrete Algorithms (SODA'11)}}
28173 , pages = {1337--1346}
28174 , publisher = pub-siam
28179 , author = WhitneyH
28180 , title = {{$2$-isomorphic Graphs}}
28182 , pages = {245--254}
28189 , title = {{generatingfunctionology}}
28190 , publisher = pub-ap
28196 , title = {{Hypermaps Versus Bipartite Maps}}
28197 , journal = j-jcombthb
28200 , pages = {155--163}
28206 , author = WinklerG
28207 , title = {{Image Analysis, Random Fields, and Markov Chain Monte Carlo Methods}}
28209 , publisher = pub-springer
28215 , title = {{Introduction to Graph Theory}}
28217 , publisher = pub-ph
28223 , title = {{Information Visualization, Second Edition: Perception for Design}}
28224 , booktitle = {{Information Visualization, Second Edition: Perception for Design}}
28225 , publisher = pub-mk
28230 , author = WegenerI
28231 , title = {{Komplexit{\"a}tstheorie - Grenzen der Effizienz von Algorithm}}
28232 , booktitle = {{Komplexit{\"a}tstheorie - Grenzen der Effizienz von Algorithm}}
28233 , isbn = "3-540-00161-1"
28234 , publisher = pub-springer
28238 @techreport{w-kvlo-99
28240 , title = {{Kurzskript zur Vorlesung: Lineare Optimierung}}
28244 , school = "Konstanzer Schriften in Mathematik und Informatik"
28248 @InProceedings{w-mafdg-01
28249 , author = WalshawC
28250 , title = {{A Multilevel Algorithm for Force-Directed Graph Drawing}}
28251 , booktitle = {{Proceedings of the 8th International Symposium on Graph Drawing (GD'00)}}
28254 , pdf = "http://www.springerlink.com/content/99vvynnyq901tylm/fulltext.pdf"
28255 , publisher = pub-springer
28256 , series = ser-springer_lncs
28257 , url = "http://www.springerlink.com/content/99vvynnyq901tylm/"
28262 @InCollection{w-mb-98
28264 , title = {{Minimal spannende B{\"a}ume}}
28265 , booktitle = {{Prinzipien des Algorithmenentwurfs. Multimediales Lehrbuch}}
28266 , pages = {173--182}
28267 , publisher = pub-sav
28271 @Article{w-mctrp-02
28273 , title = {{Modeling Costs of Turns in Route Planning}}
28276 , pages = {345--361}
28281 @InProceedings{w-nakkc-91
28283 , title = {{A new approach to knock-knee channel routing}}
28284 , booktitle = {{Proceedings of the 2nd International Symposium on Algorithms (ISA'91)}}
28286 , publisher = pub-springer
28287 , series = ser-springer_lncs
28293 , author = WhitneyH
28294 , title = {{Non-Separable and Planar Graphs}}
28298 , pages = {339--338}
28303 @InProceedings{w-nwi-98
28305 , title = {{NicheWorks ? Interactive visualization of very large graphs}}
28306 , booktitle = {{Proceedings of the 5th International Symposium on Graph Drawing (GD'97)}}
28307 , location = "Rome, Italy"
28309 , pages = {403--414}
28310 , publisher = pub-springer
28311 , series = ser-springer_lncs
28312 , url = "http://www.springerlink.com/content/x7r71r316847/"
28318 , author = WhitneyH
28319 , title = {{On the Classification of Graphs}}
28321 , pages = {236--244}
28326 @Article{w-ortdc-93
28328 , title = {{Optimal Routing Through Dense Chanels}}
28329 , journal = j-ijcga
28331 , pages = {269--289}
28337 , author = WatkinsDS
28338 , title = {{{QR}-like Algorithms for Eigenvalue Problems}}
28346 , author = WaxmanBM
28347 , title = {{Routing of multipoint connections}}
28350 , pages = {1617--1622}
28355 @Article{w-sastp-93
28357 , title = {{Simple Algorithms for Steiner Trees and Paths Packing Problems in Planar Graphs}}
28358 , journal = j-cwi-qu
28360 , pages = {219--240}
28361 , url = "http://www.cwi.nl/publications/QUARTERLY/Quarter/V6-3-93.html"
28368 , title = {{Street Corner Society}}
28369 , booktitle = {{Street Corner Society}}
28370 , publisher = pub-ucp
28371 , url = "http://www.press.uchicago.edu/presssite/metadata.epl?mode=synopsis&bookkey=53397"
28375 @article{w-sdpbp-47
28377 , title = {{Structural Determination of Paraffin Boiling Points}}
28386 , title = {{{\"U}ber den Standort der Industrien}}
28387 , address = "T{\"u}bingen"
28388 , publisher = pub-mohr
28392 @InCollection{w-sp-01
28393 , author = WillhalmT
28394 , title = {{Software Packages}}
28395 , booktitle = {{Drawing Graphs: Methods and Models}}
28396 , isbn = "3-540-42062-2"
28397 , pages = {274--281}
28398 , pdf = "http://springerlink.metapress.com/content/kqyawf54r9p9y4hm/fulltext.pdf"
28399 , publisher = pub-springer
28400 , series = ser-springer_lncs
28401 , url = "http://springerlink.metapress.com/content/kqyawf54r9p9y4hm/"
28408 , title = {{Small worlds: The dynamics of networks between order and randomness}}
28409 , booktitle = {{Small worlds: The dynamics of networks between order and randomness}}
28410 , publisher = pub-pup
28415 , author = WilkinsonJH
28416 , title = {{The Algebraic Eigenvalue Problem}}
28417 , publisher = pub-cp
28422 , author = WarshallS
28423 , title = {{A Theorem on Boolean Matrices}}
28433 , title = {{The Emerging Field of Lipidomics}}
28436 , pages = {594--610}
28437 , pdf = "http://www.nature.com/nrd/journal/v4/n7/pdf/nrd1776.pdf"
28438 , url = "doi:10.1038/nrd1776"
28444 , author = WilliamsR
28445 , title = {{The Geometrical Foundation of Natural Structure: A Source Book of Design}}
28446 , booktitle = {{The Geometrical Foundation of Natural Structure: A Source Book of Design}}
28448 , publisher = pub-tdp
28452 @Article{wa-pypn-05
28453 , author = WuchtyS #and# AlmaasE
28454 , title = {{Peeling the Yeast Protein Network}}
28457 , pages = {444--449}
28458 , pdf = "http://doi.wiley.com/10.1002/pmic.200400962"
28463 @article{wb-bcmdg-94
28464 , author = WhiteDR #and# BorgattiSP
28465 , title = {{Betweenness Centrality Measures for Directed Graphs}}
28467 , pages = {335--346}
28472 @InProceedings{wblmww-edga-99
28473 , author = WeiheK #and# BrandesU #and# LiebersA #and# MuellerHannemannM #and# WagnerD #and# WillhalmT
28474 , title = {{Empirical Design of Geometric Algorithms}}
28475 , booktitle = {{Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG'99)}}
28477 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/blmwww-edga-99.pdf"
28478 , publisher = pub-acm
28479 , url = "http://portal.acm.org/citation.cfm?id=304893.304918"
28483 @InCollection{wc-jostl-07
28484 , author = WalshawC #and# CrossM
28485 , title = {{JOSTLE: Parallel Multilevel Graph-Partitioning Software -- An Overview}}
28486 , booktitle = {{Mesh Partitioning Techniques and Domain Decomposition Techniques}}
28488 , publisher = pub-ccl
28492 @InProceedings{wc-lappp-98
28493 , author = WadaK #and# ChenW
28494 , title = {{Linear Algorithms for a $k$-Partition Problem of Planar Graphs}}
28495 , booktitle = {{Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'98)}}
28496 , pages = {324--336}
28497 , publisher = pub-springer
28498 , series = ser-springer_lncs
28502 @Article{we-chacm-89
28503 , author = WilletP #and# El-HamdouchiA
28504 , title = {{Comparison of Hierarchic Agglomerative Clustering Methods for Document Retrieval}}
28507 , pages = {220--227}
28508 , url = "http://dx.doi.org/10.1093/comjnl/32.3.220"
28513 @misc{web:routeviews
28515 , title = {{University of Oregon Route Views Project}}
28516 , note = {web page; [Online at \url{http://routeviews.org/}; accessed 31-August-2007]}
28517 , url = "http://routeviews.org/"
28522 , author = WassermanS #and# FaustK
28523 , title = {{Social Network Analysis: Methods and Applications}}
28524 , publisher = pub-cup
28528 @InProceedings{wgw-ppsrs-06
28529 , author = WuYH #and# GuanLJ #and# WinterS
28530 , title = {{Peer-to-Peer Shared Ride Systems}}
28531 , booktitle = {{GeoSensor Networks}}
28533 , pages = {252--270}
28534 , pdf = "http://www.springerlink.com/content/x71ng3432m32271v/fulltext.pdf"
28535 , publisher = pub-springer
28536 , series = ser-springer_lncs
28537 , url = "http://www.springerlink.com/content/x71ng3432m32271v/"
28542 @InCollection{wgydkso-bsal-09
28543 , author = WheelockCE #and# GotoS #and# YetukuriL #and# DAlexandriFL #and# KlukasC #and# SchreiberF #and# OresicM
28544 , title = {{Bioinformatics Strategies for the Analysis of Lipids}}
28545 , booktitle = {{Lipidomics Volume 2: Methods and Protocols }}
28546 , pages = {339--368}
28547 , pdf = "http://www.springerlink.com/content/l0j8m4237h040225/fulltext.pdf"
28548 , publisher = pub-springer
28550 , url = "http://www.springerlink.com/content/l0j8m4237h040225/"
28555 @Article{wh-fcltp-04
28556 , author = WuF #and# HubermanBA
28557 , title = {{Finding communities in linear time: a physics approach}}
28561 , pages = {331--338}
28562 , pdf = "http://www.springerlink.com/content/h6jfb70vqxadydrm/fulltext.pdf"
28563 , url = "http://www.springerlink.com/content/h6jfb70vqxadydrm/"
28568 @misc{wiki:Gnutella
28569 , author = Wikipedia
28570 , title = {{Gnutella --- Wikipedia, the free encyclopedia}}
28571 , note = {[Online at \url{http://en.wikipedia.org/wiki/Gnutella}; accessed 31-August-2007]}
28572 , url = "http://en.wikipedia.org/wiki/Gnutella"
28576 @Article{wiw-mhgsm-93
28577 , author = WagnerD #and# IhlerE #and# WagnerF
28578 , title = {{Modeling Hypergraphs by Graphs with the Same Mincut Properties}}
28581 , pages = {171--175}
28586 @techreport{wj-iitg-02
28587 , author = WinickJ #and# JaminS
28588 , title = {{Inet-3.0: {I}nternet Topology Generator}}
28589 , institution = "EECS, University of Michigan"
28590 , number = {CSE-TR-456}
28591 , pdf = "http://topology.eecs.umich.edu/inet/inet-3.0.pdf"
28592 , url = "http://topology.eecs.umich.edu/inet/"
28596 @Article{wl-aogta-93
28597 , author = WuZ #and# LeahyR
28598 , title = {{An Optimal Graph Theoretic Approach to Data Clustering: Theory and its Application to Image Segmentation}}
28599 , journal = j-tpami
28601 , pages = {1101--1113}
28602 , url = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=244673"
28607 @InProceedings{wm-gcl-96
28608 , author = WangX #and# MiyamotoI
28609 , title = {{Generating Customized Layouts}}
28610 , booktitle = {{Proceedings of the 3rd International Symposium on Graph Drawing (GD'95)}}
28611 , location = "Passau, Germany"
28613 , pages = {504--515}
28614 , publisher = pub-springer
28615 , series = ser-springer_lncs
28616 , url = "http://gdea.informatik.uni-koeln.de/archive/00000232/"
28621 @Article{wm-vsnph-90
28622 , author = WagnerD #and# MuellerR
28623 , title = {{$\alpha$-Vertex Separator is NP-Hard Even for 3-Regular Graphs}}
28625 , pages = {291--293}
28626 , pdf = "http://www.springerlink.com/content/796647kp0v256403/fulltext.pdf"
28627 , url = "http://www.springerlink.com/content/796647kp0v256403/"
28632 @Article{wm-vsnph-91
28633 , author = WagnerD #and# MuellerR
28634 , title = {{{$\alpha$}-Vertex Separator is NP-Hard Even for 3-Regular Graphs}}
28635 , journal = j-comput
28636 , pages = {343--353}
28642 , author = WinterS #and# NittelS
28643 , title = {{Ad-hoc shared ride trip planning by mobile geosensor networks}}
28644 , journal = j-ijgis
28647 , pages = {899--916}
28648 , pdf = "http://www.informaworld.com/smpp/ftinterface~content=a758004880~fulltext=713240930"
28649 , url = "http://www.informaworld.com/smpp/content~content=a758004880~db=all"
28654 @Article{wn-amcag-93
28655 , author = WatanabeT #and# NakamuraA
28656 , title = {{A Minimum 3-Connectivity Augmentation of a Graph}}
28660 , pages = {91--128}
28665 @Article{wn-asag-90
28666 , author = WatanabeT #and# NakamuraA
28667 , title = {{A Smallest Augmentation to 3-connect a Graph}}
28670 , pages = {183--186}
28675 @article{wp-lmlrs-96
28676 , author = WassermanS #and# PattisonP
28677 , title = {{Logit Models and Logistic Regressions for Social Networks: I.~An Introduction to Markov Graphs and $p^{*}$}}
28679 , pages = {401--426}
28684 @InProceedings{wpswmt-sssgc-08
28685 , author = WangB #and# PhillipsJM #and# SchreiberR #and# WilkinsonD #and# MishraN #and# TarjanRE
28686 , title = {{Spatial Scan Statistics for Graph Clustering}}
28687 , booktitle = {{Proceedings of the 2008 SIAM International Conference on Data Mining}}
28688 , pages = {727--738}
28689 , pdf = "http://www.siam.org/proceedings/datamining/2008/dm08_66_WangPhillips.pdf"
28690 , publisher = pub-siam
28691 , url = "http://www.siam.org/proceedings/datamining/2008/dm08.php"
28696 , editor = WahlsterW #and# RafflerH
28697 , title = {{Forschen f{\"u}r die Internet-Gesellschaft: Trends, Technologien, Anwendungen. Trends und Handlungsempfehlungen 2008 des Feldafinger Kreises}}
28698 , pdf = "http://www.feldafinger-kreis.de/Feldafinger-Kreis_Studie_2008.pdf"
28699 , publisher = pub-fk
28703 @article{wr-gshnr-83
28704 , author = WhiteDR #and# ReitzKP
28705 , title = {{Graph and Semigroup Homomorphisms on Networks of Relations}}
28707 , pages = {193--234}
28712 @InProceedings{ws-aerin-03
28713 , author = WhiteS #and# SmythP
28714 , title = {{Algorithms for Estimating Relative Importance in Networks}}
28715 , booktitle = {{Proceedings of the nineth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining}}
28716 , url = "http://doi.acm.org/10.1145/956750.956782"
28721 , author = WattsDJ #and# StrogatzSH
28722 , title = {{Collective dynamics of 'small-world' networks}}
28723 , journal = j-nature
28726 , pages = {440--442}
28731 @article{ws-cdswn-98
28732 , author = WattsDJ #and# StrogatzSH
28733 , title = {{Collective Dynamics of ``Small-World'' Networks}}
28734 , journal = j-nature
28735 , pages = {440--442}
28740 @article{ws-cocn-03
28741 , author = WuchtyS #and# StadlerPF
28742 , title = {{Centers of complex networks}}
28749 @InProceedings{ws-scafc-05
28750 , author = WhiteS #and# SmythP
28751 , title = {{A Spectral Clustering Approach to Finding Communities in Graphs}}
28752 , booktitle = {{Proceedings of the fifth SIAM International Conference on Data Mining}}
28753 , pages = {274--285}
28754 , pdf = "http://www.siam.org/proceedings/datamining/2005/dm05_25whites.pdf"
28755 , publisher = pub-siam
28756 , url = "http://www.siam.org/proceedings/datamining/2005/dm05.php"
28760 @article{ws-trlml-00
28761 , author = WuK #and# SimonH
28762 , title = {{Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems}}
28763 , journal = j-sjmaa
28765 , pages = {602--616}
28771 , author = WakitaK #and# TsurumiT
28772 , title = {{Finding Community Structure in Mega-scale Social Networks}}
28774 , note = {Technical Report on arXiv}
28775 , url = "http://arxiv.org/abs/cs/0702048v1"
28779 @article{wt-mbcbcol-92
28780 , author = WestbrookJ #and# TarjanRE
28781 , title = {{Maintaining Bridge-Connected and Biconnected Components On-Line}}
28783 , pages = {433--464}
28788 @Article{ww-aeplt-92
28789 , author = WagnerD #and# WagnerF
28790 , title = {{An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem}}
28794 , url = "http://dx.doi.org/10.1016/0166-218X(92)90022-3"
28799 @Article{ww-agzop-91
28800 , author = WagnerD #and# WagnerF
28801 , title = {{A Generalization of the Zero-One Principle for Sorting Algorithms}}
28803 , pages = {265--273}
28804 , url = "http://dx.doi.org/10.1016/0166-218X(91)90050-7"
28809 @InProceedings{ww-alcvr-95
28810 , author = WeiheK #and# WagnerD
28811 , title = {{An animated library for combinatorial VLSI routing algorithms}}
28812 , booktitle = {{Proceedings of the 11th Annual ACM Symposium on Computational Geometry (SoCG'95)}}
28813 , pages = {428--429}
28814 , publisher = pub-acm
28819 , editor = WagnerD #and# WattenhoferR
28820 , title = {{Algorithms for Sensor and Ad Hoc Networks}}
28821 , booktitle = {{Algorithms for Sensor and Ad Hoc Networks}}
28822 , publisher = pub-springer
28823 , series = ser-springer_lncs
28824 , url = "http://www.springer.com/computer/communications/book/978-3-540-74990-5"
28829 @InProceedings{ww-bmcgb-93
28830 , author = WagnerD #and# WagnerF
28831 , title = {{Between Min Cut and Graph Bisection}}
28832 , address = "London, UK"
28833 , booktitle = {{Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS'93)}}
28834 , isbn = "3-540-57182-5"
28835 , pages = {744--750}
28836 , publisher = pub-springer
28837 , series = ser-springer_lncs
28842 @techreport{ww-ccao-07
28843 , author = WagnerS #and# WagnerD
28844 , title = {{Comparing Clusterings -- An Overview}}
28845 , institution = iti_wagner
28846 , number = {2006-04}
28847 , pdf = "http://i11www.ira.uka.de/extra/publications/ww-cco-06.pdf"
28848 , url = "http://digbib.ubka.uni-karlsruhe.de/volltexte/1000011477"
28852 @Article{ww-crudo-90
28853 , author = WagnerD #and# WagnerF
28854 , title = {{Channel Routing Under Different Optimization Criteria}}
28856 , pages = {295--305}
28861 @InProceedings{ww-dgsus-05
28862 , author = WagnerD #and# WillhalmT
28863 , title = {{Drawing Graphs to Speed Up Shortest-Path Computations}}
28864 , booktitle = {{Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX'05)}}
28866 , publisher = pub-siam
28870 @Article{ww-gsnpc-89
28871 , author = WagnerD #and# WagnerF
28872 , title = {{Graph Separation is NP-Complete}}
28874 , pages = {269--274}
28879 @InProceedings{ww-gsutf-03
28880 , author = WagnerD #and# WillhalmT
28881 , title = {{Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs}}
28882 , booktitle = {{Proceedings of the 11th Annual European Symposium on Algorithms (ESA'03)}}
28883 , pages = {776--787}
28884 , publisher = pub-springer
28885 , series = ser-springer_lncs
28890 @InProceedings{ww-ltaed-93
28891 , author = WagnerD #and# WeiheK
28892 , title = {{A linear time algorithm for edge-disjoint paths in planar graphs}}
28893 , booktitle = {{Proceedings of the 1st European Symposium on Algorithms (ESA'93)}}
28894 , pages = {744--750}
28895 , series = ser-springer_lncs
28900 @Article{ww-ltaed-95
28901 , author = WagnerD #and# WeiheK
28902 , title = {{A Linear-Time Algorithm for Edge-Disjoint Paths in Planar Graphs}}
28906 , pages = {135--150}
28907 , pdf = "http://www.springerlink.com/content/0m6542766n708351/fulltext.pdf"
28908 , url = "http://www.springerlink.com/content/0m6542766n708351/"
28913 @article{ww-sbdg-87
28914 , author = WangYJ #and# WongGY
28915 , title = {{Stochastic Blockmodels for Directed Graphs}}
28922 @InProceedings{ww-sutsp-07
28923 , author = WagnerD #and# WillhalmT
28924 , title = {{Speed-Up Techniques for Shortest-Path Computations}}
28925 , booktitle = {{Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)}}
28926 , note = {Invited Talk}
28928 , pdf = "http://i11www.ira.uka.de/extra/publications/ww-sutsp-07.pdf"
28929 , publisher = pub-springer
28930 , series = ser-springer_lncs
28935 @InProceedings{wwmz-docsn-08
28936 , author = WeiF #and# WangC #and# MaL #and# ZhouA
28937 , title = {{Detecting Overlapping Community Structures in Networks with Global Partition and Local Expansion}}
28938 , booktitle = {{Proceedings of the 10th Asia-Pacific Web Conference}}
28941 , pdf = "http://www.springerlink.com/content/k52h674032w2g31h/fulltext.pdf"
28942 , publisher = pub-springer
28943 , series = ser-springer_lncs
28944 , url = "http://www.springerlink.com/content/k52h674032w2g31h/"
28948 @InProceedings{wwz-dspc-04
28949 , author = WagnerD #and# WillhalmT #and# ZaroliagisC
28950 , title = {{Dynamic Shortest Path Containers}}
28951 , booktitle = {{Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'03)}}
28953 , pdf = "http://i11www.ilkd.uni-karlsruhe.de/algo/people/dwagner/papers/wwz-dspc-03.pdf"
28954 , series = ser-entcs
28959 @Article{wwz-gcesp-05
28960 , author = WagnerD #and# WillhalmT #and# ZaroliagisC
28961 , title = {{Geometric Containers for Efficient Shortest-Path Computation}}
28962 , journal = j-acm-ea
28969 %% --------------------------------------------------------------
28971 @Article{xckp-fdsew-12
28972 , author = XieL #and# ChoiD #and# KarS #and# PoorH
28973 , title = {{Fully Distributed State Estimation for Wide-Area Monitoring Systems}}
28974 , journal = j-ieeetsg
28977 , pages = {1154--1169}
28982 @Article{xlhzl-ad-07
28983 , author = XuMH #and# LiuYQ #and# HuangQL #and# ZhangYX #and# LuanGF
28984 , title = {{An improved Dijkstra’s shortest path algorithm for sparse network}}
28988 , pages = {247--254}
28993 @Article{xox-mstge-01
28994 , author = XuY #and# OlmanV #and# XuD
28995 , title = {{Minimum Spanning Trees for Gene Expression Data Clustering}}
29002 @InProceedings{xrcgbge-awsns-04
29003 , author = XuN #and# RangwalaS #and# ChintalapudiKK #and# GanesanD #and# BroadA #and# GovindanR #and# EstrinD
29004 , title = {{A Wireless Sensor Network for Structural Monitoring}}
29005 , booktitle = {{2nd international conference on Embedded networked sensor systems (SenSys'04)}}
29007 , publisher = pub-acm
29008 , url = "http://doi.acm.org/10.1145/1031495.1031498"
29012 @Article{xtp-fcscn-07
29013 , author = XuG #and# TsokaS #and# PapageorgiouLG
29014 , title = {{Finding Community Structures in Complex Networks using Mixed Integer Optimisation }}
29018 , pages = {231--239}
29019 , pdf = "http://www.springerlink.com/content/x2962u53427q782r/fulltext.pdf"
29020 , url = "http://www.springerlink.com/content/X2962U53427Q782R/"
29025 @InProceedings{xwnh-smize-09
29026 , author = XingX #and# WardenT #and# NicolaiT #and# HerzogO
29027 , title = {{SMIZE: A spontaneous Ride-Sharing System for Individual Urban Transit}}
29028 , booktitle = {{Proceedings of the 7th German Conference on Multiagent System Technologies (MATES 2009)}}
29030 , pages = {165--176}
29031 , pdf = "http://www.springerlink.com/content/4734714336082j0r/fulltext.pdf"
29032 , publisher = pub-springer
29033 , series = ser-springer_lncs
29034 , url = "http://www.springerlink.com/content/4734714336082j0r/"
29039 %% --------------------------------------------------------------
29041 @InProceedings{y-amslc-10
29042 , author = YanagisawaH
29043 , title = {{A Multi-Source Label-Correcting Algorithm for the All-Pairs Shortest Paths Problem}}
29044 , booktitle = {{24th International Parallel and Distributed Processing Symposium (IPDPS'10)}}
29046 , publisher = pub-ics
29050 @Article{y-fkslp-71
29052 , title = {{Finding the K Shortest Loopless Paths in a Network}}
29055 , pages = {712--716}
29060 @InProceedings{yags-nsdaa-06
29061 , author = YaoY #and# AlamSMN #and# GehrkeJ #and# ServettoSD
29062 , title = {{Network Scheduling for Data Archiving Applications in Sensor Networks}}
29063 , booktitle = {{Proceedings of the 3rd Workshop on Data Management for Sensor Networks (DMSN'06)}}
29065 , publisher = pub-acm
29066 , url = "http://doi.acm.org/10.1145/1315903.1315909"
29070 @InProceedings{ydxzw-pa-12
29071 , author = YanX #and# DongZY #and# XuZ #and# ZhangR #and# WongKP
29072 , title = {{Power system transient stability-constrained optimal power flow: A comprehensive review}}
29073 , booktitle = {{Power and Energy Society General Meeting}}
29075 , publisher = pub-ieee
29081 , title = {{{yEd} - Java Graph Editor}}
29082 , url = "http://www.yworks.com/en/products_yed_about.html"
29088 , title = {{yFiles for Java}}
29089 , url = "http://www.yworks.com/en/products_yfiles_about.html"
29093 @InProceedings{yhwl-aodaa-12
29094 , author = YuD #and# HuaQ #and# WangY #and# LauFC
29095 , title = {{An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks}}
29096 , booktitle = {{Proceedings of the 2012 International Conference on Distributed Computing in Sensor Systems}}
29097 , pages = {132--139}
29098 , publisher = pub-ics
29102 @Article{yhy-acacd-08
29103 , author = YeZ #and# HuS #and# YuJ
29104 , title = {{Adaptive Clustering Algorithm for Community Detection in Complex Networks}}
29107 , url = "http://link.aps.org/doi/10.1103/PhysRevE.78.046115 "
29112 @InProceedings{yl-a-12
29113 , author = YuHai #and# LuF
29114 , title = {{Advanced multi-modal routing approach for pedestrians}}
29115 , booktitle = {{2nd International Conference on Consumer Electronics, Communications and Networks}}
29116 , pages = {2349--2352}
29120 @InProceedings{ysp-ossp-
29121 , author = YaoS #and# ShengC #and# PeiP
29122 , title = {{On k-Skip Shortest Paths}}
29123 , booktitle = {{Proceedings of the 2011 ACM SIGMOD international conference on Management of data (SIGMOD'11)}}
29124 , pages = {421--432}
29125 , publisher = pub-acm
29129 @InProceedings{yvwfvs-crwdm-05
29130 , author = YenL #and# VanvyveD #and# WoutersF #and# FoussF #and# VerleysenM #and# SaerensM
29131 , title = {{Clustering using a Random Walk based Distance Measure}}
29132 , booktitle = {{Proceedings of the 13th European Symposium on Artifical Neural Networks}}
29133 , pages = {317--324}
29134 , pdf = "http://www.dice.ucl.ac.be/Proceedings/esann/esannpdf/es2005-105.pdf"
29135 , url = "http://www.dice.ucl.ac.be/esann/proceedings/papers.php?ann=2005"
29139 @InProceedings{ywhl-ddcpm-11
29140 , author = YuD #and# WangY #and# HuaQ #and# LauFC
29141 , title = {{Distributed ($\Delta$ + 1) Coloring in the Physical Model}}
29142 , booktitle = {{Proceedings of the 7th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'11)}}
29143 , pages = {145--160}
29144 , publisher = pub-springer
29145 , series = ser-springer_lncs
29149 @InProceedings{ywhl-dlbap-11
29150 , author = YuD #and# WangY #and# HuaQ #and# LauFC
29151 , title = {{Distributed Local Broadcasting Algorithms in the Physical Interference Model}}
29152 , booktitle = {{Proceedings of the 2011 International Conference on Distributed Computing in Sensor Systems}}
29154 , publisher = pub-ics
29158 %% --------------------------------------------------------------
29160 @techreport{z-anhma-69
29161 , author = ZobristAL
29162 , title = {{A New Hashing Method with Application for Game Playing}}
29163 , institution = "Computer Sciences Department, University of Wisconsin, Madison"
29165 , pdf = "https://www.cs.wisc.edu/techreports/1970/TR88.pdf"
29169 @mastersthesis{z-apga-08
29171 , title = {{Algorithms for Planar Graph Augmentation}}
29172 , school = "TU Dortmund University"
29176 @article{z-apspbsrmm-00
29178 , title = {{All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication}}
29179 , journal = "Electronic Coll"
29181 , url = "citeseer.ist.psu.edu/article/zwick00all.html"
29186 @InProceedings{z-e-01
29188 , title = {{Exact and approximate distances in graphs - a survey}}
29189 , booktitle = {{Proceedings of the 9th Annual European Symposium on Algorithms (ESA'01)}}
29191 , series = ser-springer_lncs
29196 @mastersthesis{z-ebj-12
29197 , author = ZuendorfT
29198 , title = {{Effiziente Berechnung guter Joggingrouten}}
29200 , school = "Karlsruhe Institute of Technology"
29201 , type = {Bachelor Thesis}
29207 , title = {{Fuzzy Logic}}
29208 , journal = j-ieeec
29217 , title = {{Fuzzy Sets}}
29220 , pages = {338--353}
29221 , pdf = "http://www-bisc.cs.berkeley.edu/Zadeh-1965.pdf"
29226 @phdthesis{z-gcsg-07
29227 , author = ZickfeldF
29228 , title = {{Geometric and Combinatorial Structures on Graphs}}
29229 , school = "Fakult{\"a}t II -- Mathematik und Naturwissenschaften, Technische Universit{\"a}t Berlin"
29233 @article{z-gmddg-71
29235 , title = {{Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters}}
29242 @article{z-ifmcf-77
29243 , author = ZacharyWW
29244 , title = {{An Information Flow Model for Conflict and Fission in Small Groups}}
29246 , pages = {452--473}
29252 , author = ZieglerG
29253 , title = {{Lectures on Polytopes}}
29254 , booktitle = {{Lectures on Polytopes}}
29255 , publisher = pub-springer
29256 , series = ser-springer_gtm
29261 , author = ZelinkaB
29262 , title = {{Medians and Peripherians Tree}}
29263 , journal = "Archivum Mathem"
29271 , title = {{Network landscape from a Brownian particle's perspective}}
29274 , url = "http://link.aps.org/doi/10.1103/PhysRevE.67.041908"
29281 , title = {{Routenkompression f\"ur hybride Routenplanung}}
29282 , note = {Bachelor thesis, in German.}
29283 , school = "Karlsruhe Institute of Technology (KIT)"
29287 @article{z-teeka-72
29289 , title = {{Theoretical Efficiency of the Edmonds-Karp Algorithm for Computing Maximal Flows}}
29293 , pages = {184--192}
29298 @Article{za-aipmt-08
29299 , author = ZografosKG #and# AndroutsopoulosKN
29300 , title = {{Algorithms for Itinerary Planning in Multi-modal Transportation Networks}}
29301 , journal = j-ieeetits
29308 @Article{zas-daopi-09
29309 , author = ZografosKG #and# AndroutsopoulosKN #and# SpitadakisV
29310 , title = {{Design and Assessment of an Online Passenger Information System for Integrated Multimodal Trip Planning}}
29311 , journal = j-ieeetits
29314 , pages = {311--323}
29319 @InProceedings{zb-neats-07
29320 , author = ZhaH #and# BuchheimC
29321 , title = {{A New Exact Algorithm for the Two-Sided Crossing Minimization Problem}}
29322 , booktitle = {{Proceedings of the 1st International Conference on Combinatorial Optimization and Applications}}
29323 , pages = {301--310}
29324 , publisher = pub-springer
29325 , series = ser-springer_lncs
29326 , url = "http://www.springerlink.com/content/x720282rw8803001/"
29331 @Article{zh-cotta-05
29332 , author = ZhangHu #and# HeXi
29333 , title = {{Canonical Ordering Trees and Their Applications in Graph Drawing}}
29337 , pages = {321--344}
29342 @InProceedings{zh-cvrsl-03
29343 , author = ZhangHu #and# HeXi
29344 , title = {{Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs}}
29345 , booktitle = {{Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS'03)}}
29346 , pages = {493--504}
29347 , publisher = pub-springer
29348 , series = ser-springer_lncs
29353 @Article{zh-ivrpg-05
29354 , author = ZhangHu #and# HeXi
29355 , title = {{Improved Visibility Representation of Plane Graphs}}
29362 @InProceedings{zh-ntbvr-05
29363 , author = ZhangHu #and# HeXi
29364 , title = {{New Theoretical Bounds of Visibility Representation of Plane Graphs}}
29365 , booktitle = {{Proceedings of the 12th International Symposium on Graph Drawing (GD'04)}}
29367 , pages = {425--430}
29368 , publisher = pub-springer
29369 , series = ser-springer_lncs
29374 @InProceedings{zh-oopt-07
29375 , author = ZhangHu #and# HeXi
29376 , title = {{Optimal $st$-Orientations for Plane Triangulations}}
29377 , booktitle = {{Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07)}}
29378 , location = "Portland, USA"
29380 , pages = {296--305}
29381 , publisher = pub-springer
29382 , series = ser-springer_lncs
29386 @Article{zh-vrpgc-05
29387 , author = ZhangHu #and# HeXi
29388 , title = {{Visibility Representation of Plane Graphs via Canonical Ordering Tree}}
29398 , author = ZehaviA #and# ItaiA
29399 , title = {{Three Tree-Paths}}
29402 , pages = {175--188}
29407 @Article{zmw-itanm-05
29408 , author = ZivE #and# MiddendorfM #and# WigginsCH
29409 , title = {{Information-Theoretic Approach to Network Modularity}}
29413 , url = "http://link.aps.org/abstract/PRE/v71/e046117"
29419 , author = BomanE #and# DevineK #and# FiskCJ #and# HeaphyR #and# HendricksonB #and# LeungV #and# VaughanC #and# CatalyurekU #and# BozdagD #and# MitchellW
29420 , title = {{Zoltan: Data-Management Services for Parallel Applications, homepage}}
29421 , note = {\url{http://www.cs.sandia.gov/Zoltan}}
29422 , url = "http://www.cs.sandia.gov/Zoltan"