callback( { "result":{ "query":":facetid:toc:\"db/journals/jgaa/jgaa18.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"68.26" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"31", "@dc":"31", "@oc":"31", "@id":"43468066", "text":":facetid:toc:db/journals/jgaa/jgaa18.bht" } }, "hits":{ "@total":"31", "@computed":"31", "@sent":"30", "@first":"0", "hit":[{ "@score":"1", "@id":"3756923", "info":{"authors":{"author":[{"@pid":"93/1187","text":"Md. Shafiul Alam"},{"@pid":"20/1128","text":"Asish Mukhopadhyay"}]},"title":"More on Generalized Jewels and the Point Placement Problem.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"1","pages":"133-173","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/AlamM14","doi":"10.7155/JGAA.00317","ee":"https://doi.org/10.7155/jgaa.00317","url":"https://dblp.org/rec/journals/jgaa/AlamM14"}, "url":"URL#3756923" }, { "@score":"1", "@id":"3756924", "info":{"authors":{"author":[{"@pid":"19/676","text":"Patrizio Angelini"},{"@pid":"e/DEppstein","text":"David Eppstein"},{"@pid":"09/2639","text":"Fabrizio Frati"},{"@pid":"k/MichaelKaufmann1","text":"Michael Kaufmann 0001"},{"@pid":"17/1855","text":"Sylvain Lazard"},{"@pid":"32/4396","text":"Tamara Mchedlidze"},{"@pid":"24/2749","text":"Monique Teillaud"},{"@pid":"w/AlexanderWolff","text":"Alexander Wolff 0001"}]},"title":"Universal Point Sets for Drawing Planar Graphs with Circular Arcs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"313-324","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/AngeliniEFKLMTW14","doi":"10.7155/JGAA.00324","ee":"https://doi.org/10.7155/jgaa.00324","url":"https://dblp.org/rec/journals/jgaa/AngeliniEFKLMTW14"}, "url":"URL#3756924" }, { "@score":"1", "@id":"3756925", "info":{"authors":{"author":[{"@pid":"67/8725","text":"Karin Arikushi"},{"@pid":"t/CsabaDToth","text":"Csaba D. Tóth"}]},"title":"Crossing Angles of Geometric Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"401-420","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/ArikushiT14","doi":"10.7155/JGAA.00329","ee":"https://doi.org/10.7155/jgaa.00329","url":"https://dblp.org/rec/journals/jgaa/ArikushiT14"}, "url":"URL#3756925" }, { "@score":"1", "@id":"3756926", "info":{"authors":{"author":[{"@pid":"04/10044","text":"Michael J. Bannister"},{"@pid":"133/8283","text":"Zhanpeng Cheng"},{"@pid":"133/8627","text":"William E. Devanny"},{"@pid":"e/DEppstein","text":"David Eppstein"}]},"title":"Superpatterns and Universal Point Sets.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"2","pages":"177-209","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/BannisterCDE14","doi":"10.7155/JGAA.00318","ee":"https://doi.org/10.7155/jgaa.00318","url":"https://dblp.org/rec/journals/jgaa/BannisterCDE14"}, "url":"URL#3756926" }, { "@score":"1", "@id":"3756927", "info":{"authors":{"author":[{"@pid":"06/1457","text":"Michael A. Bekos"},{"@pid":"k/MichaelKaufmann1","text":"Michael Kaufmann 0001"},{"@pid":"77/9125-1","text":"Robert Krug 0001"},{"@pid":"20/3554","text":"Thorsten Ludwig"},{"@pid":"n/StefanNaher","text":"Stefan Näher"},{"@pid":"96/10619","text":"Vincenzo Roselli"}]},"title":"Slanted Orthogonal Drawings: Model, Algorithms and Evaluations.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"459-489","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Bekos0KLNR14","doi":"10.7155/JGAA.00332","ee":"https://doi.org/10.7155/jgaa.00332","url":"https://dblp.org/rec/journals/jgaa/Bekos0KLNR14"}, "url":"URL#3756927" }, { "@score":"1", "@id":"3756928", "info":{"authors":{"author":[{"@pid":"64/2094","text":"Gregor Betz"},{"@pid":"94/7963","text":"Andreas Gemsa"},{"@pid":"159/2384","text":"Christof Mathies"},{"@pid":"99/44","text":"Ignaz Rutter"},{"@pid":"w/DorotheaWagner","text":"Dorothea Wagner"}]},"title":"Column-Based Graph Layouts.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"5","pages":"677-708","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/BetzGMRW14","doi":"10.7155/JGAA.00341","ee":"https://doi.org/10.7155/jgaa.00341","url":"https://dblp.org/rec/journals/jgaa/BetzGMRW14"}, "url":"URL#3756928" }, { "@score":"1", "@id":"3756929", "info":{"authors":{"author":{"@pid":"b/FJBrandenburg","text":"Franz J. Brandenburg"}},"title":"1-Visibility Representations of 1-Planar Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"421-438","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Brandenburg14","doi":"10.7155/JGAA.00330","ee":"https://doi.org/10.7155/jgaa.00330","url":"https://dblp.org/rec/journals/jgaa/Brandenburg14"}, "url":"URL#3756929" }, { "@score":"1", "@id":"3756930", "info":{"authors":{"author":[{"@pid":"71/9960","text":"Till Bruckdorfer"},{"@pid":"k/MichaelKaufmann1","text":"Michael Kaufmann 0001"},{"@pid":"46/10267","text":"Fabrizio Montecchiani"}]},"title":"1-Bend Orthogonal Partial Edge Drawing.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"1","pages":"111-131","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/BruckdorferKM14","doi":"10.7155/JGAA.00316","ee":"https://doi.org/10.7155/jgaa.00316","url":"https://dblp.org/rec/journals/jgaa/BruckdorferKM14"}, "url":"URL#3756930" }, { "@score":"1", "@id":"3756931", "info":{"authors":{"author":[{"@pid":"01/8031","text":"Edith Brunel"},{"@pid":"94/7963","text":"Andreas Gemsa"},{"@pid":"50/3558","text":"Marcus Krug"},{"@pid":"99/44","text":"Ignaz Rutter"},{"@pid":"w/DorotheaWagner","text":"Dorothea Wagner"}]},"title":"Generalizing Geometric Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"1","pages":"35-76","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/BrunelGKRW14","doi":"10.7155/JGAA.00314","ee":"https://doi.org/10.7155/jgaa.00314","url":"https://dblp.org/rec/journals/jgaa/BrunelGKRW14"}, "url":"URL#3756931" }, { "@score":"1", "@id":"3756932", "info":{"authors":{"author":[{"@pid":"53/3104","text":"Peter Damaschke"},{"@pid":"43/2743","text":"Olof Mogren"}]},"title":"Editing Simple Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"4","pages":"557-576","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/DamaschkeM14","doi":"10.7155/JGAA.00337","ee":"https://doi.org/10.7155/jgaa.00337","url":"https://dblp.org/rec/journals/jgaa/DamaschkeM14"}, "url":"URL#3756932" }, { "@score":"1", "@id":"3756933", "info":{"authors":{"author":[{"@pid":"62/8086","text":"Carola Doerr"},{"@pid":"119/4835","text":"G. Ramakrishna"},{"@pid":"50/430","text":"Jens M. Schmidt"}]},"title":"Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"325-346","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/DoerrRS14","doi":"10.7155/JGAA.00325","ee":"https://doi.org/10.7155/jgaa.00325","url":"https://dblp.org/rec/journals/jgaa/DoerrRS14"}, "url":"URL#3756933" }, { "@score":"1", "@id":"3756934", "info":{"authors":{"author":{"@pid":"e/DEppstein","text":"David Eppstein"}},"title":"Drawing Arrangement Graphs In Small Grids, Or How To Play Planarity.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"2","pages":"211-231","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Eppstein14","doi":"10.7155/JGAA.00319","ee":"https://doi.org/10.7155/jgaa.00319","url":"https://dblp.org/rec/journals/jgaa/Eppstein14"}, "url":"URL#3756934" }, { "@score":"1", "@id":"3756935", "info":{"authors":{"author":[{"@pid":"e/WSEvans","text":"William S. Evans"},{"@pid":"k/MichaelKaufmann1","text":"Michael Kaufmann 0001"},{"@pid":"l/WilliamJLenhart","text":"William J. Lenhart"},{"@pid":"32/4396","text":"Tamara Mchedlidze"},{"@pid":"27/3804","text":"Stephen K. Wismath"}]},"title":"Bar 1-Visibility Graphs vs. other Nearly Planar Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"5","pages":"721-739","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Evans0LMW14","doi":"10.7155/JGAA.00343","ee":"https://doi.org/10.7155/jgaa.00343","url":"https://dblp.org/rec/journals/jgaa/Evans0LMW14"}, "url":"URL#3756935" }, { "@score":"1", "@id":"3756936", "info":{"authors":{"author":{"@pid":"09/2980","text":"Stefan Felsner"}},"title":"Exploiting Air-Pressure to Map Floorplans on Point Sets.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"2","pages":"233-252","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Felsner14","doi":"10.7155/JGAA.00320","ee":"https://doi.org/10.7155/jgaa.00320","url":"https://dblp.org/rec/journals/jgaa/Felsner14"}, "url":"URL#3756936" }, { "@score":"1", "@id":"3756937", "info":{"authors":{"author":{"@pid":"09/2639","text":"Fabrizio Frati"}},"title":"Multilayer Drawings of Clustered Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"5","pages":"633-675","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Frati14","doi":"10.7155/JGAA.00340","ee":"https://doi.org/10.7155/jgaa.00340","url":"https://dblp.org/rec/journals/jgaa/Frati14"}, "url":"URL#3756937" }, { "@score":"1", "@id":"3756938", "info":{"authors":{"author":[{"@pid":"09/2639","text":"Fabrizio Frati"},{"@pid":"k/MichaelKaufmann1","text":"Michael Kaufmann 0001"},{"@pid":"18/2119","text":"János Pach"},{"@pid":"t/CsabaDToth","text":"Csaba D. Tóth"},{"@pid":"w/DavidRWood","text":"David R. Wood"}]},"title":"On the Upward Planarity of Mixed Plane Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"2","pages":"253-279","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/FratiKPTW14","doi":"10.7155/JGAA.00322","ee":"https://doi.org/10.7155/jgaa.00322","url":"https://dblp.org/rec/journals/jgaa/FratiKPTW14"}, "url":"URL#3756938" }, { "@score":"1", "@id":"3756939", "info":{"authors":{"author":[{"@pid":"53/3048","text":"Dániel Gerbner"},{"@pid":"01/1345","text":"Viola Mészáros"},{"@pid":"56/6527","text":"Dömötör Pálvölgyi"},{"@pid":"117/6036","text":"Alexey Pokrovskiy"},{"@pid":"r/GunterRote","text":"Günter Rote"}]},"title":"Advantage in the discrete Voronoi game.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"439-457","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/GerbnerMPPR14","doi":"10.7155/JGAA.00331","ee":"https://doi.org/10.7155/jgaa.00331","url":"https://dblp.org/rec/journals/jgaa/GerbnerMPPR14"}, "url":"URL#3756939" }, { "@score":"1", "@id":"3756940", "info":{"authors":{"author":[{"@pid":"61/3357","text":"Marina Groshaus"},{"@pid":"17/5496","text":"Francisco J. Soulignac"},{"@pid":"120/7579","text":"Pablo Terlisky"}]},"title":"Star and Biclique Coloring and Choosability.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"347-383","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/GroshausST14","doi":"10.7155/JGAA.00326","ee":"https://doi.org/10.7155/jgaa.00326","url":"https://dblp.org/rec/journals/jgaa/GroshausST14"}, "url":"URL#3756940" }, { "@score":"1", "@id":"3756941", "info":{"authors":{"author":[{"@pid":"g/JiongGuo","text":"Jiong Guo"},{"@pid":"125/2884","text":"Yash Raj Shrestha"}]},"title":"Complexity of Disjoint Π-Vertex Deletion for Disconnected Forbidden Subgraphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"4","pages":"603-631","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/GuoS14","doi":"10.7155/JGAA.00339","ee":"https://doi.org/10.7155/jgaa.00339","url":"https://dblp.org/rec/journals/jgaa/GuoS14"}, "url":"URL#3756941" }, { "@score":"1", "@id":"3756942", "info":{"authors":{"author":[{"@pid":"64/11260","text":"Yuya Higashikawa"},{"@pid":"g/MordecaiJGolin","text":"Mordecai J. Golin"},{"@pid":"55/4413","text":"Naoki Katoh"}]},"title":"Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"4","pages":"539-555","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/HigashikawaGK14","doi":"10.7155/JGAA.00336","ee":"https://doi.org/10.7155/jgaa.00336","url":"https://dblp.org/rec/journals/jgaa/HigashikawaGK14"}, "url":"URL#3756942" }, { "@score":"1", "@id":"3756943", "info":{"authors":{"author":[{"@pid":"92/498-1","text":"Yifan Hu 0001"},{"@pid":"98/2841","text":"Stephen G. Kobourov"},{"@pid":"03/9126","text":"Sankar Veeramoni"}]},"title":"Embedding, Clustering and Coloring for Dynamic Maps.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"1","pages":"77-109","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/HuKV14","doi":"10.7155/JGAA.00315","ee":"https://doi.org/10.7155/jgaa.00315","url":"https://dblp.org/rec/journals/jgaa/HuKV14"}, "url":"URL#3756943" }, { "@score":"1", "@id":"3756944", "info":{"authors":{"author":[{"@pid":"j/DavidPokrassJacobs","text":"David Pokrass Jacobs"},{"@pid":"49/299","text":"Vilmar Trevisan"},{"@pid":"159/2256","text":"Fernando Tura"}]},"title":"Computing the Characteristic Polynomial of Threshold Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"5","pages":"709-719","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/JacobsTT14","doi":"10.7155/JGAA.00342","ee":"https://doi.org/10.7155/jgaa.00342","url":"https://dblp.org/rec/journals/jgaa/JacobsTT14"}, "url":"URL#3756944" }, { "@score":"1", "@id":"3756945", "info":{"authors":{"author":[{"@pid":"97/8178","text":"Nils M. Kriege"},{"@pid":"m/PetraMutzel","text":"Petra Mutzel"},{"@pid":"139/8219","text":"Till Schäfer"}]},"title":"Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"4","pages":"577-602","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/KriegeMS14","doi":"10.7155/JGAA.00338","ee":"https://doi.org/10.7155/jgaa.00338","url":"https://dblp.org/rec/journals/jgaa/KriegeMS14"}, "url":"URL#3756945" }, { "@score":"1", "@id":"3756946", "info":{"authors":{"author":[{"@pid":"56/3840","text":"Zhentao Li"},{"@pid":"44/2302","text":"Manikandan Narayanan"},{"@pid":"v/AdrianVetta","text":"Adrian Vetta"}]},"title":"The Complexity of the Simultaneous Cluster Problem.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"1","pages":"1-34","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/LiNV14","doi":"10.7155/JGAA.00313","ee":"https://doi.org/10.7155/jgaa.00313","url":"https://dblp.org/rec/journals/jgaa/LiNV14"}, "url":"URL#3756946" }, { "@score":"1", "@id":"3756947", "info":{"authors":{"author":[{"@pid":"l/ALopezOrtiz","text":"Alejandro López-Ortiz"},{"@pid":"30/1209","text":"Jazmín Romero"}]},"title":"Parameterized Algorithms for the H-Packing with t-Overlap Problem.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"4","pages":"515-538","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Lopez-OrtizR14","doi":"10.7155/JGAA.00335","ee":"https://doi.org/10.7155/jgaa.00335","url":"https://dblp.org/rec/journals/jgaa/Lopez-OrtizR14"}, "url":"URL#3756947" }, { "@score":"1", "@id":"3756948", "info":{"authors":{"author":[{"@pid":"69/6852","text":"Ruy Fabila Monroy"},{"@pid":"64/380","text":"Jorge López"}]},"title":"Computational search of small point sets with small rectilinear crossing number.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"393-399","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/MonroyL14","doi":"10.7155/JGAA.00328","ee":"https://doi.org/10.7155/jgaa.00328","url":"https://dblp.org/rec/journals/jgaa/MonroyL14"}, "url":"URL#3756948" }, { "@score":"1", "@id":"3756949", "info":{"authors":{"author":[{"@pid":"p/SudebkumarPrasantPal","text":"Sudebkumar Prasant Pal"},{"@pid":"74/5752","text":"Kunihiko Sadakane"}]},"title":"Guest Editors' Foreword.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"4","pages":"491-492","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/PalS14","doi":"10.7155/JGAA.00333","ee":"https://doi.org/10.7155/jgaa.00333","url":"https://dblp.org/rec/journals/jgaa/PalS14"}, "url":"URL#3756949" }, { "@score":"1", "@id":"3756950", "info":{"authors":{"author":[{"@pid":"38/1994","text":"Bhawani Sankar Panda"},{"@pid":"139/8220","text":"Arti Pandey"}]},"title":"Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"4","pages":"493-513","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/PandaP14","doi":"10.7155/JGAA.00334","ee":"https://doi.org/10.7155/jgaa.00334","url":"https://dblp.org/rec/journals/jgaa/PandaP14"}, "url":"URL#3756950" }, { "@score":"1", "@id":"3756951", "info":{"authors":{"author":{"@pid":"p/HelenCPurchase","text":"Helen C. Purchase"}},"title":"A healthy critical attitude: Revisiting the results of a graph drawing study.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"2","pages":"281-311","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/Purchase14","doi":"10.7155/JGAA.00323","ee":"https://doi.org/10.7155/jgaa.00323","url":"https://dblp.org/rec/journals/jgaa/Purchase14"}, "url":"URL#3756951" }, { "@score":"1", "@id":"3756952", "info":{"authors":{"author":[{"@pid":"02/4233","text":"Céline Scornavacca"},{"@pid":"53/5495","text":"Leo van Iersel"},{"@pid":"31/4697","text":"Steven Kelk"},{"@pid":"67/4063","text":"David Bryant"}]},"title":"The agreement problem for unrooted phylogenetic trees is FPT.","venue":"J. Graph Algorithms Appl.","volume":"18","number":"3","pages":"385-392","year":"2014","type":"Journal Articles","access":"open","key":"journals/jgaa/ScornavaccaIKB14","doi":"10.7155/JGAA.00327","ee":"https://doi.org/10.7155/jgaa.00327","url":"https://dblp.org/rec/journals/jgaa/ScornavaccaIKB14"}, "url":"URL#3756952" } ] } } } )