標題: Titlebook: Combinatorial Algorithms; 33rd International W Cristina Bazgan,Henning Fernau Conference proceedings 2022 Springer Nature Switzerland AG 20 [打印本頁] 作者: Indigent 時間: 2025-3-21 19:33
書目名稱Combinatorial Algorithms影響因子(影響力)
書目名稱Combinatorial Algorithms影響因子(影響力)學科排名
書目名稱Combinatorial Algorithms網絡公開度
書目名稱Combinatorial Algorithms網絡公開度學科排名
書目名稱Combinatorial Algorithms被引頻次
書目名稱Combinatorial Algorithms被引頻次學科排名
書目名稱Combinatorial Algorithms年度引用
書目名稱Combinatorial Algorithms年度引用學科排名
書目名稱Combinatorial Algorithms讀者反饋
書目名稱Combinatorial Algorithms讀者反饋學科排名
作者: Munificent 時間: 2025-3-21 22:08 作者: Fibrinogen 時間: 2025-3-22 03:20 作者: OWL 時間: 2025-3-22 05:27
An Efficient Algorithm for?the?Proximity Connected Two Center Problemared in the context of wireless networks in 1992 [.], but obtaining a nontrivial deterministic algorithm for the problem remained open. In this paper, we resolve this open problem by providing a deterministic . time algorithm for the problem.作者: 節(jié)省 時間: 2025-3-22 12:46
0302-9743 as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were carefully reviewed and selected from 86 submissions. They deal with diverse topics related to combinatorial algorithms, such as algorithms and data structures; algorithmic?and combinatorical 作者: 夾死提手勢 時間: 2025-3-22 15:03
Improve Phase: I Is for Improveof perfect matchings with at most . crossings is superexponential in . if . is superlinear in .. (4)?Point sets in convex position minimize the number of perfect matchings with at most . crossings for ., and maximize the number of perfect matchings with . crossings and with . crossings.作者: 夾死提手勢 時間: 2025-3-22 18:34
,Bestimmung der Stichprobengr??e,r, the exponent of . in our proposed scheme may decrease down to 2, depending on the . algorithm used. Furthermore, while the aforementioned state of the art complexity, expressed in the form ., has constant ., our results establish that ..作者: 猜忌 時間: 2025-3-23 00:02
Statistics and Probability with Rh 1. seems to be very close to the problem of finding an independent set of maximum size (. .), we show that, interestingly, there exist 1-extendable graphs for which . is NP-hard. Finally, we investigate a parameterized version of 1..作者: 緯度 時間: 2025-3-23 02:34 作者: 拍下盜公款 時間: 2025-3-23 08:26
Approximating Subset Sum Ratio via?Subset Sum Computationsr, the exponent of . in our proposed scheme may decrease down to 2, depending on the . algorithm used. Furthermore, while the aforementioned state of the art complexity, expressed in the form ., has constant ., our results establish that ..作者: 賄賂 時間: 2025-3-23 12:56
1-Extendability of Independent Setsh 1. seems to be very close to the problem of finding an independent set of maximum size (. .), we show that, interestingly, there exist 1-extendable graphs for which . is NP-hard. Finally, we investigate a parameterized version of 1..作者: 立即 時間: 2025-3-23 17:49 作者: apiary 時間: 2025-3-23 21:39
Graph Parameters, Implicit Representations and?Factorial Propertieslicit representations deal with boundedness of some parameters, such as degeneracy or clique-width. In the present paper, we analyse more graph parameters and prove a number of new results related to implicit representation and factorial properties.作者: Paraplegia 時間: 2025-3-23 23:32
An Adjacency Labeling Scheme Based on a Decomposition of Trees into Caterpillarsefficient. We propose a simple tree-decomposition based encoding scheme and use it give an adjacency labeling of size .-bits. Here . is the clique-width of the graph family. We also extend the result to a certain family of .-probe graphs.作者: Synthesize 時間: 2025-3-24 05:19
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution a drawing algorithm that takes as input a 3-connected plane graph with . vertices and . internal faces and computes a convex straight-line drawing with edge-vertex resolution at least . on an integer grid of size ., where .. Our result improves the previously best-known area bound of . by Chrobak, Goodrich and Tamassia.作者: FLAG 時間: 2025-3-24 10:28
Tukey Depth Histogramsputational geometry can be phrased in terms of such depth histograms. As our main result, we give a complete characterization of the depth histograms of points, that is, for any dimension . we give a description of all possible histograms .. This then allows us to compute the exact number of different histograms of points.作者: TOM 時間: 2025-3-24 12:29
,Bestimmung der Stichprobengr??e,licit representations deal with boundedness of some parameters, such as degeneracy or clique-width. In the present paper, we analyse more graph parameters and prove a number of new results related to implicit representation and factorial properties.作者: 不適 時間: 2025-3-24 17:06
Statistics and Probability with Refficient. We propose a simple tree-decomposition based encoding scheme and use it give an adjacency labeling of size .-bits. Here . is the clique-width of the graph family. We also extend the result to a certain family of .-probe graphs.作者: Vulnerary 時間: 2025-3-24 20:55 作者: 專橫 時間: 2025-3-25 00:18
https://doi.org/10.1007/978-1-4614-3652-2putational geometry can be phrased in terms of such depth histograms. As our main result, we give a complete characterization of the depth histograms of points, that is, for any dimension . we give a description of all possible histograms .. This then allows us to compute the exact number of different histograms of points.作者: 詼諧 時間: 2025-3-25 07:23 作者: 模范 時間: 2025-3-25 07:33
https://doi.org/10.1007/978-81-322-2325-2 of Parameterized Complexity. For a family of graphs ., the input to . . is a graph . and an integer ., and the objective is to decide whether there is a vertex-subset, called a ., whose removal from . results in a graph contained in the family ., and such that .. Traditionally, the majority of the 作者: 對手 時間: 2025-3-25 11:50 作者: arcane 時間: 2025-3-25 16:12 作者: Foam-Cells 時間: 2025-3-25 22:00
Improve Phase: I Is for Improve admit at least . different plane perfect matchings, where . is the .-th Catalan number.Generalizing this result we are interested in the number of drawings of perfect matchings which have . crossings. We show the following results. (1)?For every ., any set of . points, . sufficiently large, admits 作者: 令人不快 時間: 2025-3-26 02:24 作者: Entropion 時間: 2025-3-26 07:20
,Bestimmung der Stichprobengr??e,to 1 as possible. Our scheme makes use of exact and approximate algorithms for the closely related . problem, hence any progress over those—such as the recent improvement due to Bringmann and Nakos [SODA 2021]—carries over to our FPTAS. Depending on the relationship between the size of the input set作者: 靈敏 時間: 2025-3-26 10:53 作者: nugatory 時間: 2025-3-26 14:29
Process Capability Analysis with Rcently introduced online minimum peak appointment scheduling problem. The high level objective in both problems is to pack arriving items of sizes at most 1 into bins of capacity 1 as efficiently as possible, but the exact formalizations differ. In the appointment scheduling problem, every item has 作者: 露天歷史劇 時間: 2025-3-26 16:48
Statistics and Probability with Rding scheme for each member of the family such that we can decode the adjacency information of any pair of vertices only from their encoded labels. Further, we want the length of each label to be short (logarithmic in ., the number of vertices) and the encoding-decoding scheme to be computationally 作者: Feature 時間: 2025-3-26 23:01
Statistics and Probability with Rof?. that is a Lyndon word. We propose algorithms for finding such a subsequence in . time with . space, or . in . space and time. Our first result can be extended to find the longest common Lyndon subsequence of two strings of length?. in . time using . space.作者: 晚間 時間: 2025-3-27 02:21
Process Capability Analysis with Rests on the groups. Recently, group testing has been used to design efficient COVID-19 testing, so that resources are saved while still identifying all infected individuals. Due to test waiting times, a focus is given to non-adaptive CGT, where groups are designed a priori and all tests can be done 作者: HUMID 時間: 2025-3-27 08:32
Statistics and Probability with Red in the last decades. Motivated by applications, such as graph editors, we additionally require the obtained drawings to have bounded ., that is, the closest distance between a vertex and any non-incident edge is lower bounded by a constant that does not depend on the size of the graph. We present作者: V切開 時間: 2025-3-27 09:59 作者: Medicaid 時間: 2025-3-27 14:23 作者: 呼吸 時間: 2025-3-27 19:15 作者: 和平 時間: 2025-3-27 23:41
Six Sigma – kompakt und praxisnahidencies and is a local bijection. This notion stems from topological graph theory, but has also found applications in combinatorics and theoretical computer science..It has been known that for every fixed simple regular graph . of valency greater than 2, deciding if an input graph covers . is NP-co作者: 我悲傷 時間: 2025-3-28 05:54
https://doi.org/10.1007/978-3-031-06678-8approximation algorithms analysis; combinatorics; complexity classes; computer networks; computer vision作者: 不能妥協(xié) 時間: 2025-3-28 08:41 作者: Malleable 時間: 2025-3-28 10:53 作者: impaction 時間: 2025-3-28 18:35 作者: 發(fā)誓放棄 時間: 2025-3-28 20:50
Combinatorial Algorithms978-3-031-06678-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 可以任性 時間: 2025-3-29 02:02 作者: 是貪求 時間: 2025-3-29 05:56 作者: CRANK 時間: 2025-3-29 07:34
Distance from?Triviality 2.0: Hybrid Parameterizationse and certain width measures of the graph. In this talk we will look at some exciting developments in this direction in relation to two such parameters that are “hybridizations” of the modulator size, and the well-explored graph parameters – treewidth and treedepth.作者: 使服水土 時間: 2025-3-29 15:02 作者: 課程 時間: 2025-3-29 15:41
Lower Bounds on?the?Performance of?Online Algorithms for?Relaxed Packing Problemslar bin for every packed item (and nothing else), is to pack as valuable a subset as possible. In this last problem it is possible to reject items, that is, deliberately not pack them, as well as to remove packed items at any later point in time, which adds flexibility to the problem.作者: 使長胖 時間: 2025-3-29 21:44 作者: 品牌 時間: 2025-3-30 02:32 作者: 開始從未 時間: 2025-3-30 07:37
https://doi.org/10.1007/978-81-322-2325-2e and certain width measures of the graph. In this talk we will look at some exciting developments in this direction in relation to two such parameters that are “hybridizations” of the modulator size, and the well-explored graph parameters – treewidth and treedepth.作者: 雪上輕舟飛過 時間: 2025-3-30 12:04
Measurement System Analysis with Rugmentation approach (initially introduced, e.g., for bipartite matchings by Hopcroft and Karp, and also by Dinic) and present a novel algorithm that reduces the time needed for the second phase to . thus completely closing the gap between 1-restricted and unrestricted cases.作者: Interferons 時間: 2025-3-30 16:24 作者: Induction 時間: 2025-3-30 17:33 作者: HEDGE 時間: 2025-3-30 21:54
Six Sigma – kompakt und praxisnahregular multigraph . of valency greater than 2 which contains at least one semi-simple vertex (i.e., a vertex which is incident with no loops, with no multiple edges and with at most one semi-edge). Using this result we almost show the NP-co/polytime dichotomy for the computational complexity of . o作者: pellagra 時間: 2025-3-31 01:50
Conference proceedings 2022aph algorithms and modelling?with graphs; graph drawingand graph labelling; network theory and temporal?graphs; quantum computing and algorithms for quantum computers;?online algorithms; parameterized and exact algorithms; probabilistic and.randomized algorithms; and streaming algorithms..作者: 熒光 時間: 2025-3-31 08:50 作者: tooth-decay 時間: 2025-3-31 10:05 作者: mediocrity 時間: 2025-3-31 16:41
On the?Existence of?EFX Allocationse would aim to divide the goods such that no agent envies another agent. However, since the goods are indivisible, such allocations may not always exist (a simple scenario involving two agents and a single good). Therefore, relaxations of envy-freeness have been proposed and extensively studied. We 作者: DEAWL 時間: 2025-3-31 20:05
Lower Bounds for?Restricted Schemes in?the?Two-Adaptive Bitprobe Modelarma?[.]. In that paper, the authors showed that such restricted schemes storing subsets of size 2 require . space. In this paper, we generalise the result to arbitrary subsets of size ., and prove that the space required for such restricted schemes will be ..
