Parameterized Complexity of Conflict-Free Matchings and Paths. | Zendy

AI Assistant Blog Pricing

Open Access

Parameterized Complexity of Conflict-Free Matchings and Paths.

Author(s) -

Akanksha Agrawal,

Pallavi Jain,

Lawqueen Kanesh,

Saket Saurabh

Publication year - 2019

Language(s) - English

DOI - 10.4230/lipics.mfcs.2019.35

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Our institutional solutions Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.