Suchergebnisse: Verfasser :: Library Catalog

1

Double Exponential Lower Bound for Telephone Broadcast von Tale, Prafullkumar

Veröffentlicht 2024

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
2

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number von Tale, Prafullkumar

Veröffentlicht 2025

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
3

A Finer View of the Parameterized Landscape of Labeled Graph Contractions von Mathur, Yashaswini, Tale, Prafullkumar

Veröffentlicht 2025

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
4

The Complexity of Contracting Bipartite Graphs into Small Cycles von Krithika, R., Sharma, Roohani, Tale, Prafullkumar

Veröffentlicht 2022

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
5

A Single Exponential-Time FPT Algorithm for Cactus Contraction von Krithika, R., Misra, Pranabendu, Tale, Prafullkumar

Veröffentlicht 2025

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
6

Revisiting Token Sliding on Chordal Graphs von Adak, Rajat, Nanoti, Saraswati Girish, Tale, Prafullkumar

Veröffentlicht 2025

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
7

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover von Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar

Veröffentlicht 2024

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
8

Revisiting Path Contraction and Cycle Contraction von Krithika, R., Malu, V. K. Kutty, Tale, Prafullkumar

Veröffentlicht 2024

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
9

Structural Parameterization of Locating-Dominating Set and Test Cover von Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar

Veröffentlicht 2024

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
10

The Parameterized Complexity of Computing the VC-Dimension von Foucaud, Florent, Gahlawat, Harmender, Inerney, Fionn Mc, Tale, Prafullkumar

Veröffentlicht 2025

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
11

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction von Krithika, R., Malu, V. K. Kutty, Sharma, Roohani, Tale, Prafullkumar

Veröffentlicht 2023

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
12

Parameterized complexity of isometric path partition: treewidth and diameter von Chakraborty, Dibyayan, Defrain, Oscar, Foucaud, Florent, Mari, Mathieu, Tale, Prafullkumar

Veröffentlicht 2025

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
13

Path Contraction Faster than $2^n$ von Agrawal, Akanksha, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, Tale, Prafullkumar

Veröffentlicht 2025

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
14

Conflict and Fairness in Resource Allocation von Bandopadhyay, Susobhan, Banik, Aritra, Gupta, Sushmita, Jain, Pallavi, Sahu, Abhishek, Saurabh, Saket, Tale, Prafullkumar

Veröffentlicht 2024

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
15

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs von Foucaud, Florent, Ghareghani, Narges, Lorieau, Lucas, Mohammad-Noori, Morteza, Oskuei, Rasa Parvini, Tale, Prafullkumar

Veröffentlicht 2026

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
16

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover von Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar

Veröffentlicht 2023

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
17

Metric Dimension and Geodetic Set Parameterized by Vertex Cover von Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar

Veröffentlicht 2024

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:
18

Robust Contraction Decomposition for Minor-Free Graphs and its Applications von Bandyapadhyay, Sayan, Lochet, William, Lokshtanov, Daniel, Marx, Dániel, Misra, Pranabendu, Neuen, Daniel, Saurabh, Saket, Tale, Prafullkumar, Xue, Jie

Veröffentlicht 2024

Volltext

Preprint

Datensatz separat aufrufen
Zu den Favoriten

Gespeichert in:

Key	Value
author	"Tale, Prafullkumar"

Key	Value
language	"de"
ui	"standard"
VUFIND_SESSION	"da862c0fe8507985098d40692b4cc9fd"

