# Browsing Computer Science and Engineering by Title

Sort by: Order: Results:

• (Elsevier, 2018-05)
In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...
• (Cornell University Library, 2017-09)
In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...
• (2019-07-01)
• (Elsevier, 2020-10)
• (Cornell University Library, 2017-08)
Consider a graph G=(V,E) and a coloring c of vertices with colors from [ℓ]. A vertex v is said to be happy with respect to c if c(v)=c(u) for all neighbors u of v. Further, an edge (u,v) is happy if c(u)=c(v). Given a ...
• (2018-07-16)
• (Elsevier, 2019-04)
Approval voting provides an opportunity for the agents to make a comment about every candidate, without incurring the overhead of determining a full ranking on the entire set of candidates. This makes approval voting a ...
• (2017-05-08)
• (2020-06-08)
• (Cornell University Library, 2020-05)
We consider the problem of protecting and manipulating elections by recounting and changing ballots, respectively. Our setting involves a plurality-based election held across multiple districts, and the problem formulations ...
• (Cornell University Library, 2019-05)
We study the parameterized complexity of the optimal defense and optimal attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a set of votes) and two integers \$k_a\$ and ...
• (2019-08-10)
• (Elsevier, 2021-06)
We study the parameterized complexity of the Optimal Defense and Optimal Attack problems in voting. In both the problems, the input is a set of voter groups (every voter group is a district consisting of a set of votes) ...
• (2017-05-15)
• (Elsevier, 2022-06)
Optimization of the fermentation process for recombinant protein production (RPP) is often resource-intensive. Machine learning (ML) approaches are helpful in minimizing the experimentations and find vast applications in ...
• (IOS Press, 2021-06)
• (Indian Institute of Technology Gandhinagar, 2019)
• (Cornell University Library, 2020-04)
• (Cornell University Library, 2019-11)
India loses 35% of the annual crop yield due to plant diseases. Early detection of plant diseases remains difficult due to the lack of lab infrastructure and expertise. In this paper, we explore the possibility of computer ...
• (2020-01-05)