Pavel Podlipyan

According to our database, Pavel Podlipyan authored at least 7 papers between 2016 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Efficient parallel algorithms for parameterized problems.

Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan

Theor. Comput. Sci., 2019

2017

Local algorithms for the continuous gathering problem

Pavel Podlipyan

PhD thesis, 2017

Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity.

Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan

Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

A Continuous Strategy for Collisionless Gathering.

Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan

Proceedings of the Algorithms for Sensor Systems, 2017

2016

The Monotone Circuit Value Problem with Bounded Genus Is in NC.

Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

On the Parameterized Parallel Complexity and the Vertex Cover Problem.

Faisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan

Proceedings of the Combinatorial Optimization and Applications, 2016

The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.

Shouwei Li, Friedhelm Meyer auf der Heide, Pavel Podlipyan

Proceedings of the Algorithms for Sensor Systems, 2016