top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013 : proceedings / Michael Fellows, Xuehou Tan, Binhai Zhu (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013 : proceedings / Michael Fellows, Xuehou Tan, Binhai Zhu (eds.).
Creatore [FAW-AAIM (Conference) (3rd : 2013 : Dalian Shi, China)]
Estensione 1 online resource (xi, 364 pages) : illustrations (black and white).
Disciplina 005.1
Accesso persona Fellows, M. R. (Michael Ralph), 1952-editor
Tan, Xuehou, editor
Zhu, Binhai, 1966-editor
Accesso convegno Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, FAW-AAIM (26-06-2013 - 28-06-2013 : Dalian, China)
Genere/Forma Congresses
Electronic books
Conference papers and proceedings
ISBN 9783642387562
364238756X
9783642387555
3642387551
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures. The Square Root Phenomenon in Planar Graphs / Dániel Marx -- An Algorithm for Determining Whether a Pair of Polygons Is Reversible / Jin Akiyama, Hyunwoo Seong -- Contributed Papers. Disjoint Small Cycles in Graphs and Bipartite Graphs / Ding Ma, Yunshu Gao -- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree / Marcin Krzywkowski -- Algorithms for Testing Length Four Permutations / Yijie Han, Sanjeev Saxena -- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds / Pawan Aurora, Sumit Singh, Shashank K. Mehta -- Faster Exact Computation of rSPR Distance / Zhi-Zhong Chen, Lusheng Wang -- Arbitrated Quantum Signature Schemes: Attacks and Security / Xiangfu Zou, Daowen Qiu -- Randomized Algorithms for Removable Online Knapsack Problems / Xin Han, Yasushi Kawase, Kazuhisa Makino -- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs / Mingyu Xiao, Hiroshi Nagamochi -- FWLS: A Local Search for Graph Coloring / Wei Wu, Chuan Luo, Kaile Su.
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids / Mark Korenblit, Vadim E. Levit -- Monomial Testing and Applications / Shenshi Chen -- The Optimal Rescue Path Set Problem in Undirected Graphs / Huili Zhang, Yinfeng Xu -- Expected Computations on Color Spanning Sets / Chenglin Fan [and others] -- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / Min Lu, Tian Liu, Ke Xu -- Spanning Distribution Trees of Graphs / Masaki Kawabata, Takao Nishizeki -- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem / Jinghao Sun, Yakun Meng, Guozhen Tan -- Zero-Visibility Cops and Robber Game on a Graph / Dariusz Dereniowski [and others] -- On (k, ℓ)-Graph Sandwich Problems / Fernanda Couto [and others] -- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints / J. Crampton [and others] -- Two-Round Discrete Voronoi Game along a Line / Aritra Banik [and others] -- Inverse Maximum Flow Problems under the Combining Norms / Longcheng Liu.
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs / Carlos A. Martinhon, Luérbio Faria -- A Cost-Efficient Scheduling Algorithm for Traffic Grooming / Xianrong Liu [and others] -- Strategies of Groups Evacuation from a Convex Region in the Plane / Yinfeng Xu, Lan Qin -- Kernelization and Lower Bounds of the Signed Domination Problem / Ying Zheng, Jianxin Wang, Qilong Feng -- On Edge-Independent Sets / Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon -- On the Complexity of Approximate Sum of Sorted List / Bin Fu -- Large Hypertree Width for Sparse Random Hypergraphs / Chaoyi Wang, Tian Liu, Ke Xu -- On Perfect Absorbants in De Bruijn Digraphs / Yue-Li Wang, Kuo-Hua Wu, Ton Kloks -- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width / Xiaojie Deng, Bingkai Lin, Chihao Zhang -- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints / Yumei Huo, Hairong Zhao -- Zero-Sum Flow Numbers of Hexagonal Grids / Tao-Ming Wang, Guang-Hui Zhang -- Pattern-Guided k-Anonymity / Robert Bredereck, André Nichterlein, Rolf Niedermeier.
Record Nr. NYU-004401885
[FAW-AAIM (Conference) (3rd : 2013 : Dalian Shi, China)]  
Materiale a stampa
Lo trovi qui: New York University
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Creatore [FAW-AAIM (Conference) (2012 : Beijing, China)]
Estensione 1 online resource (xvii, 370 pages).
Disciplina 005.1
Accesso persona Snoeyink, Jack
Soggetto non controllato Computer science
Data structures (Computer science)
Information theory
Computer software
Computational complexity
Information Systems
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Mathematics of Computing
Theory of Computation
Management of Computing and Information Systems
ISBN 9783642297007
3642297005
3642296998
9783642296994
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations / Bryan He -- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs / Jiun-Jie Wang and Xin He -- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance / Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao -- Voronoi Diagram with Visual Restriction / Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu -- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / Xuehou Tan and Bo Jiang -- On Covering Points with Minimum Turns / Minghui Jiang -- On Envy-Free Pareto Efficient Pricing / Xia Hua -- Online Pricing for Multi-type of Items / Yong Zhang, Francis Y.L. Chin and Hing-Fung Ting -- Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines / Yiwei Jiang, Zewei Weng and Jueliang Hu -- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs / Danny Z. Chen, Xiaomin Liu and Haitao Wang -- Algorithms for Bandwidth Consecutive Multicolorings of Graphs / (Extended Abstract) / Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou.
Independent Domination on Tree Convex Bipartite Graphs / Yu Song, Tian Liu and Ke Xu -- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters / Deshi Ye and Lili Mei -- On Multiprocessor Temperature-Aware Scheduling Problems / Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis -- Online Minimum Makespan Scheduling with a Buffer / Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han -- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing / Richard Beigel and Bin Fu -- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP / Bin Fu -- Some Remarks on the Incompressibility of Width-Parameterized SAT Instances / Bangsheng Tang -- Kernels for Packing and Covering Problems / (Extended Abstract) / Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang -- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter / Junping Zhou and Minghao Yin -- Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations / Chihao Zhang and Hongyang Zhang -- On Editing Graphs into 2-Club Clusters / Hong Liu, Peng Zhang and Daming Zhu.
Solving Generalized Optimization Problems Subject to SMT Constraints / Feifei Ma, Jun Yan and Jian Zhang -- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition / Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang -- Zero-Sum Flow Numbers of Regular Graphs / Tao-Ming Wang and Shih-Wei Hu -- More Efficient Parallel Integer Sorting / Yijie Han and Xin He -- Fast Relative Lempel-Ziv Self-index for Similar Sequences / Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- A Comparison of Performance Measures via Online Search / Joan Boyar, Kim S. Larsen and Abyayananda Maiti -- Online Exploration of All Vertices in a Simple Polygon / Yuya Higashikawa and Naoki Katoh -- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs / Minati De, Subhas C. Nandy and Sasanka Roy -- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs / Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang -- An Improved Approximation Algorithm for the Bandpass Problem / Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin -- Partial Degree Bounded Edge Packing Problem / Peng Zhang -- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem / Zhixiang Chen, Bin Fu and Binhai Zhu.
Record Nr. STANFORD-a9612211
[FAW-AAIM (Conference) (2012 : Beijing, China)]  
Materiale a stampa
Lo trovi qui: Stanford University
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Creatore [FAW-AAIM (Conference) (2012 : Beijing, China)]
Estensione 1 online resource (xvii, 370 pages).
Disciplina 005.1
Accesso persona Snoeyink, Jack
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Data structures (Computer science)
Information theory
Computer software
Computational complexity
Information Systems
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Mathematics of Computing
Theory of Computation
Management of Computing and Information Systems
ISBN 9783642297007
3642297005
3642296998
9783642296994
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations / Bryan He -- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs / Jiun-Jie Wang and Xin He -- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance / Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao -- Voronoi Diagram with Visual Restriction / Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu -- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / Xuehou Tan and Bo Jiang -- On Covering Points with Minimum Turns / Minghui Jiang -- On Envy-Free Pareto Efficient Pricing / Xia Hua -- Online Pricing for Multi-type of Items / Yong Zhang, Francis Y.L. Chin and Hing-Fung Ting -- Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines / Yiwei Jiang, Zewei Weng and Jueliang Hu -- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs / Danny Z. Chen, Xiaomin Liu and Haitao Wang -- Algorithms for Bandwidth Consecutive Multicolorings of Graphs / (Extended Abstract) / Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou.
Independent Domination on Tree Convex Bipartite Graphs / Yu Song, Tian Liu and Ke Xu -- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters / Deshi Ye and Lili Mei -- On Multiprocessor Temperature-Aware Scheduling Problems / Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis -- Online Minimum Makespan Scheduling with a Buffer / Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han -- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing / Richard Beigel and Bin Fu -- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP / Bin Fu -- Some Remarks on the Incompressibility of Width-Parameterized SAT Instances / Bangsheng Tang -- Kernels for Packing and Covering Problems / (Extended Abstract) / Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang -- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter / Junping Zhou and Minghao Yin -- Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations / Chihao Zhang and Hongyang Zhang -- On Editing Graphs into 2-Club Clusters / Hong Liu, Peng Zhang and Daming Zhu.
Solving Generalized Optimization Problems Subject to SMT Constraints / Feifei Ma, Jun Yan and Jian Zhang -- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition / Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang -- Zero-Sum Flow Numbers of Regular Graphs / Tao-Ming Wang and Shih-Wei Hu -- More Efficient Parallel Integer Sorting / Yijie Han and Xin He -- Fast Relative Lempel-Ziv Self-index for Similar Sequences / Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- A Comparison of Performance Measures via Online Search / Joan Boyar, Kim S. Larsen and Abyayananda Maiti -- Online Exploration of All Vertices in a Simple Polygon / Yuya Higashikawa and Naoki Katoh -- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs / Minati De, Subhas C. Nandy and Sasanka Roy -- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs / Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang -- An Improved Approximation Algorithm for the Bandpass Problem / Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin -- Partial Degree Bounded Edge Packing Problem / Peng Zhang -- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem / Zhixiang Chen, Bin Fu and Binhai Zhu.
Record Nr. NYU-004375175
[FAW-AAIM (Conference) (2012 : Beijing, China)]  
Materiale a stampa
Lo trovi qui: New York University
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (eds.).
Creatore [FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]
Estensione 1 online resource (xiii, 390 pages) : illustrations.
Disciplina 006.3/1
Accesso persona Atallah, Mikhail J.
Li, Xiang-Yang, 1971-
Zhu, Binhai, 1966-
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642212048
3642212042
9783642212031
3642212034
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-005708684
[FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]  
Materiale a stampa
Lo trovi qui: New York University
Frontiers in algorithmics and algorithmic aspects in information and management [electronic resource] : joint international conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013 : proceedings / Michael Fellows, Xuehou Tan, Binhai Zhu (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management [electronic resource] : joint international conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013 : proceedings / Michael Fellows, Xuehou Tan, Binhai Zhu (eds.).
Creatore [FAW-AAIM (Conference) (3rd : 2013 : Dalian Shi, China)]
Estensione 1 online resource : ill
Disciplina 005.1
Accesso persona Fellows, M. R. (Michael Ralph), 1952-
Tan, Xuehou
Zhu, Binhai, 1966-
Accesso convegno Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, FAW-AAIM (26-06-2013 - 28-06-2013 : Dalian, China)
Genere/Forma Electronic books
ISBN 9783642387562 (electronic bk.)
364238756X (electronic bk.)
9783642387555
3642387551
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures. The Square Root Phenomenon in Planar Graphs / Dániel Marx -- An Algorithm for Determining Whether a Pair of Polygons Is Reversible / Jin Akiyama, Hyunwoo Seong -- Contributed Papers. Disjoint Small Cycles in Graphs and Bipartite Graphs / Ding Ma, Yunshu Gao -- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree / Marcin Krzywkowski -- Algorithms for Testing Length Four Permutations / Yijie Han, Sanjeev Saxena -- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds / Pawan Aurora, Sumit Singh, Shashank K. Mehta -- Faster Exact Computation of rSPR Distance / Zhi-Zhong Chen, Lusheng Wang -- Arbitrated Quantum Signature Schemes: Attacks and Security / Xiangfu Zou, Daowen Qiu -- Randomized Algorithms for Removable Online Knapsack Problems / Xin Han, Yasushi Kawase, Kazuhisa Makino -- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs / Mingyu Xiao, Hiroshi Nagamochi -- FWLS: A Local Search for Graph Coloring / Wei Wu, Chuan Luo, Kaile Su --
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids / Mark Korenblit, Vadim E. Levit -- Monomial Testing and Applications / Shenshi Chen -- The Optimal Rescue Path Set Problem in Undirected Graphs / Huili Zhang, Yinfeng Xu -- Expected Computations on Color Spanning Sets / Chenglin Fan ... [et al.] -- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / Min Lu, Tian Liu, Ke Xu -- Spanning Distribution Trees of Graphs / Masaki Kawabata, Takao Nishizeki -- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem / Jinghao Sun, Yakun Meng, Guozhen Tan -- Zero-Visibility Cops and Robber Game on a Graph / Dariusz Dereniowski ... [et al.] -- On (k,ℓ)-Graph Sandwich Problems / Fernanda Couto ... [et al.] -- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints / J. Crampton ... [et al.] -- Two-Round Discrete Voronoi Game along a Line / Aritra Banik ... [et al.] -- Inverse Maximum Flow Problems under the Combining Norms / Longcheng Liu --
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs / Carlos A. Martinhon, Luérbio Faria -- A Cost-Efficient Scheduling Algorithm for Traffic Grooming / Xianrong Liu ... [et al.] -- Strategies of Groups Evacuation from a Convex Region in the Plane / Yinfeng Xu, Lan Qin -- Kernelization and Lower Bounds of the Signed Domination Problem / Ying Zheng, Jianxin Wang, Qilong Feng -- On Edge-Independent Sets / Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon -- On the Complexity of Approximate Sum of Sorted List / Bin Fu -- Large Hypertree Width for Sparse Random Hypergraphs / Chaoyi Wang, Tian Liu, Ke Xu -- On Perfect Absorbants in De Bruijn Digraphs / Yue-Li Wang, Kuo-Hua Wu, Ton Kloks -- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width / Xiaojie Deng, Bingkai Lin, Chihao Zhang -- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints / Yumei Huo, Hairong Zhao -- Zero-Sum Flow Numbers of Hexagonal Grids / Tao-Ming Wang, Guang-Hui Zhang -- Pattern-Guided k-Anonymity / Robert Bredereck, André Nichterlein, Rolf Niedermeier.
Record Nr. UPENN-9960106853503681
[FAW-AAIM (Conference) (3rd : 2013 : Dalian Shi, China)]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (eds.).
Creatore [FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]
Estensione 1 online resource (xiii, 390 pages) : illustrations.
Disciplina 006.3/1
Accesso persona Atallah, Mikhail J.
Li, Xiang-Yang, 1971-
Zhu, Binhai, 1966-
ISBN 9783642212048
3642212042
9783642212031
3642212034
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. STANFORD-a9219123
[FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]  
Materiale a stampa
Lo trovi qui: Stanford University
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management : Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, Proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (Eds.).
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management : Joint International Conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, Proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (Eds.).
Creatore [FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]
Estensione 1 online resource (xiii, 390 pages) : illustrations
Accesso persona Atallah, Mikhail J., editor
Li, Xiang-Yang, 1971- editor
Zhu, Binhai, 1966- editor
Genere/Forma Electronic books
ISBN 9783642212031
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-005234568
[FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]  
Materiale a stampa
Lo trovi qui: Duke University
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Creatore [FAW-AAIM (Conference) (2012 : Beijing, China)]
Estensione 1 online resource (xvii, 370 pages).
Disciplina 005.1
Accesso persona Snoeyink, Jack
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Data structures (Computer science)
Information theory
Computer software
Computational complexity
Information Systems
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Mathematics of Computing
Theory of Computation
Management of Computing and Information Systems
ISBN 9783642297007
3642297005
3642296998
9783642296994
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations / Bryan He -- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs / Jiun-Jie Wang and Xin He -- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance / Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao -- Voronoi Diagram with Visual Restriction / Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu -- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / Xuehou Tan and Bo Jiang -- On Covering Points with Minimum Turns / Minghui Jiang -- On Envy-Free Pareto Efficient Pricing / Xia Hua -- Online Pricing for Multi-type of Items / Yong Zhang, Francis Y.L. Chin and Hing-Fung Ting -- Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines / Yiwei Jiang, Zewei Weng and Jueliang Hu -- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs / Danny Z. Chen, Xiaomin Liu and Haitao Wang -- Algorithms for Bandwidth Consecutive Multicolorings of Graphs / (Extended Abstract) / Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou.
Independent Domination on Tree Convex Bipartite Graphs / Yu Song, Tian Liu and Ke Xu -- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters / Deshi Ye and Lili Mei -- On Multiprocessor Temperature-Aware Scheduling Problems / Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis -- Online Minimum Makespan Scheduling with a Buffer / Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han -- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing / Richard Beigel and Bin Fu -- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP / Bin Fu -- Some Remarks on the Incompressibility of Width-Parameterized SAT Instances / Bangsheng Tang -- Kernels for Packing and Covering Problems / (Extended Abstract) / Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang -- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter / Junping Zhou and Minghao Yin -- Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations / Chihao Zhang and Hongyang Zhang -- On Editing Graphs into 2-Club Clusters / Hong Liu, Peng Zhang and Daming Zhu.
Solving Generalized Optimization Problems Subject to SMT Constraints / Feifei Ma, Jun Yan and Jian Zhang -- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition / Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang -- Zero-Sum Flow Numbers of Regular Graphs / Tao-Ming Wang and Shih-Wei Hu -- More Efficient Parallel Integer Sorting / Yijie Han and Xin He -- Fast Relative Lempel-Ziv Self-index for Similar Sequences / Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- A Comparison of Performance Measures via Online Search / Joan Boyar, Kim S. Larsen and Abyayananda Maiti -- Online Exploration of All Vertices in a Simple Polygon / Yuya Higashikawa and Naoki Katoh -- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs / Minati De, Subhas C. Nandy and Sasanka Roy -- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs / Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang -- An Improved Approximation Algorithm for the Bandpass Problem / Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin -- Partial Degree Bounded Edge Packing Problem / Peng Zhang -- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem / Zhixiang Chen, Bin Fu and Binhai Zhu.
Record Nr. NYU-004622799
[FAW-AAIM (Conference) (2012 : Beijing, China)]  
Materiale a stampa
Lo trovi qui: New York University
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2011, Jinhua, China, May 28-31, 2011, proceedings / Mikhail Atallah, Xiang-Yang Li, Binhai Zhu (eds.).
Creatore [FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]
Estensione 1 online resource (xiii, 390 pages) : illustrations.
Accesso persona Atallah, Mikhail J.
Li, Xiang-Yang, 1971-
Zhu, Binhai, 1966-
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642212048
3642212042
9783642212031
3642212034
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11075629
[FAW-AAIM (Conference) (2011 : Jinhua Shi, China)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013 : proceedings / Michael Fellows, Xuehou Tan, Binhai Zhu (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2013, Dalian, China, June 26-28, 2013 : proceedings / Michael Fellows, Xuehou Tan, Binhai Zhu (eds.).
Creatore [FAW-AAIM (Conference) (3rd : 2013 : Dalian Shi, China)]
Estensione 1 online resource (xi, 364 pages) : illustrations (black and white).
Disciplina 005.1
Accesso persona Fellows, M. R. (Michael Ralph), 1952-editor
Tan, Xuehou, editor
Zhu, Binhai, 1966-editor
Accesso convegno Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, FAW-AAIM (26-06-2013 - 28-06-2013 : Dalian, China)
Genere/Forma Electronic books
Conference papers and proceedings
Ebook
Congresses
ISBN 9783642387562
364238756X
9783642387555
3642387551
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures. The Square Root Phenomenon in Planar Graphs / Dániel Marx -- An Algorithm for Determining Whether a Pair of Polygons Is Reversible / Jin Akiyama, Hyunwoo Seong -- Contributed Papers. Disjoint Small Cycles in Graphs and Bipartite Graphs / Ding Ma, Yunshu Gao -- An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree / Marcin Krzywkowski -- Algorithms for Testing Length Four Permutations / Yijie Han, Sanjeev Saxena -- Partial Degree Bounded Edge Packing Problem with Arbitrary Bounds / Pawan Aurora, Sumit Singh, Shashank K. Mehta -- Faster Exact Computation of rSPR Distance / Zhi-Zhong Chen, Lusheng Wang -- Arbitrated Quantum Signature Schemes: Attacks and Security / Xiangfu Zou, Daowen Qiu -- Randomized Algorithms for Removable Online Knapsack Problems / Xin Han, Yasushi Kawase, Kazuhisa Makino -- An Exact Algorithm for Maximum Independent Set in Degree-5 Graphs / Mingyu Xiao, Hiroshi Nagamochi -- FWLS: A Local Search for Graph Coloring / Wei Wu, Chuan Luo, Kaile Su.
A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids / Mark Korenblit, Vadim E. Levit -- Monomial Testing and Applications / Shenshi Chen -- The Optimal Rescue Path Set Problem in Undirected Graphs / Huili Zhang, Yinfeng Xu -- Expected Computations on Color Spanning Sets / Chenglin Fan [and others] -- Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs / Min Lu, Tian Liu, Ke Xu -- Spanning Distribution Trees of Graphs / Masaki Kawabata, Takao Nishizeki -- A Cutting Plane Heuristic Algorithm for the Time Dependent Chinese Postman Problem / Jinghao Sun, Yakun Meng, Guozhen Tan -- Zero-Visibility Cops and Robber Game on a Graph / Dariusz Dereniowski [and others] -- On (k, ℓ)-Graph Sandwich Problems / Fernanda Couto [and others] -- Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints / J. Crampton [and others] -- Two-Round Discrete Voronoi Game along a Line / Aritra Banik [and others] -- Inverse Maximum Flow Problems under the Combining Norms / Longcheng Liu.
The Edge-Recoloring Cost of Paths and Cycles in Edge-Colored Graphs and Digraphs / Carlos A. Martinhon, Luérbio Faria -- A Cost-Efficient Scheduling Algorithm for Traffic Grooming / Xianrong Liu [and others] -- Strategies of Groups Evacuation from a Convex Region in the Plane / Yinfeng Xu, Lan Qin -- Kernelization and Lower Bounds of the Signed Domination Problem / Ying Zheng, Jianxin Wang, Qilong Feng -- On Edge-Independent Sets / Ton Kloks, Ching-Hao Liu, Sheung-Hung Poon -- On the Complexity of Approximate Sum of Sorted List / Bin Fu -- Large Hypertree Width for Sparse Random Hypergraphs / Chaoyi Wang, Tian Liu, Ke Xu -- On Perfect Absorbants in De Bruijn Digraphs / Yue-Li Wang, Kuo-Hua Wu, Ton Kloks -- Multi-Multiway Cut Problem on Graphs of Bounded Branch Width / Xiaojie Deng, Bingkai Lin, Chihao Zhang -- Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints / Yumei Huo, Hairong Zhao -- Zero-Sum Flow Numbers of Hexagonal Grids / Tao-Ming Wang, Guang-Hui Zhang -- Pattern-Guided k-Anonymity / Robert Bredereck, André Nichterlein, Rolf Niedermeier.
Record Nr. NYU-004637373
[FAW-AAIM (Conference) (3rd : 2013 : Dalian Shi, China)]  
Materiale a stampa
Lo trovi qui: New York University