Info
Frontiers in Algorithmics [[electronic resource] ] : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu
| Frontiers in Algorithmics [[electronic resource] ] : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 316 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence Theory of Computation Data Science Discrete Mathematics in Computer Science Numerical Analysis Artificial Intelligence |
| ISBN | 3-319-78455-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Parameterized algorithms -- Other algorighms. |
| Record Nr. | UNISA-996466228403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers in Algorithmics : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu
| Frontiers in Algorithmics : 12th International Workshop, FAW 2018, Guangzhou, China, May 8–10, 2018, Proceedings / / edited by Jianer Chen, Pinyan Lu |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (X, 316 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Artificial intelligence - Data processing Computer science - Mathematics Discrete mathematics Numerical analysis Artificial intelligence Theory of Computation Data Science Discrete Mathematics in Computer Science Numerical Analysis Artificial Intelligence |
| ISBN |
9783319784557
3319784552 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph algorithms -- Parameterized algorithms -- Other algorighms. |
| Record Nr. | UNINA-9910349424303321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings / / edited by Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang
| Frontiers in Algorithmics and Algorithmic Aspects in Information and Management [[electronic resource] ] : Joint International Conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012, Proceedings / / edited by Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XVII, 370 p. 77 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Electronic data processing—Management Artificial intelligence—Data processing Discrete Mathematics in Computer Science Mathematics of Computing Theory of Computation IT Operations Data Science |
| ISBN | 3-642-29700-5 |
| 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. | UNISA-996465995203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu
| Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu |
| Autore | Chau Vincent |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (747 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
DürrChristoph <1969->
LiMinming LuPinyan |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Communication Networks Software Engineering Design and Analysis of Algorithms |
| ISBN | 9789819683123 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter -- $k$-Universality of Regular Languages Revisited -- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions -- Complexity Classes for Online Problems with and without Predictions -- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model -- Mixed Graph Covering with Target Constraints -- Multiplication of 0-1 matrices via clustering -- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances -- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem -- Approximation Algorithms for Individual Preference Facility Location -- The online power cover problem on a line -- The Subinterval Cover Problem -- Oblivious Robots Under Round Robin: Gathering on Rings -- Finding a Set of Long Common Substrings with Repeats from m Input Strings -- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties -- Less-excludable Mechanism for DAOs in Public Good Auctions -- TBDS: Transaction-Based Data Sharing -- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents -- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer -- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources -- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms -- Minimizing Blocking Agents for Stable Matching with Partial Approval Information -- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives -- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games -- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints -- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems -- Large-Scale Contextual Market Equilibrium Computation through Deep Learning -- Fair Value Distribution in Cooperative Committee Election -- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs -- Mechanism Design for Auctions with Externalities on Budgets. |
| Record Nr. | UNINA-9911011817803321 |
Chau Vincent
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu
| Frontiers of Algorithmics : 19th International Joint Conference, IJTCS-FAW 2025, Paris, France, June 30 – July 2, 2025, Proceedings / / edited by Vincent Chau, Christoph Dürr, Minming Li, Pinyan Lu |
| Autore | Chau Vincent |
| Edizione | [1st ed. 2025.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 |
| Descrizione fisica | 1 online resource (747 pages) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
DürrChristoph <1969->
LiMinming LuPinyan |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Numerical analysis Data structures (Computer science) Information theory Computer networks Software engineering Algorithms Discrete Mathematics in Computer Science Numerical Analysis Data Structures and Information Theory Computer Communication Networks Software Engineering Design and Analysis of Algorithms |
| ISBN | 9789819683123 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domination in Diameter Two Graphs and the 2 Club Cluster Vertex Deletion Parameter -- $k$-Universality of Regular Languages Revisited -- Comparing the Hardness of Online Minimization and Maximization Problems with Predictions -- Complexity Classes for Online Problems with and without Predictions -- Scheduling with Testing: Competitive Algorithms for Minimizing the Total Weighted Completion Time in the Adversarial Model -- Mixed Graph Covering with Target Constraints -- Multiplication of 0-1 matrices via clustering -- From MAXCUT to MAXNAESAT: Elegant Proofs and Algorithmic Advances -- Exact Algorithms for the Maximum $k$-Balanced Weighted Biclique Problem -- Approximation Algorithms for Individual Preference Facility Location -- The online power cover problem on a line -- The Subinterval Cover Problem -- Oblivious Robots Under Round Robin: Gathering on Rings -- Finding a Set of Long Common Substrings with Repeats from m Input Strings -- A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties -- Less-excludable Mechanism for DAOs in Public Good Auctions -- TBDS: Transaction-Based Data Sharing -- Pure Nash Equilibria of Weighted Picking Sequence Protocol is WEF1 for Two Agents -- A Comparative Study of Waitlist Mechanisms: Deferral Versus Pay-Per-Offer -- Optimal Repurchasing Contract Design for Efficient Utilization of Computing Resources -- Characterizing Strategyproofness Through Score Functions in Voting Mechanisms -- Minimizing Blocking Agents for Stable Matching with Partial Approval Information -- The Capacity-Constrained Facility Location Problem with Ordinal Preferences: Algorithmic and Mechanism Design Perspectives -- Regularized Minimax-V Learning for Solving Randomly Terminating Two-player Zero-sum Markov Games -- Improved Approximation of Maximin Share Fair Allocation under Generalized Assignment Constraints -- Optimal Hiring Strategy in Auction-Based Crowdsourcing Systems -- Large-Scale Contextual Market Equilibrium Computation through Deep Learning -- Fair Value Distribution in Cooperative Committee Election -- A Payoff-Based Policy Gradient Method in Stochastic Games with Long-Run Average Payoffs -- Mechanism Design for Auctions with Externalities on Budgets. |
| Record Nr. | UNISA-996664549203316 |
|
Chau Vincent
|
||
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2025 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science : 36th National Conference, NCTCS 2018, Shanghai, China, October 13–14, 2018, Proceedings / / edited by Lian Li, Pinyan Lu, Kun He
| Theoretical Computer Science : 36th National Conference, NCTCS 2018, Shanghai, China, October 13–14, 2018, Proceedings / / edited by Lian Li, Pinyan Lu, Kun He |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (IX, 159 p. 38 illus.) |
| Disciplina | 004 |
| Collana | Communications in Computer and Information Science |
| Soggetto topico |
Algorithms
Computer science Machine theory Artificial intelligence Computer vision Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Artificial Intelligence Computer Vision |
| ISBN | 981-13-2712-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algorithms -- Software theory and method -- Data science. |
| Record Nr. | UNINA-9910299309403321 |
| Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Web and Internet Economics [[electronic resource] ] : 13th International Conference, WINE 2017, Bangalore, India, December 17–20, 2017, Proceedings / / edited by Nikhil R. Devanur, Pinyan Lu
| Web and Internet Economics [[electronic resource] ] : 13th International Conference, WINE 2017, Bangalore, India, December 17–20, 2017, Proceedings / / edited by Nikhil R. Devanur, Pinyan Lu |
| Autore | Lu Pinyan |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Springer Nature, 2017 |
| Descrizione fisica | 1 online resource (XI, 408 p. 62 illus.) |
| Disciplina | 005.3 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Algorithms
E-commerce Computers Computer communication systems Application software Artificial intelligence Algorithm Analysis and Problem Complexity e-Commerce/e-business Computation by Abstract Devices Computer Communication Networks Information Systems Applications (incl. Internet) Artificial Intelligence |
| Soggetto non controllato |
game theory
computer science |
| ISBN | 3-319-71924-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theoretical computer science -- Artificial intelligence -- Microeconomics -- Problems at the intersection of computation, game theory and economics. . |
| Record Nr. | UNISA-996466430803316 |
|
Lu Pinyan
|
||
| Springer Nature, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Web and Internet Economics : 13th International Conference, WINE 2017, Bangalore, India, December 17–20, 2017, Proceedings / / edited by Nikhil R. Devanur, Pinyan Lu
| Web and Internet Economics : 13th International Conference, WINE 2017, Bangalore, India, December 17–20, 2017, Proceedings / / edited by Nikhil R. Devanur, Pinyan Lu |
| Autore | Lu Pinyan |
| Edizione | [1st ed. 2017.] |
| Pubbl/distr/stampa | Springer Nature, 2017 |
| Descrizione fisica | 1 online resource (XI, 408 p. 62 illus.) |
| Disciplina | 005.3 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Algorithms
Electronic commerce Computer science Computer networks Application software Artificial intelligence e-Commerce and e-Business Theory of Computation Computer Communication Networks Computer and Information Systems Applications Artificial Intelligence |
| ISBN |
9783319719245
3319719246 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theoretical computer science -- Artificial intelligence -- Microeconomics -- Problems at the intersection of computation, game theory and economics. . |
| Record Nr. | UNINA-9910262253603321 |
|
Lu Pinyan
|
||
| Springer Nature, 2017 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||