Key	Value
__Laminas	array:2 [`"_REQUEST_ACCESS_TIME" => 1785062667.2131 "_VALID" => array:1 [ "Laminas\Session\Validator\Id" => "da862c0fe8507985098d40692b4cc9fd" ]`]
SessionState	Laminas\Stdlib\ArrayObject {#938}
Search	Laminas\Stdlib\ArrayObject {#1278}
FlashMessenger	Laminas\Stdlib\ArrayObject {#1390}
SessionHelper	Laminas\Stdlib\ArrayObject {#1676}

Key	Value
REDIRECT_VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
REDIRECT_HTTPS	"on"
REDIRECT_SSL_TLS_SNI	"info.umar.mx"
REDIRECT_STATUS	"200"
VUFIND_LOCAL_DIR	"/usr/local/vufind/local"
HTTPS	"on"
SSL_TLS_SNI	"info.umar.mx"
HTTP_ACCEPT	"/"
HTTP_USER_AGENT	"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)"
HTTP_COOKIE	"language=de; ui=standard; VUFIND_SESSION=da862c0fe8507985098d40692b4cc9fd"
HTTP_ACCEPT_ENCODING	"gzip, br, zstd, deflate"
HTTP_HOST	"info.umar.mx"
PATH	"/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/snap/bin"
SERVER_SIGNATURE	"<address>Apache/2.4.66 (Ubuntu) Server at info.umar.mx Port 443</address>\n"
SERVER_SOFTWARE	"Apache/2.4.66 (Ubuntu)"
SERVER_NAME	"info.umar.mx"
SERVER_ADDR	"200.23.222.19"
SERVER_PORT	"443"
REMOTE_ADDR	"216.73.216.131"
DOCUMENT_ROOT	"/usr/local/vufind/public"
REQUEST_SCHEME	"https"
CONTEXT_PREFIX	""
CONTEXT_DOCUMENT_ROOT	"/usr/local/vufind/public"
SERVER_ADMIN	"admin@localhost"
SCRIPT_FILENAME	"/usr/local/vufind/public/index.php"
REMOTE_PORT	"56770"
REDIRECT_URL	"/Author/Home"
REDIRECT_QUERY_STRING	"author=Tale%2C+Prafullkumar"
GATEWAY_INTERFACE	"CGI/1.1"
SERVER_PROTOCOL	"HTTP/1.1"
REQUEST_METHOD	"GET"
QUERY_STRING	"author=Tale%2C+Prafullkumar"
REQUEST_URI	"/Author/Home?author=Tale%2C+Prafullkumar"
SCRIPT_NAME	"/index.php"
PHP_SELF	"/index.php"
REQUEST_TIME_FLOAT	1785062667.2041
REQUEST_TIME	1785062667

Key	Value
author	"Tale, Prafullkumar"

Double Exponential Lower Bound for Telephone Broadcast von Tale, Prafullkumar

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number von Tale, Prafullkumar

A Finer View of the Parameterized Landscape of Labeled Graph Contractions von Mathur, Yashaswini, Tale, Prafullkumar

The Complexity of Contracting Bipartite Graphs into Small Cycles von Krithika, R., Sharma, Roohani, Tale, Prafullkumar

A Single Exponential-Time FPT Algorithm for Cactus Contraction von Krithika, R., Misra, Pranabendu, Tale, Prafullkumar

Revisiting Token Sliding on Chordal Graphs von Adak, Rajat, Nanoti, Saraswati Girish, Tale, Prafullkumar

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover von Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar

Revisiting Path Contraction and Cycle Contraction von Krithika, R., Malu, V. K. Kutty, Tale, Prafullkumar

Structural Parameterization of Locating-Dominating Set and Test Cover von Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar

The Parameterized Complexity of Computing the VC-Dimension von Foucaud, Florent, Gahlawat, Harmender, Inerney, Fionn Mc, Tale, Prafullkumar

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction von Krithika, R., Malu, V. K. Kutty, Sharma, Roohani, Tale, Prafullkumar

Parameterized complexity of isometric path partition: treewidth and diameter von Chakraborty, Dibyayan, Defrain, Oscar, Foucaud, Florent, Mari, Mathieu, Tale, Prafullkumar

Path Contraction Faster than $2^n$ von Agrawal, Akanksha, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, Tale, Prafullkumar

Conflict and Fairness in Resource Allocation von Bandopadhyay, Susobhan, Banik, Aritra, Gupta, Sushmita, Jain, Pallavi, Sahu, Abhishek, Saurabh, Saket, Tale, Prafullkumar

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs von Foucaud, Florent, Ghareghani, Narges, Lorieau, Lucas, Mohammad-Noori, Morteza, Oskuei, Rasa Parvini, Tale, Prafullkumar

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover von Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar

Metric Dimension and Geodetic Set Parameterized by Vertex Cover von Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar

Robust Contraction Decomposition for Minor-Free Graphs and its Applications von Bandyapadhyay, Sayan, Lochet, William, Lokshtanov, Daniel, Marx, Dániel, Misra, Pranabendu, Neuen, Daniel, Saurabh, Saket, Tale, Prafullkumar, Xue, Jie

Environment & details:

Environment & details:

Suchergebnisse - Tale, Prafullkumar

Double Exponential Lower Bound for Telephone Broadcast von Tale, Prafullkumar

Geodetic Set on Graphs of Constant Pathwidth and Feedback Vertex Set Number von Tale, Prafullkumar

A Finer View of the Parameterized Landscape of Labeled Graph Contractions von Mathur, Yashaswini, Tale, Prafullkumar

The Complexity of Contracting Bipartite Graphs into Small Cycles von Krithika, R., Sharma, Roohani, Tale, Prafullkumar

A Single Exponential-Time FPT Algorithm for Cactus Contraction von Krithika, R., Misra, Pranabendu, Tale, Prafullkumar

Revisiting Token Sliding on Chordal Graphs von Adak, Rajat, Nanoti, Saraswati Girish, Tale, Prafullkumar

Tight (Double) Exponential Bounds for Identification Problems: Locating-Dominating Set and Test Cover von Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar

Revisiting Path Contraction and Cycle Contraction von Krithika, R., Malu, V. K. Kutty, Tale, Prafullkumar

Structural Parameterization of Locating-Dominating Set and Test Cover von Chakraborty, Dipayan, Foucaud, Florent, Majumdar, Diptapriyo, Tale, Prafullkumar

The Parameterized Complexity of Computing the VC-Dimension von Foucaud, Florent, Gahlawat, Harmender, Inerney, Fionn Mc, Tale, Prafullkumar

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction von Krithika, R., Malu, V. K. Kutty, Sharma, Roohani, Tale, Prafullkumar

Parameterized complexity of isometric path partition: treewidth and diameter von Chakraborty, Dibyayan, Defrain, Oscar, Foucaud, Florent, Mari, Mathieu, Tale, Prafullkumar

Path Contraction Faster than $2^n$ von Agrawal, Akanksha, Fomin, Fedor V., Lokshtanov, Daniel, Saurabh, Saket, Tale, Prafullkumar

Conflict and Fairness in Resource Allocation von Bandopadhyay, Susobhan, Banik, Aritra, Gupta, Sushmita, Jain, Pallavi, Sahu, Abhishek, Saurabh, Saket, Tale, Prafullkumar

Algorithms and Hardness for Geodetic Set on Tree-like Digraphs von Foucaud, Florent, Ghareghani, Narges, Lorieau, Lucas, Mohammad-Noori, Morteza, Oskuei, Rasa Parvini, Tale, Prafullkumar

Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover von Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar

Metric Dimension and Geodetic Set Parameterized by Vertex Cover von Foucaud, Florent, Galby, Esther, Khazaliya, Liana, Li, Shaohua, Inerney, Fionn Mc, Sharma, Roohani, Tale, Prafullkumar

Robust Contraction Decomposition for Minor-Free Graphs and its Applications von Bandyapadhyay, Sayan, Lochet, William, Lokshtanov, Daniel, Marx, Dániel, Misra, Pranabendu, Neuen, Daniel, Saurabh, Saket, Tale, Prafullkumar, Xue, Jie

Suchwerkzeuge:

Environment & details:

Environment & details: