close
1.

電子ブック
ＥＢ
1. Algorithms and Computation
Otfried Cheong, Kyung-Yong Chwa, Takeo Kanade, Kunsoo Park
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Data Structure and Algorithm II / Session 6A：
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets / Gerth Stølting Brodal ; Spyros Sioutas ; Kostas Tsichlas ; Christos Zaroliagis ; Chih- Chiang Yu ; Biing-Feng Wang ; Chung-Chin Kuo
Dynamic Range Reporting in External Memory / Yakov Nekrich
A Cache-Oblivious Implicit Dictionary with the Working Set Property / Casper Kejlberg-Rasmussen ; Jakob Truelsen
Graph Algorithm II / Session 6B：
The (p, q)-total Labeling Problem for Trees / Toru Hasunuma ; Toshimasa Ishii ; Hirotaka Ono ; Yushi Uno
Drawing a Tree as a Minimum Spanning Tree Approximation / Emilio Di Giacomo ; Walter Didimo ; Giuseppe Liotta ; Henk Meijer
k-Cyclic Orientations of Graphs / Yasuaki Kobayashi ; Yuichiro Miyamoto ; Hisao Tamaki
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size / Qian-Ping Gu
Computational Geometry II / Session 7A：
Maximum Overlap of Convex Polytopes under Translation / Hee-Kap Ahn ; Siu- Wing Cheng ; Iris Reinbacher
Approximate Shortest Homotopic Paths in Weighted Regions / Siu-Wing Cheng ; Jiongxin Jin ; Antoine Vigneron ; Yajun Wang
Graph Coloring II / Ansgar Grüne ; Tien-Ching Lin ; Teng-Kai Yu ; Rolf Klein ; Elmar Langetepe ; D.T. Lee ; Sheung-Hung PoonSession 7B：
Approximation and Hardness Results for the Maximum Edge q-Coloring Problem / Anna Adamaszek ; Alexandru Popa
3-Colouring AT-Free Graphs in Polynomial Time / Juraj Stacho
On Coloring Graphs without Induced Forests / Hajo Broersma ; Petr A. Golovach ; Daniël Paulusma ; Jian Song
Approximation Algorithm II / Session 8A：
On the Approximability of the Maximum Interval Constrained Coloring Problem / Stefan Canzar ; Khaled Elbassioni ; Amr Elmasry ; Rajiv Raman
Approximability of Constrained LCS / Minghui Jiang
Approximation Algorithms for the Multi-Vehicle Scheduling Problem / Binay Bhattacharya ; Yuzhuang Hu
On Greedy Algorithms for Decision Trees / Ferdinando Cicalese ; Tobias Jacobs ; Eduardo Laber ; Marco Molinaro
Online Algorithm / Session 8B：
Single and Multiple Device DSA Problem, Complexities and Online Algorithms / Weiwei Wu ; Wanyong Tian ; Minming Li ; Chun Jason Xue ; Enhong Chen
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications (Extended Abstract) / Sang Won Bae ; Chan-Su Shin
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing / Yong Zhang ; Jingchi Chen ; Francis Y.L. Chin ; Xin Han ; Hing-Fung Ting ; Yung H. Tsin
On the Continuous CNN Problem / John Augustine ; Nick Gravin
Scheduling / Session 9A：
Policies for Periodic Packet Routing / Britta Peis ; Sebastian Stiller ; Andreas Wiese
Increasing Speed Scheduling and Flow Scheduling
A Tighter Analysis of Work Stealing / Marc Tchiboukdjian ; Nicolas Gast ; Denis Trystram ; Jean-Louis Roch ; Julien Bernard
Approximating the Traveling Tournament Problem with Maximum Tour Length 2 / Clemens Thielen ; Stephan Westphal
Data Structure and Algorithm III / Session 9B：
Alphabet Partitioning for Compressed Rank/Select and Applications / Jérémy Barbay ; Travis Gagie ; Gonzalo Navarro
Entropy-Bounded Representation of Point Grids / Arash Farzan
Identifying Approximate Palindromes in Run-Length Encoded Strings / Kuan-Yu Chen ; Ping-Hui Hsu ; Kun-Mao Chao
Graph Algorithm III / Session 10A：
Minimum Cost Partitions of Trees with Supply and Demand / Takehiro Ito ; Takuya Hara ; Xiao Zhou ; Takao Nishizeki
Computing the (t, k)-Diagnosability of Component-Composition Graphs and Its Application / Sun-Yuan Hsieh ; Chun-An Chen
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
Beyond Good Shapes: Diffusion-Based Graph Partitioning is Relaxed Cut Optimization / Henning Meyerhenke
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs / Pinar Heggernes ; Daniel Meister ; Yngve Villanger
Computational Geometry III / Session 10B：
Testing Simultaneous Planarity When the Common Graph Is 2-Connected / Bernhard Haeupler ; Krishnam Raju Jampani ; Anna Lubiw
Computing the Discrete Fréchet Distance with Imprecise Input / Christian Knauer ; Marc Scherfenberg ; Lena Schlipf
Connectivity Graphs of Uncertainty Regions / Erin Chambers ; Alejandro Erickson ; Sándor Fekete ; Jonathan Lenchner ; Jeff Sember ; Srinivasan Venkatesh ; Ulrike Stege ; Svetlana Stolpner ; Christophe Weibel ; Sue Whitesides
?/2-Angle Yao Graphs Are Spanners / Prosenjit Bose ; Mirela Damian ; Karim Douïeb ; Joseph O'Rourke ; Ben Seamone ; Michiel Smid ; Stefanie Wuhrer
Identifying Shapes Using Self-assembly (Extended Abstract) / Matthew J. Patitz ; Scott M. Summers
Author Index
Data Structure and Algorithm II / Session 6A：
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets / Gerth Stølting Brodal ; Spyros Sioutas ; Kostas Tsichlas ; Christos Zaroliagis ; Chih- Chiang Yu ; Biing-Feng Wang ; Chung-Chin Kuo
Dynamic Range Reporting in External Memory / Yakov Nekrich
2.

