Skip to main content

previous disabled Page of 2
and
  1. No Access

    Chapter and Conference Paper

    Sparsity in Covering Solutions

    In the classical covering problems, the goal is to find a subset of vertices/edges that “covers” a specific structure of the graph. In this work, we initiate the study of the covering problems where given a gr...

    Pallavi Jain, Manveer Singh Rathore in LATIN 2024: Theoretical Informatics (2024)

  2. No Access

    Chapter and Conference Paper

    Max-SAT with Cardinality Constraint Parameterized by the Number of Clauses

    Max-SAT with cardinality constraint (CC-Max-SAT) is one of the classical NP-complete problems. In this problem, given a CNF-formula $$\varPhi ...

    Pallavi Jain, Lawqueen Kanesh, Fahad Panolan in LATIN 2024: Theoretical Informatics (2024)

  3. No Access

    Chapter

    Solid and Liquid Waste Management in Urban and Rural Areas: Current Practices and Future Perspectives

    Solid and liquid waste management is critical to environmental sustainability and public health in urban and rural areas. This chapter overviews the various techniques and applications employed in managing was...

    Anirudh Pratap Singh Raman, Mohd Aslam, Prashant Singh in Integrated Waste Management (2024)

  4. No Access

    Chapter and Conference Paper

    More Effort Towards Multiagent Knapsack

    In this paper, we study two multiagent variants of the knapsack problem. Fluschnik et al. [AAAI 2019] studied the model in which each agent expresses its preference by assigning a utility to every item. They s...

    Sushmita Gupta, Pallavi Jain in SOFSEM 2023: Theory and Practice of Comput… (2023)

  5. No Access

    Chapter and Conference Paper

    Preserving Consistency for Liquid Knapsack Voting

    Liquid Democracy (LD) uses transitive delegations to facilitate joint decision making. In its simplest form, it is used for binary decisions, however its promise holds also for more advanced voting settings. H...

    Pallavi Jain, Krzysztof Sornat, Nimrod Talmon in Multi-Agent Systems (2022)

  6. No Access

    Chapter

    Carbon Dioxide Conversion to Useful Chemicals and its Thermodynamics

    Carbon dioxide (CO2) utilization was well-practiced through chemical processes to produce useful chemicals, such as syngas (H2/CO), hydrogen (H2), methane (CH4), methanol (MeOH), ethanol (EtOH), dimethyl ether (D...

    Pallavi Jain, A. Geetha Bhavani in Carbon Dioxide Utilization to Sustainable … (2022)

  7. No Access

    Chapter

    Fundamental of Aerobic and Anaerobic Processes in Dye Wastewater

    One of the critical challenges of the textile industry is the removal and degradation of dyes. While designing a wastewater treatment plant, the design, environment, and toxicity concerns associated with relea...

    Pallavi Jain, A. Geetha Bhavani in Biological Approaches in Dye-Containing Wa… (2022)

  8. No Access

    Chapter

    Fundamental of Advanced Oxidation Processes

    Today’s most concerning situation is wastewater releasing from printing, dyeing, and textile industries. It contains reactive dye residuals, harmful chemicals, and many inorganic and organic pollutants. Pre-tr...

    Pallavi Jain, Prashant Singh in Advanced Oxidation Processes in Dye-Contai… (2022)

  9. No Access

    Chapter and Conference Paper

    Gehrlein Stable Committee with Multi-modal Preferences

    Inspired by Gehrlein stability in multiwinner election, in this paper, we define several notions of stability that are applicable in multiwinner elections with multimodal preferences, a model recently proposed...

    Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy in Algorithmic Game Theory (2022)

  10. No Access

    Chapter

    Composition and Arrangement of Carbon-Derived Membranes for Purifying Wastewater

    Wastewater can be treated in many ways, out of which membrane separation technology is considered the most effective and unique one. Especially, carbon nanotubes (CNTs)-based membranes are getting noteworthy a...

    Ritu Painuli, Pallavi Jain, Sapna Raghav in Environmental Remediation Through Carbon B… (2021)

  11. No Access

    Chapter and Conference Paper

    Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms

    This paper studies gerrymandering on graphs from a computational viewpoint (introduced by Cohen-Zemach et al. [AAMAS 2018] and continued by Ito et al. [AAMAS 2019]). Our contributions are two-fold: conceptual and...

    Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy in Algorithmic Game Theory (2021)

  12. No Access

    Chapter

    Waterborne Polyurethanes Additive Technologies

    Waterborne polyurathenes (WBPUs) possess flexible properties and are environmentally friendly, these properties of WBPUs have attracted growing interest in an extensive range of industrial applications. While ...

    Pallavi Jain, Sapna Raghav in Sustainable Production and Applications of… (2021)

  13. No Access

    Chapter and Conference Paper

    Parameterized Complexity of d-Hitting Set with Quotas

    In this paper we study a variant of the classic d -Hitting Set problem with lower and upper capacity constraints, say A and B, respectively. The input to the problem consists of a universe U, a set family, ...

    Sushmita Gupta, Pallavi Jain, Aditya Petety in SOFSEM 2021: Theory and Practice of Comput… (2021)

  14. No Access

    Chapter and Conference Paper

    Circumventing Connectivity for Kernelization

    Classical vertex subset problems demanding connectivity are of the following form: given an input graph G on n vertices and an integer k, find a set S of at most k vertices that satisfies a property and G[S] is c...

    Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy in Algorithms and Complexity (2021)

  15. No Access

    Chapter

    The Role of Carbon Nanocomposite Membranes for Water and Wastewater Treatment

    The water pollution is greatest global concerns due to contamination of environmental factors, which is rising day by day. To remove the pollutants from the water and wastewater is a challenging task, and the ...

    Sapna Raghav, Pallavi Jain, Ritu Painuli in Environmental Remediation Through Carbon B… (2021)

  16. No Access

    Chapter and Conference Paper

    Vertex Deletion on Split Graphs: Beyond 4-Hitting Set

    In vertex deletion problems on graphs, the task is to find a set of minimum number of vertices whose deletion results in a graph with some specific property. The class of vertex deletion problems contains seve...

    Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot in Algorithms and Complexity (2019)

  17. No Access

    Chapter and Conference Paper

    Quadratic Vertex Kernel for Split Vertex Deletion

    A graph is called a split graph if its vertex set can be partitioned into a clique and an independent set. Split graphs have rich mathematical structure and interesting algorithmic properties making it one of ...

    Akanksha Agrawal, Sushmita Gupta, Pallavi Jain, R. Krithika in Algorithms and Complexity (2019)

  18. No Access

    Chapter and Conference Paper

    List Colouring of Graphs Using a Genetic Algorithm

    The List Colouring Problem (LCP) is an NP-Hard optimization problem in which the goal is to find a proper list colouring of a graph G = (V, E) such that the number of colours used is minimized. This paper deals w...

    Aditi Khandelwal, Pallavi Jain, Gur Saran in Smart Computing and Informatics (2018)

  19. No Access

    Chapter and Conference Paper

    Hitting and Covering Partially

    d-Hitting Set and d-Set Cover are among the classical NP-hard problems. In this paper, we study variants of d-Hitting Set and d-Set Cover, which are called Partial d -Hitting Set (Partial

    Akanksha Agrawal, Pratibha Choudhary, Pallavi Jain in Computing and Combinatorics (2018)

  20. No Access

    Chapter and Conference Paper

    Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

    Let \(\mathrm{\Pi }\) be a family of graphs. In the classical

    Pallavi Jain, Lawqueen Kanesh in Computer Science – Theory and Applications (2018)

previous disabled Page of 2