標題: Titlebook: Computing and Combinatorics; 25th International C Ding-Zhu Du,Zhenhua Duan,Cong Tian Conference proceedings 2019 Springer Nature Switzerlan [打印本頁] 作者: CYNIC 時間: 2025-3-21 18:24
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學科排名
書目名稱Computing and Combinatorics網(wǎng)絡公開度
書目名稱Computing and Combinatorics網(wǎng)絡公開度學科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學科排名
作者: 削減 時間: 2025-3-21 23:35 作者: laceration 時間: 2025-3-22 02:16
https://doi.org/10.1007/978-3-030-20859-2. problem on . i.e. overlap graphs of rectangles intersecting a common straight line. Here . denotes the number of vertices of the input graph..Our second result is the first constant factor approximation for . problem on . which is a strict generalisation of a graphclass considered by Bandyapadhyay et al. (MFCS 2018).作者: Recess 時間: 2025-3-22 06:13
https://doi.org/10.1007/978-3-030-20859-2ines we calibrate at a given time. Moreover, jobs have release time, deadline and unit processing time. The objective is to schedule all jobs with the minimum cost of calibrations. We give a dynamic programming to solve the case with arbitrary cost function. Then, we propose several faster approximation algorithm for different cost function.作者: EXPEL 時間: 2025-3-22 12:41
Fully Dynamic Arboricity Maintenance,y takes . time?[.]..We complement our upper bound with a lower bound result of amortized . for any algorithm that maintains a forest decomposition of size arboricity of the graph under edge insertions and deletions.作者: Fibrillation 時間: 2025-3-22 15:24 作者: Fibrillation 時間: 2025-3-22 19:34
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line,. problem on . i.e. overlap graphs of rectangles intersecting a common straight line. Here . denotes the number of vertices of the input graph..Our second result is the first constant factor approximation for . problem on . which is a strict generalisation of a graphclass considered by Bandyapadhyay et al. (MFCS 2018).作者: notion 時間: 2025-3-22 23:31
Minimizing the Cost of Batch Calibrations,ines we calibrate at a given time. Moreover, jobs have release time, deadline and unit processing time. The objective is to schedule all jobs with the minimum cost of calibrations. We give a dynamic programming to solve the case with arbitrary cost function. Then, we propose several faster approximation algorithm for different cost function.作者: 事物的方面 時間: 2025-3-23 01:59 作者: 小母馬 時間: 2025-3-23 05:46 作者: BLAND 時間: 2025-3-23 13:08
Kinematics of Thin Walled Beams,out revealing it. For this, we show in particular that it is possible to physically prove that a particular element is present in a list, without revealing any other value in the list, and without revealing the actual position of that element in the list.作者: 不易燃 時間: 2025-3-23 17:11 作者: GUILT 時間: 2025-3-23 19:31 作者: 航海太平洋 時間: 2025-3-24 00:50
Thin-Walled Beams Carrying Stores,d setting. The main challenge we address is the construction of hard parameterized polynomials. In fact, we show that there are polynomials computed by depth four circuits of small size (in the parameterized sense), but have high rank of the partial derivative matrix.作者: 孤獨無助 時間: 2025-3-24 05:22 作者: 巧思 時間: 2025-3-24 08:22 作者: Detonate 時間: 2025-3-24 13:43
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models,d setting. The main challenge we address is the construction of hard parameterized polynomials. In fact, we show that there are polynomials computed by depth four circuits of small size (in the parameterized sense), but have high rank of the partial derivative matrix.作者: 辯論 時間: 2025-3-24 17:11
Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs,exactly for classes . of graphs with acyclic chromatic number bounded by a constant. The minimum number of vertices in a .-uniform graph for a class . is known to be . and .. In this paper we close the gap by improving the upper bound to . for any rational ..作者: adduction 時間: 2025-3-24 19:50 作者: 沉積物 時間: 2025-3-25 02:48
https://doi.org/10.1007/978-3-662-01031-0 deletion variants of the problem are .-hard. This stands in contrast to the fact that deleting edges to obtain a forest or a tree is equivalent to the problem of finding a minimum cost spanning tree, which can be solved in polynomial time. We also establish that both problems are . by the standard parameter.作者: bronchodilator 時間: 2025-3-25 03:48 作者: Eclampsia 時間: 2025-3-25 11:22
A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice,e growth constant of polyaboloes (animals on this lattice), proving that?.. The proof of the bound is based on a concatenation argument and on calculus manipulations. If we also rely on an unproven assumption, which is, however, supported by empirical data, we obtain the conditional slightly-better lower bound?2.4635.作者: Obscure 時間: 2025-3-25 13:04 作者: Reclaim 時間: 2025-3-25 17:06 作者: infarct 時間: 2025-3-25 20:07 作者: Reclaim 時間: 2025-3-26 02:56
Vibrations of Thin Elastic Shells,e growth constant of polyaboloes (animals on this lattice), proving that?.. The proof of the bound is based on a concatenation argument and on calculus manipulations. If we also rely on an unproven assumption, which is, however, supported by empirical data, we obtain the conditional slightly-better lower bound?2.4635.作者: Excise 時間: 2025-3-26 05:55 作者: 反抗者 時間: 2025-3-26 12:09
Solid Mechanics and Its Applicationsomplete for split graphs and therefore chordal graphs, but linear-time solvable for proper interval graphs, which equals the complexity of . on these classes..Both results follow from a new structural theorem, that every instance of . or . has an optimal ordering of a restricted form.作者: granite 時間: 2025-3-26 15:24 作者: hurricane 時間: 2025-3-26 17:38 作者: 闡釋 時間: 2025-3-27 00:46 作者: 多節(jié) 時間: 2025-3-27 03:08
Vibrations of Thin Elastic Shells,e growth constant of polyaboloes (animals on this lattice), proving that?.. The proof of the bound is based on a concatenation argument and on calculus manipulations. If we also rely on an unproven assumption, which is, however, supported by empirical data, we obtain the conditional slightly-better 作者: expire 時間: 2025-3-27 06:05 作者: 值得尊敬 時間: 2025-3-27 09:31 作者: Foreknowledge 時間: 2025-3-27 15:35 作者: 禮節(jié) 時間: 2025-3-27 18:11 作者: 辯論的終結(jié) 時間: 2025-3-27 22:43 作者: 憤怒事實 時間: 2025-3-28 02:41 作者: Tremor 時間: 2025-3-28 08:34 作者: 剝削 時間: 2025-3-28 11:59 作者: 陳列 時間: 2025-3-28 18:10 作者: 噱頭 時間: 2025-3-28 19:23
The Historical Development of the Methodansforms and show several applications. For a function ., and . for . and ., the result of the transformation . is defined as ...As a warm up, we study alternation under linear shifts (when . is restricted to be the identity matrix) called the . (the smallest alternation that can be achieved for the作者: 聽寫 時間: 2025-3-28 23:15 作者: TAP 時間: 2025-3-29 03:11
Kinematics of Thin Walled Beams,tain exactly two black cells, and every black cell shares an edge with exactly one other black cell. We propose a secure interactive physical algorithm, relying only on cards, to realize a zero-knowledge proof of knowledge for Norinori. It allows a player to show that he or she knows a solution with作者: 觀點 時間: 2025-3-29 10:35
Thin-Walled Beams Carrying Stores,omial as the parameter. In particular, we consider the following special classes of multilinear algebraic branching programs: (1) Read Once Oblivious Algebraic Branching Programs (ROABPs); (2) Strict interval branching programs; and (3) Sum of read once formulas with restricted ordering..We obtain p作者: affect 時間: 2025-3-29 15:25
Thin-Walled Beams Carrying Stores,s all its neighbors in a single tie. That is, a post is indifferent amongst all its neighbours. Each post has a capacity denoting the maximum number of applicants that can be assigned to it. An assignment ., referred to as a ., is said to be ., if there is no other assignment . such that the number 作者: 增強 時間: 2025-3-29 16:21 作者: 功多汁水 時間: 2025-3-29 20:40
Solid Mechanics and Its Applicationsomplete for split graphs and therefore chordal graphs, but linear-time solvable for proper interval graphs, which equals the complexity of . on these classes..Both results follow from a new structural theorem, that every instance of . or . has an optimal ordering of a restricted form.作者: 抵押貸款 時間: 2025-3-30 01:40
Rotating Thin-Walled Anisotropic Beams,For a class . of graphs, the value . is the supremum of densities of graphs in?.. A .-edge-colored graph is a finite, simple graph with edges labeled by numbers .. A function from the vertex set of one .-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two d作者: 桉樹 時間: 2025-3-30 05:13 作者: 縮短 時間: 2025-3-30 10:32 作者: Functional 時間: 2025-3-30 16:22 作者: preeclampsia 時間: 2025-3-30 19:09
An FPTAS for a General Class of Parametric Optimization Problems,is interested in computing a solution for each possible value of the parameter. For many important parametric optimization problems including the parametric versions of the shortest path problem, the assignment problem, and the minimum cost flow problem, however, the piecewise linear function mappin作者: Asseverate 時間: 2025-3-31 00:37 作者: Mystic 時間: 2025-3-31 04:09
Diameter of Colorings Under Kempe Changes,t in the subgraph of . induced by the two color classes of . and ., and then swap the colors . and . in the component. Two .-colorings are called Kempe-equivalent if one can be transformed into the other by a sequence of Kempe-changes. We consider two problems, defined as follows: First, given two .作者: prosthesis 時間: 2025-3-31 07:54
Dominating Set on Overlap Graphs of Rectangles Intersecting a Line,d only if the corresponding rectangles in . . i.e. their boundaries intersect..In this article, assuming the . to be true we show that it is not possible to approximate the . (.) problem on rectangle overlap graphs with a factor . for any .. Previously only APX hardness was known for this problem du作者: Parley 時間: 2025-3-31 10:19 作者: irritation 時間: 2025-3-31 15:01
Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes,omorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. [.]. We consider three different variants of graph homomorphisms, namely ., . and . and obtain polynomial families complete for ., ., ., and . under each one of these. The polynomial families have the follow作者: 粗魯?shù)娜?nbsp; 時間: 2025-3-31 18:51 作者: SPALL 時間: 2025-3-31 23:11
Approximation Hardness of Travelling Salesman via Weighted Amplifiers,torial optimisation problems. In this paper we introduce the weighted amplifiers and weighted low occurrence of . problems as intermediate steps in the NP-hard gap reductions. Allowing the weights in intermediate problems is rather natural for the edge-weighted problems as . or .. We demonstrate the作者: deadlock 時間: 2025-4-1 03:33
Deleting to Structured Trees,his version of the problem is motivated by real-world scenarios that are best modeled by full binary trees. We establish that both the edge and vertex deletion variants of the problem are .-hard. This stands in contrast to the fact that deleting edges to obtain a forest or a tree is equivalent to th作者: 美食家 時間: 2025-4-1 09:21
Sensitivity, Affine Transforms and Quantum Communication Complexity,ansforms and show several applications. For a function ., and . for . and ., the result of the transformation . is defined as ...As a warm up, we study alternation under linear shifts (when . is restricted to be the identity matrix) called the . (the smallest alternation that can be achieved for the作者: 下船 時間: 2025-4-1 13:31 作者: Benzodiazepines 時間: 2025-4-1 14:30
Interactive Physical Zero-Knowledge Proof for Norinori,tain exactly two black cells, and every black cell shares an edge with exactly one other black cell. We propose a secure interactive physical algorithm, relying only on cards, to realize a zero-knowledge proof of knowledge for Norinori. It allows a player to show that he or she knows a solution with
