東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms and complexity = 14th Int...

International Conference on Algorithms and Complexity (2025 :)

FindBook

Google Book

Amazon

博客來

Algorithms and complexity = 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025 : proceedings.. Part II /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms and complexity/ edited by Irene Finocchi, Loukas Georgiadis.
其他題名:	14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025 : proceedings.
其他題名:	CIAC 2025
其他作者:	Finocchi, Irene.
團體作者:	International Conference on Algorithms and Complexity
出版者:	Cham :Springer Nature Switzerland : : 2025.,
面頁冊數:	xiv, 364 p. :ill. (some col.), digital ;24 cm.
內容註:	Happy set problems on cubic graphs and convex bipartite graphs. -- Network Creation Games with 2-Neighborhood Maximization. -- Almost-catalytic Computation. -- The Complexity of Landmark Hub Labeling. -- Improved Bounds for Geodetic Hulls. -- Disjoint Temporal Walks Under Waiting Time Constraints. -- A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. -- Bounded degree QBF and positional games. -- Subsequence Matching and LCS with Segment Number Constraints. -- Fast Geographic Routing in Fixed-Growth Graphs. -- Arithmetic Circuits with Division. -- Pinwheel Covering. -- On the Hardness of the Drone Delivery Problem. -- Nonpartisan Feedback Vertex Set. -- Parameterized Complexity of Disconnected Matchings. -- Burning Path-like and Clique-like Graphs. -- Online Bichromatic Piercing Set Problem. -- Packing dimers to maximum occupancy under soft-core constraints. -- Atoms versus Avoiding Simplicial Vertices. -- Supereulerian Testing on Semi-Eulerian Graphs. -- Perpetual Scheduling with Explorable Uncertainty. -- Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement.
Contained By:	Springer Nature eBook
標題:	Algorithms - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-031-92935-9
ISBN:	9783031929359

Algorithms and complexity = 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025 : proceedings.. Part II /
Algorithms and complexity14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025 : proceedings.Part II /[electronic resource] :CIAC 2025edited by Irene Finocchi, Loukas Georgiadis. - Cham :Springer Nature Switzerland :2025. - xiv, 364 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,156801611-3349 ;. - Lecture notes in computer science ;15680..

Happy set problems on cubic graphs and convex bipartite graphs. -- Network Creation Games with 2-Neighborhood Maximization. -- Almost-catalytic Computation. -- The Complexity of Landmark Hub Labeling. -- Improved Bounds for Geodetic Hulls. -- Disjoint Temporal Walks Under Waiting Time Constraints. -- A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. -- Bounded degree QBF and positional games. -- Subsequence Matching and LCS with Segment Number Constraints. -- Fast Geographic Routing in Fixed-Growth Graphs. -- Arithmetic Circuits with Division. -- Pinwheel Covering. -- On the Hardness of the Drone Delivery Problem. -- Nonpartisan Feedback Vertex Set. -- Parameterized Complexity of Disconnected Matchings. -- Burning Path-like and Clique-like Graphs. -- Online Bichromatic Piercing Set Problem. -- Packing dimers to maximum occupancy under soft-core constraints. -- Atoms versus Avoiding Simplicial Vertices. -- Supereulerian Testing on Semi-Eulerian Graphs. -- Perpetual Scheduling with Explorable Uncertainty. -- Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement.

The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10-12, 2025. The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.

ISBN: 9783031929359

Standard No.: 10.1007/978-3-031-92935-9doiSubjects--Topical Terms:

607038
Algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 518.1

Algorithms and complexity = 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025 : proceedings.. Part II /
LDR:02817nmm a2200349 a 4500 001 2409865
003 DE-He213
005 20250518130237.0
006 m d
007 cr nn 008maaau
008 260204s2025 sz s 0 eng d
020 $a 9783031929359 $q (electronic bk.)
020 $a 9783031929342 $q (paper)
024 7 $a 10.1007/978-3-031-92935-9 $2 doi
035 $a 978-3-031-92935-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UML $2 bicssc
072 7 $a COM012000 $2 bisacsh
072 7 $a UML $2 thema
082 0 4 $a 518.1 $2 23
090 $a QA76.9.A43 $b I61 2025
111 2 $a International Conference on Algorithms and Complexity $n (14th : $d 2025 : $c Rome, Italy) $3 3783383
245 1 0 $a Algorithms and complexity $h [electronic resource] : $b 14th International Conference, CIAC 2025, Rome, Italy, June 10-12, 2025 : proceedings. $n Part II / $c edited by Irene Finocchi, Loukas Georgiadis.
246 3 $a CIAC 2025
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xiv, 364 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 15680
505 0 $a Happy set problems on cubic graphs and convex bipartite graphs. -- Network Creation Games with 2-Neighborhood Maximization. -- Almost-catalytic Computation. -- The Complexity of Landmark Hub Labeling. -- Improved Bounds for Geodetic Hulls. -- Disjoint Temporal Walks Under Waiting Time Constraints. -- A Fixed-Parameter Branching Algorithm for Chromatic Correlation Clustering. -- Bounded degree QBF and positional games. -- Subsequence Matching and LCS with Segment Number Constraints. -- Fast Geographic Routing in Fixed-Growth Graphs. -- Arithmetic Circuits with Division. -- Pinwheel Covering. -- On the Hardness of the Drone Delivery Problem. -- Nonpartisan Feedback Vertex Set. -- Parameterized Complexity of Disconnected Matchings. -- Burning Path-like and Clique-like Graphs. -- Online Bichromatic Piercing Set Problem. -- Packing dimers to maximum occupancy under soft-core constraints. -- Atoms versus Avoiding Simplicial Vertices. -- Supereulerian Testing on Semi-Eulerian Graphs. -- Perpetual Scheduling with Explorable Uncertainty. -- Exact and Parameterized Algorithms for Window Width Minimization in Bipartite Arrangement.
520 $a The two-volume set LNCS 15679 and 15680 constitutes the refereed proceedings of the 14th International Conference on Algorithms and Complexity, CIAC 2025, held in Rome, Italy, during June 10-12, 2025. The 44 full papers included in these proceedings were carefully reviewed and selected from 110 submissions. They focus on all aspects of important venue for researchers working on computational complexity and the design, analysis, experimentation, and application of efficient algorithms and data structures.
650 0 $a Algorithms $v Congresses. $3 607038
650 0 $a Computational complexity $v Congresses. $3 628000
650 1 4 $a Computer Graphics. $3 892532
650 2 4 $a Symbolic and Algebraic Manipulation. $3 891222
650 2 4 $a Computer System Implementation. $3 892710
650 2 4 $a Artificial Intelligence. $3 769149
650 2 4 $a Design and Analysis of Algorithms. $3 3538532
700 1 $a Finocchi, Irene. $3 2162639
700 1 $a Georgiadis, Loukas. $3 3783384
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 15680. $3 3783386
856 4 0 $u https://doi.org/10.1007/978-3-031-92935-9
950 $a Computer Science (SpringerNature-11645)