電子ブック
ＥＢ
2. Algorithms and Computation
Otfried Cheong, Kyung-Yong Chwa, Takeo Kanade, Kunsoo Park
出版情報: Springer eBooks Computer Science , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Regular Labelings and Geometric Structures (Abstract) / David Eppstein
Algorithmic Aspects of Secure Computation and Communication (Abstract) / Matt Franklin
Approximation Algorithm I / Session 1A：
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / Marek Karpinski ; Warren Schudy
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 / Piotr Berman ; Alexander Zelikovsky
Approximate Periodicity / Amihood Amir ; Estrella Eisenberg ; Avivit Levy
Approximating the Average Stretch Factor of Geometric Graphs / Siu-Wing Cheng ; Christian Knauer ; Stefan Langerman ; Michiel Smid
Complexity I / Session 1B：
Satisfiability with Index Dependency / Hongyu Liang ; Jing He
Anonymous Fuzzy Identity-Based Encryption for Similarity Search / David W. Cheung ; Nikos Mamoulis ; W.K. Wong ; S.M. Yiu ; Ye Zhang
Improved Randomized Algorithms for 3-SAT / Kazuo Iwama ; Kazuhisa Seto ; Tadashi Takai ; Suguru Tamaki
Quantum Counterfeit Coin Problems / Harumichi Nishimura ; Rudy Raymond ; Junichi Teruyama
Data Structure and Algorithm I / Session 2A：
Priority Range Trees / Michael T. Goodrich ; Darren Strash
Should Static Search Trees Ever Be Unbalanced? / Prosenjit Bose ; Karim Douïeb
Levelwise Mesh Sparsification for Shortest Path Quaries / Yuichiro Miyamoto ; Takeaki Uno ; Mikio Kubo
Unit-Time Predecessor Queries on Massive Data Sets / Andrej Brodnik ; John Iacono
Combinatorial Optimization / Session 2B：
Popularity at Minimum Cost / Telikepalli Kavitha ; Meghana Nasre ; Prajakta Nimbhorkar
Structural and (Complexity Aspects of Line Systems of Graphs / Jozef Jirásek ; Pavel Klavík
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra / Akiyoshi Shioura
Generating Trees on Multisets / Bingbing Zhuang ; Hiroshi Nagamochi
Graph Algorithm I / Session 3A：
Seidel Minor, Permutation Graphs and Combinatorial Properties / Vincent Limouzy
Simultaneous Interval Graphs / Krishnam Raju Jampani ; Anna Lubiw
Unbalanced Graph Partitioning / Angsheng Li ; Peng Zhang
On the Intersection of Tolerance and Cocomparability Graphs / George B. Mertzios ; Shmuel Zaks
Flows in One-Crossing-Minor-Free Graphs / Erin Chambers
Complexity II / Session 3B：
Computing Sparse Multiples of Polynomials / Jin-Yi Cai ; Sangxia Huang ; Pinyan Lu ; Mark Giesbrecht ; Daniel S. Roche ; Hrushikesh Tilak
Fractal Parallelism: Solving SAT in Bounded Space and Time / Denys Duchier ; Jérôme Durand-Lose ; Maxime Senot
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity / Hugo Férée ; Emmanuel Hianry ; Mathieu Hoyrup ; Romain Péchoux
New Upper Bounds on the Average PTF Density of Boolean Functions / Kazuyuki Amano
Computational Geometry I / Session 4A：
An Optimal Algorithm for Computing Angle-Constrained Spanners / Paz Carmi
Approximating Minimum Bending Energy Path in a Simple Corridor / Jinhui Xu ; Lei Xu ; Yulai Xie
Graph Coloring I / Session 4B：
Analysis of an Iterated Local Search Algorithm for Vertex Coloring / Dirk Sudholt ; Christine Zarges
Bounded Max-colorings of Graphs / Evripidis Bampis ; Alexander Kononov ; Giorgio Lucarelli ; Ioannis Milis
Fixed Parameter Tractability / Session 5A：
Parameterized Algorithms for Boxicity / Abhijin Adiga ; Rajesh Chitnis ; Saket Saurabh
On Tractable Cases of Target Set Selection / André Nichterlein ; Rolf Niedermeier ; Johannes Uhlmann ; Mathias Weller
Combining Two Worlds: Parameterised Approximation for Vertex Cover / Ljiljana Brankovic ; Henning Fernau
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / Maarten Löffler
Optimization / Session 5B：
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles / Thomas Dueholm Hansen ; Uri Zwick
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut / Immanuel Bomze ; Markus Chimani ; Michael Jünger ; Ivana Ljubic ; Petra Mutzel ; Bernd Zey
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems / Joachim Spoerhase
A Faster Algorithm for the Maximum Even Factor Problem / Maxim A. Babenko
Author Index
Invited Talks
Regular Labelings and Geometric Structures (Abstract) / David Eppstein
Algorithmic Aspects of Secure Computation and Communication (Abstract) / Matt Franklin
3.

電子ブック
ＥＢ
3. Algorithms and Computation
Otfried Cheong, Kyung-Yong Chwa, Takeo Kanade, Kunsoo Park
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Data Structure and Algorithm II / Session 6A：
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets / Gerth Stølting Brodal ; Spyros Sioutas ; Kostas Tsichlas ; Christos Zaroliagis ; Chih- Chiang Yu ; Biing-Feng Wang ; Chung-Chin Kuo
Dynamic Range Reporting in External Memory / Yakov Nekrich
A Cache-Oblivious Implicit Dictionary with the Working Set Property / Casper Kejlberg-Rasmussen ; Jakob Truelsen
Graph Algorithm II / Session 6B：
The (p, q)-total Labeling Problem for Trees / Toru Hasunuma ; Toshimasa Ishii ; Hirotaka Ono ; Yushi Uno
Drawing a Tree as a Minimum Spanning Tree Approximation / Emilio Di Giacomo ; Walter Didimo ; Giuseppe Liotta ; Henk Meijer
k-Cyclic Orientations of Graphs / Yasuaki Kobayashi ; Yuichiro Miyamoto ; Hisao Tamaki
Improved Bounds on the Planar Branchwidth with Respect to the Largest Grid Minor Size / Qian-Ping Gu
Computational Geometry II / Session 7A：
Maximum Overlap of Convex Polytopes under Translation / Hee-Kap Ahn ; Siu- Wing Cheng ; Iris Reinbacher
Approximate Shortest Homotopic Paths in Weighted Regions / Siu-Wing Cheng ; Jiongxin Jin ; Antoine Vigneron ; Yajun Wang
Graph Coloring II / Ansgar Grüne ; Tien-Ching Lin ; Teng-Kai Yu ; Rolf Klein ; Elmar Langetepe ; D.T. Lee ; Sheung-Hung PoonSession 7B：
Approximation and Hardness Results for the Maximum Edge q-Coloring Problem / Anna Adamaszek ; Alexandru Popa
3-Colouring AT-Free Graphs in Polynomial Time / Juraj Stacho
On Coloring Graphs without Induced Forests / Hajo Broersma ; Petr A. Golovach ; Daniël Paulusma ; Jian Song
Approximation Algorithm II / Session 8A：
On the Approximability of the Maximum Interval Constrained Coloring Problem / Stefan Canzar ; Khaled Elbassioni ; Amr Elmasry ; Rajiv Raman
Approximability of Constrained LCS / Minghui Jiang
Approximation Algorithms for the Multi-Vehicle Scheduling Problem / Binay Bhattacharya ; Yuzhuang Hu
On Greedy Algorithms for Decision Trees / Ferdinando Cicalese ; Tobias Jacobs ; Eduardo Laber ; Marco Molinaro
Online Algorithm / Session 8B：
Single and Multiple Device DSA Problem, Complexities and Online Algorithms / Weiwei Wu ; Wanyong Tian ; Minming Li ; Chun Jason Xue ; Enhong Chen
The Onion Diagram: A Voronoi-Like Tessellation of a Planar Line Space and Its Applications (Extended Abstract) / Sang Won Bae ; Chan-Su Shin
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing / Yong Zhang ; Jingchi Chen ; Francis Y.L. Chin ; Xin Han ; Hing-Fung Ting ; Yung H. Tsin
On the Continuous CNN Problem / John Augustine ; Nick Gravin
Scheduling / Session 9A：
Policies for Periodic Packet Routing / Britta Peis ; Sebastian Stiller ; Andreas Wiese
Increasing Speed Scheduling and Flow Scheduling
A Tighter Analysis of Work Stealing / Marc Tchiboukdjian ; Nicolas Gast ; Denis Trystram ; Jean-Louis Roch ; Julien Bernard
Approximating the Traveling Tournament Problem with Maximum Tour Length 2 / Clemens Thielen ; Stephan Westphal
Data Structure and Algorithm III / Session 9B：
Alphabet Partitioning for Compressed Rank/Select and Applications / Jérémy Barbay ; Travis Gagie ; Gonzalo Navarro
Entropy-Bounded Representation of Point Grids / Arash Farzan
Identifying Approximate Palindromes in Run-Length Encoded Strings / Kuan-Yu Chen ; Ping-Hui Hsu ; Kun-Mao Chao
Graph Algorithm III / Session 10A：
Minimum Cost Partitions of Trees with Supply and Demand / Takehiro Ito ; Takuya Hara ; Xiao Zhou ; Takao Nishizeki
Computing the (t, k)-Diagnosability of Component-Composition Graphs and Its Application / Sun-Yuan Hsieh ; Chun-An Chen
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
Beyond Good Shapes: Diffusion-Based Graph Partitioning is Relaxed Cut Optimization / Henning Meyerhenke
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs / Pinar Heggernes ; Daniel Meister ; Yngve Villanger
Computational Geometry III / Session 10B：
Testing Simultaneous Planarity When the Common Graph Is 2-Connected / Bernhard Haeupler ; Krishnam Raju Jampani ; Anna Lubiw
Computing the Discrete Fréchet Distance with Imprecise Input / Christian Knauer ; Marc Scherfenberg ; Lena Schlipf
Connectivity Graphs of Uncertainty Regions / Erin Chambers ; Alejandro Erickson ; Sándor Fekete ; Jonathan Lenchner ; Jeff Sember ; Srinivasan Venkatesh ; Ulrike Stege ; Svetlana Stolpner ; Christophe Weibel ; Sue Whitesides
?/2-Angle Yao Graphs Are Spanners / Prosenjit Bose ; Mirela Damian ; Karim Douïeb ; Joseph O'Rourke ; Ben Seamone ; Michiel Smid ; Stefanie Wuhrer
Identifying Shapes Using Self-assembly (Extended Abstract) / Matthew J. Patitz ; Scott M. Summers
Author Index
Data Structure and Algorithm II / Session 6A：
Efficient Indexes for the Positional Pattern Matching Problem and Two Related Problems over Small Alphabets / Gerth Stølting Brodal ; Spyros Sioutas ; Kostas Tsichlas ; Christos Zaroliagis ; Chih- Chiang Yu ; Biing-Feng Wang ; Chung-Chin Kuo
Dynamic Range Reporting in External Memory / Yakov Nekrich
4.

電子ブック
ＥＢ
4. Algorithms and Computation
Otfried Cheong, Kyung-Yong Chwa, Takeo Kanade, Kunsoo Park
出版情報: SpringerLink Books - AutoHoldings , Springer Berlin Heidelberg, 2010
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Regular Labelings and Geometric Structures (Abstract) / David Eppstein
Algorithmic Aspects of Secure Computation and Communication (Abstract) / Matt Franklin
Approximation Algorithm I / Session 1A：
Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / Marek Karpinski ; Warren Schudy
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 / Piotr Berman ; Alexander Zelikovsky
Approximate Periodicity / Amihood Amir ; Estrella Eisenberg ; Avivit Levy
Approximating the Average Stretch Factor of Geometric Graphs / Siu-Wing Cheng ; Christian Knauer ; Stefan Langerman ; Michiel Smid
Complexity I / Session 1B：
Satisfiability with Index Dependency / Hongyu Liang ; Jing He
Anonymous Fuzzy Identity-Based Encryption for Similarity Search / David W. Cheung ; Nikos Mamoulis ; W.K. Wong ; S.M. Yiu ; Ye Zhang
Improved Randomized Algorithms for 3-SAT / Kazuo Iwama ; Kazuhisa Seto ; Tadashi Takai ; Suguru Tamaki
Quantum Counterfeit Coin Problems / Harumichi Nishimura ; Rudy Raymond ; Junichi Teruyama
Data Structure and Algorithm I / Session 2A：
Priority Range Trees / Michael T. Goodrich ; Darren Strash
Should Static Search Trees Ever Be Unbalanced? / Prosenjit Bose ; Karim Douïeb
Levelwise Mesh Sparsification for Shortest Path Quaries / Yuichiro Miyamoto ; Takeaki Uno ; Mikio Kubo
Unit-Time Predecessor Queries on Massive Data Sets / Andrej Brodnik ; John Iacono
Combinatorial Optimization / Session 2B：
Popularity at Minimum Cost / Telikepalli Kavitha ; Meghana Nasre ; Prajakta Nimbhorkar
Structural and (Complexity Aspects of Line Systems of Graphs / Jozef Jirásek ; Pavel Klavík
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra / Akiyoshi Shioura
Generating Trees on Multisets / Bingbing Zhuang ; Hiroshi Nagamochi
Graph Algorithm I / Session 3A：
Seidel Minor, Permutation Graphs and Combinatorial Properties / Vincent Limouzy
Simultaneous Interval Graphs / Krishnam Raju Jampani ; Anna Lubiw
Unbalanced Graph Partitioning / Angsheng Li ; Peng Zhang
On the Intersection of Tolerance and Cocomparability Graphs / George B. Mertzios ; Shmuel Zaks
Flows in One-Crossing-Minor-Free Graphs / Erin Chambers
Complexity II / Session 3B：
Computing Sparse Multiples of Polynomials / Jin-Yi Cai ; Sangxia Huang ; Pinyan Lu ; Mark Giesbrecht ; Daniel S. Roche ; Hrushikesh Tilak
Fractal Parallelism: Solving SAT in Bounded Space and Time / Denys Duchier ; Jérôme Durand-Lose ; Maxime Senot
Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity / Hugo Férée ; Emmanuel Hianry ; Mathieu Hoyrup ; Romain Péchoux
New Upper Bounds on the Average PTF Density of Boolean Functions / Kazuyuki Amano
Computational Geometry I / Session 4A：
An Optimal Algorithm for Computing Angle-Constrained Spanners / Paz Carmi
Approximating Minimum Bending Energy Path in a Simple Corridor / Jinhui Xu ; Lei Xu ; Yulai Xie
Graph Coloring I / Session 4B：
Analysis of an Iterated Local Search Algorithm for Vertex Coloring / Dirk Sudholt ; Christine Zarges
Bounded Max-colorings of Graphs / Evripidis Bampis ; Alexander Kononov ; Giorgio Lucarelli ; Ioannis Milis
Fixed Parameter Tractability / Session 5A：
Parameterized Algorithms for Boxicity / Abhijin Adiga ; Rajesh Chitnis ; Saket Saurabh
On Tractable Cases of Target Set Selection / André Nichterlein ; Rolf Niedermeier ; Johannes Uhlmann ; Mathias Weller
Combining Two Worlds: Parameterised Approximation for Vertex Cover / Ljiljana Brankovic ; Henning Fernau
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / Maarten Löffler
Optimization / Session 5B：
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles / Thomas Dueholm Hansen ; Uri Zwick
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut / Immanuel Bomze ; Markus Chimani ; Michael Jünger ; Ivana Ljubic ; Petra Mutzel ; Bernd Zey
An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems / Joachim Spoerhase
A Faster Algorithm for the Maximum Even Factor Problem / Maxim A. Babenko
Author Index
Invited Talks
Regular Labelings and Geometric Structures (Abstract) / David Eppstein
Algorithmic Aspects of Secure Computation and Communication (Abstract) / Matt Franklin
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