callback( { "result":{ "query":":facetid:toc:\"db/journals/jgaa/jgaa13.bht\"", "status":{ "@code":"200", "text":"OK" }, "time":{ "@unit":"msecs", "text":"194.48" }, "completions":{ "@total":"1", "@computed":"1", "@sent":"1", "c":{ "@sc":"22", "@dc":"22", "@oc":"22", "@id":"43468061", "text":":facetid:toc:db/journals/jgaa/jgaa13.bht" } }, "hits":{ "@total":"22", "@computed":"22", "@sent":"22", "@first":"0", "hit":[{ "@score":"1", "@id":"5060807", "info":{"authors":{"author":[{"@pid":"48/3770","text":"Sébastien Angibaud"},{"@pid":"14/796","text":"Guillaume Fertin"},{"@pid":"17/6385","text":"Irena Rusu"},{"@pid":"42/2338","text":"Annelyse Thévenin"},{"@pid":"42/3622","text":"Stéphane Vialette"}]},"title":"On the Approximability of Comparing Genomes with Duplicates.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"1","pages":"19-53","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/AngibaudFRTV09","doi":"10.7155/JGAA.00175","ee":"https://doi.org/10.7155/jgaa.00175","url":"https://dblp.org/rec/journals/jgaa/AngibaudFRTV09"}, "url":"URL#5060807" }, { "@score":"1", "@id":"5060808", "info":{"authors":{"author":[{"@pid":"b/GiuseppeDiBattista","text":"Giuseppe Di Battista"},{"@pid":"09/2639","text":"Fabrizio Frati"}]},"title":"Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"3","pages":"349-378","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/BattistaF09","doi":"10.7155/JGAA.00191","ee":"https://doi.org/10.7155/jgaa.00191","url":"https://dblp.org/rec/journals/jgaa/BattistaF09"}, "url":"URL#5060808" }, { "@score":"1", "@id":"5060809", "info":{"authors":{"author":[{"@pid":"18/2611","text":"Marc Benkert"},{"@pid":"h/HermanJHaverkort","text":"Herman J. Haverkort"},{"@pid":"11/1218","text":"Moritz Kroll"},{"@pid":"41/4420","text":"Martin Nöllenburg"}]},"title":"Algorithms for Multi-Criteria Boundary Labeling.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"3","pages":"289-317","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/BenkertHKN09","doi":"10.7155/JGAA.00189","ee":"https://doi.org/10.7155/jgaa.00189","url":"https://dblp.org/rec/journals/jgaa/BenkertHKN09"}, "url":"URL#5060809" }, { "@score":"1", "@id":"5060810", "info":{"authors":{"author":[{"@pid":"99/4898","text":"Cédric Bentz"},{"@pid":"83/2295","text":"Marie-Christine Costa"},{"@pid":"80/6595","text":"Christophe Picouleau"},{"@pid":"10/6376","text":"Bernard Ries"},{"@pid":"w/DominiquedeWerra","text":"Dominique de Werra"}]},"title":"Degree-constrained edge partitioning in graphs arising from discrete tomography.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"99-118","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/BentzCPRW09","doi":"10.7155/JGAA.00178","ee":"https://doi.org/10.7155/jgaa.00178","url":"https://dblp.org/rec/journals/jgaa/BentzCPRW09"}, "url":"URL#5060810" }, { "@score":"1", "@id":"5060811", "info":{"authors":{"author":[{"@pid":"94/2509","text":"Daniel Berend"},{"@pid":"07/1868","text":"Shira Zucker"}]},"title":"The Black-and-White Coloring Problem on Trees.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"133-152","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/BerendZ09","doi":"10.7155/JGAA.00180","ee":"https://doi.org/10.7155/jgaa.00180","url":"https://dblp.org/rec/journals/jgaa/BerendZ09"}, "url":"URL#5060811" }, { "@score":"1", "@id":"5060812", "info":{"authors":{"author":[{"@pid":"b/UlrikBrandes","text":"Ulrik Brandes"},{"@pid":"65/4005","text":"Daniel Fleischer"}]},"title":"Vertex Bisection is Hard, too.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"119-131","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/BrandesF09","doi":"10.7155/JGAA.00179","ee":"https://doi.org/10.7155/jgaa.00179","url":"https://dblp.org/rec/journals/jgaa/BrandesF09"}, "url":"URL#5060812" }, { "@score":"1", "@id":"5060813", "info":{"authors":{"author":[{"@pid":"62/5844","text":"Ovidiu Daescu"},{"@pid":"69/1126","text":"Anastasia Kurdia"}]},"title":"Towards an optimal algorithm for recognizing Laman graphs.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"219-232","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/DaescuK09","doi":"10.7155/JGAA.00185","ee":"https://doi.org/10.7155/jgaa.00185","url":"https://dblp.org/rec/journals/jgaa/DaescuK09"}, "url":"URL#5060813" }, { "@score":"1", "@id":"5060814", "info":{"authors":{"author":{"@pid":"e/DEppstein","text":"David Eppstein"}},"title":"Finding Large Clique Minors is Hard.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"197-204","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/Eppstein09","doi":"10.7155/JGAA.00183","ee":"https://doi.org/10.7155/jgaa.00183","url":"https://dblp.org/rec/journals/jgaa/Eppstein09"}, "url":"URL#5060814" }, { "@score":"1", "@id":"5060815", "info":{"authors":{"author":[{"@pid":"09/2639","text":"Fabrizio Frati"},{"@pid":"k/MichaelKaufmann1","text":"Michael Kaufmann 0001"},{"@pid":"98/2841","text":"Stephen G. Kobourov"}]},"title":"Constrained Simultaneous and Near-Simultaneous Embeddings.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"3","pages":"447-465","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/FratiKK09","doi":"10.7155/JGAA.00194","ee":"https://doi.org/10.7155/jgaa.00194","url":"https://dblp.org/rec/journals/jgaa/FratiKK09"}, "url":"URL#5060815" }, { "@score":"1", "@id":"5060816", "info":{"authors":{"author":[{"@pid":"65/979","text":"Emilio Di Giacomo"},{"@pid":"38/5614","text":"Walter Didimo"},{"@pid":"k/MarcJvanKreveld","text":"Marc J. van Kreveld"},{"@pid":"30/3372","text":"Giuseppe Liotta"},{"@pid":"s/BettinaSpeckmann","text":"Bettina Speckmann"}]},"title":"Matched Drawings of Planar Graphs.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"3","pages":"423-445","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/GiacomoDKLS09","doi":"10.7155/JGAA.00193","ee":"https://doi.org/10.7155/jgaa.00193","url":"https://dblp.org/rec/journals/jgaa/GiacomoDKLS09"}, "url":"URL#5060816" }, { "@score":"1", "@id":"5060817", "info":{"authors":{"author":[{"@pid":"h/SeokHeeHong","text":"Seok-Hee Hong 0001"},{"@pid":"47/6485","text":"Hiroshi Nagamochi"}]},"title":"New Approximation to the One-sided Radial Crossing Minimization.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"179-196","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/HongN09","doi":"10.7155/JGAA.00182","ee":"https://doi.org/10.7155/jgaa.00182","url":"https://dblp.org/rec/journals/jgaa/HongN09"}, "url":"URL#5060817" }, { "@score":"1", "@id":"5060818", "info":{"authors":{"author":[{"@pid":"h/SeokHeeHong","text":"Seok-Hee Hong 0001"},{"@pid":"n/TakaoNishizeki","text":"Takao Nishizeki"}]},"title":"Guest Editors' Foreword.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"3","pages":"285-287","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/HongN09a","doi":"10.7155/JGAA.00188","ee":"https://doi.org/10.7155/jgaa.00188","url":"https://dblp.org/rec/journals/jgaa/HongN09a"}, "url":"URL#5060818" }, { "@score":"1", "@id":"5060819", "info":{"authors":{"author":{"@pid":"53/3339","text":"Falk Hüffner"}},"title":"Algorithm Engineering for Optimal Graph Bipartization.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"77-98","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/Huffner09","doi":"10.7155/JGAA.00177","ee":"https://doi.org/10.7155/jgaa.00177","url":"https://dblp.org/rec/journals/jgaa/Huffner09"}, "url":"URL#5060819" }, { "@score":"1", "@id":"5060820", "info":{"authors":{"author":[{"@pid":"46/3205","text":"Hiro Ito"},{"@pid":"p/MikePaterson","text":"Mike Paterson"},{"@pid":"50/2446","text":"Kenya Sugihara"}]},"title":"The Multi-Commodity Source Location Problems and the Price of Greed.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"1","pages":"55-73","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/ItoPS09","doi":"10.7155/JGAA.00176","ee":"https://doi.org/10.7155/jgaa.00176","url":"https://dblp.org/rec/journals/jgaa/ItoPS09"}, "url":"URL#5060820" }, { "@score":"1", "@id":"5060821", "info":{"authors":{"author":[{"@pid":"66/1170","text":"Eva Jelínková"},{"@pid":"46/3042","text":"Jan Kára"},{"@pid":"31/6569","text":"Jan Kratochvíl"},{"@pid":"52/6535","text":"Martin Pergel"},{"@pid":"57/1414","text":"Ondrej Suchý"},{"@pid":"54/1964","text":"Tomás Vyskocil"}]},"title":"Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"3","pages":"379-422","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/JelinkovaKKPSV09","doi":"10.7155/JGAA.00192","ee":"https://doi.org/10.7155/jgaa.00192","url":"https://dblp.org/rec/journals/jgaa/JelinkovaKKPSV09"}, "url":"URL#5060821" }, { "@score":"1", "@id":"5060822", "info":{"authors":{"author":[{"@pid":"j/MichaelJunger","text":"Michael Jünger"},{"@pid":"47/1803-1","text":"Michael Schulz 0001"}]},"title":"Intersection Graphs in Simultaneous Embedding with Fixed Edges.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"205-218","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/JungerS09","doi":"10.7155/JGAA.00184","ee":"https://doi.org/10.7155/jgaa.00184","url":"https://dblp.org/rec/journals/jgaa/JungerS09"}, "url":"URL#5060822" }, { "@score":"1", "@id":"5060823", "info":{"authors":{"author":[{"@pid":"42/8397-1","text":"Muhammad Rezaul Karim 0001"},{"@pid":"r/MdSaidurRahman","text":"Md. Saidur Rahman 0001"}]},"title":"On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"153-177","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/KarimR09","doi":"10.7155/JGAA.00181","ee":"https://doi.org/10.7155/jgaa.00181","url":"https://dblp.org/rec/journals/jgaa/KarimR09"}, "url":"URL#5060823" }, { "@score":"1", "@id":"5060824", "info":{"authors":{"author":{"@pid":"32/7817","text":"Ângela Mestre"}},"title":"Generating connected and 2-edge connected graphs.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"251-281","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/Mestre09","doi":"10.7155/JGAA.00187","ee":"https://doi.org/10.7155/jgaa.00187","url":"https://dblp.org/rec/journals/jgaa/Mestre09"}, "url":"URL#5060824" }, { "@score":"1", "@id":"5060825", "info":{"authors":{"author":[{"@pid":"17/5591","text":"Ulrich Pferschy"},{"@pid":"22/3548","text":"Joachim Schauer"}]},"title":"The Knapsack Problem with Conflict Graphs.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"2","pages":"233-249","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/PferschyS09","doi":"10.7155/JGAA.00186","ee":"https://doi.org/10.7155/jgaa.00186","url":"https://dblp.org/rec/journals/jgaa/PferschyS09"}, "url":"URL#5060825" }, { "@score":"1", "@id":"5060826", "info":{"authors":{"author":{"@pid":"r/MdSaidurRahman","text":"Md. Saidur Rahman 0001"}},"title":"Guest Editor's Foreword.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"1","pages":"3-4","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/Rahman09","doi":"10.7155/JGAA.00173","ee":"https://doi.org/10.7155/jgaa.00173","url":"https://dblp.org/rec/journals/jgaa/Rahman09"}, "url":"URL#5060826" }, { "@score":"1", "@id":"5060827", "info":{"authors":{"author":[{"@pid":"10/295","text":"Vassilis Tsiaras"},{"@pid":"63/6462","text":"Sofia Triantafilou"},{"@pid":"55/5488","text":"Ioannis G. Tollis"}]},"title":"DAGmaps: Space Filling Visualization of Directed Acyclic Graphs.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"3","pages":"319-347","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/TsiarasTT09","doi":"10.7155/JGAA.00190","ee":"https://doi.org/10.7155/jgaa.00190","url":"https://dblp.org/rec/journals/jgaa/TsiarasTT09"}, "url":"URL#5060827" }, { "@score":"1", "@id":"5060828", "info":{"authors":{"author":[{"@pid":"47/1614","text":"Katsuhisa Yamanaka"},{"@pid":"n/ShinIchiNakano","text":"Shin-Ichi Nakano"}]},"title":"Listing All Plane Graphs.","venue":"J. Graph Algorithms Appl.","volume":"13","number":"1","pages":"5-18","year":"2009","type":"Journal Articles","access":"open","key":"journals/jgaa/YamanakaN09","doi":"10.7155/JGAA.00174","ee":"https://doi.org/10.7155/jgaa.00174","url":"https://dblp.org/rec/journals/jgaa/YamanakaN09"}, "url":"URL#5060828" } ] } } } )